On computing Fréchet distance of two paths on a convex polyhedron. - Anil Maheshwari; Jiehua Yi (EuroCG, 2005)

How to Fit In Another Meeting. - Rolf Klein; Doron Nussbaum; Jörg-Rüdiger Sack; Jiehua Yi (CollaborateCom, 2006)

An O ( n 2log n ) Time Algorithm for Computing Shortest Paths Amidst Growing Discs in the Plane. - Anil Maheshwari; Doron Nussbaum; Jörg-Rüdiger Sack; Jiehua Yi (ISAAC, 2007)

A meeting scheduling problem respecting time and space. - Florian Berger; Rolf Klein; Doron Nussbaum; Jörg-Rüdiger Sack; Jiehua Yi (GeoInformatica, 2009)