Bespamyatnikh, Sergei - Department of Computer Science, University of Texas at Dallas

Advanced Search

Bespamyatnikh, Sergei - Department of Computer Science, University of Texas at Dallas

Ecient algorithms for centers and medians in interval and circular-arc graphs
Rectilinear Static and Dynamic Discrete 2center Problems
An optimal algorithm for closest pair maintenance Sergei N. Bespamyatnikh
Queries with Segments in Voronoi Diagrams \Lambda Sergei Bespamyatnikh y Jack Snoeyink z
ACM Symposium on Solid Modeling and Applications (2004) G. Elber, N. Patrikalakis, P. Brunet (Editors)
International Journal of Computational Geometry & Applications c World Scientific Publishing Company
Visibility Queries among Horizontal Segments | A Dynamic Data Structure
Rectilinear 2center problems Sergei Bespamyatnikh and David Kirkpatrick
Enumerating Longest Increasing Subsequences Patience Sorting
On a Conjecture on Wiener Indices in Combinatorial Chemistry YihEn Andrew Ban
International Journal of Computational Geometry & Applications fl World Scientific Publishing Company
Computing Closest Points for Segments Sergei Bespamyatnikh
Transforming pseudo-triangulations Sergey Bereg
On a Conjecture on Wiener Indices in Combinatorial Chemistry YihEn Andrew Ban
An Efficient Algorithm for the ThreeDimensional Diameter Problem Sergei N. Bespamyatnikh \Lambday
Enumerating pseudo-triangulations in the plane Sergei Bespamyatnikh
Mobile Facility Location \Lambda Sergei Bespamyatnikh y Binay Bhattacharya z David Kirkpatrick x
On Exact Solution of a Point-Location Problem in a System of d-dimensional Hyperbolic Surfaces
On constructing minimum spanning trees in R k Sergei N. Bespamyatnikh
Selecting Distances in Arrangements of Hyperplanes Spanned by Points
Computing Closest Points for Segments Sergei Bespamyatnikh
DRAFT: Generalizing Ham Sandwich Cuts to Equitable Subdivisions