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="Rauch Henzinger, Monika"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A static 2-approximation algorithm for vertex connectivity and incremental approximation algorithms for edge and vertex connectivity
Monika Rauch Henzinger
Journal of Algorithms
24
(1), 1997, pp. 194-220
Constructing a tree from homeomorphic subtrees, with applications to computational evolutionary biology
Monika Rauch Henzinger
,
Valerie King
,
Tandy Warnow
Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'96 (Atlanta, Georgia, January 28-30, 1996)
, 1996, pp. 333-340
Faster algorithms for the nonemptiness of Streett automata and for communication protocol pruning
Monika Rauch Henzinger
,
Jan Arne Telle
Lecture Notes in Computer Science
1097
, 1996, pp. 16-27
Improved sampling with applications to dynamic graph algorithms
Monika Rauch Henzinger
,
Mikkel Thorup
Lecture Notes in Computer Science
1099
, 1996, pp. 290-299
Average case analysis of dynamic graph algorithms
David Alberts
,
Monika Rauch Henzinger
Technical Report (TR-95-020), 1995
Average case analysis of dynamic graph algorithms
David Alberts
,
Monika Rauch Henzinger
Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'95 (San Francisco, California, January 22-24, 1995)
, 1995, pp. 312-321
Fully dynamic biconnectivity and transitive closure
Monika Rauch Henzinger
,
Valerie King
Proceedings of the 36th Annual IEEE Symposium on Foundations of Computer Science, FOCS'95 (Milwaukee, Wisconsin, October 23-25, 1995)
, 1995, pp. 664-672
Randomized dynamic graph algorithms with polylogarithmic time per operation
Monika Rauch Henzinger
,
Valerie King
Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, STOC'95 (Las Vegas, Nevada, USA, May 29 - June 1, 1995)
, 1995, pp. 519-527
Approximating minimum cuts under insertions
Monika Rauch Henzinger
Lecture Notes in Computer Science
944
, 1995, pp. 280-291
Fully dynamic cycle-equivalence in graphs
Monika Rauch Henzinger
Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science, FOCS'94 (Santa Fe, New Mexico, November 20-22, 1994)
, 1994, pp. 744-755