The main focus is on structural and algorithmic point of views. The team established expertise includes problems such as finding large cycles in a given graph, graph colorings, covering problems, and extremal graph theory. For example, some team members are particularly interested in Thomassen’s conjecture: Every 4-connected line graph is Hamiltonian. Finding sufficient and computationally tractable conditions for a graph to be Hamiltonian is of significant importance from both theoretical and algorithmic viewpoints as Hamiltonicity is an NP-hard problem.
Generalization of such problems has also been recently considered for edge- or vertex-colored graphs. For example, one may look for properly colored spanning trees in an edge- or a vertex-colored graph. Alternatively, one may look for a dominating set in a vertex colored graph having at least one vertex from each color. Beside their theoretical interest, these extensions have applications in areas including biocomputing and web problems.
Many of the questions we consider can be stated in terms of (integer) linear optimization that is an expertise of new members of the team with research interests focusing on the combinatorial, computational, and geometric aspects of linear optimization. In this regard the aim would be to investigate recent results illustrating the significant interconnection between the most computationally successful algorithms for linear optimization and its generalizations, and the geometric and combinatorial structure of the input. Ideally, the deeper theoretical understanding will ultimately lead to increasingly efficient algorithms. Most of our research collaborations involve French research groups including LaBRI, LIRMM, LIAFA, and LIMOS as well as research groups in Europe, North America, China, Japan, India and South America.
Some recent results on the integer linear programming formulation for the Max-Cut problem
Summary: Given an undirected graph G=(V,E) where the edges are weighted by an arbitrary cost vector c, a cut S in G associated with a node subset S is the edge subset of E which contains all the edges having exactly one end-node in S. The Maximum Cut ...
Maximum Independent Set in H-free graphs
Summary: Maximum Independent Set (MIS) in graphs without a connected H as an induced subgraph (that is, H-free) is NP-complete when H is not a tree with at most one vertex of degree at least 3. For the other graphs H, which are paths and subdivisions of the claw (K_1 ...
Attribution Accessit du prix de thèse 2018 Graphes Charles DELORME
Nous avons le plaisir de vous annoncer que l'étudiant George Manoussakis encadré par Johanne Cohen et Antoine Deza a reçu l'accessit du prix de thèse 2018 Graphes Charles DELORME. http://gtgraphes.labri.fr/pmwiki/pmwiki.php/PrixTheseDelorme/PrixTheseDelorme Voici le résumé de sa thèse : Nous introduisons d'abord ...