( en | de | ru )

 

Disambiguation of "Henzinger, Monika"

Author of the publication

copydeleteadd this publication to your clipboard
Combinatorial algorithms for web search engines: three success stories.

. SODA, page 1022-1026. SIAM, (2007)

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 Mühlbauer

Modelling wall interactions of a high-pressure, hollow cone spray. TU Darmstadt, (2009)

Monika Mynarska

Monika Schumann

Monika Dittrich

Monika Hackel

 

Other publications of authors with the same name

Efficient and Dynamic Algorithms for Alternating Büchi Games and Maximal End-Component Decomposition., and . J. ACM, 61 (3): 15:1-15:40 (2014)Fully Dynamic Single-Source Reachability in Practice: An Experimental Study., , and . CoRR, (2019)Improved Algorithms for Decremental Single-Source Reachability on Directed Graphs., , and . ICALP (1), volume 9134 of Lecture Notes in Computer Science, page 725-736. Springer, (2015)Sublinear-Time Maintenance of Breadth-First Spanning Tree in Partially Dynamic Networks., , and . ICALP (2), volume 7966 of Lecture Notes in Computer Science, page 607-619. Springer, (2013)Graph Minors for Preserving Terminal Distances Approximately - Lower and Upper Bounds., , and . ICALP, volume 55 of LIPIcs, page 131:1-131:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Ad Exchange: Envy-Free Auctions with Mediators., , and . WINE, volume 9470 of Lecture Notes in Computer Science, page 104-117. Springer, (2015)Constant-Time Dynamic (Δ+1)-Coloring., and . STACS, volume 154 of LIPIcs, page 53:1-53:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Faster Fully Dynamic Transitive Closure in Practice., , and . SEA, volume 160 of LIPIcs, page 14:1-14:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Improved Guarantees for Vertex Sparsification in Planar Graphs., , and . SIAM J. Discret. Math., 34 (1): 130-162 (2020)Algorithms and conditional lower bounds for planning problems., , , and . Artif. Intell., (2021)