index - Algorithmes, Graphes et Combinatoire


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

Chargement de la page

Number of full texts

491

Number of records

Chargement de la page

Publishers' policy on open archives

Mapping of collaborations

Tags

Chargement de la page