index - Algorithmes, Graphes et Combinatoire Access content directly

Research of the AlGCo team is focused on theoretical and algorithmic investigations of classical combinatorial structures: mainly graphs, but also signed graphs, directed graphs, matroids, oriented matroids… Our motivations are fundamental (questions about partitioning, coloring, embedding, isomorphisms, bijections…), algorithmic (notably related to parametrized complexity: fixed-parameter-tractable algorithms, existence of polynomial kernels), or applied in connection with other domains (computational biology, imaging, morphometry, network modelization, data science, artificial intelligence…).

Open Access Files

85 %

Number of full texts


Number of records


Publishers' policy on open archives

Mapping of collaborations


Combinatoire Parameterized algorithms Coloring Directed graphs Complexity dichotomy Tutte polynomial Induced subgraphs NP-completeness Approximation algorithms Hyperplane arrangement Graph theory Interval graphs Graph algorithms Kernelization Discharging method Analysis of algorithms Duality Branchwidth Discrete Mathematics Immersions Complexity Robust optimization Hitting minors Cutwidth Tournaments Bidimensionality Coloration Chromatic number Single-exponential algorithm Graph minors Basis Phylogenetic networks Vertex cover Dynamic programming Polynomial kernel Pattern avoidance Exponential Time Hypothesis Digraph Clique tree Computational complexity Flat Wall Theorem Parameterized complexity Fixed-parameter tractability Planar graphs Maximum average degree Graph modification problems Reconfiguration Clique-width FPT-algorithm Pathwidth Edge coloring Graph coloring Irrelevant vertex technique Graph drawing Obstructions Linkages Combinatorics on words Optical networks Complexité paramétrée Girth Directed tree-width Chordal graphs Bramble Treewidth Homomorphism 2-partition Directed disjoint paths Graph decompositions Minimal triangulation Graph decomposition Graph Minors FPT algorithm Bipartite graph Algorithm Graph colouring 2-distance coloring Graph Protrusion decomposition Erdős–Pósa property Approximation algorithm Oriented matroid Combinatorics Planar graph Well-quasi-ordering Linear kernels Domination Digraphs Graphs Edge contraction Edge contractions Topological minors Activity Algorithms Bijection Dual parameterization Matroid First-order logic Phylogenetics Discharging procedure Sparse graphs