Sergey Bereg

Sergei Bespamyatnikh

	2009
102		Tetsuo Asano, Sergey Bereg, David G. Kirkpatrick: Finding Nearest Larger Neighbors. Efficient Algorithms 2009: 249-260
101		Lichen Bao, Sergey Bereg: Counting Faces in Split Networks. ISBRA 2009: 112-123
100		Sergey Bereg, Minghui Jiang, Boting Yang, Binhai Zhu: On the Red/Blue Spanning Tree Problem. TAMC 2009: 118-127
99		Sergey Bereg, Ovidiu Daescu, Minghui Jiang: A PTAS for Cutting Out Polygons with Lines. Algorithmica 53(2): 157-171 (2009)
98		Sergey Bereg, Nikolaus Mutsanas, Alexander Wolff: Matching points with rectangles and squares. Comput. Geom. 42(2): 93-108 (2009)
97		Sergey Bereg: Orthogonal equipartitions. Comput. Geom. 42(4): 305-314 (2009)
96		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)
95		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)
	2008
94		Lichen Bao, Sergey Bereg: Clustered SplitsNetworks. COCOA 2008: 469-478
93		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
92		Lichen Bao, Sergey Bereg, Ovidiu Daescu, Simeon C. Ntafos, Junqiang Zhou: On Some City Guarding Problems. COCOON 2008: 600-610
91		Sergey Bereg, Minghui Jiang, Wencheng Wang, Boting Yang, Binhai Zhu: Simplifying 3D Polygonal Chains Under the Discrete Fréchet Distance. LATIN 2008: 630-641
90		Sergey Bereg, Adrian Dumitrescu, Minghui Jiang: On Covering Problems of Rado. SWAT 2008: 294-305
89		Sergey Bereg, Marina L. Gavrilova, Yuanyi Zhang: Robust Point-Location in Generalized Voronoi Diagrams. Generalized Voronoi Diagram 2008: 285-299
88		Sergey Bereg: Efficient algorithms for the d-dimensional rigidity matroid of sparse graphs. Comput. Geom. 40(1): 37-44 (2008)
87		Oswin Aichholzer, Sergey Bereg, Adrian Dumitrescu, Alfredo García, 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)
86		Sergey Bereg, Adrian Dumitrescu, János Pach: Sliding Disks in the Plane. Int. J. Comput. Geometry Appl. 18(5): 373-387 (2008)
	2007
85		Sergey Bereg, Markus Völker, Alexander Wolff, Yuanyi Zhang: Straightening Drawings of Clustered Hierarchical Graphs. SOFSEM (1) 2007: 176-187
84		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
83		Sergey Bereg, Marina L. Gavrilova, Binhai Zhu: Voronoi Diagram of Polygonal Chains under the Discrete Fréchet Distance CoRR abs/0705.2835: (2007)
82		Sergey Bereg: Faster Algorithms for Rigidity in the Plane CoRR abs/0711.2835: (2007)
81		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)
80		Sergey Bereg, Hao Wang: Wiener indices of balanced binary trees. Discrete Applied Mathematics 155(4): 457-467 (2007)
79		Sergey Bereg, Yuanyi Zhang: Phylogenetic Networks Based on the Molecular Clock Hypothesis. IEEE/ACM Trans. Comput. Biology Bioinform. 4(4): 661-667 (2007)
78		Sergey Bereg, Marcin Kubica, Tomasz Walen, Binhai Zhu: RNA multiple structural alignment with longest common subsequences. J. Comb. Optim. 13(2): 179-188 (2007)
	2006
77		Sergey Bereg, Ovidiu Daescu, Minghui Jiang: A PTAS for Cutting Out Polygons with Lines. COCOON 2006: 176-185
76		Sergey Bereg, Nikolaus Mutsanas, Alexander Wolff: Matching Points with Rectangles and Squares. SOFSEM 2006: 177-186
75		Sergey Bereg, Prosenjit Bose, J. David Kirkpatrick: Equitable subdivisions within polygonal regions. Comput. Geom. 34(1): 20-27 (2006)
74		Manuel Abellanas, Sergey Bereg, Ferran Hurtado, Alfredo García Olaverri, David Rappaport, Javier Tejel: Moving coins. Comput. Geom. 34(1): 35-48 (2006)
73		Sergey Bereg, Adrian Dumitrescu: The Lifting Model for Reconfiguration. Discrete & Computational Geometry 35(4): 653-669 (2006)
72		Sergey Bereg, Binay K. Bhattacharya, David G. Kirkpatrick, Michael Segal: Competitive Algorithms for Maintaining a Mobile Center. MONET 11(2): 177-186 (2006)
	2005
