Sergei Bespamyatnikh - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 49 from 49

2004

Encoding Homotopy of Paths in the PlaneSergei Bespamyatnikh. latin 2004: 329-338 [doi]

Selecting distances in arrangements of hyperplanes spanned by pointsSergei Bespamyatnikh, Michael Segal. jda, 2(3):333-345, 2004. [doi]

Computing a (1+epsilon)-Approximate Geometric Minimum-Diameter Spanning TreeMichael J. Spriggs, J. Mark Keil, Sergei Bespamyatnikh, Michael Segal, Jack Snoeyink. algorithmica, 38(4):577-589, 2004. [doi]

2003

On a Conjecture on Wiener Indices in Combinatorial ChemistryYih-En Andrew Ban, Sergei Bespamyatnikh, Nabil H. Mustafa. cocoon 2003: 509-518 [doi]

An Approximate Morphing between PolylinesSergei Bespamyatnikh. iccsa 2003: 807-816 [doi]

Computing homotopic shortest paths in the planeSergei Bespamyatnikh. jal, 49(2):284-303, 2003. [doi]

Computing Closest Points for SegmentsSergei Bespamyatnikh. ijcga, 13(5):419-438, 2003. [doi]

Computing homotopic shortest paths in the planeSergei Bespamyatnikh. soda 2003: 609-617 [doi]

Cylindrical Hierarchy for Deforming NecklacesSergei Bespamyatnikh. cocoon 2003: 20-29 [doi]

Dynamic Algorithms for Approximating InterdistancesSergei Bespamyatnikh, Michael Segal. icalp 2003: 1169-1180 [doi]

Transforming Pseudo-TriangulationsSergei Bespamyatnikh. iccS 2003: 533-539 [doi]

An O(nlogn) algorithm for the zoo-keeper s problemSergei Bespamyatnikh. comgeo, 24(2):63-74, 2003.

Algorithms for shortest paths and d-cycle problemsSergei Bespamyatnikh, Andrei Kelarev. jda, 1(1):1-9, 2003. [doi]

On exact solution of a point-location problem in a system of d-dimensional hyperbolic surfacesMarina L. Gavrilova, Sergei Bespamyatnikh. cccg 2003: 136-139

Approximating the geometric minimum-diameter spanning treeMichael J. Spriggs, J. Mark Keil, Sergei Bespamyatnikh, Michael Segal, Jack Snoeyink. cccg 2003: 39-42

2002

An Optimal Morphing Between PolylinesSergei Bespamyatnikh. ijcga, 12(3):217-228, 2002. [doi]

Efficient algorithms for centers and medians in interval and circular-arc graphsSergei Bespamyatnikh, Binay K. Bhattacharya, J. Mark Keil, J. David Kirkpatrick, Michael Segal. networks, 39(3):144-152, 2002. [doi]

Fast Algorithms for Approximating DistancesSergei Bespamyatnikh, Michael Segal. algorithmica, 33(2):263-269, 2002. [doi]

Enumerating pseudo-triangulations in the planeSergei Bespamyatnikh. cccg 2002: 162-166 [doi]

Computing closest points for segmentsSergei Bespamyatnikh. cccg 2002: 118-122 [doi]

On Partitioning a CakeSergei Bespamyatnikh. jcdcg 2003: 60-71 [doi]

Packing two disks in a polygonSergei Bespamyatnikh. comgeo, 23(1):31-42, 2002.

An efficient algorithm for enumeration of triangulationsSergei Bespamyatnikh. comgeo, 23(3):271-279, 2002.

Constrained Equitable 3-CuttingsSergei Bespamyatnikh, David G. Kirkpatrick. jcdcg 2003: 72-83 [doi]

Lower and Upper Bounds for Tracking Mobile UsersSergei Bespamyatnikh, Binay K. Bhattacharya, David G. Kirkpatrick, Michael Segal. ifipTCS 2002: 47-58

2001

2000

Optimal Facility Location Under Various Distance FunctionsSergei Bespamyatnikh, Klara Kedem, Michael Segal, Arie Tamir. ijcga, 10(5):523-534, 2000.

Queries with segments in Voronoi diagramsSergei Bespamyatnikh, Jack Snoeyink. comgeo, 16(1):23-33, 2000.

Enumerating longest increasing subsequences and patience sortingSergei Bespamyatnikh, Michael Segal. ipl, 76(1-2):7-11, 2000. [doi]

Covering a set of points by two axis-parallel boxesSergei Bespamyatnikh, Michael Segal. ipl, 75(3):95-100, 2000. [doi]

Mobile facility locationSergei Bespamyatnikh, Binay K. Bhattacharya, David G. Kirkpatrick, Michael Segal. dialm 2000: 46-53 [doi]

Efficient Algorithms for Centers and Medians in Interval and Circular-Arc GraphsSergei Bespamyatnikh, Binay K. Bhattacharya, J. Mark Keil, David G. Kirkpatrick, Michael Segal. esa 2000: 100-111

Generalizing Ham Sandwich Cuts to Equitable SubdivisionsSergei Bespamyatnikh, David G. Kirkpatrick, Jack Snoeyink. dcg, 24(4):605-622, 2000. [doi]

1999

1998

An Efficient Algorithm for the Three-Dimensional Diameter ProblemSergei Bespamyatnikh. soda 1998: 137-146

An Optimal Algorithm for Closest-Pair MaintenanceSergei Bespamyatnikh. dcg, 19(2):175-195, 1998. [doi]

1997

Covering a set of points by two axis-parallel boxesSergei Bespamyatnikh, Michael Segal. cccg 1997:

On Constructing Minimum Spanning Trees in R:::k:::::l::Sergei Bespamyatnikh. algorithmica, 18(4):524-529, 1997.

1996

An Optimal Algorithm for Dynamic Post-office Problem in R21 and Related ProblemsSergei Bespamyatnikh. cccg 1996: 101-106

Dynamic Algorithms for Approximate Neighbor SearchingSergei Bespamyatnikh. cccg 1996: 252-257

1995

An Optimal Algorithm for Closest Pair Maintenance (Extended Abstract)Sergei Bespamyatnikh. compgeom 1995: 152-161 [doi]

1994

The Region Approach for some Dynamic Closest-Point ProblemsSergei Bespamyatnikh. cccg 1994: 75-80

All Publications

Filter by Year
OR AND NOT 1

Filter by Type
OR AND NOT 1

Filter by Tag
OR AND NOT 1

Filter by Venue

[+]
OR AND NOT 1

Filter by Author
OR AND NOT 1

Filter by Top Terms

[+]
OR AND NOT 1

Researchr

Publications by 'Sergei Bespamyatnikh'

Viewing Publication 1 - 49 from 49

2004

2003

2002

2001

2000

1999

1998

1997

1996

1995

1994

All Publications

Filter by YearOR AND NOT 1

Filter by TypeOR AND NOT 1

Filter by TagOR AND NOT 1

Filter by Venue [+]OR AND NOT 1

Filter by AuthorOR AND NOT 1

Filter by Top Terms [+]OR AND NOT 1

Researchr

Publications by 'Sergei Bespamyatnikh'

Viewing Publication 1 - 49 from 49

2004

2003

2002

2001

2000

1999

1998

1997

1996

1995

1994

Filter by Year
OR AND NOT 1

Filter by Type
OR AND NOT 1

Filter by Tag
OR AND NOT 1

Filter by Venue

[+]
OR AND NOT 1

Filter by Author
OR AND NOT 1

Filter by Top Terms

[+]
OR AND NOT 1