Theme Algorithmics, Graphs, Complexity
Presentation
The AGC team focuses on algorithmic in graphs, lattices and geometry. It involves studying structural properties in order to design efficient algorithms. The main orientations are:
- Enumeration of combinatorial objects in graphs and efficient algorithms for optimization or counting problems.
- Representations of lattices and efficient algorithms for lattices.
- Structures and decompositions of graphs.
- Algorithmic of objects from geometry.
The team is also interested in applications in data mining and data quality.
Last publications
Marthe Bonamy, Oscar Defrain, Meike Hatzel, Jocelyn Thiebaut - Jan. 17, 2020
Avoidable paths in graphs
Rahul Arya, Sunil Arya, Guilherme da Fonseca, David Mount - Jan. 5, 2020
Optimal Bound on the Combinatorial Complexity of Approximating Polytopes
SODA 2020
Benjamin Bergougnoux, Mamadou Moustapha Kanté - Dec. 5, 2019
A Meta-Algorithm for Solving Connectivity and Acyclicity Constraints on Locally Checkable Properties Parameterized by Graph Width Measures
Oscar Defrain, Lhouari Nourine - Nov. 29, 2019
Neighborhood Inclusions for Minimal Dominating Sets Enumeration: Linear and Polynomial Delay Algorithms in P_7-Free and P_8-Free Chordal Graphs
Antoine Dailly, Florent Foucaud, Adriana Hansberg - Nov. 1, 2019
Strengthening the Murty-Simon conjecture on diameter 2 critical graphs
Discrete Mathematics
Farah Dernaika, Nora Cuppens-Boulahia, Frédéric Cuppens, Olivier Raynaud - Aug. 26, 2019
Semantic Mediation for A Posteriori Log Analysis
ARES ’19
Alessio Conte, Roberto Grossi, Mamadou Kanté, Andrea Marino, Takeaki Uno, Kunihiro Wasa - Aug. 26, 2019
Listing Induced Steiner Subgraphs as a Compact Way to Discover Steiner Trees in Graphs
MFCS 2019 - 44th International Symposium on Mathematical Foundations of Computer Science
Marthe Bonamy, Pierre Charbit, Oscar Defrain, Gwénaël Joret, Aurélie Lagoutte, Vincent Limouzy, Lucas Pastor, Jean-Sébastien Sereni - July 26, 2019
Revisiting a theorem by Folkman on graph colouring
Laurent Beaudou, Florent Foucaud, Florent Madelaine, Lhouari Nourine, Gaétan Richard - July 15, 2019
Complexity of Conjunctive Regular Path Query Homomorphisms
Conference on Computability in Europe
Alexandre Bazin, Giacomo Kahn - June 25, 2019
Reduction and Introducer Concepts in d-Dimensional Contexts
International Conference on Formal Concept Analysis
Avoidable paths in graphs
Rahul Arya, Sunil Arya, Guilherme da Fonseca, David Mount - Jan. 5, 2020
Optimal Bound on the Combinatorial Complexity of Approximating Polytopes
SODA 2020
Benjamin Bergougnoux, Mamadou Moustapha Kanté - Dec. 5, 2019
A Meta-Algorithm for Solving Connectivity and Acyclicity Constraints on Locally Checkable Properties Parameterized by Graph Width Measures
Oscar Defrain, Lhouari Nourine - Nov. 29, 2019
Neighborhood Inclusions for Minimal Dominating Sets Enumeration: Linear and Polynomial Delay Algorithms in P_7-Free and P_8-Free Chordal Graphs
Antoine Dailly, Florent Foucaud, Adriana Hansberg - Nov. 1, 2019
Strengthening the Murty-Simon conjecture on diameter 2 critical graphs
Discrete Mathematics
Farah Dernaika, Nora Cuppens-Boulahia, Frédéric Cuppens, Olivier Raynaud - Aug. 26, 2019
Semantic Mediation for A Posteriori Log Analysis
ARES ’19
Alessio Conte, Roberto Grossi, Mamadou Kanté, Andrea Marino, Takeaki Uno, Kunihiro Wasa - Aug. 26, 2019
Listing Induced Steiner Subgraphs as a Compact Way to Discover Steiner Trees in Graphs
MFCS 2019 - 44th International Symposium on Mathematical Foundations of Computer Science
Marthe Bonamy, Pierre Charbit, Oscar Defrain, Gwénaël Joret, Aurélie Lagoutte, Vincent Limouzy, Lucas Pastor, Jean-Sébastien Sereni - July 26, 2019
Revisiting a theorem by Folkman on graph colouring
Laurent Beaudou, Florent Foucaud, Florent Madelaine, Lhouari Nourine, Gaétan Richard - July 15, 2019
Complexity of Conjunctive Regular Path Query Homomorphisms
Conference on Computability in Europe
Alexandre Bazin, Giacomo Kahn - June 25, 2019
Reduction and Introducer Concepts in d-Dimensional Contexts
International Conference on Formal Concept Analysis
All publications are here