| |
Sergei Bespamyatnikh
List of publications from the DBLP Bibliography Server - FAQ
| 2008 | ||
|---|---|---|
| 85 | EE | Sergey Bereg, Minghui Jiang, Wencheng Wang, Boting Yang, Binhai Zhu: Simplifying 3D Polygonal Chains Under the Discrete Fréchet Distance. LATIN 2008: 630-641 |
| 2007 | ||
| 84 | EE | Sergey Bereg, Markus Völker, Alexander Wolff, Yuanyi Zhang: Straightening Drawings of Clustered Hierarchical Graphs. SOFSEM (1) 2007: 176-187 |
| 83 | EE | 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 |
| 82 | EE | Sergey Bereg, Marina L. Gavrilova, Binhai Zhu: Voronoi Diagram of Polygonal Chains under the Discrete Fréchet Distance CoRR abs/0705.2835: (2007) |
| 81 | EE | Sergey Bereg: Faster Algorithms for Rigidity in the Plane CoRR abs/0711.2835: (2007) |
| 80 | EE | 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) |
| 79 | EE | Sergey Bereg, Hao Wang: Wiener indices of balanced binary trees. Discrete Applied Mathematics 155(4): 457-467 (2007) |
| 78 | EE | Sergey Bereg, Yuanyi Zhang: Phylogenetic Networks Based on the Molecular Clock Hypothesis. IEEE/ACM Trans. Comput. Biology Bioinform. 4(4): 661-667 (2007) |
| 77 | EE | 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 | ||
| 76 | EE | Sergey Bereg, Ovidiu Daescu, Minghui Jiang: A PTAS for Cutting Out Polygons with Lines. COCOON 2006: 176-185 |
| 75 | EE | Sergey Bereg, Nikolaus Mutsanas, Alexander Wolff: Matching Points with Rectangles and Squares. SOFSEM 2006: 177-186 |
| 74 | EE | Sergey Bereg, Prosenjit Bose, J. David Kirkpatrick: Equitable subdivisions within polygonal regions. Comput. Geom. 34(1): 20-27 (2006) |
| 73 | EE | Manuel Abellanas, Sergey Bereg, Ferran Hurtado, Alfredo García Olaverri, David Rappaport, Javier Tejel: Moving coins. Comput. Geom. 34(1): 35-48 (2006) |
| 72 | EE | Sergey Bereg, Adrian Dumitrescu: The Lifting Model for Reconfiguration. Discrete & Computational Geometry 35(4): 653-669 (2006) |
| 71 | EE | Sergey Bereg, Binay K. Bhattacharya, David Kirkpatrick, Michael Segal: Competitive Algorithms for Maintaining a Mobile Center. MONET 11(2): 177-186 (2006) |
| 2005 | ||
| 70 | EE | Sergey Bereg, Kathryn Bean: Constructing Phylogenetic Networks from Trees. BIBE 2005: 299-305 |
| 69 | EE | Sergey Bereg, Binhai Zhu: RNA Multiple Structural Alignment with Longest Common Subsequences. COCOON 2005: 32-41 |
| 68 | EE | Sergey Bereg, Hao Wang: Wiener Indices of Balanced Binary Trees. International Conference on Computational Science (2) 2005: 851-859 |
| 67 | EE | Sergey Bereg, David G. Kirkpatrick: Curvature-bounded traversals of narrow corridors. Symposium on Computational Geometry 2005: 278-287 |
| 66 | EE | 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 |
| 65 | EE | Sergey Bereg, Adrian Dumitrescu: The lifting model for reconfiguration. Symposium on Computational Geometry 2005: 55-62 |
| 64 | EE | Sergey Bereg: Certifying and constructing minimally rigid graphs in the plane. Symposium on Computational Geometry 2005: 73-80 |
| 63 | EE | Sergey Bereg: Enumerating pseudo-triangulations in the plane. Comput. Geom. 30(3): 207-222 (2005) |
| 62 | EE | Sergey Bereg: Equipartitions of Measures by 2-Fans. Discrete & Computational Geometry 34(1): 87-96 (2005) |
| 61 | EE | Sergey Bereg: An approximate morphing between polylines. Int. J. Comput. Geometry Appl. 15(2): 193-208 (2005) |
| 2004 | ||
| 60 | EE | Francois Anton, Sergey Bereg: The fitting line problem in the laguerre geometry. CCCG 2004: 166-169 |
| 59 | EE | Sergey Bereg: Equipartitions of Measures by 2-Fans. ISAAC 2004: 149-158 |
| 58 | EE | Minghui Jiang, Sergey Bereg, Zhongping Qin, Binhai Zhu: New Bounds on Map Labeling with Circular Labels. ISAAC 2004: 606-617 |
| 57 | EE | Sergey Bereg: Algorithms for the d-Dimensional Rigidity Matroid of Sparse Graphs. JCDCG 2004: 29-36 |
| 56 | EE | Sergey Bereg, Adrian Dumitrescu, János Pach: Sliding Disks in the Plane. JCDCG 2004: 37-47 |
| 55 | EE | 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 | EE | 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 | EE | Yih-En Andrew Ban, Sergey Bereg, Nabil H. Mustafa: A Conjecture on Wiener Indices in Combinatorial Chemistry. Algorithmica 40(2): 99-117 (2004) |
| 51 | EE | Sergey Bereg: Transforming pseudo-triangulations. Inf. Process. Lett. 90(3): 141-145 (2004) |
| 50 | EE | Sergey Bereg: Cylindrical hierarchy for deforming necklaces. Int. J. Comput. Geometry Appl. 14(1-2): 3-17 (2004) |
| 49 | EE | 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 | EE | Sergei Bespamyatnikh: Cylindrical Hierarchy for Deforming Necklaces. COCOON 2003: 20-29 |
| 44 | EE | Yih-En Andrew Ban, Sergei Bespamyatnikh, Nabil H. Mustafa: On a Conjecture on Wiener Indices in Combinatorial Chemistry. COCOON 2003: 509-518 |
| 43 | EE | Sergei Bespamyatnikh, Michael Segal: Dynamic Algorithms for Approximating Interdistances. ICALP 2003: 1169-1180 |
| 42 | EE | Sergei Bespamyatnikh: An Approximate Morphing between Polylines. ICCSA (3) 2003: 807-816 |
| 41 | EE | Sergei Bespamyatnikh: Transforming Pseudo-Triangulations. International Conference on Computational Science 2003: 533-539 |
| 40 | EE | 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 | EE | Sergei Bespamyatnikh: Computing Closest Points for Segments. Int. J. Comput. Geometry Appl. 13(5): 419-438 (2003) |
| 37 | EE | Sergei Bespamyatnikh: Computing homotopic shortest paths in the plane. J. Algorithms 49(2): 284-303 (2003) |
| 36 | EE | 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 | EE | Sergei Bespamyatnikh: Computing closest points for segments. CCCG 2002: 118-122 |
| 33 | EE | 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 | EE | Sergei Bespamyatnikh: On Partitioning a Cake. JCDCG 2002: 60-71 |
| 30 | EE | Sergei Bespamyatnikh, David G. Kirkpatrick: Constrained Equitable 3-Cuttings. JCDCG 2002: 72-83 |
| 29 | EE | 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 | EE | Sergei Bespamyatnikh: An Optimal Morphing Between Polylines. Int. J. Comput. Geometry Appl. 12(3): 217-228 (2002) |
| 25 | EE | 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 | EE | Sergei Bespamyatnikh, Zhixiang Chen, Kanliang Wang, Binhai Zhu: On the Planar Two-Watchtower Problem. COCOON 2001: 121-130 |
| 23 | EE | Sergei Bespamyatnikh: Enumerating Triangulations of Convex Polytopes. DM-CCG 2001: 111-122 |
| 22 | EE | Sergei Bespamyatnikh, Michael Segal: Fast Maintenance of Rectilinear Centers. International Conference on Computational Science (1) 2001: 633-639 |
| 21 | EE | Sergei Bespamyatnikh: An Efficient Algorithm for the Three-Dimensional Diameter Problem. Discrete & Computational Geometry 25(2): 235-255 (2001) |
| 2000 | ||
| 20 | EE | 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 | EE | Sergei Bespamyatnikh, David G. Kirkpatrick, Jack Snoeyink: Generalizing Ham Sandwich Cuts to Equitable Subdivisions. Discrete & Computational Geometry 24(4): 605-622 (2000) |
| 16 | EE | Sergei Bespamyatnikh, Michael Segal: Covering a set of points by two axis-parallel boxes. Inf. Process. Lett. 75(3): 95-100 (2000) |
| 15 | EE | 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 | EE | Sergei Bespamyatnikh, David Kirkpatrick: Rectilinear 2-center problems. CCCG 1999 |
| 12 | EE | Sergei Bespamyatnikh, Jack Snoeyink: Queries with Segments in Voronoi Diagrams. SODA 1999: 122-129 |
| 11 | EE | Sergei Bespamyatnikh, David G. Kirkpatrick, Jack Snoeyink: Generalizing Ham Sandwich Cuts to Equitable Subdivisions. Symposium on Computational Geometry 1999: 49-58 |
| 10 | EE | Sergei Bespamyatnikh, Michael Segal: Rectilinear Static and Dynamic Discrete 2-center Problems. WADS 1999: 276-287 |
| 9 | EE | 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 | EE | 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 | EE | 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 | |