Skip to Main content Skip to Navigation
New interface

Open Access Files

82 %


  Algorithms, Graphs and Combinatorics


Files' number



Notices' number


Collaborations' map


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