Track Layout Is Hard

DOI10.1007/978-3-319-50106-2_38zbMath1478.68214OpenAlexW2559843347MaRDI QIDQ2961541

Michael J. Bannister, David R. Wood, William E. Devanny, David Eppstein, Vida Dujmović

Publication date: 21 February 2017

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

Full work available at URL: https://doi.org/10.1007/978-3-319-50106-2_38

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Parameterized complexity, tractability and kernelization (68Q27)

Related Items (2)

A survey of discrete methods in (algebraic) statistics for networks ⋮ Two Results on Layered Pathwidth and Linear Layouts

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fundamentals of parameterized complexity
• Sparsity. Graphs, structures, and algorithms
• S-functions for graphs
• Edge crossings in drawings of bipartite graphs
• Parameterized Complexity of 1-Planarity
• Fixed Parameter Tractability of Crossing Minimization of Almost-Trees
• Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth
• Flat Foldings of Plane Graphs with Prescribed Angles and Edge Lengths
• Combinatorics and Geometry of Finite and Infinite Squaregraphs
• Graph minors. II. Algorithmic aspects of tree-width
• Laying Out Graphs Using Queues
• Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions
• Layout of Graphs with Bounded Tree-Width

This page was built for publication: Track Layout Is Hard