Large-Treewidth Graph Decompositions and Applications Chandra Chekuri∗ ABSTRACT Treewidth is a graph parameter that plays a fundamental role in several structural and algorithmic results. We study

Source URL: ttic.uchicago.edu

T HEORY OF C OMPUTING www.theoryofcomputing.org Can you beat treewidth?∗ D´aniel Marx† February 17, 2010

Source URL: www.cs.bme.hu

Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth MOHAMMADHOSSEIN BATENI Princeton University MOHAMMADTAGHI HAJIAGHAYI University of Maryland at College Park

Source URL: www.cs.bme.hu

Large-Treewidth Graph Decompositions and Applications∗ Chandra Chekuri† Julia Chuzhoy ‡

Source URL: ttic.uchicago.edu

Minicourse on parameterized algorithms and complexity Part 5: Treewidth Dániel Marx Jagiellonian University in Kraków

Source URL: www.cs.bme.hu

Locally constrained homomorphisms on graphs of bounded degree and bounded treewidth? Steven Chaplick1?? , Jiˇr´ı Fiala1,? ? ? , Pim van ’t Hof3 , Dani¨el Paulusma4 , and Marek Tesaˇr1 1

Source URL: iti.mff.cuni.cz

Simple Treewidth Kolja Knauer 1 Technical University Berlin

Source URL: page.math.tu-berlin.de

Structural parameterizations for boxicity Henning Bruhn, Morgan Chopin, Felix Joos and Oliver Schaudt Abstract The boxicity of a graph G is the least integer d such that G has an intersection model of axis-aligned d-dime

Source URL: www.zaik.uni-koeln.de

• Boxicity
• Geometric graph theory
• Planar graphs
• Pathwidth
• Intersection graph
• Treewidth
• Chordal graph
• Clique
• Interval graph
• Outerplanar graph
• Vertex cover
• Graph coloring

A Complete Anytime Algorithm for Treewidth Vibhav Gogate and Rina Dechter School of Information and Computer Science, University of California, Irvine, CA 92967 {vgogate,dechter}@ics.uci.edu

Source URL: www.hlt.utdallas.edu

Advanced Treewidth DPs Marcin Pilipczuk University of Bergen University of Warsaw University of Warwick

Source URL: fptschool.mimuw.edu.pl