Loading...
Research of the AlGCo team is focused on theoretical and algorithmic investigations of classical combinatorial structures: mainly graphs, but also signed graphs, directed graphs, matroids, oriented matroids… Our motivations are fundamental (questions about partitioning, coloring, embedding, isomorphisms, bijections…), algorithmic (notably related to parametrized complexity: fixed-parameter-tractable algorithms, existence of polynomial kernels), or applied in connection with other domains (computational biology, imaging, morphometry, network modelization, data science, artificial intelligence…).
Open Access Files
Number of full texts
497
Number of records
352
Publishers' policy on open archives
Mapping of collaborations
Tags
Combinatorics
Discharging method
Dicolouring
Irrelevant vertex technique
Erdős–Pósa property
Single-exponential algorithm
Pattern avoidance
Linear kernels
Tournaments
Geometric intersection graphs
Well-quasi-ordering
Approximation algorithm
Sparse graphs
Phylogenetics
Reconfiguration
Graph modification problems
Algorithms
Maximum average degree
Intersection graphs
Hitting minors
Complexity
Robust optimization
Minimal triangulation
Complexité paramétrée
FPT algorithm
Treewidth
Topological minors
Parameterized algorithms
Hyperplane arrangement
Bijection
Coloration
Oriented matroid
Algorithm
Branchwidth
Graph minors
Graph colouring
Complexity dichotomy
Edge coloring
Edge contraction
Linkages
Protrusion decomposition
First-order logic
Combinatoire
Kernelization
Clique tree
Dynamic programming
Mathematics
Analysis of algorithms
Combinatorics on words
Graph drawing
Tournament
Optical networks
Phylogenetic networks
Obstructions
Cutwidth
Basis
Duality
Graph decompositions
Matroid
Chromatic number
Induced subgraphs
Interval graphs
Planar graph
Activity
Bipartite graph
Avoidability
Fixed-parameter tractability
Planar graphs
Homomorphism
Graph coloring
Vertex cover
Digraphs
Parameterized complexity
Bramble
Graphs
Clique-width
2-partition
Chordal graphs
Bidimensionality
Graph theory
Graph decomposition
Directed graphs
Coloring
Pathwidth
Immersions
Approximation algorithms
Graph
Graph algorithms
Flat Wall Theorem
Exponential Time Hypothesis
Girth
Elimination distance
Directed tree-width
Polynomial kernel
Tutte polynomial
Graph Minors
2-distance coloring
Computational complexity
NP-completeness
Obstruction set