Skip to Main content Skip to Navigation

Open Access Files

76 %


  Algorithms, Graphs and Combinatorics


Chargement de la page

Files' number



Notices' number


Collaborations' map


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