Subexponential parameterized algorithms on planar graphs via low-treewidth pattern covering Dániel Marx (joint work with Fedor Fomin, Daniel Lokshtanov, Marcin Pilipczuk, Michał Pilipczuk, and Saket Saurabh)

Source URL: www.cs.bme.hu

Known Algorithms on Graphs of Bounded Treewidth are Probably Optimal Dániel Marx Humboldt-Universität zu Berlin Joint work with

Source URL: www.cs.bme.hu

Structural complexity of CSPs: the role of treewidth and its generalizations ´ Daniel Marx Tel Aviv University, Israel

Source URL: www.cs.bme.hu

To Approximate Treewidth, Use Treelength! David Coudert, Guillaume Ducoffe, Nicolas Nisse To cite this version: David Coudert, Guillaume Ducoffe, Nicolas Nisse. To Approximate Treewidth, Use Treelength!. Siam Journal on

Source URL: hal.inria.fr

On Exact Algorithms for Treewidth HANS L. BODLAENDER, Utrecht University, the Netherlands FEDOR V. FOMIN, University of Bergen, Norway ARIE M. C. A. KOSTER, Aachen University, Germany DIETER KRATSCH, Universit´e de Metz

Source URL: users.uoa.gr

Information and Computation  IC2669 information and computation 139, 92article no. IC972669 On Interval Routing Schemes and Treewidth* Hans L. Bodlaender and Jan van Leeuwen

Source URL: users.uoa.gr

An empirical study of QBF encodings: from treewidth to useful preprocessing Luca Pulina and Armando Tacchella DIST, Universit`a di Genova, Viale Causa, 13 – 16145 Genova, Italy {Luca.Pulina | Armando.Tacchella}@unige.i

Source URL: tmancini.di.uniroma1.it

Prof. Dr. Petra Scheffler FH Stralsund, FB Wirtschaft Wissenschaftliche Vorträge

Source URL: scheffler.fh-stralsund.de

• Graph theory
• Chordal graph
• Treewidth

Characterizing Graphs of Small Carving-Width R´emy Belmonte1? , Pim van ’t Hof1? , Marcin Kami´ nski3 , 2?? 4? ? ? Dani¨el Paulusma , and Dimitrios M. Thilikos

Source URL: rutcor.rutgers.edu

• Graph theory
• Graph coloring
• Graph operations
• Matroid theory
• Graph connectivity
• Pathwidth
• Graph minor
• Ear decomposition
• Treewidth
• Tree decomposition
• Edge contraction
• Branch-decomposition

Planarization and acyclic colorings of subcubic claw-free graphs Christine Cheng! , Eric McDermid!! , and Ichiro Suzuki! ! ! Department of Computer Science, University of Wisconsin–Milwaukee, Milwaukee, WI 53211, USA {

Source URL: www.cs.uwm.edu

• Graph theory
• Graph coloring
• Matching
• Planar graphs
• Line graph
• Claw-free graph
• Planarization
• Treewidth
• Acyclic coloring
• Graph minor
• Degeneracy