30. WG 2004:
Bad Honnef, Germany
Recognition and Decomposition
: A Symbolic Approach to the All-Pairs Shortest-Paths Problem.
: A Graph-Theoretic Generalization of the Least Common Subsumer and the Most Specific Concept in the Description Logic EL.
Optimization and Approximation Algorithms
Parameterized Complexity and Exponential Algorithms
Counting, Combinatorics, and Optimization
Applications (Biology, Graph Drawing)
Graph Classes and NP Hardness