Skip to Main content Skip to Navigation

Open Access Files

81 %


  Algorithms, Graphs and Combinatorics


Files' number



Notices' number


Collaborations' map


Erdős–Pósa property Clique tree Edge contractions Vertex cover Linear kernels Graph colouring Approximation algorithm Digraphs Cutwidth Complexity dichotomy Graph Minors Graph modification problems Graphs Protrusion decomposition Planar graph Graph MCS Graph decompositions Minimal triangulation Topological minors FPT algorithm NP-complete Bidimensionality Memory optimization Parameterized complexity Branchwidth First-order logic Graphs on surfaces Hardness of approximation Fixed-parameter tractability Robust optimization Hitting minors NP-completeness Coloring Duality Tutte polynomial Basis Linkages Irrelevant vertex technique Oriented matroid Well-quasi-ordering Phylogenetics Directed tree-width ALGORITHME Algorithm Chordal graphs Optical networks Computational complexity Exponential Time Hypothesis Matroid Maximum average degree FPT-algorithm Dynamic programming Obstructions Graph algorithms Boolean mapping Edge coloring Bijection Planar graphs Hyperplane arrangement Non-crossing partitions Algorithms Activity Parameterized algorithms Phylogenetic networks Graph minors Approximation algorithms Edge contraction Forests Tournaments 2-distance coloring Complexité paramétrée Kernelization Homomorphism Treewidth Single-exponential algorithm Combinatorics Graph theory Graph decomposition LexBFS Graph drawing Graph coloring Immersions Graph degeneracy Complexity 2-partition Domination Combinatoire Polynomial kernel Girth Analysis of algorithms Discharging procedure Minimum degree Sparse graphs Dual parameterization Induced subgraphs Coloration Clique-width Interval graphs GRAPHS