Grid-Obstacle Representations with Connections to Staircase Guarding

DOI10.1007/978-3-319-73915-1_7zbMath1499.68253arXiv1708.01903OpenAlexW2962718715MaRDI QIDQ4625102

Saeed Mehrabi, Therese C. Biedl

Publication date: 20 February 2019

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (4)

On orthogonally guarding orthogonal polygons with bounded treewidth ⋮ Grid obstacle representation of graphs ⋮ Unnamed Item ⋮ Geodesic obstacle representation of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Small drawings of outerplanar graphs, series-parallel graphs, and other planar graphs
• Obstacle numbers of graphs
• A unified approach to visibility representations of planar graphs
• Unit disk graphs
• A note on optimal area algorithms for upward drawings of binary trees
• More efficient commitments from structured lattice assumptions
• Multi-Authority Secret-Ballot Elections with Linear Work
• Statistically Hiding Commitments and Statistical Zero-Knowledge Arguments from Any One-Way Function
• Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems
• A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
• Fully homomorphic encryption using ideal lattices
• On lattices, learning with errors, random linear codes, and cryptography

This page was built for publication: Grid-Obstacle Representations with Connections to Staircase Guarding