Sergey Bereg

Sergey Bereg, José Miguel Díaz-Báñez, Dolores Lara, Pablo Pérez-Lantero, Carlos Seara, Jorge Urrutia: On the coarseness of bicolored point sets. Comput. Geom. 46(1): 65-77 (2013)

Sergey Bereg, Sergio Cabello, José Miguel Díaz-Báñez, Pablo Pérez-Lantero, Carlos Seara, Inmaculada Ventura: The class cover problem with boxes. Comput. Geom. 45(7): 294-304 (2012)

Sergey Bereg: Computing generalized ham-sandwich cuts. Inf. Process. Lett. 112(13): 532-534 (2012)

Ruogu Sheng, Sergey Bereg: Approximating Metrics with Planar boundary-Labeled Phylogenetic Networks. J. Bioinformatics and Computational Biology 10(6) (2012)

Paul Phipps, Sergey Bereg: Optimizing Phylogenetic Networks for Circular Split Systems. IEEE/ACM Trans. Comput. Biology Bioinform. 9(2): 535-547 (2012)

Tetsuo Asano, Sergey Bereg: A New Framework for Connected Components Labeling of Binary Images. IWCIA 2012: 90-102

Tetsuo Asano, Sergey Bereg, Lilian Buzer: Small Work Space Algorithms for Some Basic Problems on Binary Images. IWCIA 2012: 103-114

Sergey Bereg, Alexander E. Holroyd, Lev Nachmanson, Sergey Pupyrev: Edge Routing with Ordered Bundles. CoRR abs/1209.4227 (2012)

Sergey Bereg, Timothy Rozario: Angle Optimization of Graphs Embedded in the Plane. CoRR abs/1211.4927 (2012)

Sergey Bereg, José Miguel Díaz-Báñez, Pablo Pérez-Lantero, Inmaculada Ventura: The Maximum Box Problem for moving points in the plane. J. Comb. Optim. 22(4): 517-530 (2011)

Sergey Bereg, Minghui Jiang, Boting Yang, Binhai Zhu: On the red/blue spanning tree problem. Theor. Comput. Sci. 412(23): 2459-2467 (2011)

Sergey Pupyrev, Lev Nachmanson, Sergey Bereg, Alexander E. Holroyd: Edge Routing with Ordered Bundles. Graph Drawing 2011: 136-147

Sergey Bereg, Adrian Dumitrescu, Minghui Jiang: On Covering Problems of Rado. Algorithmica 57(3): 538-561 (2010)

Pankaj K. Agarwal, Sergey Bereg, Ovidiu Daescu, Haim Kaplan, Simeon C. Ntafos, Micha Sharir, Binhai Zhu: Guarding a Terrain by Two Watchtowers. Algorithmica 58(2): 352-390 (2010)

Sergey Bereg, Adrian Dumitrescu, Minghui Jiang: Maximum Area Independent Sets in Disk Intersection Graphs. Int. J. Comput. Geometry Appl. 20(2): 105-118 (2010)

Sergey Bereg, Kevin Buchin, Maike Buchin, Marina L. Gavrilova, Binhai Zhu: Voronoi Diagram of Polygonal Chains under the Discrete FRéChet Distance. Int. J. Comput. Geometry Appl. 20(4): 471-484 (2010)

Sergey Bereg: Orthogonal Ham-Sandwich Theorem in R³. SODA 2010: 1605-1612

Sergey Bereg, Ovidiu Daescu, Minghui Jiang: A PTAS for Cutting Out Polygons with Lines. Algorithmica 53(2): 157-171 (2009)

Sergey Bereg, Nikolaus Mutsanas, Alexander Wolff: Matching points with rectangles and squares. Comput. Geom. 42(2): 93-108 (2009)

Sergey Bereg: Orthogonal equipartitions. Comput. Geom. 42(4): 305-314 (2009)

Oswin Aichholzer, Sergey Bereg, Adrian Dumitrescu, Alfredo García Olaverri, Clemens Huemer, Ferran Hurtado, Mikio Kano, Alberto Márquez, David Rappaport, Shakhar Smorodinsky, Diane L. Souvaine, Jorge Urrutia, David R. Wood: Compatible geometric matchings. Comput. Geom. 42(6-7): 617-626 (2009)

Sergey Bereg, Prosenjit Bose, Adrian Dumitrescu, Ferran Hurtado, Pavel Valtr: Traversing a Set of Points with a Minimum Number of Turns. Discrete & Computational Geometry 41(4): 513-532 (2009)

