Hideki Umemoto

According to our database1, Hideki Umemoto authored at least 3 papers between 1997 and 2001.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2001
Searching for Mobile Intruders in a Polygonal Region by a Group of Mobile Searchers.
Algorithmica, 2001

1998
Bushiness and a Tight Worst-Case Upper Bound on the Search Number of a Simple Polygon.
Inf. Process. Lett., 1998

1997
Searching for Mobile Intruders in a Polygonal Region by a Group of Mobile Searchers (Extended Abstract).
Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997


  Loading...