scientific article; zbMATH DE number 7204364

DOI10.4230/LIPIcs.MFCS.2017.30zbMath1441.68169arXiv1706.05906MaRDI QIDQ5111244

Markus L. Schmid, Henning Fernau, Alexander Grigoriev, Katrin Casel, S. H. Whitesides

Publication date: 26 May 2020

Full work available at URL: https://arxiv.org/abs/1706.05906

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

NP-completenessexact algorithmsvisibility graphsvisibility layout

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

Combinatorial properties and recognition of unit square visibility graphs ⋮ Simultaneous visibility representations of undirected pairs of graphs ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Simultaneous visibility representations of plane \(st\)-graphs using L-shapes
• Drawing graphs with right angle crossings
• The partial visibility representation extension problem
• Ortho-polygon visibility representations of embedded graphs
• Unit rectangle visibility graphs
• Representing a planar graph by vertical lines joining different levels
• A unified approach to visibility representations of planar graphs
• The complexity of minimizing wire lengths in VLSI layouts
• Rectangle-visibility representations of bipartite graphs
• Visibility representations of boxes in 2.5 dimensions
• The Unit Bar Visibility Number of a Graph
• Rectangle and Square Representations of Planar Graphs
• On k-visibility graphs
• Obstructing Visibilities with One Obstacle
• Maximizing the Total Resolution of Graphs
• Complexity of Finding Non-Planar Rectilinear Drawings of Graphs
• Drawing Graphs in the Plane with High Resolution
• The Straight-Line RAC Drawing Problem is NP-Hard
• On Rectilinear Drawing of Graphs
• A Visibility Representation for Graphs in Three Dimensions
• A Note on Rectilinearity and Angular Resolution
• Bar k-Visibility Graphs
• The complexity of satisfiability problems

This page was built for publication: