Author of the publication

Visibility-Based Pursuit-Evasion in a Polygonal Region by a Searcher.

, , and . ICALP, volume 2076 of Lecture Notes in Computer Science, page 456-468. Springer, (2001)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Efficient Algorithms for Computing a Complete Visibility Region in Three-Dimensional Space., , , and . Algorithmica, 20 (2): 201-225 (1998)Characterizing and Recognizing the Visibility Graph of a Funnel-Shaped Polygon., , and . Algorithmica, 14 (1): 27-51 (1995)Improved gossipings by short messages in 2-dimensional meshes., , and . J. Parallel Distrib. Comput., 65 (7): 793-800 (2005)Optimal broadcasting with universal lists based on competitive analysis., and . Networks, 45 (4): 224-231 (2005)Simple algorithms for searching a polygon with flashlights., , and . Inf. Process. Lett., 81 (5): 265-270 (2002)An Optimal Algorithm for Finding the Edge Visibility Polygon under Limited Visibility., , , , and . Inf. Process. Lett., 53 (6): 359-365 (1995)Non-clairvoyant scheduling for weighted flow time., and . Inf. Process. Lett., 87 (1): 31-37 (2003)Online deadline scheduling on faster machines., and . Inf. Process. Lett., 85 (1): 31-37 (2003)Broadcasting with Universal Lists Revisited: Using Competitive Analysis., and . ISAAC, volume 2223 of Lecture Notes in Computer Science, page 74-85. Springer, (2001)Online Scheduling of Parallel Communications with Individual Deadlines., and . ISAAC, volume 1741 of Lecture Notes in Computer Science, page 383-392. Springer, (1999)