A fixed-parameter approach to 2-layer planarization

DOI10.1007/S00453-005-1181-YMaRDI QIDQ2498928zbMATH OpenOpenAlexDBLPWikidataFDO

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

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

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

Recommendations

• scientific article; zbMATH DE number 2084262
• Two-Layer Planarization: Improving on Parameterized Algorithmics
• SOFSEM 2005: Theory and Practice of Computer Science
• Experiments with the Fixed-Parameter Approach for Two-Layer Planarization
• Graph Drawing

Cited in

(23)

• An improved FPT algorithm and a quadratic kernel for pathwidth one vertex deletion
• Parameterized analysis and crossing minimization problems
• Planar graph bipartization in linear time
• Parameterized complexity of graph planarity with restricted cyclic orders
• Ranking and drawing in subexponential time
• scientific article; zbMATH DE number 2084262 (Why is no real title available?)
• Experiments with the Fixed-Parameter Approach for Two-Layer Planarization
• Two-Layer Planarization: Improving on Parameterized Algorithmics
• Two-layer planarization parameterized by feedback edge set
• Two-layer planarization parameterized by feedback edge set
• scientific article; zbMATH DE number 1303024 (Why is no real title available?)
• 2-layer right angle crossing drawings
• SOFSEM 2005: Theory and Practice of Computer Science
• Graph Drawing
• Parameterized complexity of graph planarity with restricted cyclic orders
• 2-Layer Graph Drawings with Bounded Pathwidth
• Width notions for ordering-related problems
• A linear edge kernel for two-layer crossing minimization
• Fixed parameter algorithms for one-sided crossing minimization revisited
• On the parameterized complexity of layered graph drawing
• Parameterized algorithms for d-hitting set: the weighted case
• Approximation and fixed-parameter algorithms for consecutive ones submatrix problems
• Comparing trees via crossing minimization

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

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