Surprising Applications of Treewidth Bounds for Planar Graphs

DOI10.1007/978-3-030-42071-0_13OpenAlexW3020006667MaRDI QIDQ5042457

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)

Related Items

Four Shorts Stories on Surprising Algorithmic Uses of Treewidth

Cites Work

• Unnamed Item
• Finding small simple cycle separators for 2-connected planar graphs
• Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions
• New upper bounds on the decomposability of planar graphs
• Optimal Parameterized Algorithms for Planar Facility Location Problems Using Voronoi Diagrams
• On Geometric Set Cover for Orthants
• Subexponential parameterized algorithms for graphs of polynomial growth