Sergey Bereg: On Characterizations of Rigid Graphs in the Plane Using Spanning Trees - On Characterizations of Rigid Graphs in the Plane. Graphs and Combinatorics 25(2): 139-144 (2009)

Mehmet Baysan, Kamil Saraç, R. Chandrasekaran, Sergey Bereg: A Polynomial Time Solution to Minimum Forwarding Set Problem in Wireless Networks under Unit Disk Coverage Model. IEEE Trans. Parallel Distrib. Syst. 20(7): 913-924 (2009)

Sergey Bereg, David G. Kirkpatrick: Approximating Barrier Resilience in Wireless Sensor Networks. ALGOSENSORS 2009: 29-40

Tetsuo Asano, Sergey Bereg, David G. Kirkpatrick: Finding Nearest Larger Neighbors. Efficient Algorithms 2009: 249-260

Lichen Bao, Sergey Bereg: Counting Faces in Split Networks. ISBRA 2009: 112-123

Sergey Bereg, Minghui Jiang, Boting Yang, Binhai Zhu: On the Red/Blue Spanning Tree Problem. TAMC 2009: 118-127

Sergey Bereg: Efficient algorithms for the d-dimensional rigidity matroid of sparse graphs. Comput. Geom. 40(1): 37-44 (2008)

Oswin Aichholzer, Sergey Bereg, Adrian Dumitrescu, Alfredo García Olaverri, Clemens Huemer, Ferran Hurtado, Mikio Kano, Alberto Márquez, David Rappaport, Shakhar Smorodinsky, Diane L. Souvaine, Jorge Urrutia, David R. Wood: Compatible Geometric Matchings. Electronic Notes in Discrete Mathematics 31: 201-206 (2008)

Sergey Bereg, Adrian Dumitrescu, János Pach: Sliding Disks in the Plane. Int. J. Comput. Geometry Appl. 18(5): 373-387 (2008)

Lichen Bao, Sergey Bereg: Clustered SplitsNetworks. COCOA 2008: 469-478

Sergey Bereg, Kevin Buchin, Maike Buchin, Marina L. Gavrilova, Binhai Zhu: Voronoi Diagram of Polygonal Chains under the Discrete Fréchet Distance. COCOON 2008: 352-362

Lichen Bao, Sergey Bereg, Ovidiu Daescu, Simeon C. Ntafos, Junqiang Zhou: On Some City Guarding Problems. COCOON 2008: 600-610

Russell Tempero, Sergey Bereg, Xiangxu Meng, Changhe Tu, Chenglei Yang, Binhai Zhu: Automatically Approximating 3D Points with Co-Axisal Objects. ICCSA Workshops 2008: 373-381

Sergey Bereg, Minghui Jiang, Wencheng Wang, Boting Yang, Binhai Zhu: Simplifying 3D Polygonal Chains Under the Discrete Fréchet Distance. LATIN 2008: 630-641

Sergey Bereg, Adrian Dumitrescu, Minghui Jiang: On Covering Problems of Rado. SWAT 2008: 294-305

Sergey Bereg, Marina L. Gavrilova, Yuanyi Zhang: Robust Point-Location in Generalized Voronoi Diagrams. Generalized Voronoi Diagram 2008: 285-299

Sergey Bereg, José Miguel Díaz-Báñez, Carlos Seara, Inmaculada Ventura: On finding widest empty curved corridors. Comput. Geom. 38(3): 154-169 (2007)

Sergey Bereg, Hao Wang: Wiener indices of balanced binary trees. Discrete Applied Mathematics 155(4): 457-467 (2007)

Sergey Bereg, Marcin Kubica, Tomasz Walen, Binhai Zhu: RNA multiple structural alignment with longest common subsequences. J. Comb. Optim. 13(2): 179-188 (2007)

Sergey Bereg, Yuanyi Zhang: Phylogenetic Networks Based on the Molecular Clock Hypothesis. IEEE/ACM Trans. Comput. Biology Bioinform. 4(4): 661-667 (2007)

Sergey Bereg, Prosenjit Bose, Adrian Dumitrescu, Ferran Hurtado, Pavel Valtr: Traversing a set of points with a minimum number of turns. Symposium on Computational Geometry 2007: 46-55

