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
[1]
Hilfe
Suche: Author="Cherkassky, Boris V."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Buckets, heaps, lists, and monotone priority queues
Boris V. Cherkassky
,
Andrew V. Goldberg
,
Craig Silverstein
SIAM Journal on Computing
28
(4), 1999, pp. 1326-1346
Buckets, heaps, lists, and monotone priority queues
Boris V. Cherkassky
,
Andrew V. Goldberg
,
Craig Silverstein
Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'97 (New Orleans, Louisiana, January 5-7, 1997)
, 1997, pp. 83-92
Negative cycle detection algorithms
Boris V. Cherkassky
,
Andrew V. Goldberg
Lecture Notes in Computer Science
1136
, 1996, pp. 349-363
On implementing push-relabel method for the maximum flow problem
Boris V. Cherkassky
,
Andrew V. Goldberg
Lecture Notes in Computer Science
920
, 1995, pp. 157-171
Shortest paths algorithms: Theory and experimental evaluation
Boris V. Cherkassky
,
Andrew V. Goldberg
,
Tomasz Radzik
Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'94 (Arlington, Virginia, January 23-25, 1994)
, 1994, pp. 516-525
On implementing push-relabel method for the maximum flow problem
Boris V. Cherkassky
,
Andrew V. Goldberg
misc, 1994, September
Shortest paths algorithms: Theory and experimental evaluation
Boris V. Cherkassky
,
Andrew V. Goldberg
,
Tomasz Radzik
misc, 1993, August