default search action
Monika Henzinger
- > Home > Persons > Monika Henzinger
Publications
- 2022
- [j75]Kathrin Hanauer
, Monika Henzinger
Recent Advances in Fully Dynamic Graph Algorithms - A Quick Reference Guide. ACM J. Exp. Algorithmics 27: 1.11:1-1.11:45 (2022) - [c147]Monika Henzinger, Alexander Noe, Christian Schulz:
Practical Fully Dynamic Minimum Cut Algorithms. ALENEX 2022: 13-26 - [c140]Kathrin Hanauer, Monika Henzinger, Christian Schulz:
Recent Advances in Fully Dynamic Graph Algorithms (Invited Talk). SAND 2022: 1:1-1:47 - 2021
- [c136]Monika Henzinger
Faster Parallel Multiterminal Cuts. ACDA 2021: 100-110 - [c135]Gramoz Goranci, Monika Henzinger
Fully Dynamic k-Center Clustering in Low Dimensional Metrics. ALENEX 2021: 143-153 - [i89]Monika Henzinger, Alexander Noe, Christian Schulz:
Practical Fully Dynamic Minimum Cut Algorithms. CoRR abs/2101.05033 (2021) - [i88]Kathrin Hanauer, Monika Henzinger, Christian Schulz:
Recent Advances in Fully Dynamic Graph Algorithms. CoRR abs/2102.11169 (2021) - 2020
- [c125]Monika Henzinger, Alexander Noe, Christian Schulz:
Shared-Memory Branch-and-Reduce for Multiterminal Cuts. ALENEX 2020: 42-55 - [c124]Kathrin Hanauer, Monika Henzinger, Christian Schulz:
Fully Dynamic Single-Source Reachability in Practice: An Experimental Study. ALENEX 2020: 106-119 - [c121]Monika Henzinger
Dynamic Matching Algorithms in Practice. ESA 2020: 58:1-58:20 - [c120]Monika Henzinger
Finding All Global Minimum Cuts in Practice. ESA 2020: 59:1-59:20 - [c117]Kathrin Hanauer
Faster Fully Dynamic Transitive Closure in Practice. SEA 2020: 14:1-14:14 - [p1]Sonja Biedermann, Monika Henzinger, Christian Schulz
Vienna Graph Clustering. Protein-Protein Interaction Networks 2020: 215-231 - [i79]Kathrin Hanauer, Monika Henzinger, Christian Schulz:
Faster Fully Dynamic Transitive Closure in Practice. CoRR abs/2002.00813 (2020) - [i78]Monika Henzinger, Alexander Noe, Christian Schulz, Darren Strash:
Finding All Global Minimum Cuts In Practice. CoRR abs/2002.06948 (2020) - [i74]Monika Henzinger
Dynamic Matching Algorithms in Practice. CoRR abs/2004.09099 (2020) - [i72]Monika Henzinger, Alexander Noe, Christian Schulz:
Faster Parallel Multiterminal Cuts. CoRR abs/2004.11666 (2020) - 2019
- [c113]Monika Henzinger
Shared-Memory Exact Minimum Cuts. IPDPS 2019: 13-22 - [i62]Kathrin Hanauer, Monika Henzinger, Christian Schulz:
Fully Dynamic Single-Source Reachability in Practice: An Experimental Study. CoRR abs/1905.01216 (2019) - [i59]Monika Henzinger, Alexander Noe, Christian Schulz:
Shared-Memory Branch-and-Reduce for Multiterminal Cuts. CoRR abs/1908.04141 (2019) - 2018
- [j61]Monika Henzinger
Practical Minimum Cut Algorithms. ACM J. Exp. Algorithmics 23 (2018) - [c108]Monika Henzinger, Alexander Noe, Christian Schulz
Practical Minimum Cut Algorithms. ALENEX 2018: 48-61 - [c100]Sonja Biedermann, Monika Henzinger
Memetic Graph Clustering. SEA 2018: 3:1-3:15 - [i53]Sonja Biedermann, Monika Henzinger, Christian Schulz, Bernhard Schuster:
Memetic Graph Clustering. CoRR abs/1802.07034 (2018) - [i49]Monika Henzinger, Alexander Noe, Christian Schulz:
Shared-memory Exact Minimum Cuts. CoRR abs/1808.05458 (2018) - 2017
- [i38]Monika Henzinger, Alexander Noe, Christian Schulz, Darren Strash:
Practical Minimum Cut Algorithms. CoRR abs/1708.06127 (2017)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-10-18 00:55 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: