| 2010 |
|---|
| 23 | Guarding a Terrain by Two Watchtowers. Pankaj K. Agarwal, Sergey Bereg, Ovidiu Daescu, Haim Kaplan, Simeon C. Ntafos, Micha Sharir, Binhai Zhu. Algorithmica (58): 352-390 (2010). Web SearchBibTeXDownload |
| 2009 |
|---|
| 22 | Approximating Barrier Resilience in Wireless Sensor Networks. Sergey Bereg, David G. Kirkpatrick. ALGOSENSORS 2009, 29-40. Web SearchBibTeXDownload |
| 21 | Finding Nearest Larger Neighbors. Tetsuo Asano, Sergey Bereg, David G. Kirkpatrick. Efficient Algorithms 2009, 249-260. Web SearchBibTeXDownload |
| 2007 |
|---|
| 20 | Wiener indices of balanced binary trees. Sergey Bereg, Hao Wang. Discrete Applied Mathematics (155): 457-467 (2007). Web SearchBibTeXDownload |
| 2006 |
|---|
| 19 | Equitable subdivisions within polygonal regions. Sergey Bereg, Prosenjit Bose, David G. Kirkpatrick. Comput. Geom. (34): 20-27 (2006). Web SearchBibTeXDownload |
| 18 | Competitive Algorithms for Maintaining a Mobile Center. Sergey Bereg, Binay K. Bhattacharya, David G. Kirkpatrick, Michael Segal. MONET (11): 177-186 (2006). Web SearchBibTeXDownload |
| 2005 |
|---|
| 17 | Wiener Indices of Balanced Binary Trees. Sergey Bereg, Hao Wang. International Conference on Computational Science (2) 2005, 851-859. Web SearchBibTeXDownload |
| 16 | Guarding a terrain by two watchtowers. Pankaj K. Agarwal, Sergey Bereg, Ovidiu Daescu, Haim Kaplan, Simeon C. Ntafos, Binhai Zhu. Symposium on Computational Geometry 2005, 346-355. Web SearchBibTeXDownload |
| 15 | Curvature-bounded traversals of narrow corridors. Sergey Bereg, David G. Kirkpatrick. Symposium on Computational Geometry 2005, 278-287. Web SearchBibTeXDownload |
| 2004 |
|---|
| 14 | A Conjecture on Wiener Indices in Combinatorial Chemistry. Yih-En Andrew Ban, Sergey Bereg, Nabil H. Mustafa. Algorithmica (40): 99-117 (2004). Web SearchBibTeXDownload |
| 13 | Computing a (1+epsilon)-Approximate Geometric Minimum-Diameter Spanning Tree. Michael J. Spriggs, J. Mark Keil, Sergei Bespamyatnikh, Michael Segal, Jack Snoeyink. Algorithmica (38): 577-589 (2004). Web SearchBibTeXDownload |
| 2003 |
|---|
| 12 | Approximating the geometric minimum-diameter spanning tree. Michael J. Spriggs, J. Mark Keil, Sergei Bespamyatnikh, Michael Segal, Jack Snoeyink. CCCG 2003, 39-42. Web SearchBibTeX |
| 11 | On a Conjecture on Wiener Indices in Combinatorial Chemistry. Yih-En Andrew Ban, Sergei Bespamyatnikh, Nabil H. Mustafa. COCOON 2003, 509-518. Web SearchBibTeXDownload |
| 2002 |
|---|
| 10 | Lower and Upper Bounds for Tracking Mobile Users. Sergei Bespamyatnikh, Binay K. Bhattacharya, David G. Kirkpatrick, Michael Segal. IFIP TCS 2002, 47-58. Web SearchBibTeX |
| 9 | Constrained Equitable 3-Cuttings. Sergei Bespamyatnikh, David G. Kirkpatrick. JCDCG 2002, 72-83. Web SearchBibTeXDownload |
| 8 | Efficient algorithms for centers and medians in interval and circular-arc graphs. Sergei Bespamyatnikh, Binay K. Bhattacharya, J. Mark Keil, David G. Kirkpatrick, Michael Segal. Networks (39): 144-152 (2002). Web SearchBibTeXDownload |
| 2000 |
|---|
| 7 | Queries with segments in Voronoi diagrams. Sergei Bespamyatnikh, Jack Snoeyink. Comput. Geom. (16): 23-33 (2000). Web SearchBibTeXDownload |
| 6 | Mobile facility location. Sergei Bespamyatnikh, Binay K. Bhattacharya, David G. Kirkpatrick, Michael Segal. DIAL-M 2000, 46-53. Web SearchBibTeXDownload |
| 5 | Generalizing Ham Sandwich Cuts to Equitable Subdivisions. Sergei Bespamyatnikh, David G. Kirkpatrick, Jack Snoeyink. Discrete & Computational Geometry (24): 605-622 (2000). Web SearchBibTeXDownload |
| 4 | Efficient Algorithms for Centers and Medians in Interval and Circular-Arc Graphs. Sergei Bespamyatnikh, Binay K. Bhattacharya, J. Mark Keil, David G. Kirkpatrick, Michael Segal. ESA 2000, 100-111. Web SearchBibTeXDownload |
| 1999 |
|---|
| 3 | Rectilinear 2-center problems. Sergei Bespamyatnikh, David G. Kirkpatrick. CCCG 1999. Web SearchBibTeXDownload |
| 2 | Queries with Segments in Voronoi Diagrams. Sergei Bespamyatnikh, Jack Snoeyink. SODA 1999, 122-129. Web SearchBibTeXDownload |
| 1 | Generalizing Ham Sandwich Cuts to Equitable Subdivisions. Sergei Bespamyatnikh, David G. Kirkpatrick, Jack Snoeyink. Symposium on Computational Geometry 1999, 49-58. Web SearchBibTeXDownload |
