Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Monika Henzinger
@inproceedings{DBLP:conf/innovations/GoranciHRSS24,
author = {Gramoz Goranci and
Monika Henzinger and
Harald R{\"{a}}cke and
Sushant Sachdeva and
A. R. Sricharan},
editor = {Venkatesan Guruswami},
title = {Electrical Flows for Polylogarithmic Competitive Oblivious Routing},
booktitle = {15th Innovations in Theoretical Computer Science Conference, {ITCS}
2024, January 30 to February 2, 2024, Berkeley, CA, {USA}},
series = {LIPIcs},
volume = {287},
pages = {55:1--55:22},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2024},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2024.55},
doi = {10.4230/LIPICS.ITCS.2024.55},
timestamp = {Wed, 24 Jan 2024 15:25:09 +0100},
biburl = {https://dblp.org/rec/conf/innovations/GoranciHRSS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/HenzingerSSY24,
author = {Monika Henzinger and
Barna Saha and
Martin P. Seybold and
Christopher Ye},
editor = {Venkatesan Guruswami},
title = {On the Complexity of Algorithms with Predictions for Dynamic Graph
Problems},
booktitle = {15th Innovations in Theoretical Computer Science Conference, {ITCS}
2024, January 30 to February 2, 2024, Berkeley, CA, {USA}},
series = {LIPIcs},
volume = {287},
pages = {62:1--62:25},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2024},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2024.62},
doi = {10.4230/LIPICS.ITCS.2024.62},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/HenzingerSSY24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/MontesanoEHO24,
author = {Sebastiano Cultrera di Montesano and
Herbert Edelsbrunner and
Monika Henzinger and
Lara Ost},
editor = {David P. Woodruff},
title = {Dynamically Maintaining the Persistent Homology of Time Series},
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}},
year = {2024},
url = {https://doi.org/10.1137/1.9781611977912.11},
doi = {10.1137/1.9781611977912.11},
timestamp = {Thu, 04 Apr 2024 19:38:10 +0200},
biburl = {https://dblp.org/rec/conf/soda/MontesanoEHO24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/HenzingerUU24,
author = {Monika Henzinger and
Jalaj Upadhyay and
Sarvagya Upadhyay},
editor = {David P. Woodruff},
title = {A Unifying Framework for Differentially Private Sums under Continual
Observation},
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}},
year = {2024},
url = {https://doi.org/10.1137/1.9781611977912.38},
doi = {10.1137/1.9781611977912.38},
timestamp = {Thu, 04 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/HenzingerUU24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/HenzingerLRW24,
author = {Monika Henzinger and
Jason Li and
Satish Rao and
Di Wang},
editor = {David P. Woodruff},
title = {Deterministic Near-Linear Time Minimum Cut in Weighted Graphs},
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}},
year = {2024},
url = {https://doi.org/10.1137/1.9781611977912.111},
doi = {10.1137/1.9781611977912.111},
timestamp = {Thu, 04 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/HenzingerLRW24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2401-05627,
author = {Monika Henzinger and
Jason Li and
Satish Rao and
Di Wang},
title = {Deterministic Near-Linear Time Minimum Cut in Weighted Graphs},
journal = {CoRR},
volume = {abs/2401.05627},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2401.05627},
doi = {10.48550/ARXIV.2401.05627},
eprinttype = {arXiv},
eprint = {2401.05627},
timestamp = {Thu, 25 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2401-05627.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2402-17327,
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},
title = {Data-Efficient Learning via Clustering-Based Sensitivity Sampling:
Foundation Models and Beyond},
journal = {CoRR},
volume = {abs/2402.17327},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2402.17327},
doi = {10.48550/ARXIV.2402.17327},
eprinttype = {arXiv},
eprint = {2402.17327},
timestamp = {Mon, 25 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2402-17327.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2402-18020,
author = {Monika Henzinger and
A. R. Sricharan and
Leqi Zhu},
title = {Tighter Bounds for Local Differentially Private Core Decomposition
and Densest Subgraph},
journal = {CoRR},
volume = {abs/2402.18020},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2402.18020},
doi = {10.48550/ARXIV.2402.18020},
eprinttype = {arXiv},
eprint = {2402.18020},
timestamp = {Tue, 26 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2402-18020.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/HenzingerJPW23,
author = {Monika Henzinger and
Billy Jin and
Richard Peng and
David P. Williamson},
title = {A Combinatorial Cut-Toggling Algorithm for Solving Laplacian Linear
Systems},
journal = {Algorithmica},
volume = {85},
number = {12},
pages = {3680--3716},
year = {2023},
url = {https://doi.org/10.1007/s00453-023-01154-8},
doi = {10.1007/S00453-023-01154-8},
timestamp = {Tue, 21 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/HenzingerJPW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BhattacharyaHNW23,
author = {Sayan Bhattacharya and
Monika Henzinger and
Danupon Nanongkai and
Xiaowei Wu},
title = {Deterministic Near-Optimal Approximation Algorithms for Dynamic Set
Cover},
journal = {{SIAM} J. Comput.},
volume = {52},
number = {5},
pages = {1132--1192},
year = {2023},
url = {https://doi.org/10.1137/21m1428649},
doi = {10.1137/21M1428649},
timestamp = {Thu, 09 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/BhattacharyaHNW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/GoranciH23,
author = {Gramoz Goranci and
Monika Henzinger},
editor = {Kousha Etessami and
Uriel Feige and
Gabriele Puppis},
title = {Efficient Data Structures for Incremental Exact and Approximate Maximum
Flow},
booktitle = {50th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2023, July 10-14, 2023, Paderborn, Germany},
series = {LIPIcs},
volume = {261},
pages = {69:1--69:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2023.69},
doi = {10.4230/LIPICS.ICALP.2023.69},
timestamp = {Wed, 05 Jul 2023 16:19:52 +0200},
biburl = {https://dblp.org/rec/conf/icalp/GoranciH23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/HenzingerLVZ23,
author = {Monika Henzinger and
Paul Liu and
Jan Vondr{\'{a}}k and
Da Wei Zheng},
editor = {Kousha Etessami and
Uriel Feige and
Gabriele Puppis},
title = {Faster Submodular Maximization for Several Classes of Matroids},
booktitle = {50th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2023, July 10-14, 2023, Paderborn, Germany},
series = {LIPIcs},
volume = {261},
pages = {74:1--74:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2023.74},
doi = {10.4230/LIPICS.ICALP.2023.74},
timestamp = {Tue, 19 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icalp/HenzingerLVZ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icml/FichtenbergerHU23,
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},
title = {Constant Matters: Fine-grained Error Bound on Differentially Private
Continual Observation},
booktitle = {International Conference on Machine Learning, {ICML} 2023, 23-29 July
2023, Honolulu, Hawaii, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {202},
pages = {10072--10092},
publisher = {{PMLR}},
year = {2023},
url = {https://proceedings.mlr.press/v202/fichtenberger23a.html},
timestamp = {Mon, 28 Aug 2023 17:23:08 +0200},
biburl = {https://dblp.org/rec/conf/icml/FichtenbergerHU23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/infocom/HanauerHOS23,
author = {Kathrin Hanauer and
Monika Henzinger and
Lara Ost and
Stefan Schmid},
title = {Dynamic Demand-Aware Link Scheduling for Reconfigurable Datacenters},
booktitle = {{IEEE} {INFOCOM} 2023 - {IEEE} Conference on Computer Communications,
New York City, NY, USA, May 17-20, 2023},
pages = {1--10},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/INFOCOM53939.2023.10229050},
doi = {10.1109/INFOCOM53939.2023.10229050},
timestamp = {Tue, 05 Sep 2023 20:33:21 +0200},
biburl = {https://dblp.org/rec/conf/infocom/HanauerHOS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/El-HayekH023,
author = {Antoine El{-}Hayek and
Monika Henzinger and
Stefan Schmid},
editor = {Yael Tauman Kalai},
title = {Asymptotically Tight Bounds on the Time Complexity of Broadcast and
Its Variants in Dynamic Networks},
booktitle = {14th Innovations in Theoretical Computer Science Conference, {ITCS}
2023, January 10-13, 2023, MIT, Cambridge, Massachusetts, {USA}},
series = {LIPIcs},
volume = {251},
pages = {47:1--47:21},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2023.47},
doi = {10.4230/LIPICS.ITCS.2023.47},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/El-HayekH023.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/HenzingerJPW23,
author = {Monika Henzinger and
Billy Jin and
Richard Peng and
David P. Williamson},
editor = {Yael Tauman Kalai},
title = {A Combinatorial Cut-Toggling Algorithm for Solving Laplacian Linear
Systems},
booktitle = {14th Innovations in Theoretical Computer Science Conference, {ITCS}
2023, January 10-13, 2023, MIT, Cambridge, Massachusetts, {USA}},
series = {LIPIcs},
volume = {251},
pages = {69:1--69:22},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2023.69},
doi = {10.4230/LIPICS.ITCS.2023.69},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/HenzingerJPW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/ZhengH23,
author = {Da Wei Zheng and
Monika Henzinger},
editor = {Alberto Del Pia and
Volker Kaibel},
title = {Multiplicative Auction Algorithm for Approximate Maximum Weight Bipartite
Matching},
booktitle = {Integer Programming and Combinatorial Optimization - 24th International
Conference, {IPCO} 2023, Madison, WI, USA, June 21-23, 2023, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13904},
pages = {453--465},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-32726-1\_32},
doi = {10.1007/978-3-031-32726-1\_32},
timestamp = {Fri, 26 May 2023 10:40:47 +0200},
biburl = {https://dblp.org/rec/conf/ipco/ZhengH23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/CharikarHHVW23,
author = {Moses Charikar and
Monika Henzinger and
Lunjia Hu and
Maximilian V{\"{o}}tsch and
Erik Waingarten},
editor = {Alice Oh and
Tristan Naumann and
Amir Globerson and
Kate Saenko and
Moritz Hardt and
Sergey Levine},
title = {Simple, Scalable and Effective Clustering via One-Dimensional Projections},
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},
year = {2023},
url = {http://papers.nips.cc/paper\_files/paper/2023/hash/cbaffeeda13dbd8bf9489feb3f198ff4-Abstract-Conference.html},
timestamp = {Fri, 01 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/nips/CharikarHHVW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GoranciHNSTW23,
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},
title = {Fully Dynamic Exact Edge Connectivity in Sublinear Time},
booktitle = {Proceedings of the 2023 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2023, Florence, Italy, January 22-25, 2023},
pages = {70--86},
publisher = {{SIAM}},
year = {2023},
url = {https://doi.org/10.1137/1.9781611977554.ch3},
doi = {10.1137/1.9781611977554.CH3},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/GoranciHNSTW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ChiplunkarHKV23,
author = {Ashish Chiplunkar and
Monika Henzinger and
Sagar Sudhir Kale and
Maximilian V{\"{o}}tsch},
editor = {Nikhil Bansal and
Viswanath Nagarajan},
title = {Online Min-Max Paging},
booktitle = {Proceedings of the 2023 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2023, Florence, Italy, January 22-25, 2023},
pages = {1545--1565},
publisher = {{SIAM}},
year = {2023},
url = {https://doi.org/10.1137/1.9781611977554.ch57},
doi = {10.1137/1.9781611977554.CH57},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/ChiplunkarHKV23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BateniEFHJMW23,
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},
title = {Optimal Fully Dynamic \emph{k}-Center Clustering for Adaptive and
Oblivious Adversaries},
booktitle = {Proceedings of the 2023 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2023, Florence, Italy, January 22-25, 2023},
pages = {2677--2727},
publisher = {{SIAM}},
year = {2023},
url = {https://doi.org/10.1137/1.9781611977554.ch101},
doi = {10.1137/1.9781611977554.CH101},
timestamp = {Fri, 17 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/BateniEFHJMW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/HenzingerUU23,
author = {Monika Henzinger and
Jalaj Upadhyay and
Sarvagya Upadhyay},
editor = {Nikhil Bansal and
Viswanath Nagarajan},
title = {Almost Tight Error Bounds on Differentially Private Continual Counting},
booktitle = {Proceedings of the 2023 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2023, Florence, Italy, January 22-25, 2023},
pages = {5003--5039},
publisher = {{SIAM}},
year = {2023},
url = {https://doi.org/10.1137/1.9781611977554.ch183},
doi = {10.1137/1.9781611977554.CH183},
timestamp = {Fri, 17 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/HenzingerUU23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Henzinger0R023,
author = {Monika Henzinger and
Stefan Neumann and
Harald R{\"{a}}cke and
Stefan Schmid},
editor = {Petra Berenbrink and
Patricia Bouyer and
Anuj Dawar and
Mamadou Moustapha Kant{\'{e}}},
title = {Dynamic Maintenance of Monotone Dynamic Programs and Applications},
booktitle = {40th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2023, March 7-9, 2023, Hamburg, Germany},
series = {LIPIcs},
volume = {254},
pages = {36:1--36:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.STACS.2023.36},
doi = {10.4230/LIPICS.STACS.2023.36},
timestamp = {Fri, 03 Mar 2023 12:10:30 +0100},
biburl = {https://dblp.org/rec/conf/stacs/Henzinger0R023.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2301-01744,
author = {Monika Henzinger and
Stefan Neumann and
Harald R{\"{a}}cke and
Stefan Schmid},
title = {Dynamic Maintenance of Monotone Dynamic Programs and Applications},
journal = {CoRR},
volume = {abs/2301.01744},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2301.01744},
doi = {10.48550/ARXIV.2301.01744},
eprinttype = {arXiv},
eprint = {2301.01744},
timestamp = {Mon, 01 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2301-01744.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2301-05751,
author = {Kathrin Hanauer and
Monika Henzinger and
Lara Ost and
Stefan Schmid},
title = {Dynamic Demand-Aware Link Scheduling for Reconfigurable Datacenters},
journal = {CoRR},
volume = {abs/2301.05751},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2301.05751},
doi = {10.48550/ARXIV.2301.05751},
eprinttype = {arXiv},
eprint = {2301.05751},
timestamp = {Thu, 19 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2301-05751.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2301-09217,
author = {Da Wei Zheng and
Monika Henzinger},
title = {Multiplicative Auction Algorithm for Approximate Maximum Weight Bipartite
Matching},
journal = {CoRR},
volume = {abs/2301.09217},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2301.09217},
doi = {10.48550/ARXIV.2301.09217},
eprinttype = {arXiv},
eprint = {2301.09217},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2301-09217.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2302-05951,
author = {Gramoz Goranci and
Monika Henzinger and
Danupon Nanongkai and
Thatchaphol Saranurak and
Mikkel Thorup and
Christian Wulff{-}Nilsen},
title = {Fully Dynamic Exact Edge Connectivity in Sublinear Time},
journal = {CoRR},
volume = {abs/2302.05951},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2302.05951},
doi = {10.48550/ARXIV.2302.05951},
eprinttype = {arXiv},
eprint = {2302.05951},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2302-05951.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2302-11341,
author = {Monika Henzinger and
A. R. Sricharan and
Teresa Anna Steiner},
title = {Differentially Private Data Structures under Continual Observation
for Histograms and Related Queries},
journal = {CoRR},
volume = {abs/2302.11341},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2302.11341},
doi = {10.48550/ARXIV.2302.11341},
eprinttype = {arXiv},
eprint = {2302.11341},
timestamp = {Fri, 24 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2302-11341.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2302-11988,
author = {Antoine El{-}Hayek and
Monika Henzinger and
Stefan Schmid},
title = {Time Complexity of Broadcast and Consensus for Randomized Oblivious
Message Adversaries},
journal = {CoRR},
volume = {abs/2302.11988},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2302.11988},
doi = {10.48550/ARXIV.2302.11988},
eprinttype = {arXiv},
eprint = {2302.11988},
timestamp = {Tue, 28 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2302-11988.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2303-02491,
author = {Gramoz Goranci and
Monika Henzinger and
Harald R{\"{a}}cke and
Sushant Sachdeva and
A. R. Sricharan},
title = {Electrical Flows for Polylogarithmic Competitive Oblivious Routing},
journal = {CoRR},
volume = {abs/2303.02491},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2303.02491},
doi = {10.48550/ARXIV.2303.02491},
eprinttype = {arXiv},
eprint = {2303.02491},
timestamp = {Tue, 14 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2303-02491.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2303-11843,
author = {MohammadHossein Bateni and
Hossein Esfandiari and
Hendrik Fichtenberger and
Monika Henzinger and
Rajesh Jayaram and
Vahab Mirrokni and
Andreas Wiese},
title = {Optimal Fully Dynamic k-Center Clustering for Adaptive and Oblivious
Adversaries},
journal = {CoRR},
volume = {abs/2303.11843},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2303.11843},
doi = {10.48550/ARXIV.2303.11843},
eprinttype = {arXiv},
eprint = {2303.11843},
timestamp = {Wed, 22 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2303-11843.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2305-00122,
author = {Monika Henzinger and
Paul Liu and
Jan Vondr{\'{a}}k and
Da Wei Zheng},
title = {Faster Submodular Maximization for Several Classes of Matroids},
journal = {CoRR},
volume = {abs/2305.00122},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2305.00122},
doi = {10.48550/ARXIV.2305.00122},
eprinttype = {arXiv},
eprint = {2305.00122},
timestamp = {Tue, 19 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2305-00122.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2306-10428,
author = {Monika Henzinger and
A. R. Sricharan and
Teresa Anna Steiner},
title = {Differentially Private Histogram, Predecessor, and Set Cardinality
under Continual Observation},
journal = {CoRR},
volume = {abs/2306.10428},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2306.10428},
doi = {10.48550/ARXIV.2306.10428},
eprinttype = {arXiv},
eprint = {2306.10428},
timestamp = {Thu, 22 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2306-10428.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2307-03430,
author = {Max Dupr{\'{e}} la Tour and
Monika Henzinger and
David Saulpic},
title = {Differential Privacy for Clustering Under Continual Observation},
journal = {CoRR},
volume = {abs/2307.03430},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2307.03430},
doi = {10.48550/ARXIV.2307.03430},
eprinttype = {arXiv},
eprint = {2307.03430},
timestamp = {Mon, 10 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2307-03430.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2307-08970,
author = {Monika Henzinger and
Jalaj Upadhyay and
Sarvagya Upadhyay},
title = {A Unifying Framework for Differentially Private Sums under Continual
Observation},
journal = {CoRR},
volume = {abs/2307.08970},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2307.08970},
doi = {10.48550/ARXIV.2307.08970},
eprinttype = {arXiv},
eprint = {2307.08970},
timestamp = {Tue, 25 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2307-08970.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2307-16771,
author = {Monika Henzinger and
Andrea Lincoln and
Barna Saha and
Martin P. Seybold and
Christopher Ye},
title = {On the Complexity of Algorithms with Predictions for Dynamic Graph
Problems},
journal = {CoRR},
volume = {abs/2307.16771},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2307.16771},
doi = {10.48550/ARXIV.2307.16771},
eprinttype = {arXiv},
eprint = {2307.16771},
timestamp = {Wed, 02 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2307-16771.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2310-01149,
author = {Antoine El{-}Hayek and
Kathrin Hanauer and
Monika Henzinger},
title = {On b-Matching and Fully-Dynamic Maximum k-Edge Coloring},
journal = {CoRR},
volume = {abs/2310.01149},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2310.01149},
doi = {10.48550/ARXIV.2310.01149},
eprinttype = {arXiv},
eprint = {2310.01149},
timestamp = {Wed, 18 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2310-01149.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2310-16752,
author = {Moses Charikar and
Monika Henzinger and
Lunjia Hu and
Maximilian V{\"{o}}tsch and
Erik Waingarten},
title = {Simple, Scalable and Effective Clustering via One-Dimensional Projections},
journal = {CoRR},
volume = {abs/2310.16752},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2310.16752},
doi = {10.48550/ARXIV.2310.16752},
eprinttype = {arXiv},
eprint = {2310.16752},
timestamp = {Tue, 31 Oct 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2310-16752.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2310-18034,
author = {Monika Henzinger and
David Saulpic and
Leonhard Sidl},
title = {Experimental Evaluation of Fully Dynamic k-Means via Coresets},
journal = {CoRR},
volume = {abs/2310.18034},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2310.18034},
doi = {10.48550/ARXIV.2310.18034},
eprinttype = {arXiv},
eprint = {2310.18034},
timestamp = {Thu, 02 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2310-18034.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2311-01115,
author = {Sebastiano Cultrera di Montesano and
Herbert Edelsbrunner and
Monika Henzinger and
Lara Ost},
title = {Dynamically Maintaining the Persistent Homology of Time Series},
journal = {CoRR},
volume = {abs/2311.01115},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2311.01115},
doi = {10.48550/ARXIV.2311.01115},
eprinttype = {arXiv},
eprint = {2311.01115},
timestamp = {Tue, 07 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2311-01115.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/HanauerHS22,
author = {Kathrin Hanauer and
Monika Henzinger and
Christian Schulz},
title = {Recent Advances in Fully Dynamic Graph Algorithms - {A} Quick Reference
Guide},
journal = {{ACM} J. Exp. Algorithmics},
volume = {27},
pages = {1.11:1--1.11:45},
year = {2022},
url = {https://doi.org/10.1145/3555806},
doi = {10.1145/3555806},
timestamp = {Sun, 15 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jea/HanauerHS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/HenzingerP22,
author = {Monika Henzinger and
Pan Peng},
title = {Constant-time Dynamic ({\(\Delta\)} +1)-Coloring},
journal = {{ACM} Trans. Algorithms},
volume = {18},
number = {2},
pages = {16:1--16:21},
year = {2022},
url = {https://doi.org/10.1145/3501403},
doi = {10.1145/3501403},
timestamp = {Thu, 28 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/talg/HenzingerP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/HenzingerN022,
author = {Monika Henzinger and
Alexander Noe and
Christian Schulz},
editor = {Cynthia A. Phillips and
Bettina Speckmann},
title = {Practical Fully Dynamic Minimum Cut Algorithms},
booktitle = {Proceedings of the Symposium on Algorithm Engineering and Experiments,
{ALENEX} 2022, Alexandria, VA, USA, January 9-10, 2022},
pages = {13--26},
publisher = {{SIAM}},
year = {2022},
url = {https://doi.org/10.1137/1.9781611977042.2},
doi = {10.1137/1.9781611977042.2},
timestamp = {Mon, 11 Apr 2022 13:24:23 +0200},
biburl = {https://dblp.org/rec/conf/alenex/HenzingerN022.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/birthday/Henzinger22,
author = {Monika Henzinger},
editor = {Jean{-}Fran{\c{c}}ois Raskin and
Krishnendu Chatterjee and
Laurent Doyen and
Rupak Majumdar},
title = {Fine-Grained Complexity Lower Bounds for Problems in Computer Aided
Verification},
booktitle = {Principles of Systems Design - Essays Dedicated to Thomas A. Henzinger
on the Occasion of His 60th Birthday},
series = {Lecture Notes in Computer Science},
volume = {13660},
pages = {292--305},
publisher = {Springer},
year = {2022},
url = {https://doi.org/10.1007/978-3-031-22337-2\_14},
doi = {10.1007/978-3-031-22337-2\_14},
timestamp = {Fri, 06 Jan 2023 08:06:45 +0100},
biburl = {https://dblp.org/rec/conf/birthday/Henzinger22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/HenzingerPS22,
author = {Monika Henzinger and
Ami Paz and
A. R. Sricharan},
editor = {Shiri Chechik and
Gonzalo Navarro and
Eva Rotenberg and
Grzegorz Herman},
title = {Fine-Grained Complexity Lower Bounds for Families of Dynamic Graphs},
booktitle = {30th Annual European Symposium on Algorithms, {ESA} 2022, September
5-9, 2022, Berlin/Potsdam, Germany},
series = {LIPIcs},
volume = {244},
pages = {65:1--65:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.ESA.2022.65},
doi = {10.4230/LIPICS.ESA.2022.65},
timestamp = {Wed, 28 Feb 2024 00:16:41 +0100},
biburl = {https://dblp.org/rec/conf/esa/HenzingerPS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/forc/HenzingerPRS22,
author = {Monika Henzinger and
Charlotte Peale and
Omer Reingold and
Judy Hanwen Shen},
editor = {L. Elisa Celis},
title = {Leximax Approximations and Representative Cohort Selection},
booktitle = {3rd Symposium on Foundations of Responsible Computing, {FORC} 2022,
June 6-8, 2022, Cambridge, MA, {USA}},
series = {LIPIcs},
volume = {218},
pages = {2:1--2:22},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.FORC.2022.2},
doi = {10.4230/LIPICS.FORC.2022.2},
timestamp = {Fri, 15 Jul 2022 13:35:01 +0200},
biburl = {https://dblp.org/rec/conf/forc/HenzingerPRS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/infocom/HanauerHST22,
author = {Kathrin Hanauer and
Monika Henzinger and
Stefan Schmid and
Jonathan Trummer},
title = {Fast and Heavy Disjoint Weighted Matchings for Demand-Aware Datacenter
Topologies},
booktitle = {{IEEE} {INFOCOM} 2022 - {IEEE} Conference on Computer Communications,
London, United Kingdom, May 2-5, 2022},
pages = {1649--1658},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/INFOCOM48880.2022.9796921},
doi = {10.1109/INFOCOM48880.2022.9796921},
timestamp = {Tue, 28 Jun 2022 08:49:13 +0200},
biburl = {https://dblp.org/rec/conf/infocom/HanauerHST22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Henzinger22,
author = {Monika Henzinger},
editor = {Stefan Szeider and
Robert Ganian and
Alexandra Silva},
title = {Modern Dynamic Data Structures (Invited Talk)},
booktitle = {47th International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2022, August 22-26, 2022, Vienna, Austria},
series = {LIPIcs},
volume = {241},
pages = {2:1--2:2},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2022.2},
doi = {10.4230/LIPICS.MFCS.2022.2},
timestamp = {Mon, 26 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/Henzinger22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/El-HayekH022,
author = {Antoine El{-}Hayek and
Monika Henzinger and
Stefan Schmid},
editor = {Alessia Milani and
Philipp Woelfel},
title = {Brief Announcement: Broadcasting Time in Dynamic Rooted Trees is Linear},
booktitle = {{PODC} '22: {ACM} Symposium on Principles of Distributed Computing,
Salerno, Italy, July 25 - 29, 2022},
pages = {54--56},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519270.3538460},
doi = {10.1145/3519270.3538460},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/podc/El-HayekH022.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sand/HanauerH022,
author = {Kathrin Hanauer and
Monika Henzinger and
Christian Schulz},
editor = {James Aspnes and
Othon Michail},
title = {Recent Advances in Fully Dynamic Graph Algorithms (Invited Talk)},
booktitle = {1st Symposium on Algorithmic Foundations of Dynamic Networks, {SAND}
2022, March 28-30, 2022, Virtual Conference},
series = {LIPIcs},
volume = {221},
pages = {1:1--1:47},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.SAND.2022.1},
doi = {10.4230/LIPICS.SAND.2022.1},
timestamp = {Fri, 29 Apr 2022 14:01:39 +0200},
biburl = {https://dblp.org/rec/conf/sand/HanauerH022.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sand/HanauerHH22,
author = {Kathrin Hanauer and
Monika Henzinger and
Qi Cheng Hua},
editor = {James Aspnes and
Othon Michail},
title = {Fully Dynamic Four-Vertex Subgraph Counting},
booktitle = {1st Symposium on Algorithmic Foundations of Dynamic Networks, {SAND}
2022, March 28-30, 2022, Virtual Conference},
series = {LIPIcs},
volume = {221},
pages = {18:1--18:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.SAND.2022.18},
doi = {10.4230/LIPICS.SAND.2022.18},
timestamp = {Fri, 29 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sand/HanauerHH22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/HenzingerLS22,
author = {Monika Henzinger and
Andrea Lincoln and
Barna Saha},
editor = {Joseph (Seffi) Naor and
Niv Buchbinder},
title = {The Complexity of Average-Case Dynamic Subgraph Counting},
booktitle = {Proceedings of the 2022 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2022, Virtual Conference / Alexandria, VA, USA, January 9 -
12, 2022},
pages = {459--498},
publisher = {{SIAM}},
year = {2022},
url = {https://doi.org/10.1137/1.9781611977073.23},
doi = {10.1137/1.9781611977073.23},
timestamp = {Tue, 12 Apr 2022 11:24:56 +0200},
biburl = {https://dblp.org/rec/conf/soda/HenzingerLS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosr/HenzingerPP022,
author = {Monika Henzinger and
Ami Paz and
Arash Pourdamghani and
Stefan Schmid},
title = {The augmentation-speed tradeoff for consistent network updates},
booktitle = {{SOSR} '22: The {ACM} {SIGCOMM} Symposium on {SDN} Research, Virtual
Event, October 19 - 20, 2022},
pages = {67--80},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3563647.3563655},
doi = {10.1145/3563647.3563655},
timestamp = {Mon, 10 Oct 2022 17:04:19 +0200},
biburl = {https://dblp.org/rec/conf/sosr/HenzingerPP022.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@misc{DBLP:data/10/HanauerHST22,
author = {Kathrin Hanauer and
Monika Henzinger and
Stefan Schmid and
Jonathan Trummer},
title = {DJ-Match/DJ-Match: Version 1.0.0 (Version v1.0.0)},
publisher = {Zenodo},
year = {2022},
month = jan,
howpublished = {\url{https://doi.org/10.5281/zenodo.5851268}},
note = {Accessed on YYYY-MM-DD.},
url = {https://doi.org/10.5281/zenodo.5851268},
doi = {10.5281/ZENODO.5851268},
timestamp = {Thu, 13 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/data/10/HanauerHST22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2201-06621,
author = {Kathrin Hanauer and
Monika Henzinger and
Stefan Schmid and
Jonathan Trummer},
title = {Fast and Heavy Disjoint Weighted Matchings for Demand-Aware Datacenter
Topologies},
journal = {CoRR},
volume = {abs/2201.06621},
year = {2022},
url = {https://arxiv.org/abs/2201.06621},
eprinttype = {arXiv},
eprint = {2201.06621},
timestamp = {Fri, 21 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2201-06621.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2202-11205,
author = {Monika Henzinger and
Jalaj Upadhyay},
title = {Constant matters: Fine-grained Complexity of Differentially Private
Continual Observation Using Completely Bounded Norms},
journal = {CoRR},
volume = {abs/2202.11205},
year = {2022},
url = {https://arxiv.org/abs/2202.11205},
eprinttype = {arXiv},
eprint = {2202.11205},
timestamp = {Wed, 02 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2202-11205.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2205-01157,
author = {Monika Henzinger and
Charlotte Peale and
Omer Reingold and
Judy Hanwen Shen},
title = {Leximax Approximations and Representative Cohort Selection},
journal = {CoRR},
volume = {abs/2205.01157},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2205.01157},
doi = {10.48550/ARXIV.2205.01157},
eprinttype = {arXiv},
eprint = {2205.01157},
timestamp = {Mon, 23 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2205-01157.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2208-07572,
author = {Monika Henzinger and
Ami Paz and
A. R. Sricharan},
title = {Fine-Grained Complexity Lower Bounds for Families of Dynamic Graphs},
journal = {CoRR},
volume = {abs/2208.07572},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2208.07572},
doi = {10.48550/ARXIV.2208.07572},
eprinttype = {arXiv},
eprint = {2208.07572},
timestamp = {Mon, 22 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2208-07572.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2211-03716,
author = {Monika Henzinger and
Ami Paz and
Arash Pourdamghani and
Stefan Schmid},
title = {The Augmentation-Speed Tradeoff for Consistent Network Updates},
journal = {CoRR},
volume = {abs/2211.03716},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2211.03716},
doi = {10.48550/ARXIV.2211.03716},
eprinttype = {arXiv},
eprint = {2211.03716},
timestamp = {Wed, 09 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2211-03716.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2211-05006,
author = {Monika Henzinger and
Jalaj Upadhyay and
Sarvagya Upadhyay},
title = {Almost Tight Error Bounds on Differentially Private Continual Counting},
journal = {CoRR},
volume = {abs/2211.05006},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2211.05006},
doi = {10.48550/ARXIV.2211.05006},
eprinttype = {arXiv},
eprint = {2211.05006},
timestamp = {Tue, 15 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2211-05006.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2211-09606,
author = {Gramoz Goranci and
Monika Henzinger},
title = {Incremental Approximate Maximum Flow in m\({}^{\mbox{1/2+o(1)}}\)
update time},
journal = {CoRR},
volume = {abs/2211.09606},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2211.09606},
doi = {10.48550/ARXIV.2211.09606},
eprinttype = {arXiv},
eprint = {2211.09606},
timestamp = {Wed, 23 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2211-09606.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2211-10151,
author = {Antoine El{-}Hayek and
Monika Henzinger and
Stefan Schmid},
title = {Asymptotically Tight Bounds on the Time Complexity of Broadcast and
its Variants in Dynamic Networks},
journal = {CoRR},
volume = {abs/2211.10151},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2211.10151},
doi = {10.48550/ARXIV.2211.10151},
eprinttype = {arXiv},
eprint = {2211.10151},
timestamp = {Thu, 24 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2211-10151.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2211-11352,
author = {Antoine El{-}Hayek and
Monika Henzinger and
Stefan Schmid},
title = {Brief Announcement: Broadcasting Time in Dynamic Rooted Trees is Linear},
journal = {CoRR},
volume = {abs/2211.11352},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2211.11352},
doi = {10.48550/ARXIV.2211.11352},
eprinttype = {arXiv},
eprint = {2211.11352},
timestamp = {Thu, 24 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2211-11352.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2212-03016,
author = {Ashish Chiplunkar and
Monika Henzinger and
Sagar Sudhir Kale and
Maximilian V{\"{o}}tsch},
title = {Online Min-Max Paging},
journal = {CoRR},
volume = {abs/2212.03016},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2212.03016},
doi = {10.48550/ARXIV.2212.03016},
eprinttype = {arXiv},
eprint = {2212.03016},
timestamp = {Thu, 08 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2212-03016.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/HenzingerU22,
author = {Monika Henzinger and
Jalaj Upadhyay},
title = {Constant matters: Fine-grained Complexity of Differentially Private
Continual Observation Using Completely Bounded Norms},
journal = {{IACR} Cryptol. ePrint Arch.},
pages = {225},
year = {2022},
url = {https://eprint.iacr.org/2022/225},
timestamp = {Tue, 22 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iacr/HenzingerU22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ai/ChatterjeeDHS21,
author = {Krishnendu Chatterjee and
Wolfgang Dvor{\'{a}}k and
Monika Henzinger and
Alexander Svozil},
title = {Algorithms and conditional lower bounds for planning problems},
journal = {Artif. Intell.},
volume = {297},
pages = {103499},
year = {2021},
url = {https://doi.org/10.1016/j.artint.2021.103499},
doi = {10.1016/J.ARTINT.2021.103499},
timestamp = {Tue, 15 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ai/ChatterjeeDHS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/HenzingerP21,
author = {Monika Henzinger and
Pan Peng},
title = {Constant-time dynamic weight approximation for minimum spanning forest},
journal = {Inf. Comput.},
volume = {281},
pages = {104805},
year = {2021},
url = {https://doi.org/10.1016/j.ic.2021.104805},
doi = {10.1016/J.IC.2021.104805},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/HenzingerP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/HenzingerKN21,
author = {Monika Henzinger and
Sebastian Krinninger and
Danupon Nanongkai},
title = {A Deterministic Almost-Tight Distributed Algorithm for Approximating
Single-Source Shortest Paths},
journal = {{SIAM} J. Comput.},
volume = {50},
number = {3},
year = {2021},
url = {https://doi.org/10.1137/16M1097808},
doi = {10.1137/16M1097808},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/HenzingerKN21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BernsteinFH21,
author = {Aaron Bernstein and
Sebastian Forster and
Monika Henzinger},
title = {A Deamortization Approach for Dynamic Spanner and Dynamic Maximal
Matching},
journal = {{ACM} Trans. Algorithms},
volume = {17},
number = {4},
pages = {29:1--29:51},
year = {2021},
url = {https://doi.org/10.1145/3469833},
doi = {10.1145/3469833},
timestamp = {Wed, 15 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/BernsteinFH21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/acda/HenzingerN021,
author = {Monika Henzinger and
Alexander Noe and
Christian Schulz},
editor = {Michael Bender and
John Gilbert and
Bruce Hendrickson and
Blair D. Sullivan},
title = {Faster Parallel Multiterminal Cuts},
booktitle = {Proceedings of the 2021 {SIAM} Conference on Applied and Computational
Discrete Algorithms, {ACDA} 2021, Virtual Conference, July 19-21,
2021},
pages = {100--110},
publisher = {{SIAM}},
year = {2021},
url = {https://doi.org/10.1137/1.9781611976830.10},
doi = {10.1137/1.9781611976830.10},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/acda/HenzingerN021.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/GoranciHLSS21,
author = {Gramoz Goranci and
Monika Henzinger and
Dariusz Leniowski and
Christian Schulz and
Alexander Svozil},
editor = {Martin Farach{-}Colton and
Sabine Storandt},
title = {Fully Dynamic \emph{k}-Center Clustering in Low Dimensional Metrics},
booktitle = {Proceedings of the Symposium on Algorithm Engineering and Experiments,
{ALENEX} 2021, Virtual Conference, January 10-11, 2021},
pages = {143--153},
publisher = {{SIAM}},
year = {2021},
url = {https://doi.org/10.1137/1.9781611976472.11},
doi = {10.1137/1.9781611976472.11},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/alenex/GoranciHLSS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/FichtenbergerHO21,
author = {Hendrik Fichtenberger and
Monika Henzinger and
Lara Ost},
editor = {Petra Mutzel and
Rasmus Pagh and
Grzegorz Herman},
title = {Differentially Private Algorithms for Graphs Under Continual Observation},
booktitle = {29th Annual European Symposium on Algorithms, {ESA} 2021, September
6-8, 2021, Lisbon, Portugal (Virtual Conference)},
series = {LIPIcs},
volume = {204},
pages = {42:1--42:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ESA.2021.42},
doi = {10.4230/LIPICS.ESA.2021.42},
timestamp = {Fri, 22 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/esa/FichtenbergerHO21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/ChatterjeeHKS21,
author = {Krishnendu Chatterjee and
Monika Henzinger and
Sagar Kale and
Alexander Svozil},
editor = {Nikhil Bansal and
Emanuela Merelli and
James Worrell},
title = {Faster Algorithms for Bounded Liveness in Graphs and Game Graphs},
booktitle = {48th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2021, July 12-16, 2021, Glasgow, Scotland (Virtual Conference)},
series = {LIPIcs},
volume = {198},
pages = {124:1--124:21},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2021.124},
doi = {10.4230/LIPICS.ICALP.2021.124},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/ChatterjeeHKS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lics/ChatterjeeDHS21,
author = {Krishnendu Chatterjee and
Wolfgang Dvor{\'{a}}k and
Monika Henzinger and
Alexander Svozil},
title = {Symbolic Time and Space Tradeoffs for Probabilistic Verification},
booktitle = {36th Annual {ACM/IEEE} Symposium on Logic in Computer Science, {LICS}
2021, Rome, Italy, June 29 - July 2, 2021},
pages = {1--13},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/LICS52264.2021.9470739},
doi = {10.1109/LICS52264.2021.9470739},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/lics/ChatterjeeDHS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/networking/HenzingerP021,
author = {Monika Henzinger and
Ami Paz and
Stefan Schmid},
editor = {Zheng Yan and
Gareth Tyson and
Dimitrios Koutsonikolas},
title = {On the Complexity of Weight-Dynamic Network Algorithms},
booktitle = {{IFIP} Networking Conference, {IFIP} Networking 2021, Espoo and Helsinki,
Finland, June 21-24, 2021},
pages = {1--9},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.23919/IFIPNetworking52078.2021.9472803},
doi = {10.23919/IFIPNETWORKING52078.2021.9472803},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/networking/HenzingerP021.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ForsterGH21,
author = {Sebastian Forster and
Gramoz Goranci and
Monika Henzinger},
editor = {D{\'{a}}niel Marx},
title = {Dynamic Maintenance of Low-Stretch Probabilistic Tree Embeddings with
Applications},
booktitle = {Proceedings of the 2021 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2021, Virtual Conference, January 10 - 13, 2021},
pages = {1226--1245},
publisher = {{SIAM}},
year = {2021},
url = {https://doi.org/10.1137/1.9781611976465.75},
doi = {10.1137/1.9781611976465.75},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/ForsterGH21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BergamaschiHGWW21,
author = {Thiago Bergamaschi and
Monika Henzinger and
Maximilian Probst Gutenberg and
Virginia Vassilevska Williams and
Nicole Wein},
editor = {D{\'{a}}niel Marx},
title = {New Techniques and Fine-Grained Hardness for Dynamic Near-Additive
Spanners},
booktitle = {Proceedings of the 2021 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2021, Virtual Conference, January 10 - 13, 2021},
pages = {1836--1855},
publisher = {{SIAM}},
year = {2021},
url = {https://doi.org/10.1137/1.9781611976465.110},
doi = {10.1137/1.9781611976465.110},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/BergamaschiHGWW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BhattacharyaHNW21,
author = {Sayan Bhattacharya and
Monika Henzinger and
Danupon Nanongkai and
Xiaowei Wu},
editor = {D{\'{a}}niel Marx},
title = {Dynamic Set Cover: Improved Amortized and Worst-Case Update Time},
booktitle = {Proceedings of the 2021 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2021, Virtual Conference, January 10 - 13, 2021},
pages = {2537--2549},
publisher = {{SIAM}},
year = {2021},
url = {https://doi.org/10.1137/1.9781611976465.150},
doi = {10.1137/1.9781611976465.150},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/BhattacharyaHNW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/HenzingerNRS21,
author = {Monika Henzinger and
Stefan Neumann and
Harald R{\"{a}}cke and
Stefan Schmid},
editor = {D{\'{a}}niel Marx},
title = {Tight Bounds for Online Graph Partitioning},
booktitle = {Proceedings of the 2021 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2021, Virtual Conference, January 10 - 13, 2021},
pages = {2799--2818},
publisher = {{SIAM}},
year = {2021},
url = {https://doi.org/10.1137/1.9781611976465.166},
doi = {10.1137/1.9781611976465.166},
timestamp = {Mon, 01 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/HenzingerNRS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/HenzingerW21,
author = {Monika Henzinger and
Xiaowei Wu},
editor = {Anna Lubiw and
Mohammad R. Salavatipour},
title = {Upper and Lower Bounds for Fully Retroactive Graph Problems},
booktitle = {Algorithms and Data Structures - 17th International Symposium, {WADS}
2021, Virtual Event, August 9-11, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12808},
pages = {471--484},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-83508-8\_34},
doi = {10.1007/978-3-030-83508-8\_34},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wads/HenzingerW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2101-05033,
author = {Monika Henzinger and
Alexander Noe and
Christian Schulz},
title = {Practical Fully Dynamic Minimum Cut Algorithms},
journal = {CoRR},
volume = {abs/2101.05033},
year = {2021},
url = {https://arxiv.org/abs/2101.05033},
eprinttype = {arXiv},
eprint = {2101.05033},
timestamp = {Fri, 22 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2101-05033.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2102-11169,
author = {Kathrin Hanauer and
Monika Henzinger and
Christian Schulz},
title = {Recent Advances in Fully Dynamic Graph Algorithms},
journal = {CoRR},
volume = {abs/2102.11169},
year = {2021},
url = {https://arxiv.org/abs/2102.11169},
eprinttype = {arXiv},
eprint = {2102.11169},
timestamp = {Wed, 24 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2102-11169.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2104-07466,
author = {Krishnendu Chatterjee and
Wolfgang Dvor{\'{a}}k and
Monika Henzinger and
Alexander Svozil},
title = {Symbolic Time and Space Tradeoffs for Probabilistic Verification},
journal = {CoRR},
volume = {abs/2104.07466},
year = {2021},
url = {https://arxiv.org/abs/2104.07466},
eprinttype = {arXiv},
eprint = {2104.07466},
timestamp = {Mon, 19 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2104-07466.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2105-13172,
author = {Monika Henzinger and
Ami Paz and
Stefan Schmid},
title = {On the Complexity of Weight-Dynamic Network Algorithms},
journal = {CoRR},
volume = {abs/2105.13172},
year = {2021},
url = {https://arxiv.org/abs/2105.13172},
eprinttype = {arXiv},
eprint = {2105.13172},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2105-13172.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2106-14756,
author = {Hendrik Fichtenberger and
Monika Henzinger and
Wolfgang Ost},
title = {Differentially Private Algorithms for Graphs Under Continual Observation},
journal = {CoRR},
volume = {abs/2106.14756},
year = {2021},
url = {https://arxiv.org/abs/2106.14756},
eprinttype = {arXiv},
eprint = {2106.14756},
timestamp = {Wed, 30 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2106-14756.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2106-15524,
author = {Kathrin Hanauer and
Monika Henzinger and
Qi Cheng Hua},
title = {Fully Dynamic Four-Vertex Subgraph Counting},
journal = {CoRR},
volume = {abs/2106.15524},
year = {2021},
url = {https://arxiv.org/abs/2106.15524},
eprinttype = {arXiv},
eprint = {2106.15524},
timestamp = {Mon, 05 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2106-15524.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2108-04564,
author = {Monika Henzinger and
Alexander Noe},
title = {Random Rank-Based, Hierarchical or Trivial: Which Dynamic Graph Algorithm
Performs Best in Practice?},
journal = {CoRR},
volume = {abs/2108.04564},
year = {2021},
url = {https://arxiv.org/abs/2108.04564},
eprinttype = {arXiv},
eprint = {2108.04564},
timestamp = {Wed, 11 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2108-04564.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2109-00653,
author = {Monika Henzinger and
Billy Jin and
Richard Peng and
David P. Williamson},
title = {Cut-Toggling and Cycle-Toggling for Electrical Flow and Other p-Norm
Flows},
journal = {CoRR},
volume = {abs/2109.00653},
year = {2021},
url = {https://arxiv.org/abs/2109.00653},
eprinttype = {arXiv},
eprint = {2109.00653},
timestamp = {Mon, 20 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2109-00653.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2112-07217,
author = {Hendrik Fichtenberger and
Monika Henzinger and
Andreas Wiese},
title = {On fully dynamic constant-factor approximation algorithms for clustering
problems},
journal = {CoRR},
volume = {abs/2112.07217},
year = {2021},
url = {https://arxiv.org/abs/2112.07217},
eprinttype = {arXiv},
eprint = {2112.07217},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2112-07217.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/HenzingerLS21,
author = {Monika Henzinger and
Andrea Lincoln and
Barna Saha},
title = {The Complexity of Average-Case Dynamic Subgraph Counting},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR21-157}},
year = {2021},
url = {https://eccc.weizmann.ac.il/report/2021/157},
eprinttype = {ECCC},
eprint = {TR21-157},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/HenzingerLS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BhattacharyaCH20,
author = {Sayan Bhattacharya and
Deeparnab Chakrabarty and
Monika Henzinger},
title = {Deterministic Dynamic Matching in {O(1)} Update Time},
journal = {Algorithmica},
volume = {82},
number = {4},
pages = {1057--1080},
year = {2020},
url = {https://doi.org/10.1007/s00453-019-00630-4},
doi = {10.1007/S00453-019-00630-4},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BhattacharyaCH20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/HenzingerLM20,
author = {Monika Henzinger and
Dariusz Leniowski and
Claire Mathieu},
title = {Dynamic Clustering to Minimize the Sum of Radii},
journal = {Algorithmica},
volume = {82},
number = {11},
pages = {3183--3194},
year = {2020},
url = {https://doi.org/10.1007/s00453-020-00721-7},
doi = {10.1007/S00453-020-00721-7},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/HenzingerLM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/HenzingerRW20,
author = {Monika Henzinger and
Satish Rao and
Di Wang},
title = {Local Flow Partitioning for Faster Edge Connectivity},
journal = {{SIAM} J. Comput.},
volume = {49},
number = {1},
pages = {1--36},
year = {2020},
url = {https://doi.org/10.1137/18M1180335},
doi = {10.1137/18M1180335},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/HenzingerRW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/GoranciHP20,
author = {Gramoz Goranci and
Monika Henzinger and
Pan Peng},
title = {Improved Guarantees for Vertex Sparsification in Planar Graphs},
journal = {{SIAM} J. Discret. Math.},
volume = {34},
number = {1},
pages = {130--162},
year = {2020},
url = {https://doi.org/10.1137/17M1163153},
doi = {10.1137/17M1163153},
timestamp = {Fri, 22 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/GoranciHP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/HenzingerN020,
author = {Monika Henzinger and
Alexander Noe and
Christian Schulz},
editor = {Guy E. Blelloch and
Irene Finocchi},
title = {Shared-Memory Branch-and-Reduce for Multiterminal Cuts},
booktitle = {Proceedings of the Symposium on Algorithm Engineering and Experiments,
{ALENEX} 2020, Salt Lake City, UT, USA, January 5-6, 2020},
pages = {42--55},
publisher = {{SIAM}},
year = {2020},
url = {https://doi.org/10.1137/1.9781611976007.4},
doi = {10.1137/1.9781611976007.4},
timestamp = {Fri, 31 Jan 2020 14:05:23 +0100},
biburl = {https://dblp.org/rec/conf/alenex/HenzingerN020.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/HanauerH020,
author = {Kathrin Hanauer and
Monika Henzinger and
Christian Schulz},
editor = {Guy E. Blelloch and
Irene Finocchi},
title = {Fully Dynamic Single-Source Reachability in Practice: An Experimental
Study},
booktitle = {Proceedings of the Symposium on Algorithm Engineering and Experiments,
{ALENEX} 2020, Salt Lake City, UT, USA, January 5-6, 2020},
pages = {106--119},
publisher = {{SIAM}},
year = {2020},
url = {https://doi.org/10.1137/1.9781611976007.9},
doi = {10.1137/1.9781611976007.9},
timestamp = {Fri, 31 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/alenex/HanauerH020.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/Henzinger0W20,
author = {Monika Henzinger and
Stefan Neumann and
Andreas Wiese},
editor = {Sergio Cabello and
Danny Z. Chen},
title = {Dynamic Approximate Maximum Independent Set of Intervals, Hypercubes
and Hyperrectangles},
booktitle = {36th International Symposium on Computational Geometry, SoCG 2020,
June 23-26, 2020, Z{\"{u}}rich, Switzerland},
series = {LIPIcs},
volume = {164},
pages = {51:1--51:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.SoCG.2020.51},
doi = {10.4230/LIPICS.SOCG.2020.51},
timestamp = {Mon, 01 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/Henzinger0W20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/HenzingerK20,
author = {Monika Henzinger and
Sagar Kale},
editor = {Fabrizio Grandoni and
Grzegorz Herman and
Peter Sanders},
title = {Fully-Dynamic Coresets},
booktitle = {28th Annual European Symposium on Algorithms, {ESA} 2020, September
7-9, 2020, Pisa, Italy (Virtual Conference)},
series = {LIPIcs},
volume = {173},
pages = {57:1--57:21},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ESA.2020.57},
doi = {10.4230/LIPICS.ESA.2020.57},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/HenzingerK20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/Henzinger0P020,
author = {Monika Henzinger and
Shahbaz Khan and
Richard Paul and
Christian Schulz},
editor = {Fabrizio Grandoni and
Grzegorz Herman and
Peter Sanders},
title = {Dynamic Matching Algorithms in Practice},
booktitle = {28th Annual European Symposium on Algorithms, {ESA} 2020, September
7-9, 2020, Pisa, Italy (Virtual Conference)},
series = {LIPIcs},
volume = {173},
pages = {58:1--58:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ESA.2020.58},
doi = {10.4230/LIPICS.ESA.2020.58},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/Henzinger0P020.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/HenzingerN0S20,
author = {Monika Henzinger and
Alexander Noe and
Christian Schulz and
Darren Strash},
editor = {Fabrizio Grandoni and
Grzegorz Herman and
Peter Sanders},
title = {Finding All Global Minimum Cuts in Practice},
booktitle = {28th Annual European Symposium on Algorithms, {ESA} 2020, September
7-9, 2020, Pisa, Italy (Virtual Conference)},
series = {LIPIcs},
volume = {173},
pages = {59:1--59:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ESA.2020.59},
doi = {10.4230/LIPICS.ESA.2020.59},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/HenzingerN0S20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChenGHPS20,
author = {Li Chen and
Gramoz Goranci and
Monika Henzinger and
Richard Peng and
Thatchaphol Saranurak},
editor = {Sandy Irani},
title = {Fast Dynamic Cuts, Distances and Effective Resistances via Vertex
Sparsifiers},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {1135--1146},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00109},
doi = {10.1109/FOCS46700.2020.00109},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/ChenGHPS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Henzinger020,
author = {Monika Henzinger and
Pan Peng},
editor = {Christophe Paul and
Markus Bl{\"{a}}ser},
title = {Constant-Time Dynamic ({\(\Delta\)}+1)-Coloring},
booktitle = {37th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2020, March 10-13, 2020, Montpellier, France},
series = {LIPIcs},
volume = {154},
pages = {53:1--53:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.STACS.2020.53},
doi = {10.4230/LIPICS.STACS.2020.53},
timestamp = {Thu, 19 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stacs/Henzinger020.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wea/HanauerH020,
author = {Kathrin Hanauer and
Monika Henzinger and
Christian Schulz},
editor = {Simone Faro and
Domenico Cantone},
title = {Faster Fully Dynamic Transitive Closure in Practice},
booktitle = {18th International Symposium on Experimental Algorithms, {SEA} 2020,
June 16-18, 2020, Catania, Italy},
series = {LIPIcs},
volume = {160},
pages = {14:1--14:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.SEA.2020.14},
doi = {10.4230/LIPICS.SEA.2020.14},
timestamp = {Tue, 16 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wea/HanauerH020.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:series/mimb/BiedermannHSS20,
author = {Sonja Biedermann and
Monika Henzinger and
Christian Schulz and
Bernhard Schuster},
editor = {Stefan Canzar and
Francisca Rojas Ringeling},
title = {Vienna Graph Clustering},
booktitle = {Protein-Protein Interaction Networks, Methods and Protocols},
series = {Methods in Molecular Biology},
volume = {2074},
pages = {215--231},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-1-4939-9873-9\_16},
doi = {10.1007/978-1-4939-9873-9\_16},
timestamp = {Sat, 30 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/series/mimb/BiedermannHSS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2002-00813,
author = {Kathrin Hanauer and
Monika Henzinger and
Christian Schulz},
title = {Faster Fully Dynamic Transitive Closure in Practice},
journal = {CoRR},
volume = {abs/2002.00813},
year = {2020},
url = {https://arxiv.org/abs/2002.00813},
eprinttype = {arXiv},
eprint = {2002.00813},
timestamp = {Mon, 10 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2002-00813.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2002-06948,
author = {Monika Henzinger and
Alexander Noe and
Christian Schulz and
Darren Strash},
title = {Finding All Global Minimum Cuts In Practice},
journal = {CoRR},
volume = {abs/2002.06948},
year = {2020},
url = {https://arxiv.org/abs/2002.06948},
eprinttype = {arXiv},
eprint = {2002.06948},
timestamp = {Mon, 02 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2002-06948.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2002-10142,
author = {Monika Henzinger and
Stefan Neumann and
Andreas Wiese},
title = {Explicit and Implicit Dynamic Coloring of Graphs with Bounded Arboricity},
journal = {CoRR},
volume = {abs/2002.10142},
year = {2020},
url = {https://arxiv.org/abs/2002.10142},
eprinttype = {arXiv},
eprint = {2002.10142},
timestamp = {Tue, 03 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2002-10142.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2002-11171,
author = {Sayan Bhattacharya and
Monika Henzinger and
Danupon Nanongkai and
Xiaowei Wu},
title = {An Improved Algorithm for Dynamic Set Cover},
journal = {CoRR},
volume = {abs/2002.11171},
year = {2020},
url = {https://arxiv.org/abs/2002.11171},
eprinttype = {arXiv},
eprint = {2002.11171},
timestamp = {Fri, 16 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2002-11171.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2003-02605,
author = {Monika Henzinger and
Stefan Neumann and
Andreas Wiese},
title = {Dynamic Approximate Maximum Independent Set of Intervals, Hypercubes
and Hyperrectangles},
journal = {CoRR},
volume = {abs/2003.02605},
year = {2020},
url = {https://arxiv.org/abs/2003.02605},
eprinttype = {arXiv},
eprint = {2003.02605},
timestamp = {Tue, 10 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2003-02605.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2004-09099,
author = {Monika Henzinger and
Shahbaz Khan and
Richard Paul and
Christian Schulz},
title = {Dynamic Matching Algorithms in Practice},
journal = {CoRR},
volume = {abs/2004.09099},
year = {2020},
url = {https://arxiv.org/abs/2004.09099},
eprinttype = {arXiv},
eprint = {2004.09099},
timestamp = {Fri, 24 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2004-09099.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2004-10319,
author = {Sebastian Forster and
Gramoz Goranci and
Monika Henzinger},
title = {Dynamic Maintenance of Low-Stretch Probabilistic Tree Embeddings with
Applications},
journal = {CoRR},
volume = {abs/2004.10319},
year = {2020},
url = {https://arxiv.org/abs/2004.10319},
eprinttype = {arXiv},
eprint = {2004.10319},
timestamp = {Tue, 28 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2004-10319.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2004-11666,
author = {Monika Henzinger and
Alexander Noe and
Christian Schulz},
title = {Faster Parallel Multiterminal Cuts},
journal = {CoRR},
volume = {abs/2004.11666},
year = {2020},
url = {https://arxiv.org/abs/2004.11666},
eprinttype = {arXiv},
eprint = {2004.11666},
timestamp = {Tue, 28 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2004-11666.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2004-14891,
author = {Monika Henzinger and
Sagar Kale},
title = {Fully-Dynamic Coresets},
journal = {CoRR},
volume = {abs/2004.14891},
year = {2020},
url = {https://arxiv.org/abs/2004.14891},
eprinttype = {arXiv},
eprint = {2004.14891},
timestamp = {Sun, 03 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2004-14891.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2005-02368,
author = {Li Chen and
Gramoz Goranci and
Monika Henzinger and
Richard Peng and
Thatchaphol Saranurak},
title = {Fast Dynamic Cuts, Distances and Effective Resistances via Vertex
Sparsifiers},
journal = {CoRR},
volume = {abs/2005.02368},
year = {2020},
url = {https://arxiv.org/abs/2005.02368},
eprinttype = {arXiv},
eprint = {2005.02368},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2005-02368.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2010-10134,
author = {Thiago Bergamaschi and
Monika Henzinger and
Maximilian Probst Gutenberg and
Virginia Vassilevska Williams and
Nicole Wein},
title = {New Techniques and Fine-Grained Hardness for Dynamic Near-Additive
Spanners},
journal = {CoRR},
volume = {abs/2010.10134},
year = {2020},
url = {https://arxiv.org/abs/2010.10134},
eprinttype = {arXiv},
eprint = {2010.10134},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2010-10134.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2010-16316,
author = {Monika Henzinger and
Billy Jin and
David P. Williamson},
title = {A Combinatorial Cut-Based Algorithm for Solving Laplacian Linear Systems},
journal = {CoRR},
volume = {abs/2010.16316},
year = {2020},
url = {https://arxiv.org/abs/2010.16316},
eprinttype = {arXiv},
eprint = {2010.16316},
timestamp = {Tue, 03 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2010-16316.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2011-00977,
author = {Monika Henzinger and
Pan Peng},
title = {Constant-Time Dynamic Weight Approximation for Minimum Spanning Forest},
journal = {CoRR},
volume = {abs/2011.00977},
year = {2020},
url = {https://arxiv.org/abs/2011.00977},
eprinttype = {arXiv},
eprint = {2011.00977},
timestamp = {Fri, 06 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2011-00977.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2011-01017,
author = {Monika Henzinger and
Stefan Neumann and
Harald R{\"{a}}cke and
Stefan Schmid},
title = {Tight Bounds for Online Graph Partitioning},
journal = {CoRR},
volume = {abs/2011.01017},
year = {2020},
url = {https://arxiv.org/abs/2011.01017},
eprinttype = {arXiv},
eprint = {2011.01017},
timestamp = {Fri, 06 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2011-01017.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/pomacs/Henzinger0019,
author = {Monika Henzinger and
Stefan Neumann and
Stefan Schmid},
title = {Efficient Distributed Workload (Re-)Embedding},
journal = {Proc. {ACM} Meas. Anal. Comput. Syst.},
volume = {3},
number = {1},
pages = {13:1--13:38},
year = {2019},
url = {https://doi.org/10.1145/3322205.3311084},
doi = {10.1145/3322205.3311084},
timestamp = {Mon, 01 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/pomacs/Henzinger0019.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BhattacharyaHN19,
author = {Sayan Bhattacharya and
Monika Henzinger and
Stefan Neumann},
title = {New amortized cell-probe lower bounds for dynamic problems},
journal = {Theor. Comput. Sci.},
volume = {779},
pages = {72--87},
year = {2019},
url = {https://doi.org/10.1016/j.tcs.2019.01.043},
doi = {10.1016/J.TCS.2019.01.043},
timestamp = {Mon, 01 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/BhattacharyaHN19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/ChatterjeeDHS19,
author = {Krishnendu Chatterjee and
Wolfgang Dvor{\'{a}}k and
Monika Henzinger and
Alexander Svozil},
editor = {Wan J. Fokkink and
Rob van Glabbeek},
title = {Near-Linear Time Algorithms for Streett Objectives in Graphs and MDPs},
booktitle = {30th International Conference on Concurrency Theory, {CONCUR} 2019,
August 27-30, 2019, Amsterdam, the Netherlands},
series = {LIPIcs},
volume = {140},
pages = {7:1--7:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.CONCUR.2019.7},
doi = {10.4230/LIPICS.CONCUR.2019.7},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/concur/ChatterjeeDHS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BhattacharyaHN19,
author = {Sayan Bhattacharya and
Monika Henzinger and
Danupon Nanongkai},
editor = {David Zuckerman},
title = {A New Deterministic Algorithm for Dynamic Set Cover},
booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2019, Baltimore, Maryland, USA, November 9-12, 2019},
pages = {406--423},
publisher = {{IEEE} Computer Society},
year = {2019},
url = {https://doi.org/10.1109/FOCS.2019.00033},
doi = {10.1109/FOCS.2019.00033},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BhattacharyaHN19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/AnconaHRWW19,
author = {Bertie Ancona and
Monika Henzinger and
Liam Roditty and
Virginia Vassilevska Williams and
Nicole Wein},
editor = {Christel Baier and
Ioannis Chatzigiannakis and
Paola Flocchini and
Stefano Leonardi},
title = {Algorithms and Hardness for Diameter in Dynamic Graphs},
booktitle = {46th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2019, July 9-12, 2019, Patras, Greece},
series = {LIPIcs},
volume = {132},
pages = {13:1--13:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2019.13},
doi = {10.4230/LIPICS.ICALP.2019.13},
timestamp = {Tue, 27 Dec 2022 09:06:31 +0100},
biburl = {https://dblp.org/rec/conf/icalp/AnconaHRWW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipps/HenzingerN019,
author = {Monika Henzinger and
Alexander Noe and
Christian Schulz},
title = {Shared-Memory Exact Minimum Cuts},
booktitle = {2019 {IEEE} International Parallel and Distributed Processing Symposium,
{IPDPS} 2019, Rio de Janeiro, Brazil, May 20-24, 2019},
pages = {13--22},
publisher = {{IEEE}},
year = {2019},
url = {https://doi.org/10.1109/IPDPS.2019.00013},
doi = {10.1109/IPDPS.2019.00013},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ipps/HenzingerN019.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sigmetrics/Henzinger0019,
author = {Monika Henzinger and
Stefan Neumann and
Stefan Schmid},
editor = {Erich M. Nahum and
Thomas Bonald and
Nick Duffield},
title = {Efficient Distributed Workload (Re-)Embedding},
booktitle = {Abstracts of the 2019 SIGMETRICS/Performance Joint International Conference
on Measurement and Modeling of Computer Systems, Phoenix, AZ, USA,
June 24-28, 2019},
pages = {43--44},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3309697.3331503},
doi = {10.1145/3309697.3331503},
timestamp = {Mon, 01 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sigmetrics/Henzinger0019.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BernsteinFH19,
author = {Aaron Bernstein and
Sebastian Forster and
Monika Henzinger},
editor = {Timothy M. Chan},
title = {A Deamortization Approach for Dynamic Spanner and Dynamic Maximal
Matching},
booktitle = {Proceedings of the Thirtieth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2019, San Diego, California, USA, January 6-9,
2019},
pages = {1899--1918},
publisher = {{SIAM}},
year = {2019},
url = {https://doi.org/10.1137/1.9781611975482.115},
doi = {10.1137/1.9781611975482.115},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/BernsteinFH19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/DagaHNS19,
author = {Mohit Daga and
Monika Henzinger and
Danupon Nanongkai and
Thatchaphol Saranurak},
editor = {Moses Charikar and
Edith Cohen},
title = {Distributed edge connectivity in sublinear time},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {343--354},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316346},
doi = {10.1145/3313276.3316346},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/DagaHNS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1902-02304,
author = {Sayan Bhattacharya and
Monika Henzinger and
Stefan Neumann},
title = {New Amortized Cell-Probe Lower Bounds for Dynamic Problems},
journal = {CoRR},
volume = {abs/1902.02304},
year = {2019},
url = {http://arxiv.org/abs/1902.02304},
eprinttype = {arXiv},
eprint = {1902.02304},
timestamp = {Tue, 21 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1902-02304.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1904-04341,
author = {Mohit Daga and
Monika Henzinger and
Danupon Nanongkai and
Thatchaphol Saranurak},
title = {Distributed Edge Connectivity in Sublinear Time},
journal = {CoRR},
volume = {abs/1904.04341},
year = {2019},
url = {http://arxiv.org/abs/1904.04341},
eprinttype = {arXiv},
eprint = {1904.04341},
timestamp = {Thu, 25 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1904-04341.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1904-05474,
author = {Monika Henzinger and
Stefan Neumann and
Stefan Schmid},
title = {Efficient Distributed Workload (Re-)Embedding},
journal = {CoRR},
volume = {abs/1904.05474},
year = {2019},
url = {http://arxiv.org/abs/1904.05474},
eprinttype = {arXiv},
eprint = {1904.05474},
timestamp = {Thu, 25 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1904-05474.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1905-01216,
author = {Kathrin Hanauer and
Monika Henzinger and
Christian Schulz},
title = {Fully Dynamic Single-Source Reachability in Practice: An Experimental
Study},
journal = {CoRR},
volume = {abs/1905.01216},
year = {2019},
url = {http://arxiv.org/abs/1905.01216},
eprinttype = {arXiv},
eprint = {1905.01216},
timestamp = {Mon, 27 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1905-01216.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1907-04745,
author = {Monika Henzinger and
Pan Peng},
title = {Constant-Time Dynamic ({\(\Delta\)}+1)-Coloring and Weight Approximation
for Minimum Spanning Forest: Dynamic Algorithms Meet Property Testing},
journal = {CoRR},
volume = {abs/1907.04745},
year = {2019},
url = {http://arxiv.org/abs/1907.04745},
eprinttype = {arXiv},
eprint = {1907.04745},
timestamp = {Fri, 13 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1907-04745.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1908-03948,
author = {Gramoz Goranci and
Monika Henzinger and
Dariusz Leniowski and
Alexander Svozil},
title = {Fully Dynamic k-Center Clustering in Doubling Metrics},
journal = {CoRR},
volume = {abs/1908.03948},
year = {2019},
url = {http://arxiv.org/abs/1908.03948},
eprinttype = {arXiv},
eprint = {1908.03948},
timestamp = {Mon, 19 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1908-03948.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1908-04141,
author = {Monika Henzinger and
Alexander Noe and
Christian Schulz},
title = {Shared-Memory Branch-and-Reduce for Multiterminal Cuts},
journal = {CoRR},
volume = {abs/1908.04141},
year = {2019},
url = {http://arxiv.org/abs/1908.04141},
eprinttype = {arXiv},
eprint = {1908.04141},
timestamp = {Mon, 19 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1908-04141.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1909-04983,
author = {Krishnendu Chatterjee and
Wolfgang Dvor{\'{a}}k and
Monika Henzinger and
Alexander Svozil},
title = {Quasipolynomial Set-Based Symbolic Algorithms for Parity Games},
journal = {CoRR},
volume = {abs/1909.04983},
year = {2019},
url = {http://arxiv.org/abs/1909.04983},
eprinttype = {arXiv},
eprint = {1909.04983},
timestamp = {Tue, 17 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1909-04983.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1909-05539,
author = {Krishnendu Chatterjee and
Wolfgang Dvor{\'{a}}k and
Monika Henzinger and
Alexander Svozil},
title = {Near-Linear Time Algorithms for Streett Objectives in Graphs and MDPs},
journal = {CoRR},
volume = {abs/1909.05539},
year = {2019},
url = {http://arxiv.org/abs/1909.05539},
eprinttype = {arXiv},
eprint = {1909.05539},
timestamp = {Wed, 18 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1909-05539.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1909-06653,
author = {Gramoz Goranci and
Monika Henzinger and
Dariusz Leniowski},
title = {A Tree Structure For Dynamic Facility Location},
journal = {CoRR},
volume = {abs/1909.06653},
year = {2019},
url = {http://arxiv.org/abs/1909.06653},
eprinttype = {arXiv},
eprint = {1909.06653},
timestamp = {Mon, 23 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1909-06653.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1909-11600,
author = {Sayan Bhattacharya and
Monika Henzinger and
Danupon Nanongkai},
title = {A New Deterministic Algorithm for Dynamic Set Cover},
journal = {CoRR},
volume = {abs/1909.11600},
year = {2019},
url = {http://arxiv.org/abs/1909.11600},
eprinttype = {arXiv},
eprint = {1909.11600},
timestamp = {Fri, 27 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1909-11600.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1910-03332,
author = {Monika Henzinger and
Xiaowei Wu},
title = {Upper and Lower Bounds for Fully Retroactive Graph Problems},
journal = {CoRR},
volume = {abs/1910.03332},
year = {2019},
url = {http://arxiv.org/abs/1910.03332},
eprinttype = {arXiv},
eprint = {1910.03332},
timestamp = {Fri, 16 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1910-03332.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/BhattacharyaHI18,
author = {Sayan Bhattacharya and
Monika Henzinger and
Giuseppe F. Italiano},
title = {Dynamic algorithms via the primal-dual method},
journal = {Inf. Comput.},
volume = {261},
pages = {219--239},
year = {2018},
url = {https://doi.org/10.1016/j.ic.2018.02.005},
doi = {10.1016/J.IC.2018.02.005},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/BhattacharyaHI18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/HenzingerKN18,
author = {Monika Henzinger and
Sebastian Krinninger and
Danupon Nanongkai},
title = {Decremental Single-Source Shortest Paths on Undirected Graphs in Near-Linear
Total Update Time},
journal = {J. {ACM}},
volume = {65},
number = {6},
pages = {36:1--36:40},
year = {2018},
url = {https://doi.org/10.1145/3218657},
doi = {10.1145/3218657},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/HenzingerKN18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/HenzingerNSS18,
author = {Monika Henzinger and
Alexander Noe and
Christian Schulz and
Darren Strash},
title = {Practical Minimum Cut Algorithms},
journal = {{ACM} J. Exp. Algorithmics},
volume = {23},
year = {2018},
url = {https://doi.org/10.1145/3274662},
doi = {10.1145/3274662},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jea/HenzingerNSS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BhattacharyaHI18,
author = {Sayan Bhattacharya and
Monika Henzinger and
Giuseppe F. Italiano},
title = {Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching},
journal = {{SIAM} J. Comput.},
volume = {47},
number = {3},
pages = {859--887},
year = {2018},
url = {https://doi.org/10.1137/140998925},
doi = {10.1137/140998925},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/BhattacharyaHI18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/GoranciHT18,
author = {Gramoz Goranci and
Monika Henzinger and
Mikkel Thorup},
title = {Incremental Exact Min-Cut in Polylogarithmic Amortized Update Time},
journal = {{ACM} Trans. Algorithms},
volume = {14},
number = {2},
pages = {17:1--17:21},
year = {2018},
url = {https://doi.org/10.1145/3174803},
doi = {10.1145/3174803},
timestamp = {Wed, 21 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/GoranciHT18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/teco/DuttingHS18,
author = {Paul D{\"{u}}tting and
Monika Henzinger and
Martin Starnberger},
title = {Valuation Compressions in VCG-Based Combinatorial Auctions},
journal = {{ACM} Trans. Economics and Comput.},
volume = {6},
number = {2},
pages = {5:1--5:18},
year = {2018},
url = {https://doi.org/10.1145/3232860},
doi = {10.1145/3232860},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/teco/DuttingHS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aips/ChatterjeeDHS18,
author = {Krishnendu Chatterjee and
Wolfgang Dvor{\'{a}}k and
Monika Henzinger and
Alexander Svozil},
editor = {Mathijs de Weerdt and
Sven Koenig and
Gabriele R{\"{o}}ger and
Matthijs T. J. Spaan},
title = {Algorithms and Conditional Lower Bounds for Planning Problems},
booktitle = {Proceedings of the Twenty-Eighth International Conference on Automated
Planning and Scheduling, {ICAPS} 2018, Delft, The Netherlands, June
24-29, 2018},
pages = {56--64},
publisher = {{AAAI} Press},
year = {2018},
url = {https://aaai.org/ocs/index.php/ICAPS/ICAPS18/paper/view/17639},
timestamp = {Mon, 25 Jun 2018 13:32:06 +0200},
biburl = {https://dblp.org/rec/conf/aips/ChatterjeeDHS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/HenzingerN0S18,
author = {Monika Henzinger and
Alexander Noe and
Christian Schulz and
Darren Strash},
editor = {Rasmus Pagh and
Suresh Venkatasubramanian},
title = {Practical Minimum Cut Algorithms},
booktitle = {Proceedings of the Twentieth Workshop on Algorithm Engineering and
Experiments, {ALENEX} 2018, New Orleans, LA, USA, January 7-8, 2018},
pages = {48--61},
publisher = {{SIAM}},
year = {2018},
url = {https://doi.org/10.1137/1.9781611975055.5},
doi = {10.1137/1.9781611975055.5},
timestamp = {Fri, 27 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/alenex/HenzingerN0S18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cav/ChatterjeeHLOT18,
author = {Krishnendu Chatterjee and
Monika Henzinger and
Veronika Loitzenbauer and
Simin Oraee and
Viktor Toman},
editor = {Hana Chockler and
Georg Weissenbacher},
title = {Symbolic Algorithms for Graphs and Markov Decision Processes with
Fairness Objectives},
booktitle = {Computer Aided Verification - 30th International Conference, {CAV}
2018, Held as Part of the Federated Logic Conference, FloC 2018, Oxford,
UK, July 14-17, 2018, Proceedings, Part {II}},
series = {Lecture Notes in Computer Science},
volume = {10982},
pages = {178--197},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-319-96142-2\_13},
doi = {10.1007/978-3-319-96142-2\_13},
timestamp = {Fri, 09 Apr 2021 18:35:26 +0200},
biburl = {https://dblp.org/rec/conf/cav/ChatterjeeHLOT18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/GoranciHL18,
author = {Gramoz Goranci and
Monika Henzinger and
Dariusz Leniowski},
editor = {Yossi Azar and
Hannah Bast and
Grzegorz Herman},
title = {A Tree Structure For Dynamic Facility Location},
booktitle = {26th Annual European Symposium on Algorithms, {ESA} 2018, August 20-22,
2018, Helsinki, Finland},
series = {LIPIcs},
volume = {112},
pages = {39:1--39:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.ESA.2018.39},
doi = {10.4230/LIPICS.ESA.2018.39},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/esa/GoranciHL18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/GoranciHP18,
author = {Gramoz Goranci and
Monika Henzinger and
Pan Peng},
editor = {Yossi Azar and
Hannah Bast and
Grzegorz Herman},
title = {Dynamic Effective Resistances and Approximate Schur Complement on
Separable Graphs},
booktitle = {26th Annual European Symposium on Algorithms, {ESA} 2018, August 20-22,
2018, Helsinki, Finland},
series = {LIPIcs},
volume = {112},
pages = {40:1--40:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.ESA.2018.40},
doi = {10.4230/LIPICS.ESA.2018.40},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/esa/GoranciHP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lpar/ChatterjeeDHS18,
author = {Krishnendu Chatterjee and
Wolfgang Dvor{\'{a}}k and
Monika Henzinger and
Alexander Svozil},
editor = {Gilles Barthe and
Geoff Sutcliffe and
Margus Veanes},
title = {Quasipolynomial Set-Based Symbolic Algorithms for Parity Games},
booktitle = {{LPAR-22.} 22nd International Conference on Logic for Programming,
Artificial Intelligence and Reasoning, Awassa, Ethiopia, 16-21 November
2018},
series = {EPiC Series in Computing},
volume = {57},
pages = {233--253},
publisher = {EasyChair},
year = {2018},
url = {https://doi.org/10.29007/5z5k},
doi = {10.29007/5Z5K},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/lpar/ChatterjeeDHS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BhattacharyaCHN18,
author = {Sayan Bhattacharya and
Deeparnab Chakrabarty and
Monika Henzinger and
Danupon Nanongkai},
editor = {Artur Czumaj},
title = {Dynamic Algorithms for Graph Coloring},
booktitle = {Proceedings of the Twenty-Ninth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2018, New Orleans, LA, USA, January 7-10, 2018},
pages = {1--20},
publisher = {{SIAM}},
year = {2018},
url = {https://doi.org/10.1137/1.9781611975031.1},
doi = {10.1137/1.9781611975031.1},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/BhattacharyaCHN18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ChatterjeeDHL18,
author = {Krishnendu Chatterjee and
Wolfgang Dvor{\'{a}}k and
Monika Henzinger and
Veronika Loitzenbauer},
editor = {Artur Czumaj},
title = {Lower Bounds for Symbolic Computation on Graphs: Strongly Connected
Components, Liveness, Safety, and Diameter},
booktitle = {Proceedings of the Twenty-Ninth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2018, New Orleans, LA, USA, January 7-10, 2018},
pages = {2341--2356},
publisher = {{SIAM}},
year = {2018},
url = {https://doi.org/10.1137/1.9781611975031.151},
doi = {10.1137/1.9781611975031.151},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/ChatterjeeDHL18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sofsem/Henzinger18,
author = {Monika Henzinger},
editor = {A Min Tjoa and
Ladjel Bellatreche and
Stefan Biffl and
Jan van Leeuwen and
Jir{\'{\i}} Wiedermann},
title = {The State of the Art in Dynamic Graph Algorithms},
booktitle = {{SOFSEM} 2018: Theory and Practice of Computer Science - 44th International
Conference on Current Trends in Theory and Practice of Computer Science,
Krems, Austria, January 29 - February 2, 2018, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10706},
pages = {40--44},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-319-73117-9\_3},
doi = {10.1007/978-3-319-73117-9\_3},
timestamp = {Sat, 30 Sep 2023 09:57:10 +0200},
biburl = {https://dblp.org/rec/conf/sofsem/Henzinger18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wea/BiedermannH0S18,
author = {Sonja Biedermann and
Monika Henzinger and
Christian Schulz and
Bernhard Schuster},
editor = {Gianlorenzo D'Angelo},
title = {Memetic Graph Clustering},
booktitle = {17th International Symposium on Experimental Algorithms, {SEA} 2018,
June 27-29, 2018, L'Aquila, Italy},
series = {LIPIcs},
volume = {103},
pages = {3:1--3:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.SEA.2018.3},
doi = {10.4230/LIPICS.SEA.2018.3},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wea/BiedermannH0S18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/stoc/2018,
editor = {Ilias Diakonikolas and
David Kempe and
Monika Henzinger},
title = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018},
publisher = {{ACM}},
year = {2018},
url = {http://dl.acm.org/citation.cfm?id=3188745},
timestamp = {Thu, 21 Jun 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/2018.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1802-07034,
author = {Sonja Biedermann and
Monika Henzinger and
Christian Schulz and
Bernhard Schuster},
title = {Memetic Graph Clustering},
journal = {CoRR},
volume = {abs/1802.07034},
year = {2018},
url = {http://arxiv.org/abs/1802.07034},
eprinttype = {arXiv},
eprint = {1802.07034},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1802-07034.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1802-09111,
author = {Gramoz Goranci and
Monika Henzinger and
Pan Peng},
title = {Dynamic Effective Resistances and Approximate Schur Complement on
Separable Graphs},
journal = {CoRR},
volume = {abs/1802.09111},
year = {2018},
url = {http://arxiv.org/abs/1802.09111},
eprinttype = {arXiv},
eprint = {1802.09111},
timestamp = {Fri, 13 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1802-09111.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1804-00206,
author = {Krishnendu Chatterjee and
Monika Henzinger and
Veronika Loitzenbauer and
Simin Oraee and
Viktor Toman},
title = {Symbolic Algorithms for Graphs and Markov Decision Processes with
Fairness Objectives},
journal = {CoRR},
volume = {abs/1804.00206},
year = {2018},
url = {http://arxiv.org/abs/1804.00206},
eprinttype = {arXiv},
eprint = {1804.00206},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1804-00206.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1804-07031,
author = {Krishnendu Chatterjee and
Wolfgang Dvor{\'{a}}k and
Monika Henzinger and
Alexander Svozil},
title = {Algorithms and Conditional Lower Bounds for Planning Problems},
journal = {CoRR},
volume = {abs/1804.07031},
year = {2018},
url = {http://arxiv.org/abs/1804.07031},
eprinttype = {arXiv},
eprint = {1804.07031},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1804-07031.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1808-05458,
author = {Monika Henzinger and
Alexander Noe and
Christian Schulz},
title = {Shared-memory Exact Minimum Cuts},
journal = {CoRR},
volume = {abs/1808.05458},
year = {2018},
url = {http://arxiv.org/abs/1808.05458},
eprinttype = {arXiv},
eprint = {1808.05458},
timestamp = {Sun, 02 Sep 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1808-05458.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1810-10932,
author = {Aaron Bernstein and
Sebastian Forster and
Monika Henzinger},
title = {A Deamortization Approach for Dynamic Spanner and Dynamic Maximal
Matching},
journal = {CoRR},
volume = {abs/1810.10932},
year = {2018},
url = {http://arxiv.org/abs/1810.10932},
eprinttype = {arXiv},
eprint = {1810.10932},
timestamp = {Wed, 31 Oct 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1810-10932.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1811-12527,
author = {Bertie Ancona and
Monika Henzinger and
Liam Roditty and
Virginia Vassilevska Williams and
Nicole Wein},
title = {Algorithms and Hardness for Diameter in Dynamic Graphs},
journal = {CoRR},
volume = {abs/1811.12527},
year = {2018},
url = {http://arxiv.org/abs/1811.12527},
eprinttype = {arXiv},
eprint = {1811.12527},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1811-12527.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DvorakHW17,
author = {Wolfgang Dvor{\'{a}}k and
Monika Henzinger and
David P. Williamson},
title = {Maximizing a Submodular Function with Viability Constraints},
journal = {Algorithmica},
volume = {77},
number = {1},
pages = {152--172},
year = {2017},
url = {https://doi.org/10.1007/s00453-015-0066-y},
doi = {10.1007/S00453-015-0066-Y},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/DvorakHW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/lmcs/ChatterjeeHL17,
author = {Krishnendu Chatterjee and
Monika Henzinger and
Veronika Loitzenbauer},
title = {Improved Algorithms for Parity and Streett objectives},
journal = {Log. Methods Comput. Sci.},
volume = {13},
number = {3},
year = {2017},
url = {https://doi.org/10.23638/LMCS-13(3:26)2017},
doi = {10.23638/LMCS-13(3:26)2017},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/lmcs/ChatterjeeHL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BhattacharyaDHS17,
author = {Sayan Bhattacharya and
Wolfgang Dvor{\'{a}}k and
Monika Henzinger and
Martin Starnberger},
title = {Welfare Maximization with Friends-of-Friends Network Externalities},
journal = {Theory Comput. Syst.},
volume = {61},
number = {4},
pages = {948--986},
year = {2017},
url = {https://doi.org/10.1007/s00224-017-9759-8},
doi = {10.1007/S00224-017-9759-8},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/BhattacharyaDHS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sigir/BharatH17,
author = {Krishna Bharat and
Monika Henzinger},
title = {Improved Algorithms for Topic Distillation in a Hyperlinked Environment},
journal = {{SIGIR} Forum},
volume = {51},
number = {2},
pages = {194--201},
year = {2017},
url = {https://doi.org/10.1145/3130348.3130367},
doi = {10.1145/3130348.3130367},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/sigir/BharatH17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/HenzingerKN17,
author = {Monika Henzinger and
Sebastian Krinninger and
Danupon Nanongkai},
title = {Sublinear-Time Maintenance of Breadth-First Spanning Trees in Partially
Dynamic Networks},
journal = {{ACM} Trans. Algorithms},
volume = {13},
number = {4},
pages = {51:1--51:24},
year = {2017},
url = {https://doi.org/10.1145/3146550},
doi = {10.1145/3146550},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/HenzingerKN17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csl/ChatterjeeDHL17,
author = {Krishnendu Chatterjee and
Wolfgang Dvor{\'{a}}k and
Monika Henzinger and
Veronika Loitzenbauer},
editor = {Valentin Goranko and
Mads Dam},
title = {Improved Set-Based Symbolic Algorithms for Parity Games},
booktitle = {26th {EACSL} Annual Conference on Computer Science Logic, {CSL} 2017,
August 20-24, 2017, Stockholm, Sweden},
series = {LIPIcs},
volume = {82},
pages = {18:1--18:21},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.CSL.2017.18},
doi = {10.4230/LIPICS.CSL.2017.18},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/csl/ChatterjeeDHL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/GoranciHP17,
author = {Gramoz Goranci and
Monika Henzinger and
Pan Peng},
editor = {Kirk Pruhs and
Christian Sohler},
title = {Improved Guarantees for Vertex Sparsification in Planar Graphs},
booktitle = {25th Annual European Symposium on Algorithms, {ESA} 2017, September
4-6, 2017, Vienna, Austria},
series = {LIPIcs},
volume = {87},
pages = {44:1--44:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.ESA.2017.44},
doi = {10.4230/LIPICS.ESA.2017.44},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/esa/GoranciHP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/GoranciHP17a,
author = {Gramoz Goranci and
Monika Henzinger and
Pan Peng},
editor = {Kirk Pruhs and
Christian Sohler},
title = {The Power of Vertex Sparsifiers in Dynamic Graph Algorithms},
booktitle = {25th Annual European Symposium on Algorithms, {ESA} 2017, September
4-6, 2017, Vienna, Austria},
series = {LIPIcs},
volume = {87},
pages = {45:1--45:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.ESA.2017.45},
doi = {10.4230/LIPICS.ESA.2017.45},
timestamp = {Fri, 13 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/GoranciHP17a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/HenzingerLM17,
author = {Monika Henzinger and
Dariusz Leniowski and
Claire Mathieu},
editor = {Kirk Pruhs and
Christian Sohler},
title = {Dynamic Clustering to Minimize the Sum of Radii},
booktitle = {25th Annual European Symposium on Algorithms, {ESA} 2017, September
4-6, 2017, Vienna, Austria},
series = {LIPIcs},
volume = {87},
pages = {48:1--48:10},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.ESA.2017.48},
doi = {10.4230/LIPICS.ESA.2017.48},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/HenzingerLM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/Henzinger17,
author = {Monika Henzinger},
editor = {Ioannis Chatzigiannakis and
Piotr Indyk and
Fabian Kuhn and
Anca Muscholl},
title = {Efficient Algorithms for Graph-Related Problems in Computer-Aided
Verification (Invited Talk)},
booktitle = {44th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2017, July 10-14, 2017, Warsaw, Poland},
series = {LIPIcs},
volume = {80},
pages = {2:1--2:1},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2017.2},
doi = {10.4230/LIPICS.ICALP.2017.2},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/icalp/Henzinger17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icml/WangFHMR17,
author = {Di Wang and
Kimon Fountoulakis and
Monika Henzinger and
Michael W. Mahoney and
Satish Rao},
editor = {Doina Precup and
Yee Whye Teh},
title = {Capacity Releasing Diffusion for Speed and Locality},
booktitle = {Proceedings of the 34th International Conference on Machine Learning,
{ICML} 2017, Sydney, NSW, Australia, 6-11 August 2017},
series = {Proceedings of Machine Learning Research},
volume = {70},
pages = {3598--3607},
publisher = {{PMLR}},
year = {2017},
url = {http://proceedings.mlr.press/v70/wang17b.html},
timestamp = {Wed, 29 May 2019 08:41:45 +0200},
biburl = {https://dblp.org/rec/conf/icml/WangFHMR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/HenzingerL0W17,
author = {Monika Henzinger and
Andrea Lincoln and
Stefan Neumann and
Virginia Vassilevska Williams},
editor = {Christos H. Papadimitriou},
title = {Conditional Hardness for Sensitivity Problems},
booktitle = {8th Innovations in Theoretical Computer Science Conference, {ITCS}
2017, January 9-11, 2017, Berkeley, CA, {USA}},
series = {LIPIcs},
volume = {67},
pages = {26:1--26:31},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2017.26},
doi = {10.4230/LIPICS.ITCS.2017.26},
timestamp = {Mon, 01 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/HenzingerL0W17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/BhattacharyaCH17,
author = {Sayan Bhattacharya and
Deeparnab Chakrabarty and
Monika Henzinger},
editor = {Friedrich Eisenbrand and
Jochen K{\"{o}}nemann},
title = {Deterministic Fully Dynamic Approximate Vertex Cover and Fractional
Matching in {O(1)} Amortized Update Time},
booktitle = {Integer Programming and Combinatorial Optimization - 19th International
Conference, {IPCO} 2017, Waterloo, ON, Canada, June 26-28, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10328},
pages = {86--98},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-59250-3\_8},
doi = {10.1007/978-3-319-59250-3\_8},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/ipco/BhattacharyaCH17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/ChatterjeeHS17,
author = {Krishnendu Chatterjee and
Monika Henzinger and
Alexander Svozil},
editor = {Kim G. Larsen and
Hans L. Bodlaender and
Jean{-}Fran{\c{c}}ois Raskin},
title = {Faster Algorithms for Mean-Payoff Parity Games},
booktitle = {42nd International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2017, August 21-25, 2017 - Aalborg, Denmark},
series = {LIPIcs},
volume = {83},
pages = {39:1--39:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2017.39},
doi = {10.4230/LIPICS.MFCS.2017.39},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/mfcs/ChatterjeeHS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BhattacharyaHN17,
author = {Sayan Bhattacharya and
Monika Henzinger and
Danupon Nanongkai},
editor = {Philip N. Klein},
title = {Fully Dynamic Approximate Maximum Matching and Minimum Vertex Cover
in \emph{O}(log\({}^{\mbox{3}}\) \emph{n}) Worst Case Update Time},
booktitle = {Proceedings of the Twenty-Eighth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2017, Barcelona, Spain, Hotel Porta Fira, January
16-19},
pages = {470--489},
publisher = {{SIAM}},
year = {2017},
url = {https://doi.org/10.1137/1.9781611974782.30},
doi = {10.1137/1.9781611974782.30},
timestamp = {Tue, 02 Feb 2021 17:07:33 +0100},
biburl = {https://dblp.org/rec/conf/soda/BhattacharyaHN17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/HenzingerRW17,
author = {Monika Henzinger and
Satish Rao and
Di Wang},
editor = {Philip N. Klein},
title = {Local Flow Partitioning for Faster Edge Connectivity},
booktitle = {Proceedings of the Twenty-Eighth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2017, Barcelona, Spain, Hotel Porta Fira, January
16-19},
pages = {1919--1938},
publisher = {{SIAM}},
year = {2017},
url = {https://doi.org/10.1137/1.9781611974782.125},
doi = {10.1137/1.9781611974782.125},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/HenzingerRW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GoranciHP17,
author = {Gramoz Goranci and
Monika Henzinger and
Pan Peng},
title = {Improved Guarantees for Vertex Sparsification in Planar Graphs},
journal = {CoRR},
volume = {abs/1702.01136},
year = {2017},
url = {http://arxiv.org/abs/1702.01136},
eprinttype = {arXiv},
eprint = {1702.01136},
timestamp = {Fri, 13 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GoranciHP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/HenzingerL0W17,
author = {Monika Henzinger and
Andrea Lincoln and
Stefan Neumann and
Virginia Vassilevska Williams},
title = {Conditional Hardness for Sensitivity Problems},
journal = {CoRR},
volume = {abs/1703.01638},
year = {2017},
url = {http://arxiv.org/abs/1703.01638},
eprinttype = {arXiv},
eprint = {1703.01638},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/HenzingerL0W17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/HenzingerRW17,
author = {Monika Henzinger and
Satish Rao and
Di Wang},
title = {Local Flow Partitioning for Faster Edge Connectivity},
journal = {CoRR},
volume = {abs/1704.01254},
year = {2017},
url = {http://arxiv.org/abs/1704.01254},
eprinttype = {arXiv},
eprint = {1704.01254},
timestamp = {Wed, 05 Sep 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/HenzingerRW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BhattacharyaHN17,
author = {Sayan Bhattacharya and
Monika Henzinger and
Danupon Nanongkai},
title = {Fully Dynamic Approximate Maximum Matching and Minimum Vertex Cover
in O(log\({}^{\mbox{3}}\)n) Worst Case Update Time},
journal = {CoRR},
volume = {abs/1704.02844},
year = {2017},
url = {http://arxiv.org/abs/1704.02844},
eprinttype = {arXiv},
eprint = {1704.02844},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BhattacharyaHN17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ChatterjeeDHL17,
author = {Krishnendu Chatterjee and
Wolfgang Dvor{\'{a}}k and
Monika Henzinger and
Veronika Loitzenbauer},
title = {Improved Set-based Symbolic Algorithms for Parity Games},
journal = {CoRR},
volume = {abs/1706.04889},
year = {2017},
url = {http://arxiv.org/abs/1706.04889},
eprinttype = {arXiv},
eprint = {1706.04889},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/ChatterjeeDHL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/WangFHMR17,
author = {Di Wang and
Kimon Fountoulakis and
Monika Henzinger and
Michael W. Mahoney and
Satish Rao},
title = {Capacity Releasing Diffusion for Speed and Locality},
journal = {CoRR},
volume = {abs/1706.05826},
year = {2017},
url = {http://arxiv.org/abs/1706.05826},
eprinttype = {arXiv},
eprint = {1706.05826},
timestamp = {Wed, 05 Sep 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/WangFHMR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ChatterjeeHS17,
author = {Krishnendu Chatterjee and
Monika Henzinger and
Alexander Svozil},
title = {Faster Algorithms for Mean-Payoff Parity Games},
journal = {CoRR},
volume = {abs/1706.06139},
year = {2017},
url = {http://arxiv.org/abs/1706.06139},
eprinttype = {arXiv},
eprint = {1706.06139},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/ChatterjeeHS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/HenzingerLM17,
author = {Monika Henzinger and
Dariusz Leniowski and
Claire Mathieu},
title = {Dynamic clustering to minimize the sum of radii},
journal = {CoRR},
volume = {abs/1707.02577},
year = {2017},
url = {http://arxiv.org/abs/1707.02577},
eprinttype = {arXiv},
eprint = {1707.02577},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/HenzingerLM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1708-06127,
author = {Monika Henzinger and
Alexander Noe and
Christian Schulz and
Darren Strash},
title = {Practical Minimum Cut Algorithms},
journal = {CoRR},
volume = {abs/1708.06127},
year = {2017},
url = {http://arxiv.org/abs/1708.06127},
eprinttype = {arXiv},
eprint = {1708.06127},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1708-06127.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1711-04355,
author = {Sayan Bhattacharya and
Deeparnab Chakrabarty and
Monika Henzinger and
Danupon Nanongkai},
title = {Dynamic Algorithms for Graph Coloring},
journal = {CoRR},
volume = {abs/1711.04355},
year = {2017},
url = {http://arxiv.org/abs/1711.04355},
eprinttype = {arXiv},
eprint = {1711.04355},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1711-04355.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1711-09148,
author = {Krishnendu Chatterjee and
Wolfgang Dvor{\'{a}}k and
Monika Henzinger and
Veronika Loitzenbauer},
title = {Lower Bounds for Symbolic Computation on Graphs: Strongly Connected
Components, Liveness, Safety, and Diameter},
journal = {CoRR},
volume = {abs/1711.09148},
year = {2017},
url = {http://arxiv.org/abs/1711.09148},
eprinttype = {arXiv},
eprint = {1711.09148},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1711-09148.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1712-06473,
author = {Gramoz Goranci and
Monika Henzinger and
Pan Peng},
title = {The Power of Vertex Sparsifiers in Dynamic Graph Algorithms},
journal = {CoRR},
volume = {abs/1712.06473},
year = {2017},
url = {http://arxiv.org/abs/1712.06473},
eprinttype = {arXiv},
eprint = {1712.06473},
timestamp = {Fri, 13 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1712-06473.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eatcs/AcetoDGHHISST16,
author = {Luca Aceto and
Mariangiola Dezani{-}Ciancaglini and
Yuri Gurevich and
David Harel and
Monika Henzinger and
Giuseppe F. Italiano and
Scott A. Smolka and
Paul G. Spirakis and
Wolfgang Thomas},
title = {{EATCS} Fellows' Advice to the Young Theoretical Computer Scientist},
journal = {Bull. {EATCS}},
volume = {119},
year = {2016},
url = {http://eatcs.org/beatcs/index.php/beatcs/article/view/419},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eatcs/AcetoDGHHISST16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/HenzingerKN16,
author = {Monika Henzinger and
Sebastian Krinninger and
Danupon Nanongkai},
title = {Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(mn) Barrier
and Derandomization},
journal = {{SIAM} J. Comput.},
volume = {45},
number = {3},
pages = {947--1006},
year = {2016},
url = {https://doi.org/10.1137/140957299},
doi = {10.1137/140957299},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/HenzingerKN16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/GoranciHT16,
author = {Gramoz Goranci and
Monika Henzinger and
Mikkel Thorup},
editor = {Piotr Sankowski and
Christos D. Zaroliagis},
title = {Incremental Exact Min-Cut in Poly-logarithmic Amortized Update Time},
booktitle = {24th Annual European Symposium on Algorithms, {ESA} 2016, August 22-24,
2016, Aarhus, Denmark},
series = {LIPIcs},
volume = {57},
pages = {46:1--46:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.ESA.2016.46},
doi = {10.4230/LIPICS.ESA.2016.46},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/esa/GoranciHT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/HenzingerN16,
author = {Monika Henzinger and
Stefan Neumann},
editor = {Piotr Sankowski and
Christos D. Zaroliagis},
title = {Incremental and Fully Dynamic Subgraph Connectivity For Emergency
Planning},
booktitle = {24th Annual European Symposium on Algorithms, {ESA} 2016, August 22-24,
2016, Aarhus, Denmark},
series = {LIPIcs},
volume = {57},
pages = {48:1--48:11},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.ESA.2016.48},
doi = {10.4230/LIPICS.ESA.2016.48},
timestamp = {Mon, 01 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/HenzingerN16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/CheungGH16,
author = {Yun Kuen Cheung and
Gramoz Goranci and
Monika Henzinger},
editor = {Ioannis Chatzigiannakis and
Michael Mitzenmacher and
Yuval Rabani and
Davide Sangiorgi},
title = {Graph Minors for Preserving Terminal Distances Approximately - Lower
and Upper Bounds},
booktitle = {43rd International Colloquium on Automata, Languages, and Programming,
{ICALP} 2016, July 11-15, 2016, Rome, Italy},
series = {LIPIcs},
volume = {55},
pages = {131:1--131:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2016.131},
doi = {10.4230/LIPICS.ICALP.2016.131},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/icalp/CheungGH16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lics/ChatterjeeDHL16,
author = {Krishnendu Chatterjee and
Wolfgang Dvor{\'{a}}k and
Monika Henzinger and
Veronika Loitzenbauer},
editor = {Martin Grohe and
Eric Koskinen and
Natarajan Shankar},
title = {Model and Objective Separation with Conditional Lower Bounds: Disjunction
is Harder than Conjunction},
booktitle = {Proceedings of the 31st Annual {ACM/IEEE} Symposium on Logic in Computer
Science, {LICS} '16, New York, NY, USA, July 5-8, 2016},
pages = {197--206},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2933575.2935304},
doi = {10.1145/2933575.2935304},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/lics/ChatterjeeDHL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/ChatterjeeDHL16,
author = {Krishnendu Chatterjee and
Wolfgang Dvor{\'{a}}k and
Monika Henzinger and
Veronika Loitzenbauer},
editor = {Piotr Faliszewski and
Anca Muscholl and
Rolf Niedermeier},
title = {Conditionally Optimal Algorithms for Generalized B{\"{u}}chi
Games},
booktitle = {41st International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2016, August 22-26, 2016 - Krak{\'{o}}w, Poland},
series = {LIPIcs},
volume = {58},
pages = {25:1--25:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2016.25},
doi = {10.4230/LIPICS.MFCS.2016.25},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/mfcs/ChatterjeeDHL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BhattacharyaHN16,
author = {Sayan Bhattacharya and
Monika Henzinger and
Danupon Nanongkai},
editor = {Daniel Wichs and
Yishay Mansour},
title = {New deterministic approximation algorithms for fully dynamic matching},
booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
pages = {398--411},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2897518.2897568},
doi = {10.1145/2897518.2897568},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/BhattacharyaHN16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/HenzingerKN16,
author = {Monika Henzinger and
Sebastian Krinninger and
Danupon Nanongkai},
editor = {Daniel Wichs and
Yishay Mansour},
title = {A deterministic almost-tight distributed algorithm for approximating
single-source shortest paths},
booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
pages = {489--498},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2897518.2897638},
doi = {10.1145/2897518.2897638},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/HenzingerKN16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/algo/HenzingerKN16,
author = {Monika Henzinger and
Sebastian Krinninger and
Danupon Nanongkai},
title = {Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(mn) Barrierand
Derandomization},
booktitle = {Encyclopedia of Algorithms},
pages = {600--602},
year = {2016},
url = {https://doi.org/10.1007/978-1-4939-2864-4\_565},
doi = {10.1007/978-1-4939-2864-4\_565},
timestamp = {Wed, 12 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/reference/algo/HenzingerKN16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/algo/Henzinger16,
author = {Monika Henzinger},
title = {PageRank Algorithm},
booktitle = {Encyclopedia of Algorithms},
pages = {1509--1511},
year = {2016},
url = {https://doi.org/10.1007/978-1-4939-2864-4\_277},
doi = {10.1007/978-1-4939-2864-4\_277},
timestamp = {Wed, 12 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/reference/algo/Henzinger16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ChatterjeeDHL16,
author = {Krishnendu Chatterjee and
Wolfgang Dvor{\'{a}}k and
Monika Henzinger and
Veronika Loitzenbauer},
title = {Model and Objective Separation with Conditional Lower Bounds: Disjunction
is Harder than Conjunction},
journal = {CoRR},
volume = {abs/1602.02670},
year = {2016},
url = {http://arxiv.org/abs/1602.02670},
eprinttype = {arXiv},
eprint = {1602.02670},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/ChatterjeeDHL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BhattacharyaHI16,
author = {Sayan Bhattacharya and
Monika Henzinger and
Giuseppe F. Italiano},
title = {Design of Dynamic Algorithms via Primal-Dual Method},
journal = {CoRR},
volume = {abs/1604.05337},
year = {2016},
url = {http://arxiv.org/abs/1604.05337},
eprinttype = {arXiv},
eprint = {1604.05337},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BhattacharyaHI16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Ben-ZwiHL16,
author = {Oren Ben{-}Zwi and
Monika Henzinger and
Veronika Loitzenbauer},
title = {Ad Exchange: Envy-Free Auctions with Mediators},
journal = {CoRR},
volume = {abs/1604.05562},
year = {2016},
url = {http://arxiv.org/abs/1604.05562},
eprinttype = {arXiv},
eprint = {1604.05562},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Ben-ZwiHL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/DvorakH16,
author = {Wolfgang Dvor{\'{a}}k and
Monika Henzinger},
title = {Online Ad Assignment with an Ad Exchange},
journal = {CoRR},
volume = {abs/1604.05603},
year = {2016},
url = {http://arxiv.org/abs/1604.05603},
eprinttype = {arXiv},
eprint = {1604.05603},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/DvorakH16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BhattacharyaHN16,
author = {Sayan Bhattacharya and
Monika Henzinger and
Danupon Nanongkai},
title = {New Deterministic Approximation Algorithms for Fully Dynamic Matching},
journal = {CoRR},
volume = {abs/1604.05765},
year = {2016},
url = {http://arxiv.org/abs/1604.05765},
eprinttype = {arXiv},
eprint = {1604.05765},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BhattacharyaHN16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ChatterjeeHKK16,
author = {Krishnendu Chatterjee and
Monika Henzinger and
Sebastian Krinninger and
Danupon Nanongkai},
title = {Polynomial-Time Algorithms for Energy Games with Special Weight Structures},
journal = {CoRR},
volume = {abs/1604.08234},
year = {2016},
url = {http://arxiv.org/abs/1604.08234},
eprinttype = {arXiv},
eprint = {1604.08234},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/ChatterjeeHKK16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/CheungGH16,
author = {Yun Kuen Cheung and
Gramoz Goranci and
Monika Henzinger},
title = {Graph Minors for Preserving Terminal Distances Approximately - Lower
and Upper Bounds},
journal = {CoRR},
volume = {abs/1604.08342},
year = {2016},
url = {http://arxiv.org/abs/1604.08342},
eprinttype = {arXiv},
eprint = {1604.08342},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/CheungGH16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ChatterjeeDHL16a,
author = {Krishnendu Chatterjee and
Wolfgang Dvor{\'{a}}k and
Monika Henzinger and
Veronika Loitzenbauer},
title = {Conditionally Optimal Algorithms for Generalized B{\"{u}}chi
Games},
journal = {CoRR},
volume = {abs/1607.05850},
year = {2016},
url = {http://arxiv.org/abs/1607.05850},
eprinttype = {arXiv},
eprint = {1607.05850},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/ChatterjeeDHL16a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BhattacharyaCH16,
author = {Sayan Bhattacharya and
Deeparnab Chakrabarty and
Monika Henzinger},
title = {Deterministic Fully Dynamic Approximate Vertex Cover and Fractional
Matching in {\textdollar}O(1){\textdollar} Amortized Update Time},
journal = {CoRR},
volume = {abs/1611.00198},
year = {2016},
url = {http://arxiv.org/abs/1611.00198},
eprinttype = {arXiv},
eprint = {1611.00198},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BhattacharyaCH16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Henzinger016,
author = {Monika Henzinger and
Stefan Neumann},
title = {Incremental and Fully Dynamic Subgraph Connectivity For Emergency
Planning},
journal = {CoRR},
volume = {abs/1611.05248},
year = {2016},
url = {http://arxiv.org/abs/1611.05248},
eprinttype = {arXiv},
eprint = {1611.05248},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Henzinger016.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/DvorakHW16,
author = {Wolfgang Dvor{\'{a}}k and
Monika Henzinger and
David P. Williamson},
title = {Maximizing a Submodular Function with Viability Constraints},
journal = {CoRR},
volume = {abs/1611.05753},
year = {2016},
url = {http://arxiv.org/abs/1611.05753},
eprinttype = {arXiv},
eprint = {1611.05753},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/DvorakHW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GoranciHT16,
author = {Gramoz Goranci and
Monika Henzinger and
Mikkel Thorup},
title = {Incremental Exact Min-Cut in Poly-logarithmic Amortized Update Time},
journal = {CoRR},
volume = {abs/1611.06500},
year = {2016},
url = {http://arxiv.org/abs/1611.06500},
eprinttype = {arXiv},
eprint = {1611.06500},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GoranciHT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/HenzingerKN16,
author = {Monika Henzinger and
Sebastian Krinninger and
Danupon Nanongkai},
title = {Improved Algorithms for Decremental Single-Source Reachability on
Directed Graphs},
journal = {CoRR},
volume = {abs/1612.03856},
year = {2016},
url = {http://arxiv.org/abs/1612.03856},
eprinttype = {arXiv},
eprint = {1612.03856},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/HenzingerKN16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HenzingerL15,
author = {Monika Henzinger and
Veronika Loitzenbauer},
title = {Truthful unit-demand auctions with budgets revisited},
journal = {Theor. Comput. Sci.},
volume = {573},
pages = {1--15},
year = {2015},
url = {https://doi.org/10.1016/j.tcs.2015.01.033},
doi = {10.1016/J.TCS.2015.01.033},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/HenzingerL15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/teco/DuttingHW15,
author = {Paul D{\"{u}}tting and
Monika Henzinger and
Ingmar Weber},
title = {An Expressive Mechanism for Auctions on the Web},
journal = {{ACM} Trans. Economics and Comput.},
volume = {4},
number = {1},
pages = {1:1--1:34},
year = {2015},
url = {https://doi.org/10.1145/2716312},
doi = {10.1145/2716312},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/teco/DuttingHW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/teco/Colini-Baldeschi15,
author = {Riccardo Colini{-}Baldeschi and
Stefano Leonardi and
Monika Henzinger and
Martin Starnberger},
title = {On Multiple Keyword Sponsored Search Auctions with Budgets},
journal = {{ACM} Trans. Economics and Comput.},
volume = {4},
number = {1},
pages = {2:1--2:34},
year = {2015},
url = {https://doi.org/10.1145/2818357},
doi = {10.1145/2818357},
timestamp = {Tue, 27 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/teco/Colini-Baldeschi15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/teco/DuttingHS15,
author = {Paul D{\"{u}}tting and
Monika Henzinger and
Martin Starnberger},
title = {Auctions for Heterogeneous Items and Budget Limits},
journal = {{ACM} Trans. Economics and Comput.},
volume = {4},
number = {1},
pages = {4:1--4:17},
year = {2015},
url = {https://doi.org/10.1145/2818351},
doi = {10.1145/2818351},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/teco/DuttingHS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BhattacharyaHI15,
author = {Sayan Bhattacharya and
Monika Henzinger and
Giuseppe F. Italiano},
editor = {Magn{\'{u}}s M. Halld{\'{o}}rsson and
Kazuo Iwama and
Naoki Kobayashi and
Bettina Speckmann},
title = {Design of Dynamic Algorithms via Primal-Dual Method},
booktitle = {Automata, Languages, and Programming - 42nd International Colloquium,
{ICALP} 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {9134},
pages = {206--218},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-47672-7\_17},
doi = {10.1007/978-3-662-47672-7\_17},
timestamp = {Fri, 27 Mar 2020 09:02:59 +0100},
biburl = {https://dblp.org/rec/conf/icalp/BhattacharyaHI15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/HenzingerKL15,
author = {Monika Henzinger and
Sebastian Krinninger and
Veronika Loitzenbauer},
editor = {Magn{\'{u}}s M. Halld{\'{o}}rsson and
Kazuo Iwama and
Naoki Kobayashi and
Bettina Speckmann},
title = {Finding 2-Edge and 2-Vertex Strongly Connected Components in Quadratic
Time},
booktitle = {Automata, Languages, and Programming - 42nd International Colloquium,
{ICALP} 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {9134},
pages = {713--724},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-47672-7\_58},
doi = {10.1007/978-3-662-47672-7\_58},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/HenzingerKL15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/HenzingerKN15,
author = {Monika Henzinger and
Sebastian Krinninger and
Danupon Nanongkai},
editor = {Magn{\'{u}}s M. Halld{\'{o}}rsson and
Kazuo Iwama and
Naoki Kobayashi and
Bettina Speckmann},
title = {Improved Algorithms for Decremental Single-Source Reachability on
Directed Graphs},
booktitle = {Automata, Languages, and Programming - 42nd International Colloquium,
{ICALP} 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {9134},
pages = {725--736},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-47672-7\_59},
doi = {10.1007/978-3-662-47672-7\_59},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/HenzingerKN15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lics/ChatterjeeHL15,
author = {Krishnendu Chatterjee and
Monika Henzinger and
Veronika Loitzenbauer},
title = {Improved Algorithms for One-Pair and k-Pair Streett Objectives},
booktitle = {30th Annual {ACM/IEEE} Symposium on Logic in Computer Science, {LICS}
2015, Kyoto, Japan, July 6-10, 2015},
pages = {269--280},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/LICS.2015.34},
doi = {10.1109/LICS.2015.34},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/lics/ChatterjeeHL15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BhattacharyaHI15,
author = {Sayan Bhattacharya and
Monika Henzinger and
Giuseppe F. Italiano},
editor = {Piotr Indyk},
title = {Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching},
booktitle = {Proceedings of the Twenty-Sixth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2015, San Diego, CA, USA, January 4-6, 2015},
pages = {785--804},
publisher = {{SIAM}},
year = {2015},
url = {https://doi.org/10.1137/1.9781611973730.54},
doi = {10.1137/1.9781611973730.54},
timestamp = {Tue, 02 Feb 2021 17:07:30 +0100},
biburl = {https://dblp.org/rec/conf/soda/BhattacharyaHI15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BhattacharyaDHS15,
author = {Sayan Bhattacharya and
Wolfgang Dvor{\'{a}}k and
Monika Henzinger and
Martin Starnberger},
editor = {Ernst W. Mayr and
Nicolas Ollinger},
title = {Welfare Maximization with Friends-of-Friends Network Externalities},
booktitle = {32nd International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2015, March 4-7, 2015, Garching, Germany},
series = {LIPIcs},
volume = {30},
pages = {90--102},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2015},
url = {https://doi.org/10.4230/LIPIcs.STACS.2015.90},
doi = {10.4230/LIPICS.STACS.2015.90},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stacs/BhattacharyaDHS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/HenzingerKNS15,
author = {Monika Henzinger and
Sebastian Krinninger and
Danupon Nanongkai and
Thatchaphol Saranurak},
editor = {Rocco A. Servedio and
Ronitt Rubinfeld},
title = {Unifying and Strengthening Hardness for Dynamic Problems via the Online
Matrix-Vector Multiplication Conjecture},
booktitle = {Proceedings of the Forty-Seventh Annual {ACM} on Symposium on Theory
of Computing, {STOC} 2015, Portland, OR, USA, June 14-17, 2015},
pages = {21--30},
publisher = {{ACM}},
year = {2015},
url = {https://doi.org/10.1145/2746539.2746609},
doi = {10.1145/2746539.2746609},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/HenzingerKNS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BhattacharyaHNT15,
author = {Sayan Bhattacharya and
Monika Henzinger and
Danupon Nanongkai and
Charalampos E. Tsourakakis},
editor = {Rocco A. Servedio and
Ronitt Rubinfeld},
title = {Space- and Time-Efficient Algorithm for Maintaining Dense Subgraphs
on One-Pass Dynamic Streams},
booktitle = {Proceedings of the Forty-Seventh Annual {ACM} on Symposium on Theory
of Computing, {STOC} 2015, Portland, OR, USA, June 14-17, 2015},
pages = {173--182},
publisher = {{ACM}},
year = {2015},
url = {https://doi.org/10.1145/2746539.2746592},
doi = {10.1145/2746539.2746592},
timestamp = {Mon, 01 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BhattacharyaHNT15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wine/Ben-ZwiHL15,
author = {Oren Ben{-}Zwi and
Monika Henzinger and
Veronika Loitzenbauer},
editor = {Evangelos Markakis and
Guido Sch{\"{a}}fer},
title = {Ad Exchange: Envy-Free Auctions with Mediators},
booktitle = {Web and Internet Economics - 11th International Conference, {WINE}
2015, Amsterdam, The Netherlands, December 9-12, 2015, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9470},
pages = {104--117},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-48995-6\_8},
doi = {10.1007/978-3-662-48995-6\_8},
timestamp = {Tue, 04 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wine/Ben-ZwiHL15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wine/CheungHHS15,
author = {Yun Kuen Cheung and
Monika Henzinger and
Martin Hoefer and
Martin Starnberger},
editor = {Evangelos Markakis and
Guido Sch{\"{a}}fer},
title = {Combinatorial Auctions with Conflict-Based Externalities},
booktitle = {Web and Internet Economics - 11th International Conference, {WINE}
2015, Amsterdam, The Netherlands, December 9-12, 2015, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9470},
pages = {230--243},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-48995-6\_17},
doi = {10.1007/978-3-662-48995-6\_17},
timestamp = {Fri, 26 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wine/CheungHHS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BhattacharyaHNT15,
author = {Sayan Bhattacharya and
Monika Henzinger and
Danupon Nanongkai and
Charalampos E. Tsourakakis},
title = {Space- and Time-Efficient Algorithm for Maintaining Dense Subgraphs
on One-Pass Dynamic Streams},
journal = {CoRR},
volume = {abs/1504.02268},
year = {2015},
url = {http://arxiv.org/abs/1504.02268},
eprinttype = {arXiv},
eprint = {1504.02268},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BhattacharyaHNT15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/HenzingerKN15,
author = {Monika Henzinger and
Sebastian Krinninger and
Danupon Nanongkai},
title = {An Almost-Tight Distributed Algorithm for Computing Single-Source
Shortest Paths},
journal = {CoRR},
volume = {abs/1504.07056},
year = {2015},
url = {http://arxiv.org/abs/1504.07056},
eprinttype = {arXiv},
eprint = {1504.07056},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/HenzingerKN15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/HenzingerKN15a,
author = {Monika Henzinger and
Sebastian Krinninger and
Danupon Nanongkai},
title = {Sublinear-Time Decremental Algorithms for Single-Source Reachability
and Shortest Paths on Directed Graphs},
journal = {CoRR},
volume = {abs/1504.07959},
year = {2015},
url = {http://arxiv.org/abs/1504.07959},
eprinttype = {arXiv},
eprint = {1504.07959},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/HenzingerKN15a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/CheungHHS15,
author = {Yun Kuen Cheung and
Monika Henzinger and
Martin Hoefer and
Martin Starnberger},
title = {Combinatorial Auctions with Conflict-Based Externalities},
journal = {CoRR},
volume = {abs/1509.09147},
year = {2015},
url = {http://arxiv.org/abs/1509.09147},
eprinttype = {arXiv},
eprint = {1509.09147},
timestamp = {Fri, 26 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/CheungHHS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/HenzingerKNS15,
author = {Monika Henzinger and
Sebastian Krinninger and
Danupon Nanongkai and
Thatchaphol Saranurak},
title = {Unifying and Strengthening Hardness for Dynamic Problems via the Online
Matrix-Vector Multiplication Conjecture},
journal = {CoRR},
volume = {abs/1511.06773},
year = {2015},
url = {http://arxiv.org/abs/1511.06773},
eprinttype = {arXiv},
eprint = {1511.06773},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/HenzingerKNS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/HenzingerKN15b,
author = {Monika Henzinger and
Sebastian Krinninger and
Danupon Nanongkai},
title = {Sublinear-Time Maintenance of Breadth-First Spanning Trees in Partially
Dynamic Networks},
journal = {CoRR},
volume = {abs/1512.08147},
year = {2015},
url = {http://arxiv.org/abs/1512.08147},
eprinttype = {arXiv},
eprint = {1512.08147},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/HenzingerKN15b.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/HenzingerKN15c,
author = {Monika Henzinger and
Sebastian Krinninger and
Danupon Nanongkai},
title = {Decremental Single-Source Shortest Paths on Undirected Graphs in Near-Linear
Total Update Time},
journal = {CoRR},
volume = {abs/1512.08148},
year = {2015},
url = {http://arxiv.org/abs/1512.08148},
eprinttype = {arXiv},
eprint = {1512.08148},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/HenzingerKN15c.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChatterjeeHKN14,
author = {Krishnendu Chatterjee and
Monika Henzinger and
Sebastian Krinninger and
Danupon Nanongkai},
title = {Polynomial-Time Algorithms for Energy Games with Special Weight Structures},
journal = {Algorithmica},
volume = {70},
number = {3},
pages = {457--492},
year = {2014},
url = {https://doi.org/10.1007/s00453-013-9843-7},
doi = {10.1007/S00453-013-9843-7},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/ChatterjeeHKN14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ChatterjeeH14,
author = {Krishnendu Chatterjee and
Monika Henzinger},
title = {Efficient and Dynamic Algorithms for Alternating B{\"{u}}chi
Games and Maximal End-Component Decomposition},
journal = {J. {ACM}},
volume = {61},
number = {3},
pages = {15:1--15:40},
year = {2014},
url = {https://doi.org/10.1145/2597631},
doi = {10.1145/2597631},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/ChatterjeeH14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ChatterjeeHKLR14,
author = {Krishnendu Chatterjee and
Monika Henzinger and
Sebastian Krinninger and
Veronika Loitzenbauer and
Michael A. Raskin},
title = {Approximating the minimum cycle mean},
journal = {Theor. Comput. Sci.},
volume = {547},
pages = {104--116},
year = {2014},
url = {https://doi.org/10.1016/j.tcs.2014.06.031},
doi = {10.1016/J.TCS.2014.06.031},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ChatterjeeHKLR14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/CharikarHN14,
author = {Moses Charikar and
Monika Henzinger and
Huy L. Nguyen},
editor = {Andreas S. Schulz and
Dorothea Wagner},
title = {Online Bipartite Matching with Decomposable Weights},
booktitle = {Algorithms - {ESA} 2014 - 22th Annual European Symposium, Wroclaw,
Poland, September 8-10, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8737},
pages = {260--271},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-662-44777-2\_22},
doi = {10.1007/978-3-662-44777-2\_22},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/CharikarHN14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/HenzingerKN14,
author = {Monika Henzinger and
Sebastian Krinninger and
Danupon Nanongkai},
title = {Decremental Single-Source Shortest Paths on Undirected Graphs in Near-Linear
Total Update Time},
booktitle = {55th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2014, Philadelphia, PA, USA, October 18-21, 2014},
pages = {146--155},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/FOCS.2014.24},
doi = {10.1109/FOCS.2014.24},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/HenzingerKN14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/HenzingerKN14,
author = {Monika Henzinger and
Sebastian Krinninger and
Danupon Nanongkai},
editor = {Chandra Chekuri},
title = {A Subquadratic-Time Algorithm for Decremental Single-Source Shortest
Paths},
booktitle = {Proceedings of the Twenty-Fifth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2014, Portland, Oregon, USA, January 5-7, 2014},
pages = {1053--1072},
publisher = {{SIAM}},
year = {2014},
url = {https://doi.org/10.1137/1.9781611973402.79},
doi = {10.1137/1.9781611973402.79},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/HenzingerKN14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/HenzingerKN14,
author = {Monika Henzinger and
Sebastian Krinninger and
Danupon Nanongkai},
editor = {David B. Shmoys},
title = {Sublinear-time decremental algorithms for single-source reachability
and shortest paths on directed graphs},
booktitle = {Symposium on Theory of Computing, {STOC} 2014, New York, NY, USA,
May 31 - June 03, 2014},
pages = {674--683},
publisher = {{ACM}},
year = {2014},
url = {https://doi.org/10.1145/2591796.2591869},
doi = {10.1145/2591796.2591869},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/HenzingerKN14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/DvorakH14,
author = {Wolfgang Dvor{\'{a}}k and
Monika Henzinger},
editor = {Evripidis Bampis and
Ola Svensson},
title = {Online Ad Assignment with an Ad Exchange},
booktitle = {Approximation and Online Algorithms - 12th International Workshop,
{WAOA} 2014, Wroc{\l}aw, Poland, September 11-12, 2014, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {8952},
pages = {156--167},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-18263-6\_14},
doi = {10.1007/978-3-319-18263-6\_14},
timestamp = {Thu, 23 Sep 2021 11:48:40 +0200},
biburl = {https://dblp.org/rec/conf/waoa/DvorakH14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wine/CiglerDHS14,
author = {Ludek Cigler and
Wolfgang Dvor{\'{a}}k and
Monika Henzinger and
Martin Starnberger},
editor = {Tie{-}Yan Liu and
Qi Qi and
Yinyu Ye},
title = {Limiting Price Discrimination when Selling Products with Positive
Network Externalities},
booktitle = {Web and Internet Economics - 10th International Conference, {WINE}
2014, Beijing, China, December 14-17, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8877},
pages = {44--57},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-13129-0\_4},
doi = {10.1007/978-3-319-13129-0\_4},
timestamp = {Sun, 18 Dec 2022 19:02:44 +0100},
biburl = {https://dblp.org/rec/conf/wine/CiglerDHS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/CharikarHN14,
author = {Moses Charikar and
Monika Henzinger and
Huy L. Nguyen},
title = {Online Bipartite Matching with Decomposable Weights},
journal = {CoRR},
volume = {abs/1409.2139},
year = {2014},
url = {http://arxiv.org/abs/1409.2139},
eprinttype = {arXiv},
eprint = {1409.2139},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/CharikarHN14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ChatterjeeHL14,
author = {Krishnendu Chatterjee and
Monika Henzinger and
Veronika Loitzenbauer},
title = {Improved Algorithms for One-Pair and k-Pair Streett Objectives},
journal = {CoRR},
volume = {abs/1410.0833},
year = {2014},
url = {http://arxiv.org/abs/1410.0833},
eprinttype = {arXiv},
eprint = {1410.0833},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/ChatterjeeHL14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BhattacharyaHI14,
author = {Sayan Bhattacharya and
Monika Henzinger and
Giuseppe F. Italiano},
title = {Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching},
journal = {CoRR},
volume = {abs/1412.1318},
year = {2014},
url = {http://arxiv.org/abs/1412.1318},
eprinttype = {arXiv},
eprint = {1412.1318},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BhattacharyaHI14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/HenzingerKL14,
author = {Monika Henzinger and
Sebastian Krinninger and
Veronika Loitzenbauer},
title = {Finding 2-edge and 2-vertex strongly connected components in quadratic
time},
journal = {CoRR},
volume = {abs/1412.6466},
year = {2014},
url = {http://arxiv.org/abs/1412.6466},
eprinttype = {arXiv},
eprint = {1412.6466},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/HenzingerKL14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/fmsd/ChatterjeeHJS13,
author = {Krishnendu Chatterjee and
Monika Henzinger and
Manas Joglekar and
Nisarg Shah},
title = {Symbolic algorithms for qualitative analysis of Markov decision processes
with B{\"{u}}chi objectives},
journal = {Formal Methods Syst. Des.},
volume = {42},
number = {3},
pages = {301--327},
year = {2013},
url = {https://doi.org/10.1007/s10703-012-0180-2},
doi = {10.1007/S10703-012-0180-2},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/fmsd/ChatterjeeHJS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/AcetoHS13,
author = {Luca Aceto and
Monika Henzinger and
Jir{\'{\i}} Sgall},
title = {38th International Colloquium on Automata, Languages and Programming},
journal = {Inf. Comput.},
volume = {222},
pages = {1},
year = {2013},
url = {https://doi.org/10.1016/j.ic.2012.11.002},
doi = {10.1016/J.IC.2012.11.002},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/AcetoHS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DuttingHW13,
author = {Paul D{\"{u}}tting and
Monika Henzinger and
Ingmar Weber},
title = {Sponsored search, market equilibria, and the Hungarian Method},
journal = {Inf. Process. Lett.},
volume = {113},
number = {3},
pages = {67--73},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2012.11.006},
doi = {10.1016/J.IPL.2012.11.006},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/DuttingHW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DuttingHW13,
author = {Paul D{\"{u}}tting and
Monika Henzinger and
Ingmar Weber},
title = {Bidder optimal assignments for general utilities},
journal = {Theor. Comput. Sci.},
volume = {478},
pages = {22--32},
year = {2013},
url = {https://doi.org/10.1016/j.tcs.2013.01.030},
doi = {10.1016/J.TCS.2013.01.030},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/DuttingHW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tweb/BaykanHW13,
author = {Eda Baykan and
Monika Henzinger and
Ingmar Weber},
title = {A Comprehensive Study of Techniques for URL-Based Web Page Language
Classification},
journal = {{ACM} Trans. Web},
volume = {7},
number = {1},
pages = {3:1--3:37},
year = {2013},
url = {https://doi.org/10.1145/2435215.2435218},
doi = {10.1145/2435215.2435218},
timestamp = {Mon, 11 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tweb/BaykanHW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/DvorakHW13,
author = {Wolfgang Dvor{\'{a}}k and
Monika Henzinger and
David P. Williamson},
editor = {Hans L. Bodlaender and
Giuseppe F. Italiano},
title = {Maximizing a Submodular Function with Viability Constraints},
booktitle = {Algorithms - {ESA} 2013 - 21st Annual European Symposium, Sophia Antipolis,
France, September 2-4, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8125},
pages = {409--420},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-40450-4\_35},
doi = {10.1007/978-3-642-40450-4\_35},
timestamp = {Mon, 03 Jan 2022 22:19:39 +0100},
biburl = {https://dblp.org/rec/conf/esa/DvorakHW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/HenzingerKN13,
author = {Monika Henzinger and
Sebastian Krinninger and
Danupon Nanongkai},
title = {Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(mn) Barrier
and Derandomization},
booktitle = {54th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
2013, 26-29 October, 2013, Berkeley, CA, {USA}},
pages = {538--547},
publisher = {{IEEE} Computer Society},
year = {2013},
url = {https://doi.org/10.1109/FOCS.2013.64},
doi = {10.1109/FOCS.2013.64},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/HenzingerKN13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/HenzingerKN13,
author = {Monika Henzinger and
Sebastian Krinninger and
Danupon Nanongkai},
editor = {Fedor V. Fomin and
Rusins Freivalds and
Marta Z. Kwiatkowska and
David Peleg},
title = {Sublinear-Time Maintenance of Breadth-First Spanning Tree in Partially
Dynamic Networks},
booktitle = {Automata, Languages, and Programming - 40th International Colloquium,
{ICALP} 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part {II}},
series = {Lecture Notes in Computer Science},
volume = {7966},
pages = {607--619},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-39212-2\_53},
doi = {10.1007/978-3-642-39212-2\_53},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/HenzingerKN13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wine/DuttingHS13,
author = {Paul D{\"{u}}tting and
Monika Henzinger and
Martin Starnberger},
editor = {Yiling Chen and
Nicole Immorlica},
title = {Valuation Compressions in VCG-Based Combinatorial Auctions},
booktitle = {Web and Internet Economics - 9th International Conference, {WINE}
2013, Cambridge, MA, USA, December 11-14, 2013, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8289},
pages = {146--159},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-45046-4\_13},
doi = {10.1007/978-3-642-45046-4\_13},
timestamp = {Thu, 12 Aug 2021 18:47:48 +0200},
biburl = {https://dblp.org/rec/conf/wine/DuttingHS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:journals/corr/ChatterjeeHKL13,
author = {Krishnendu Chatterjee and
Monika Henzinger and
Sebastian Krinninger and
Veronika Loitzenbauer},
editor = {Gabriele Puppis and
Tiziano Villa},
title = {Approximating the minimum cycle mean},
booktitle = {Proceedings Fourth International Symposium on Games, Automata, Logics
and Formal Verification, GandALF 2013, Borca di Cadore, Dolomites,
Italy, 29-31th August 2013},
series = {{EPTCS}},
volume = {119},
pages = {136--149},
year = {2013},
url = {https://doi.org/10.4204/EPTCS.119.13},
doi = {10.4204/EPTCS.119.13},
timestamp = {Fri, 27 Mar 2020 08:38:57 +0100},
biburl = {https://dblp.org/rec/journals/corr/ChatterjeeHKL13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/HenzingerKN13,
author = {Monika Henzinger and
Sebastian Krinninger and
Danupon Nanongkai},
title = {Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(mn) Barrier
and Derandomization},
journal = {CoRR},
volume = {abs/1308.0776},
year = {2013},
url = {http://arxiv.org/abs/1308.0776},
eprinttype = {arXiv},
eprint = {1308.0776},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/HenzingerKN13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/DuettingHS13,
author = {Paul Duetting and
Monika Henzinger and
Martin Starnberger},
title = {Valuation Compressions in VCG-Based Combinatorial Auctions},
journal = {CoRR},
volume = {abs/1310.3153},
year = {2013},
url = {http://arxiv.org/abs/1310.3153},
eprinttype = {arXiv},
eprint = {1310.3153},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/DuettingHS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eatcs/Henzinger12,
author = {Monika Henzinger},
title = {The Presburger Award 2013: Call for Nominations},
journal = {Bull. {EATCS}},
volume = {108},
pages = {22--23},
year = {2012},
url = {http://eatcs.org/beatcs/index.php/beatcs/article/view/47},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eatcs/Henzinger12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cikm/DuttingHW12,
author = {Paul D{\"{u}}tting and
Monika Henzinger and
Ingmar Weber},
editor = {Xue{-}wen Chen and
Guy Lebanon and
Haixun Wang and
Mohammed J. Zaki},
title = {Maximizing revenue from strategic recommendations under decaying trust},
booktitle = {21st {ACM} International Conference on Information and Knowledge Management,
CIKM'12, Maui, HI, USA, October 29 - November 02, 2012},
pages = {2283--2286},
publisher = {{ACM}},
year = {2012},
url = {https://doi.org/10.1145/2396761.2398621},
doi = {10.1145/2396761.2398621},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cikm/DuttingHW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/ChatterjeeHKN12,
author = {Krishnendu Chatterjee and
Monika Henzinger and
Sebastian Krinninger and
Danupon Nanongkai},
editor = {Leah Epstein and
Paolo Ferragina},
title = {Polynomial-Time Algorithms for Energy Games with Special Weight Structures},
booktitle = {Algorithms - {ESA} 2012 - 20th Annual European Symposium, Ljubljana,
Slovenia, September 10-12, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7501},
pages = {301--312},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-33090-2\_27},
doi = {10.1007/978-3-642-33090-2\_27},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/ChatterjeeHKN12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BaldeschiHLS12,
author = {Riccardo Colini{-}Baldeschi and
Monika Henzinger and
Stefano Leonardi and
Martin Starnberger},
editor = {Artur Czumaj and
Kurt Mehlhorn and
Andrew M. Pitts and
Roger Wattenhofer},
title = {On Multiple Keyword Sponsored Search Auctions with Budgets},
booktitle = {Automata, Languages, and Programming - 39th International Colloquium,
{ICALP} 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part {II}},
series = {Lecture Notes in Computer Science},
volume = {7392},
pages = {1--12},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-31585-5\_1},
doi = {10.1007/978-3-642-31585-5\_1},
timestamp = {Tue, 27 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icalp/BaldeschiHLS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ChatterjeeH12,
author = {Krishnendu Chatterjee and
Monika Henzinger},
editor = {Yuval Rabani},
title = {An \emph{O}(\emph{n}\({}^{\mbox{2}}\)) time algorithm for alternating
B{\"{u}}chi games},
booktitle = {Proceedings of the Twenty-Third Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2012, Kyoto, Japan, January 17-19, 2012},
pages = {1386--1399},
publisher = {{SIAM}},
year = {2012},
url = {https://doi.org/10.1137/1.9781611973099.109},
doi = {10.1137/1.9781611973099.109},
timestamp = {Tue, 02 Feb 2021 17:07:31 +0100},
biburl = {https://dblp.org/rec/conf/soda/ChatterjeeH12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wine/DuttingHS12,
author = {Paul D{\"{u}}tting and
Monika Henzinger and
Martin Starnberger},
editor = {Paul W. Goldberg},
title = {Auctions with Heterogeneous Items and Budget Limits},
booktitle = {Internet and Network Economics - 8th International Workshop, {WINE}
2012, Liverpool, UK, December 10-12, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7695},
pages = {44--57},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-35311-6\_4},
doi = {10.1007/978-3-642-35311-6\_4},
timestamp = {Tue, 14 May 2019 10:00:36 +0200},
biburl = {https://dblp.org/rec/conf/wine/DuttingHS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1209-6448,
author = {Paul D{\"{u}}tting and
Monika Henzinger and
Martin Starnberger},
title = {Auctions with Heterogeneous Items and Budget Limits},
journal = {CoRR},
volume = {abs/1209.6448},
year = {2012},
url = {http://arxiv.org/abs/1209.6448},
eprinttype = {arXiv},
eprint = {1209.6448},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1209-6448.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DuttingHW11,
author = {Paul D{\"{u}}tting and
Monika Henzinger and
Ingmar Weber},
title = {Offline file assignments for online load balancing},
journal = {Inf. Process. Lett.},
volume = {111},
number = {4},
pages = {178--183},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2010.11.022},
doi = {10.1016/J.IPL.2010.11.022},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DuttingHW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tweb/BaykanHMW11,
author = {Eda Baykan and
Monika Henzinger and
Ludmila Marian and
Ingmar Weber},
title = {A Comprehensive Study of Features and Algorithms for URL-Based Topic
Classification},
journal = {{ACM} Trans. Web},
volume = {5},
number = {3},
pages = {15:1--15:29},
year = {2011},
url = {https://doi.org/10.1145/1993053.1993057},
doi = {10.1145/1993053.1993057},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tweb/BaykanHMW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cav/ChatterjeeHJS11,
author = {Krishnendu Chatterjee and
Monika Henzinger and
Manas Joglekar and
Nisarg Shah},
editor = {Ganesh Gopalakrishnan and
Shaz Qadeer},
title = {Symbolic Algorithms for Qualitative Analysis of Markov Decision Processes
with B{\"{u}}chi Objectives},
booktitle = {Computer Aided Verification - 23rd International Conference, {CAV}
2011, Snowbird, UT, USA, July 14-20, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6806},
pages = {260--276},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22110-1\_21},
doi = {10.1007/978-3-642-22110-1\_21},
timestamp = {Tue, 14 May 2019 10:00:43 +0200},
biburl = {https://dblp.org/rec/conf/cav/ChatterjeeHJS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/HenzingerV11,
author = {Monika Henzinger and
Angelina Vidali},
editor = {Camil Demetrescu and
Magn{\'{u}}s M. Halld{\'{o}}rsson},
title = {Multi-parameter Mechanism Design under Budget and Matroid Constraints},
booktitle = {Algorithms - {ESA} 2011 - 19th Annual European Symposium, Saarbr{\"{u}}cken,
Germany, September 5-9, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6942},
pages = {192--202},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-23719-5\_17},
doi = {10.1007/978-3-642-23719-5\_17},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/HenzingerV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ChatterjeeH11,
author = {Krishnendu Chatterjee and
Monika Henzinger},
editor = {Dana Randall},
title = {Faster and Dynamic Algorithms for Maximal End-Component Decomposition
and Related Graph Problems in Probabilistic Verification},
booktitle = {Proceedings of the Twenty-Second Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2011, San Francisco, California, USA, January 23-25,
2011},
pages = {1318--1336},
publisher = {{SIAM}},
year = {2011},
url = {https://doi.org/10.1137/1.9781611973082.101},
doi = {10.1137/1.9781611973082.101},
timestamp = {Tue, 02 Feb 2021 17:07:23 +0100},
biburl = {https://dblp.org/rec/conf/soda/ChatterjeeH11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/www/DuttingHW11,
author = {Paul D{\"{u}}tting and
Monika Henzinger and
Ingmar Weber},
editor = {Sadagopan Srinivasan and
Krithi Ramamritham and
Arun Kumar and
M. P. Ravindra and
Elisa Bertino and
Ravi Kumar},
title = {An expressive mechanism for auctions on the web},
booktitle = {Proceedings of the 20th International Conference on World Wide Web,
{WWW} 2011, Hyderabad, India, March 28 - April 1, 2011},
pages = {127--136},
publisher = {{ACM}},
year = {2011},
url = {https://doi.org/10.1145/1963405.1963427},
doi = {10.1145/1963405.1963427},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/www/DuttingHW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/icalp/2011-1,
editor = {Luca Aceto and
Monika Henzinger and
Jir{\'{\i}} Sgall},
title = {Automata, Languages and Programming - 38th International Colloquium,
{ICALP} 2011, Zurich, Switzerland, July 4-8, 2011, Proceedings, Part
{I}},
series = {Lecture Notes in Computer Science},
volume = {6755},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22006-7},
doi = {10.1007/978-3-642-22006-7},
isbn = {978-3-642-22005-0},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/2011-1.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/icalp/2011-2,
editor = {Luca Aceto and
Monika Henzinger and
Jir{\'{\i}} Sgall},
title = {Automata, Languages and Programming - 38th International Colloquium,
{ICALP} 2011, Zurich, Switzerland, July 4-8, 2011, Proceedings, Part
{II}},
series = {Lecture Notes in Computer Science},
volume = {6756},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22012-8},
doi = {10.1007/978-3-642-22012-8},
isbn = {978-3-642-22011-1},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/2011-2.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1104-3348,
author = {Krishnendu Chatterjee and
Monika Henzinger and
Manas Joglekar and
Nisarg Shah},
title = {Symbolic Algorithms for Qualitative Analysis of Markov Decision Processes
with B{\"{u}}chi Objectives},
journal = {CoRR},
volume = {abs/1104.3348},
year = {2011},
url = {http://arxiv.org/abs/1104.3348},
eprinttype = {arXiv},
eprint = {1104.3348},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1104-3348.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1109-5018,
author = {Krishnendu Chatterjee and
Monika Henzinger},
title = {An O(n{\^{}}2) Time Algorithm for Alternating B{\"{u}}chi Games},
journal = {CoRR},
volume = {abs/1109.5018},
year = {2011},
url = {http://arxiv.org/abs/1109.5018},
eprinttype = {arXiv},
eprint = {1109.5018},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1109-5018.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1112-6361,
author = {Riccardo Colini{-}Baldeschi and
Monika Henzinger and
Stefano Leonardi and
Martin Starnberger},
title = {On Multiple Round Sponsored Search Auctions with Budgets},
journal = {CoRR},
volume = {abs/1112.6361},
year = {2011},
url = {http://arxiv.org/abs/1112.6361},
eprinttype = {arXiv},
eprint = {1112.6361},
timestamp = {Tue, 27 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1112-6361.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scientometrics/HenzingerSW10,
author = {Monika Henzinger and
Jacob Su{\~{n}}ol and
Ingmar Weber},
title = {The stability of the \emph{h}-index},
journal = {Scientometrics},
volume = {84},
number = {2},
pages = {465--479},
year = {2010},
url = {https://doi.org/10.1007/s11192-009-0098-7},
doi = {10.1007/S11192-009-0098-7},
timestamp = {Fri, 17 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scientometrics/HenzingerSW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/DuttingH10,
author = {Paul D{\"{u}}tting and
Monika Henzinger},
editor = {Tiziana Calamoneri and
Josep D{\'{\i}}az},
title = {Mechanisms for the Marriage and the Assignment Game},
booktitle = {Algorithms and Complexity, 7th International Conference, {CIAC} 2010,
Rome, Italy, May 26-28, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6078},
pages = {6--12},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13073-1\_2},
doi = {10.1007/978-3-642-13073-1\_2},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/ciac/DuttingH10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/FeldmanHKMS10,
author = {Jon Feldman and
Monika Henzinger and
Nitish Korula and
Vahab S. Mirrokni and
Clifford Stein},
editor = {Mark de Berg and
Ulrich Meyer},
title = {Online Stochastic Packing Applied to Display Ad Allocation},
booktitle = {Algorithms - {ESA} 2010, 18th Annual European Symposium, Liverpool,
UK, September 6-8, 2010. Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {6346},
pages = {182--194},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-15775-2\_16},
doi = {10.1007/978-3-642-15775-2\_16},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/FeldmanHKMS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/DuttingHW10,
author = {Paul D{\"{u}}tting and
Monika Henzinger and
Ingmar Weber},
editor = {Jean{-}Yves Marion and
Thomas Schwentick},
title = {Sponsored Search, Market Equilibria, and the Hungarian Method},
booktitle = {27th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2010, March 4-6, 2010, Nancy, France},
series = {LIPIcs},
volume = {5},
pages = {287--298},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2010},
url = {https://doi.org/10.4230/LIPIcs.STACS.2010.2463},
doi = {10.4230/LIPICS.STACS.2010.2463},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/stacs/DuttingHW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/www/DuttingHW10,
author = {Paul D{\"{u}}tting and
Monika Henzinger and
Ingmar Weber},
editor = {Michael Rappa and
Paul Jones and
Juliana Freire and
Soumen Chakrabarti},
title = {How much is your personal recommendation worth?},
booktitle = {Proceedings of the 19th International Conference on World Wide Web,
{WWW} 2010, Raleigh, North Carolina, USA, April 26-30, 2010},
pages = {1085--1086},
publisher = {{ACM}},
year = {2010},
url = {https://doi.org/10.1145/1772690.1772816},
doi = {10.1145/1772690.1772816},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/www/DuttingHW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1001-5076,
author = {Jon Feldman and
Monika Henzinger and
Nitish Korula and
Vahab S. Mirrokni and
Clifford Stein},
title = {Online Stochastic Ad Allocation: Efficiency and Fairness},
journal = {CoRR},
volume = {abs/1001.5076},
year = {2010},
url = {http://arxiv.org/abs/1001.5076},
eprinttype = {arXiv},
eprint = {1001.5076},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1001-5076.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BaykanHKCK09,
author = {Eda Baykan and
Monika Henzinger and
Stefan F. Keller and
Sebastian De Castelberg and
Markus Kinzler},
editor = {Susanne Albers and
Jean{-}Yves Marion},
title = {A Comparison of Techniques for Sampling Web Pages},
booktitle = {26th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2009, February 26-28, 2009, Freiburg, Germany, Proceedings},
series = {LIPIcs},
volume = {3},
pages = {13--30},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany},
year = {2009},
url = {https://doi.org/10.4230/LIPIcs.STACS.2009.1809},
doi = {10.4230/LIPICS.STACS.2009.1809},
timestamp = {Thu, 04 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/BaykanHKCK09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wine/DuttingHW09,
author = {Paul D{\"{u}}tting and
Monika Henzinger and
Ingmar Weber},
editor = {Stefano Leonardi},
title = {Bidder Optimal Assignments for General Utilities},
booktitle = {Internet and Network Economics, 5th International Workshop, {WINE}
2009, Rome, Italy, December 14-18, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5929},
pages = {575--582},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-10841-9\_58},
doi = {10.1007/978-3-642-10841-9\_58},
timestamp = {Thu, 04 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wine/DuttingHW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/www/HamidBCH09,
author = {Ossama Abdel Hamid and
Behshad Behzadi and
Stefan Christoph and
Monika Henzinger},
editor = {Juan Quemada and
Gonzalo Le{\'{o}}n and
Yo{\"{e}}lle S. Maarek and
Wolfgang Nejdl},
title = {Detecting the origin of text segments efficiently},
booktitle = {Proceedings of the 18th International Conference on World Wide Web,
{WWW} 2009, Madrid, Spain, April 20-24, 2009},
pages = {61--70},
publisher = {{ACM}},
year = {2009},
url = {https://doi.org/10.1145/1526709.1526719},
doi = {10.1145/1526709.1526719},
timestamp = {Thu, 04 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/www/HamidBCH09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/www/BaykanHMW09,
author = {Eda Baykan and
Monika Henzinger and
Ludmila Marian and
Ingmar Weber},
editor = {Juan Quemada and
Gonzalo Le{\'{o}}n and
Yo{\"{e}}lle S. Maarek and
Wolfgang Nejdl},
title = {Purely URL-based topic classification},
booktitle = {Proceedings of the 18th International Conference on World Wide Web,
{WWW} 2009, Madrid, Spain, April 20-24, 2009},
pages = {1109--1110},
publisher = {{ACM}},
year = {2009},
url = {https://doi.org/10.1145/1526709.1526880},
doi = {10.1145/1526709.1526880},
timestamp = {Thu, 04 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/www/BaykanHMW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0902-1604,
author = {Eda Baykan and
Monika Henzinger and
Stefan F. Keller and
Sebastian De Castelberg and
Markus Kinzler},
title = {A Comparison of Techniques for Sampling Web Pages},
journal = {CoRR},
volume = {abs/0902.1604},
year = {2009},
url = {http://arxiv.org/abs/0902.1604},
eprinttype = {arXiv},
eprint = {0902.1604},
timestamp = {Thu, 04 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0902-1604.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0911-1619,
author = {Paul D{\"{u}}tting and
Monika Henzinger and
Ingmar Weber},
title = {On the Pricing of Recommendations and Recommending Strategically},
journal = {CoRR},
volume = {abs/0911.1619},
year = {2009},
url = {http://arxiv.org/abs/0911.1619},
eprinttype = {arXiv},
eprint = {0911.1619},
timestamp = {Thu, 04 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0911-1619.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0912-1934,
author = {Paul D{\"{u}}tting and
Monika Henzinger and
Ingmar Weber},
title = {Sponsored Search, Market Equilibria, and the Hungarian Method},
journal = {CoRR},
volume = {abs/0912.1934},
year = {2009},
url = {http://arxiv.org/abs/0912.1934},
eprinttype = {arXiv},
eprint = {0912.1934},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0912-1934.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/pvldb/BaykanHW08,
author = {Eda Baykan and
Monika Henzinger and
Ingmar Weber},
title = {Web page language identification based on URLs},
journal = {Proc. {VLDB} Endow.},
volume = {1},
number = {1},
pages = {176--187},
year = {2008},
url = {http://www.vldb.org/pvldb/vol1/1453880.pdf},
doi = {10.14778/1453856.1453880},
timestamp = {Thu, 04 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/pvldb/BaykanHW08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sigact/AggarwalACEFFHMNPSS08,
author = {Gagan Aggarwal and
Nir Ailon and
Florin Constantin and
Eyal Even{-}Dar and
Jon Feldman and
Gereon Frahling and
Monika Rauch Henzinger and
S. Muthukrishnan and
Noam Nisan and
Martin P{\'{a}}l and
Mark Sandler and
Anastasios Sidiropoulos},
title = {Theory research at Google},
journal = {{SIGACT} News},
volume = {39},
number = {2},
pages = {10--28},
year = {2008},
url = {https://doi.org/10.1145/1388240.1388242},
doi = {10.1145/1388240.1388242},
timestamp = {Fri, 07 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/sigact/AggarwalACEFFHMNPSS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/algo/Henzinger08,
author = {Monika Henzinger},
editor = {Ming{-}Yang Kao},
title = {PageRank Algorithm},
booktitle = {Encyclopedia of Algorithms - 2008 Edition},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-0-387-30162-4\_277},
doi = {10.1007/978-0-387-30162-4\_277},
timestamp = {Thu, 04 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/reference/algo/Henzinger08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Henzinger07,
author = {Monika Henzinger},
editor = {Nikhil Bansal and
Kirk Pruhs and
Clifford Stein},
title = {Combinatorial algorithms for web search engines: three success stories},
booktitle = {Proceedings of the Eighteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2007, New Orleans, Louisiana, USA, January 7-9,
2007},
pages = {1022--1026},
publisher = {{SIAM}},
year = {2007},
url = {http://dl.acm.org/citation.cfm?id=1283383.1283493},
timestamp = {Thu, 04 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/Henzinger07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sigir/Henzinger06,
author = {Monika Henzinger},
editor = {Efthimis N. Efthimiadis and
Susan T. Dumais and
David Hawking and
Kalervo J{\"{a}}rvelin},
title = {Finding near-duplicate web pages: a large-scale evaluation of algorithms},
booktitle = {{SIGIR} 2006: Proceedings of the 29th Annual International {ACM} {SIGIR}
Conference on Research and Development in Information Retrieval, Seattle,
Washington, USA, August 6-11, 2006},
pages = {284--291},
publisher = {{ACM}},
year = {2006},
url = {https://doi.org/10.1145/1148170.1148222},
doi = {10.1145/1148170.1148222},
timestamp = {Thu, 04 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sigir/Henzinger06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/GoelHP05,
author = {Ashish Goel and
Monika Rauch Henzinger and
Serge A. Plotkin},
title = {An online throughput-competitive algorithm for multicast routing and
admission control},
journal = {J. Algorithms},
volume = {55},
number = {1},
pages = {1--20},
year = {2005},
url = {https://doi.org/10.1016/j.jalgor.2004.11.001},
doi = {10.1016/J.JALGOR.2004.11.001},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/GoelHP05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/www/HenzingerCMB05,
author = {Monika Henzinger and
Bay{-}Wei Chang and
Brian Milch and
Sergey Brin},
title = {Query-Free News Search},
journal = {World Wide Web},
volume = {8},
number = {2},
pages = {101--126},
year = {2005},
url = {https://doi.org/10.1007/s11280-004-4870-6},
doi = {10.1007/S11280-004-4870-6},
timestamp = {Thu, 04 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/www/HenzingerCMB05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ht/Henzinger05,
author = {Monika Henzinger},
editor = {Siegfried Reich and
Manolis Tzagarakis},
title = {Hyperlink analysis on the world wide web},
booktitle = {{HYPERTEXT} 2005, Proceedings of the 16th {ACM} Conference on Hypertext
and Hypermedia, September 6-9, 2005, Salzburg, Austria},
pages = {1--3},
publisher = {{ACM}},
year = {2005},
url = {https://doi.org/10.1145/1083356.1083357},
doi = {10.1145/1083356.1083357},
timestamp = {Thu, 04 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ht/Henzinger05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/drr/Henzinger04,
author = {Monika Henzinger},
editor = {Elisa H. Barney Smith and
Jianying Hu and
James Allan},
title = {The past, present, and future of web information retrieval},
booktitle = {Document Recognition and Retrieval XI, San Jose, California, USA,
January 18-22, 2004, Proceedings},
series = {{SPIE} Proceedings},
volume = {5296},
pages = {23--26},
publisher = {{SPIE}},
year = {2004},
url = {https://doi.org/10.1117/12.537534},
doi = {10.1117/12.537534},
timestamp = {Thu, 04 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/drr/Henzinger04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/Henzinger04,
author = {Monika Henzinger},
editor = {Susanne Albers and
Tomasz Radzik},
title = {Algorithmic Aspects of Web Search Engines},
booktitle = {Algorithms - {ESA} 2004, 12th Annual European Symposium, Bergen, Norway,
September 14-17, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3221},
pages = {3},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-30140-0\_2},
doi = {10.1007/978-3-540-30140-0\_2},
timestamp = {Thu, 04 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/Henzinger04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/Henzinger04,
author = {Monika Henzinger},
editor = {Josep D{\'{\i}}az and
Juhani Karhum{\"{a}}ki and
Arto Lepist{\"{o}} and
Donald Sannella},
title = {The Past, Present, and Future of Web Search Engines p},
booktitle = {Automata, Languages and Programming: 31st International Colloquium,
{ICALP} 2004, Turku, Finland, July 12-16, 2004. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3142},
pages = {3},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-27836-8\_2},
doi = {10.1007/978-3-540-27836-8\_2},
timestamp = {Thu, 04 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/Henzinger04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/pods/Henzinger04,
author = {Monika Henzinger},
editor = {Catriel Beeri and
Alin Deutsch},
title = {The Past, Present and Future of Web Information Retrieval},
booktitle = {Proceedings of the Twenty-third {ACM} {SIGACT-SIGMOD-SIGART} Symposium
on Principles of Database Systems, June 14-16, 2004, Paris, France},
pages = {46},
publisher = {{ACM}},
year = {2004},
url = {https://doi.org/10.1145/1055558.1055566},
doi = {10.1145/1055558.1055566},
timestamp = {Thu, 04 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/pods/Henzinger04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/crc/Henzinger04,
author = {Monika Henzinger},
editor = {Dinesh P. Mehta and
Sartaj Sahni},
title = {Data Structures in Web Information Retrieval},
booktitle = {Handbook of Data Structures and Applications},
publisher = {Chapman and Hall/CRC},
year = {2004},
url = {https://doi.org/10.1201/9781420035179.ch50},
doi = {10.1201/9781420035179.CH50},
timestamp = {Thu, 19 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/reference/crc/Henzinger04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/im/Henzinger03,
author = {Monika Rauch Henzinger},
title = {Algorithmic Challenges in Web Search Engines},
journal = {Internet Math.},
volume = {1},
number = {1},
pages = {115--123},
year = {2003},
url = {https://doi.org/10.1080/15427951.2004.10129079},
doi = {10.1080/15427951.2004.10129079},
timestamp = {Sun, 17 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/im/Henzinger03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/GoelHPT03,
author = {Ashish Goel and
Monika Rauch Henzinger and
Serge A. Plotkin and
{\'{E}}va Tardos},
title = {Scheduling data transfers in a network and the set scheduling problem},
journal = {J. Algorithms},
volume = {48},
number = {2},
pages = {314--332},
year = {2003},
url = {https://doi.org/10.1016/S0196-6774(03)00054-3},
doi = {10.1016/S0196-6774(03)00054-3},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/GoelHPT03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/HenzingerL03,
author = {Monika Rauch Henzinger and
Stefano Leonardi},
title = {Scheduling multicasts on unit-capacity trees and meshes},
journal = {J. Comput. Syst. Sci.},
volume = {66},
number = {3},
pages = {567--611},
year = {2003},
url = {https://doi.org/10.1016/S0022-0000(03)00043-6},
doi = {10.1016/S0022-0000(03)00043-6},
timestamp = {Tue, 27 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/HenzingerL03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ijcai/HenzingerMS03,
author = {Monika Rauch Henzinger and
Rajeev Motwani and
Craig Silverstein},
editor = {Georg Gottlob and
Toby Walsh},
title = {Challenges in Web Search Engines},
booktitle = {IJCAI-03, Proceedings of the Eighteenth International Joint Conference
on Artificial Intelligence, Acapulco, Mexico, August 9-15, 2003},
pages = {1573--1579},
publisher = {Morgan Kaufmann},
year = {2003},
url = {http://ijcai.org/Proceedings/03/Papers/278.pdf},
timestamp = {Thu, 02 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ijcai/HenzingerMS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/schule/Henzinger03,
author = {Monika Henzinger},
editor = {Peter Hubwieser},
title = {The Past, Present and Future of Web Information Retrieval},
booktitle = {Informatische Fachkonzepte im Unterricht, {INFOS} 2003, 10. GI-Fachtagung
Informatik und Schule, 17.-19. September 2003 in Garching bei M{\"{u}}nchen},
series = {{LNI}},
volume = {{P-32}},
pages = {52},
publisher = {{GI}},
year = {2003},
url = {https://dl.gi.de/handle/20.500.12116/29856},
timestamp = {Thu, 04 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/schule/Henzinger03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/www/HenzingerCMB03,
author = {Monika Henzinger and
Bay{-}Wei Chang and
Brian Milch and
Sergey Brin},
editor = {Guszt{\'{a}}v Hencsey and
Bebo White and
Yih{-}Farn Robin Chen and
L{\'{a}}szl{\'{o}} Kov{\'{a}}cs and
Steve Lawrence},
title = {Query-free news search},
booktitle = {Proceedings of the Twelfth International World Wide Web Conference,
{WWW} 2003, Budapest, Hungary, May 20-24, 2003},
pages = {1--10},
publisher = {{ACM}},
year = {2003},
url = {https://doi.org/10.1145/775152.775154},
doi = {10.1145/775152.775154},
timestamp = {Thu, 04 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/www/HenzingerCMB03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sigir/HenzingerMS02,
author = {Monika Rauch Henzinger and
Rajeev Motwani and
Craig Silverstein},
title = {Challenges in web search engines},
journal = {{SIGIR} Forum},
volume = {36},
number = {2},
pages = {11--22},
year = {2002},
url = {https://doi.org/10.1145/792550.792553},
doi = {10.1145/792550.792553},
timestamp = {Thu, 02 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/sigir/HenzingerMS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cluster/Henzinger02,
author = {Monika Henzinger},
title = {Indexing the Web - {A} Challenge for Supercomputers},
booktitle = {2002 {IEEE} International Conference on Cluster Computing {(CLUSTER}
2002), 23-26 September 2002, Chicago, IL, {USA}},
pages = {343},
publisher = {{IEEE} Computer Society},
year = {2002},
url = {https://doi.org/10.1109/CLUSTR.2002.1137763},
doi = {10.1109/CLUSTR.2002.1137763},
timestamp = {Thu, 04 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cluster/Henzinger02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/internet/Henzinger01,
author = {Monika Rauch Henzinger},
title = {Hyperlink Analysis for the Web},
journal = {{IEEE} Internet Comput.},
volume = {5},
number = {1},
pages = {45--50},
year = {2001},
url = {https://doi.org/10.1109/4236.895141},
doi = {10.1109/4236.895141},
timestamp = {Fri, 13 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/internet/Henzinger01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/HenzingerK01,
author = {Monika Rauch Henzinger and
Valerie King},
title = {Maintaining Minimum Spanning Forests in Dynamic Graphs},
journal = {{SIAM} J. Comput.},
volume = {31},
number = {2},
pages = {364--374},
year = {2001},
url = {https://doi.org/10.1137/S0097539797327209},
doi = {10.1137/S0097539797327209},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/HenzingerK01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icdm/BharatCHR01,
author = {Krishna Bharat and
Bay{-}Wei Chang and
Monika Henzinger and
Matthias Ruhl},
editor = {Nick Cercone and
Tsau Young Lin and
Xindong Wu},
title = {Who Links to Whom: Mining Linkage between Web Sites},
booktitle = {Proceedings of the 2001 {IEEE} International Conference on Data Mining,
29 November - 2 December 2001, San Jose, California, {USA}},
pages = {51--58},
publisher = {{IEEE} Computer Society},
year = {2001},
url = {https://doi.org/10.1109/ICDM.2001.989500},
doi = {10.1109/ICDM.2001.989500},
timestamp = {Thu, 04 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icdm/BharatCHR01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cn/HenzingerHMN00,
author = {Monika Rauch Henzinger and
Allan Heydon and
Michael Mitzenmacher and
Marc Najork},
title = {On near-uniform {URL} sampling},
journal = {Comput. Networks},
volume = {33},
number = {1-6},
pages = {295--308},
year = {2000},
url = {https://doi.org/10.1016/S1389-1286(00)00055-4},
doi = {10.1016/S1389-1286(00)00055-4},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cn/HenzingerHMN00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/debu/Henzinger00,
author = {Monika Rauch Henzinger},
title = {Link Analysis in Web Information Retrieval},
journal = {{IEEE} Data Eng. Bull.},
volume = {23},
number = {3},
pages = {3--8},
year = {2000},
url = {http://sites.computer.org/debull/A00sept/A00SEP-CD.pdf},
timestamp = {Thu, 04 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/debu/Henzinger00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/debu/BharatBDH00,
author = {Krishna Bharat and
Andrei Z. Broder and
Jeffrey Dean and
Monika Rauch Henzinger},
title = {A Comparison of Techniques to Find Mirrored Hosts on the {WWW}},
journal = {{IEEE} Data Eng. Bull.},
volume = {23},
number = {4},
pages = {21--26},
year = {2000},
url = {http://sites.computer.org/debull/A00dec/A00DEC-CD.pdf},
timestamp = {Thu, 04 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/debu/BharatBDH00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/HenzingerRG00,
author = {Monika Rauch Henzinger and
Satish Rao and
Harold N. Gabow},
title = {Computing Vertex Connectivity: New Bounds from Old Techniques},
journal = {J. Algorithms},
volume = {34},
number = {2},
pages = {222--250},
year = {2000},
url = {https://doi.org/10.1006/jagm.1999.1055},
doi = {10.1006/JAGM.1999.1055},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/HenzingerRG00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jasis/BharatBDH00,
author = {Krishna Bharat and
Andrei Z. Broder and
Jeffrey Dean and
Monika Rauch Henzinger},
title = {A comparison of techniques to find mirrored hosts on the {WWW}},
journal = {J. Am. Soc. Inf. Sci.},
volume = {51},
number = {12},
pages = {1114--1122},
year = {2000},
url = {https://doi.org/10.1002/1097-4571(2000)9999:9999\&\#60;::AID-ASI1025\&\#62;3.0.CO;2-0},
doi = {10.1002/1097-4571(2000)9999:9999\&\#60;::AID-ASI1025\&\#62;3.0.CO;2-0},
timestamp = {Wed, 13 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jasis/BharatBDH00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AlbersH00,
author = {Susanne Albers and
Monika Rauch Henzinger},
title = {Exploring Unknown Environments},
journal = {{SIAM} J. Comput.},
volume = {29},
number = {4},
pages = {1164--1188},
year = {2000},
url = {https://doi.org/10.1137/S009753979732428X},
doi = {10.1137/S009753979732428X},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/AlbersH00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Henzinger00,
author = {Monika Rauch Henzinger},
title = {Improved Data Structures for Fully Dynamic Biconnectivity},
journal = {{SIAM} J. Comput.},
volume = {29},
number = {6},
pages = {1761--1815},
year = {2000},
url = {https://doi.org/10.1137/S0097539794263907},
doi = {10.1137/S0097539794263907},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Henzinger00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/Henzinger00,
author = {Monika Henzinger},
editor = {Mike Paterson},
title = {Web Information Retrieval - an Algorithmic Perspective},
booktitle = {Algorithms - {ESA} 2000, 8th Annual European Symposium, Saarbr{\"{u}}cken,
Germany, September 5-8, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1879},
pages = {1--8},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-45253-2\_1},
doi = {10.1007/3-540-45253-2\_1},
timestamp = {Thu, 04 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/Henzinger00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icde/Henzinger00,
author = {Monika Rauch Henzinger},
editor = {David B. Lomet and
Gerhard Weikum},
title = {Web Information Retrieval},
booktitle = {Proceedings of the 16th International Conference on Data Engineering,
San Diego, California, USA, February 28 - March 3, 2000},
pages = {693},
publisher = {{IEEE} Computer Society},
year = {2000},
url = {https://doi.org/10.1109/ICDE.2000.839498},
doi = {10.1109/ICDE.2000.839498},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icde/Henzinger00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/HenzingerKW99,
author = {Monika Rauch Henzinger and
Valerie King and
Tandy J. Warnow},
title = {Constructing a Tree from Homeomorphic Subtrees, with Applications
to Computational Evolutionary Biology},
journal = {Algorithmica},
volume = {24},
number = {1},
pages = {1--13},
year = {1999},
url = {https://doi.org/10.1007/PL00009268},
doi = {10.1007/PL00009268},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/HenzingerKW99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cn/HenzingerHMN99,
author = {Monika Rauch Henzinger and
Allan Heydon and
Michael Mitzenmacher and
Marc Najork},
title = {Measuring Index Quality Using Random Walks on the Web},
journal = {Comput. Networks},
volume = {31},
number = {11-16},
pages = {1291--1303},
year = {1999},
url = {https://doi.org/10.1016/S1389-1286(99)00016-X},
doi = {10.1016/S1389-1286(99)00016-X},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cn/HenzingerHMN99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cn/DeanH99,
author = {Jeffrey Dean and
Monika Rauch Henzinger},
title = {Finding Related Pages in the World Wide Web},
journal = {Comput. Networks},
volume = {31},
number = {11-16},
pages = {1467--1479},
year = {1999},
url = {https://doi.org/10.1016/S1389-1286(99)00022-5},
doi = {10.1016/S1389-1286(99)00022-5},
timestamp = {Wed, 19 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cn/DeanH99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/HenzingerK99,
author = {Monika Rauch Henzinger and
Valerie King},
title = {Randomized Fully Dynamic Graph Algorithms with Polylogarithmic Time
per Operation},
journal = {J. {ACM}},
volume = {46},
number = {4},
pages = {502--516},
year = {1999},
url = {https://doi.org/10.1145/320211.320215},
doi = {10.1145/320211.320215},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/HenzingerK99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sigir/SilversteinHMM99,
author = {Craig Silverstein and
Monika Henzinger and
Hannes Marais and
Michael Moricz},
title = {Analysis of a Very Large Web Search Engine Query Log},
journal = {{SIGIR} Forum},
volume = {33},
number = {1},
pages = {6--12},
year = {1999},
url = {https://doi.org/10.1145/331403.331405},
doi = {10.1145/331403.331405},
timestamp = {Thu, 04 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/sigir/SilversteinHMM99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dl/BharatBDH99,
author = {Krishna Bharat and
Andrei Z. Broder and
Jeffrey Dean and
Monika Rauch Henzinger},
editor = {Robert Wilensky and
Katsumi Tanaka and
Yoshinori Hara},
title = {A Comparison of Techniques to Find Mirrored Hosts on the {WWW}},
booktitle = {1999 {ACM} Digital Library Workshop on Organizing Web Space (WOWS),
August 14, 1999, at Radisson Hotel, Berkeley, CA, {USA} (in conjunction
with {ACM} DL'99)},
pages = {2--12},
year = {1999},
timestamp = {Tue, 18 Sep 2012 09:47:42 +0200},
biburl = {https://dblp.org/rec/conf/dl/BharatBDH99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/HenzingerL99,
author = {Monika Rauch Henzinger and
Stefano Leonardi},
editor = {Robert Endre Tarjan and
Tandy J. Warnow},
title = {Scheduling Multicasts on Unit-Capacity Trees and Meshes},
booktitle = {Proceedings of the Tenth Annual {ACM-SIAM} Symposium on Discrete Algorithms,
17-19 January 1999, Baltimore, Maryland, {USA}},
pages = {438--447},
publisher = {{ACM/SIAM}},
year = {1999},
url = {http://dl.acm.org/citation.cfm?id=314500.314597},
timestamp = {Tue, 27 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/HenzingerL99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GoelHPT99,
author = {Ashish Goel and
Monika Rauch Henzinger and
Serge A. Plotkin and
{\'{E}}va Tardos},
editor = {Jeffrey Scott Vitter and
Lawrence L. Larmore and
Frank Thomson Leighton},
title = {Scheduling Data Transfers in a Network and the Set Scheduling Problem},
booktitle = {Proceedings of the Thirty-First Annual {ACM} Symposium on Theory of
Computing, May 1-4, 1999, Atlanta, Georgia, {USA}},
pages = {189--197},
publisher = {{ACM}},
year = {1999},
url = {https://doi.org/10.1145/301250.301300},
doi = {10.1145/301250.301300},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/GoelHPT99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AlbertsH98,
author = {David Alberts and
Monika Rauch Henzinger},
title = {Average-Case Analysis of Dynamic Graph Algorithms},
journal = {Algorithmica},
volume = {20},
number = {1},
pages = {31--60},
year = {1998},
url = {https://doi.org/10.1007/PL00009186},
doi = {10.1007/PL00009186},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AlbertsH98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/HenzingerF98,
author = {Monika Rauch Henzinger and
Michael L. Fredman},
title = {Lower Bounds for Fully Dynamic Connectivity Problems in Graphs},
journal = {Algorithmica},
volume = {22},
number = {3},
pages = {351--362},
year = {1998},
url = {https://doi.org/10.1007/PL00009228},
doi = {10.1007/PL00009228},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/HenzingerF98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cn/BharatBHKV98,
author = {Krishna Bharat and
Andrei Z. Broder and
Monika Henzinger and
Puneet Kumar and
Suresh Venkatasubramanian},
title = {The Connectivity Server: Fast Access to Linkage Information on the
Web},
journal = {Comput. Networks},
volume = {30},
number = {1-7},
pages = {469--477},
year = {1998},
url = {https://doi.org/10.1016/S0169-7552(98)80047-0},
doi = {10.1016/S0169-7552(98)80047-0},
timestamp = {Thu, 04 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cn/BharatBHKV98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dimacs/HenzingerRR98,
author = {Monika Rauch Henzinger and
Prabhakar Raghavan and
Sridhar Rajagopalan},
editor = {James M. Abello and
Jeffrey Scott Vitter},
title = {Computing on data streams},
booktitle = {External Memory Algorithms, Proceedings of a {DIMACS} Workshop, New
Brunswick, New Jersey, USA, May 20-22, 1998},
series = {{DIMACS} Series in Discrete Mathematics and Theoretical Computer Science},
volume = {50},
pages = {107--118},
publisher = {{DIMACS/AMS}},
year = {1998},
url = {https://doi.org/10.1090/dimacs/050/05},
doi = {10.1090/DIMACS/050/05},
timestamp = {Mon, 22 May 2023 16:07:35 +0200},
biburl = {https://dblp.org/rec/conf/dimacs/HenzingerRR98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BroderH98,
author = {Andrei Z. Broder and
Monika Rauch Henzinger},
title = {Information Retrieval on the Web},
booktitle = {39th Annual Symposium on Foundations of Computer Science, {FOCS} '98,
November 8-11, 1998, Palo Alto, California, {USA}},
pages = {6},
publisher = {{IEEE} Computer Society},
year = {1998},
url = {https://doi.org/10.1109/SFCS.1998.743423},
doi = {10.1109/SFCS.1998.743423},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BroderH98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AgarwalEGH98,
author = {Pankaj K. Agarwal and
David Eppstein and
Leonidas J. Guibas and
Monika Rauch Henzinger},
title = {Parametric and Kinetic Minimum Spanning Trees},
booktitle = {39th Annual Symposium on Foundations of Computer Science, {FOCS} '98,
November 8-11, 1998, Palo Alto, California, {USA}},
pages = {596--605},
publisher = {{IEEE} Computer Society},
year = {1998},
url = {https://doi.org/10.1109/SFCS.1998.743510},
doi = {10.1109/SFCS.1998.743510},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AgarwalEGH98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sigir/BharatH98,
author = {Krishna Bharat and
Monika Rauch Henzinger},
editor = {W. Bruce Croft and
Alistair Moffat and
C. J. van Rijsbergen and
Ross Wilkinson and
Justin Zobel},
title = {Improved Algorithms for Topic Distillation in a Hyperlinked Environment},
booktitle = {{SIGIR} '98: Proceedings of the 21st Annual International {ACM} {SIGIR}
Conference on Research and Development in Information Retrieval, August
24-28 1998, Melbourne, Australia},
pages = {104--111},
publisher = {{ACM}},
year = {1998},
url = {https://doi.org/10.1145/290941.290972},
doi = {10.1145/290941.290972},
timestamp = {Tue, 06 Nov 2018 11:07:23 +0100},
biburl = {https://dblp.org/rec/conf/sigir/BharatH98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GoelHP98,
author = {Ashish Goel and
Monika Rauch Henzinger and
Serge A. Plotkin},
editor = {Howard J. Karloff},
title = {Online Throughput-Competitive Algorithm for Multicast Routing and
Admission Control},
booktitle = {Proceedings of the Ninth Annual {ACM-SIAM} Symposium on Discrete Algorithms,
25-27 January 1998, San Francisco, California, {USA}},
pages = {97--106},
publisher = {{ACM/SIAM}},
year = {1998},
url = {http://dl.acm.org/citation.cfm?id=314613.314685},
timestamp = {Thu, 05 Jul 2018 07:29:49 +0200},
biburl = {https://dblp.org/rec/conf/soda/GoelHP98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/Henzinger97,
author = {Monika Rauch Henzinger},
title = {A Static 2-Approximation Algorithm for Vertex Connectivity and Incremental
Approximation Algorithms for Edge and Vertex Connectivity},
journal = {J. Algorithms},
volume = {24},
number = {1},
pages = {194--220},
year = {1997},
url = {https://doi.org/10.1006/jagm.1997.0855},
doi = {10.1006/JAGM.1997.0855},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/Henzinger97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/HenzingerKRS97,
author = {Monika Rauch Henzinger and
Philip N. Klein and
Satish Rao and
Sairam Subramanian},
title = {Faster Shortest-Path Algorithms for Planar Graphs},
journal = {J. Comput. Syst. Sci.},
volume = {55},
number = {1},
pages = {3--23},
year = {1997},
url = {https://doi.org/10.1006/jcss.1997.1493},
doi = {10.1006/JCSS.1997.1493},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/HenzingerKRS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/HenzingerT97,
author = {Monika Rauch Henzinger and
Mikkel Thorup},
title = {Sampling to provide or to bound: With applications to fully dynamic
graph algorithms},
journal = {Random Struct. Algorithms},
volume = {11},
number = {4},
pages = {369--379},
year = {1997},
url = {https://doi.org/10.1002/(SICI)1098-2418(199712)11:4\&\#60;369::AID-RSA5\&\#62;3.0.CO;2-X},
doi = {10.1002/(SICI)1098-2418(199712)11:4\&\#60;369::AID-RSA5\&\#62;3.0.CO;2-X},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/HenzingerT97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tocs/AndersonBDGHLSVWW97,
author = {Jennifer{-}Ann M. Anderson and
Lance M. Berc and
Jeffrey Dean and
Sanjay Ghemawat and
Monika Rauch Henzinger and
Shun{-}Tak Leung and
Richard L. Sites and
Mark T. Vandevoorde and
Carl A. Waldspurger and
William E. Weihl},
title = {Continuous Profiling: Where Have All the Cycles Gone?},
journal = {{ACM} Trans. Comput. Syst.},
volume = {15},
number = {4},
pages = {357--390},
year = {1997},
url = {https://doi.org/10.1145/265924.265925},
doi = {10.1145/265924.265925},
timestamp = {Tue, 16 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tocs/AndersonBDGHLSVWW97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/HenzingerK97,
author = {Monika Rauch Henzinger and
Valerie King},
editor = {Pierpaolo Degano and
Roberto Gorrieri and
Alberto Marchetti{-}Spaccamela},
title = {Maintaining Minimum Spanning Trees in Dynamic Graphs},
booktitle = {Automata, Languages and Programming, 24th International Colloquium,
ICALP'97, Bologna, Italy, 7-11 July 1997, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1256},
pages = {594--604},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/3-540-63165-8\_214},
doi = {10.1007/3-540-63165-8\_214},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/HenzingerK97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosp/AndersonBDGHLSVWW97,
author = {Jennifer{-}Ann M. Anderson and
Lance M. Berc and
Jeffrey Dean and
Sanjay Ghemawat and
Monika Rauch Henzinger and
Shun{-}Tak Leung and
Richard L. Sites and
Mark T. Vandevoorde and
Carl A. Waldspurger and
William E. Weihl},
editor = {Michel Ban{\^{a}}tre and
Henry M. Levy and
William M. Waite},
title = {Continuous Profiling: Where Have All the Cycles Gone?},
booktitle = {Proceedings of the Sixteenth {ACM} Symposium on Operating System Principles,
{SOSP} 1997, St. Malo, France, October 5-8, 1997},
pages = {1--14},
publisher = {{ACM}},
year = {1997},
url = {https://doi.org/10.1145/268998.266637},
doi = {10.1145/268998.266637},
timestamp = {Tue, 06 Nov 2018 16:59:32 +0100},
biburl = {https://dblp.org/rec/conf/sosp/AndersonBDGHLSVWW97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AlbersH97,
author = {Susanne Albers and
Monika Rauch Henzinger},
editor = {Frank Thomson Leighton and
Peter W. Shor},
title = {Exploring Unknown Environments},
booktitle = {Proceedings of the Twenty-Ninth Annual {ACM} Symposium on the Theory
of Computing, El Paso, Texas, USA, May 4-6, 1997},
pages = {416--425},
publisher = {{ACM}},
year = {1997},
url = {https://doi.org/10.1145/258533.258630},
doi = {10.1145/258533.258630},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/AlbersH97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HenzingerW96,
author = {Monika Henzinger and
David P. Williamson},
title = {On the Number of Small Cuts in a Graph},
journal = {Inf. Process. Lett.},
volume = {59},
number = {1},
pages = {41--44},
year = {1996},
url = {https://doi.org/10.1016/0020-0190(96)00079-8},
doi = {10.1016/0020-0190(96)00079-8},
timestamp = {Thu, 04 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/HenzingerW96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/HenzingerRG96,
author = {Monika Rauch Henzinger and
Satish Rao and
Harold N. Gabow},
title = {Computing Vertex Connectivity: New Bounds from Old Techniques},
booktitle = {37th Annual Symposium on Foundations of Computer Science, {FOCS} '96,
Burlington, Vermont, USA, 14-16 October, 1996},
pages = {462--471},
publisher = {{IEEE} Computer Society},
year = {1996},
url = {https://doi.org/10.1109/SFCS.1996.548505},
doi = {10.1109/SFCS.1996.548505},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/HenzingerRG96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/HenzingerT96,
author = {Monika Rauch Henzinger and
Mikkel Thorup},
editor = {Friedhelm Meyer auf der Heide and
Burkhard Monien},
title = {Improved Sampling with Applications to Dynamic Graph Algorithms},
booktitle = {Automata, Languages and Programming, 23rd International Colloquium,
ICALP96, Paderborn, Germany, 8-12 July 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1099},
pages = {290--299},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-61440-0\_136},
doi = {10.1007/3-540-61440-0\_136},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/HenzingerT96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/HenzingerKW96,
author = {Monika Rauch Henzinger and
Valerie King and
Tandy J. Warnow},
editor = {{\'{E}}va Tardos},
title = {Constructing a Tree from Homeomorphic Subtrees, with Applications
to Computational Evolutionary Biology},
booktitle = {Proceedings of the Seventh Annual {ACM-SIAM} Symposium on Discrete
Algorithms, 28-30 January 1996, Atlanta, Georgia, {USA}},
pages = {333--340},
publisher = {{ACM/SIAM}},
year = {1996},
url = {http://dl.acm.org/citation.cfm?id=313852.314080},
timestamp = {Thu, 05 Jul 2018 07:29:31 +0200},
biburl = {https://dblp.org/rec/conf/soda/HenzingerKW96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/HenzingerT96,
author = {Monika Rauch Henzinger and
Jan Arne Telle},
editor = {Rolf G. Karlsson and
Andrzej Lingas},
title = {Faster Algorithms for the Nonemptiness of Streett Automata and for
Communication Protocol Pruning},
booktitle = {Algorithm Theory - {SWAT} '96, 5th Scandinavian Workshop on Algorithm
Theory, Reykjav{\'{\i}}k, Iceland, July 3-5, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1097},
pages = {16--27},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-61422-2\_117},
doi = {10.1007/3-540-61422-2\_117},
timestamp = {Tue, 14 May 2019 10:00:39 +0200},
biburl = {https://dblp.org/rec/conf/swat/HenzingerT96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Henzinger95,
author = {Monika Rauch Henzinger},
title = {Fully Dynamic Biconnectivity in Graphs},
journal = {Algorithmica},
volume = {13},
number = {6},
pages = {503--538},
year = {1995},
url = {https://doi.org/10.1007/BF01189067},
doi = {10.1007/BF01189067},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Henzinger95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/HenzingerP95,
author = {Monika Rauch Henzinger and
Johannes A. La Poutr{\'{e}}},
editor = {Paul G. Spirakis},
title = {Certificates and Fast Algorithms for Biconnectivity in Fully-Dynamic
Graphs},
booktitle = {Algorithms - {ESA} '95, Third Annual European Symposium, Corfu, Greece,
September 25-27, 1995, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {979},
pages = {171--184},
publisher = {Springer},
year = {1995},
url = {https://doi.org/10.1007/3-540-60313-1\_142},
doi = {10.1007/3-540-60313-1\_142},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/HenzingerP95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/HenzingerHK95,
author = {Monika Rauch Henzinger and
Thomas A. Henzinger and
Peter W. Kopke},
title = {Computing Simulations on Finite and Infinite Graphs},
booktitle = {36th Annual Symposium on Foundations of Computer Science, Milwaukee,
Wisconsin, USA, 23-25 October 1995},
pages = {453--462},
publisher = {{IEEE} Computer Society},
year = {1995},
url = {https://doi.org/10.1109/SFCS.1995.492576},
doi = {10.1109/SFCS.1995.492576},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/HenzingerHK95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/HenzingerK95,
author = {Monika Rauch Henzinger and
Valerie King},
title = {Fully Dynamic Biconnectivity and Transitive Closure},
booktitle = {36th Annual Symposium on Foundations of Computer Science, Milwaukee,
Wisconsin, USA, 23-25 October 1995},
pages = {664--672},
publisher = {{IEEE} Computer Society},
year = {1995},
url = {https://doi.org/10.1109/SFCS.1995.492668},
doi = {10.1109/SFCS.1995.492668},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/HenzingerK95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/Henzinger95,
author = {Monika Rauch Henzinger},
editor = {Zolt{\'{a}}n F{\"{u}}l{\"{o}}p and
Ferenc G{\'{e}}cseg},
title = {Approximating Minimum Cuts under Insertions},
booktitle = {Automata, Languages and Programming, 22nd International Colloquium,
ICALP95, Szeged, Hungary, July 10-14, 1995, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {944},
pages = {280--291},
publisher = {Springer},
year = {1995},
url = {https://doi.org/10.1007/3-540-60084-1\_81},
doi = {10.1007/3-540-60084-1\_81},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/Henzinger95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AlbertsH95,
author = {David Alberts and
Monika Rauch Henzinger},
editor = {Kenneth L. Clarkson},
title = {Average Case Analysis of Dynamic Graph Algorithms},
booktitle = {Proceedings of the Sixth Annual {ACM-SIAM} Symposium on Discrete Algorithms,
22-24 January 1995. San Francisco, California, {USA}},
pages = {312--321},
publisher = {{ACM/SIAM}},
year = {1995},
url = {http://dl.acm.org/citation.cfm?id=313651.313712},
timestamp = {Thu, 05 Jul 2018 07:29:25 +0200},
biburl = {https://dblp.org/rec/conf/soda/AlbertsH95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/HenzingerK95,
author = {Monika Rauch Henzinger and
Valerie King},
editor = {Frank Thomson Leighton and
Allan Borodin},
title = {Randomized dynamic graph algorithms with polylogarithmic time per
operation},
booktitle = {Proceedings of the Twenty-Seventh Annual {ACM} Symposium on Theory
of Computing, 29 May-1 June 1995, Las Vegas, Nevada, {USA}},
pages = {519--527},
publisher = {{ACM}},
year = {1995},
url = {https://doi.org/10.1145/225058.225269},
doi = {10.1145/225058.225269},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/HenzingerK95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HershbergerRS94,
author = {John Hershberger and
Monika Rauch and
Subhash Suri},
title = {Data Structures for Two-Edge Connectivity in Planar Graphs},
journal = {Theor. Comput. Sci.},
volume = {130},
number = {1},
pages = {139--161},
year = {1994},
url = {https://doi.org/10.1016/0304-3975(94)90156-2},
doi = {10.1016/0304-3975(94)90156-2},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/HershbergerRS94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Henzinger94,
author = {Monika Rauch Henzinger},
title = {Fully Dynamic Cycle-Equivalence in Graphs},
booktitle = {35th Annual Symposium on Foundations of Computer Science, Santa Fe,
New Mexico, USA, 20-22 November 1994},
pages = {744--755},
publisher = {{IEEE} Computer Society},
year = {1994},
url = {https://doi.org/10.1109/SFCS.1994.365718},
doi = {10.1109/SFCS.1994.365718},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Henzinger94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KleinRRS94,
author = {Philip N. Klein and
Satish Rao and
Monika Rauch and
Sairam Subramanian},
editor = {Frank Thomson Leighton and
Michael T. Goodrich},
title = {Faster shortest-path algorithms for planar graphs},
booktitle = {Proceedings of the Twenty-Sixth Annual {ACM} Symposium on Theory of
Computing, 23-25 May 1994, Montr{\'{e}}al, Qu{\'{e}}bec,
Canada},
pages = {27--37},
publisher = {{ACM}},
year = {1994},
url = {https://doi.org/10.1145/195058.195092},
doi = {10.1145/195058.195092},
timestamp = {Thu, 04 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/KleinRRS94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Rauch94,
author = {Monika Rauch},
editor = {Frank Thomson Leighton and
Michael T. Goodrich},
title = {Improved data structures for fully dynamic biconnectivity},
booktitle = {Proceedings of the Twenty-Sixth Annual {ACM} Symposium on Theory of
Computing, 23-25 May 1994, Montr{\'{e}}al, Qu{\'{e}}bec,
Canada},
pages = {686--695},
publisher = {{ACM}},
year = {1994},
url = {https://doi.org/10.1145/195058.195434},
doi = {10.1145/195058.195434},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Rauch94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/ItalianoPR93,
author = {Giuseppe F. Italiano and
Johannes A. La Poutr{\'{e}} and
Monika Rauch},
editor = {Thomas Lengauer},
title = {Fully Dynamic Planarity Testing in Planar Embedded Graphs (Extended
Abstract)},
booktitle = {Algorithms - {ESA} '93, First Annual European Symposium, Bad Honnef,
Germany, September 30 - October 2, 1993, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {726},
pages = {212--223},
publisher = {Springer},
year = {1993},
url = {https://doi.org/10.1007/3-540-57273-2\_57},
doi = {10.1007/3-540-57273-2\_57},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/ItalianoPR93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/MaggsR93,
author = {Bruce M. Maggs and
Monika Rauch},
editor = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Nicola Santoro and
Sue Whitesides},
title = {An Algorithm for Finding Predecessors in Integer Sets},
booktitle = {Algorithms and Data Structures, Third Workshop, {WADS} '93, Montr{\'{e}}al,
Canada, August 11-13, 1993, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {709},
pages = {483--493},
publisher = {Springer},
year = {1993},
url = {https://doi.org/10.1007/3-540-57155-8\_273},
doi = {10.1007/3-540-57155-8\_273},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/wads/MaggsR93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DixonRT92,
author = {Brandon Dixon and
Monika Rauch and
Robert Endre Tarjan},
title = {Verification and Sensitivity Analysis of Minimum Spanning Trees in
Linear Time},
journal = {{SIAM} J. Comput.},
volume = {21},
number = {6},
pages = {1184--1192},
year = {1992},
url = {https://doi.org/10.1137/0221070},
doi = {10.1137/0221070},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/DixonRT92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Rauch92,
author = {Monika Rauch},
title = {Fully Dynamic Biconnectivity in Graphs},
booktitle = {33rd Annual Symposium on Foundations of Computer Science, Pittsburgh,
Pennsylvania, USA, 24-27 October 1992},
pages = {50--59},
publisher = {{IEEE} Computer Society},
year = {1992},
url = {https://doi.org/10.1109/SFCS.1992.267819},
doi = {10.1109/SFCS.1992.267819},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Rauch92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/HershbergerRS92,
author = {John Hershberger and
Monika Rauch and
Subhash Suri},
editor = {Otto Nurmi and
Esko Ukkonen},
title = {Fully Dynamic 2-Edge-Connectivity in Planar Graphs},
booktitle = {Algorithm Theory - {SWAT} '92, Third Scandinavian Workshop on Algorithm
Theory, Helsinki, Finland, July 8-10, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {621},
pages = {233--244},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-55706-7\_20},
doi = {10.1007/3-540-55706-7\_20},
timestamp = {Tue, 14 May 2019 10:00:39 +0200},
biburl = {https://dblp.org/rec/conf/swat/HershbergerRS92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/MehlhornNR90,
author = {Kurt Mehlhorn and
Stefan N{\"{a}}her and
Monika Rauch},
title = {On the Complexity of a Game Related to the Dictionary Problem},
journal = {{SIAM} J. Comput.},
volume = {19},
number = {5},
pages = {902--906},
year = {1990},
url = {https://doi.org/10.1137/0219062},
doi = {10.1137/0219062},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/MehlhornNR90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/MehlhornNR89,
author = {Kurt Mehlhorn and
Stefan N{\"{a}}her and
Monika Rauch},
title = {On the Complexity of a Game Related to the Dictionary Problem},
booktitle = {30th Annual Symposium on Foundations of Computer Science, Research
Triangle Park, North Carolina, USA, 30 October - 1 November 1989},
pages = {546--548},
publisher = {{IEEE} Computer Society},
year = {1989},
url = {https://doi.org/10.1109/SFCS.1989.63532},
doi = {10.1109/SFCS.1989.63532},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/MehlhornNR89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
last updated on 2024-04-07 22:29 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:
