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

474

Number of records

346

Publishers' policy on open archives

Mapping of collaborations

Tags

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