MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for authors named "Monika Rauch Henzinger" – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

20 documents found, showing 1 through 10. Next 10 →

ATOM

Approximating Minimum Cuts under Insertions (Extended Abstract)
by Monika Rauch Henzinger — 1994 — Proc. 22nd International Colloquium on Automata, Languages and Programming (ICALP'95), LNCS 944
…-1198 (510) 643-9153 FAX (510) 643-7684 Approximating Minimum Cuts under Insertions Monika Rauch Henzinger…
Add To MetaCart

Improved Data Structures for Fully Dynamic Biconnectivity
by Monika Rauch Henzinger — 1997 — Proc. 26th ACM Symp. Theory of Computing
… Biconnectivity Monika Rauch Henzinger d i g i t a l Systems Research Center 130 Lytton Avenue Palo Alto…
Cited by 2 (0 self) – Add To MetaCart

Fully Dynamic Cycle-Equivalence in Graphs
by Monika Rauch Henzinger — 1994 — Proc. 35th Symp. on Foundations of Computer Science
…Fully Dynamic Cycle-Equivalence in Graphs to appear in Proceedings of FOCS 94 Monika Rauch…
Cited by 2 (1 self) – Add To MetaCart

A Static 2-Approximation Algorithm for Vertex Connectivity and Imcremental Approximation Algorithms for Edge and Vertex Connectivity
by Monika Rauch Henzinger — 1995 — J. Algorithms
… for Edge and Vertex Connectivity Monika Rauch Henzinger ? Digital Systems Research Center,130 Lytton…
Cited by 6 (1 self) – Add To MetaCart

Scheduling Multicasts on Unit-Capacity Trees and Meshes
by Monika Rauch Henzinger, Stefano Leonardi — 1998
… Monika Rauch Henzinger and Stefano Leonardi d i g i t a l Systems Research Center 130 Lytton Avenue Palo…
Cited by 2 (0 self) – Add To MetaCart

Maintaining Minimum Spanning Trees in Dynamic Graphs
by Monika Rauch Henzinger , Valerie King — 1997 — IN PROC. 24TH INTERNATIONAL COLLOQUIUM ON AUTOMATA, LANGUAGES, AND PROGRAMMING (ICALP
… Graphs Monika Rauch Henzinger and Valerie King d i g i t a l Systems Research Center 130 Lytton Avenue…
Cited by 21 (2 self) – Add To MetaCart

Fully Dynamic 2-Edge Connectivity Algorithm in Polylogarithmic Time per Operation
by Monika Rauch Henzinger, Valerie King — 1997
… in Polylogarithmic Time per Operation Monika Rauch Henzinger and Valerie King d i g i t a l Systems Research Center…
Cited by 6 (0 self) – Add To MetaCart

Improved Sampling with Applications to Dynamic Graph Algorithms.
by Monika Rauch Henzinger, Mikkel Thorup — 1996 — Proc. 23rd International Colloquium on Automata, Languages, and Programming (ICALP), LNCS 1099
…Improved Sampling with Applications to Dynamic Graph Algorithms. Monika Rauch Henzinger 1…
Cited by 9 (6 self) – Add To MetaCart

Faster Vertex Connectivity Algorithms
by Monika Rauch Henzinger, Satish Rao — Proceedings of the 37th Annual IEEE Symposium on Foundations of Computer Science. - 15
…Faster Vertex Connectivity Algorithms Monika Rauch Henzinger Satish Rao y Abstract We present…
Cited by 1 (0 self) – Add To MetaCart

Randomized Fully Dynamic Graph Algorithms with Polylogarithmic Time per Operation
by Monika Rauch Henzinger, Valerie King — 1999 — JOURNAL OF THE ACM
…Randomized Fully Dynamic Graph Algorithms with Polylogarithmic Time per Operation Monika Rauch…
Cited by 28 (0 self) – Add To MetaCart

Showing 1 through 10. Next 10 →

ATOM

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB