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="Henzinger, Monika R."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
An online throughput-competitive algorithm for multicast routing and admission control
Ashish Goel
,
Monika R. Henzinger
,
Serge Plotkin
Journal of Algorithms
55
(1), 2005, pp. 1-20
Scheduling data transfers in a network and the set scheduling problem
Ashish Goel
,
Monika R. Henzinger
,
Serge Plotkin
,
Eva Tardos
Journal of Algorithms
48
(2), 2003, pp. 314-332
Scheduling multicasts on unit-capacity trees and meshes
Monika R. Henzinger
,
Stefano Leonardi
Journal of Computer and System Sciences
66
(3), 2003, pp. 567-611
Maintaining minimum spanning forests in dynamic graphs
Monika R. Henzinger
,
Valerie King
SIAM Journal on Computing
31
(2), 2001, pp. 364-374
Exploring unknown environments
Susanne Albers
,
Monika R. Henzinger
SIAM Journal on Computing
29
(4), 2000, pp. 1164-1188
Computing vertex connectivity: New bounds from old techniques
Monika R. Henzinger
,
Satish Rao
,
Harold N. Gabow
Journal of Algorithms
34
(2), 2000, pp. 222-250
Improved data structures for fully dynamic biconnectivity
Monika R. Henzinger
SIAM Journal on Computing
29
(6), 2000, pp. 1761-1815
Scheduling data transfers in a network and the set scheduling problem
Ashish Goel
,
Monika R. Henzinger
,
Serge Plotkin
,
Eva Tardos
Proceedings of the 31st Annual ACM Symposium on Theory of Computing, STOC'99 (Atlanta, Georgia, May 1-4, 1999)
, 1999, pp. 189-197
Randomized fully dynamic graph algorithms with polylogarithmic time per operation
Monika R. Henzinger
,
Valerie King
Journal of the ACM
46
(4), 1999, pp. 502-516
Scheduling multicasts on unit-capacity trees and meshes
Monika R. Henzinger
,
Stefano Leonardi
Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'99 (Baltimore, Maryland, January 17-19, 1999)
, 1999, pp. 438-447
Parametric and kinetic minimum spanning trees
Pankaj K. Agarwal
,
David Eppstein
,
Leonidas J. Guibas
,
Monika R. Henzinger
Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science, FOCS'98 (Palo Alto, California, November 8-11, 1998)
, 1998, pp. 596-605
Information retrieval on the web
Andrei Broder
,
Monika R. Henzinger
Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science, FOCS'98 (Palo Alto, California, November 8-11, 1998)
, 1998, pp. 6-6
Online throughput-competitive algorithm for multicast routing and admission control
Ashish Goel
,
Monika R. Henzinger
,
Serge Plotkin
Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'98 (San Francisco, California, January 25-27, 1998)
, 1998, pp. 97-106
Maintaining minimum spanning trees in dynamic graphs
Monika R. Henzinger
,
Valerie King
Lecture Notes in Computer Science
1256
, 1997, pp. 594-604
Faster shortest-path algorithms for planar graphs
Monika R. Henzinger
,
Philip Klein
,
Satish Rao
,
Sairam Subramanian
Journal of Computer and System Sciences
55
(1), 1997, pp. 3-23
Computing vertex connectivity: New bounds from old techniques
Monika R. Henzinger
,
Satish Rao
,
Harold N. Gabow
Proceedings of the 37th IEEE Symposium on Foundations of Computer Science, FOCS'96 (Burlington, Vermont, October 14-16, 1996)
, 1996, pp. 462-471
Computing simulations on finite and infinite graphs
Monika R. Henzinger
,
Thomas A. Henzinger
,
Peter W. Kopke
Proceedings of the 36th Annual IEEE Symposium on Foundations of Computer Science, FOCS'95 (Milwaukee, Wisconsin, October 23-25, 1995)
, 1995, pp. 453-462