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) - 2021
- [c128]Sayan Bhattacharya, Monika Henzinger
Dynamic Set Cover: Improved Amortized and Worst-Case Update Time. SODA 2021: 2537-2549 - 2020
- [j69]Sayan Bhattacharya
Deterministic Dynamic Matching in O(1) Update Time. Algorithmica 82(4): 1057-1080 (2020) - [i76]Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai, Xiaowei Wu:
An Improved Algorithm for Dynamic Set Cover. CoRR abs/2002.11171 (2020) - 2019
- [j64]Sayan Bhattacharya, Monika Henzinger
New amortized cell-probe lower bounds for dynamic problems. Theor. Comput. Sci. 779: 72-87 (2019) - [c115]Sayan Bhattacharya, Monika Henzinger
A New Deterministic Algorithm for Dynamic Set Cover. FOCS 2019: 406-423 - [i65]Sayan Bhattacharya, Monika Henzinger, Stefan Neumann:
New Amortized Cell-Probe Lower Bounds for Dynamic Problems. CoRR abs/1902.02304 (2019) - [i55]Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai:
A New Deterministic Algorithm for Dynamic Set Cover. CoRR abs/1909.11600 (2019) - 2018
- [j63]Sayan Bhattacharya, Monika Henzinger
Dynamic algorithms via the primal-dual method. Inf. Comput. 261: 219-239 (2018) - [j60]Sayan Bhattacharya, Monika Henzinger
Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching. SIAM J. Comput. 47(3): 859-887 (2018) - [c103]Sayan Bhattacharya, Deeparnab Chakrabarty, Monika Henzinger
Dynamic Algorithms for Graph Coloring. SODA 2018: 1-20 - 2017
- [j55]Sayan Bhattacharya, Wolfgang Dvorák
Welfare Maximization with Friends-of-Friends Network Externalities. Theory Comput. Syst. 61(4): 948-986 (2017) - [c92]Sayan Bhattacharya, Deeparnab Chakrabarty, Monika Henzinger:
Deterministic Fully Dynamic Approximate Vertex Cover and Fractional Matching in O(1) Amortized Update Time. IPCO 2017: 86-98 - [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
- [c83]Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai:
New deterministic approximation algorithms for fully dynamic matching. STOC 2016: 398-411 - [i33]Sayan Bhattacharya, Monika Henzinger, Giuseppe F. Italiano:
Design of Dynamic Algorithms via Primal-Dual Method. CoRR abs/1604.05337 (2016) - [i30]Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai:
New Deterministic Approximation Algorithms for Fully Dynamic Matching. CoRR abs/1604.05765 (2016) - [i26]Sayan Bhattacharya, Deeparnab Chakrabarty, Monika Henzinger:
Deterministic Fully Dynamic Approximate Vertex Cover and Fractional Matching in $O(1)$ Amortized Update Time. CoRR abs/1611.00198 (2016) - 2015
- [c81]Sayan Bhattacharya, Monika Henzinger, Giuseppe F. Italiano
Design of Dynamic Algorithms via Primal-Dual Method. ICALP (1) 2015: 206-218 - [c77]Sayan Bhattacharya, Monika Henzinger, Giuseppe F. Italiano:
Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching. SODA 2015: 785-804 - [c76]Sayan Bhattacharya, Wolfgang Dvorák, Monika Henzinger
Welfare Maximization with Friends-of-Friends Network Externalities. STACS 2015: 90-102 - [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) - 2014
- [i12]Sayan Bhattacharya, Monika Henzinger, Giuseppe F. Italiano:
Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching. CoRR abs/1412.1318 (2014)
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: