Skip to Main content Skip to Navigation

Open Access Files

78 %


  Algorithms, Graphs and Combinatorics


Chargement de la page

Files' number

Chargement de la page


Notices' number

Chargement de la page

Collaborations' map


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