37 citations · 122 across the 16 of their papers we have counts for
19 papers
The Hamiltonian Path Graph is Connected for Simple Paths in Rectangular Grid Graphs
Rahnuma Islam Nishat, Venkatesh Srinivasan, Sue Whitesides
A \emph{simple} path in a rectangular grid graph is a Hamiltonian path from the top-left corner to the bottom-right corner such that each \emph{inter…
Combinatorial Properties and Recognition of Unit Square Visibility Graphs
Katrin Casel, Henning Fernau, Alexander Grigoriev +2
Unit square (grid) visibility graphs (USV and USGV, resp.) are described by axis-parallel visibility between unit squares placed (on integer grid coordinates) in the plane. We inve…
Visibility Representations of Boxes in 2.5 Dimensions
Alessio Arleo, Carla Binucci, Emilio Di Giacomo +7
We initiate the study of 2.5D box visibility representations (2.5D-BR) where vertices are mapped to 3D boxes having the bottom face in the plane and edges are unobstructed li…
Monotone Simultaneous Embeddings of Paths in R^d
David Bremner, Olivier Devillers, Marc Glisse +5
We study the following problem: Given paths that share the same vertex set, is there a simultaneous geometric embedding of these paths such that each individual drawing is mono…
On the Planar Split Thickness of Graphs
David Eppstein, Philipp Kindermann, Stephen Kobourov +7
Motivated by applications in graph drawing and information visualization, we examine the planar split thickness of a graph, that is, the smallest such that the graph is -spl…
Kinetic -Semi-Yao Graph and its Applications
Zahed Rahmati, Mohammad Ali Abam, Valerie King +1
This paper introduces a new proximity graph, called the -Semi-Yao graph (-SYG), on a set of points in , which is a supergraph of the -nearest neighbor gr…