Eliminating crossings in ordered graphs
From MaRDI portal
Cites work
- A fast and simple subexponential fixed parameter algorithm for one-sided crossing minimization
- A faster fixed parameter algorithm for two-layer crossing minimization
- A generalization of Nemhauser and Trotter's local optimization theorem
- A near-optimal planarization algorithm
- Adding one edge to planar graphs makes crossing number and 1-planarity hard
- Algorithms and Computation
- Algorithms for a maximum clique and a maximum independent set of a circle graph
- An output sensitive algorithm for computing a maximum independent set of a circle graph
- Beyond outerplanarity
- Computing crossing numbers in quadratic time
- Crossing minimization in linear embeddings of graphs
- Dynamic Programming Treatment of the Travelling Salesman Problem
- Eliminating crossings in ordered graphs
- Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design
- Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover
- Faster parameterized algorithms using linear programming
- Finding minimum-cost flows by double scaling
- Finding odd cycle transversals.
- Fourier meets M\"{o}bius: fast subset convolution
- scientific article; zbMATH DE number 5485473 (Why is no real title available?)
- scientific article; zbMATH DE number 4051024 (Why is no real title available?)
- Lossy planarization: a constant-factor approximate kernelization for planar vertex deletion
- Obtaining a planar graph by vertex deletion
- On 3-coloring circle graphs
- On a generalization of Nemhauser and Trotter's local optimization theorem
- On bounded-degree vertex deletion parameterized by treewidth
- On parameterized algorithms for fixed-order book thickness with respect to the pathwidth of the vertex ordering
- Parameterized algorithms for book embedding problems
- Parameterized algorithms for fixed-order book drawing with bounded number of crossings per edge
- Parameterized analysis and crossing minimization problems
- Planarity Allowing Few Error Vertices in Linear Time
- Preprocessing for outerplanar vertex deletion: an elementary kernel of quartic size
- The complexity of colouring circle graphs (extended abstract)
- The mixed page number of graphs
- Treewidth of graphs with balanced separations
Cited in
(3)
This page was built for publication: Eliminating crossings in ordered graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6891157)
