Combinatorial Optimization on Graphs of Bounded Treewidth

By Hans L. Bodlaender, Arie M. C. A. Koster. Computer/law journal, 2008

318 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics, Computer Networks and Communications

View Paper: https://www.semanticscholar.org/paper/fcb5d0e8a0e92ee9a6bd8a0150b38529de50d7c4

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

1. Saket Saurabh
2. Daniel Marx
3. Daniel Lokshtanov

In Computer Networks and Communications

1. Daniel Marx

Citations in the corpus

• Lower bounds based on the Exponential Time Hypothesis (2011, background): “This is very often matched by a corresponding algorithm, giving us tight understanding of the complexity of a planar problem.”