Skip to Main content Skip to Navigation

Open Access Files

76 %


  Algorithms, Graphs and Combinatorics


Files' number



Notices' number


Collaborations' map


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