Monitoring edge-geodetic sets in graphs

Authors: Dev, Subhadeep, Dey, Sanjana, Foucaud, Florent, Narayanan, Krishna, Sulochana, Lekshmi Ramasubramony

Contributors: Foucaud, Florent

Source: Discrete Applied Mathematics. 377:598-610

Subject Terms: Edge-geodetic set, [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], Monitoring, Combinatorics, Feedback edge set, 0202 electrical engineering, electronic engineering, information engineering, FOS: Mathematics, [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], 0102 computer and information sciences, 02 engineering and technology, Combinatorics (math.CO), 01 natural sciences, NP-completeness

File Description: application/pdf

Access URL: http://arxiv.org/abs/2210.03774

Soft-ECM: An extension of Evidential C-Means for complex data

Authors: Soubeiga, Armel, Guyet, Thomas, Antoine, Violaine

Contributors: Guyet, Thomas

Source: 2025 IEEE International Conference on Fuzzy Systems (FUZZ). :1-6

Subject Terms: [INFO.INFO-AI] Computer Science [cs]/Artificial Intelligence [cs.AI], Machine Learning, FOS: Computer and information sciences, [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], Artificial Intelligence (cs.AI), Discrete Mathematics (cs.DM), [SDV.SPEE] Life Sciences [q-bio]/Santé publique et épidémiologie, Artificial Intelligence, Discrete Mathematics, Machine Learning (cs.LG)

File Description: application/pdf

Access URL: http://arxiv.org/abs/2507.13417
https://inria.hal.science/hal-05162452v1

An overview on simple P systems with specific variants of derivation modes

Authors: Alhazov, Artiom, Freund, Rudolf, Ivanov, Sergiu, Verlan, Sergey

Contributors: Davesne, Frédéric

Source: Journal of Membrane Computing. 7:326-340

Subject Terms: [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], ET0L systems, P systems, Computational completeness, Derivation modes, Prescribed teams, Regular sets

Access URL: https://univ-evry.hal.science/hal-05195631v1
https://doi.org/10.1007/s41965-025-00198-9

Bounds and extremal graphs for monitoring edge-geodetic sets in graphs

Authors: Foucaud, Florent, Marcille, Clara, Myint, Zin Mar, Sandeep, R.B., Sen, Sagnik, Taruni, S.

Contributors: Foucaud, Florent

Source: Discrete Applied Mathematics. 366:106-119

Subject Terms: Monitoring edge geodetic set, FOS: Computer and information sciences, [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], Girth, Discrete Mathematics (cs.DM), FOS: Mathematics, Geodetic set, Subdivisions, Chromatic number, Mathematics - Combinatorics, k-clique sum, Combinatorics (math.CO), Computer Science - Discrete Mathematics

File Description: application/pdf

Access URL: http://arxiv.org/abs/2403.09122

Weakly-sparse and strongly flip-flat classes of graphs are uniformly almost-wide

Authors: Ghasemi, Fatemeh, Grange, Julien, Kanté, Mamadou Moustapha, Madelaine, Florent

Contributors: Kanté, Mamadou

Subject Terms: [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], [INFO.INFO-LO] Computer Science [cs]/Logic in Computer Science [cs.LO], Almost-wide, Flip-flatness

Access URL: https://hal.science/hal-05332862v1

Probability-graphons: Limits of large dense weighted graphs

Authors: Abraham, Romain, Delmas, Jean-François, Weibel, Julien

Contributors: Abraham, Romain

Source: Innovations in Graph Theory. 2:25-117

Subject Terms: FOS: Computer and information sciences, [MATH.MATH-PR] Mathematics [math]/Probability [math.PR], Graphons, Discrete Mathematics (cs.DM), Probability (math.PR), Dense graph limits, Stochastic networks, Decorated graphs, [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], Probability-graphons, FOS: Mathematics, Weighted graphs, Mathematics - Probability, Random graphs, Computer Science - Discrete Mathematics

File Description: application/pdf

Access URL: http://arxiv.org/abs/2312.15935
https://hal.science/hal-04361443v1/document
https://hal.science/hal-04361443v1
https://doi.org/10.5802/igt.7

Tridendriform algebras on hypergraph polytopes

