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

Chargement de la page

Number of records


Publishers' policy on open archives

Mapping of collaborations


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