Skip to Main content Skip to Navigation

Open Access Files

76 %


  Algorithms, Graphs and Combinatorics


Files' number



Notices' number


Collaborations' map


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