71		Sergey Bereg, Kathryn Bean: Constructing Phylogenetic Networks from Trees. BIBE 2005: 299-305
70		Sergey Bereg, Binhai Zhu: RNA Multiple Structural Alignment with Longest Common Subsequences. COCOON 2005: 32-41
69		Sergey Bereg, Hao Wang: Wiener Indices of Balanced Binary Trees. International Conference on Computational Science (2) 2005: 851-859
68		Sergey Bereg, David G. Kirkpatrick: Curvature-bounded traversals of narrow corridors. Symposium on Computational Geometry 2005: 278-287
67		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
66		Sergey Bereg, Adrian Dumitrescu: The lifting model for reconfiguration. Symposium on Computational Geometry 2005: 55-62
65		Sergey Bereg: Certifying and constructing minimally rigid graphs in the plane. Symposium on Computational Geometry 2005: 73-80
64		Sergey Bereg: Enumerating pseudo-triangulations in the plane. Comput. Geom. 30(3): 207-222 (2005)
63		Sergey Bereg: Equipartitions of Measures by 2-Fans. Discrete & Computational Geometry 34(1): 87-96 (2005)
62		Igor Averbakh, Sergey Bereg: Facility location problems with uncertainty on the plane. Discrete Optimization 2(1): 3-34 (2005)
61		Sergey Bereg: An approximate morphing between polylines. Int. J. Comput. Geometry Appl. 15(2): 193-208 (2005)
	2004
60		Francois Anton, Sergey Bereg: The fitting line problem in the laguerre geometry. CCCG 2004: 166-169
59		Sergey Bereg: Equipartitions of Measures by 2-Fans. ISAAC 2004: 149-158
58		Minghui Jiang, Sergey Bereg, Zhongping Qin, Binhai Zhu: New Bounds on Map Labeling with Circular Labels. ISAAC 2004: 606-617
57		Sergey Bereg: Algorithms for the d-Dimensional Rigidity Matroid of Sparse Graphs. JCDCG 2004: 29-36
56		Sergey Bereg, Adrian Dumitrescu, János Pach: Sliding Disks in the Plane. JCDCG 2004: 37-47
55		Sergei Bespamyatnikh: Encoding Homotopy of Paths in the Plane. LATIN 2004: 329-338
54		Sergey Bereg: Reconstruction of gt-Networks from Gene Trees. METMBS 2004: 336-340
53		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)
52		Yih-En Andrew Ban, Sergey Bereg, Nabil H. Mustafa: A Conjecture on Wiener Indices in Combinatorial Chemistry. Algorithmica 40(2): 99-117 (2004)
51		Sergey Bereg: Transforming pseudo-triangulations. Inf. Process. Lett. 90(3): 141-145 (2004)
50		Sergey Bereg: Cylindrical hierarchy for deforming necklaces. Int. J. Comput. Geometry Appl. 14(1-2): 3-17 (2004)
49		Sergei Bespamyatnikh, Michael Segal: Selecting distances in arrangements of hyperplanes spanned by points. J. Discrete Algorithms 2(3): 333-345 (2004)
48		Sergey Bereg, Michael Segal: Dynamic Algorithms for Approximating Interdistances. Nord. J. Comput. 11(4): 344-355 (2004)
	2003
47		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
46		Michael J. Spriggs, J. Mark Keil, Sergei Bespamyatnikh, Michael Segal, Jack Snoeyink: Approximating the geometric minimum-diameter spanning tree. CCCG 2003: 39-42
45		Sergei Bespamyatnikh: Cylindrical Hierarchy for Deforming Necklaces. COCOON 2003: 20-29
44		Yih-En Andrew Ban, Sergei Bespamyatnikh, Nabil H. Mustafa: On a Conjecture on Wiener Indices in Combinatorial Chemistry. COCOON 2003: 509-518
43		Sergei Bespamyatnikh, Michael Segal: Dynamic Algorithms for Approximating Interdistances. ICALP 2003: 1169-1180
42		Sergei Bespamyatnikh: An Approximate Morphing between Polylines. ICCSA (3) 2003: 807-816
41		Sergei Bespamyatnikh: Transforming Pseudo-Triangulations. International Conference on Computational Science 2003: 533-539
40		Sergei Bespamyatnikh: Computing homotopic shortest paths in the plane. SODA 2003: 609-617
39		Sergei Bespamyatnikh: An O(nlogn) algorithm for the zoo-keeper's problem. Comput. Geom. 24(2): 63-74 (2003)
38		Sergei Bespamyatnikh: Computing Closest Points for Segments. Int. J. Comput. Geometry Appl. 13(5): 419-438 (2003)
37		Sergei Bespamyatnikh: Computing homotopic shortest paths in the plane. J. Algorithms 49(2): 284-303 (2003)
36		Sergei Bespamyatnikh, Andrei Kelarev: Algorithms for shortest paths and d-cycle problems. J. Discrete Algorithms 1(1): 1-9 (2003)
35		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)
	2002
