The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Sergei Bespamyatnikh: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Sergei Bespamyatnikh
    Computing closest points for segments. [Citation Graph (0, 0)][DBLP]
    CCCG, 2002, pp:118-122 [Conf]
  2. Sergei Bespamyatnikh
    Enumerating pseudo-triangulations in the plane. [Citation Graph (0, 0)][DBLP]
    CCCG, 2002, pp:162-166 [Conf]
  3. Sergei Bespamyatnikh
    An Optimal Algorithm for Dynamic Post-office Problem in R21 and Related Problems. [Citation Graph (0, 0)][DBLP]
    CCCG, 1996, pp:101-106 [Conf]
  4. Sergei Bespamyatnikh
    Dynamic Algorithms for Approximate Neighbor Searching. [Citation Graph (0, 0)][DBLP]
    CCCG, 1996, pp:252-257 [Conf]
  5. Sergei Bespamyatnikh, David Kirkpatrick
    Rectilinear 2-center problems. [Citation Graph (0, 0)][DBLP]
    CCCG, 1999, pp:- [Conf]
  6. Sergei Bespamyatnikh, Michael Segal
    Covering a set of points by two axis-parallel boxes. [Citation Graph (0, 0)][DBLP]
    CCCG, 1997, pp:- [Conf]
  7. Sergei Bespamyatnikh
    The Region Approach for some Dynamic Closest-Point Problems. [Citation Graph (0, 0)][DBLP]
    CCCG, 1994, pp:75-80 [Conf]
  8. Marina L. Gavrilova, Sergei Bespamyatnikh
    On exact solution of a point-location problem in a system of d-dimensional hyperbolic surfaces. [Citation Graph (0, 0)][DBLP]
    CCCG, 2003, pp:136-139 [Conf]
  9. Michael J. Spriggs, J. Mark Keil, Sergei Bespamyatnikh, Michael Segal, Jack Snoeyink
    Approximating the geometric minimum-diameter spanning tree. [Citation Graph (0, 0)][DBLP]
    CCCG, 2003, pp:39-42 [Conf]
  10. Sergei Bespamyatnikh
    Cylindrical Hierarchy for Deforming Necklaces. [Citation Graph (0, 0)][DBLP]
    COCOON, 2003, pp:20-29 [Conf]
  11. Sergei Bespamyatnikh, Zhixiang Chen, Kanliang Wang, Binhai Zhu
    On the Planar Two-Watchtower Problem. [Citation Graph (0, 0)][DBLP]
    COCOON, 2001, pp:121-130 [Conf]
  12. Yih-En Andrew Ban, Sergei Bespamyatnikh, Nabil H. Mustafa
    On a Conjecture on Wiener Indices in Combinatorial Chemistry. [Citation Graph (0, 0)][DBLP]
    COCOON, 2003, pp:509-518 [Conf]
  13. Sergei Bespamyatnikh
    An Optimal Algorithm for Closest Pair Maintenance (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1995, pp:152-161 [Conf]
  14. Sergei Bespamyatnikh, David G. Kirkpatrick, Jack Snoeyink
    Generalizing Ham Sandwich Cuts to Equitable Subdivisions. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1999, pp:49-58 [Conf]
  15. Sergei Bespamyatnikh, Binay K. Bhattacharya, David G. Kirkpatrick, Michael Segal
    Mobile facility location. [Citation Graph (0, 0)][DBLP]
    DIAL-M, 2000, pp:46-53 [Conf]
  16. Sergei Bespamyatnikh
    Enumerating Triangulations of Convex Polytopes. [Citation Graph (0, 0)][DBLP]
    DM-CCG, 2001, pp:111-122 [Conf]
  17. 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. [Citation Graph (0, 0)][DBLP]
    ESA, 2000, pp:100-111 [Conf]
  18. Sergei Bespamyatnikh, Michael Segal
    Dynamic Algorithms for Approximating Interdistances. [Citation Graph (0, 0)][DBLP]
    ICALP, 2003, pp:1169-1180 [Conf]
  19. Sergei Bespamyatnikh
    Transforming Pseudo-Triangulations. [Citation Graph (0, 0)][DBLP]
    International Conference on Computational Science, 2003, pp:533-539 [Conf]
  20. Sergei Bespamyatnikh, Michael Segal
    Fast Maintenance of Rectilinear Centers. [Citation Graph (0, 0)][DBLP]
    International Conference on Computational Science (1), 2001, pp:633-639 [Conf]
  21. Sergei Bespamyatnikh
    An Approximate Morphing between Polylines. [Citation Graph (0, 0)][DBLP]
    ICCSA (3), 2003, pp:807-816 [Conf]
  22. Sergei Bespamyatnikh, Binay K. Bhattacharya, David G. Kirkpatrick, Michael Segal
    Lower and Upper Bounds for Tracking Mobile Users. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2002, pp:47-58 [Conf]
  23. Sergei Bespamyatnikh
    On Partitioning a Cake. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2002, pp:60-71 [Conf]
  24. Sergei Bespamyatnikh, David G. Kirkpatrick
    Constrained Equitable 3-Cuttings. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2002, pp:72-83 [Conf]
  25. Sergei Bespamyatnikh
    Encoding Homotopy of Paths in the Plane. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:329-338 [Conf]
  26. Sergei Bespamyatnikh
    Computing homotopic shortest paths in the plane. [Citation Graph (0, 0)][DBLP]
    SODA, 2003, pp:609-617 [Conf]
  27. Sergei Bespamyatnikh
    An Efficient Algorithm for the Three-Dimensional Diameter Problem. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:137-146 [Conf]
  28. Sergei Bespamyatnikh, Jack Snoeyink
    Queries with Segments in Voronoi Diagrams. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:122-129 [Conf]
  29. Sergei Bespamyatnikh, Klara Kedem, Michael Segal
    Optimal Facility Location under Various Distance Functions. [Citation Graph (0, 0)][DBLP]
    WADS, 1999, pp:318-329 [Conf]
  30. Sergei Bespamyatnikh, Michael Segal
    Rectilinear Static and Dynamic Discrete 2-center Problems. [Citation Graph (0, 0)][DBLP]
    WADS, 1999, pp:276-287 [Conf]
  31. Sergei Bespamyatnikh
    On Constructing Minimum Spanning Trees in Rkl. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1997, v:18, n:4, pp:524-529 [Journal]
  32. Sergei Bespamyatnikh, Michael Segal
    Fast Algorithms for Approximating Distances. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2002, v:33, n:2, pp:263-269 [Journal]
  33. Michael J. Spriggs, J. Mark Keil, Sergei Bespamyatnikh, Michael Segal, Jack Snoeyink
    Computing a (1+epsilon)-Approximate Geometric Minimum-Diameter Spanning Tree. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2004, v:38, n:4, pp:577-589 [Journal]
  34. Sergei Bespamyatnikh
    Packing two disks in a polygon. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2002, v:23, n:1, pp:31-42 [Journal]
  35. Sergei Bespamyatnikh
    An efficient algorithm for enumeration of triangulations. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2002, v:23, n:3, pp:271-279 [Journal]
  36. Sergei Bespamyatnikh
    An O(nlogn) algorithm for the zoo-keeper's problem. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2003, v:24, n:2, pp:63-74 [Journal]
  37. Sergei Bespamyatnikh, Jack Snoeyink
    Queries with segments in Voronoi diagrams. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2000, v:16, n:1, pp:23-33 [Journal]
  38. Sergei Bespamyatnikh
    An Efficient Algorithm for the Three-Dimensional Diameter Problem. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2001, v:25, n:2, pp:235-255 [Journal]
  39. Sergei Bespamyatnikh
    An Optimal Algorithm for Closest-Pair Maintenance. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1998, v:19, n:2, pp:175-195 [Journal]
  40. Sergei Bespamyatnikh, David G. Kirkpatrick, Jack Snoeyink
    Generalizing Ham Sandwich Cuts to Equitable Subdivisions. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2000, v:24, n:4, pp:605-622 [Journal]
  41. Sergei Bespamyatnikh
    Computing Closest Points for Segments. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2003, v:13, n:5, pp:419-438 [Journal]
  42. Sergei Bespamyatnikh
    An Optimal Morphing Between Polylines. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2002, v:12, n:3, pp:217-228 [Journal]
  43. Sergei Bespamyatnikh, Klara Kedem, Michael Segal, Arie Tamir
    Optimal Facility Location Under Various Distance Functions. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2000, v:10, n:5, pp:523-534 [Journal]
  44. Sergei Bespamyatnikh, Michael Segal
    Covering a set of points by two axis-parallel boxes. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2000, v:75, n:3, pp:95-100 [Journal]
  45. Sergei Bespamyatnikh, Michael Segal
    Enumerating longest increasing subsequences and patience sorting. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2000, v:76, n:1-2, pp:7-11 [Journal]
  46. Sergei Bespamyatnikh
    Computing homotopic shortest paths in the plane. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2003, v:49, n:2, pp:284-303 [Journal]
  47. Sergei Bespamyatnikh, Andrei Kelarev
    Algorithms for shortest paths and d-cycle problems. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2003, v:1, n:1, pp:1-9 [Journal]
  48. Sergei Bespamyatnikh, Michael Segal
    Selecting distances in arrangements of hyperplanes spanned by points. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2004, v:2, n:3, pp:333-345 [Journal]
  49. Sergei Bespamyatnikh, Binay K. Bhattacharya, Mark Keil, J. David Kirkpatrick, Michael Segal
    Efficient algorithms for centers and medians in interval and circular-arc graphs. [Citation Graph (0, 0)][DBLP]
    Networks, 2002, v:39, n:3, pp:144-152 [Journal]

Search in 0.051secs, Finished in 0.054secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002