Skip to Main content
Skip to Navigation
Toggle navigation
HAL
HAL
HALSHS
TEL
MédiHAL
Liste des portails
AURéHAL
API
Data
Documentation
Episciences.org
Episciences.org
Journals
Documentation
Sciencesconf.org
Support
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
Evaluation
Homepage
Search
ALGCO
Algorithmes, Graphes et Combinatoire
Consult your copyright
Titre du journal ou ISSN
Editeur
Number of Files
353
Nomber of Notices
334
Collaborations’ map
Tags
Graphs on surfaces
Algorithms
Algorithm
Linear kernels
Boolean mapping
Immersions
Hardness of approximation
Algorithmique des graphes
Tournaments
Chordal graphs
Oriented matroid
Parameterized complexity
Graph degeneracy
Computational complexity
Homomorphism
Branchwidth
Single-exponential algorithm
Matroid
NP-completeness
Phylogenetic networks
LexBFS
Planar graph
Oriented coloring
Forests
Sparse graphs
Pathwidth
Optical networks
Edge coloring
Cutwidth
Combinatorics
Graph coloring
Discharging procedure
Graph modification problems
Robust optimization
Obstructions
Graph
Complexity
Maximum average degree
Protrusion decomposition
FPT-algorithm
ALGORITHME
Memory optimization
Pattern avoidance
Hyperplane arrangement
Graph minors
Polynomial kernel
Topological minors
Hitting minors
FPT algorithm
Girth
Approximation algorithm
Clique-width
Oriented graph
Analysis of algorithms
Weighted coloring
Activity
Dynamic programming
Graph algorithms
Bijection
Graph drawing
Coloration
Graph colouring
First-order logic
Interval graphs
Minimal triangulation
Tutte polynomial
Graphs
Minimum degree
Acyclic coloring
Traffic grooming
Non-crossing partitions
Parameterized algorithms
Basis
Domination
Graph decomposition
Graph theory
Square coloring
GRAPHS
Erdős–Pósa property
Graph Minors
Bidimensionality
Phylogenetics
Exponential Time Hypothesis
Planar graphs
Treewidth
Irrelevant vertex technique
2-partition
Duality
Approximation algorithms
Kernelization
MCS
Fixed-parameter tractability
Well-quasi-ordering
Combinatoire
Permutation graphs
2-distance coloring
Complexité paramétrée
Packings in graphs
Tournament
Linkages