Jiehua Yi

According to our database, Jiehua Yi authored at least 4 papers between 2005 and 2009.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2009

A meeting scheduling problem respecting time and space.

Florian Berger, Rolf Klein, Doron Nussbaum, Jörg-Rüdiger Sack, Jiehua Yi

GeoInformatica, 2009

2007

An <i>O</i> ( <i>n</i> ²log <i>n</i> ) Time Algorithm for Computing Shortest Paths Amidst Growing Discs in the Plane.

Anil Maheshwari, Doron Nussbaum, Jörg-Rüdiger Sack, Jiehua Yi

Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

2006

How to Fit In Another Meeting.

Rolf Klein, Doron Nussbaum, Jörg-Rüdiger Sack, Jiehua Yi

Proceedings of the 2nd International ICST Conference on Collaborative Computing: Networking, 2006

2005

On computing Fréchet distance of two paths on a convex polyhedron.

Anil Maheshwari, Jiehua Yi

Proceedings of the (Informal) Proceedings of the 21st European Workshop on Computational Geometry, 2005