| 2004 | LATIN | Encoding Homotopy of Paths in the Plane. | Sergei Bespamyatnikh |
| 2003 | COCOON | On a Conjecture on Wiener Indices in Combinatorial Chemistry. | Yih-En Andrew Ban, Sergei Bespamyatnikh, Nabil H. Mustafa |
| 2003 | COCOON | Cylindrical Hierarchy for Deforming Necklaces. | Sergei Bespamyatnikh |
| 2003 | ICALP | Dynamic Algorithms for Approximating Interdistances. | Sergei Bespamyatnikh, Michael Segal |
| 2003 | ICCS | Transforming Pseudo-Triangulations. | Sergei Bespamyatnikh |
| 2003 | ICCSA | An Approximate Morphing between Polylines. | Sergei Bespamyatnikh |
| 2003 | SODA | Computing homotopic shortest paths in the plane. | Sergei Bespamyatnikh |
| 2001 | COCOON | On the Planar Two-Watchtower Problem. | Sergei Bespamyatnikh, Zhixiang Chen, Kanliang Wang, Binhai Zhu |
| 2001 | ICCS | Fast Maintenance of Rectilinear Centers. | Sergei Bespamyatnikh, Michael Segal |
| 2000 | ESA | Efficient Algorithms for Centers and Medians in Interval and Circular-Arc Graphs. | Sergei Bespamyatnikh, Binay K. Bhattacharya, J. Mark Keil, David G. Kirkpatrick, Michael Segal |
| 1999 | SODA | Queries with Segments in Voronoi Diagrams. | Sergei Bespamyatnikh, Jack Snoeyink |
| 1999 | WADS | Optimal Facility Location under Various Distance Functions. | Sergei Bespamyatnikh, Klara Kedem, Michael Segal |
| 1999 | WADS | Rectilinear Static and Dynamic Discrete 2-center Problems. | Sergei Bespamyatnikh, Michael Segal |
| 1998 | SODA | An Efficient Algorithm for the Three-Dimensional Diameter Problem. | Sergei Bespamyatnikh |