Surprising Applications of Treewidth Bounds for Planar Graphs

DOI10.1007/978-3-030-42071-0_13MaRDI QIDQ5042457zbMATH OpenOpenAlexFDO

Authors Marcin Pilipczuk

Publication date 19 October 2022

Published in Treewidth, Kernels, and Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-42071-0_13

zbMATH Keywords

planar graphssubexponential algorithm

Mathematics Subject Classification ID

Computer science (68-XX)

Recommendations

• Four Shorts Stories on Surprising Algorithmic Uses of Treewidth
• The algorithmic theory of treewidth
• Treewidth: Structure and Algorithms
• Treewidth lower bounds with brambles
• SOFSEM 2005: Theory and Practice of Computer Science

Cites work

• Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions
• Finding small simple cycle separators for 2-connected planar graphs
• scientific article; zbMATH DE number 3214278 (Why is no real title available?)
• New upper bounds on the decomposability of planar graphs
• On Geometric Set Cover for Orthants
• Subexponential parameterized algorithms for graphs of polynomial growth

Cited in

(3)

• scientific article; zbMATH DE number 6868519 (Why is no real title available?)
• Four Shorts Stories on Surprising Algorithmic Uses of Treewidth
• Treewidth of display graphs: bounds, brambles and applications

This page was built for publication: Surprising Applications of Treewidth Bounds for Planar Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5042457)