Skip to Main content Skip to Navigation

Open Access Files

81 %


  Algorithms, Graphs and Combinatorics


Files' number



Notices' number


Collaborations' map


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