34		Sergei Bespamyatnikh: Computing closest points for segments. CCCG 2002: 118-122
33		Sergei Bespamyatnikh: Enumerating pseudo-triangulations in the plane. CCCG 2002: 162-166
32		Sergei Bespamyatnikh, Binay K. Bhattacharya, David G. Kirkpatrick, Michael Segal: Lower and Upper Bounds for Tracking Mobile Users. IFIP TCS 2002: 47-58
31		Sergei Bespamyatnikh: On Partitioning a Cake. JCDCG 2002: 60-71
30		Sergei Bespamyatnikh, David G. Kirkpatrick: Constrained Equitable 3-Cuttings. JCDCG 2002: 72-83
29		Sergei Bespamyatnikh, Michael Segal: Fast Algorithms for Approximating Distances. Algorithmica 33(2): 263-269 (2002)
28		Sergei Bespamyatnikh: Packing two disks in a polygon. Comput. Geom. 23(1): 31-42 (2002)
27		Sergei Bespamyatnikh: An efficient algorithm for enumeration of triangulations. Comput. Geom. 23(3): 271-279 (2002)
26		Sergei Bespamyatnikh: An Optimal Morphing Between Polylines. Int. J. Comput. Geometry Appl. 12(3): 217-228 (2002)
25		Sergei Bespamyatnikh, Binay K. Bhattacharya, J. Mark Keil, J. David Kirkpatrick, Michael Segal: Efficient algorithms for centers and medians in interval and circular-arc graphs. Networks 39(3): 144-152 (2002)
	2001
24		Sergei Bespamyatnikh, Zhixiang Chen, Kanliang Wang, Binhai Zhu: On the Planar Two-Watchtower Problem. COCOON 2001: 121-130
23		Sergei Bespamyatnikh: Enumerating Triangulations of Convex Polytopes. DM-CCG 2001: 111-122
22		Sergei Bespamyatnikh, Michael Segal: Fast Maintenance of Rectilinear Centers. International Conference on Computational Science (1) 2001: 633-639
21		Sergei Bespamyatnikh: An Efficient Algorithm for the Three-Dimensional Diameter Problem. Discrete & Computational Geometry 25(2): 235-255 (2001)
	2000
20		Sergei Bespamyatnikh, Binay K. Bhattacharya, David G. Kirkpatrick, Michael Segal: Mobile facility location. DIAL-M 2000: 46-53
19		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
18		Sergei Bespamyatnikh, Jack Snoeyink: Queries with segments in Voronoi diagrams. Comput. Geom. 16(1): 23-33 (2000)
17		Sergei Bespamyatnikh, David G. Kirkpatrick, Jack Snoeyink: Generalizing Ham Sandwich Cuts to Equitable Subdivisions. Discrete & Computational Geometry 24(4): 605-622 (2000)
16		Sergei Bespamyatnikh, Michael Segal: Covering a set of points by two axis-parallel boxes. Inf. Process. Lett. 75(3): 95-100 (2000)
15		Sergei Bespamyatnikh, Michael Segal: Enumerating longest increasing subsequences and patience sorting. Inf. Process. Lett. 76(1-2): 7-11 (2000)
14		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)
	1999
13		Sergei Bespamyatnikh, David G. Kirkpatrick: Rectilinear 2-center problems. CCCG 1999
12		Sergei Bespamyatnikh, Jack Snoeyink: Queries with Segments in Voronoi Diagrams. SODA 1999: 122-129
11		Sergei Bespamyatnikh, David G. Kirkpatrick, Jack Snoeyink: Generalizing Ham Sandwich Cuts to Equitable Subdivisions. Symposium on Computational Geometry 1999: 49-58
10		Sergei Bespamyatnikh, Michael Segal: Rectilinear Static and Dynamic Discrete 2-center Problems. WADS 1999: 276-287
9		Sergei Bespamyatnikh, Klara Kedem, Michael Segal: Optimal Facility Location under Various Distance Functions. WADS 1999: 318-329
	1998
