Sergey Bereg

Sergei Bespamyatnikh

	2012
120		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)
119		Paul Phipps, Sergey Bereg: Optimizing Phylogenetic Networks for Circular Split Systems. IEEE/ACM Trans. Comput. Biology Bioinform. 9(2): 535-547 (2012)
118		Sergey Bereg: Computing generalized ham-sandwich cuts. Inf. Process. Lett. 112(13): 532-534 (2012)
	2011
117		Sergey Pupyrev, Lev Nachmanson, Sergey Bereg, Alexander E. Holroyd: Edge Routing with Ordered Bundles. Graph Drawing 2011: 136-147
116		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)
115		Sergey Bereg, Minghui Jiang, Boting Yang, Binhai Zhu: On the red/blue spanning tree problem. Theor. Comput. Sci. 412(23): 2459-2467 (2011)
	2010
114		Sergey Bereg: Orthogonal Ham-Sandwich Theorem in R3. SODA 2010: 1605-1612
113		Sergey Bereg, Adrian Dumitrescu, Minghui Jiang: On Covering Problems of Rado. Algorithmica 57(3): 538-561 (2010)
112		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)
111		Sergey Bereg, Adrian Dumitrescu, Minghui Jiang: Maximum Area Independent Sets in Disk Intersection Graphs. Int. J. Comput. Geometry Appl. 20(2): 105-118 (2010)
110		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)
	2009
109		Sergey Bereg, David G. Kirkpatrick: Approximating Barrier Resilience in Wireless Sensor Networks. ALGOSENSORS 2009: 29-40
108		Tetsuo Asano, Sergey Bereg, David G. Kirkpatrick: Finding Nearest Larger Neighbors. Efficient Algorithms 2009: 249-260
107		Lichen Bao, Sergey Bereg: Counting Faces in Split Networks. ISBRA 2009: 112-123
106		Sergey Bereg, Minghui Jiang, Boting Yang, Binhai Zhu: On the Red/Blue Spanning Tree Problem. TAMC 2009: 118-127
105		Sergey Bereg, Ovidiu Daescu, Minghui Jiang: A PTAS for Cutting Out Polygons with Lines. Algorithmica 53(2): 157-171 (2009)
104		Sergey Bereg, Nikolaus Mutsanas, Alexander Wolff: Matching points with rectangles and squares. Comput. Geom. 42(2): 93-108 (2009)
103		Sergey Bereg: Orthogonal equipartitions. Comput. Geom. 42(4): 305-314 (2009)
102		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)
101		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)
100		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)
99		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
98		Lichen Bao, Sergey Bereg: Clustered SplitsNetworks. COCOA 2008: 469-478
97		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
96		Lichen Bao, Sergey Bereg, Ovidiu Daescu, Simeon C. Ntafos, Junqiang Zhou: On Some City Guarding Problems. COCOON 2008: 600-610
95		Sergey Bereg, Minghui Jiang, Wencheng Wang, Boting Yang, Binhai Zhu: Simplifying 3D Polygonal Chains Under the Discrete Fréchet Distance. LATIN 2008: 630-641
94		Sergey Bereg, Adrian Dumitrescu, Minghui Jiang: On Covering Problems of Rado. SWAT 2008: 294-305
93		Sergey Bereg, Marina L. Gavrilova, Yuanyi Zhang: Robust Point-Location in Generalized Voronoi Diagrams. Generalized Voronoi Diagram 2008: 285-299
92		Sergey Bereg: Efficient algorithms for the d-dimensional rigidity matroid of sparse graphs. Comput. Geom. 40(1): 37-44 (2008)
91		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)
90		Sergey Bereg, Adrian Dumitrescu, János Pach: Sliding Disks in the Plane. Int. J. Comput. Geometry Appl. 18(5): 373-387 (2008)
	2007
89		Sergey Bereg, Hiro Ito: Transforming Graphs with the Same Degree Sequence. KyotoCGGT 2007: 25-32
88		Sergey Bereg, Markus Völker, Alexander Wolff, Yuanyi Zhang: Straightening Drawings of Clustered Hierarchical Graphs. SOFSEM (1) 2007: 176-187
87		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
86		Sergey Bereg, Marina L. Gavrilova, Binhai Zhu: Voronoi Diagram of Polygonal Chains under the Discrete Fréchet Distance CoRR abs/0705.2835: (2007)
85		Sergey Bereg: Faster Algorithms for Rigidity in the Plane CoRR abs/0711.2835: (2007)
84		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)
83		Sergey Bereg, Hao Wang: Wiener indices of balanced binary trees. Discrete Applied Mathematics 155(4): 457-467 (2007)
82		Sergey Bereg, Yuanyi Zhang: Phylogenetic Networks Based on the Molecular Clock Hypothesis. IEEE/ACM Trans. Comput. Biology Bioinform. 4(4): 661-667 (2007)
81		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
80		Sergey Bereg, Ovidiu Daescu, Minghui Jiang: A PTAS for Cutting Out Polygons with Lines. COCOON 2006: 176-185
79		Sergey Bereg: Recent Developments and Open Problems in Voronoi Diagrams. ISVD 2006: 4-5
78		Sergey Bereg, Yuanyi Zhang, Marina L. Gavrilova: Robust Point-Location in Generalized Voronoi Diagrams. ISVD 2006: 54-59
77		Sergey Bereg, Nikolaus Mutsanas, Alexander Wolff: Matching Points with Rectangles and Squares. SOFSEM 2006: 177-186
76		Sergey Bereg, Prosenjit Bose, David G. Kirkpatrick: Equitable subdivisions within polygonal regions. Comput. Geom. 34(1): 20-27 (2006)
75		Manuel Abellanas, Sergey Bereg, Ferran Hurtado, Alfredo García Olaverri, David Rappaport, Javier Tejel: Moving coins. Comput. Geom. 34(1): 35-48 (2006)
74		Sergey Bereg, Adrian Dumitrescu: The Lifting Model for Reconfiguration. Discrete & Computational Geometry 35(4): 653-669 (2006)
73		Sergey Bereg, Binay K. Bhattacharya, David G. Kirkpatrick, Michael Segal: Competitive Algorithms for Maintaining a Mobile Center. MONET 11(2): 177-186 (2006)
	2005
