Exact and parameterized algorithms (ANR-09-BLAN-0159) In the classical complexity theory, a problem is considered to be non-tractable if it cannot be solved in polynomial time.…
The International Workshop on Graph Theoretic Concepts in Computer Science (WG 2009) was held in Montpellier, France. It continues the series of 34 previous WG’s.…
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…