Sergey Bereg, Hiro Ito: Transforming Graphs with the Same Degree Sequence. KyotoCGGT 2007: 25-32

Sergey Bereg, Markus Völker, Alexander Wolff, Yuanyi Zhang: Straightening Drawings of Clustered Hierarchical Graphs. SOFSEM (1) 2007: 176-187

Sergey Bereg, Marina L. Gavrilova, Binhai Zhu: Voronoi Diagram of Polygonal Chains under the Discrete Fréchet Distance. CoRR abs/0705.2835 (2007)

Sergey Bereg: Faster Algorithms for Rigidity in the Plane. CoRR abs/0711.2835 (2007)

Sergey Bereg, Prosenjit Bose, David G. Kirkpatrick: Equitable subdivisions within polygonal regions. Comput. Geom. 34(1): 20-27 (2006)

Manuel Abellanas, Sergey Bereg, Ferran Hurtado, Alfredo García Olaverri, David Rappaport, Javier Tejel: Moving coins. Comput. Geom. 34(1): 35-48 (2006)

Sergey Bereg, Adrian Dumitrescu: The Lifting Model for Reconfiguration. Discrete & Computational Geometry 35(4): 653-669 (2006)

Sergey Bereg, Binay K. Bhattacharya, David G. Kirkpatrick, Michael Segal: Competitive Algorithms for Maintaining a Mobile Center. MONET 11(2): 177-186 (2006)

Sergey Bereg, Ovidiu Daescu, Minghui Jiang: A PTAS for Cutting Out Polygons with Lines. COCOON 2006: 176-185

Sergey Bereg: Recent Developments and Open Problems in Voronoi Diagrams. ISVD 2006: 4-5

Sergey Bereg, Yuanyi Zhang, Marina L. Gavrilova: Robust Point-Location in Generalized Voronoi Diagrams. ISVD 2006: 54-59

Sergey Bereg, Nikolaus Mutsanas, Alexander Wolff: Matching Points with Rectangles and Squares. SOFSEM 2006: 177-186

Sergey Bereg: Enumerating pseudo-triangulations in the plane. Comput. Geom. 30(3): 207-222 (2005)

Sergey Bereg: Equipartitions of Measures by 2-Fans. Discrete & Computational Geometry 34(1): 87-96 (2005)

Igor Averbakh, Sergey Bereg: Facility location problems with uncertainty on the plane. Discrete Optimization 2(1): 3-34 (2005)

Sergey Bereg: An approximate morphing between polylines. Int. J. Comput. Geometry Appl. 15(2): 193-208 (2005)

Sergey Bereg, Kathryn Bean: Constructing Phylogenetic Networks from Trees. BIBE 2005: 299-305

Sergey Bereg, Yuanyi Zhang: Phylogenetic Networks Based on the Molecular Clock Hypothesis. BIBE 2005: 320-323

Sergey Bereg, Binhai Zhu: RNA Multiple Structural Alignment with Longest Common Subsequences. COCOON 2005: 32-41

Sergey Bereg, Adrian Dumitrescu: The lifting model for reconfiguration. Symposium on Computational Geometry 2005: 55-62

Sergey Bereg: Certifying and constructing minimally rigid graphs in the plane. Symposium on Computational Geometry 2005: 73-80

Sergey Bereg, David G. Kirkpatrick: Curvature-bounded traversals of narrow corridors. Symposium on Computational Geometry 2005: 278-287

Pankaj K. Agarwal, Sergey Bereg, Ovidiu Daescu, Haim Kaplan, Simeon C. Ntafos, Binhai Zhu: Guarding a terrain by two watchtowers. Symposium on Computational Geometry 2005: 346-355

Sergey Bereg, Hao Wang: Wiener Indices of Balanced Binary Trees. International Conference on Computational Science (2) 2005: 851-859

Michael J. Spriggs, J. Mark Keil, Sergei Bespamyatnikh, Michael Segal, Jack Snoeyink: Computing a (1+epsilon)-Approximate Geometric Minimum-Diameter Spanning Tree. Algorithmica 38(4): 577-589 (2004)

Yih-En Andrew Ban, Sergey Bereg, Nabil H. Mustafa: A Conjecture on Wiener Indices in Combinatorial Chemistry. Algorithmica 40(2): 99-117 (2004)

Sergey Bereg: Cylindrical hierarchy for deforming necklaces. Int. J. Comput. Geometry Appl. 14(1-2): 3-17 (2004)

