AGAPE 2009

The Spring school on fixed parameter and exact algorithms (Lozari, May 25,29, 2009) adresses to doctoral and post-doctoral students as well as confirmed.

Fixed parameter tractable (FPT) and exponential-time algorithms are hot topics in algorithms. Both approaches aim at reducing the combinatorial explosion of NP-hard problems. In moderately exponential-time algorithms, we search for fastest possible exact algorithms – typically the exponential time depends on the size of the instance – which should be practical on instances of moderate sizes. In FPT, the idea is to design algorithms for which the exponential factor of the running-time only depends on some parameter which is expected to be small in practical use.

Scientific committee: F. Haver (CNRS, I3S) D. Kratsch (LITA, Univ. Metz), J.F. Lalande (Univ. Bourges), C. Paul (LIRMM, CNRS, Univ. Montpellier 2), S. Pérennes (CNRS, I3S), S. Thomassé (LIRMM, CNRS, Univ. Montpellier 2), I. Todinca (LIFO, Univ. Orléans)

More To Explore

Events

LOGALG 2022

The Workshop on Logic, Graphs, and Algorithms (LoGAlg 2022) is a two-day event held at LIRMM (Montpellier) during the dates 21 and 22 of November 2022. The workshop will be dedicated to the logical aspects of graph algorithms and their diverse applications in Theoretical Computer Science and Discrete Mathematics. Scientific committee: Dimitrios M. Thilikos (CNRS, Université Montpellier), Christophe Paul (CNRS, Université Montpellier)

21 November 2022

Research grants

UTMA

Unifying Theories for Multivariate Algorithms (ANR-DFG project, ANR-20-CE92-0027) Studying the tractability of computational problems is a core challenge in theoretical computer science. A central question

1 April 2021