Skip to Main content Skip to Navigation

Open Access Files

78 %


  Algorithms, Graphs and Combinatorics


Files' number

Chargement de la page


Notices' number


Collaborations' map


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