List of Publications

@inproceedings{DBLP:conf/soda/HenzingerU25,

title = {Improved Differentially Private Continual Observation Using Group 

 Algebra},

author = {Monika Henzinger and Jalaj Upadhyay},

editor = {Yossi Azar and Debmalya Panigrahi},

url = {https://doi.org/10.1137/1.9781611978322.95 

https://doi.org/10.48550/arXiv.2412.02840},

doi = {10.1137/1.9781611978322.95},

year  = {2025},

date = {2025-01-01},

booktitle = {Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 

 SODA 2025, New Orleans, LA, USA, January 12-15, 2025},

pages = {2951–2970},

publisher = {SIAM},

keywords = {},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{DBLP:conf/soda/El-HayekH025,

title = {Fully Dynamic Approximate Minimum Cut in Subpolynomial Time per Operation},

author = {Antoine El-Hayek and Monika Henzinger and Jason Li},

editor = {Yossi Azar and Debmalya Panigrahi},

url = {https://doi.org/10.1137/1.9781611978322.22 

https://doi.org/10.48550/arXiv.2412.15069},

doi = {10.1137/1.9781611978322.22},

year  = {2025},

date = {2025-01-01},

booktitle = {Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 

 SODA 2025, New Orleans, LA, USA, January 12-15, 2025},

pages = {750–784},

publisher = {SIAM},

keywords = {},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{DBLP:conf/sand/El-HayekHH25,

title = {On b-Matching and Fully-Dynamic Maximum k-Edge Coloring},

author = {Antoine El-Hayek and Kathrin Hanauer and Monika Henzinger},

editor = {Kitty Meeks and Christian Scheideler},

url = {https://doi.org/10.4230/LIPIcs.SAND.2025.4 

https://arxiv.org/abs/2310.01149},

doi = {10.4230/LIPICS.SAND.2025.4},

year  = {2025},

date = {2025-01-01},

booktitle = {4th Symposium on Algorithmic Foundations of Dynamic Networks, SAND 

 2025, June 9-11, 2025, Liverpool, UK},

volume = {330},

pages = {4:1–4:23},

publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},

series = {LIPIcs},

keywords = {},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{DBLP:conf/podc/BreitkopfDE025,

title = {Brief Announcement: Minimizing Energy Solves Relative Majority with 

 a Cubic Number of States in Population Protocols},

author = {Tom-Lukas Breitkopf and Julien Dallot and Antoine El-Hayek and Stefan Schmid},

editor = {Alkida Balliu and Fabian Kuhn},

url = {https://doi.org/10.1145/3732772.3733512 

https://arxiv.org/abs/2505.02785},

doi = {10.1145/3732772.3733512},

year  = {2025},

date = {2025-01-01},

booktitle = {Proceedings of the ACM Symposium on Principles of Distributed Computing, 

 PODC 2025, Hotel Las Brisas Huatulco, Huatulco, Mexico, June 16-20, 

 2025},

pages = {549–552},

publisher = {ACM},

keywords = {},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{DBLP:conf/podc/El-HayekE025,

title = {An Almost Tight Lower Bound for Plurality Consensus with Undecided 

 State Dynamics in the Population Protocol Model},

author = {Antoine El-Hayek and Robert Elsässer and Stefan Schmid},

editor = {Alkida Balliu and Fabian Kuhn},

url = {https://doi.org/10.1145/3732772.3733505 

https://arxiv.org/abs/2505.02765},

doi = {10.1145/3732772.3733505},

year  = {2025},

date = {2025-01-01},

booktitle = {Proceedings of the ACM Symposium on Principles of Distributed Computing, 

 PODC 2025, Hotel Las Brisas Huatulco, Huatulco, Mexico, June 16-20, 

 2025},

pages = {532–540},

publisher = {ACM},

keywords = {},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{DBLP:conf/icalp/GoranciHRS25,

title = {Incremental Approximate Maximum Flow via Residual Graph Sparsification},

author = {Gramoz Goranci and Monika Henzinger and Harald Räcke and A. R. Sricharan},

editor = {Keren Censor-Hillel and Fabrizio Grandoni and Joël Ouaknine and Gabriele Puppis},

url = {https://doi.org/10.4230/LIPIcs.ICALP.2025.91 

https://arxiv.org/abs/2502.09105},

doi = {10.4230/LIPICS.ICALP.2025.91},

year  = {2025},

date = {2025-01-01},

booktitle = {52nd International Colloquium on Automata, Languages, and Programming, 

 ICALP 2025, July 8-11, 2025, Aarhus, Denmark},

volume = {334},

pages = {91:1–91:20},

publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},

series = {LIPIcs},

keywords = {},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{DBLP:conf/aistats/HenzingerSS25,

title = {Differentially Private Continual Release of Histograms and Related 

 Queries},

author = {Monika Henzinger and A. R. Sricharan and Teresa Anna Steiner},

editor = {Yingzhen Li and Stephan Mandt and Shipra Agrawal and Mohammad Emtiyaz Khan},

url = {https://proceedings.mlr.press/v258/henzinger25a.html 

https://arxiv.org/abs/2302.11341},

year  = {2025},

date = {2025-01-01},

booktitle = {International Conference on Artificial Intelligence and Statistics, 

 AISTATS 2025, Mai Khao, Thailand, 3-5 May 2025},

volume = {258},

pages = {1990–1998},

publisher = {PMLR},

series = {Proceedings of Machine Learning Research},

keywords = {},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{DBLP:conf/esa/DhulipalaHLLSZ25,

title = {Near-Optimal Differentially Private Graph Algorithms via the Multidimensional 

 AboveThreshold Mechanism},

author = {Laxman Dhulipala and Monika Henzinger and George Z. Li and Quanquan C. Liu and A. R. Sricharan and Leqi Zhu},

editor = {Anne Benoit and Haim Kaplan and Sebastian Wild and Grzegorz Herman},

url = {https://doi.org/10.4230/LIPIcs.ESA.2025.91 

https://arxiv.org/abs/2508.02182},

doi = {10.4230/LIPICS.ESA.2025.91},

year  = {2025},

date = {2025-01-01},

booktitle = {33rd Annual European Symposium on Algorithms, ESA 2025, September 

 15-17, 2025, Warsaw, Poland},

volume = {351},

pages = {91:1–91:20},

publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},

series = {LIPIcs},

keywords = {},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{DBLP:conf/esa/HenzingerS25,

title = {Securing Dynamic Data: A Primer on Differentially Private Data Structures 

 (Invited Talk)},

author = {Monika Henzinger and Roodabeh Safavi},

editor = {Anne Benoit and Haim Kaplan and Sebastian Wild and Grzegorz Herman},

url = {https://doi.org/10.4230/LIPIcs.ESA.2025.2},

doi = {10.4230/LIPICS.ESA.2025.2},

year  = {2025},

date = {2025-01-01},

booktitle = {33rd Annual European Symposium on Algorithms, ESA 2025, September 

 15-17, 2025, Warsaw, Poland},

volume = {351},

pages = {2:1–2:14},

publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},

series = {LIPIcs},

keywords = {},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{DBLP:conf/esa/HenzingerKMR25,

title = {Efficient Contractions of Dynamic Graphs - With Applications},

author = {Monika Henzinger and Evangelos Kosinas and Robin Münk and Harald Räcke},

editor = {Anne Benoit and Haim Kaplan and Sebastian Wild and Grzegorz Herman},

url = {https://doi.org/10.4230/LIPIcs.ESA.2025.36 

https://arxiv.org/abs/2509.05157},

doi = {10.4230/LIPICS.ESA.2025.36},

year  = {2025},

date = {2025-01-01},

booktitle = {33rd Annual European Symposium on Algorithms, ESA 2025, September 

 15-17, 2025, Warsaw, Poland},

volume = {351},

pages = {36:1–36:14},

publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},

series = {LIPIcs},

keywords = {},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{DBLP:conf/alenex/HenzingerSS24,

title = {Experimental Evaluation of Fully Dynamic emphk-Means via Coresets},

author = {Monika Henzinger and David Saulpic and Leonhard Sidl},

editor = {Rezaul Chowdhury and Solon P. Pissis},

url = {https://doi.org/10.1137/1.9781611977929.17 

 https://doi.org/10.48550/arXiv.2310.18034},

doi = {10.1137/1.9781611977929.17},

year  = {2024},

date = {2024-01-01},

booktitle = {Proceedings of the Symposium on Algorithm Engineering and Experiments, 

 ALENEX 2024, Alexandria, VA, USA, January 7-8, 2024},

pages = {220–233},

publisher = {SIAM},

keywords = {},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{DBLP:conf/approx/HenzingerSS24,

title = {Private Counting of Distinct Elements in the Turnstile Model and Extensions},

author = {Monika Henzinger and A. R. Sricharan and Teresa Anna Steiner},

editor = {Amit Kumar and Noga Ron-Zewi},

url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.40 

 https://doi.org/10.48550/arXiv.2408.11637},

doi = {10.4230/LIPICS.APPROX/RANDOM.2024.40},

year  = {2024},

date = {2024-01-01},

booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms 

 and Techniques, APPROX/RANDOM 2024, August 28-30, 2024, London School 

 of Economics, London, UK},

volume = {317},

pages = {40:1–40:21},

publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},

series = {LIPIcs},

keywords = {},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{DBLP:conf/esa/TourHS24,

title = {Fully Dynamic k-Means Coreset in Near-Optimal Update Time},

author = {Max Dupré Tour and Monika Henzinger and David Saulpic},

editor = {Timothy M. Chan and Johannes Fischer and John Iacono and Grzegorz Herman},

url = {https://doi.org/10.4230/LIPIcs.ESA.2024.100 

 https://doi.org/10.48550/arXiv.2406.19926},

doi = {10.4230/LIPICS.ESA.2024.100},

year  = {2024},

date = {2024-01-01},

booktitle = {32nd Annual European Symposium on Algorithms, ESA 2024, September 

 2-4, 2024, Royal Holloway, London, United Kingdom},

volume = {308},

pages = {100:1–100:16},

publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},

series = {LIPIcs},

keywords = {},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{DBLP:conf/gd/Henzinger24,

title = {How Can Algorithms Help in Protecting Our Privacy (Invited Talk)},

author = {Monika Henzinger},

editor = {Stefan Felsner and Karsten Klein},

url = {https://doi.org/10.4230/LIPIcs.GD.2024.2},

doi = {10.4230/LIPICS.GD.2024.2},

year  = {2024},

date = {2024-01-01},

booktitle = {32nd International Symposium on Graph Drawing and Network Visualization, 

 GD 2024, September 18-20, 2024, Vienna, Austria},

volume = {320},

pages = {2:1–2:1},

publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},

series = {LIPIcs},

keywords = {},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{DBLP:conf/icml/AxiotisCHJMSWW24,

title = {Data-Efficient Learning via Clustering-Based Sensitivity Sampling: 

 Foundation Models and Beyond},

author = {Kyriakos Axiotis and Vincent Cohen-Addad and Monika Henzinger and Sammy Jerome and Vahab Mirrokni and David Saulpic and David P. Woodruff and Michael Wunder},

url = {https://openreview.net/forum?id=WUQ4YzIQt2 

 https://doi.org/10.48550/arXiv.2402.17327},

year  = {2024},

date = {2024-01-01},

booktitle = {Forty-first International Conference on Machine Learning, ICML 2024, 

 Vienna, Austria, July 21-27, 2024},

publisher = {OpenReview.net},

keywords = {},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{DBLP:conf/icml/TourHS24,

title = {Making Old Things New: A Unified Algorithm for Differentially Private 

 Clustering},

author = {Max Dupré Tour and Monika Henzinger and David Saulpic},

url = {https://openreview.net/forum?id=3ajK5xplDL 

 https://doi.org/10.48550/arXiv.2406.11649},

year  = {2024},

date = {2024-01-01},

booktitle = {Forty-first International Conference on Machine Learning, ICML 2024, 

 Vienna, Austria, July 21-27, 2024},

publisher = {OpenReview.net},

keywords = {},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{DBLP:conf/innovations/GoranciHRSS24,

title = {Electrical Flows for Polylogarithmic Competitive Oblivious Routing},

author = {Gramoz Goranci and Monika Henzinger and Harald Räcke and Sushant Sachdeva and A. R. Sricharan},

editor = {Venkatesan Guruswami},

url = {https://doi.org/10.4230/LIPIcs.ITCS.2024.55 

 https://doi.org/10.48550/arXiv.2303.02491},

doi = {10.4230/LIPICS.ITCS.2024.55},

year  = {2024},

date = {2024-01-01},

booktitle = {15th Innovations in Theoretical Computer Science Conference, ITCS 

 2024, January 30 to February 2, 2024, Berkeley, CA, USA},

volume = {287},

pages = {55:1–55:22},

publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},

series = {LIPIcs},

keywords = {},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{DBLP:conf/innovations/HenzingerSSY24,

title = {On the Complexity of Algorithms with Predictions for Dynamic Graph 

 Problems},

author = {Monika Henzinger and Barna Saha and Martin P. Seybold and Christopher Ye},

editor = {Venkatesan Guruswami},

url = {https://doi.org/10.4230/LIPIcs.ITCS.2024.62 

 https://doi.org/10.48550/arXiv.2307.16771},

doi = {10.4230/LIPICS.ITCS.2024.62},

year  = {2024},

date = {2024-01-01},

booktitle = {15th Innovations in Theoretical Computer Science Conference, ITCS 

 2024, January 30 to February 2, 2024, Berkeley, CA, USA},

volume = {287},

pages = {62:1–62:25},

publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},

series = {LIPIcs},

keywords = {},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{DBLP:conf/kdd/HanauerHMRV24,

title = {Expander Hierarchies for Normalized Cuts on Graphs},

author = {Kathrin Hanauer and Monika Henzinger and Robin Münk and Harald Räcke and Maximilian Vötsch},

editor = {Ricardo Baeza-Yates and Francesco Bonchi},

url = {https://doi.org/10.1145/3637528.3671978 

 https://doi.org/10.48550/arXiv.2406.14111},

doi = {10.1145/3637528.3671978},

year  = {2024},

date = {2024-01-01},

booktitle = {Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery 

 and Data Mining, KDD 2024, Barcelona, Spain, August 25-29, 2024},

pages = {1016–1027},

publisher = {ACM},

keywords = {},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{DBLP:conf/soda/MontesanoEHO24,

title = {Dynamically Maintaining the Persistent Homology of Time Series},

author = {Sebastiano Cultrera Montesano and Herbert Edelsbrunner and Monika Henzinger and Lara Ost},

editor = {David P. Woodruff},

url = {https://doi.org/10.1137/1.9781611977912.11 

 https://doi.org/10.48550/arXiv.2311.01115},

doi = {10.1137/1.9781611977912.11},

year  = {2024},

date = {2024-01-01},

booktitle = {Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 

 SODA 2024, Alexandria, VA, USA, January 7-10, 2024},

pages = {243–295},

publisher = {SIAM},

keywords = {},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{DBLP:conf/soda/HenzingerUU24,

title = {A Unifying Framework for Differentially Private Sums under Continual 

 Observation},

author = {Monika Henzinger and Jalaj Upadhyay and Sarvagya Upadhyay},

editor = {David P. Woodruff},

url = {https://doi.org/10.1137/1.9781611977912.38 

 https://doi.org/10.48550/arXiv.2307.08970},

doi = {10.1137/1.9781611977912.38},

year  = {2024},

date = {2024-01-01},

booktitle = {Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 

 SODA 2024, Alexandria, VA, USA, January 7-10, 2024},

pages = {995–1018},

publisher = {SIAM},

keywords = {},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{DBLP:conf/soda/HenzingerLRW24,

title = {Deterministic Near-Linear Time Minimum Cut in Weighted Graphs},

author = {Monika Henzinger and Jason Li and Satish Rao and Di Wang},

editor = {David P. Woodruff},

url = {https://doi.org/10.1137/1.9781611977912.111 

 https://doi.org/10.48550/arXiv.2401.05627},

doi = {10.1137/1.9781611977912.111},

year  = {2024},

date = {2024-01-01},

booktitle = {Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 

 SODA 2024, Alexandria, VA, USA, January 7-10, 2024},

pages = {3089–3139},

publisher = {SIAM},

keywords = {},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{DBLP:conf/wdag/El-HayekH024,

title = {Broadcast and Consensus in Stochastic Dynamic Networks with Byzantine 

 Nodes and Adversarial Edges},

author = {Antoine El-Hayek and Monika Henzinger and Stefan Schmid},

editor = {Dan Alistarh},

url = {https://doi.org/10.4230/LIPIcs.DISC.2024.21 

 https://doi.org/10.48550/arXiv.2302.11988},

doi = {10.4230/LIPICS.DISC.2024.21},

year  = {2024},

date = {2024-01-01},

booktitle = {38th International Symposium on Distributed Computing, DISC 2024, 

 October 28 to November 1, 2024, Madrid, Spain},

volume = {319},

pages = {21:1–21:15},

publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},

series = {LIPIcs},

keywords = {},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{DBLP:conf/icalp/GoranciH23,

title = {Efficient Data Structures for Incremental Exact and Approximate Maximum 

 Flow},

author = {Gramoz Goranci and Monika Henzinger},

editor = {Kousha Etessami and Uriel Feige and Gabriele Puppis},

url = {https://doi.org/10.4230/LIPIcs.ICALP.2023.69},

doi = {10.4230/LIPICS.ICALP.2023.69},

year  = {2023},

date = {2023-01-01},

booktitle = {50th International Colloquium on Automata, Languages, and Programming, 

 ICALP 2023, July 10-14, 2023, Paderborn, Germany},

volume = {261},

pages = {69:1–69:14},

publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},

series = {LIPIcs},

keywords = {},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{DBLP:conf/icalp/HenzingerLVZ23,

title = {Faster Submodular Maximization for Several Classes of Matroids},

author = {Monika Henzinger and Paul Liu and Jan Vondrák and Da Wei Zheng},

editor = {Kousha Etessami and Uriel Feige and Gabriele Puppis},

url = {https://doi.org/10.4230/LIPIcs.ICALP.2023.74 

 https://doi.org/10.48550/arXiv.2305.00122},

doi = {10.4230/LIPICS.ICALP.2023.74},

year  = {2023},

date = {2023-01-01},

booktitle = {50th International Colloquium on Automata, Languages, and Programming, 

 ICALP 2023, July 10-14, 2023, Paderborn, Germany},

volume = {261},

pages = {74:1–74:18},

publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},

series = {LIPIcs},

keywords = {},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{DBLP:conf/icml/FichtenbergerHU23,

title = {Constant Matters: Fine-grained Error Bound on Differentially Private 

 Continual Observation},

author = {Hendrik Fichtenberger and Monika Henzinger and Jalaj Upadhyay},

editor = {Andreas Krause and Emma Brunskill and Kyunghyun Cho and Barbara Engelhardt and Sivan Sabato and Jonathan Scarlett},

url = {https://proceedings.mlr.press/v202/fichtenberger23a.html},

year  = {2023},

date = {2023-01-01},

booktitle = {International Conference on Machine Learning, ICML 2023, 23-29 July 

 2023, Honolulu, Hawaii, USA},

volume = {202},

pages = {10072–10092},

publisher = {PMLR},

series = {Proceedings of Machine Learning Research},

keywords = {},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{DBLP:conf/infocom/HanauerHOS23,

title = {Dynamic Demand-Aware Link Scheduling for Reconfigurable Datacenters},

author = {Kathrin Hanauer and Monika Henzinger and Lara Ost and Stefan Schmid},

url = {https://doi.org/10.1109/INFOCOM53939.2023.10229050 

 https://doi.org/10.48550/arXiv.2301.05751},

doi = {10.1109/INFOCOM53939.2023.10229050},

year  = {2023},

date = {2023-01-01},

booktitle = {IEEE INFOCOM 2023 - IEEE Conference on Computer Communications, 

 New York City, NY, USA, May 17-20, 2023},

pages = {1–10},

publisher = {IEEE},

keywords = {},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{DBLP:conf/innovations/El-HayekH023,

title = {Asymptotically Tight Bounds on the Time Complexity of Broadcast and 

 Its Variants in Dynamic Networks},

author = {Antoine El-Hayek and Monika Henzinger and Stefan Schmid},

editor = {Yael Tauman Kalai},

url = {https://doi.org/10.4230/LIPIcs.ITCS.2023.47 

 https://doi.org/10.48550/arXiv.2211.10151},

doi = {10.4230/LIPICS.ITCS.2023.47},

year  = {2023},

date = {2023-01-01},

booktitle = {14th Innovations in Theoretical Computer Science Conference, ITCS 

 2023, January 10-13, 2023, MIT, Cambridge, Massachusetts, USA},

volume = {251},

pages = {47:1–47:21},

publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},

series = {LIPIcs},

keywords = {},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{DBLP:conf/innovations/HenzingerJPW23,

title = {A Combinatorial Cut-Toggling Algorithm for Solving Laplacian Linear 

 Systems},

author = {Monika Henzinger and Billy Jin and Richard Peng and David P. Williamson},

editor = {Yael Tauman Kalai},

url = {https://doi.org/10.4230/LIPIcs.ITCS.2023.69},

doi = {10.4230/LIPICS.ITCS.2023.69},

year  = {2023},

date = {2023-01-01},

booktitle = {14th Innovations in Theoretical Computer Science Conference, ITCS 

 2023, January 10-13, 2023, MIT, Cambridge, Massachusetts, USA},

volume = {251},

pages = {69:1–69:22},

publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},

series = {LIPIcs},

keywords = {},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{DBLP:conf/ipco/ZhengH23,

title = {Multiplicative Auction Algorithm for Approximate Maximum Weight Bipartite 

 Matching},

author = {Da Wei Zheng and Monika Henzinger},

editor = {Alberto Del Pia and Volker Kaibel},

url = {https://doi.org/10.1007/978-3-031-32726-1_32 

 https://doi.org/10.48550/arXiv.2301.09217},

doi = {10.1007/978-3-031-32726-1_32},

year  = {2023},

date = {2023-01-01},

booktitle = {Integer Programming and Combinatorial Optimization - 24th International 

 Conference, IPCO 2023, Madison, WI, USA, June 21-23, 2023, Proceedings},

volume = {13904},

pages = {453–465},

publisher = {Springer},

series = {Lecture Notes in Computer Science},

keywords = {},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{DBLP:conf/nips/CharikarHHVW23,

title = {Simple, Scalable and Effective Clustering via One-Dimensional Projections},

author = {Moses Charikar and Monika Henzinger and Lunjia Hu and Maximilian Vötsch and Erik Waingarten},

editor = {Alice Oh and Tristan Naumann and Amir Globerson and Kate Saenko and Moritz Hardt and Sergey Levine},

url = {http://papers.nips.cc/paper_files/paper/2023/hash/cbaffeeda13dbd8bf9489feb3f198ff4-Abstract-Conference.html 

 https://doi.org/10.48550/arXiv.2310.16752},

year  = {2023},

date = {2023-01-01},

booktitle = {Advances in Neural Information Processing Systems 36: Annual Conference 

 on Neural Information Processing Systems 2023, NeurIPS 2023, New Orleans, 

 LA, USA, December 10 - 16, 2023},

keywords = {},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{DBLP:conf/soda/GoranciHNSTW23,

title = {Fully Dynamic Exact Edge Connectivity in Sublinear Time},

author = {Gramoz Goranci and Monika Henzinger and Danupon Nanongkai and Thatchaphol Saranurak and Mikkel Thorup and Christian Wulff-Nilsen},

editor = {Nikhil Bansal and Viswanath Nagarajan},

url = {https://doi.org/10.1137/1.9781611977554.ch3 

 https://doi.org/10.48550/arXiv.2302.05951},

doi = {10.1137/1.9781611977554.CH3},

year  = {2023},

date = {2023-01-01},

booktitle = {Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 

 SODA 2023, Florence, Italy, January 22-25, 2023},

pages = {70–86},

publisher = {SIAM},

keywords = {},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{DBLP:conf/soda/ChiplunkarHKV23,

title = {Online Min-Max Paging},

author = {Ashish Chiplunkar and Monika Henzinger and Sagar Sudhir Kale and Maximilian Vötsch},

editor = {Nikhil Bansal and Viswanath Nagarajan},

url = {https://doi.org/10.1137/1.9781611977554.ch57 

 https://doi.org/10.48550/arXiv.2212.03016},

doi = {10.1137/1.9781611977554.CH57},

year  = {2023},

date = {2023-01-01},

booktitle = {Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 

 SODA 2023, Florence, Italy, January 22-25, 2023},

pages = {1545–1565},

publisher = {SIAM},

keywords = {},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{DBLP:conf/soda/BateniEFHJMW23,

title = {Optimal Fully Dynamic emphk-Center Clustering for Adaptive and 

 Oblivious Adversaries},

author = {MohammadHossein Bateni and Hossein Esfandiari and Hendrik Fichtenberger and Monika Henzinger and Rajesh Jayaram and Vahab Mirrokni and Andreas Wiese},

editor = {Nikhil Bansal and Viswanath Nagarajan},

url = {https://doi.org/10.1137/1.9781611977554.ch101 

 https://doi.org/10.48550/arXiv.2303.11843},

doi = {10.1137/1.9781611977554.CH101},

year  = {2023},

date = {2023-01-01},

booktitle = {Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 

 SODA 2023, Florence, Italy, January 22-25, 2023},

pages = {2677–2727},

publisher = {SIAM},

keywords = {},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{DBLP:conf/soda/HenzingerUU23,

title = {Almost Tight Error Bounds on Differentially Private Continual Counting},

author = {Monika Henzinger and Jalaj Upadhyay and Sarvagya Upadhyay},

editor = {Nikhil Bansal and Viswanath Nagarajan},

url = {https://doi.org/10.1137/1.9781611977554.ch183 

 https://doi.org/10.48550/arXiv.2211.05006},

doi = {10.1137/1.9781611977554.CH183},

year  = {2023},

date = {2023-01-01},

booktitle = {Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 

 SODA 2023, Florence, Italy, January 22-25, 2023},

pages = {5003–5039},

publisher = {SIAM},

keywords = {},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{DBLP:conf/stacs/Henzinger0R023,

title = {Dynamic Maintenance of Monotone Dynamic Programs and Applications},

author = {Monika Henzinger and Stefan Neumann and Harald Räcke and Stefan Schmid},

editor = {Petra Berenbrink and Patricia Bouyer and Anuj Dawar and Mamadou Moustapha Kanté},

url = {https://doi.org/10.4230/LIPIcs.STACS.2023.36 

 https://doi.org/10.48550/arXiv.2301.01744},

doi = {10.4230/LIPICS.STACS.2023.36},

year  = {2023},

date = {2023-01-01},

booktitle = {40th International Symposium on Theoretical Aspects of Computer Science, 

 STACS 2023, March 7-9, 2023, Hamburg, Germany},

volume = {254},

pages = {36:1–36:16},

publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},

series = {LIPIcs},

keywords = {},

pubstate = {published},

tppubtype = {inproceedings}

}