Crossing minimization for 1-page and 2-page drawings of graphs with bounded treewidth
From MaRDI portal
Publication:4611385
Recommendations
- Crossing minimization for 1-page and 2-page drawings of graphs with bounded treewidth
- Fixed Parameter Tractability of Crossing Minimization of Almost-Trees
- An improved fixed-parameter algorithm for one-page crossing minimization
- 1-page and 2-page drawings with bounded number of crossings per edge
- 1-page and 2-page drawings with bounded number of crossings per edge
Cites work
- 1-page and 2-page drawings with bounded number of crossings per edge
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- A partial k-arboretum of graphs with bounded treewidth
- A Separator Theorem for Nonplanar Graphs
- An improved fixed-parameter algorithm for one-page crossing minimization
- Beyond outerplanarity
- Book drawings of complete bipartite graphs
- Complexity of Finding Embeddings in a k-Tree
- Computing crossing numbers in quadratic time
- Crossing minimization for 1-page and 2-page drawings of graphs with bounded treewidth
- Crossing Numbers and Parameterized Complexity
- Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design
- Enumeration of simple complete topological graphs
- Experimental evaluation of book drawing algorithms
- Fixed Parameter Tractability of Crossing Minimization of Almost-Trees
- Fundamentals of parameterized complexity
- Graph minors. XIII: The disjoint paths problem
- Graph structure and monadic second-order logic. A language-theoretic approach
- Graph treewidth and geometric thickness parameters
- scientific article; zbMATH DE number 3165199 (Why is no real title available?)
- scientific article; zbMATH DE number 5485473 (Why is no real title available?)
- scientific article; zbMATH DE number 4049084 (Why is no real title available?)
- scientific article; zbMATH DE number 51019 (Why is no real title available?)
- scientific article; zbMATH DE number 3499787 (Why is no real title available?)
- scientific article; zbMATH DE number 612169 (Why is no real title available?)
- scientific article; zbMATH DE number 1947048 (Why is no real title available?)
- scientific article; zbMATH DE number 824939 (Why is no real title available?)
- scientific article; zbMATH DE number 3259770 (Why is no real title available?)
- scientific article; zbMATH DE number 3049182 (Why is no real title available?)
- Improved lower bounds for the 2-page crossing numbers of \(K_{m,n}\) and \(K_n\) via semidefinite programming
- Linear algorithms to recognize outerplanar and maximal outerplanar graphs
- On the book thickness of k-trees
- On the parameterized complexity of layered graph drawing
- One- and two-page crossing numbers for some types of graphs
- Parameterized complexity of 1-planarity
- Parametrized complexity theory.
- The 2-page crossing number of \(K_{n}\)
- The book thickness of a graph
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- The same upper bound for both: the 2-page and the rectilinear crossing numbers of the \(n\)-cube
Cited in
(27)- 1-page and 2-page drawings with bounded number of crossings per edge
- Orthogonal planarity testing of bounded treewidth graphs
- Fixed-order book thickness with respect to the vertex-cover number: new observations and further analysis
- Parameterized complexity of finding subgraphs with hereditary properties on hereditary graph classes
- Fixed-parameter tractability for book drawing with bounded number of crossings per edge
- Parameterized analysis and crossing minimization problems
- Bundled crossings revisited
- Parameterized algorithms for book embedding problems
- Sketched representations and orthogonal planarity of bounded treewidth graphs
- 1-page and 2-page drawings with bounded number of crossings per edge
- Crossing minimization for 1-page and 2-page drawings of graphs with bounded treewidth
- Experimental evaluation of book drawing algorithms
- An improved fixed-parameter algorithm for one-page crossing minimization
- Parameterized algorithms for book embedding problems
- Bundled crossings revisited
- Parameterized approaches to orthogonal compaction
- Quantum graph drawing (best student paper)
- A tight subexponential-time algorithm for two-page book embedding
- Bounding the treewidth of outer k-planar graphs via triangulations
- Parameterized approaches to orthogonal compaction
- Drawn tree decomposition: new approach for graph drawing problems
- Recognizing 2-layer and outer k-planar graphs
- Linear layouts revisited: stacks, queues, and exact algorithms
- String graph obstacles of high girth and of bounded degree
- Treewidth of outer k-planar graphs
- Quantum graph drawing
- Crossing minimization in extended level drawings of graphs
This page was built for publication: Crossing minimization for 1-page and 2-page drawings of graphs with bounded treewidth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4611385)
