Sergei Bespamyatnikh

Publication Activity (10 Years)

Years Active: 1994-2004
Publications (10 Years): 0

Publications

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) (2004)
Sergei Bespamyatnikh, Michael Segal
Selecting distances in arrangements of hyperplanes spanned by points. J. Discrete Algorithms 2 (3) (2004)
Sergei Bespamyatnikh
Encoding Homotopy of Paths in the Plane. LATIN (2004)
Sergei Bespamyatnikh
Transforming Pseudo-Triangulations. International Conference on Computational Science (2003)
Sergei Bespamyatnikh, Michael Segal
Dynamic Algorithms for Approximating Interdistances. ICALP (2003)
Sergei Bespamyatnikh
Computing homotopic shortest paths in the plane. SODA (2003)
Sergei Bespamyatnikh
An Approximate Morphing between Polylines. ICCSA (3) (2003)
Sergei Bespamyatnikh
Computing homotopic shortest paths in the plane. J. Algorithms 49 (2) (2003)
Yih-En Andrew Ban, Sergei Bespamyatnikh, Nabil H. Mustafa
On a Conjecture on Wiener Indices in Combinatorial Chemistry. COCOON (2003)
Marina L. Gavrilova, Sergei Bespamyatnikh
On exact solution of a point-location problem in a system of d-dimensional hyperbolic surfaces. CCCG (2003)
Sergei Bespamyatnikh
Cylindrical Hierarchy for Deforming Necklaces. COCOON (2003)
Sergei Bespamyatnikh, Andrei V. Kelarev
Algorithms for shortest paths and d-cycle problems. J. Discrete Algorithms 1 (1) (2003)
Sergei Bespamyatnikh
An O(nlogn) algorithm for the zoo-keeper's problem. Comput. Geom. 24 (2) (2003)
Sergei Bespamyatnikh
Computing Closest Points for Segments. Int. J. Comput. Geom. Appl. 13 (5) (2003)
Michael J. Spriggs, J. Mark Keil, Sergei Bespamyatnikh, Michael Segal, Jack Snoeyink
Approximating the geometric minimum-diameter spanning tree. CCCG (2003)
Sergei Bespamyatnikh
An Optimal Morphing Between Polylines. Int. J. Comput. Geom. Appl. 12 (3) (2002)
Sergei Bespamyatnikh, David G. Kirkpatrick
Constrained Equitable 3-Cuttings. JCDCG (2002)
Sergei Bespamyatnikh, Binay K. Bhattacharya, David G. Kirkpatrick, Michael Segal
Lower and Upper Bounds for Tracking Mobile Users. IFIP TCS (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) (2002)
Sergei Bespamyatnikh
An efficient algorithm for enumeration of triangulations. Comput. Geom. 23 (3) (2002)
Sergei Bespamyatnikh
Computing closest points for segments. CCCG (2002)
Sergei Bespamyatnikh
On Partitioning a Cake. JCDCG (2002)
Sergei Bespamyatnikh
Enumerating pseudo-triangulations in the plane. CCCG (2002)
Sergei Bespamyatnikh, Michael Segal
Fast Algorithms for Approximating Distances. Algorithmica 33 (2) (2002)
Sergei Bespamyatnikh
Packing two disks in a polygon. Comput. Geom. 23 (1) (2002)
Sergei Bespamyatnikh
Enumerating Triangulations of Convex Polytopes. DM-CCG (2001)
Sergei Bespamyatnikh, Michael Segal
Fast Maintenance of Rectilinear Centers. International Conference on Computational Science (1) (2001)
Sergei Bespamyatnikh, Zhixiang Chen, Kanliang Wang, Binhai Zhu
On the Planar Two-Watchtower Problem. COCOON (2001)
Sergei Bespamyatnikh
An Efficient Algorithm for the Three-Dimensional Diameter Problem. Discret. Comput. Geom. 25 (2) (2001)
Sergei Bespamyatnikh, Michael Segal
Covering a set of points by two axis-parallel boxes. Inf. Process. Lett. 75 (3) (2000)
Sergei Bespamyatnikh, Klara Kedem, Michael Segal, Arie Tamir
Optimal Facility Location Under Various Distance Functions. Int. J. Comput. Geom. Appl. 10 (5) (2000)
Sergei Bespamyatnikh, Jack Snoeyink
Queries with segments in Voronoi diagrams. Comput. Geom. 16 (1) (2000)
Sergei Bespamyatnikh, David G. Kirkpatrick, Jack Snoeyink
Generalizing Ham Sandwich Cuts to Equitable Subdivisions. Discret. Comput. Geom. 24 (4) (2000)
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)
Sergei Bespamyatnikh, Binay K. Bhattacharya, David G. Kirkpatrick, Michael Segal
Mobile facility location. DIAL-M (2000)
Sergei Bespamyatnikh, Michael Segal
Enumerating longest increasing subsequences and patience sorting. Inf. Process. Lett. 76 (1-2) (2000)
Sergei Bespamyatnikh, Michael Segal
Rectilinear Static and Dynamic Discrete 2-center Problems. WADS (1999)
Sergei Bespamyatnikh, Klara Kedem, Michael Segal
Optimal Facility Location under Various Distance Functions. WADS (1999)
Sergei Bespamyatnikh, Jack Snoeyink
Queries with Segments in Voronoi Diagrams. SODA (1999)
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. SCG (1999)
Sergei Bespamyatnikh
An Efficient Algorithm for the Three-Dimensional Diameter Problem. SODA (1998)
Sergei Bespamyatnikh
An Optimal Algorithm for Closest-Pair Maintenance. Discret. Comput. Geom. 19 (2) (1998)
Sergei Bespamyatnikh
. Algorithmica 18 (4) (1997)
Sergei Bespamyatnikh, Michael Segal
Covering a set of points by two axis-parallel boxes. CCCG (1997)
Sergei Bespamyatnikh
Dynamic Algorithms for Approximate Neighbor Searching. CCCG (1996)
Sergei Bespamyatnikh
An Optimal Algorithm for Dynamic Post-office Problem in R21 and Related Problems. CCCG (1996)
Sergei Bespamyatnikh
An Optimal Algorithm for Closest Pair Maintenance (Extended Abstract). SCG (1995)
Sergei Bespamyatnikh
The Region Approach for some Dynamic Closest-Point Problems. CCCG (1994)