Authors: Curien, Pierre-Louis, Delcroix-Oger, Bérénice, Obradović, Jovana

Contributors: Delcroix-Oger, Bérénice

Source: Algebraic Combinatorics. 8:201-234

Subject Terms: Nestohedra, Polydendriform structure, [MATH.MATH-GM] Mathematics [math]/General Mathematics [math.GM], 01 natural sciences, [MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO], [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], FOS: Mathematics, 18M60, 52B05, Hypergraph polytopes, Mathematics - Combinatorics, Shuffle product, Combinatorics (math.CO), 0101 mathematics, Associative product, Tridendriform structure

File Description: application/pdf

Access URL: http://arxiv.org/abs/2201.05365
https://hal.science/hal-03525971v3
https://hal.science/hal-03525971v3/document

The combinatorics of Motzkin polyominoes

Authors: Baril, Jean-Luc, Kirgizov, Sergey, Ramírez, José, Villamizar, Diego

Contributors: Kirgizov, Sergey

Source: Discrete Applied Mathematics. 364:1-15

Subject Terms: [MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO], FOS: Computer and information sciences, Motzkin word, [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], Discrete Mathematics (cs.DM), Bijections, FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), Generating function, Computer Science - Discrete Mathematics

Access URL: http://arxiv.org/abs/2401.06228

Odd Paths, Cycles, and \(T\)-Joins: Connections and Algorithms

Authors: Ildikó Schlotter, András Sebő

Contributors: Optimisation Combinatoire (G-SCOP_OC), Laboratoire des sciences pour la conception, l'optimisation et la production (G-SCOP), Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP), Université Grenoble Alpes (UGA)-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP), Université Grenoble Alpes (UGA)

Source: SIAM Journal on Discrete Mathematics. 39:484-504

Subject Terms: FOS: Computer and information sciences, 68Q17 (Primary) 05C85, 05C12, 68R10, 68Q25 (Secondary), G.2.1, G.2.2, 0102 computer and information sciences, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], Computational Complexity (cs.CC), F.2.2, 01 natural sciences, Computer Science - Computational Complexity, [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO], FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO)

Access URL: http://arxiv.org/abs/2211.12862

An asymptotically optimal algorithm for generating bin cardinalities

Authors: Devroye, Luc, Los, Dimitrios

Contributors: Los, Dimitrios

Source: Mathematics and Computers in Simulation. 228:147-155

Subject Terms: FOS: Computer and information sciences, [MATH.MATH-PR] Mathematics [math]/Probability [math.PR], 65C10, 60C05, 11K45, 68W20, 68U20, 68W27, 68W40, Discrete Mathematics (cs.DM), Poissonization, Power of two choices, G.3, [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], G.2.m, [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], Multinomial distribution, Hashing, F.2.2, Computer Science - Data Structures and Algorithms, Balls-into-bins, Data Structures and Algorithms (cs.DS), Balanced allocations, Expected time analysis, Random variate generation, Simulation, Computer Science - Discrete Mathematics

Access URL: http://arxiv.org/abs/2404.07011

On the [r, s, t]-coloring of the square of cylindrical grids

Authors: Effantin, Brice

Contributors: JARDIN, Nicolas

Source: Discrete Mathematics Letters, Vol 15, Pp 15-22 (2025)

Subject Terms: [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], total coloring, vertex coloring, QA1-939, cartesian product, edge coloring, Mathematics

File Description: application/pdf

Access URL: https://doaj.org/article/0e0afada48ac4b7c8c541dca969fe876

Helly groups

Authors: Chalopin, Jérémie, Chepoi, Victor, Genevois, Anthony, Hiroshi, Hirai, Osajda, Damian

Contributors: Chepoi, Victor

Source: Geometry & Topology. 29:1-70

Subject Terms: [MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO], [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], [INFO.INFO-CG] Computer Science [cs]/Computational Geometry [cs.CG], FOS: Mathematics, Mathematics - Combinatorics, [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], [MATH.MATH-MG] Mathematics [math]/Metric Geometry [math.MG], Group Theory (math.GR), Combinatorics (math.CO), 0101 mathematics, Mathematics - Group Theory, 01 natural sciences

