Skip to Main content Skip to Navigation

Open Access Files

75 %


  Algorithms, Graphs and Combinatorics


Files' number



Notices' number


Collaborations' map


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