Author of the publication

Optimum Guard Covers and $m$-Watchmen Routes for Restricted Polygons.

, , and . Int. J. Comput. Geom. Appl., 3 (1): 85-105 (1993)

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

A New Compacting Garbage-Collection Algorithm with a Good Average-Case Performance., , , and . STACS, volume 480 of Lecture Notes in Computer Science, page 296-308. Springer, (1991)Sublinear Merging and Natural Merge Sort., , and . SIGAL International Symposium on Algorithms, volume 450 of Lecture Notes in Computer Science, page 251-260. Springer, (1990)Average-Case Results on Heapsort.. BIT, 27 (1): 2-17 (1987)Heaps with Bits., , and . ISAAC, volume 834 of Lecture Notes in Computer Science, page 288-296. Springer, (1994)Some Lower Bounds for Comparison-Based Algorithms., and . ESA, volume 855 of Lecture Notes in Computer Science, page 106-117. Springer, (1994)The Complexity of Heaps., and . SODA, page 393-402. ACM/SIAM, (1992)In-place Linear Probing Sort., , and . STACS, volume 577 of Lecture Notes in Computer Science, page 581-587. Springer, (1992)An Implicit Binomial Queue with Constant Insertion Time., , and . SWAT, volume 318 of Lecture Notes in Computer Science, page 1-13. Springer, (1988)An Extrapolation on the Interpolation Search., and . SWAT, volume 318 of Lecture Notes in Computer Science, page 24-33. Springer, (1988)Searching Rigid Data Structures (Extended Abstract)., and . COCOON, volume 959 of Lecture Notes in Computer Science, page 446-451. Springer, (1995)