Parameterized algorithms for fixed-order book drawing with few crossings per edge

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)

Cites Work

Title not available (Why is that?)
Fundamentals of parameterized complexity
Improved upper bounds for vertex cover
The vertex separation number of a graph equals its path-width
Algorithms for the fixed linear crossing number problem
Subexponential-time and FPT algorithms for embedded flat clustered planarity
1-page and 2-page drawings with bounded number of crossings per edge
On parameterized algorithms for fixed-order book thickness with respect to the pathwidth of the vertex ordering
Fixed-parameter tractability for book drawing with bounded number of crossings per edge
Exact crossing number parameterized by vertex cover
Sketched representations and orthogonal planarity of bounded treewidth graphs
On 3D visibility representations of graphs with few crossings per edge
Area requirement of graph drawings with few crossings per edge
Approximating the fixed linear crossing number
Algorithms for graphs embeddable with few crossings per edge
An analysis of some linear graph layout heuristics
Fixed Parameter Tractability of Crossing Minimization of Almost-Trees
Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth
Fixed Linear Crossing Minimization by Reduction to the Maximum Cut Problem
The Complexity of Coloring Circular Arcs and Chords
Experimental Evaluation of Book Drawing Algorithms
Parameterized Algorithms for Queue Layouts
Parameterized Algorithms for Book Embedding Problems
Crossing minimization in linear embeddings of graphs
Vertex-bipartition: a unified approach for kernelization of graph linear layout problems parameterized by vertex cover

This page was built for publication: Parameterized algorithms for fixed-order book drawing with few crossings per edge

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