Sergey Bereg: Transforming pseudo-triangulations. Inf. Process. Lett. 90(3): 141-145 (2004)

Sergei Bespamyatnikh, Michael Segal: Selecting distances in arrangements of hyperplanes spanned by points. J. Discrete Algorithms 2(3): 333-345 (2004)

Sergey Bereg, Michael Segal: Dynamic Algorithms for Approximating Interdistances. Nord. J. Comput. 11(4): 344-355 (2004)

Francois Anton, Sergey Bereg: The fitting line problem in the laguerre geometry. CCCG 2004: 166-169

Sergey Bereg: Equipartitions of Measures by 2-Fans. ISAAC 2004: 149-158

Minghui Jiang, Sergey Bereg, Zhongping Qin, Binhai Zhu: New Bounds on Map Labeling with Circular Labels. ISAAC 2004: 606-617

Sergey Bereg: Algorithms for the d-Dimensional Rigidity Matroid of Sparse Graphs. JCDCG 2004: 29-36

Sergey Bereg, Adrian Dumitrescu, János Pach: Sliding Disks in the Plane. JCDCG 2004: 37-47

Sergei Bespamyatnikh: Encoding Homotopy of Paths in the Plane. LATIN 2004: 329-338

Sergey Bereg: Reconstruction of gt-Networks from Gene Trees. METMBS 2004: 336-340

Sergei Bespamyatnikh: An O(nlogn) algorithm for the zoo-keeper's problem. Comput. Geom. 24(2): 63-74 (2003)

Sergei Bespamyatnikh: Computing Closest Points for Segments. Int. J. Comput. Geometry Appl. 13(5): 419-438 (2003)

Sergei Bespamyatnikh: Computing homotopic shortest paths in the plane. J. Algorithms 49(2): 284-303 (2003)

Sergey Bereg, Andrei Kelarev: An Algorithm for Analysis of Images in Spatial Information Systems. Journal of Automata, Languages and Combinatorics 8(4): 557-565 (2003)

Sergei Bespamyatnikh, Andrei Kelarev: Algorithms for shortest paths and d-cycle problems. J. Discrete Algorithms 1(1): 1-9 (2003)

Michael J. Spriggs, J. Mark Keil, Sergei Bespamyatnikh, Michael Segal, Jack Snoeyink: Approximating the geometric minimum-diameter spanning tree. CCCG 2003: 39-42

Marina L. Gavrilova, Sergei Bespamyatnikh: On exact solution of a point-location problem in a system of d-dimensional hyperbolic surfaces. CCCG 2003: 136-139

Sergei Bespamyatnikh: Cylindrical Hierarchy for Deforming Necklaces. COCOON 2003: 20-29

Yih-En Andrew Ban, Sergei Bespamyatnikh, Nabil H. Mustafa: On a Conjecture on Wiener Indices in Combinatorial Chemistry. COCOON 2003: 509-518

Sergei Bespamyatnikh, Michael Segal: Dynamic Algorithms for Approximating Interdistances. ICALP 2003: 1169-1180

Sergei Bespamyatnikh: Transforming Pseudo-Triangulations. International Conference on Computational Science 2003: 533-539

Sergei Bespamyatnikh: An Approximate Morphing between Polylines. ICCSA (3) 2003: 807-816

Sergei Bespamyatnikh: Computing homotopic shortest paths in the plane. SODA 2003: 609-617

Sergei Bespamyatnikh, Michael Segal: Fast Algorithms for Approximating Distances. Algorithmica 33(2): 263-269 (2002)

Sergei Bespamyatnikh: Packing two disks in a polygon. Comput. Geom. 23(1): 31-42 (2002)

Sergei Bespamyatnikh: An efficient algorithm for enumeration of triangulations. Comput. Geom. 23(3): 271-279 (2002)

Sergei Bespamyatnikh: An Optimal Morphing Between Polylines. Int. J. Comput. Geometry Appl. 12(3): 217-228 (2002)

Sergei Bespamyatnikh, Binay K. Bhattacharya, J. Mark Keil, David G. Kirkpatrick, Michael Segal: Efficient algorithms for centers and medians in interval and circular-arc graphs. Networks 39(3): 144-152 (2002)

Sergei Bespamyatnikh: Computing closest points for segments. CCCG 2002: 118-122

Sergei Bespamyatnikh: Enumerating pseudo-triangulations in the plane. CCCG 2002: 162-166

