( en | de | ru )

 

Disambiguation of "Henzinger, Monika Rauch"

Author of the publication

copydeleteadd this publication to your clipboard
Who Links to Whom: Mining Linkage between Web Sites.

, , , and . ICDM, page 51-58. IEEE Computer Society, (2001)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Monika Rauch

Agnes-Monika Rauch

Monika Ulrike Rauch

Renate Rauch

Georg Rauch

 

Other publications of authors with the same name

Finding Related Pages in the World Wide Web., and . Comput. Networks, 31 (11-16): 1467-1479 (1999)Scheduling multicasts on unit-capacity trees and meshes., and . J. Comput. Syst. Sci., 66 (3): 567-611 (2003)Randomized dynamic graph algorithms with polylogarithmic time per operation., and . STOC, page 519-527. ACM, (1995)Computing Vertex Connectivity: New Bounds from Old Techniques., , and . FOCS, page 462-471. IEEE Computer Society, (1996)Web Information Retrieval.. ICDE, page 693. IEEE Computer Society, (2000)Scheduling Multicasts on Unit-Capacity Trees and Meshes., and . SODA, page 438-447. ACM/SIAM, (1999)Algorithmic Challenges in Web Search Engines.. Internet Math., 1 (1): 115-123 (2003)Certificates and Fast Algorithms for Biconnectivity in Fully-Dynamic Graphs., and . ESA, volume 979 of Lecture Notes in Computer Science, page 171-184. Springer, (1995)Improved Sampling with Applications to Dynamic Graph Algorithms., and . ICALP, volume 1099 of Lecture Notes in Computer Science, page 290-299. Springer, (1996)A Static 2-Approximation Algorithm for Vertex Connectivity and Incremental Approximation Algorithms for Edge and Vertex Connectivity.. J. Algorithms, 24 (1): 194-220 (1997)