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

84 %

Number of full texts


Number of records


Publishers' policy on open archives

Mapping of collaborations


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