Skip to Main content
Skip to Navigation
Toggle navigation
Sign in
Sign in
Sign in with ORCID
se connecter avec Fédération
Create account
Forgot your password?
Have you forgotten your login?
fr
en
ALGCO
Homepage
Deposit
Browse
by author
by period
by docType
by journal
by conference
by ANR project
latest submissions
Browse by search
Homepage
Open Access Files
ALGCO
Algorithms, Graphs and Combinatorics
Search
Files' number
Copyright
Titre du journal ou ISSN
Editeur
Notices' number
Collaborations' map
Tags
Pathwidth
Protrusion decomposition
Polynomial kernel
ALGORITHME
Chordal graphs
Bijection
Obstructions
Packings in graphs
Oriented graph
NP-completeness
Clique tree
Kernelization
Basis
Topological minors
Phylogenetics
Domination
Hardness of approximation
Well-quasi-ordering
Graph colouring
Robust optimization
Homomorphism
Treewidth
Activity
Erdős–Pósa property
Complexity
Duality
2-distance coloring
MCS
Bidimensionality
Graph drawing
Combinatoire
Branchwidth
Graph decompositions
Tutte polynomial
Matroid
GRAPHS
Graph decomposition
Digraphs
Girth
Graph coloring
FPT algorithm
Coloring
LexBFS
Permutation graphs
Graph Minors
Graphs
Interval graphs
Graphs on surfaces
Oriented matroid
NP-complete
Algorithms
Edge coloring
Forests
Discharging procedure
Minimal triangulation
Graph degeneracy
Planar graphs
FPT-algorithm
Sparse graphs
Tournaments
Irrelevant vertex technique
Graph modification problems
Approximation algorithms
Combinatorics
Clique-width
Analysis of algorithms
Dynamic programming
Memory optimization
Parameterized algorithms
Graph
Edge contraction
Non-crossing partitions
Linkages
Maximum average degree
Graph algorithms
Edge contractions
First-order logic
Hitting minors
Single-exponential algorithm
Approximation algorithm
Hyperplane arrangement
Linear kernels
Cutwidth
Oriented coloring
Phylogenetic networks
Graph minors
Boolean mapping
Parameterized complexity
Computational complexity
Optical networks
Fixed-parameter tractability
Pattern avoidance
Graph theory
Complexité paramétrée
Planar graph
Exponential Time Hypothesis
Immersions
2-partition
Minimum degree
Coloration