8		Sergei Bespamyatnikh: An Efficient Algorithm for the Three-Dimensional Diameter Problem. SODA 1998: 137-146
7		Sergei Bespamyatnikh: An Optimal Algorithm for Closest-Pair Maintenance. Discrete & Computational Geometry 19(2): 175-195 (1998)
	1997
6		Sergei Bespamyatnikh, Michael Segal: Covering a set of points by two axis-parallel boxes. CCCG 1997
5		Sergei Bespamyatnikh: On Constructing Minimum Spanning Trees in Rkl. Algorithmica 18(4): 524-529 (1997)
	1996
4		Sergei Bespamyatnikh: An Optimal Algorithm for Dynamic Post-office Problem in R21 and Related Problems. CCCG 1996: 101-106
3		Sergei Bespamyatnikh: Dynamic Algorithms for Approximate Neighbor Searching. CCCG 1996: 252-257
	1995
2		Sergei Bespamyatnikh: An Optimal Algorithm for Closest Pair Maintenance (Extended Abstract). Symposium on Computational Geometry 1995: 152-161
	1994
1		Sergei Bespamyatnikh: The Region Approach for some Dynamic Closest-Point Problems. CCCG 1994: 75-80

Coauthor Index

1	Manuel Abellanas	[74]
2	Pankaj K. Agarwal	[67]
3	Oswin Aichholzer	[87]
4	Francois Anton	[60]
5	Tetsuo Asano	[102]
6	Igor Averbakh	[62]
7	Yih-En Andrew Ban	[44] [52]
8	Lichen Bao	[92] [94] [101]
9	Mehmet Baysan	[95]
10	Kathryn Bean	[71]
11	Binay K. Bhattacharya	[19] [20] [25] [32] [72]
12	Prosenjit Bose	[75] [84] [96]
13	Kevin Buchin	[93]
14	Maike Buchin	[93]
15	Ramaswamy Chandrasekaran (R. Chandrasekaran)	[95]
16	Zhixiang Chen	[24]
17	Ovidiu Daescu	[67] [77] [92] [99]
18	José Miguel Díaz-Báñez	[81]
19	Adrian Dumitrescu	[56] [66] [73] [84] [86] [87] [90] [96]
20	Alfredo García	[87]
21	Marina L. Gavrilova	[47] [83] [89] [93]
22	Clemens Huemer	[87]
23	Ferran Hurtado	[74] [84] [87] [96]
24	Minghui Jiang	[58] [77] [90] [91] [99] [100]
25	Mikio Kano (M. Kano)	[87]
26	Haim Kaplan	[67]
27	Klara Kedem	[9] [14]
28	J. Mark Keil	[19] [25] [46] [53]
29	Andrei Kelarev	[35] [36]
30	David G. Kirkpatrick	[11] [13] [17] [19] [20] [30] [32] [68] [72] [102]
31	J. David Kirkpatrick	[25] [75]
32	Marcin Kubica	[78]
33	Alberto Márquez	[87]
34	Nabil H. Mustafa	[44] [52]
35	Nikolaus Mutsanas	[76] [98]
36	Simeon C. Ntafos	[67] [92]
37	Alfredo García Olaverri	[74]
38	János Pach	[56] [86]
39	Zhongping Qin	[58]
40	David Rappaport	[74] [87]
41	Kamil Saraç	[95]
42	Carlos Seara	[81]
43	Michael Segal	[6] [9] [10] [14] [15] [16] [19] [20] [22] [25] [29] [32] [43] [46] [48] [49] [53] [72]
44	Shakhar Smorodinsky	[87]
45	Jack Snoeyink	[11] [12] [17] [18] [46] [53]
46	Diane L. Souvaine	[87]
47	Michael J. Spriggs	[46] [53]
48	Arie Tamir	[14]
49	Javier Tejel	[74]
50	Jorge Urrutia	[87]
51	Pavel Valtr	[84] [96]
52	Inmaculada Ventura	[81]
53	Markus Völker	[85]
54	Tomasz Walen	[78]
55	Hao Wang	[69] [80]
56	Kanliang Wang	[24]
57	Wencheng Wang	[91]
58	Alexander Wolff	[76] [85] [98]
59	David R. Wood	[87]
60	Boting Yang (Bo-Ting Yang)	[91] [100]
61	Yuanyi Zhang	[79] [85] [89]
62	Junqiang Zhou	[92]
63	Binhai Zhu	[24] [58] [67] [70] [78] [83] [91] [93] [100]

Colors in the list of coauthors