Skip to Main content Skip to Navigation

Open Access Files

78 %


  Algorithms, Graphs and Combinatorics


Files' number



Notices' number


Collaborations' map


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