Skip to Main content Skip to Navigation

Open Access Files

78 %

ALGCO

  Algorithms, Graphs and Combinatorics

Search

Chargement de la page

Files' number

Chargement de la page

Copyright

Notices' number

Chargement de la page

Collaborations' map

Tags

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