Project information
Well-structured combinatorial classes, width parameters, and design of efficient algorithms
- Project Identification
- GAP202/11/0196
- Project Period
- 1/2011 - 12/2013
- Investor / Pogramme / Project type
-
Czech Science Foundation
- Standard Projects
- MU Faculty or unit
- Faculty of Informatics
- Cooperating Organization
-
University of West Bohemia in Pilsen
Našim cílem je dále rozvíjet teoretické poznatky strukturální kombinatoriky, především o tzv. šířkových parametrech, a hledat jejich nové úspěšné aplikace v návrhu efektivních algoritmů pro těžké problémy.
Za tímto účelem nově spojíme síly a dosavadní výsledky navrhovatele a spolunavrhovatele.
Publications
Total number of publications: 18
2012
-
Generalized Maneuvers in Route Planning
Computing and Informatics, year: 2012, volume: 31, edition: 3, DOI
-
Lower Bounds on the Complexity of MSO_1 Model-Checking
29th International Symposium on Theoretical Aspects of Computer Science STACS2012, year: 2012
-
Testing Graph MSO Properties: A Fresh View
Year: 2012, type:
2011
-
A Tighter Insertion-based Approximation of the Graph Crossing Number
Year: 2011, type:
-
Clique-width: When Hard Does Not Mean Impossible
28th International Symposium on Theoretical Aspects of Computer Science STACS2011, year: 2011
-
Scope-Based Route Planning
ESA’11: Proceedings of the 19th conference on Annual European Symposium, year: 2011
-
Twin-Cover: Beyond Vertex Cover in Parameterized Algorithmics
Parameterized and Exact Computation, year: 2011
-
Using Neighborhood Diversity to Solve Hard Problems
Year: 2011, type: Appeared in Conference without Proceedings