Skip to Main content Skip to Navigation

Open Access Files

75 %


  Algorithms, Graphs and Combinatorics


Files' number



Notices' number


Collaborations' map


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