The problem is that we attempt to solve the simplest questions cleverly, thereby rendering them unusually complex.
One should seek the simple solution.

Anton Pavlovich Chekhov (c. 1890)


You can get Math Reviews of my papers and DBLP

Publications of Sergey Bereg [ papers by category]

    2017

  1. A new algorithmic framework for basic problems on binary images. Discrete Appl. Math., 216:376-392, 2017. Written with T. Asano and L. Buzer.
        bib · url

  2. 2016

  3. Optimizing some constructions with bars: new geometric knapsack problems. Journal of Combinatorial Optimization, 31(3):1160-1173, 2016. Written with J. M. Diaz-Báñez, D. Flores-Peñaloza, S. Langerman, P. Pérez-Lantero, and J. Urrutia.
        bib · abstract · url

  4. Representing Permutations with Few Moves. SIAM Journal on Discrete Mathematics, 30(4):1950-1977, 2016. Written with A. E. Holroyd, L. Nachmanson, and S. Pupyrev.
        bib · url

  5. On the Edge Crossing Properties of Euclidean Minimum Weight Laman Graphs. Comput. Geom. Theory Appl., 51:15-24, 2016. Written with S.-H. Hong, N. Katoh, S.-H. Poon, and S. i. Tanigawa.
        bib · url

  6. A framework for synchronizing a team of aerial robots in communication-limited environments. IEEE Transactions on Robotics, 2016. to appear. Written with J. M. Díaz-Báñez, L. Evaristo, M. A. Lopez, I. Maza, and A. Ollero.
        bib

  7. Node Overlap Removal by Growing a Tree. Proc. 24th Internat. Sympos. on Graph Drawing and Network Visualization, pp. 33-43, 2016. Written with L. Nachmanson, A. Holroyd, A. Nocaj, and L. Zhang.
        bib · url

  8. Edge Routing with Ordered Bundles. Comput. Geom. Theory Appl., 52:18-33, 2016. Written with S. Pupyrev, L. Nachmanson, and A. E. Holroyd.
        bib · abstract · url · pdf

  9. Frontiers in Algorithmics, 10th International Workshop, FAW 2016, Qingdao, China, June 30 - July 2, 2016. ProceedingsLecture Notes in Computer Science , 9711. Springer, 2016.
        bib · url

  10. 2015

  11. On balanced 4-holes in bichromatic point sets. Comput. Geom. Theory Appl., 48(3):169-179, 2015. Written with J. M. Díaz-Báñez, R. Fabila-Monroy, P. Perez-Lantero, A. Ramirez-Vigueras, T. Sakai, J. Urrutia, and I. Ventura.
        bib · abstract · url · pdf

  12. Balanced Partitions of 3-colored Geometric Sets in the Plane. Discrete Appl. Math., 181:21-32, 2015. Written with F. Hurtado, M. Kano, M. Korman, D. Lara, C. Seara, R. Silveira, J. Urrutia, and K. Verbeek.
        bib · url

  13. Smallest Maximum-Weight Circle for Weighted Points in the Plane. Computational Science and Its Applications - ICCSA 2015 - 15th International Conference, Banff, AB, Canada, June 22-25, 2015, Proceedings, Part II, pp. 244-253, 2015. Written with O. Daescu, M. Zivanic, and T. Rozario.
        bib · url

  14. The synchronization problem for information exchange between aerial robots under communication constraints. IEEE International Conference on Robotics and Automation, pp. 4650-4655, 2015. Written with J. M. Díaz-Báñez, L. Evaristo, M. A. Lopez, I. Maza, and A. Ollero.
        bib · url

  15. 2014

  16. Guarding Orthogonal Galleries with Rectangular Rooms. The Computer Journal, 57(11):1668-1673, 2014. Written with A. L. Bajuelos and M. Martins.
        bib · url

  17. Continuous Surveillance of Points by Rotating Floodlights. Int. J. Comput. Geom. Appl., 24(03):183-196, 2014. Written with J. M. Díaz-Báñez, M. Fort, M. Lopez, P. Pérez-Lantero, and J. Urrutia.
        bib · url

  18. Drawing the double circle on a grid of minimum size. Int. J. Comput. Geom. Appl., 24(3), 2014. Written with R. Fabila-Monroy, D. Flores-Peñaloza, M. Lopez, and P. Pérez-Lantero.
        bib · url · pdf

  19. 2013

  20. Drawing Permutations with Few Corners. Graph Drawing, LNCS 8242, pp. 484-495, 2013. Written with A. E. Holroyd, L. Nachmanson, and S. Pupyrev.
        bib · url

  21. On the Edge Crossing Properties of Euclidean Minimum Weight Laman Graphs. Proc. 24th Annu. Internat. Sympos. Algorithms Comput., LNCS 8283, pp. 33-43, 2013. Written with S.-H. Hong, N. Katoh, S.-H. Poon, and S. i. Tanigawa.
        bib · url

  22. 2012

  23. A New Framework for Connected Components Labeling of Binary Images. "Proc. 15th Internat. Workshop on Combinatorial Image Analysis (IWCIA'12)", pp. 90-102, 2012. Written with T. Asano.
        bib · url

  24. Small Work Space Algorithms for Some Basic Problems on Binary Images. "Proc. 15th Internat. Workshop on Combinatorial Image Analysis (IWCIA'12)", pp. 103-114, 2012. Written with T. Asano and L. Buzer.
        bib · url

  25. Computing Generalized Ham-Sandwich Cuts. Information Processing Letters, 112(13):532-534, 2012.
        bib · abstract · url · pdf

  26. Balanced line for a 3-colored point set in the plane. Electr. J. Comb., 19:P33, 2012. Written with M. Kano.
        bib · abstract · url · pdf

  27. On balanced 4-holes in bichromatic point sets. 28th European Workshop on Computational Geometry, Assisi, Perugia, Italy, 2012. Written with J. M. Díaz-Báñez, R. Fabila-Monroy, P. Perez-Lantero, A. Ramirez-Vigueras, T. Sakai, J. Urrutia, and I. Ventura.
        bib

  28. The Class Cover Problem with Boxes. Comput. Geom. Theory Appl., 45(7):294-304, 2012. Written with S. Cabello, J. M. Díaz-Báñez, P. Pérez-Lantero, C. Seara, and I. Ventura.
        bib · abstract · url

  29. Optimizing Phylogenetic Networks for Circular Split Systems. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 9:535-547, 2012. Written with P. Phipps.
        bib · abstract · url

  30. Approximating Metrics with Planar Boundary-Labeled Phylogenetic Networks. Journal of Bioinformatics and Computational Biology, 10(6), 2012. Written with R. Sheng.
        bib · url

  31. 2011

  32. The Maximum Box Problem for moving points in the plane. Journal of Combinatorial Optimization, 22(4):517-530, 2011. Written with J. M. Díaz-Báñez, P. Pérez-Lantero, and I. Ventura.
        bib · abstract · url · pdf

  33. Edge Routing with Ordered Bundles. Proc. 19th Internat. Sympos. on Graph Drawing, LNCS 7034, pp. 136-147. Springer-Verlag, 2011. Written with S. Pupyrev, L. Nachmanson, and A. E. Holroyd.
        bib · abstract · pdf

  34. 2010

  35. Guarding a Terrain by Two Watchtowers. Algorithmica, 58(2):352-390, 2010. Written with P. Agarwal, O. Daescu, H. Kaplan, S. Ntafos, M. Sharir, and B. Zhu.
        bib · abstract · url

  36. Orthogonal Ham-Sandwich Theorem in R3. Proc. 21th ACM-SIAM Sympos. Discrete Algorithms, pp. 1605-1612, 2010.
        bib · pdf

  37. Voronoi Diagram of Polygonal Chains under the Discrete Fréchet Distance. Int. J. Comput. Geom. Appl., 20(4):471-484, 2010. Written with K. Buchin, M. Buchin, M. Gavrilova, and B. Zhu.
        bib · abstract · url · pdf

  38. The Class Cover Problem with Boxes. Proc. 26th European Workshop Comput. Geom., pp. 69-72, 2010. Written with S. Cabello, J. M. Díaz-Báñez, P. Pérez-Lantero, C. Seara, and I. V. Molina.
        bib · abstract · url

  39. Maximum Area Independent Sets in Disk Intersection Graphs. Int. J. Comput. Geom. Appl., 20(2):105-118, 2010. Written with A. Dumitrescu and M. Jiang.
        bib · url

  40. On covering problems of Rado. Algorithmica, 57(3):538-561, 2010. Written with A. Dumitrescu and M. Jiang.
        bib · url

  41. 2009

  42. Compatible Geometric Matchings. Comput. Geom. Theory Appl., 42(6-7):617-626, 2009. Written with O. Aichholzer, A. Dumitrescu, A. Garcia, C. Huemer, F. Hurtado, M. Kano, A. Marquez, D. Rappaport, S. Smorodinsky, D. Souvaine, J. Urrutia, and D. R. Wood.
        bib · url

  43. Finding Nearest Larger Neighbors: A Case Study in Algorithm Design and Analysis. Efficient Algorithms, LNCS 5760, pp. 249-260, 2009. Written with T. Asano and D. Kirkpatrick.
        bib · url

  44. Counting Faces in Split Networks. Proc. 5th Internat. Sympos. on Bioinformatics Research and Applications (ISBRA'09), LNCS 5542, pp. 112-123, 2009. Written with L. Bao.
        bib · url

  45. A Polynomial Time Solution to Minimum Forwarding Set Problem in Wireless Ad Hoc Networks. IEEE Transactions on Parallel and Distributed Systems, 20(7):913-924, 2009. Written with M. Baysan, K. Sarac, and R. Chandrasekaran.
        bib · url · pdf

  46. On Characterizations of Rigid Graphs in the Plane Using Spanning Trees. Graphs and Combinatorics, 25(2):139-144, 2009.
        bib · url

  47. Orthogonal equipartitions. Comput. Geom. Theory Appl., 42(4):305-314, 2009.
        bib · abstract · url · pdf

  48. Orthogonal Morphing of Orthogonal Drawings. 9th Annual Fall Workshop on Computational Geometry, 2009.
        bib

  49. Approximating Barrier Resilience in Wireless Sensor Networks. Proc. of the 5th Internat. Workshop on Algorithmic Aspects of Wireless Sensor Networks, LNCS 5804, pp. 29-40, 2009. Written with D. G. Kirkpatrick.
        bib · abstract · url · pdf

  50. Traversing a Set of Points with a Minimum Number of Turns. Discrete Comput. Geom., 41(1):513-532, 2009. Written with P. Bose, A. Dumitrescu, F. Hurtado, and P. Valtr.
        bib · url

  51. A PTAS for Cutting out Polygons with Lines. Algorithmica, 53(2):157-171, 2009. Written with O. Daescu and M. Jiang.
        bib · url

  52. On the Red/Blue Spanning Tree Problem. Proc. 6th Annu. Conf. on Theory and Applications of Models of Computation (TAMC), LNCS 5532, pp. 118-127, 2009. Written with M. Jiang, B. Yang, and B. Zhu.
        bib · url

  53. Matching Points with Rectangles and Squares. Comput. Geom. Theory Appl., 42(2):93-108, 2009. Written with N. Mutsanas and A. Wolff.
        bib · url

  54. 2008

  55. Compatible Geometric Matchings. 1st Topological & Geometric Graph Theory, Paris, FranceElectronic Notes in Discrete Mathematics , 31, pp. 201-206, 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 · url

  56. 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

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

  58. 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

  59. 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

  60. 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

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

  62. 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

  63. 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

  64. 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

  65. 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

  66. 2007

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

  68. 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

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

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

  71. 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

  72. 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

  73. 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

  74. 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

  75. 2006

  76. 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

  77. 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

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

  79. 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

  80. 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

  81. 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

  82. 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

  83. 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

  84. 2005

  85. 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

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

  87. 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

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

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

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

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

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

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

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

  95. 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

  96. 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

  97. 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

  98. 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

  99. 2004

  100. 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

  101. 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

  102. 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

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

  104. 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

  105. 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

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

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

  108. 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

  109. 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

  110. 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

  111. 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

  112. 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

  113. 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

  114. 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

  115. 2003

  116. 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

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

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

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

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

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

  122. 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

  123. 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

  124. 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

  125. 2002

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

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

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

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

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

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

  132. 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

  133. 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

  134. 2001

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

  136. 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

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

  138. 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

  139. 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

  140. 2000

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

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

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

  144. 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

  145. 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

  146. 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

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

  148. before 2000

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

  150. 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

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

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

  153. Extending permutation arrays: improving MOLS bounds. Designs, Codes and Cryptography. accepted for publication in July 2016. Written with L. Morales and I. H. Sudbborough.
        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.