scientific article; zbMATH DE number 7205209
From MaRDI portal
Publication:5111885
DOI10.4230/LIPIcs.IPEC.2017.25zbMath1443.68135MaRDI QIDQ5111885
Hiromu Ohtsuka, Yasuaki Kobayashi, Hisao Tamaki
Publication date: 27 May 2020
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Parameterized complexity, tractability and kernelization (68Q27)
Related Items (4)
Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth ⋮ Parameterized analysis and crossing minimization problems ⋮ Parameterized approaches to orthogonal compaction ⋮ Parameterized Algorithms for Book Embedding Problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Monadic second-order evaluations on tree-decomposable graphs
- On the parameterized complexity of layered graph drawing
- Fixed-parameter algorithms for protein similarity search under mRNA structure constraints
- Embedding planar graphs in four pages
- The book thickness of a graph
- Linear algorithms to recognize outerplanar and maximal outerplanar graphs
- Characterizations of outerplanar graphs
- Treewidth. Computations and approximations
- The complexity of first-order and monadic second-order logic revisited
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- A $c^k n$ 5-Approximation Algorithm for Treewidth
- On circular layouts∗
- Generation of maximum independent sets of a bipartite graph and maximum cliques of a circular-arc graph
- Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design
- Graph-Theoretic Concepts in Computer Science
- SOFSEM 2005: Theory and Practice of Computer Science
- One- and two-page crossing numbers for some types of graphs
This page was built for publication:
