Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Bespamyatnikh, Sergei"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Computing a
(1+\epsilon)
-approximate geometric minimum-diameter spanning tree
Michael J. Spriggs
,
J. Mark Keil
,
Sergei Bespamyatnikh
,
Michael Segal
,
Jack Snoeyink
Algorithmica
38
(4), 2004, pp. 577-589
On a conjecture on Wiener indices in combinatorial chemistry
Yih-En Andrew Ban
,
Sergei Bespamyatnikh
,
Nabil H. Mustafa
Lecture Notes in Computer Science
2697
, 2003, pp. 509-518
Dynamic algorithms for approximating interdistances
Sergei Bespamyatnikh
,
Michael Segal
Lecture Notes in Computer Science
2719
, 2003, pp. 1169-1180
Computing homotopic shortest paths in the plane
Sergei Bespamyatnikh
Journal of Algorithms
49
(2), 2003, pp. 284-303
Cylindrical hierarchy for deforming necklaces
Sergei Bespamyatnikh
Lecture Notes in Computer Science
2697
, 2003, pp. 20-29
Efficient algorithms for centers and medians in interval and circular-arc graphs
Sergei Bespamyatnikh
,
Binay Bhattacharya
,
Mark Keil
,
David Kirkpatrick
,
Michael Segal
Networks
39
(3), 2002, pp. 144-152
On the planar two-watchtower problem
Sergei Bespamyatnikh
,
Zhixiang Chen
,
Kanliang Wang
,
Binhai Zhu
Lecture Notes in Computer Science
2108
, 2001, pp. 121-130
Covering a set of points by two-axis-parallel boxes
Sergei Bespamyatnikh
,
Michael Segal
Information Processing Letters
75
(3), 2000, pp. 95-100
Enumerating longest increasing subsequences and patience sorting
Sergei Bespamyatnikh
,
Michael Segal
Information Processing Letters
76
(1-2), 2000, pp. 7-11
Optimal facility location under various distance functions
Sergei Bespamyatnikh
,
Klara Kedem
,
Michael Segal
Lecture Notes in Computer Science
1663
, 1999, pp. 318-329
Rectilinear static and dynamic discrete 2-center problems
Sergei Bespamyatnikh
,
Michael Segal
Lecture Notes in Computer Science
1663
, 1999, pp. 276-287
Queries with segments in Voronoi diagrams
Sergei Bespamyatnikh
,
Jack Snoeyink
Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'99 (Baltimore, Maryland, January 17-19, 1999)
, 1999, pp. 122-129
An efficient algorithm for the three-dimensional diameter prolem
Sergei N. Bespamyatnikh
Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'98 (San Francisco, California, January 25-27, 1998)
, 1998, pp. 137-146