File Description: application/pdf

Access URL: http://arxiv.org/abs/2002.06895

Endhered Patterns in Matchings and RNA

Authors: Célia Biane, Greg Hampikian, Sergey Kirgizov, Khaydar Nurligareev

Contributors: Kirgizov, Sergey

Source: Journal of Computational Biology. 32:28-46

Subject Terms: [MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO], FOS: Computer and information sciences, [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], Quantitative Biology - Biomolecules, Discrete Mathematics (cs.DM), FOS: Biological sciences, FOS: Mathematics, Mathematics - Combinatorics, Biomolecules (q-bio.BM), Combinatorics (math.CO), [INFO.INFO-BI] Computer Science [cs]/Bioinformatics [q-bio.QM], Computer Science - Discrete Mathematics

File Description: application/pdf

Access URL: https://pubmed.ncbi.nlm.nih.gov/39714916
http://arxiv.org/abs/2404.18802
https://hal.science/hal-04563757v2
https://hal.science/hal-04563757v2/document

Reconfiguration of Digraph Homomorphisms

Authors: Lévêque, Benjamin, Mühlenthaler, Moritz, Suzan, Thomas

Contributors: Benjamin Lévêque and Moritz Mühlenthaler and Thomas Suzan, Optimisation Combinatoire (G-SCOP_OC), Laboratoire des sciences pour la conception, l'optimisation et la production (G-SCOP), Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP), Université Grenoble Alpes (UGA)-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP), Université Grenoble Alpes (UGA)

Source: SIAM Journal on Discrete Mathematics. 39:327-360

Subject Terms: FOS: Computer and information sciences, Combinatorial Reconfiguration, Discrete Mathematics (cs.DM), [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], Digraph Homomorphisms, 0102 computer and information sciences, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], 01 natural sciences, Computer Science - Data Structures and Algorithms, FOS: Mathematics, Mathematics - Combinatorics, Data Structures and Algorithms (cs.DS), Combinatorics (math.CO), ddc:004, Computer Science - Discrete Mathematics

File Description: application/pdf

Access URL: http://arxiv.org/abs/2205.09210
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2023.43

Benefits of Hypergraphs for Density-Based Clustering

Authors: Hauseux, Louis, Avrachenkov, Konstantin, Zerubia, Josiane

Contributors: Hauseux, Louis

Source: 2024 32nd European Signal Processing Conference (EUSIPCO). :2302-2306

Subject Terms: percolation, [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], hypergraphs, [INFO.INFO-TS] Computer Science [cs]/Signal and Image Processing, geometric graphs, density estimator, [INFO] Computer Science [cs], hierarchical clustering

File Description: application/pdf

Optimal Adjacency Labels for Subgraphs of Cartesian Products

Authors: Louis Esperet, Nathaniel Harms, Viktor Zamaraev

Contributors: Louis Esperet and Nathaniel Harms and Viktor Zamaraev, Optimisation Combinatoire (G-SCOP_OC), Laboratoire des sciences pour la conception, l'optimisation et la production (G-SCOP), Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP), Université Grenoble Alpes (UGA)-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP), Université Grenoble Alpes (UGA), University of Waterloo Waterloo, University of Liverpool, ANR-16-CE40-0009,GATO,Graphes, Algorithmes et TOpologie(2016), ANR-18-CE40-0032,GrR,Reconfiguration de Graphes(2018), ANR-21-CE48-0014,TWIN-WIDTH,Twin-width: théorie et applications(2021), ANR-11-LABX-0025,PERSYVAL-lab,Systemes et Algorithmes Pervasifs au confluent des mondes physique et numérique(2011)

Source: SIAM Journal on Discrete Mathematics. 38:2181-2193

Subject Terms: FOS: Computer and information sciences, Adjacency labeling schemes, 0102 computer and information sciences, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], 01 natural sciences, 05C78, 05C76, 68R10, [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO], Computer Science - Data Structures and Algorithms, Cartesian product, FOS: Mathematics, Mathematics - Combinatorics, Data Structures and Algorithms (cs.DS), Combinatorics (math.CO), ddc:004, 0101 mathematics, Hypercubes

File Description: application/pdf

