Theme Algorithmics, Graphs, Complexity

Presentation

The main research areas of the team can be classified into two parts : (1) structural graph/lattice theory and the consequences in algorithmics, and (2) algorithmic geometry with a main focus on discrete convexity.

It is usual when studying discrete objects to follow the advice of Descartes, namely divide and conquer, i.e., define operators on discrete objects and decompose with respect to these operators in order to explain their inherent complexity. The team has a strong expertise in studying structural graph/lattice theory through the lens of graph/lattice decompositions and their applications in several algorithmic questions and in combinatorics. Some examples of graph decompositions studied in this group are tree-decomposition, rank-decomposition and understanding when the associated width measures are bounded in some graph classes, and also decompositions based on cut set such as clique and stable-cut set and skew partitions with applications in colouring graphs. Some examples of decompositions in lattices are recursive constructions based on copying convex sets or based on colored posets. Some other applications of the studied decompositions can be:

  • Listing problems in (hyper)graphs and lattices. We have a strong expertise in the listing of vertex subsets of a hypergraph satisfying a property. We have, for instance, and proved that the listing of minimal dominating sets is equivalent to the well-known Hypergraph Dualisation problem. 
  • Representation of lattices and efficient algorithms on lattices. This question is mainly studied with respect to the Lattice Dualisation problem, a particular case of which is the Hypergraph Dualisation Problem. 
  • Optimisation problems in (hyper)graphs. Studied problems include, but are not limited to, colouring problems, graph identification problems, homomorphism questions, etc. We are mostly interested in obtaining either tight bounds on some parameters such as chromatic number or identifying codes, or tight time complexities parametrised by complexity measures. 
  • Packing and covering problems such as Erdös-Posa functions. 

The main interests in algorithmic geometry deal with computational aspects in digital/discrete geometry such as the computation of convex hulls in digitall euclidean spaces. The members are experts in designing heuristics for obtaining competetive algorithms for computing (approximate) convex hulls for various configurations of points in the 2D euclidean space (many of such problems are NP-hard ones). Members often participate to the CG:SHOP challenge, organised during SoCG conference, and win the 2021 edition which were about the coordinated robot motion planning.

Keywords: graph theory; graph complexity parameters; graph decompositions; algorithmic lattice theory; algorithmic geometry; discrete convexity; listing/enumerating algorithms;

Last publications

Oscar Defrain, Jean-Florent Raymond - May 1, 2024
Sparse graphs without long induced paths
Journal of Combinatorial Theory, Series B

Florent Foucaud, Narges Ghareghani, Pouyeh Sharifani - April 15, 2024
Extremal digraphs for open neighbourhood location-domination and identifying codes
Discrete Applied Mathematics

Laurent Beaudou, Caroline Brosse, Oscar Defrain, Florent Foucaud, Aurélie Lagoutte, Vincent Limouzy, Lucas Pastor - April 2, 2024
Connected greedy colourings of perfect graphs and other classes: the good, the bad and the ugly
Discrete Mathematics and Theoretical Computer Science

Guilherme da Fonseca, Yan Gerard, Bastien Rivier - March 18, 2024
Short Flip Sequences to Untangle Segments in the Plane ⋆
WALCOM 2024

Caroline Brosse, Aurélie Lagoutte, Vincent Limouzy, Arnaud Mary, Lucas Pastor - March 15, 2024
Efficient enumeration of maximal split subgraphs and induced sub-cographs and related classes
Discrete Applied Mathematics

Florent Foucaud, Pierre-Marie Marcille, Zin Mar Myint, R B Sandeep, Sagnik Sen, S Taruni - March 7, 2024
Bounds and extremal graphs for monitoring edge-geodetic sets in graphs


Jan Bok, Antoine Dailly, Tuomo Lehtilä - Feb. 26, 2024
Resolving Sets in Temporal Graphs


Kyle Burke, Antoine Dailly, Nacim Oijid - Feb. 23, 2024
Complexity and algorithms for Arc-Kayles and Non-Disconnecting Arc-Kayles


Antoine Dailly, Pascal Lafourcade, Gael Marcadet - Feb. 23, 2024
How did they design this game? Swish: complexity and unplayable positions


Florent Foucaud, Pierre-Marie Marcille, Zin Mar Myint, R. B. Sandeep, Sagnik Sen, S. Taruni - Feb. 15, 2024
Monitoring edge-geodetic sets in graphs: extremal graphs, bounds, complexity
10th International Conference on Algorithms and Discrete Applied Mathematics (CALDAM 2024)

All publications are here