72		Sergey Bereg, Kathryn Bean: Constructing Phylogenetic Networks from Trees. BIBE 2005: 299-305
71		Sergey Bereg, Yuanyi Zhang: Phylogenetic Networks Based on the Molecular Clock Hypothesis. BIBE 2005: 320-323
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, David G. 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	[75]
2	Pankaj K. Agarwal	[67] [112]
3	Oswin Aichholzer	[91] [102]
4	Francois Anton (François Anton)	[60]
5	Tetsuo Asano	[108]
6	Igor Averbakh	[62]
7	Yih-En Andrew Ban	[44] [52]
8	Lichen Bao	[96] [98] [107]
9	Mehmet Baysan	[99]
10	Kathryn Bean	[72]
11	Binay K. Bhattacharya	[19] [20] [25] [32] [73]
12	Prosenjit Bose	[76] [87] [101]
13	Kevin Buchin	[97] [110]
14	Maike Buchin	[97] [110]
15	Sergio Cabello	[120]
16	Ramaswamy Chandrasekaran (R. Chandrasekaran)	[99]
17	Zhixiang Chen	[24]
18	Ovidiu Daescu	[67] [80] [96] [105] [112]
19	José Miguel Díaz-Báñez	[84] [116] [120]
20	Adrian Dumitrescu	[56] [66] [74] [87] [90] [91] [94] [101] [102] [111] [113]
21	Marina L. Gavrilova	[47] [78] [86] [93] [97] [110]
22	Alexander E. Holroyd	[117]
23	Clemens Huemer	[91] [102]
24	Ferran Hurtado	[75] [87] [91] [101] [102]
25	Hiro Ito	[89]
26	Minghui Jiang	[58] [80] [94] [95] [105] [106] [111] [113] [115]
27	Mikio Kano (M. Kano)	[91] [102]
28	Haim Kaplan	[67] [112]
29	Klara Kedem	[9] [14]
30	J. Mark Keil	[19] [25] [46] [53]
31	Andrei Kelarev (A. V. Kelarev)	[35] [36]
32	David G. Kirkpatrick	[11] [13] [17] [19] [20] [25] [30] [32] [68] [73] [76] [108] [109]
33	Marcin Kubica	[81]
34	Alberto Márquez	[91] [102]
35	Nabil H. Mustafa	[44] [52]
36	Nikolaus Mutsanas	[77] [104]
37	Lev Nachmanson	[117]
38	Simeon C. Ntafos	[67] [96] [112]
39	Alfredo García Olaverri	[75] [91] [102]
40	János Pach	[56] [90]
41	Pablo Pérez-Lantero	[116] [120]
42	Paul Phipps	[119]
43	Sergey Pupyrev	[117]
44	Zhongping Qin	[58]
45	David Rappaport	[75] [91] [102]
46	Kamil Saraç	[99]
47	Carlos Seara	[84] [120]
48	Michael Segal	[6] [9] [10] [14] [15] [16] [19] [20] [22] [25] [29] [32] [43] [46] [48] [49] [53] [73]
49	Micha Sharir	[112]
50	Shakhar Smorodinsky	[91] [102]
51	Jack Snoeyink	[11] [12] [17] [18] [46] [53]
52	Diane L. Souvaine	[91] [102]
53	Michael J. Spriggs	[46] [53]
54	Arie Tamir	[14]
55	Javier Tejel	[75]
56	Jorge Urrutia	[91] [102]
57	Pavel Valtr	[87] [101]
58	Inmaculada Ventura	[84] [116] [120]
59	Markus Völker	[88]
60	Tomasz Walen	[81]
61	Hao Wang	[69] [83]
62	Kanliang Wang	[24]
63	Wencheng Wang	[95]
64	Alexander Wolff	[77] [88] [104]
65	David R. Wood	[91] [102]
66	Boting Yang (Bo-Ting Yang)	[95] [106] [115]
67	Yuanyi Zhang	[71] [78] [82] [88] [93]
68	Junqiang Zhou	[96]
69	Binhai Zhu	[24] [58] [67] [70] [81] [86] [95] [97] [106] [110] [112] [115]

Colors in the list of coauthors

Last update Thu May 24 01:13:30 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page