default search action
Monika Henzinger
- > Home > Persons > Monika Henzinger
Publications
- 2023
- [j76]Sayan Bhattacharya, Monika Henzinger
, Danupon Nanongkai
Deterministic Near-Optimal Approximation Algorithms for Dynamic Set Cover. SIAM J. Comput. 52(5): 1132-1192 (2023) - [c152]Gramoz Goranci, Monika Henzinger, Danupon Nanongkai, Thatchaphol Saranurak
Fully Dynamic Exact Edge Connectivity in Sublinear Time. SODA 2023: 70-86 - [i114]Gramoz Goranci, Monika Henzinger, Danupon Nanongkai, Thatchaphol Saranurak
Fully Dynamic Exact Edge Connectivity in Sublinear Time. CoRR abs/2302.05951 (2023) - 2021
- [j71]Monika Henzinger
A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths. SIAM J. Comput. 50(3) (2021) - [c128]Sayan Bhattacharya, Monika Henzinger
Dynamic Set Cover: Improved Amortized and Worst-Case Update Time. SODA 2021: 2537-2549 - 2020
- [i76]Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai, Xiaowei Wu:
An Improved Algorithm for Dynamic Set Cover. CoRR abs/2002.11171 (2020) - 2019
- [c115]Sayan Bhattacharya, Monika Henzinger
A New Deterministic Algorithm for Dynamic Set Cover. FOCS 2019: 406-423 - [c110]Mohit Daga
Distributed edge connectivity in sublinear time. STOC 2019: 343-354 - [i64]Mohit Daga, Monika Henzinger, Danupon Nanongkai, Thatchaphol Saranurak
Distributed Edge Connectivity in Sublinear Time. CoRR abs/1904.04341 (2019) - [i55]Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai:
A New Deterministic Algorithm for Dynamic Set Cover. CoRR abs/1909.11600 (2019) - 2018
- [j62]Monika Henzinger
Decremental Single-Source Shortest Paths on Undirected Graphs in Near-Linear Total Update Time. J. ACM 65(6): 36:1-36:40 (2018) - [c103]Sayan Bhattacharya, Deeparnab Chakrabarty, Monika Henzinger
Dynamic Algorithms for Graph Coloring. SODA 2018: 1-20 - 2017
- [j53]Monika Henzinger
Sublinear-Time Maintenance of Breadth-First Spanning Trees in Partially Dynamic Networks. ACM Trans. Algorithms 13(4): 51:1-51:24 (2017) - [c90]Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai:
Fully Dynamic Approximate Maximum Matching and Minimum Vertex Cover in O(log3 n) Worst Case Update Time. SODA 2017: 470-489 - [i43]Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai:
Fully Dynamic Approximate Maximum Matching and Minimum Vertex Cover in O(log3n) Worst Case Update Time. CoRR abs/1704.02844 (2017) - [i37]Sayan Bhattacharya, Deeparnab Chakrabarty, Monika Henzinger, Danupon Nanongkai:
Dynamic Algorithms for Graph Coloring. CoRR abs/1711.04355 (2017) - 2016
- [j51]Monika Henzinger
Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(mn) Barrier and Derandomization. SIAM J. Comput. 45(3): 947-1006 (2016) - [c83]Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai:
New deterministic approximation algorithms for fully dynamic matching. STOC 2016: 398-411 - [c82]Monika Henzinger
A deterministic almost-tight distributed algorithm for approximating single-source shortest paths. STOC 2016: 489-498 - [r4]Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai:
Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(mn) Barrierand Derandomization. Encyclopedia of Algorithms 2016: 600-602 - [i30]Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai:
New Deterministic Approximation Algorithms for Fully Dynamic Matching. CoRR abs/1604.05765 (2016) - [i29]Krishnendu Chatterjee, Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai:
Polynomial-Time Algorithms for Energy Games with Special Weight Structures. CoRR abs/1604.08234 (2016) - [i22]Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai:
Improved Algorithms for Decremental Single-Source Reachability on Directed Graphs. CoRR abs/1612.03856 (2016) - 2015
- [c79]Monika Henzinger, Sebastian Krinninger
Improved Algorithms for Decremental Single-Source Reachability on Directed Graphs. ICALP (1) 2015: 725-736 - [c75]Monika Henzinger
Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture. STOC 2015: 21-30 - [c74]Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai, Charalampos E. Tsourakakis
Space- and Time-Efficient Algorithm for Maintaining Dense Subgraphs on One-Pass Dynamic Streams. STOC 2015: 173-182 - [i21]Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai, Charalampos E. Tsourakakis:
Space- and Time-Efficient Algorithm for Maintaining Dense Subgraphs on One-Pass Dynamic Streams. CoRR abs/1504.02268 (2015) - [i20]Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai:
An Almost-Tight Distributed Algorithm for Computing Single-Source Shortest Paths. CoRR abs/1504.07056 (2015) - [i19]Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai:
Sublinear-Time Decremental Algorithms for Single-Source Reachability and Shortest Paths on Directed Graphs. CoRR abs/1504.07959 (2015) - [i17]Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai, Thatchaphol Saranurak
Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture. CoRR abs/1511.06773 (2015) - [i16]Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai:
Sublinear-Time Maintenance of Breadth-First Spanning Trees in Partially Dynamic Networks. CoRR abs/1512.08147 (2015) - [i15]Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai:
Decremental Single-Source Shortest Paths on Undirected Graphs in Near-Linear Total Update Time. CoRR abs/1512.08148 (2015) - 2014
- [j46]Krishnendu Chatterjee, Monika Henzinger
Polynomial-Time Algorithms for Energy Games with Special Weight Structures. Algorithmica 70(3): 457-492 (2014) - [c70]Monika Henzinger
Decremental Single-Source Shortest Paths on Undirected Graphs in Near-Linear Total Update Time. FOCS 2014: 146-155 - [c69]Monika Henzinger
A Subquadratic-Time Algorithm for Decremental Single-Source Shortest Paths. SODA 2014: 1053-1072 - [c68]Monika Henzinger
Sublinear-time decremental algorithms for single-source reachability and shortest paths on directed graphs. STOC 2014: 674-683 - 2013
- [c64]Monika Henzinger
Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(mn) Barrier and Derandomization. FOCS 2013: 538-547 - [c63]Monika Henzinger, Sebastian Krinninger
Sublinear-Time Maintenance of Breadth-First Spanning Tree in Partially Dynamic Networks. ICALP (2) 2013: 607-619 - [i10]Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai:
Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(mn) Barrier and Derandomization. CoRR abs/1308.0776 (2013) - 2012
- [c59]Krishnendu Chatterjee, Monika Henzinger, Sebastian Krinninger
Polynomial-Time Algorithms for Energy Games with Special Weight Structures. ESA 2012: 301-312
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: