Sergei Bespamyatnikh

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