Nearly Optimal Expected-Case Planar Point Location. - Sunil Arya; Theocharis Malamatos; David M. Mount (FOCS, 2000)

Entropy-preserving cuttings and space-efficient planar point location. - Sunil Arya; Theocharis Malamatos; David M. Mount (SODA, 2001)

Linear-size approximate voronoi diagrams. - Sunil Arya; Theocharis Malamatos (SODA, 2002)

Space-efficient approximate Voronoi diagrams. - Sunil Arya; Theocharis Malamatos; David M. Mount (STOC, 2002)

Finding planar regions in a terrain: in practice and with a guarantree. - Stefan Funke; Theocharis Malamatos; Rahul Ray (SCG, 2004)

Space-time tradeoffs for approximate spherical range counting. - Sunil Arya; Theocharis Malamatos; David M. Mount (SODA, 2005)

Finding Planar Regions in a Terrain - in Practice and with a Guarantee. - Stefan Funke; Theocharis Malamatos; Rahul Ray (Int. J. Comput. Geom. Appl., 2005)

(Approximate) Conic Nearest Neighbors and the induced Voronoi Diagram. - Stefan Funke; Theocharis Malamatos; Domagoj Matijevic; Nicola Wolpert (CCCG, 2006)

On the importance of idempotence. - Sunil Arya; Theocharis Malamatos; David M. Mount (STOC, 2006)

Optimal Expected-Case Planar Point Location. - Sunil Arya; Theocharis Malamatos; David M. Mount; Ka Chun Wong (SIAM J. Comput., 2007)

A simple entropy-based algorithm for planar point location. - Sunil Arya; Theocharis Malamatos; David M. Mount (ACM Trans. Algorithms, 2007)

Lower bounds for expected-case planar point location. - Theocharis Malamatos (Comput. Geom., 2008)

The Effect of Corners on the Complexity of Approximate Range Searching. - Sunil Arya; Theocharis Malamatos; David M. Mount (Discret. Comput. Geom., 2009)

Space-time tradeoffs for approximate nearest neighbor searching. - Sunil Arya; Theocharis Malamatos; David M. Mount (J. ACM, 2009)

Conic nearest neighbor queries and approximate Voronoi diagrams. - Stefan Funke; Theocharis Malamatos; Domagoj Matijevic; Nicola Wolpert (Comput. Geom., 2015)