A fixed-parameter approach to 2-layer planarization

DOI10.1007/s00453-005-1181-yzbMath1095.68081OpenAlexW1592802262WikidataQ57359967 ScholiaQ57359967MaRDI QIDQ2498928

David R. Wood, Matthew Kitching, Michael R. Fellows, Fran Rosamond, Catherine McCartin, Prabhakar Ragde, Naomi Nishimura, Matthew Suderman, Giuseppe Liotta, Vida Dujmović, S. H. Whitesides, Michael T. Hallett

Publication date: 11 August 2006

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-005-1181-y

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (14)

Parameterized analysis and crossing minimization problems ⋮ Two-layer planarization parameterized by feedback edge set ⋮ 2-Layer Graph Drawings with Bounded Pathwidth ⋮ Parameterized complexity of graph planarity with restricted cyclic orders ⋮ 2-layer right angle crossing drawings ⋮ Fixed parameter algorithms for one-sided crossing minimization revisited ⋮ Ranking and Drawing in Subexponential Time ⋮ On the parameterized complexity of layered graph drawing ⋮ An improved FPT algorithm and a quadratic kernel for pathwidth one vertex deletion ⋮ Parameterized algorithms for \(d\)-hitting set: the weighted case ⋮ Approximation and fixed-parameter algorithms for consecutive ones submatrix problems ⋮ Comparing trees via crossing minimization ⋮ Parameterized complexity of graph planarity with restricted cyclic orders ⋮ A linear edge kernel for two-layer crossing minimization

This page was built for publication: A fixed-parameter approach to 2-layer planarization