Two-layer planarization: Improving on parameterized algorithmics

DOI10.1007/978-3-540-30577-4_17MaRDI QIDQ5711526zbMATH OpenOpenAlexFDO

Authors Henning Fernau

Publication date 7 December 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b105088

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Two-Layer Planarization: Improving on Parameterized Algorithmics
• A fixed-parameter approach to two-layer planarization
• A fixed-parameter approach to 2-layer planarization
• Drawing graphs in two layers
• A faster fixed parameter algorithm for two-layer crossing minimization

Cited in

(15)

• Drawing graphs in two layers
• Efficiently enumerating hitting sets of hypergraphs arising in data profiling
• Extension and its price for the connected vertex cover problem
• Applying modular decomposition to parameterized cluster editing problems
• A fixed-parameter approach to 2-layer planarization
• A fixed-parameter approach to two-layer planarization
• 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
• Constraint bipartite vertex cover: simpler exact algorithms and implementations
• On a binary distance model for the minimum linear arrangement problem
• Graph Drawing
• A parameterized perspective on packing paths of length two
• Short cycles make \(W\)-hard problems hard: FPT algorithms for \(W\)-hard problems in graphs with no short cycles
• Approximation and fixed-parameter algorithms for consecutive ones submatrix problems

This page was built for publication: Two-layer planarization: Improving on parameterized algorithmics

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