[{"citation":{"ama":"Goranci G, Henzinger M, Kiss P, Momeni A, Zöcklein G. Dynamic hierarchical j-tree decomposition and its applications. In: <i>Proceedings of the 2026 Annual ACM SIAM Symposium on Discrete Algorithms</i>. Vol 2026-January. Society for Industrial and Applied Mathematics; 2026:1128-1180. doi:<a href=\"https://doi.org/10.1137/1.9781611978971.45\">10.1137/1.9781611978971.45</a>","chicago":"Goranci, Gramoz, Monika Henzinger, Peter Kiss, Ali Momeni, and Gernot Zöcklein. “Dynamic Hierarchical J-Tree Decomposition and Its Applications.” In <i>Proceedings of the 2026 Annual ACM SIAM Symposium on Discrete Algorithms</i>, 2026–January:1128–80. Society for Industrial and Applied Mathematics, 2026. <a href=\"https://doi.org/10.1137/1.9781611978971.45\">https://doi.org/10.1137/1.9781611978971.45</a>.","ieee":"G. Goranci, M. Henzinger, P. Kiss, A. Momeni, and G. Zöcklein, “Dynamic hierarchical j-tree decomposition and its applications,” in <i>Proceedings of the 2026 Annual ACM SIAM Symposium on Discrete Algorithms</i>, 2026, vol. 2026–January, pp. 1128–1180.","mla":"Goranci, Gramoz, et al. “Dynamic Hierarchical J-Tree Decomposition and Its Applications.” <i>Proceedings of the 2026 Annual ACM SIAM Symposium on Discrete Algorithms</i>, vol. 2026–January, Society for Industrial and Applied Mathematics, 2026, pp. 1128–80, doi:<a href=\"https://doi.org/10.1137/1.9781611978971.45\">10.1137/1.9781611978971.45</a>.","apa":"Goranci, G., Henzinger, M., Kiss, P., Momeni, A., &#38; Zöcklein, G. (2026). Dynamic hierarchical j-tree decomposition and its applications. In <i>Proceedings of the 2026 Annual ACM SIAM Symposium on Discrete Algorithms</i> (Vol. 2026–January, pp. 1128–1180). Society for Industrial and Applied Mathematics. <a href=\"https://doi.org/10.1137/1.9781611978971.45\">https://doi.org/10.1137/1.9781611978971.45</a>","short":"G. Goranci, M. Henzinger, P. Kiss, A. Momeni, G. Zöcklein, in:, Proceedings of the 2026 Annual ACM SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2026, pp. 1128–1180.","ista":"Goranci G, Henzinger M, Kiss P, Momeni A, Zöcklein G. 2026. Dynamic hierarchical j-tree decomposition and its applications. Proceedings of the 2026 Annual ACM SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms vol. 2026–January, 1128–1180."},"quality_controlled":"1","OA_type":"green","volume":"2026-January","ec_funded":1,"article_processing_charge":"No","page":"1128-1180","month":"01","OA_place":"repository","publisher":"Society for Industrial and Applied Mathematics","oa":1,"date_updated":"2026-05-04T11:54:09Z","_id":"21719","status":"public","department":[{"_id":"MoHe"}],"arxiv":1,"scopus_import":"1","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2601.09139","open_access":"1"}],"oa_version":"Preprint","day":"07","author":[{"full_name":"Goranci, Gramoz","last_name":"Goranci","first_name":"Gramoz"},{"orcid":"0000-0002-5008-6530","last_name":"Henzinger","full_name":"Henzinger, Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H"},{"first_name":"Peter","full_name":"Kiss, Peter","last_name":"Kiss"},{"full_name":"Momeni, Ali","last_name":"Momeni","first_name":"Ali"},{"last_name":"Zöcklein","full_name":"Zöcklein, Gernot","id":"45d5e826-47af-11f1-84e5-ba87c23fe681","first_name":"Gernot"}],"date_published":"2026-01-07T00:00:00Z","external_id":{"arxiv":["2601.09139"]},"publication":"Proceedings of the 2026 Annual ACM SIAM Symposium on Discrete Algorithms","abstract":[{"lang":"eng","text":"We develop a new algorithmic framework for designing approximation algorithms for cut-based optimization problems on capacitated undirected graphs that undergo edge insertions and deletions. Specifically, our framework dynamically maintains a variant of the hierarchical 𝑗-tree decomposition of [Madry FOCS’10], achieving a poly-logarithmic approximation factor to the graph’s cut structure and supporting edge updates in 𝑂⁡(𝑛𝜀) amortized update time, for any arbitrarily small constant 𝜀 ∈(0,1).\r\nConsequently, we obtain new trade-offs between approximation and update/query time for fundamental cut-based optimization problems in the fully dynamic setting, including all-pairs minimum cuts, sparsest cut, multi-way cut, and multi-cut. For the last three problems, these trade-offs give the first fully-dynamic algorithms achieving poly-logarithmic approximation in sub-linear time per operation.\r\nThe main technical ingredient behind our dynamic hierarchy is a dynamic cut-sparsifier algorithm that can handle vertex splits with low recourse. This is achieved by white-boxing the dynamic cut sparsifier construction of [Abraham et al. FOCS’16], based on forest packing, together with new structural insights about the maintenance of these forests under vertex splits. Given the versatility of cut sparsification in both the static and dynamic graph algorithms literature, we believe this construction may be of independent interest."}],"date_created":"2026-04-12T22:01:51Z","conference":{"name":"SODA: Symposium on Discrete Algorithms"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2026","publication_identifier":{"eissn":["15579468"],"isbn":["9781611978971"],"issn":["10719040"]},"acknowledgement":"Monika Henzinger: Funded by the European union. Views and opinions expressed\r\nare however those of the author(s) only and do not necessarily reflect those of the European Union or the European Research Council Executive Agency. Neither the European Union nor the granting authority can be held responsible for them. This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (MoDynStruct, No. 101019564) and the Austrian Science Fund (FWF) grant DOI 10.55776/I5982. For open access purposes, the author has applied a CC BY public copyright license to any author accepted manuscript version arising from this submission.\r\nPeter Kiss: This research was funded in whole or in part by the Austrian Science Fund (FWF)\r\n10.55776/ESP6088024.","doi":"10.1137/1.9781611978971.45","publication_status":"published","language":[{"iso":"eng"}],"type":"conference","title":"Dynamic hierarchical j-tree decomposition and its applications","project":[{"_id":"bd9ca328-d553-11ed-ba76-dc4f890cfe62","name":"The design and evaluation of modern fully dynamic data structures","grant_number":"101019564","call_identifier":"H2020"},{"name":"Static and Dynamic Hierarchical Graph Decompositions","grant_number":"I05982","_id":"bda196b2-d553-11ed-ba76-8e8ee6c21103"}]},{"publication_identifier":{"issn":["1071-9040"],"eisbn":["9781611978971"],"eissn":["1557-9468"]},"year":"2026","acknowledgement":"Funded by the European union. Views and opinions expressed are however those of the author(s) only and do not necessarily reflect those of the European Union or the European Research Council Executive Agency. Neither the European Union nor the granting authority can be held responsible for them. This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (MoDynStruct, No. 101019564) and the Austrian Science Fund (FWF) grant DOI 10.55776/I5982. For open access purposes, the author has applied a CC BY public copyright license to any author-accepted manuscript version arising from this submission.","doi":"10.1137/1.9781611978971.25","date_created":"2026-04-12T22:01:51Z","conference":{"name":"SODA: Symposium on Discrete Algorithms","start_date":"2026-01-11","location":"Vancouver, Canada","end_date":"2026-01-14"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"type":"conference","title":"Deterministic and exact fully-dynamic minimum cut of superpolylogarithmic size in subpolynomial time","project":[{"grant_number":"101019564","name":"The design and evaluation of modern fully dynamic data structures","_id":"bd9ca328-d553-11ed-ba76-dc4f890cfe62","call_identifier":"H2020"},{"_id":"bda196b2-d553-11ed-ba76-8e8ee6c21103","name":"Static and Dynamic Hierarchical Graph Decompositions","grant_number":"I05982"}],"publication_status":"published","day":"07","author":[{"first_name":"Antoine","id":"888a098e-fcac-11ee-aff7-d347be57b725","full_name":"El-Hayek, Antoine","last_name":"El-Hayek","orcid":"0000-0003-4268-7368"},{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H","last_name":"Henzinger","full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530"},{"first_name":"Jason","full_name":"Li, Jason","last_name":"Li"}],"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2512.13105","open_access":"1"}],"oa_version":"Preprint","abstract":[{"text":"We present an exact fully-dynamic minimum cut algorithm that runs in 𝑛𝑜⁡(1) deterministic update time when the minimum cut size is at most 2Θ⁡(log3/4−𝑐⁡𝑛) for any 𝑐 >0, improving on the previous algorithm of Jin, Sun, and Thorup (SODA 2024) whose minimum cut size limit is (log⁡𝑛)𝑜⁡(1). Combined with graph sparsification, we obtain the first (1 +𝜖)-approximate fully-dynamic minimum cut algorithm on weighted graphs, for any 𝜖 ≥2−Θ⁡(log3/4−𝑐⁡𝑛), in 𝑛𝑜⁡(1) randomized update time.\r\nOur main technical contribution is a deterministic local minimum cut algorithm, which replaces the randomized LocalKCut procedure from El-Hayek, Henzinger, and Li (SODA 2025).","lang":"eng"}],"date_published":"2026-01-07T00:00:00Z","external_id":{"arxiv":["2512.13105"]},"publication":"Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms","date_updated":"2026-05-04T11:36:47Z","oa":1,"department":[{"_id":"MoHe"},{"_id":"GradSch"}],"scopus_import":"1","arxiv":1,"_id":"21720","status":"public","ec_funded":1,"article_processing_charge":"No","page":"613-663","citation":{"mla":"El-Hayek, Antoine, et al. “Deterministic and Exact Fully-Dynamic Minimum Cut of Superpolylogarithmic Size in Subpolynomial Time.” <i>Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms</i>, vol. 2026, Society for Industrial and Applied Mathematics, 2026, pp. 613–63, doi:<a href=\"https://doi.org/10.1137/1.9781611978971.25\">10.1137/1.9781611978971.25</a>.","apa":"El-Hayek, A., Henzinger, M., &#38; Li, J. (2026). Deterministic and exact fully-dynamic minimum cut of superpolylogarithmic size in subpolynomial time. In <i>Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms</i> (Vol. 2026, pp. 613–663). Vancouver, Canada: Society for Industrial and Applied Mathematics. <a href=\"https://doi.org/10.1137/1.9781611978971.25\">https://doi.org/10.1137/1.9781611978971.25</a>","ista":"El-Hayek A, Henzinger M, Li J. 2026. Deterministic and exact fully-dynamic minimum cut of superpolylogarithmic size in subpolynomial time. Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms vol. 2026, 613–663.","short":"A. El-Hayek, M. Henzinger, J. Li, in:, Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2026, pp. 613–663.","ama":"El-Hayek A, Henzinger M, Li J. Deterministic and exact fully-dynamic minimum cut of superpolylogarithmic size in subpolynomial time. In: <i>Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms</i>. Vol 2026. Society for Industrial and Applied Mathematics; 2026:613-663. doi:<a href=\"https://doi.org/10.1137/1.9781611978971.25\">10.1137/1.9781611978971.25</a>","chicago":"El-Hayek, Antoine, Monika Henzinger, and Jason Li. “Deterministic and Exact Fully-Dynamic Minimum Cut of Superpolylogarithmic Size in Subpolynomial Time.” In <i>Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms</i>, 2026:613–63. Society for Industrial and Applied Mathematics, 2026. <a href=\"https://doi.org/10.1137/1.9781611978971.25\">https://doi.org/10.1137/1.9781611978971.25</a>.","ieee":"A. El-Hayek, M. Henzinger, and J. Li, “Deterministic and exact fully-dynamic minimum cut of superpolylogarithmic size in subpolynomial time,” in <i>Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms</i>, Vancouver, Canada, 2026, vol. 2026, pp. 613–663."},"OA_type":"green","volume":2026,"quality_controlled":"1","publisher":"Society for Industrial and Applied Mathematics","intvolume":"      2026","month":"01","OA_place":"repository"},{"ddc":["000"],"department":[{"_id":"MoHe"}],"file_date_updated":"2025-06-23T11:23:29Z","scopus_import":"1","arxiv":1,"_id":"19858","corr_author":"1","status":"public","date_updated":"2025-09-30T13:37:28Z","oa":1,"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","intvolume":"       330","OA_place":"publisher","month":"06","ec_funded":1,"article_processing_charge":"No","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)"},"has_accepted_license":"1","citation":{"chicago":"El-Hayek, Antoine, Kathrin Hanauer, and Monika Henzinger. “On B-Matching and Fully-Dynamic Maximum k-Edge Coloring.” In <i>4th Symposium on Algorithmic Foundations of Dynamic Networks</i>, Vol. 330. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. <a href=\"https://doi.org/10.4230/LIPIcs.SAND.2025.4\">https://doi.org/10.4230/LIPIcs.SAND.2025.4</a>.","ama":"El-Hayek A, Hanauer K, Henzinger M. On b-matching and fully-dynamic maximum k-edge coloring. In: <i>4th Symposium on Algorithmic Foundations of Dynamic Networks</i>. Vol 330. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2025. doi:<a href=\"https://doi.org/10.4230/LIPIcs.SAND.2025.4\">10.4230/LIPIcs.SAND.2025.4</a>","ieee":"A. El-Hayek, K. Hanauer, and M. Henzinger, “On b-matching and fully-dynamic maximum k-edge coloring,” in <i>4th Symposium on Algorithmic Foundations of Dynamic Networks</i>, Liverpool, United Kingdom, 2025, vol. 330.","mla":"El-Hayek, Antoine, et al. “On B-Matching and Fully-Dynamic Maximum k-Edge Coloring.” <i>4th Symposium on Algorithmic Foundations of Dynamic Networks</i>, vol. 330, 4, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025, doi:<a href=\"https://doi.org/10.4230/LIPIcs.SAND.2025.4\">10.4230/LIPIcs.SAND.2025.4</a>.","apa":"El-Hayek, A., Hanauer, K., &#38; Henzinger, M. (2025). On b-matching and fully-dynamic maximum k-edge coloring. In <i>4th Symposium on Algorithmic Foundations of Dynamic Networks</i> (Vol. 330). Liverpool, United Kingdom: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.SAND.2025.4\">https://doi.org/10.4230/LIPIcs.SAND.2025.4</a>","short":"A. El-Hayek, K. Hanauer, M. Henzinger, in:, 4th Symposium on Algorithmic Foundations of Dynamic Networks, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025.","ista":"El-Hayek A, Hanauer K, Henzinger M. 2025. On b-matching and fully-dynamic maximum k-edge coloring. 4th Symposium on Algorithmic Foundations of Dynamic Networks. SAND: Symposium on Algorithmic Foundations of Dynamic Networks, LIPIcs, vol. 330, 4."},"OA_type":"gold","quality_controlled":"1","volume":330,"isi":1,"language":[{"iso":"eng"}],"project":[{"call_identifier":"H2020","_id":"bd9ca328-d553-11ed-ba76-dc4f890cfe62","grant_number":"101019564","name":"The design and evaluation of modern fully dynamic data structures"},{"_id":"34def286-11ca-11ed-8bc3-da5948e1613c","grant_number":"Z00422","name":"Efficient algorithms"},{"grant_number":"I05982","name":"Static and Dynamic Hierarchical Graph Decompositions","_id":"bda196b2-d553-11ed-ba76-8e8ee6c21103"},{"_id":"bd9e3a2e-d553-11ed-ba76-8aa684ce17fe","grant_number":"P33775","name":"Fast Algorithms for a Reactive Network Layer"}],"title":"On b-matching and fully-dynamic maximum k-edge coloring","type":"conference","publication_status":"published","year":"2025","article_number":"4","publication_identifier":{"issn":["1868-8969"],"isbn":["9783959773683"]},"acknowledgement":"This project has received funding from the European Research Council (ERC) under the\r\nEuropean Union’s Horizon 2020 research and innovation programme (MoDynStruct, No. 101019564) and the Austrian Science Fund (FWF) grant DOI 10.55776/Z422, grant DOI 10.55776/I5982, and grant DOI 10.55776/P33775 with additional funding from the netidee SCIENCE Stiftung, 2020–2024. This work was further supported by the Federal Ministry of Education and Research (BMBF) project, 6G-RIC: 6G Research and Innovation Cluster, grant 16KISK020K.","doi":"10.4230/LIPIcs.SAND.2025.4","alternative_title":["LIPIcs"],"date_created":"2025-06-22T22:02:06Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","conference":{"start_date":"2025-06-09","name":"SAND: Symposium on Algorithmic Foundations of Dynamic Networks","location":"Liverpool, United Kingdom","end_date":"2025-06-11"},"abstract":[{"lang":"eng","text":"Given a graph G that undergoes a sequence of edge insertions and deletions, we study the Maximum k-Edge Coloring problem (MkEC): Having access to k different colors, color as many edges of G as possible such that no two adjacent edges share the same color. While this problem is different from simply maintaining a b-matching with b = k, the two problems are related. However, maximum b-matching can be solved efficiently in the static setting, whereas MkEC is NP-hard and even APX-hard for k ≥ 2. \r\nWe present new results on both problems: For b-matching, we show a new integrality gap result and we adapt Wajc’s matching sparsification scheme [David Wajc, 2020] for the case where b is a constant.\r\nUsing these as basis, we give three new algorithms for the dynamic MkEC problem: Our MatchO algorithm builds on the dynamic (2+ε)-approximation algorithm of Bhattacharya, Gupta, and Mohan [Sayan Bhattacharya et al., 2017] for b-matching and achieves a (2+ε)(k+1)/k-approximation in O(poly(log n, ε^-1)) update time against an oblivious adversary. Our MatchA algorithm builds on the dynamic (7+ε)-approximation algorithm by Bhattacharya, Henzinger, and Italiano [Sayan Bhattacharya et al., 2015] for fractional b-matching and achieves a (7+ε)(3k+3)/(3k-1)-approximation in O(poly(log n, ε^-1)) update time against an adaptive adversary. Moreover, our reductions use the dynamic b-matching algorithm as a black box, so any future improvement in the approximation ratio for dynamic b-matching will automatically translate into a better approximation ratio for our algorithms. Finally, we present a greedy algorithm with O(Δ+k) update time, which guarantees a 2.16 approximation factor."}],"date_published":"2025-06-02T00:00:00Z","external_id":{"isi":["001532136900004"],"arxiv":["2310.01149"]},"file":[{"creator":"dernst","date_updated":"2025-06-23T11:23:29Z","success":1,"content_type":"application/pdf","date_created":"2025-06-23T11:23:29Z","file_size":995666,"checksum":"ad93a1e052adb29d7bfe8bd551bab193","file_name":"2025_LIPIcs_ElHayek.pdf","file_id":"19872","relation":"main_file","access_level":"open_access"}],"publication":"4th Symposium on Algorithmic Foundations of Dynamic Networks","day":"02","author":[{"orcid":"0000-0003-4268-7368","full_name":"El-Hayek, Antoine","last_name":"El-Hayek","first_name":"Antoine","id":"888a098e-fcac-11ee-aff7-d347be57b725"},{"last_name":"Hanauer","full_name":"Hanauer, Kathrin","first_name":"Kathrin"},{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H","last_name":"Henzinger","full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530"}],"oa_version":"Published Version"},{"language":[{"iso":"eng"}],"project":[{"_id":"bd9ca328-d553-11ed-ba76-dc4f890cfe62","name":"The design and evaluation of modern fully dynamic data structures","grant_number":"101019564","call_identifier":"H2020"},{"grant_number":"Z00422","name":"Efficient algorithms","_id":"34def286-11ca-11ed-8bc3-da5948e1613c"},{"grant_number":"I05982","name":"Static and Dynamic Hierarchical Graph Decompositions","_id":"bda196b2-d553-11ed-ba76-8e8ee6c21103"},{"grant_number":"P33775","name":"Fast Algorithms for a Reactive Network Layer","_id":"bd9e3a2e-d553-11ed-ba76-8aa684ce17fe"}],"title":"Fully dynamic approximate minimum cut in subpolynomial time per operation","type":"conference","publication_status":"published","year":"2025","publication_identifier":{"eisbn":["9781611978322"]},"doi":"10.1137/1.9781611978322.22","acknowledgement":"This project has received funding from the European Research Council (ERC) under the European Union’sHorizon 2020 research and innovation programme (MoDynStruct, No. 101019564) and the Austrian Science Fund(FWF) grant DOI 10.55776/Z422, grant DOI 10.55776/I5982, and grant DOI 10.55776/P33775 with additional funding from the netidee SCIENCE Stiftung, 2020–2024.","date_created":"2025-07-10T13:08:57Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","conference":{"location":"New Orleans, LA, United States","start_date":"2025-01-12","name":"SODA: Symposium on Discrete Algorithms","end_date":"2025-01-15"},"abstract":[{"lang":"eng","text":"Dynamically maintaining the minimum cut in a graph G under edge insertions and deletion is a fundamental problem in dynamic graph algorithms for which no conditional lower bound on the time per operation exists. In an n-node graph the best known (1 + o (1))-approximate algorithm takes  update time [14]. If the minimum cut is guaranteed to be (log n )o (1), a deterministic exact algorithm with n o (1) update time exists [8].\r\nWe present the first fully dynamic algorithm for (1 + o (1))-approximate minimum cut with n o(1) update time. Our main technical contribution is to show that it suffices to consider small-volume cuts in suitably contracted graphs."}],"date_published":"2025-01-07T00:00:00Z","external_id":{"arxiv":["2412.15069"]},"publication":"Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms","day":"07","author":[{"last_name":"El-Hayek","full_name":"El-Hayek, Antoine","id":"888a098e-fcac-11ee-aff7-d347be57b725","first_name":"Antoine","orcid":"0000-0003-4268-7368"},{"orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H","last_name":"Henzinger","full_name":"Henzinger, Monika H"},{"last_name":"Li","full_name":"Li, Jason","first_name":"Jason"}],"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2412.15069","open_access":"1"}],"oa_version":"Preprint","department":[{"_id":"MoHe"}],"arxiv":1,"_id":"19982","corr_author":"1","status":"public","date_updated":"2025-12-29T12:30:04Z","oa":1,"publisher":"Society for Industrial and Applied Mathematics","OA_place":"repository","month":"01","ec_funded":1,"article_processing_charge":"No","page":"750-784","citation":{"mla":"El-Hayek, Antoine, et al. “Fully Dynamic Approximate Minimum Cut in Subpolynomial Time per Operation.” <i>Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms</i>, Society for Industrial and Applied Mathematics, 2025, pp. 750–84, doi:<a href=\"https://doi.org/10.1137/1.9781611978322.22\">10.1137/1.9781611978322.22</a>.","apa":"El-Hayek, A., Henzinger, M., &#38; Li, J. (2025). Fully dynamic approximate minimum cut in subpolynomial time per operation. In <i>Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms</i> (pp. 750–784). New Orleans, LA, United States: Society for Industrial and Applied Mathematics. <a href=\"https://doi.org/10.1137/1.9781611978322.22\">https://doi.org/10.1137/1.9781611978322.22</a>","ista":"El-Hayek A, Henzinger M, Li J. 2025. Fully dynamic approximate minimum cut in subpolynomial time per operation. Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 750–784.","short":"A. El-Hayek, M. Henzinger, J. Li, in:, Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2025, pp. 750–784.","ama":"El-Hayek A, Henzinger M, Li J. Fully dynamic approximate minimum cut in subpolynomial time per operation. In: <i>Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms</i>. Society for Industrial and Applied Mathematics; 2025:750-784. doi:<a href=\"https://doi.org/10.1137/1.9781611978322.22\">10.1137/1.9781611978322.22</a>","chicago":"El-Hayek, Antoine, Monika Henzinger, and Jason Li. “Fully Dynamic Approximate Minimum Cut in Subpolynomial Time per Operation.” In <i>Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms</i>, 750–84. Society for Industrial and Applied Mathematics, 2025. <a href=\"https://doi.org/10.1137/1.9781611978322.22\">https://doi.org/10.1137/1.9781611978322.22</a>.","ieee":"A. El-Hayek, M. Henzinger, and J. Li, “Fully dynamic approximate minimum cut in subpolynomial time per operation,” in <i>Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms</i>, New Orleans, LA, United States, 2025, pp. 750–784."},"OA_type":"green","quality_controlled":"1"},{"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2302.11341","open_access":"1"}],"oa_version":"Preprint","day":"01","author":[{"last_name":"Henzinger","full_name":"Henzinger, Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H","orcid":"0000-0002-5008-6530"},{"full_name":"Sricharan, A. R.","last_name":"Sricharan","first_name":"A. R."},{"first_name":"Teresa Anna","last_name":"Steiner","full_name":"Steiner, Teresa Anna"}],"date_published":"2025-05-01T00:00:00Z","external_id":{"arxiv":["2302.11341"]},"publication":"The 28th International Conference on Artificial Intelligence and Statistics","abstract":[{"lang":"eng","text":"We study privately releasing column sums of a d-dimensional table with entries from a universe χ undergoing T row updates, called histogram under continual release. Our mechanisms give better additive ℓ∞-error than existing mechanisms for a large class of queries and input streams. Our first contribution is an output-sensitive mechanism in the insertions-only model (χ = {0, 1}) for maintaining (i) the histogram or (ii) queries that do not require maintaining the entire histogram, such as the maximum or minimum column sum, the median, or any quantiles. The mechanism has an additive error of O(d log2 (dq∗) + log T) whp, where q∗ is the maximum output value over all time steps on this dataset. The mechanism does not require q∗ as input. This breaks the Ω(d log T) bound of prior work when q∗ ≪ T. Our second contribution is a mechanism for the turnstile model that admits negative entry updates (χ = {−1, 0, 1}). This mechanism has an additive error of O(d log2(dK) + log T) whp, where K is the number of times two consecutive data rows differ, and the mechanism does not require K as input. This is useful when monitoring inputs that only vary under unusual circumstances. For d = 1 this gives the first\r\nprivate mechanism with error O(log2 K + log T) for continual counting in the turnstile model, improving on the O(log2 n + log T) error bound by Dwork et al. (2015), where n is the number of ones in the stream, as well as allowing negative entries, while Dwork et al. (2015) can only handle nonnegative entries (χ = {0, 1}). "}],"alternative_title":["PMLR"],"date_created":"2025-09-07T22:01:35Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","conference":{"end_date":"2025-05-05","location":"Mai Khao, Thailand","name":"AISTATS: Conference on Artificial Intelligence and Statistics","start_date":"2025-05-03"},"year":"2025","publication_identifier":{"eissn":["2640-3498"]},"acknowledgement":"MH: This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (MoDynStruct, No. 101019564) and the Austrian Science Fund (FWF) grant DOI 10.55776/Z422, grant DOI 10.55776/I5982, and grant DOI 10.55776/P33775 with additional funding from the netidee SCIENCE Stiftung, 2020–2024. TAS: This work was supported by a research grant (VIL51463)\r\nfrom VILLUM FONDEN.","publication_status":"published","language":[{"iso":"eng"}],"project":[{"call_identifier":"H2020","_id":"bd9ca328-d553-11ed-ba76-dc4f890cfe62","name":"The design and evaluation of modern fully dynamic data structures","grant_number":"101019564"},{"grant_number":"Z00422","name":"Efficient algorithms","_id":"34def286-11ca-11ed-8bc3-da5948e1613c"},{"_id":"bda196b2-d553-11ed-ba76-8e8ee6c21103","name":"Static and Dynamic Hierarchical Graph Decompositions","grant_number":"I05982"},{"grant_number":"P33775","name":"Fast Algorithms for a Reactive Network Layer","_id":"bd9e3a2e-d553-11ed-ba76-8aa684ce17fe"}],"title":"Differentially private continual release of histograms and related queries","type":"conference","citation":{"ieee":"M. Henzinger, A. R. Sricharan, and T. A. Steiner, “Differentially private continual release of histograms and related queries,” in <i>The 28th International Conference on Artificial Intelligence and Statistics</i>, Mai Khao, Thailand, 2025, vol. 258, pp. 1990–1998.","chicago":"Henzinger, Monika, A. R. Sricharan, and Teresa Anna Steiner. “Differentially Private Continual Release of Histograms and Related Queries.” In <i>The 28th International Conference on Artificial Intelligence and Statistics</i>, 258:1990–98. ML Research Press, 2025.","ama":"Henzinger M, Sricharan AR, Steiner TA. Differentially private continual release of histograms and related queries. In: <i>The 28th International Conference on Artificial Intelligence and Statistics</i>. Vol 258. ML Research Press; 2025:1990-1998.","ista":"Henzinger M, Sricharan AR, Steiner TA. 2025. Differentially private continual release of histograms and related queries. The 28th International Conference on Artificial Intelligence and Statistics. AISTATS: Conference on Artificial Intelligence and Statistics, PMLR, vol. 258, 1990–1998.","short":"M. Henzinger, A.R. Sricharan, T.A. Steiner, in:, The 28th International Conference on Artificial Intelligence and Statistics, ML Research Press, 2025, pp. 1990–1998.","apa":"Henzinger, M., Sricharan, A. R., &#38; Steiner, T. A. (2025). Differentially private continual release of histograms and related queries. In <i>The 28th International Conference on Artificial Intelligence and Statistics</i> (Vol. 258, pp. 1990–1998). Mai Khao, Thailand: ML Research Press.","mla":"Henzinger, Monika, et al. “Differentially Private Continual Release of Histograms and Related Queries.” <i>The 28th International Conference on Artificial Intelligence and Statistics</i>, vol. 258, ML Research Press, 2025, pp. 1990–98."},"quality_controlled":"1","OA_type":"green","volume":258,"article_processing_charge":"No","ec_funded":1,"page":"1990-1998","OA_place":"repository","month":"05","publisher":"ML Research Press","intvolume":"       258","oa":1,"date_updated":"2025-09-09T07:09:22Z","_id":"20301","status":"public","department":[{"_id":"MoHe"}],"scopus_import":"1","arxiv":1},{"date_updated":"2025-04-14T13:50:49Z","oa":1,"scopus_import":"1","arxiv":1,"department":[{"_id":"MoHe"}],"status":"public","_id":"19038","page":"2951 - 2970","ec_funded":1,"article_processing_charge":"No","volume":5,"OA_type":"green","quality_controlled":"1","citation":{"short":"M. Henzinger, J. Upadhyay, in:, Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, Association for Computing Machinery, 2025, pp. 2951–2970.","ista":"Henzinger M, Upadhyay J. 2025. Improved differentially private continual observation using group algebra. Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms vol. 5, 2951–2970.","mla":"Henzinger, Monika, and Jalaj Upadhyay. “Improved Differentially Private Continual Observation Using Group Algebra.” <i>Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms</i>, vol. 5, Association for Computing Machinery, 2025, pp. 2951–70, doi:<a href=\"https://doi.org/10.1137/1.9781611978322.95\">10.1137/1.9781611978322.95</a>.","apa":"Henzinger, M., &#38; Upadhyay, J. (2025). Improved differentially private continual observation using group algebra. In <i>Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms</i> (Vol. 5, pp. 2951–2970). New Orleans, LA, United States: Association for Computing Machinery. <a href=\"https://doi.org/10.1137/1.9781611978322.95\">https://doi.org/10.1137/1.9781611978322.95</a>","ieee":"M. Henzinger and J. Upadhyay, “Improved differentially private continual observation using group algebra,” in <i>Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms</i>, New Orleans, LA, United States, 2025, vol. 5, pp. 2951–2970.","chicago":"Henzinger, Monika, and Jalaj Upadhyay. “Improved Differentially Private Continual Observation Using Group Algebra.” In <i>Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms</i>, 5:2951–70. Association for Computing Machinery, 2025. <a href=\"https://doi.org/10.1137/1.9781611978322.95\">https://doi.org/10.1137/1.9781611978322.95</a>.","ama":"Henzinger M, Upadhyay J. Improved differentially private continual observation using group algebra. In: <i>Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms</i>. Vol 5. Association for Computing Machinery; 2025:2951-2970. doi:<a href=\"https://doi.org/10.1137/1.9781611978322.95\">10.1137/1.9781611978322.95</a>"},"intvolume":"         5","publisher":"Association for Computing Machinery","month":"01","OA_place":"repository","doi":"10.1137/1.9781611978322.95","acknowledgement":"Monika Henzinger: This project has received funding from the European Research Council(ERC) under the European Union’s Horizon 2020 research and innovation programme (Grantagreement No. 101019564) and the Austrian Science Fund (FWF) grant DOI 10.55776/Z422,grant DOI 10.55776/I5982, and grant DOI 10.55776/P33775 with additional funding from the netidee SCIENCEStiftung, 2020–2024.Jalaj Upadhyay’s research was funded by the Rutgers Decanal Grant no. 302918 and an unrestricted giftfrom Google. This work was done in part while visiting the Institute of Science and Technology Austria (ISTA).The authors would like to thank Sarvagya Upadhyay for the initial discussion and feedback on the early draft of the paper. The authors would like to thank the anonymous reviewers, Brendan McMahan and Abhradeep Thakurta for the discussions that helped improve the presentation of the final version of the paper.","publication_identifier":{"issn":["1071-9040"],"isbn":["979-833131200-8"]},"year":"2025","conference":{"end_date":"2025-01-15","location":"New Orleans, LA, United States","name":"SODA: Symposium on Discrete Algorithms","start_date":"2025-01-12"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2025-02-17T09:31:03Z","title":"Improved differentially private continual observation using group algebra","type":"conference","project":[{"grant_number":"101019564","name":"The design and evaluation of modern fully dynamic data structures","_id":"bd9ca328-d553-11ed-ba76-dc4f890cfe62","call_identifier":"H2020"},{"_id":"34def286-11ca-11ed-8bc3-da5948e1613c","name":"Efficient algorithms","grant_number":"Z00422"},{"_id":"bda196b2-d553-11ed-ba76-8e8ee6c21103","name":"Static and Dynamic Hierarchical Graph Decompositions","grant_number":"I05982"},{"grant_number":"P33775","name":"Fast Algorithms for a Reactive Network Layer","_id":"bd9e3a2e-d553-11ed-ba76-8aa684ce17fe"}],"language":[{"iso":"eng"}],"publication_status":"published","author":[{"orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H","last_name":"Henzinger","first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630"},{"last_name":"Upadhyay","full_name":"Upadhyay, Jalaj","first_name":"Jalaj"}],"day":"20","oa_version":"Preprint","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2412.02840"}],"abstract":[{"text":"Differentially private weighted prefix sum under continual observation is a crucial component in the production-level deployment of private next-word prediction for Gboard, which, according to Google, has over a billion users. More specifically, Google uses a differentially private mechanism to sum weighted gradients in its private follow-the-regularized leader algorithm. Apart from efficiency, the additive error of the private mechanism is crucial as multiplied with the square root of the model’s dimension d (with d ranging up to 10 trillion, for example, Switch Transformers or M6-10T), it determines the accuracy of the learning system. So, any improvement in leading constant matters significantly in practice. In this paper, we show a novel connection between mechanisms for continual weighted prefix sum and a concept in representation theory known as the group matrix introduced in correspondence between Dedekind and Frobenius (Sitzungsber. Preuss. Akad. Wiss. Berlin, 1897) and generalized by Schur (Journal für die reine und angewandte Mathematik, 1904). To the best of our knowledge, this is the first application of group algebra in the analysis of differentially private algorithms. Using this connection, we analyze a class of matrix norms known as factorization norms that give upper and lower bounds for the additive error under general ℓp-norms of the matrix mechanism. This allows us to give 1. the first efficient factorization that matches the best-known non-constructive upper bound on the factorization norm by Mathias (SIAM Journal of Matrix Analysis and Applications, 1993) for the matrix used in Google’s deployment, and also improves on the previous best-known constructive bound of Fichtenberger, Henzinger, and Upadhyay (ICML 2023) and Henzinger, Upadhyay, and Upadhyay (SODA 2023); thereby, partially resolving an open question in operator theory, 2. the first upper bound on the additive error for a large class of weight functions for weighted prefix sum problems, including the sliding window matrix (Bolot, Fawaz, Muthukrishnan, Nikolov, and Taft (ICDT 2013). We also improve the bound on factorizing the striped matrix used for outputting a synthetic graph that approximates all cuts (Fichtenberger, Henzinger, and Upadhyay (ICML 2023)); 3. a general improved upper bound on the factorization norms that depend on algebraic properties of the weighted sum matrices and that applies to a more general class of weighting functions than the ones considered in Henzinger, Upadhyay, and Upadhyay (SODA 2024). Using the known connection between these factorization norms and the ℓp-error of continual weighted sum, we give an upper bound on the ℓp-error for the continual weighted sum problem for p ≥ 2.","lang":"eng"}],"publication":"Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms","date_published":"2025-01-20T00:00:00Z","external_id":{"arxiv":["2412.02840"]}},{"month":"03","OA_place":"repository","publisher":"Springer Nature","intvolume":"       210","citation":{"chicago":"Zheng, Da Wei, and Monika Henzinger. “Multiplicative Auction Algorithm for Approximate Maximum Weight Bipartite Matching.” <i>Mathematical Programming</i>. Springer Nature, 2025. <a href=\"https://doi.org/10.1007/s10107-024-02066-3\">https://doi.org/10.1007/s10107-024-02066-3</a>.","ama":"Zheng DW, Henzinger M. Multiplicative auction algorithm for approximate maximum weight bipartite matching. <i>Mathematical Programming</i>. 2025;210:881-894. doi:<a href=\"https://doi.org/10.1007/s10107-024-02066-3\">10.1007/s10107-024-02066-3</a>","ieee":"D. W. Zheng and M. Henzinger, “Multiplicative auction algorithm for approximate maximum weight bipartite matching,” <i>Mathematical Programming</i>, vol. 210. Springer Nature, pp. 881–894, 2025.","apa":"Zheng, D. W., &#38; Henzinger, M. (2025). Multiplicative auction algorithm for approximate maximum weight bipartite matching. <i>Mathematical Programming</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s10107-024-02066-3\">https://doi.org/10.1007/s10107-024-02066-3</a>","mla":"Zheng, Da Wei, and Monika Henzinger. “Multiplicative Auction Algorithm for Approximate Maximum Weight Bipartite Matching.” <i>Mathematical Programming</i>, vol. 210, Springer Nature, 2025, pp. 881–94, doi:<a href=\"https://doi.org/10.1007/s10107-024-02066-3\">10.1007/s10107-024-02066-3</a>.","ista":"Zheng DW, Henzinger M. 2025. Multiplicative auction algorithm for approximate maximum weight bipartite matching. Mathematical Programming. 210, 881–894.","short":"D.W. Zheng, M. Henzinger, Mathematical Programming 210 (2025) 881–894."},"OA_type":"green","quality_controlled":"1","volume":210,"article_processing_charge":"No","ec_funded":1,"page":"881-894","corr_author":"1","_id":"15121","status":"public","department":[{"_id":"MoHe"}],"arxiv":1,"scopus_import":"1","oa":1,"related_material":{"record":[{"id":"13236","status":"public","relation":"earlier_version"}]},"date_updated":"2025-09-09T12:39:58Z","external_id":{"isi":["001176048100003"],"arxiv":["2301.09217"]},"date_published":"2025-03-01T00:00:00Z","publication":"Mathematical Programming","abstract":[{"lang":"eng","text":"We present an auction algorithm using multiplicative instead of constant weight updates to compute a (1-E)-approximate maximum weight matching (MWM) in a bipartite graph with n vertices and m edges in time 0(mE-1), beating the running time of the fastest known approximation algorithm of Duan and Pettie [JACM ’14] that runs in 0(mE-1 log E-1). Our algorithm is very simple and it can be extended to give a dynamic data structure that maintains a (1-E)-approximate maximum weight matching under (1) one-sided vertex deletions (with incident edges) and (2) one-sided vertex insertions (with incident edges sorted by weight) to the other side. The total time time used is 0(mE-1), where m is the sum of the number of initially existing and inserted edges."}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2301.09217"}],"oa_version":"Preprint","day":"01","author":[{"first_name":"Da Wei","full_name":"Zheng, Da Wei","last_name":"Zheng"},{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H","last_name":"Henzinger","full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530"}],"article_type":"original","publication_status":"published","language":[{"iso":"eng"}],"isi":1,"title":"Multiplicative auction algorithm for approximate maximum weight bipartite matching","type":"journal_article","project":[{"_id":"bd9ca328-d553-11ed-ba76-dc4f890cfe62","grant_number":"101019564","name":"The design and evaluation of modern fully dynamic data structures","call_identifier":"H2020"},{"name":"Fast Algorithms for a Reactive Network Layer","grant_number":"P33775","_id":"bd9e3a2e-d553-11ed-ba76-8aa684ce17fe"}],"date_created":"2024-03-17T23:00:58Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_identifier":{"eissn":["1436-4646"],"issn":["0025-5610"]},"year":"2025","doi":"10.1007/s10107-024-02066-3","acknowledgement":"The first author thanks Chandra Chekuri for useful discussions about this paper. This work was done in part at the University of Vienna. This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (Grant agreement No. 101019564 “The Design of Modern Fully Dynamic Data Structures (MoDynStruct)” and from the Austrian Science Fund (FWF) project “Fast Algorithms for a Reactive Network Layer (ReactNet)”, P 33775-N, with additional funding from the netidee SCIENCE Stiftung, 2020–2024."},{"date_created":"2025-10-26T23:01:34Z","alternative_title":["LIPIcs"],"conference":{"end_date":"2025-09-17","location":"Warsaw, Poland","name":"ESA: European Symposium on Algorithms","start_date":"2025-09-15"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_number":"2","publication_identifier":{"isbn":["9783959773959"],"issn":["1868-8969"]},"year":"2025","doi":"10.4230/LIPIcs.ESA.2025.2","publication_status":"published","language":[{"iso":"eng"}],"title":"Securing dynamic data: A primer on differentially private data structures","type":"conference","oa_version":"Published Version","day":"01","author":[{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H","last_name":"Henzinger","full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530"},{"full_name":"Safavi Hemami, Roodabeh","last_name":"Safavi Hemami","first_name":"Roodabeh","id":"72ed2640-8972-11ed-ae7b-f9c81ec75154"}],"file":[{"access_level":"open_access","relation":"main_file","file_name":"2025_LIPIcs.ESA_Henzinger.pdf","file_id":"20541","checksum":"094e0466d90664fbea397b469a60acbb","file_size":770227,"success":1,"date_created":"2025-10-27T07:57:00Z","content_type":"application/pdf","date_updated":"2025-10-27T07:57:00Z","creator":"dernst"}],"date_published":"2025-10-01T00:00:00Z","publication":"33rd Annual European Symposium on Algorithms","abstract":[{"lang":"eng","text":"We give an introduction into differential privacy in the dynamic setting, called the continual observation setting."}],"oa":1,"date_updated":"2025-10-27T08:00:13Z","_id":"20533","corr_author":"1","status":"public","file_date_updated":"2025-10-27T07:57:00Z","department":[{"_id":"MoHe"}],"ddc":["000"],"scopus_import":"1","citation":{"ista":"Henzinger M, Safavi Hemami R. 2025. Securing dynamic data: A primer on differentially private data structures. 33rd Annual European Symposium on Algorithms. ESA: European Symposium on Algorithms, LIPIcs, vol. 351, 2.","short":"M. Henzinger, R. Safavi Hemami, in:, 33rd Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025.","apa":"Henzinger, M., &#38; Safavi Hemami, R. (2025). Securing dynamic data: A primer on differentially private data structures. In <i>33rd Annual European Symposium on Algorithms</i> (Vol. 351). Warsaw, Poland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.ESA.2025.2\">https://doi.org/10.4230/LIPIcs.ESA.2025.2</a>","mla":"Henzinger, Monika, and Roodabeh Safavi Hemami. “Securing Dynamic Data: A Primer on Differentially Private Data Structures.” <i>33rd Annual European Symposium on Algorithms</i>, vol. 351, 2, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025, doi:<a href=\"https://doi.org/10.4230/LIPIcs.ESA.2025.2\">10.4230/LIPIcs.ESA.2025.2</a>.","ieee":"M. Henzinger and R. Safavi Hemami, “Securing dynamic data: A primer on differentially private data structures,” in <i>33rd Annual European Symposium on Algorithms</i>, Warsaw, Poland, 2025, vol. 351.","chicago":"Henzinger, Monika, and Roodabeh Safavi Hemami. “Securing Dynamic Data: A Primer on Differentially Private Data Structures.” In <i>33rd Annual European Symposium on Algorithms</i>, Vol. 351. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. <a href=\"https://doi.org/10.4230/LIPIcs.ESA.2025.2\">https://doi.org/10.4230/LIPIcs.ESA.2025.2</a>.","ama":"Henzinger M, Safavi Hemami R. Securing dynamic data: A primer on differentially private data structures. In: <i>33rd Annual European Symposium on Algorithms</i>. Vol 351. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2025. doi:<a href=\"https://doi.org/10.4230/LIPIcs.ESA.2025.2\">10.4230/LIPIcs.ESA.2025.2</a>"},"has_accepted_license":"1","quality_controlled":"1","volume":351,"OA_type":"gold","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)"},"article_processing_charge":"No","month":"10","OA_place":"publisher","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","intvolume":"       351"},{"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)"},"ec_funded":1,"article_processing_charge":"No","citation":{"chicago":"Henzinger, Monika, Evangelos Kosinas, Robin Münk, and Harald Räcke. “Efficient Contractions of Dynamic Graphs - with Applications.” In <i>33rd Annual European Symposium on Algorithms</i>, Vol. 351. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. <a href=\"https://doi.org/10.4230/LIPIcs.ESA.2025.36\">https://doi.org/10.4230/LIPIcs.ESA.2025.36</a>.","ama":"Henzinger M, Kosinas E, Münk R, Räcke H. Efficient contractions of dynamic graphs - with applications. In: <i>33rd Annual European Symposium on Algorithms</i>. Vol 351. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2025. doi:<a href=\"https://doi.org/10.4230/LIPIcs.ESA.2025.36\">10.4230/LIPIcs.ESA.2025.36</a>","ieee":"M. Henzinger, E. Kosinas, R. Münk, and H. Räcke, “Efficient contractions of dynamic graphs - with applications,” in <i>33rd Annual European Symposium on Algorithms</i>, Warsaw, Poland, 2025, vol. 351.","mla":"Henzinger, Monika, et al. “Efficient Contractions of Dynamic Graphs - with Applications.” <i>33rd Annual European Symposium on Algorithms</i>, vol. 351, 36, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025, doi:<a href=\"https://doi.org/10.4230/LIPIcs.ESA.2025.36\">10.4230/LIPIcs.ESA.2025.36</a>.","apa":"Henzinger, M., Kosinas, E., Münk, R., &#38; Räcke, H. (2025). Efficient contractions of dynamic graphs - with applications. In <i>33rd Annual European Symposium on Algorithms</i> (Vol. 351). Warsaw, Poland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.ESA.2025.36\">https://doi.org/10.4230/LIPIcs.ESA.2025.36</a>","short":"M. Henzinger, E. Kosinas, R. Münk, H. Räcke, in:, 33rd Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025.","ista":"Henzinger M, Kosinas E, Münk R, Räcke H. 2025. Efficient contractions of dynamic graphs - with applications. 33rd Annual European Symposium on Algorithms. ESA: European Symposium on Algorithms vol. 351, 36."},"has_accepted_license":"1","volume":351,"quality_controlled":"1","OA_type":"gold","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","intvolume":"       351","month":"10","OA_place":"publisher","date_updated":"2025-10-27T08:05:46Z","oa":1,"file_date_updated":"2025-10-27T08:03:36Z","department":[{"_id":"MoHe"}],"ddc":["000"],"scopus_import":"1","arxiv":1,"_id":"20534","corr_author":"1","status":"public","day":"01","author":[{"full_name":"Henzinger, Monika H","last_name":"Henzinger","first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530"},{"last_name":"Kosinas","full_name":"Kosinas, Evangelos","id":"4c7f9625-dbbc-11ee-9d86-bdcc2db5a949","first_name":"Evangelos"},{"full_name":"Münk, Robin","last_name":"Münk","first_name":"Robin"},{"last_name":"Räcke","full_name":"Räcke, Harald","first_name":"Harald"}],"oa_version":"Published Version","abstract":[{"lang":"eng","text":"A non-trivial minimum cut (NMC) sparsifier is a multigraph Ĝ that preserves all non-trivial minimum cuts of a given undirected graph G. We introduce a flexible data structure for fully dynamic graphs that can efficiently provide an NMC sparsifier upon request at any point during the sequence of updates. We employ simple dynamic forest data structures to achieve a fast from-scratch construction of the sparsifier at query time. Based on the strength of the adversary and desired type of time bounds, the data structure comes with different guarantees. Specifically, let G be a fully dynamic simple graph with n vertices and minimum degree δ. Then our data structure supports an insertion/deletion of an edge to/from G in n^o(1) worst-case time. Furthermore, upon request, it can return w.h.p. an NMC sparsifier of G that has O(n/δ) vertices and O(n) edges, in Ô(n) time. The probabilistic guarantees hold against an adaptive adversary. Alternatively, the update and query times can be improved to Õ(1) and Õ(n) respectively, if amortized-time guarantees are sufficient, or if the adversary is oblivious. Throughout the paper, we use Õ to hide polylogarithmic factors and Ô to hide subpolynomial (i.e., n^o(1)) factors.\r\nWe discuss two applications of our new data structure. First, it can be used to efficiently report a cactus representation of all minimum cuts of a fully dynamic simple graph. Building this cactus for the NMC sparsifier instead of the original graph allows for a construction time that is sublinear in the number of edges. Against an adaptive adversary, we can with high probability output the cactus representation in worst-case Ô(n) time. Second, our data structure allows us to efficiently compute the maximal k-edge-connected subgraphs of undirected simple graphs, by repeatedly applying a minimum cut algorithm on the NMC sparsifier. Specifically, we can compute with high probability the maximal k-edge-connected subgraphs of a simple graph with n vertices and m edges in Õ(m+n²/k) time. This improves the best known time bounds for k = Ω(n^{1/8}) and naturally extends to the case of fully dynamic graphs."}],"file":[{"checksum":"d2daf9a467e96fb5e7084a8a85321776","relation":"main_file","access_level":"open_access","file_name":"2025_LIPIcs.ESA_HenzingerM.pdf","file_id":"20542","date_updated":"2025-10-27T08:03:36Z","creator":"dernst","file_size":934846,"success":1,"date_created":"2025-10-27T08:03:36Z","content_type":"application/pdf"}],"external_id":{"arxiv":["2509.05157"]},"date_published":"2025-10-01T00:00:00Z","publication":"33rd Annual European Symposium on Algorithms","publication_identifier":{"isbn":["9783959773959"],"issn":["1868-8969"]},"article_number":"36","year":"2025","acknowledgement":"Monika Henzinger and Evangelos Kosinas: This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (MoDynStruct, No. 101019564) and the Austrian Science Fund (FWF) grant https://www.doi.org/10.55776/Z422 and grant https://www.doi.org/10.55776/I5982. Harald Räcke and Robin Münk: This project has received funding from the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) – 498605858.","doi":"10.4230/LIPIcs.ESA.2025.36","date_created":"2025-10-26T23:01:34Z","conference":{"location":"Warsaw, Poland","name":"ESA: European Symposium on Algorithms","start_date":"2025-09-15","end_date":"2025-09-17"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"type":"conference","title":"Efficient contractions of dynamic graphs - with applications","project":[{"call_identifier":"H2020","_id":"bd9ca328-d553-11ed-ba76-dc4f890cfe62","grant_number":"101019564","name":"The design and evaluation of modern fully dynamic data structures"},{"name":"Efficient algorithms","grant_number":"Z00422","_id":"34def286-11ca-11ed-8bc3-da5948e1613c"},{"name":"Static and Dynamic Hierarchical Graph Decompositions","grant_number":"I05982","_id":"bda196b2-d553-11ed-ba76-8e8ee6c21103"}],"publication_status":"published"},{"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)"},"article_processing_charge":"No","ec_funded":1,"quality_controlled":"1","OA_type":"gold","volume":351,"citation":{"ieee":"L. Dhulipala, M. Henzinger, G. Z. Li, Q. C. Liu, A. R. Sricharan, and L. Zhu, “Near-optimal differentially private graph algorithms via the Multidimensional AboveThreshold Mechanism,” in <i>33rd Annual European Symposium on Algorithms</i>, Warsaw, Poland, 2025, vol. 351.","chicago":"Dhulipala, Laxman, Monika Henzinger, George Z. Li, Quanquan C. Liu, A. R. Sricharan, and Leqi Zhu. “Near-Optimal Differentially Private Graph Algorithms via the Multidimensional AboveThreshold Mechanism.” In <i>33rd Annual European Symposium on Algorithms</i>, Vol. 351. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. <a href=\"https://doi.org/10.4230/LIPIcs.ESA.2025.91\">https://doi.org/10.4230/LIPIcs.ESA.2025.91</a>.","ama":"Dhulipala L, Henzinger M, Li GZ, Liu QC, Sricharan AR, Zhu L. Near-optimal differentially private graph algorithms via the Multidimensional AboveThreshold Mechanism. In: <i>33rd Annual European Symposium on Algorithms</i>. Vol 351. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2025. doi:<a href=\"https://doi.org/10.4230/LIPIcs.ESA.2025.91\">10.4230/LIPIcs.ESA.2025.91</a>","ista":"Dhulipala L, Henzinger M, Li GZ, Liu QC, Sricharan AR, Zhu L. 2025. Near-optimal differentially private graph algorithms via the Multidimensional AboveThreshold Mechanism. 33rd Annual European Symposium on Algorithms. ESA: European Symposium on Algorithms, LIPIcs, vol. 351, 91.","short":"L. Dhulipala, M. Henzinger, G.Z. Li, Q.C. Liu, A.R. Sricharan, L. Zhu, in:, 33rd Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025.","apa":"Dhulipala, L., Henzinger, M., Li, G. Z., Liu, Q. C., Sricharan, A. R., &#38; Zhu, L. (2025). Near-optimal differentially private graph algorithms via the Multidimensional AboveThreshold Mechanism. In <i>33rd Annual European Symposium on Algorithms</i> (Vol. 351). Warsaw, Poland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.ESA.2025.91\">https://doi.org/10.4230/LIPIcs.ESA.2025.91</a>","mla":"Dhulipala, Laxman, et al. “Near-Optimal Differentially Private Graph Algorithms via the Multidimensional AboveThreshold Mechanism.” <i>33rd Annual European Symposium on Algorithms</i>, vol. 351, 91, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025, doi:<a href=\"https://doi.org/10.4230/LIPIcs.ESA.2025.91\">10.4230/LIPIcs.ESA.2025.91</a>."},"has_accepted_license":"1","intvolume":"       351","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","month":"10","OA_place":"publisher","date_updated":"2025-10-27T07:02:06Z","oa":1,"scopus_import":"1","arxiv":1,"file_date_updated":"2025-10-27T06:58:43Z","department":[{"_id":"MoHe"}],"ddc":["000"],"status":"public","corr_author":"1","_id":"20535","author":[{"last_name":"Dhulipala","full_name":"Dhulipala, Laxman","first_name":"Laxman"},{"full_name":"Henzinger, Monika H","last_name":"Henzinger","first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530"},{"last_name":"Li","full_name":"Li, George Z.","first_name":"George Z."},{"first_name":"Quanquan C.","full_name":"Liu, Quanquan C.","last_name":"Liu"},{"first_name":"A. R.","last_name":"Sricharan","full_name":"Sricharan, A. R."},{"first_name":"Leqi","id":"a2117c59-cee4-11ed-b9d0-874ecf0f8ac5","full_name":"Zhu, Leqi","last_name":"Zhu"}],"day":"01","oa_version":"Published Version","abstract":[{"text":"Many differentially private and classical non-private graph algorithms rely crucially on determining whether some property of each vertex meets a threshold. For example, for the k-core decomposition problem, the classic peeling algorithm iteratively removes a vertex if its induced degree falls below a threshold. The sparse vector technique (SVT) is generally used to transform non-private threshold queries into private ones with only a small additive loss in accuracy. However, a naive application of SVT in the graph setting leads to an amplification of the error by a factor of n due to composition, as SVT is applied to every vertex. In this paper, we resolve this problem by formulating a novel generalized sparse vector technique which we call the Multidimensional AboveThreshold (MAT) Mechanism which generalizes SVT (applied to vectors with one dimension) to vectors with multiple dimensions. When applied to vectors with n dimensions, we solve a number of important graph problems with better bounds than previous work.\r\nSpecifically, we apply our MAT mechanism to obtain a set of improved bounds for a variety of problems including k-core decomposition, densest subgraph, low out-degree ordering, and vertex coloring. We give a tight local edge differentially private (LEDP) algorithm for k-core decomposition that results in an approximation with O(ε^{-1} log n) additive error and no multiplicative error in O(n) rounds. We also give a new (2+η)-factor multiplicative, O(ε^{-1} log n) additive error algorithm in O(log² n) rounds for any constant η > 0. Both of these results are asymptotically tight against our new lower bound of Ω(log n) for any constant-factor approximation algorithm for k-core decomposition. Our new algorithms for k-core decomposition also directly lead to new algorithms for the related problems of densest subgraph and low out-degree ordering. Finally, we give novel LEDP differentially private defective coloring algorithms that use number of colors given in terms of the arboricity of the graph.","lang":"eng"}],"publication":"33rd Annual European Symposium on Algorithms","date_published":"2025-10-01T00:00:00Z","external_id":{"arxiv":["2508.02182"]},"file":[{"file_id":"20539","file_name":"2025_LIPIcs.ESA_Dhulipala.pdf","access_level":"open_access","relation":"main_file","checksum":"19146e935b5b6ad5d33c8d08280ad8e7","date_created":"2025-10-27T06:58:43Z","content_type":"application/pdf","success":1,"file_size":870317,"creator":"dernst","date_updated":"2025-10-27T06:58:43Z"}],"acknowledgement":"Monika Henzinger and A. R. Sricharan: This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation\r\nprogramme (MoDynStruct, No. 101019564) and the Austrian Science Fund (FWF) grant DOI\r\n10.55776/Z422 and grant DOI 10.55776/I5982. Laxman Dhulipala and George Z. Li: supported by NSF award number CNS-2317194. Quanquan C. Liu: supported by a Google Academic Research Award and by an NSF award number CCF-2453323.","doi":"10.4230/LIPIcs.ESA.2025.91","publication_identifier":{"isbn":["9783959773959"],"issn":["1868-8969"]},"article_number":"91","year":"2025","conference":{"end_date":"2025-09-17","name":"ESA: European Symposium on Algorithms","start_date":"2025-09-15","location":"Warsaw, Poland"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2025-10-26T23:01:35Z","alternative_title":["LIPIcs"],"type":"conference","title":"Near-optimal differentially private graph algorithms via the Multidimensional AboveThreshold Mechanism","project":[{"call_identifier":"H2020","_id":"bd9ca328-d553-11ed-ba76-dc4f890cfe62","grant_number":"101019564","name":"The design and evaluation of modern fully dynamic data structures"},{"grant_number":"Z00422","name":"Efficient algorithms","_id":"34def286-11ca-11ed-8bc3-da5948e1613c"},{"_id":"bda196b2-d553-11ed-ba76-8e8ee6c21103","name":"Static and Dynamic Hierarchical Graph Decompositions","grant_number":"I05982"}],"language":[{"iso":"eng"}],"publication_status":"published"},{"ddc":["000"],"file_date_updated":"2026-02-18T09:02:33Z","department":[{"_id":"MoHe"}],"scopus_import":"1","arxiv":1,"corr_author":"1","_id":"21280","status":"public","date_updated":"2026-02-18T09:06:12Z","oa":1,"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","intvolume":"       334","OA_place":"publisher","month":"06","ec_funded":1,"article_processing_charge":"No","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)"},"page":"91:1-91:20","has_accepted_license":"1","citation":{"ieee":"G. Goranci, M. Henzinger, H. Räcke, and A. Sricharan, “Incremental approximate maximum flow via residual graph sparsification,” in <i>52nd International Colloquium on Automata, Languages, and Programming</i>, Aarhus, Denmark, 2025, vol. 334, p. 91:1-91:20.","ama":"Goranci G, Henzinger M, Räcke H, Sricharan A. Incremental approximate maximum flow via residual graph sparsification. In: <i>52nd International Colloquium on Automata, Languages, and Programming</i>. Vol 334. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2025:91:1-91:20. doi:<a href=\"https://doi.org/10.4230/lipics.icalp.2025.91\">10.4230/lipics.icalp.2025.91</a>","chicago":"Goranci, Gramoz, Monika Henzinger, Harald Räcke, and A. Sricharan. “Incremental Approximate Maximum Flow via Residual Graph Sparsification.” In <i>52nd International Colloquium on Automata, Languages, and Programming</i>, 334:91:1-91:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. <a href=\"https://doi.org/10.4230/lipics.icalp.2025.91\">https://doi.org/10.4230/lipics.icalp.2025.91</a>.","ista":"Goranci G, Henzinger M, Räcke H, Sricharan A. 2025. Incremental approximate maximum flow via residual graph sparsification. 52nd International Colloquium on Automata, Languages, and Programming. ICALP: Automata, Languages and Programming, LIPIcs, vol. 334, 91:1-91:20.","short":"G. Goranci, M. Henzinger, H. Räcke, A. Sricharan, in:, 52nd International Colloquium on Automata, Languages, and Programming, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025, p. 91:1-91:20.","mla":"Goranci, Gramoz, et al. “Incremental Approximate Maximum Flow via Residual Graph Sparsification.” <i>52nd International Colloquium on Automata, Languages, and Programming</i>, vol. 334, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025, p. 91:1-91:20, doi:<a href=\"https://doi.org/10.4230/lipics.icalp.2025.91\">10.4230/lipics.icalp.2025.91</a>.","apa":"Goranci, G., Henzinger, M., Räcke, H., &#38; Sricharan, A. (2025). Incremental approximate maximum flow via residual graph sparsification. In <i>52nd International Colloquium on Automata, Languages, and Programming</i> (Vol. 334, p. 91:1-91:20). Aarhus, Denmark: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/lipics.icalp.2025.91\">https://doi.org/10.4230/lipics.icalp.2025.91</a>"},"quality_controlled":"1","volume":334,"OA_type":"gold","language":[{"iso":"eng"}],"project":[{"call_identifier":"H2020","_id":"bd9ca328-d553-11ed-ba76-dc4f890cfe62","name":"The design and evaluation of modern fully dynamic data structures","grant_number":"101019564"},{"name":"Efficient algorithms","grant_number":"Z00422","_id":"34def286-11ca-11ed-8bc3-da5948e1613c"},{"_id":"bda196b2-d553-11ed-ba76-8e8ee6c21103","name":"Static and Dynamic Hierarchical Graph Decompositions","grant_number":"I05982"},{"_id":"bd9e3a2e-d553-11ed-ba76-8aa684ce17fe","name":"Fast Algorithms for a Reactive Network Layer","grant_number":"P33775"}],"title":"Incremental approximate maximum flow via residual graph sparsification","type":"conference","publication_status":"published","publication_identifier":{"isbn":["9783959773720"]},"year":"2025","acknowledgement":"Monika Henzinger and A. R. Sricharan: This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation\r\nprogramme (MoDynStruct, No. 101019564) and the Austrian Science Fund (FWF) grant DOI\r\n10.55776/Z422, grant DOI 10.55776/I5982, and grant DOI 10.55776/P33775 with additional funding from the netidee SCIENCE Stiftung, 2020–2024. Harald Räcke: This project has received funding from the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) – 498605858 and 470029389.","doi":"10.4230/lipics.icalp.2025.91","date_created":"2026-02-17T08:26:06Z","alternative_title":["LIPIcs"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","conference":{"location":"Aarhus, Denmark","start_date":"2025-07-08","name":"ICALP: Automata, Languages and Programming","end_date":"2025-07-11"},"abstract":[{"text":"We give an algorithm that, with high probability, maintains a (1-ε)-approximate s-t maximum flow in undirected, uncapacitated n-vertex graphs undergoing m edge insertions in Õ(m+ n F^*/ε) total update time, where F^{*} is the maximum flow on the final graph. This is the first algorithm to achieve polylogarithmic amortized update time for dense graphs (m = Ω(n²)), and more generally, for graphs where F^* = Õ(m/n). At the heart of our incremental algorithm is the residual graph sparsification technique of Karger and Levine [SICOMP '15], originally designed for computing exact maximum flows in the static setting. Our main contributions are (i) showing how to maintain such sparsifiers for approximate maximum flows in the incremental setting and (ii) generalizing the cut sparsification framework of Fung et al. [SICOMP '19] from undirected graphs to balanced directed graphs.","lang":"eng"}],"file":[{"file_name":"2025_ICALP_Goranci.pdf","file_id":"21315","access_level":"open_access","relation":"main_file","checksum":"c178cf554e44204b9f64ebd9b54cf7ba","success":1,"content_type":"application/pdf","date_created":"2026-02-18T09:02:33Z","file_size":944824,"creator":"dernst","date_updated":"2026-02-18T09:02:33Z"}],"external_id":{"arxiv":["2502.09105"]},"date_published":"2025-06-30T00:00:00Z","publication":"52nd International Colloquium on Automata, Languages, and Programming","day":"30","author":[{"last_name":"Goranci","full_name":"Goranci, Gramoz","first_name":"Gramoz"},{"orcid":"0000-0002-5008-6530","first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H","last_name":"Henzinger"},{"first_name":"Harald","last_name":"Räcke","full_name":"Räcke, Harald"},{"last_name":"Sricharan","full_name":"Sricharan, A.","first_name":"A."}],"oa_version":"Published Version"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","conference":{"location":"Vancouver, Canada","name":"NeurIPS: Neural Information Processing Systems","start_date":"2024-12-09","end_date":"2024-12-15"},"alternative_title":["Advances in Neural Information Processing Systems"],"date_created":"2025-04-06T22:01:32Z","acknowledgement":"Monika Henzinger: This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (Grant agreement No. 101019564) and the Austrian Science Fund (FWF) grant DOI 10.55776/Z422, grant DOI 10.55776/I5982, and grant DOI 10.55776/P33775 with additional funding from the netidee SCIENCE Stiftung, 2020–2024. Joel Daniel Andersson and Rasmus Pagh are affiliated with Basic Algorithms Research Copenhagen (BARC), supported by the VILLUM Foundation grant 16582, and are also supported by Providentia, a Data Science Distinguished Investigator grant from Novo Nordisk Fonden. Teresa Anna Steiner is supported by a research grant (VIL51463) from VILLUM FONDEN. This work was done while Teresa Anna Steiner was a Postdoc at the Technical University of Denmark. Jalaj Upadhyay’s research was funded by the Rutgers Decanal Grant no. 302918 and an unrestricted gift from Google.","year":"2024","publication_identifier":{"issn":["1049-5258"]},"publication_status":"published","project":[{"call_identifier":"H2020","_id":"bd9ca328-d553-11ed-ba76-dc4f890cfe62","name":"The design and evaluation of modern fully dynamic data structures","grant_number":"101019564"},{"name":"Efficient algorithms","grant_number":"Z00422","_id":"34def286-11ca-11ed-8bc3-da5948e1613c"},{"name":"Static and Dynamic Hierarchical Graph Decompositions","grant_number":"I05982","_id":"bda196b2-d553-11ed-ba76-8e8ee6c21103"},{"_id":"bd9e3a2e-d553-11ed-ba76-8aa684ce17fe","grant_number":"P33775","name":"Fast Algorithms for a Reactive Network Layer"}],"type":"conference","title":"Continual counting with gradual privacy expiration","language":[{"iso":"eng"}],"oa_version":"Preprint","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2406.03802"}],"author":[{"last_name":"Andersson","full_name":"Andersson, Joel Daniel","first_name":"Joel Daniel"},{"last_name":"Henzinger","full_name":"Henzinger, Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H","orcid":"0000-0002-5008-6530"},{"first_name":"Rasmus","full_name":"Pagh, Rasmus","last_name":"Pagh"},{"first_name":"Teresa Anna","last_name":"Steiner","full_name":"Steiner, Teresa Anna"},{"last_name":"Upadhyay","full_name":"Upadhyay, Jalaj","first_name":"Jalaj"}],"day":"20","publication":"38th Conference on Neural Information Processing Systems","external_id":{"arxiv":["2406.03802"]},"date_published":"2024-12-20T00:00:00Z","abstract":[{"lang":"eng","text":"Differential privacy with gradual expiration models the setting where data items\r\narrive in a stream and at a given time t the privacy loss guaranteed for a data item\r\nseen at time (t − d) is εg(d), where g is a monotonically non-decreasing function.\r\nWe study the fundamental continual (binary) counting problem where each data\r\nitem consists of a bit, and the algorithm needs to output at each time step the sum of\r\nall the bits streamed so far. For a stream of length T and privacy without expiration\r\ncontinual counting is possible with maximum (over all time steps) additive error\r\nO(log2\r\n(T)/ε) and the best known lower bound is Ω(log(T)/ε); closing this gap\r\nis a challenging open problem.\r\nWe show that the situation is very different for privacy with gradual expiration by\r\ngiving upper and lower bounds for a large set of expiration functions g. Specifically,\r\nour algorithm achieves an additive error of O(log(T)/ε) for a large set of privacy\r\nexpiration functions. We also give a lower bound that shows that if C is the additive\r\nerror of any ε-DP algorithm for this problem, then the product of C and the privacy\r\nexpiration function after 2C steps must be Ω(log(T)/ε). Our algorithm matches\r\nthis lower bound as its additive error is O(log(T)/ε), even when g(2C) = O(1).\r\nOur empirical evaluation shows that we achieve a slowly growing privacy loss\r\nwith significantly smaller empirical privacy loss for large values of d than a natural\r\nbaseline algorithm."}],"oa":1,"date_updated":"2025-05-14T11:33:22Z","status":"public","corr_author":"1","_id":"19512","arxiv":1,"scopus_import":"1","department":[{"_id":"MoHe"}],"OA_type":"green","volume":37,"quality_controlled":"1","citation":{"short":"J.D. Andersson, M. Henzinger, R. Pagh, T.A. Steiner, J. Upadhyay, in:, 38th Conference on Neural Information Processing Systems, Neural Information Processing Systems Foundation, 2024.","ista":"Andersson JD, Henzinger M, Pagh R, Steiner TA, Upadhyay J. 2024. Continual counting with gradual privacy expiration. 38th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems, Advances in Neural Information Processing Systems, vol. 37.","mla":"Andersson, Joel Daniel, et al. “Continual Counting with Gradual Privacy Expiration.” <i>38th Conference on Neural Information Processing Systems</i>, vol. 37, Neural Information Processing Systems Foundation, 2024.","apa":"Andersson, J. D., Henzinger, M., Pagh, R., Steiner, T. A., &#38; Upadhyay, J. (2024). Continual counting with gradual privacy expiration. In <i>38th Conference on Neural Information Processing Systems</i> (Vol. 37). Vancouver, Canada: Neural Information Processing Systems Foundation.","ieee":"J. D. Andersson, M. Henzinger, R. Pagh, T. A. Steiner, and J. Upadhyay, “Continual counting with gradual privacy expiration,” in <i>38th Conference on Neural Information Processing Systems</i>, Vancouver, Canada, 2024, vol. 37.","chicago":"Andersson, Joel Daniel, Monika Henzinger, Rasmus Pagh, Teresa Anna Steiner, and Jalaj Upadhyay. “Continual Counting with Gradual Privacy Expiration.” In <i>38th Conference on Neural Information Processing Systems</i>, Vol. 37. Neural Information Processing Systems Foundation, 2024.","ama":"Andersson JD, Henzinger M, Pagh R, Steiner TA, Upadhyay J. Continual counting with gradual privacy expiration. In: <i>38th Conference on Neural Information Processing Systems</i>. Vol 37. Neural Information Processing Systems Foundation; 2024."},"article_processing_charge":"No","ec_funded":1,"OA_place":"repository","month":"12","intvolume":"        37","publisher":"Neural Information Processing Systems Foundation"},{"publisher":"ML Research Press","intvolume":"       235","month":"09","ec_funded":1,"article_processing_charge":"No","page":"2086-2107","citation":{"ama":"Axiotis K, Cohen-Addad V, Henzinger M, et al. Data-efficient learning via clustering-based sensitivity sampling: Foundation models and beyond. In: <i>Proceedings of the 41st International Conference on Machine Learning</i>. Vol 235. ML Research Press; 2024:2086-2107.","chicago":"Axiotis, Kyriakos, Vincent Cohen-Addad, Monika Henzinger, Sammy Jerome, Vahab Mirrokni, David Saulpic, David P. Woodruff, and Michael Wunder. “Data-Efficient Learning via Clustering-Based Sensitivity Sampling: Foundation Models and Beyond.” In <i>Proceedings of the 41st International Conference on Machine Learning</i>, 235:2086–2107. ML Research Press, 2024.","ieee":"K. Axiotis <i>et al.</i>, “Data-efficient learning via clustering-based sensitivity sampling: Foundation models and beyond,” in <i>Proceedings of the 41st International Conference on Machine Learning</i>, Vienna, Austria, 2024, vol. 235, pp. 2086–2107.","mla":"Axiotis, Kyriakos, et al. “Data-Efficient Learning via Clustering-Based Sensitivity Sampling: Foundation Models and Beyond.” <i>Proceedings of the 41st International Conference on Machine Learning</i>, vol. 235, ML Research Press, 2024, pp. 2086–107.","apa":"Axiotis, K., Cohen-Addad, V., Henzinger, M., Jerome, S., Mirrokni, V., Saulpic, D., … Wunder, M. (2024). Data-efficient learning via clustering-based sensitivity sampling: Foundation models and beyond. In <i>Proceedings of the 41st International Conference on Machine Learning</i> (Vol. 235, pp. 2086–2107). Vienna, Austria: ML Research Press.","ista":"Axiotis K, Cohen-Addad V, Henzinger M, Jerome S, Mirrokni V, Saulpic D, Woodruff DP, Wunder M. 2024. Data-efficient learning via clustering-based sensitivity sampling: Foundation models and beyond. Proceedings of the 41st International Conference on Machine Learning. ICML: International Conference on Machine Learning, PMLR, vol. 235, 2086–2107.","short":"K. Axiotis, V. Cohen-Addad, M. Henzinger, S. Jerome, V. Mirrokni, D. Saulpic, D.P. Woodruff, M. Wunder, in:, Proceedings of the 41st International Conference on Machine Learning, ML Research Press, 2024, pp. 2086–2107."},"volume":235,"quality_controlled":"1","ddc":["000"],"department":[{"_id":"MoHe"}],"arxiv":1,"scopus_import":"1","_id":"18115","status":"public","date_updated":"2026-06-18T18:00:19Z","oa":1,"abstract":[{"lang":"eng","text":"We study the data selection problem, whose aim is to select a small representative subset of data that can be used to efficiently train a machine learning model. We present a new data selection approach based on k-means clustering and sensitivity sampling. Assuming access to an embedding representation of the data with respect to which the model loss is Holder continuous, our approach provably allows selecting a set of “typical” k+1/ε2 elements whose average loss corresponds to the average loss of the whole dataset, up to a multiplicative (1±ε)\r\n factor and an additive ελΦk, where Φk represents the k-means cost for the input embeddings and λ is the Holder constant. We furthermore demonstrate the performance and scalability of our approach on fine-tuning foundation models and show that it outperforms state-of-the-art methods. We also show how it can be applied on linear regression, leading to a new sampling strategy that surprisingly matches the performance of leverage score sampling, while being conceptually simpler and more scalable."}],"date_published":"2024-09-01T00:00:00Z","external_id":{"arxiv":["2402.17327"]},"publication":"Proceedings of the 41st International Conference on Machine Learning","day":"01","author":[{"first_name":"Kyriakos","last_name":"Axiotis","full_name":"Axiotis, Kyriakos"},{"first_name":"Vincent","last_name":"Cohen-Addad","full_name":"Cohen-Addad, Vincent"},{"orcid":"0000-0002-5008-6530","last_name":"Henzinger","full_name":"Henzinger, Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H"},{"first_name":"Sammy","last_name":"Jerome","full_name":"Jerome, Sammy"},{"first_name":"Vahab","full_name":"Mirrokni, Vahab","last_name":"Mirrokni"},{"full_name":"Saulpic, David","last_name":"Saulpic","first_name":"David","id":"f8e48cf0-b0ff-11ed-b0e9-b4c35598f964"},{"full_name":"Woodruff, David P.","last_name":"Woodruff","first_name":"David P."},{"first_name":"Michael","last_name":"Wunder","full_name":"Wunder, Michael"}],"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2402.17327","open_access":"1"}],"oa_version":"Published Version","language":[{"iso":"eng"}],"project":[{"_id":"bd9ca328-d553-11ed-ba76-dc4f890cfe62","grant_number":"101019564","name":"The design and evaluation of modern fully dynamic data structures","call_identifier":"H2020"},{"grant_number":"Z00422","name":"Efficient algorithms","_id":"34def286-11ca-11ed-8bc3-da5948e1613c"},{"_id":"bda196b2-d553-11ed-ba76-8e8ee6c21103","name":"Static and Dynamic Hierarchical Graph Decompositions","grant_number":"I05982"},{"name":"Fast Algorithms for a Reactive Network Layer","grant_number":"P33775","_id":"bd9e3a2e-d553-11ed-ba76-8aa684ce17fe"},{"_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","name":"IST-BRIDGE: International postdoctoral program","grant_number":"101034413","call_identifier":"H2020"}],"title":"Data-efficient learning via clustering-based sensitivity sampling: Foundation models and beyond","type":"conference","publication_status":"published","year":"2024","publication_identifier":{"eissn":["2640-3498"]},"acknowledgement":"Monika Henzinger: This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (Grant agreement No. 101019564) and the Austrian Science Fund (FWF) grant DOI 10.55776/Z422, grant DOI 10.55776/I5982, and grant DOI 10.55776/P33775 with additional funding from the netidee SCIENCE Stiftung, 2020–2024. This work was partially done while David Saulpic was at the Institute for Science and Technology, Austria (ISTA). David Sauplic has received funding from the European Union’s Horizon 2020 research and innovation programme under the\r\nMarie Sklodowska-Curie grant agreement No 101034413. Work was done while David Woodruff was visiting Google Research.","date_created":"2024-09-22T22:01:44Z","alternative_title":["PMLR"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","conference":{"end_date":"2024-07-27","location":"Vienna, Austria","name":"ICML: International Conference on Machine Learning","start_date":"2024-07-21"}},{"citation":{"chicago":"La Tour, Max Dupré, Monika Henzinger, and David Saulpic. “Making Old Things New: A Unified Algorithm for Differentially Private Clustering.” In <i>Proceedings of the 41st International Conference on Machine Learning</i>, 235:12046–86. ML Research Press, 2024.","ama":"La Tour MD, Henzinger M, Saulpic D. Making old things new: A unified algorithm for differentially private clustering. In: <i>Proceedings of the 41st International Conference on Machine Learning</i>. Vol 235. ML Research Press; 2024:12046-12086.","ieee":"M. D. La Tour, M. Henzinger, and D. Saulpic, “Making old things new: A unified algorithm for differentially private clustering,” in <i>Proceedings of the 41st International Conference on Machine Learning</i>, Vienna, Austria, 2024, vol. 235, pp. 12046–12086.","mla":"La Tour, Max Dupré, et al. “Making Old Things New: A Unified Algorithm for Differentially Private Clustering.” <i>Proceedings of the 41st International Conference on Machine Learning</i>, vol. 235, ML Research Press, 2024, pp. 12046–86.","apa":"La Tour, M. D., Henzinger, M., &#38; Saulpic, D. (2024). Making old things new: A unified algorithm for differentially private clustering. In <i>Proceedings of the 41st International Conference on Machine Learning</i> (Vol. 235, pp. 12046–12086). Vienna, Austria: ML Research Press.","short":"M.D. La Tour, M. Henzinger, D. Saulpic, in:, Proceedings of the 41st International Conference on Machine Learning, ML Research Press, 2024, pp. 12046–12086.","ista":"La Tour MD, Henzinger M, Saulpic D. 2024. Making old things new: A unified algorithm for differentially private clustering. Proceedings of the 41st International Conference on Machine Learning. ICML: International Conference on Machine Learning, PMLR, vol. 235, 12046–12086."},"quality_controlled":"1","volume":235,"article_processing_charge":"No","ec_funded":1,"page":"12046-12086","month":"09","publisher":"ML Research Press","intvolume":"       235","oa":1,"date_updated":"2026-06-18T18:01:02Z","_id":"18116","corr_author":"1","status":"public","ddc":["000"],"department":[{"_id":"MoHe"}],"scopus_import":"1","arxiv":1,"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2406.11649"}],"oa_version":"Published Version","day":"01","author":[{"first_name":"Max Dupré","last_name":"La Tour","full_name":"La Tour, Max Dupré"},{"orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H","last_name":"Henzinger","full_name":"Henzinger, Monika H"},{"id":"f8e48cf0-b0ff-11ed-b0e9-b4c35598f964","first_name":"David","last_name":"Saulpic","full_name":"Saulpic, David"}],"date_published":"2024-09-01T00:00:00Z","external_id":{"arxiv":["2406.11649"]},"publication":"Proceedings of the 41st International Conference on Machine Learning","abstract":[{"text":"As a staple of data analysis and unsupervised learning, the problem of private clustering has been widely studied, under various privacy models. Centralized differential privacy is the first of them, and the problem has also been studied for the local and the shuffle variation. In each case, the goal is to design an algorithm that computes privately a clustering, with the smallest possible error. The study of each variation gave rise to new algorithm: the landscape of private clustering algorithm is therefore quite intricate. In this paper, we show that a 20 year-old algorithm can be slightly modified to work for any of those models. This provides a unified picture: while matching almost all previously known results, it allows us to improve some of them, and extend to a new privacy model, the continual observation setting, where the input is changing over time and the algorithm must output a new solution at each time step.","lang":"eng"}],"date_created":"2024-09-22T22:01:44Z","alternative_title":["PMLR"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","conference":{"end_date":"2024-07-27","name":"ICML: International Conference on Machine Learning","start_date":"2024-07-21","location":"Vienna, Austria"},"year":"2024","publication_identifier":{"eissn":["2640-3498"]},"acknowledgement":"Monika Henzinger: This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (Grant agreement No. 101019564) and the Austrian Science Fund (FWF) grant DOI 10.55776/Z422, grant DOI 10.55776/I5982, and grant DOI 10.55776/P33775 with additional funding from the netidee SCIENCE Stiftung, 2020–2024.This work was partially done while David Saulpic was at the Institute for Science and Technology, Austria (ISTA). David Sauplic has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Sklodowska-Curie grant agreement No 101034413.","publication_status":"published","language":[{"iso":"eng"}],"project":[{"call_identifier":"H2020","_id":"bd9ca328-d553-11ed-ba76-dc4f890cfe62","grant_number":"101019564","name":"The design and evaluation of modern fully dynamic data structures"},{"name":"Efficient algorithms","grant_number":"Z00422","_id":"34def286-11ca-11ed-8bc3-da5948e1613c"},{"grant_number":"I05982","name":"Static and Dynamic Hierarchical Graph Decompositions","_id":"bda196b2-d553-11ed-ba76-8e8ee6c21103"},{"_id":"bd9e3a2e-d553-11ed-ba76-8aa684ce17fe","name":"Fast Algorithms for a Reactive Network Layer","grant_number":"P33775"},{"_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","name":"IST-BRIDGE: International postdoctoral program","grant_number":"101034413","call_identifier":"H2020"}],"type":"conference","title":"Making old things new: A unified algorithm for differentially private clustering"},{"author":[{"orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H","last_name":"Henzinger","full_name":"Henzinger, Monika H"},{"first_name":"A. R.","last_name":"Sricharan","full_name":"Sricharan, A. R."},{"last_name":"Steiner","full_name":"Steiner, Teresa Anna","first_name":"Teresa Anna"}],"day":"16","oa_version":"Published Version","abstract":[{"lang":"eng","text":"Privately counting distinct elements in a stream is a fundamental data analysis problem with many applications in machine learning. In the turnstile model, Jain et al. [NeurIPS2023] initiated the study of this problem parameterized by the maximum flippancy of any element, i.e., the number of times that the count of an element changes from 0 to above 0 or vice versa. They give an item-level (ε,δ)-differentially private algorithm whose additive error is tight with respect to that parameterization. In this work, we show that a very simple algorithm based on the sparse vector technique achieves a tight additive error for item-level (ε,δ)-differential privacy and item-level ε-differential privacy with regards to a different parameterization, namely the sum of all flippancies. Our second result is a bound which shows that for a large class of algorithms, including all existing differentially private algorithms for this problem, the lower bound from item-level differential privacy extends to event-level differential privacy. This partially answers an open question by Jain et al. [NeurIPS2023]."}],"publication":"International Conference on Approximation Algorithms for Combinatorial Optimization Problems ","date_published":"2024-09-16T00:00:00Z","external_id":{"isi":["001545634500040"],"arxiv":["2408.11637"]},"file":[{"checksum":"c08b41c896e4d8c69570044808b40e0b","relation":"main_file","access_level":"open_access","file_name":"2024_LIPICs_HenzingerM.pdf","file_id":"18166","date_updated":"2024-10-01T10:07:14Z","creator":"dernst","file_size":973917,"success":1,"date_created":"2024-10-01T10:07:14Z","content_type":"application/pdf"}],"doi":"10.4230/LIPIcs.APPROX/RANDOM.2024.40","acknowledgement":"Monika Henzinger: This project has received funding from the European Research Council\r\n(ERC) under the European Union’s Horizon 2020 research and innovation programme (MoDynStruct,No. 101019564) and the Austrian Science Fund (FWF) grant DOI 10.55776/Z422, grant DOI 10.55776/I5982, and grant DOI 10.55776/P33775 with additional funding from the netidee SCIENCE Stiftung, 2020–2024.\r\nTeresa Anna Steiner: Supported by a research grant (VIL51463) from VILLUM FONDEN.","publication_identifier":{"issn":["1868-8969"],"isbn":["9783959773485"]},"year":"2024","article_number":"40","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","conference":{"end_date":"2024-08-30","start_date":"2024-08-27","name":"APPROX: Conference on Approximation Algorithms for Combinatorial Optimization Problems","location":"London, United Kingdom"},"alternative_title":["LIPIcs"],"date_created":"2024-09-29T22:01:38Z","project":[{"call_identifier":"H2020","name":"The design and evaluation of modern fully dynamic data structures","grant_number":"101019564","_id":"bd9ca328-d553-11ed-ba76-dc4f890cfe62"},{"_id":"34def286-11ca-11ed-8bc3-da5948e1613c","name":"Efficient algorithms","grant_number":"Z00422"},{"_id":"bda196b2-d553-11ed-ba76-8e8ee6c21103","name":"Static and Dynamic Hierarchical Graph Decompositions","grant_number":"I05982"},{"_id":"bd9e3a2e-d553-11ed-ba76-8aa684ce17fe","name":"Fast Algorithms for a Reactive Network Layer","grant_number":"P33775"}],"type":"conference","title":"Private counting of distinct elements in the turnstile model and extensions","language":[{"iso":"eng"}],"isi":1,"publication_status":"published","ec_funded":1,"article_processing_charge":"No","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)"},"volume":317,"quality_controlled":"1","has_accepted_license":"1","citation":{"ista":"Henzinger M, Sricharan AR, Steiner TA. 2024. Private counting of distinct elements in the turnstile model and extensions. International Conference on Approximation Algorithms for Combinatorial Optimization Problems . APPROX: Conference on Approximation Algorithms for Combinatorial Optimization Problems, LIPIcs, vol. 317, 40.","short":"M. Henzinger, A.R. Sricharan, T.A. Steiner, in:, International Conference on Approximation Algorithms for Combinatorial Optimization Problems , Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.","mla":"Henzinger, Monika, et al. “Private Counting of Distinct Elements in the Turnstile Model and Extensions.” <i>International Conference on Approximation Algorithms for Combinatorial Optimization Problems </i>, vol. 317, 40, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, doi:<a href=\"https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.40\">10.4230/LIPIcs.APPROX/RANDOM.2024.40</a>.","apa":"Henzinger, M., Sricharan, A. R., &#38; Steiner, T. A. (2024). Private counting of distinct elements in the turnstile model and extensions. In <i>International Conference on Approximation Algorithms for Combinatorial Optimization Problems </i> (Vol. 317). London, United Kingdom: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.40\">https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.40</a>","ieee":"M. Henzinger, A. R. Sricharan, and T. A. Steiner, “Private counting of distinct elements in the turnstile model and extensions,” in <i>International Conference on Approximation Algorithms for Combinatorial Optimization Problems </i>, London, United Kingdom, 2024, vol. 317.","chicago":"Henzinger, Monika, A. R. Sricharan, and Teresa Anna Steiner. “Private Counting of Distinct Elements in the Turnstile Model and Extensions.” In <i>International Conference on Approximation Algorithms for Combinatorial Optimization Problems </i>, Vol. 317. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. <a href=\"https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.40\">https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.40</a>.","ama":"Henzinger M, Sricharan AR, Steiner TA. Private counting of distinct elements in the turnstile model and extensions. In: <i>International Conference on Approximation Algorithms for Combinatorial Optimization Problems </i>. Vol 317. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024. doi:<a href=\"https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.40\">10.4230/LIPIcs.APPROX/RANDOM.2024.40</a>"},"intvolume":"       317","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","month":"09","date_updated":"2025-12-02T13:47:16Z","oa":1,"arxiv":1,"scopus_import":"1","ddc":["000"],"department":[{"_id":"MoHe"}],"file_date_updated":"2024-10-01T10:07:14Z","status":"public","corr_author":"1","_id":"18156"},{"date_created":"2024-10-13T22:01:50Z","alternative_title":["LIPIcs"],"conference":{"end_date":"2024-09-04","location":"London, United Kingdom","name":"ESA: European Symposium on Algorithms","start_date":"2024-09-02"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_number":"100","year":"2024","publication_identifier":{"isbn":["9783959773386"],"issn":["1868-8969"]},"doi":"10.4230/LIPIcs.ESA.2024.100","acknowledgement":"Monika Henzinger: This project has received funding from the European Research Council\r\n(ERC) under the European Union’s Horizon 2020 research and innovation programme (MoDynStruct Grant agreement No. 101019564) and the Austrian Science Fund (FWF) grant DOI 10.55776/Z422, grant DOI 10.55776/I5982, and grant DOI 10.55776/P33775 with additional funding from the netidee SCIENCE Stiftung, 2020–2024.\r\nDavid Saulpic: Work partially done while at ISTA. Received funding from the European Union’s\r\nHorizon 2020 research and innovation programme under the Marie Sklodowska-Curie grant agreement No 101034413. This work was partially funded by the grant ANR-19-CE48-0016 from the French National Research Agency (ANR).","publication_status":"published","isi":1,"language":[{"iso":"eng"}],"type":"conference","title":"Fully dynamic k-means coreset in near-optimal update time","project":[{"name":"The design and evaluation of modern fully dynamic data structures","grant_number":"101019564","_id":"bd9ca328-d553-11ed-ba76-dc4f890cfe62","call_identifier":"H2020"},{"_id":"34def286-11ca-11ed-8bc3-da5948e1613c","name":"Efficient algorithms","grant_number":"Z00422"},{"name":"Static and Dynamic Hierarchical Graph Decompositions","grant_number":"I05982","_id":"bda196b2-d553-11ed-ba76-8e8ee6c21103"},{"_id":"bd9e3a2e-d553-11ed-ba76-8aa684ce17fe","name":"Fast Algorithms for a Reactive Network Layer","grant_number":"P33775"},{"call_identifier":"H2020","name":"IST-BRIDGE: International postdoctoral program","grant_number":"101034413","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c"}],"oa_version":"Published Version","day":"23","author":[{"first_name":"Max Dupré","last_name":"La Tour","full_name":"La Tour, Max Dupré"},{"orcid":"0000-0002-5008-6530","last_name":"Henzinger","full_name":"Henzinger, Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H"},{"first_name":"David","id":"f8e48cf0-b0ff-11ed-b0e9-b4c35598f964","full_name":"Saulpic, David","last_name":"Saulpic"}],"date_published":"2024-09-23T00:00:00Z","external_id":{"arxiv":["2406.19926"],"isi":["001545622400100"]},"file":[{"file_name":"2024_LIPICs_DuprelaTour.pdf","file_id":"18454","access_level":"open_access","relation":"main_file","checksum":"8e8c0b13049f11bb0133dfac22e32718","success":1,"date_created":"2024-10-21T09:41:48Z","content_type":"application/pdf","file_size":873561,"creator":"dernst","date_updated":"2024-10-21T09:41:48Z"}],"publication":"32nd Annual European Symposium on Algorithms","abstract":[{"text":"We study in this paper the problem of maintaining a solution to k-median and k-means clustering in a fully dynamic setting. To do so, we present an algorithm to efficiently maintain a coreset, a compressed version of the dataset, that allows easy computation of a clustering solution at query time. Our coreset algorithm has near-optimal update time of Õ(k) in general metric spaces, which reduces to Õ(d) in the Euclidean space ℝ^d. The query time is O(k²) in general metrics, and O(kd) in ℝ^d. To maintain a constant-factor approximation for k-median and k-means clustering in Euclidean space, this directly leads to an algorithm with update time Õ(d), and query time Õ(kd + k²). To maintain a O(polylog k)-approximation, the query time is reduced to Õ(kd).","lang":"eng"}],"oa":1,"date_updated":"2025-12-02T13:49:11Z","_id":"18308","corr_author":"1","status":"public","file_date_updated":"2024-10-21T09:41:48Z","department":[{"_id":"MoHe"}],"ddc":["000"],"arxiv":1,"scopus_import":"1","citation":{"chicago":"La Tour, Max Dupré, Monika Henzinger, and David Saulpic. “Fully Dynamic K-Means Coreset in near-Optimal Update Time.” In <i>32nd Annual European Symposium on Algorithms</i>, Vol. 308. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. <a href=\"https://doi.org/10.4230/LIPIcs.ESA.2024.100\">https://doi.org/10.4230/LIPIcs.ESA.2024.100</a>.","ama":"La Tour MD, Henzinger M, Saulpic D. Fully dynamic k-means coreset in near-optimal update time. In: <i>32nd Annual European Symposium on Algorithms</i>. Vol 308. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024. doi:<a href=\"https://doi.org/10.4230/LIPIcs.ESA.2024.100\">10.4230/LIPIcs.ESA.2024.100</a>","ieee":"M. D. La Tour, M. Henzinger, and D. Saulpic, “Fully dynamic k-means coreset in near-optimal update time,” in <i>32nd Annual European Symposium on Algorithms</i>, London, United Kingdom, 2024, vol. 308.","apa":"La Tour, M. D., Henzinger, M., &#38; Saulpic, D. (2024). Fully dynamic k-means coreset in near-optimal update time. In <i>32nd Annual European Symposium on Algorithms</i> (Vol. 308). London, United Kingdom: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.ESA.2024.100\">https://doi.org/10.4230/LIPIcs.ESA.2024.100</a>","mla":"La Tour, Max Dupré, et al. “Fully Dynamic K-Means Coreset in near-Optimal Update Time.” <i>32nd Annual European Symposium on Algorithms</i>, vol. 308, 100, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, doi:<a href=\"https://doi.org/10.4230/LIPIcs.ESA.2024.100\">10.4230/LIPIcs.ESA.2024.100</a>.","ista":"La Tour MD, Henzinger M, Saulpic D. 2024. Fully dynamic k-means coreset in near-optimal update time. 32nd Annual European Symposium on Algorithms. ESA: European Symposium on Algorithms, LIPIcs, vol. 308, 100.","short":"M.D. La Tour, M. Henzinger, D. Saulpic, in:, 32nd Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024."},"has_accepted_license":"1","quality_controlled":"1","OA_type":"gold","volume":308,"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)"},"ec_funded":1,"article_processing_charge":"Yes","month":"09","OA_place":"publisher","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","intvolume":"       308"},{"language":[{"iso":"eng"}],"project":[{"call_identifier":"H2020","grant_number":"101019564","name":"The design and evaluation of modern fully dynamic data structures","_id":"bd9ca328-d553-11ed-ba76-dc4f890cfe62"},{"_id":"34def286-11ca-11ed-8bc3-da5948e1613c","name":"Efficient algorithms","grant_number":"Z00422"},{"grant_number":"I05982","name":"Static and Dynamic Hierarchical Graph Decompositions","_id":"bda196b2-d553-11ed-ba76-8e8ee6c21103"},{"_id":"bd9e3a2e-d553-11ed-ba76-8aa684ce17fe","name":"Fast Algorithms for a Reactive Network Layer","grant_number":"P33775"}],"type":"conference","title":"Deterministic near-linear time minimum cut in weighted graphs","publication_status":"published","year":"2024","publication_identifier":{"eisbn":["9781611977912"]},"acknowledgement":"This project has received funding from the European Research Council(ERC) under the European Union’s Horizon 2020 research and innovation programme (Grant agreement No. 101019564 “The Design of Modern Fully Dynamic Data Structures (MoDyn-Struct)” and the Austrian Science Fund (FWF) project Z 422-N, project “Static and Dynamic Hierarchical Graph Decompositions”, I 5982-N, and project “Fast Algorithms for a Reactive Network Layer (ReactNet)”, P33775-N, with additional funding from the netidee SCIENCE Stiftung, 2020–2024.","doi":"10.1137/1.9781611977912.111","date_created":"2024-11-04T10:54:21Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","conference":{"end_date":"2024-01-10","start_date":"2024-01-07","name":"SODA: Symposium on Discrete Algorithms","location":"Alexandria, VA,  United States"},"abstract":[{"text":"In 1996, Karger [Kar96] gave a startling randomized algorithm that finds a minimum-cut in a (weighted) graph in time O(m log3 n) which he termed near-linear time meaning linear (in the size of the input) times a polylogarthmic factor. In this paper, we give the first deterministic algorithm which runs in near-linear time for weighted graphs.\r\nPreviously, the breakthrough results of Kawarabayashi and Thorup [KT19] gave a near-linear time algorithm for simple graphs (which was improved to have running time O(m log2 n log log n) in [HRW20].) The main technique here is a clustering procedure that perfectly preserves minimum cuts. Recently, Li [Li21] gave an m1+o(1) deterministic minimum-cut algorithm for weighted graphs; this form of running time has been termed “almost-linear”. Li uses almost-linear time deterministic expander decompositions which do not perfectly preserve minimum cuts, but he can use these clusterings to, in a sense, “derandomize” the methods of Karger.\r\nIn terms of techniques, we provide a structural theorem that says there exists a sparse clustering that preserves minimum cuts in a weighted graph with o(1) error. In addition, we construct it deterministically in near linear time. This was done exactly for simple graphs in [KT19, HRW20] and with polylogarithmic error for weighted graphs in [Li21]. Extending the techniques in [KT19, HRW20] to weighted graphs presents significant challenges, and moreover, the algorithm can only polylogarithmically approximately preserve minimum cuts. A remaining challenge is to reduce the polylogarithmic-approximate clusterings to 1 + o(1/ log n)-approximate so that they can be applied recursively as in [Li21] over O(log n) many levels. This is an additional challenge that requires building on properties of tree-packings in the presence of a wide range of edge weights to, for example, find sources for local flow computations which identify minimum cuts that cross clusters.","lang":"eng"}],"external_id":{"arxiv":["2401.05627"]},"date_published":"2024-01-04T00:00:00Z","publication":"35th Annual ACM-SIAM Symposium on Discrete Algorithms","day":"04","author":[{"orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H","last_name":"Henzinger","full_name":"Henzinger, Monika H"},{"full_name":"Li, Jason","last_name":"Li","first_name":"Jason"},{"first_name":"Satish","last_name":"Rao","full_name":"Rao, Satish"},{"last_name":"Wang","full_name":"Wang, Di","first_name":"Di"}],"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2401.05627","open_access":"1"}],"oa_version":"Preprint","department":[{"_id":"MoHe"}],"scopus_import":"1","arxiv":1,"corr_author":"1","_id":"18503","status":"public","date_updated":"2025-06-24T12:09:26Z","oa":1,"publisher":"Society for Industrial and Applied Mathematics","OA_place":"repository","month":"01","article_processing_charge":"No","ec_funded":1,"page":"3089-3139","citation":{"apa":"Henzinger, M., Li, J., Rao, S., &#38; Wang, D. (2024). Deterministic near-linear time minimum cut in weighted graphs. In <i>35th Annual ACM-SIAM Symposium on Discrete Algorithms</i> (pp. 3089–3139). Alexandria, VA,  United States: Society for Industrial and Applied Mathematics. <a href=\"https://doi.org/10.1137/1.9781611977912.111\">https://doi.org/10.1137/1.9781611977912.111</a>","mla":"Henzinger, Monika, et al. “Deterministic Near-Linear Time Minimum Cut in Weighted Graphs.” <i>35th Annual ACM-SIAM Symposium on Discrete Algorithms</i>, Society for Industrial and Applied Mathematics, 2024, pp. 3089–139, doi:<a href=\"https://doi.org/10.1137/1.9781611977912.111\">10.1137/1.9781611977912.111</a>.","short":"M. Henzinger, J. Li, S. Rao, D. Wang, in:, 35th Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2024, pp. 3089–3139.","ista":"Henzinger M, Li J, Rao S, Wang D. 2024. Deterministic near-linear time minimum cut in weighted graphs. 35th Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 3089–3139.","ama":"Henzinger M, Li J, Rao S, Wang D. Deterministic near-linear time minimum cut in weighted graphs. In: <i>35th Annual ACM-SIAM Symposium on Discrete Algorithms</i>. Society for Industrial and Applied Mathematics; 2024:3089-3139. doi:<a href=\"https://doi.org/10.1137/1.9781611977912.111\">10.1137/1.9781611977912.111</a>","chicago":"Henzinger, Monika, Jason Li, Satish Rao, and Di Wang. “Deterministic Near-Linear Time Minimum Cut in Weighted Graphs.” In <i>35th Annual ACM-SIAM Symposium on Discrete Algorithms</i>, 3089–3139. Society for Industrial and Applied Mathematics, 2024. <a href=\"https://doi.org/10.1137/1.9781611977912.111\">https://doi.org/10.1137/1.9781611977912.111</a>.","ieee":"M. Henzinger, J. Li, S. Rao, and D. Wang, “Deterministic near-linear time minimum cut in weighted graphs,” in <i>35th Annual ACM-SIAM Symposium on Discrete Algorithms</i>, Alexandria, VA,  United States, 2024, pp. 3089–3139."},"OA_type":"free access","quality_controlled":"1"},{"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","intvolume":"       319","OA_place":"publisher","month":"10","ec_funded":1,"article_processing_charge":"Yes","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)"},"has_accepted_license":"1","citation":{"ama":"El-Hayek A, Henzinger M, Schmid S. Broadcast and Consensus in stochastic dynamic networks with Byzantine nodes and adversarial edges. In: <i>38th International Symposium on Distributed Computing</i>. Vol 319. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024. doi:<a href=\"https://doi.org/10.4230/LIPIcs.DISC.2024.21\">10.4230/LIPIcs.DISC.2024.21</a>","chicago":"El-Hayek, Antoine, Monika Henzinger, and Stefan Schmid. “Broadcast and Consensus in Stochastic Dynamic Networks with Byzantine Nodes and Adversarial Edges.” In <i>38th International Symposium on Distributed Computing</i>, Vol. 319. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. <a href=\"https://doi.org/10.4230/LIPIcs.DISC.2024.21\">https://doi.org/10.4230/LIPIcs.DISC.2024.21</a>.","ieee":"A. El-Hayek, M. Henzinger, and S. Schmid, “Broadcast and Consensus in stochastic dynamic networks with Byzantine nodes and adversarial edges,” in <i>38th International Symposium on Distributed Computing</i>, Madrid, Spain, 2024, vol. 319.","apa":"El-Hayek, A., Henzinger, M., &#38; Schmid, S. (2024). Broadcast and Consensus in stochastic dynamic networks with Byzantine nodes and adversarial edges. In <i>38th International Symposium on Distributed Computing</i> (Vol. 319). Madrid, Spain: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.DISC.2024.21\">https://doi.org/10.4230/LIPIcs.DISC.2024.21</a>","mla":"El-Hayek, Antoine, et al. “Broadcast and Consensus in Stochastic Dynamic Networks with Byzantine Nodes and Adversarial Edges.” <i>38th International Symposium on Distributed Computing</i>, vol. 319, 21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, doi:<a href=\"https://doi.org/10.4230/LIPIcs.DISC.2024.21\">10.4230/LIPIcs.DISC.2024.21</a>.","ista":"El-Hayek A, Henzinger M, Schmid S. 2024. Broadcast and Consensus in stochastic dynamic networks with Byzantine nodes and adversarial edges. 38th International Symposium on Distributed Computing. DISC: Symposium on Distributed Computing, LIPIcs, vol. 319, 21.","short":"A. El-Hayek, M. Henzinger, S. Schmid, in:, 38th International Symposium on Distributed Computing, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024."},"volume":319,"OA_type":"gold","quality_controlled":"1","ddc":["000"],"file_date_updated":"2024-11-18T08:02:45Z","department":[{"_id":"MoHe"}],"scopus_import":"1","arxiv":1,"_id":"18557","corr_author":"1","status":"public","date_updated":"2025-12-02T13:51:28Z","oa":1,"abstract":[{"text":"Broadcast and Consensus are most fundamental tasks in distributed computing. These tasks are particularly challenging in dynamic networks where communication across the network links may be unreliable, e.g., due to mobility or failures. Over the last years, researchers have derived several impossibility results and high time complexity lower bounds for these tasks. Specifically for the setting where in each round of communication the adversary is allowed to choose one rooted tree along which the information is disseminated, there is a lower as well as an upper bound that is linear in the number n of nodes for Broadcast and for n ≥ 3 the adversary can guarantee that Consensus never happens. This setting is called the oblivious message adversary for rooted trees. Also note that if the adversary is allowed to choose a graph that does not contain a rooted tree, then it can guarantee that Broadcast and Consensus will never happen. However, such deterministic adversarial models may be overly pessimistic, as many processes in real-world settings are stochastic in nature rather than worst-case. This paper studies Broadcast on stochastic dynamic networks and shows that the situation is very different to the deterministic case. In particular, we show that if information dissemination occurs along random rooted trees and directed Erdős–Rényi graphs, Broadcast completes in O(log n) rounds of communication with high probability. The fundamental insight in our analysis is that key variables are mutually independent. We then study two adversarial models, (a) one with Byzantine nodes and (b) one where an adversary controls the edges. (a) Our techniques without Byzantine nodes are general enough so that they can be extended to Byzantine nodes. (b) In the spirit of smoothed analysis, we introduce the notion of randomized oblivious message adversary, where in each round, an adversary picks k ≤ 2n/3 edges to appear in the communication network, and then a graph (e.g. rooted tree or directed Erdős–Rényi graph) is chosen uniformly at random among the set of all such graphs that include these edges. We show that Broadcast completes in a finite number of rounds, which is, e.g., O(k+log n) rounds in rooted trees. We then extend these results to All-to-All Broadcast, and Consensus, and give lower bounds that show that most of our upper bounds are tight.","lang":"eng"}],"file":[{"date_created":"2024-11-18T08:02:45Z","content_type":"application/pdf","success":1,"file_size":809666,"creator":"dernst","date_updated":"2024-11-18T08:02:45Z","file_id":"18561","file_name":"2024_LIPIcs_ElHayek.pdf","relation":"main_file","access_level":"open_access","checksum":"d6c8277331cafa188c33ba1717206cf4"}],"date_published":"2024-10-24T00:00:00Z","external_id":{"isi":["001542467600021"],"arxiv":["2302.11988"]},"publication":"38th International Symposium on Distributed Computing","day":"24","author":[{"orcid":"0000-0003-4268-7368","id":"888a098e-fcac-11ee-aff7-d347be57b725","first_name":"Antoine","last_name":"El-Hayek","full_name":"El-Hayek, Antoine"},{"orcid":"0000-0002-5008-6530","last_name":"Henzinger","full_name":"Henzinger, Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H"},{"first_name":"Stefan","last_name":"Schmid","full_name":"Schmid, Stefan"}],"oa_version":"Published Version","language":[{"iso":"eng"}],"isi":1,"project":[{"_id":"bd9e3a2e-d553-11ed-ba76-8aa684ce17fe","name":"Fast Algorithms for a Reactive Network Layer","grant_number":"P33775"},{"grant_number":"101019564","name":"The design and evaluation of modern fully dynamic data structures","_id":"bd9ca328-d553-11ed-ba76-dc4f890cfe62","call_identifier":"H2020"},{"_id":"34def286-11ca-11ed-8bc3-da5948e1613c","name":"Efficient algorithms","grant_number":"Z00422"},{"_id":"bda196b2-d553-11ed-ba76-8e8ee6c21103","grant_number":"I05982","name":"Static and Dynamic Hierarchical Graph Decompositions"}],"title":"Broadcast and Consensus in stochastic dynamic networks with Byzantine nodes and adversarial edges","type":"conference","publication_status":"published","article_number":"21","year":"2024","publication_identifier":{"isbn":["9783959773522"],"issn":["1868-8969"]},"doi":"10.4230/LIPIcs.DISC.2024.21","acknowledgement":"Antoine El-Hayek: This project has received funding from the Austrian Science Fund\r\n(FWF) grant DOI 10.55776/P33775 with additional funding from the netidee SCIENCE Stiftung,\r\n2020–2024.\r\nMonika Henzinger: This project has received funding from the European Research Council (ERC)\r\nunder the European Union’s Horizon 2020 research and innovation programme (MoDynStruct,\r\nNo. 101019564) and the Austrian Science Fund (FWF) grant DOI 10.55776/Z422, grant DOI\r\n10.55776/I5982, and grant DOI 10.55776/P33775 with additional funding from the netidee SCIENCE\r\nStiftung, 2020–2024.\r\nStefan Schmid: This project has received funding from the German Research Foundation (DFG),\r\nSPP 2378 (project ReNO), 2023-2027.","date_created":"2024-11-17T23:01:47Z","alternative_title":["LIPIcs"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","conference":{"name":"DISC: Symposium on Distributed Computing","start_date":"2024-10-28","location":"Madrid, Spain","end_date":"2024-11-01"}},{"publication_status":"published","project":[{"_id":"bd9ca328-d553-11ed-ba76-dc4f890cfe62","name":"The design and evaluation of modern fully dynamic data structures","grant_number":"101019564","call_identifier":"H2020"},{"_id":"34def286-11ca-11ed-8bc3-da5948e1613c","name":"Efficient algorithms","grant_number":"Z00422"},{"grant_number":"I05982","name":"Static and Dynamic Hierarchical Graph Decompositions","_id":"bda196b2-d553-11ed-ba76-8e8ee6c21103"}],"title":"Expander hierarchies for normalized cuts on graphs","type":"conference","isi":1,"language":[{"iso":"eng"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","conference":{"location":"Barcelona, Spain","name":"KDD: Knowledge Discovery and Data Mining","start_date":"2024-08-05","end_date":"2024-08-29"},"date_created":"2025-01-27T13:20:26Z","doi":"10.1145/3637528.3671978","acknowledgement":"Monika Henzinger: This project has received funding from the European Research\r\nCouncil (ERC) under the European Union’s Horizon 2020 research and innovation programme (Grant agreement No. 101019564) and the Austrian Science Fund (FWF) grant DOI 10.55776/Z422, grant DOI 10.55776/I5982, and grant DOI 10.55776/P33775 with additional funding from the netidee SCIENCE Stiftung, 2020–2024.\r\nHarald Räcke, Robin Münk: This project has received funding from the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) – 498605858 and 470029389.","publication_identifier":{"isbn":["9798400704901"]},"year":"2024","publication":"Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","date_published":"2024-09-01T00:00:00Z","external_id":{"isi":["001324524201013"]},"file":[{"checksum":"1265d5cf6aa5f94157631651723c4a2b","file_name":"2024_ACMKDD_Hanauer.pdf","file_id":"18907","relation":"main_file","access_level":"open_access","creator":"dernst","date_updated":"2025-01-27T13:25:23Z","success":1,"date_created":"2025-01-27T13:25:23Z","content_type":"application/pdf","file_size":1450331}],"abstract":[{"text":"Expander decompositions of graphs have significantly advanced the understanding of many classical graph problems and led to numerous fundamental theoretical results. However, their adoption in practice has been hindered due to their inherent intricacies and large hidden factors in their asymptotic running times. Here, we introduce the first practically efficient algorithm for computing expander decompositions and their hierarchies and demonstrate its effectiveness and utility by incorporating it as the core component in a novel solver for the normalized cut graph clustering objective.\r\nOur extensive experiments on a variety of large graphs show that our expander-based algorithm outperforms state-of-the-art solvers for normalized cut with respect to solution quality by a large margin on a variety of graph classes such as citation, e-mail, and social networks or web graphs while remaining competitive in running time.","lang":"eng"}],"oa_version":"Published Version","author":[{"full_name":"Hanauer, Kathrin","last_name":"Hanauer","first_name":"Kathrin"},{"full_name":"Henzinger, Monika H","last_name":"Henzinger","first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530"},{"full_name":"Münk, Robin","last_name":"Münk","first_name":"Robin"},{"first_name":"Harald","full_name":"Räcke, Harald","last_name":"Räcke"},{"full_name":"Vötsch, Maximilian","last_name":"Vötsch","first_name":"Maximilian"}],"day":"01","status":"public","_id":"18906","scopus_import":"1","ddc":["000"],"department":[{"_id":"MoHe"}],"file_date_updated":"2025-01-27T13:25:23Z","oa":1,"date_updated":"2025-09-09T12:04:56Z","OA_place":"publisher","month":"09","publisher":"ACM","quality_controlled":"1","OA_type":"hybrid","has_accepted_license":"1","citation":{"chicago":"Hanauer, Kathrin, Monika Henzinger, Robin Münk, Harald Räcke, and Maximilian Vötsch. “Expander Hierarchies for Normalized Cuts on Graphs.” In <i>Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining</i>, 1016–27. ACM, 2024. <a href=\"https://doi.org/10.1145/3637528.3671978\">https://doi.org/10.1145/3637528.3671978</a>.","ama":"Hanauer K, Henzinger M, Münk R, Räcke H, Vötsch M. Expander hierarchies for normalized cuts on graphs. In: <i>Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining</i>. ACM; 2024:1016-1027. doi:<a href=\"https://doi.org/10.1145/3637528.3671978\">10.1145/3637528.3671978</a>","ieee":"K. Hanauer, M. Henzinger, R. Münk, H. Räcke, and M. Vötsch, “Expander hierarchies for normalized cuts on graphs,” in <i>Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining</i>, Barcelona, Spain, 2024, pp. 1016–1027.","mla":"Hanauer, Kathrin, et al. “Expander Hierarchies for Normalized Cuts on Graphs.” <i>Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining</i>, ACM, 2024, pp. 1016–27, doi:<a href=\"https://doi.org/10.1145/3637528.3671978\">10.1145/3637528.3671978</a>.","apa":"Hanauer, K., Henzinger, M., Münk, R., Räcke, H., &#38; Vötsch, M. (2024). Expander hierarchies for normalized cuts on graphs. In <i>Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining</i> (pp. 1016–1027). Barcelona, Spain: ACM. <a href=\"https://doi.org/10.1145/3637528.3671978\">https://doi.org/10.1145/3637528.3671978</a>","ista":"Hanauer K, Henzinger M, Münk R, Räcke H, Vötsch M. 2024. Expander hierarchies for normalized cuts on graphs. Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining. KDD: Knowledge Discovery and Data Mining, 1016–1027.","short":"K. Hanauer, M. Henzinger, R. Münk, H. Räcke, M. Vötsch, in:, Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, ACM, 2024, pp. 1016–1027."},"page":"1016-1027","ec_funded":1,"article_processing_charge":"Yes (in subscription journal)","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)"}},{"has_accepted_license":"1","citation":{"ieee":"M. Henzinger, B. Saha, M. P. Seybold, and C. Ye, “On the complexity of algorithms with predictions for dynamic graph problems,” in <i>15th Innovations in Theoretical Computer Science Conference</i>, Berkeley, CA, United States, 2024, vol. 287, p. 62:1-62:25.","chicago":"Henzinger, Monika, Barna Saha, Martin P. Seybold, and Christopher Ye. “On the Complexity of Algorithms with Predictions for Dynamic Graph Problems.” In <i>15th Innovations in Theoretical Computer Science Conference</i>, 287:62:1-62:25. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. <a href=\"https://doi.org/10.4230/LIPIcs.ITCS.2024.62\">https://doi.org/10.4230/LIPIcs.ITCS.2024.62</a>.","ama":"Henzinger M, Saha B, Seybold MP, Ye C. On the complexity of algorithms with predictions for dynamic graph problems. In: <i>15th Innovations in Theoretical Computer Science Conference</i>. Vol 287. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024:62:1-62:25. doi:<a href=\"https://doi.org/10.4230/LIPIcs.ITCS.2024.62\">10.4230/LIPIcs.ITCS.2024.62</a>","short":"M. Henzinger, B. Saha, M.P. Seybold, C. Ye, in:, 15th Innovations in Theoretical Computer Science Conference, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, p. 62:1-62:25.","ista":"Henzinger M, Saha B, Seybold MP, Ye C. 2024. On the complexity of algorithms with predictions for dynamic graph problems. 15th Innovations in Theoretical Computer Science Conference. ITCS: Innovations in Theoretical Computer Science, LIPIcs, vol. 287, 62:1-62:25.","mla":"Henzinger, Monika, et al. “On the Complexity of Algorithms with Predictions for Dynamic Graph Problems.” <i>15th Innovations in Theoretical Computer Science Conference</i>, vol. 287, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, p. 62:1-62:25, doi:<a href=\"https://doi.org/10.4230/LIPIcs.ITCS.2024.62\">10.4230/LIPIcs.ITCS.2024.62</a>.","apa":"Henzinger, M., Saha, B., Seybold, M. P., &#38; Ye, C. (2024). On the complexity of algorithms with predictions for dynamic graph problems. In <i>15th Innovations in Theoretical Computer Science Conference</i> (Vol. 287, p. 62:1-62:25). Berkeley, CA, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.ITCS.2024.62\">https://doi.org/10.4230/LIPIcs.ITCS.2024.62</a>"},"OA_type":"gold","volume":287,"quality_controlled":"1","ec_funded":1,"article_processing_charge":"Yes","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)"},"page":"62:1-62:25","OA_place":"publisher","month":"01","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","intvolume":"       287","oa":1,"date_updated":"2025-09-09T12:11:33Z","corr_author":"1","_id":"18928","status":"public","ddc":["000"],"department":[{"_id":"MoHe"}],"file_date_updated":"2025-01-27T15:33:24Z","scopus_import":"1","arxiv":1,"oa_version":"Published Version","day":"24","author":[{"first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H","last_name":"Henzinger","orcid":"0000-0002-5008-6530"},{"first_name":"Barna","full_name":"Saha, Barna","last_name":"Saha"},{"full_name":"Seybold, Martin P.","last_name":"Seybold","first_name":"Martin P."},{"full_name":"Ye, Christopher","last_name":"Ye","first_name":"Christopher"}],"file":[{"relation":"main_file","access_level":"open_access","file_id":"18929","file_name":"2024_LIPICs_HenzingerMo.pdf","checksum":"15085a5b3697a408b92a4a7a27293927","file_size":1084372,"content_type":"application/pdf","date_created":"2025-01-27T15:33:24Z","success":1,"date_updated":"2025-01-27T15:33:24Z","creator":"dernst"}],"external_id":{"isi":["001300389400062"],"arxiv":["2307.16771"]},"date_published":"2024-01-24T00:00:00Z","publication":"15th Innovations in Theoretical Computer Science Conference","abstract":[{"text":"Algorithms with predictions is a new research direction that leverages machine learned predictions for algorithm design. So far a plethora of recent works have incorporated predictions to improve on worst-case bounds for online problems. In this paper, we initiate the study of complexity of dynamic data structures with predictions, including dynamic graph algorithms. Unlike online algorithms, the goal in dynamic data structures is to maintain the solution efficiently with every update.\r\nWe investigate three natural models of prediction: (1) δ-accurate predictions where each predicted request matches the true request with probability δ, (2) list-accurate predictions where a true request comes from a list of possible requests, and (3) bounded delay predictions where the true requests are a permutation of the predicted requests. We give general reductions among the prediction models, showing that bounded delay is the strongest prediction model, followed by list-accurate, and δ-accurate.\r\nFurther, we identify two broad problem classes based on lower bounds due to the Online Matrix Vector (OMv) conjecture. Specifically, we show that locally correctable dynamic problems have strong conditional lower bounds for list-accurate predictions that are equivalent to the non-prediction setting, unless list-accurate predictions are perfect. Moreover, we show that locally reducible dynamic problems have time complexity that degrades gracefully with the quality of bounded delay predictions. We categorize problems with known OMv lower bounds accordingly and give several upper bounds in the delay model that show that our lower bounds are almost tight.\r\nWe note that concurrent work by v.d.Brand et al. [SODA '24] and Liu and Srinivas [arXiv:2307.08890] independently study dynamic graph algorithms with predictions, but their work is mostly focused on showing upper bounds.","lang":"eng"}],"date_created":"2025-01-27T15:33:42Z","alternative_title":["LIPIcs"],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","conference":{"location":"Berkeley, CA, United States","start_date":"2024-01-30","name":"ITCS: Innovations in Theoretical Computer Science","end_date":"2024-02-02"},"year":"2024","publication_identifier":{"isbn":["9783959773096"],"eissn":["1868-8969"]},"acknowledgement":"Henzinger, Monika: This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (Grant agreement No. 101019564) and the Austrian Science Fund (FWF) project Z 422-N, project I 5982-N, and project P 33775-N, with additional funding from the netidee SCIENCE Stiftung, 2020-2024.\r\nSaha, Barna: This project is partially supported by NSF grants 1652303, 1909046, 2112533, and HDR TRIPODS Phase II grant 2217058.\r\nWe would like to thank Andrea Lincoln for many helpful discussions and insightful comments.","doi":"10.4230/LIPIcs.ITCS.2024.62","publication_status":"published","isi":1,"language":[{"iso":"eng"}],"project":[{"grant_number":"101019564","name":"The design and evaluation of modern fully dynamic data structures","_id":"bd9ca328-d553-11ed-ba76-dc4f890cfe62","call_identifier":"H2020"},{"grant_number":"Z00422","name":"Efficient algorithms","_id":"34def286-11ca-11ed-8bc3-da5948e1613c"},{"_id":"bda196b2-d553-11ed-ba76-8e8ee6c21103","grant_number":"I05982","name":"Static and Dynamic Hierarchical Graph Decompositions"},{"name":"Fast Algorithms for a Reactive Network Layer","grant_number":"P33775","_id":"bd9e3a2e-d553-11ed-ba76-8aa684ce17fe"}],"title":"On the complexity of algorithms with predictions for dynamic graph problems","type":"conference"}]