papers
Publications (15)
cs.CG2014
A Simple, Faster Method for Kinetic Proximity Problems
Zahed Rahmati, Mohammad Ali Abam, Valerie King +2
cs.CG2016
Visibility Representations of Boxes in 2.5 Dimensions
Alessio Arleo, Carla Binucci, Emilio Di Giacomo +7
cs.CG2016
Monotone Simultaneous Embeddings of Paths in R^d
David Bremner, Olivier Devillers, Marc Glisse +5
cs.DB2012
Computing optimal k-regret minimizing sets with top-k depth contours
Sean Chester, Alex Thomo, S. Venkatesh +1
math.CO2017
On the Planar Split Thickness of Graphs
David Eppstein, Philipp Kindermann, Stephen Kobourov +7
cs.CG2013
Kinetic Data Structures for the Semi-Yao Graph and All Nearest Neighbors in R^d
Zahed Rahmati, Mohammad Ali Abam, Valerie King +1
cs.CG2006
On Bus Graph Realizability
Anil Ada, Melanie Coggan, Paul Di Marco +8
cs.CG2017
Combinatorial Properties and Recognition of Unit Square Visibility Graphs
Katrin Casel, Henning Fernau, Alexander Grigoriev +2
cs.CG2016
Connecting a Set of Circles with Minimum Sum of Radii
Erin Wolf Chambers, Sándor P. Fekete, Hella-Franziska Hoffmann +5
cs.CG2014
Kinetic Reverse $k$-Nearest Neighbor Problem
Zahed Rahmati, Valerie King, Sue Whitesides
cs.CG2000
On Reconfiguring Tree Linkages: Trees can Lock
Therese Biedl, Erik Demaine, Martin Demaine +7
math.MG2003
The number of transversals to line segments in R^3
Hervé Brönnimann, Hazel Everett, Sylvain Lazard +2
cs.CG2016
Connectivity graphs of uncertainty regions
Erin Chambers, Alejandro Erickson, Sándor Fekete +7
cs.CG2014
Kinetic $k$-Semi-Yao Graph and its Applications
Zahed Rahmati, Mohammad Ali Abam, Valerie King +1
cs.DB2012
Indexing Reverse Top-k Queries
Sean Chester, Alex Thomo, S. Venkatesh +1