Skip to Main content Skip to Navigation

Open Access Files

77 %


  Algorithms, Graphs and Combinatorics


Files' number



Notices' number


Collaborations' map


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