Access URL: http://arxiv.org/abs/2206.02872
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.57

An Improved Drift Theorem for Balanced Allocations

Authors: Dimitrios Los, Thomas Sauerwald

Contributors: Los, Dimitrios

Source: ACM Transactions on Algorithms. 20:1-39

Subject Terms: FOS: Computer and information sciences, Heavily loaded case, [MATH.MATH-PR] Mathematics [math]/Probability [math.PR], Discrete Mathematics (cs.DM), Power of two choices, G.3, Gap bounds, [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], 0102 computer and information sciences, G.2.m, 01 natural sciences, Potential functions, Drift theorem, Memory, FOS: Mathematics, 68W20, 68W27, 68W40, 60C05, Balanced allocations, Probability (math.PR), [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], F.2.2, Balls-into-bins, Maximum load, Random allocations, Weighted balls, Mathematics - Probability, Computer Science - Discrete Mathematics

Access URL: http://arxiv.org/abs/2308.11083
https://hal.science/hal-04889279v1
https://doi.org/10.1145/3673900

The complexity of 2-intersection graphs of 3-hypergraphs recognition for claw-free graphs and triangulated claw-free graphs

Authors: Di Marco, N., Frosini, A., Picouleau, C.

Contributors: Picouleau, Christophe

Source: Discrete Applied Mathematics. 355:232-246

Subject Terms: [MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO], [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], Uniform hypergraph, Intersection graph, Triangulated graph, NP-complete, 0202 electrical engineering, electronic engineering, information engineering, FOS: Mathematics, Mathematics - Combinatorics, 0102 computer and information sciences, 02 engineering and technology, Combinatorics (math.CO), 01 natural sciences

File Description: application/pdf

Access URL: http://arxiv.org/abs/2305.13932
https://hal.science/hal-04576670v1
https://doi.org/10.1016/j.dam.2024.05.009

On Graphs Coverable by \({k}\) Shortest Paths

Authors: Dumas, Maël, Foucaud, Florent, Perez, Anthony, Todinca, Ioan

Contributors: Perez, Anthony, Maël Dumas and Florent Foucaud and Anthony Perez and Ioan Todinca, Foucaud, Florent

Source: SIAM Journal on Discrete Mathematics. 38:1840-1862

Subject Terms: FOS: Computer and information sciences, Computational Complexity, covering problems, Data Structures and Algorithms, Discrete Mathematics (cs.DM), Discrete Mathematics, Shortest paths, 0211 other engineering and technologies, [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], 0102 computer and information sciences, 02 engineering and technology, Computational Complexity (cs.CC), 15. Life on land, 01 natural sciences, 7. Clean energy, [MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO], [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], Combinatorics, FOS: Mathematics, Data Structures and Algorithms (cs.DS), Combinatorics (math.CO), ddc:004, parameterized complexity

File Description: application/pdf

Access URL: http://arxiv.org/abs/2206.15088
https://hal.science/hal-03895886v1
https://doi.org/10.4230/lipics.isaac.2022.40
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2022.40

The Anchor-Robust Project Scheduling Problem

Authors: Pascale Bendotti, Philippe Chrétienne, Pierre Fouilhoux, Adèle Pass-Lanneau

Contributors: Pass-Lanneau, Adèle, Optimisation, Simulation, Risque et Statistiques pour les Marchés de l’Energie (EDF R&D OSIRIS), EDF R&D (EDF R&D), EDF (EDF)-EDF (EDF), Recherche Opérationnelle (RO), LIP6, Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS)-Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS), Laboratoire d'Informatique de Paris-Nord (LIPN), Centre National de la Recherche Scientifique (CNRS)-Université Sorbonne Paris Nord

Source: Operations Research. 71:2267-2290

Subject Terms: anchored decisions, rescheduling, 0211 other engineering and technologies, robust optimization, 0102 computer and information sciences, 02 engineering and technology, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [INFO] Computer Science [cs], 01 natural sciences, [INFO.INFO-RO] Computer Science [cs]/Operations Research [math.OC], [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], [INFO.INFO-RO]Computer Science [cs]/Operations Research [math.OC], Project scheduling

File Description: application/pdf

Access URL: https://hal.science/hal-02990583v1