You know that I write slowly. This is chiefly because I am never satisfied until I have said as much as possible in a few words, and writing briefly takes far more time than writing at length.

Karl Friedrich Gauss

You can get Math Reviews of my papers and DBLP

Publications of Sergey Bereg [ papers by category]

    2009

  1. Guarding a Terrain by Two Watchtowers. Comput. Geom. Theory Appl., 2009. to appear. Written with P. Agarwal, O. Daescu, H. Kaplan, S. Ntafos, M. Sharir, and B. Zhu.
        bib

  2. Compatible Geometric Matchings. Comput. Geom. Theory Appl., 2009. to appear. Written with O. Aichholzer, A. Dumitrescu, A. Garcma, C. Huemer, F. Hurtado, M. Kano, A. Marquez, S. Smorodinsky, D. Souvaine, J. Urrutia, and D. Wood.
        bib

  3. A Polynomial Time Solution to Minimum Forwarding Set Problem in Wireless Ad Hoc Networks. IEEE Transactions on Parallel and Distributed Systems, 2009. to appear. Written with M. Baysan, K. Sarac, and R. Chandrasekaran.
        bib · url

  4. Traversing a Set of Points with a Minimum Number of Turns. Discrete Comput. Geom., 2009. to appear. Written with P. Bose, A. Dumitrescu, F. Hurtado, and P. Valtr.
        bib · url

  5. Voronoi Diagram of Polygonal Chains under the Discrete Fréchet Distance. Int. J. Comput. Geom. Appl., 2009. accepted. Written with K. Buchin, M. Buchin, M. Gavrilova, and B. Zhu.
        bib

  6. Matching Points with Rectangles and Squares. Comput. Geom. Theory Appl., pp. 93-108, 2009. Written with N. Mutsanas and A. Wolff.
        bib · url

    7. 2008

  7. Compatible Geometric Matchings. 1st Topological & Geometric Graph Theory, Paris, France, pp. 194-199, 2008. Written with O. Aichholzer, A. Dumitrescu, A. Garcma, C. Huemer, F. Hurtado, M. Kano, A. Marquez, S. Smorodinsky, D. Souvaine, J. Urrutia, and D. Wood.
        bib

  8. Clustered SplitsNetworks. Proc. 2nd Ann. Internat. Conf. on Combinatorial Optimization and Applications (COCOOA'08), LNCS 5165, pp. 469-478, 2008. Written with L. Bao.
        bib · url

  9. Efficient Algorithms for the d-Dimensional Rigidity Matroid of Sparse Graphs. Comput. Geom. Theory Appl., 40(1):37-44, 2008.
        bib · url

  10. Transforming Graphs with the Same Graphic Sequence. The Kyoto International Conference on Computational Geometry and Graph Theory, LNCS 4535, pp. 25-32, 2008. Written with H. Ito.
        bib · url

  11. On covering problems of Rado. Proc. 12th Scand. Workshop Algorithm Theory (SWAT'08), LNCS 5124, pp. 294-305, 2008. Written with A. Dumitrescu and M. Jiang.
        bib · url

  12. Voronoi Diagram of Polygonal Chains under the Discrete Fréchet Distance. Proc. 14th Ann. Internat. Conf. Computing and Combinatorics (COCOON'08), LNCS 5092, pp. 352-362, 2008. Written with K. Buchin, M. Buchin, M. Gavrilova, and B. Zhu.
        bib · url

  13. A PTAS for Cutting out Polygons with Lines. Algorithmica, 2008. to appear. Written with O. Daescu and M. Jiang.
        bib · url

  14. Maximum Area Independent Sets in Disk Intersection Graphs. Int. J. Comput. Geom. Appl., 2008. to appear. Written with A. Dumitrescu and M. Jiang.
        bib

  15. Sliding Disks in the Plane. Int. J. Comput. Geom. Appl., 18(5):373-387, 2008. Written with A. Dumitrescu and J. Pach.
        bib

  16. Robust Point-Location in Generalized Voronoi Diagrams. In: M. L. Gavrilova, editor, Generalized Voronoi Diagram: A Geometry-Based Approach to Computational Intelligence, pp. 285-299. Springer Berlin/Heidelberg, 2008. Written with M. L. Gavrilova and Y. Zhang.
        bib · url

  17. Simplifying 3D Polygonal Chains Under the Discrete Fréchet Distance. Proc. of the 10th Latin American Theoretical INformatics (LATIN'08), LNCS 4957, pp. 630-641, 2008. Written with M. Jiang, W. Wang, B. Yang, and B. Zhu.
        bib · url

  18. Automatically Approximating 3D Points with Co-axisal Objects. IEEE Proc. ICCSA'2008, 8th International Workshop on Computational Geometry and Applications (CGA'08), pp. 373-381, 2008. Written with R. Tempero, X. Meng, C. Tu, C. Yang, and B. Zhu.
        bib · url

  19. On Some City Guarding Problems. Proc. 14th Ann. Internat. Conf. Computing and Combinatorics (COCOON'08), LNCS 5092, pp. 600-610, 2008. Written with J. Zhou, L. Bao, O. Daescu, and S. Ntafos.
        bib · url

    20. 2007

  20. A Scalable Clustering Method Based on Density. WSEAS Transactions on Computers, 6:1036-1043, 2007. Written with K. Bean, L. Khan, and B. Thuraisingham.
        bib

  21. Topological Indices in Combinatorial Chemistry. In: I. Mandoiu and A. Zelikovsky, editors, Bioinformatics Algorithms: Techniques and Applications, pp. 419-438. Wiley-Interscience, 2007.
        bib · url

  22. Wiener Indices of Balanced Binary Trees. Discrete Applied Mathematics, 155(4):457-467, 2007. Written with H. Wang.
        bib · url

  23. Phylogenetic Networks Based on the Molecular Clock Hypothesis. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 4:661-667, 2007. Written with Y. Zhang.
        bib · url

  24. Traversing a Set of Points with a Minimum Number of Turns. Proc. 23th Annu. ACM Sympos. Comput. Geom., pp. 46-55, 2007. Written with P. Bose, A. Dumitrescu, F. Hurtado, and P. Valtr.
        bib

  25. On Finding Widest Empty Curved Corridors. Comput. Geom. Theory Appl., 38(3):154-169, 2007. Written with J. M. Díaz-Báñez, C. Seara, and I. Ventura.
        bib · url

  26. RNA Multiple Structural Alignment with Longest Common Subsequences. Journal of Combinatorial Optimization, 13(2):179-188, 2007. Written with M. Kubica, T. Walen, and B. Zhu.
        bib · url

  27. Straightening Drawings of Clustered Hierarchical Graphs. Proc. 33st Annu. Conf. on Current Trends in Theory and Practice of Informatics (SOFSEM'07), LNCS 4362, pp. 176-187, 2007. Written with M. V olker, A. Wolff, and Y. Zhang.
        bib

    28. 2006

  28. Moving Coins. Special issue of "Computational Geometry: Theory and Applications", 34(1):35-48, 2006. Written with M. Abellanas, F. Hurtado, A. G. Olaverri, D. Rappaport, and J. Tejel.
        bib · url

  29. Recent Developments and Open Problems in Voronoi Diagrams. Proc. 3rd Internat. Sympos. on Voronoi Diagrams in Science and Engineering (ISVD'06), pp. 4-5, 2006.
        bib · url

  30. The Lifting Model for Reconfiguration. Discrete Comput. Geom., 35(4):653-669, 2006. Written with A. Dumitrescu.
        bib · url

  31. Competitive Algorithms for Maintaining Mobile Centers. Mobile Networks and Applications, 11(2):177-186, 2006. Written with B. Bhattacharya, D. Kirkpatrick, and M. Segal.
        bib · url

  32. Equitable Subdivisions of Polygonal Regions. Special issue of "Computational Geometry: Theory and Applications", 34(1):20-27, 2006. Written with P. Bose and D. Kirkpatrick.
        bib · url

  33. A PTAS for cutting out polygons with lines. Proc. 12th Ann. Internat. Conf. Computing and Combinatorics (COCOON'06), LNCS 4112, pp. 176-185, 2006. Written with O. Daescu and M. Jiang.
        bib · url

  34. Robust Point-Location in Generalized Voronoi Diagrams. Proc. 3rd Internat. Sympos. on Voronoi Diagrams in Science and Engineering (ISVD'06), pp. 54-59, 2006. Written with M. L. Gavrilova and Y. Zhang.
        bib · url

  35. Matching Points with Rectangles and Squares. Proc. 32st Annu. Conf. on Current Trends in Theory and Practice of Informatics (SOFSEM'06), LNCS 3831, pp. 177-186, 2006. Written with N. Mutsanas and A. Wolff.
        bib · url

    36. 2005

  36. Guarding a Terrain by Two Watchtowers. Proc. 21th Annu. ACM Sympos. Comput. Geom., pp. 346-355, 2005. Written with P. Agarwal, H. Kaplan, O. Daescu, S. Ntafos, and B. Zhu.
        bib · url

  37. Geometric Facility Location Problems with Uncertainty. Discrete Optimization, 2(1):3-34, 2005. Written with I. Averbakh.
        bib · url

  38. Algorithms for the d-Dimensional Rigidity Matroid of Sparse Graphs. Proc. of the Japan Conference on Discrete and Computational Geometry (JCDCG'04), LNCS 3742, pp. 29-36, 2005.
        bib · url

  39. An Approximate Morphing between Polylines. Int. J. Comput. Geom. Appl., 15(2):193-208, 2005.
        bib · url · ps.gz

  40. Certifying and Constructing Minimally Rigid Graphs in the Plane. Proc. 21th Annu. ACM Sympos. Comput. Geom., pp. 73-80, 2005.
        bib · url

  41. Enumerating Pseudo-Triangulations in the Plane. Comput. Geom. Theory Appl., 30(3):207-222, 2005.
        bib · abstract · url · pdf · ps.gz

  42. Equipartitions of Measures by 2-fans. Discrete Comput. Geom., 34(1):87-96, 2005.
        bib · url

  43. Constructing Phylogenetic Networks from Trees. Proc. 5th IEEE Symposium on Bioinformatics and Bioengineering, pp. 299-306, 2005. Written with K. Bean.
        bib

  44. The Lifting Model for Reconfiguration. Proc. 21th Annu. ACM Sympos. Comput. Geom., pp. 55-62, 2005. Written with A. Dumitrescu.
        bib · url

  45. Curvature-bounded Traversals of Narrow Corridors. Proc. 21th Annu. ACM Sympos. Comput. Geom., pp. 278-287, 2005. Written with D. Kirkpatrick.
        bib · url

  46. Wiener Indices of Balanced Binary Trees. International Workshop on Bioinformatics Research and Applications, LNCS 3515, pp. 851-859, 2005. Written with H. Wang.
        bib · url

  47. Phylogenetic Networks Based on the Molecular Clock Hypothesis. Proc. 5th IEEE Symposium on Bioinformatics and Bioengineering, pp. 320-323, 2005. Written with Y. Zhang.
        bib

  48. RNA Multiple Structural Alignment with Longest Common Subsequences. Proc. 11th Ann. Internat. Conf. Computing and Combinatorics (COCOON'05), LNCS 2697, pp. 32-41, 2005. Written with B. Zhu.
        bib · url

  49. Sliding Disks in the Plane. Proc. of the Japan Conference on Discrete and Computational Geometry (JCDCG'04), LNCS 3742, pp. 37-47, 2005. Written with A. Dumitrescu and J. Pach.
        bib · url

    50. 2004

  50. The Fitting Line Problem in the Laguerre Geometry and its Applications. Proc. 16th Canad. Conf. Comput. Geom., pp. 166-169, 2004. Written with F. Anton.
        bib · pdf · ps

  51. On a Conjecture of Wiener Indices in Computational Chemistry. Algorithmica, 40(2):99-118, 2004. Written with A. Ban and N. Mustafa.
        bib · url · pdf

  52. Analysis of Layered Hierarchies for Necklaces. Proc. of the Japan Conference on Discrete and Computational Geometry (JCDCG'04), pp. 87-88, 2004. Written with K. Bean.
        bib · url

  53. 3D Realization of Two Triangulations of a Convex Polygon. Proc. 20th European Workshop Comput. Geom., pp. 49-52, 2004.
        bib · pdf

  54. Cylindrical Hierarchy for Deforming Necklaces. Int. J. Comput. Geom. Appl., 14(1-2):3-18, 2004.
        bib · abstract · pdf

  55. Equipartitions of Measures by 2-fans. Proc. 15th Annual International Symposium on Algorithms and Computation (ISAAC'04), LNCS 3341, pp. 149-158, 2004.
        bib · url

  56. Reconstruction of gt-Networks from Gene Trees. Proc. of the International Conference on Mathematics and Engineering Techniques in Medicine and Biological Sciences (METMBS '04), pp. 336-340, 2004.
        bib

  57. Transforming Pseudo-Triangulations. Information Processing Letters, 90(3):141-145, 2004.
        bib · abstract · url · ps.gz

  58. Dynamic Algorithms for Approximating Interdistances. Nordic Journal of Computing, 11(4):344-355, 2004. Written with M. Segal.
        bib · url

  59. Contour Interpolation with Bounded Dihedral Angles. Proc. of the 9th ACM Symposium on Solid Modeling and Applications, pp. 303-308, 2004. Written with M. Jiang and B. Zhu.
        bib · pdf

  60. Equitable Relatively-Convex Partitions of Simple Polygonal Regions. Proc. of the Japan Conference on Discrete and Computational Geometry (JCDCG'04), pp. 24-25, 2004. Written with P. Bose and D. Kirkpatrick.
        bib · url · ps.gz

  61. Directed Graphs and Minimum Distances of Error-Correcting Codes in Matrix Rings. New Zealand Journal of Mathematics, 33:113-119, 2004. Written with A. Kelarev and A. Salagean.
        bib · url

  62. Encoding Homotopy of Paths in the Plane. Proc. of the 6th Latin American Theoretical INformatics (LATIN'04), LNCS 2976, pp. 329-338, 2004.
        bib · url

  63. Selecting Distances in Arrangements of Hyperplanes Spanned by Points. Journal of Discrete Algorithms, 2(3):333-345, 2004. Written with M. Segal.
        bib · url · ps.gz

  64. New Bounds on Map Labeling with Circular Labels. Proc. 15th Annual International Symposium on Algorithms and Computation (ISAAC'04), LNCS 3341, pp. 606-617, 2004. Written with M. Jiang, B. Zhu, and Z. Qin.
        bib · url

  65. Computing a (1+ε)-Approximate Geometric Minimum-Diameter Spanning Tree. Algorithmica, 38(4):577-589, 2004. Written with M. J. Spriggs, J. M. Keil, M. Segal, and J. Snoeyink.
        bib · url · pdf · ps.gz

    66. 2003

  66. On a Conjecture of Wiener Indices in Computational Chemistry. Proc. 9th Ann. Internat. Conf. Computing and Combinatorics (COCOON'03), LNCS 2697, pp. 509-518, 2003. Written with A. Ban and N. Mustafa.
        bib · url · ps.gz

  67. An Algorithm for Analysis of Images in Spatial Information Systems. Journal of Automata, Languages and Combinatorics, 8(4):557-568, 2003. Written with A. Kelarev.
        bib · url

  68. An Approximate Morphing between Polylines. Proc. of the International Conference on Computational Science and Its Applications (ICCSA'03), LNCS 2669, pp. 807-816, 2003.
        bib

  69. Computing Closest Points for Segments. Int. J. Comput. Geom. Appl., 13(5):419-438, 2003.
        bib · url

  70. Computing Homotopic Shortest Paths in the Plane. J. Algorithms, 49(2):284-303, 2003.
        bib · abstract · url · pdf

  71. Computing Homotopic Shortest Paths in the Plane. Proc. 14th ACM-SIAM Sympos. Discrete Algorithms, pp. 609-617, 2003.
        bib · abstract · pdf

  72. Cylindrical Hierarchy for Deforming Necklaces. Proc. 9th Ann. Internat. Conf. Computing and Combinatorics (COCOON'03), LNCS 2697, pp. 20-29, 2003.
        bib · url

  73. On Partitioning a Cake. Proc. of the Japan Conference on Discrete and Computational Geometry (JCDCG'02), LNCS 2866, pp. 60-71, 2003.
        bib · url

  74. Transforming Pseudo-Triangulations. Proc. International Conference on Computational Science, LNCS 2657, pp. 533-539, 2003.
        bib · abstract · url · ps.gz

  75. Algorithms for Shortest Paths and d-cycle Problems. Journal of Discrete Algorithms, 1(1):1-9, 2003. Written with A. Kelarev.
        bib · abstract · url · ps.gz

  76. Constrained Equitable 3-Cuttings. Proc. of the Japan Conference on Discrete and Computational Geometry (JCDCG'02), LNCS 2866, pp. 72-83, 2003. Written with D. Kirkpatrick.
        bib · url · pdf

  77. Dynamic Algorithms for Approximating Interdistances. Proc. 30th Internat. Colloquium on Automata, Languages and Programming, LNCS 2719, pp. 1169-1180, 2003. Written with M. Segal.
        bib · url

  78. On Exact Solution for a Point-Location Problem in a System of d-dimensional Hyperbolic Surfaces. Proc. 15th Canad. Conf. Comput. Geom., pp. 136-139, 2003. Written with M. Gavrilova.
        bib · pdf

  79. Approximating the Geometric Minimum-Spanning Tree. Proc. 15th Canad. Conf. Comput. Geom., pp. 39-42, 2003. Written with M. J. Spriggs, J. M. Keil, M. Segal, and J. Snoeyink.
        bib · pdf

    80. 2002

  80. Computing Closest Points for Segments. Proc. 14th Canad. Conf. Comput. Geom., pp. 118-122, 2002.
        bib · url

  81. An Efficient Algorithm for Enumeration of Triangulations. Comput. Geom. Theory Appl., 23(3):271-279, 2002.
        bib · url

  82. Enumerating Pseudo-Triangulations in the Plane. Proc. 14th Canad. Conf. Comput. Geom., pp. 162-166, 2002.
        bib · abstract · ps.gz

  83. An O(n log n) Algorithm for the Zoo-keeper's Problem. Comput. Geom. Theory Appl., 24(2):63-74, 2002.
        bib · url

  84. An Optimal Morphing between Polylines. Int. J. Comput. Geom. Appl., 12(3):217-228, 2002.
        bib · abstract · url · ps.gz

  85. Packing Two Disks in a Polygon. Comput. Geom. Theory Appl., 23(1):31-42, 2002.
        bib · url

  86. An Algorithm for Analysis of Data in Geographic Information Systems. Proc. of the 13th Australasian Workshop on Combinatorial Algorithms, pp. 1-10, 2002. Written with A. Kelarev.
        bib

  87. Fast Algorithms for Approximating Distances. Algorithmica, 33(2):263-269, 2002. Written with M. Segal.
        bib · abstract · url

  88. Efficient Algorithms for Centers and Medians in Interval and Circular-arc Graphs. Networks, 39(3):144-152, 2002. Written with B. Bhattacharya, M. Keil, D. Kirkpatrick, and M. Segal.
        bib · abstract · url · ps.gz

  89. Lower and Upper Bounds for Tracking Mobile Servers. In: N. Santoro R. Baeza-Yates, U. Montanari, editor, Foundations of information technology in the era of network and mobile computing, pp. 47-58. Kluwer Academic Publishers, 2002. Written with B. Bhattacharya, D. Kirkpatrick, and M. Segal.
        bib

    90. 2001

  90. Geometric Facility Location Problems with Uncertainty. 1st Annual McMaster Optimization Conference: Theory and Applications, 2001. Written with I. Averbakh.
        bib

  91. An Efficient Algorithm for the Three-Dimensional Diameter Problem. Discrete Comput. Geom., 25(2):235-255, 2001.
        bib · abstract · url

  92. Enumerating Triangulations of Convex Polytopes. In: Robert Cori, Jacques Mazoyer, Michel Morvan, and Rémy Mosseri, editors, Discrete Models: Combinatorics, Computation, and Geometry, DM-CCG 2001DMTCS Proceedings , vol AA, pp. 111-122. Discrete Mathematics and Theoretical Computer Science, 2001.
        bib · url

  93. An O(n log n) Algorithm for the Zoo-keeper's Problem. 4th CGC Workshop on Computational Geometry, 2001.
        bib

  94. An Optimal Morphing between Polylines. Proc. of the International Conference on Imaging Science, Systems, and Technology (CISST'01), pp. 355-360, 2001.
        bib

  95. Fast Maintenance of Rectilinear Centers. Proc of the International Workshop on Computational Geometry and Applications (in conjunction with the ICCS'01), LNCS 2073, pp. 633-639, 2001. Written with M. Segal.
        bib · url

  96. Rectilinear Static and Dynamic Discrete 2-center Problems. Int. Journal of Math. Algorithms, 2:149-162, 2001. Written with M. Segal.
        bib · ps.gz

  97. On the Planar Two-Watchtower Problem. Proc. 7th Ann. Internat. Conf. Computing and Combinatorics (COCOON'01), LNCS 2108, pp. 121-130, 2001. Written with Z. Chen, K. Wang, and B. Zhu.
        bib · url

  98. Locating Watchtowers in Terrains. Proc. of the Fourth PIMS Graduate Industrial Math Modelling Camp, University of Victoria, pp. 1-10, 2001. Written with P. Anderson, A. Driga, L. Fairbrain, J. Li, T. Marquez-Lago, and L. Zhao.
        bib · url

  99. Efficient Algorithms for Centers and Medians in Interval and Circular-arc Graphs. Proc. 8th Annu. European Sympos. Algorithms, LNCS 1879, pp. 100-111, 2001. Written with B. Bhattacharya, M. Keil, D. Kirkpatrick, and M. Segal.
        bib · url

    100. 2000

  100. An Efficient Algorithm for Enumeration of Triangulations. 3th CGC Workshop on Computational Geometry, 2000.
        bib

  101. Covering a Set of Points by Two Axis-parallel Boxes. Information Processing Letters, 75:95-100, 2000. Written with M. Segal.
        bib · url · ps.gz

  102. Enumerating Longest Increasing Subsequences and Patience Sorting. Information Processing Letters, 76(1-2):7-11, 2000. Written with M. Segal.
        bib · abstract · ps.gz

  103. Queries with Segments in Voronoi Diagrams. Comput. Geom. Theory Appl., 16(1):23-33, 2000. Written with J. Snoeyink.
        bib · abstract

  104. Optimal Facility Location under Various Distance Functions. Int. J. Comput. Geom. Appl., 10(5):523-534, 2000. Written with K. Kedem, M. Segal, and A. Tamir.
        bib · ps.gz

  105. Mobile Facility Location. Proc. of 4th Intern. Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, DIAL M, pp. 46-53, 2000. Written with B. Bhattacharya, D. Kirkpatrick, and M. Segal.
        bib · url · ps.gz

  106. Visibility Queries among Horizontal Segments - A Dynamic Data Structure. Papers of the Japanese Conference on Discrete and Computational Geometry (JCDCG 2000), Tokai University, Japan, pp. 17-18. Tokai Proceedings, 2000. Written with M. J. Katz, F. Nielsen, and M. Segal.
        bib · pdf

  107. Generalizing Ham Sandwich Cuts to Equitable Subdivisions. Discrete Comput. Geom., 24(4):605-622, 2000. Written with D. Kirkpatrick and J. Snoeyink.
        bib · abstract · url · java demo · ps.gz

    108. before 2000

  108. Efficient Algorithm for Finding Two Largest Empty Circles. Proc. 15th European Workshop Comput. Geom., pp. 37-38. INRIA Sophia-Antipolis, 1999.
        bib

  109. Algorithms for Shortest Paths and d-cycle Problems. Proc. of the 10th Australasian Workshop on Combinatorial Algorithms, pp. 152-156, 1999. Written with A. Kelarev.
        bib

  110. Rectilinear 2-center Problems. Proc. 11th Canad. Conf. Comput. Geom., pp. 68-71, 1999. Written with D. Kirkpatrick.
        bib · pdf · ps.gz

  111. Rectilinear Static and Dynamic Discrete 2-center Problems. Proc. 6th Workshop Algorithms Data Struct., LNCS 1663, pp. 276-287, 1999. Written with M. Segal.
        bib · url

  112. Queries with Segments in Voronoi Diagrams. Proc. 10th ACM-SIAM Sympos. Discrete Algorithms, pp. 121-129, 1999. Written with J. Snoeyink.
        bib · ps.gz

  113. Optimal Facility Location under Various Distance Functions. Proc. 6th Workshop Algorithms Data Struct., LNCS 1663, pp. 318-329, 1999. Written with K. Kedem and M. Segal.
        bib · url

  114. Generalizing Ham Sandwich Cuts to Equitable Subdivisions. Proc. 15th Annu. ACM Sympos. Comput. Geom., pp. 49-58, 1999. Written with D. Kirkpatrick and J. Snoeyink.
        bib · url

  115. An Efficient Algorithm for the Three-Dimensional Diameter Problem. Proc. 9th ACM-SIAM Sympos. Discrete Algorithms, pp. 137-146, 1998.
        bib · ps.gz

  116. An Optimal Algorithm for Closest-Pair Maintenance. Discrete Comput. Geom., 19:175-195, 1998.
        bib · url · ps.gz

  117. On Constructing Minimum Spanning Trees in Rk1. Algorithmica, 18:524-529, 1997.
        bib · ps.gz

  118. Covering a Set of Points by Two Axis-parallel Boxes. Proc. 9th Canad. Conf. Comput. Geom., pp. 33-38, 1997. Written with M. Segal.
        bib · url

  119. Dynamic Algorithms for Approximate Neighbor Searching. Proc. 8th Canad. Conf. Comput. Geom., pp. 252-257, 1996.
        bib · pdf

  120. An Optimal Algorithm for Dynamic Post-office Problem in R21 and Related Problems. Proc. 8th Canad. Conf. Comput. Geom., pp. 101-106, 1996.
        bib · pdf

  121. An Optimal Algorithm for Closest Pair Maintenance. Proc. 11th Annu. ACM Sympos. Comput. Geom., pp. 152-161, 1995.
        bib · url

  122. The Region Approach for some Dynamic Closest-Point Problems. Proc. 6th Canad. Conf. Comput. Geom., pp. 75-80, 1994.
        bib

  123. Efficient Algorithms for Computing the Modality of Polygons. Discrete Mathematics, 5(4):120-132, 1993.
        bib · url

  124. Coloring the Plane and van der Waerden's Theorem. Kvant, 6:35-38, 1983.
        bib · url

Copyright Notice

The documents contained in this directory are included by the contributing authors as a means to ensure timely dissemination of scholarly and technical work on a non-commercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, notwithstanding that they have offered their works here electronically. It is understood that all persons copying this information will adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.