Contraction and Treewidth Lower Bounds - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Hans Leo Bodlaender, Thomas Wolle, Arie M. C. A. Koster. Contraction and Treewidth Lower Bounds. J. Graph Algorithms Appl., 10(1):5-49, 2006. [doi]

The following publications are possibly variants of this publication:

Contraction and Treewidth Lower BoundsHans Leo Bodlaender, Arie M. C. A. Koster, Thomas Wolle. esa 2004: 628-639 [doi]

Treewidth Lower Bounds with BramblesHans Leo Bodlaender, Alexander Grigoriev, Arie M. C. A. Koster. algorithmica, 51(1):81-98, 2008. [doi]

Treewidth Lower Bounds with BramblesHans Leo Bodlaender, Alexander Grigoriev, Arie M. C. A. Koster. esa 2005: 391-402 [doi]

Treewidth computations II. Lower boundsHans L. Bodlaender, Arie M. C. A. Koster. iandc, 209(7):1103-1119, 2011. [doi]

Degree-Based Treewidth Lower BoundsArie M. C. A. Koster, Thomas Wolle, Hans Leo Bodlaender. wea 2005: 101-112 [doi]

Computational aspects of treewidth : Lower bounds and network reliabilityThomas Wolle. PhD thesis, Utrecht University, Netherlands, 2005. [doi]

A Branch and Bound Algorithm for Exact, Upper, and Lower Bounds on TreewidthEmgad H. Bachoore, Hans Leo Bodlaender. AAIM 2006: 255-266 [doi]

runs on WebDSL