Sergei Bespamyatnikh, Binay K. Bhattacharya, David G. Kirkpatrick, Michael Segal: Lower and Upper Bounds for Tracking Mobile Users. IFIP TCS 2002: 47-58

Sergei Bespamyatnikh: On Partitioning a Cake. JCDCG 2002: 60-71

Sergei Bespamyatnikh, David G. Kirkpatrick: Constrained Equitable 3-Cuttings. JCDCG 2002: 72-83

Sergei Bespamyatnikh: An Efficient Algorithm for the Three-Dimensional Diameter Problem. Discrete & Computational Geometry 25(2): 235-255 (2001)

Sergei Bespamyatnikh, Zhixiang Chen, Kanliang Wang, Binhai Zhu: On the Planar Two-Watchtower Problem. COCOON 2001: 121-130

Sergei Bespamyatnikh: Enumerating Triangulations of Convex Polytopes. DM-CCG 2001: 111-122

Sergei Bespamyatnikh, Michael Segal: Fast Maintenance of Rectilinear Centers. International Conference on Computational Science (1) 2001: 633-639

Sergei Bespamyatnikh, Jack Snoeyink: Queries with segments in Voronoi diagrams. Comput. Geom. 16(1): 23-33 (2000)

Sergei Bespamyatnikh, David G. Kirkpatrick, Jack Snoeyink: Generalizing Ham Sandwich Cuts to Equitable Subdivisions. Discrete & Computational Geometry 24(4): 605-622 (2000)

Sergei Bespamyatnikh, Klara Kedem, Michael Segal, Arie Tamir: Optimal Facility Location Under Various Distance Functions. Int. J. Comput. Geometry Appl. 10(5): 523-534 (2000)

Sergei Bespamyatnikh, Michael Segal: Covering a set of points by two axis-parallel boxes. Inf. Process. Lett. 75(3): 95-100 (2000)

Sergei Bespamyatnikh, Michael Segal: Enumerating longest increasing subsequences and patience sorting. Inf. Process. Lett. 76(1-2): 7-11 (2000)

Sergei Bespamyatnikh, Binay K. Bhattacharya, David G. Kirkpatrick, Michael Segal: Mobile facility location. DIAL-M 2000: 46-53

Sergei Bespamyatnikh, Binay K. Bhattacharya, J. Mark Keil, David G. Kirkpatrick, Michael Segal: Efficient Algorithms for Centers and Medians in Interval and Circular-Arc Graphs. ESA 2000: 100-111

Sergei Bespamyatnikh, David G. Kirkpatrick: Rectilinear 2-center problems. CCCG 1999

Sergei Bespamyatnikh, David G. Kirkpatrick, Jack Snoeyink: Generalizing Ham Sandwich Cuts to Equitable Subdivisions. Symposium on Computational Geometry 1999: 49-58

Sergei Bespamyatnikh, Jack Snoeyink: Queries with Segments in Voronoi Diagrams. SODA 1999: 122-129

Sergei Bespamyatnikh, Michael Segal: Rectilinear Static and Dynamic Discrete 2-center Problems. WADS 1999: 276-287

Sergei Bespamyatnikh, Klara Kedem, Michael Segal: Optimal Facility Location under Various Distance Functions. WADS 1999: 318-329

Sergei Bespamyatnikh: An Optimal Algorithm for Closest-Pair Maintenance. Discrete & Computational Geometry 19(2): 175-195 (1998)

Sergei Bespamyatnikh: An Efficient Algorithm for the Three-Dimensional Diameter Problem. SODA 1998: 137-146

Sergei Bespamyatnikh: On Constructing Minimum Spanning Trees in R^k_l. Algorithmica 18(4): 524-529 (1997)

Sergei Bespamyatnikh, Michael Segal: Covering a set of points by two axis-parallel boxes. CCCG 1997

Sergei Bespamyatnikh: An Optimal Algorithm for Dynamic Post-office Problem in R21 and Related Problems. CCCG 1996: 101-106

Sergei Bespamyatnikh: Dynamic Algorithms for Approximate Neighbor Searching. CCCG 1996: 252-257

Sergei Bespamyatnikh: An Optimal Algorithm for Closest Pair Maintenance (Extended Abstract). Symposium on Computational Geometry 1995: 152-161

Sergei Bespamyatnikh: The Region Approach for some Dynamic Closest-Point Problems. CCCG 1994: 75-80