[{"citation":{"short":"A. Alexandradinata, N.P. Armitage, A. Baydin, W. Bi, Y. Cao, H.J. Changlani, E. Chertkov, E.H. da Silva Neto, L. Delacretaz, I. El Baggari, G.M. Ferguson, W.J. Gannon, S.A.A. Ghorashi, B.H. Goodge, O. Goulko, G. Grissonnache, A. Hallas, I.M. Hayes, Y. He, E.W. Huang, A. Kogar, D. Kumah, J.Y. Lee, A. Legros, F. Mahmood, Y. Maximenko, N. Pellatz, H. Polshyn, T. Sarkar, A. Scheie, K.L. Seyler, Z. Shi, B. Skinner, L. Steinke, K. Thirunavukkuarasu, T.V. Trevisan, M. Vogl, P.A. Volkov, Y. Wang, Y. Wang, D. Wei, K. Wei, S. Yang, X. Zhang, Y.-H. Zhang, L. Zhao, A. Zong, ArXiv (n.d.).","ieee":"A. Alexandradinata <i>et al.</i>, “The future of the correlated electron problem,” <i>arXiv</i>. .","chicago":"Alexandradinata, A, N.P. Armitage, Andrey Baydin, Wenli Bi, Yue Cao, Hitesh J. Changlani, Eli Chertkov, et al. “The Future of the Correlated Electron Problem.” <i>ArXiv</i>, n.d.","ista":"Alexandradinata A, Armitage NP, Baydin A, Bi W, Cao Y, Changlani HJ, Chertkov E, da Silva Neto EH, Delacretaz L, El Baggari I, Ferguson GM, Gannon WJ, Ghorashi SAA, Goodge BH, Goulko O, Grissonnache G, Hallas A, Hayes IM, He Y, Huang EW, Kogar A, Kumah D, Lee JY, Legros A, Mahmood F, Maximenko Y, Pellatz N, Polshyn H, Sarkar T, Scheie A, Seyler KL, Shi Z, Skinner B, Steinke L, Thirunavukkuarasu K, Trevisan TV, Vogl M, Volkov PA, Wang Y, Wang Y, Wei D, Wei K, Yang S, Zhang X, Zhang Y-H, Zhao L, Zong A. The future of the correlated electron problem. arXiv, .","mla":"Alexandradinata, A., et al. “The Future of the Correlated Electron Problem.” <i>ArXiv</i>.","apa":"Alexandradinata, A., Armitage, N. P., Baydin, A., Bi, W., Cao, Y., Changlani, H. J., … Zong, A. (n.d.). The future of the correlated electron problem. <i>arXiv</i>.","ama":"Alexandradinata A, Armitage NP, Baydin A, et al. The future of the correlated electron problem. <i>arXiv</i>."},"language":[{"iso":"eng"}],"extern":"1","status":"public","external_id":{"arxiv":["2010.00584"]},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2010.00584"}],"date_published":"2020-10-01T00:00:00Z","oa":1,"publication_status":"submitted","article_processing_charge":"No","_id":"10650","publication":"arXiv","year":"2020","acknowledgement":"We thank NSF CMP program for suggestions regarding the topic and general structure of the workshop. This project was supported by the NSF DMR-2002329 and The Gordon and Betty Moore Foundation (GBMF) EPiQS initiative. We would like to sincerely thank A. Kapitulnik, A. J. Leggett, M.B. Maple, T.M. McQueen, M. Norman, P. S. Riseborough, and G. A. Sawatzky for their lectures at the workshop and advice on the writing of this manuscript. We would also like to thank G. Blumberg, C. Broholm, S. Crooker, N. Drichko, and A. Patel for helpful consultation on topics discussed\r\nherein. A number of individuals also had independent support: (AA, EH; GBMF-4305), (IMH; GBMF-9071), (HJC; NHMFL is supported by the NSF DMR-1644779 and the state of Florida), (YH, AZ; Miller Institute for Basic Research in Science), (YC; US DOE-BES DEAC02-06CH11357), (AS; Spallation Neutron Source, a DOE Office of Science User Facility operated by ORNL), (SAAG; ARO-W911NF-18-1-0290, NSF DMR-1455233), (YW; DOE-BES DE-SC0019331, GBMF-4532).","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","date_created":"2022-01-20T10:55:36Z","title":"The future of the correlated electron problem","arxiv":1,"type":"preprint","month":"10","oa_version":"Preprint","day":"01","abstract":[{"lang":"eng","text":"The understanding of material systems with strong electron-electron interactions is the central problem in modern condensed matter physics. Despite this, the essential physics of many of these materials is still not understood and we have no overall perspective on their properties. Moreover, we have very little ability to make predictions in this class of systems. In this manuscript we share our personal views of what the major open problems are in correlated electron systems and we discuss some possible routes to make progress in this rich and fascinating field. This manuscript is the result of the vigorous discussions and deliberations that took place at Johns Hopkins University during a three-day workshop January 27, 28, and 29, 2020 that brought together six senior scientists and 46 more junior scientists. Our hope, is that the topics we have presented will provide inspiration for others working in this field and motivation for the idea that significant progress can be made on very hard problems if we focus our collective energies."}],"date_updated":"2022-01-24T08:05:51Z","author":[{"full_name":"Alexandradinata, A","last_name":"Alexandradinata","first_name":"A"},{"first_name":"N.P.","last_name":"Armitage","full_name":"Armitage, N.P."},{"full_name":"Baydin, Andrey","last_name":"Baydin","first_name":"Andrey"},{"full_name":"Bi, Wenli","last_name":"Bi","first_name":"Wenli"},{"last_name":"Cao","first_name":"Yue","full_name":"Cao, Yue"},{"full_name":"Changlani, Hitesh J.","first_name":"Hitesh J.","last_name":"Changlani"},{"last_name":"Chertkov","first_name":"Eli","full_name":"Chertkov, Eli"},{"last_name":"da Silva Neto","first_name":"Eduardo H.","full_name":"da Silva Neto, Eduardo H."},{"last_name":"Delacretaz","first_name":"Luca","full_name":"Delacretaz, Luca"},{"first_name":"Ismail","last_name":"El Baggari","full_name":"El Baggari, Ismail"},{"last_name":"Ferguson","first_name":"G.M.","full_name":"Ferguson, G.M."},{"full_name":"Gannon, William J.","last_name":"Gannon","first_name":"William J."},{"full_name":"Ghorashi, Sayed Ali Akbar","last_name":"Ghorashi","first_name":"Sayed Ali Akbar"},{"last_name":"Goodge","first_name":"Berit H.","full_name":"Goodge, Berit H."},{"full_name":"Goulko, Olga","last_name":"Goulko","first_name":"Olga"},{"full_name":"Grissonnache, G.","first_name":"G.","last_name":"Grissonnache"},{"first_name":"Alannah","last_name":"Hallas","full_name":"Hallas, Alannah"},{"full_name":"Hayes, Ian M.","first_name":"Ian M.","last_name":"Hayes"},{"full_name":"He, Yu","last_name":"He","first_name":"Yu"},{"full_name":"Huang, Edwin W.","first_name":"Edwin W.","last_name":"Huang"},{"first_name":"Anshu","last_name":"Kogar","full_name":"Kogar, Anshu"},{"full_name":"Kumah, Divine","first_name":"Divine","last_name":"Kumah"},{"last_name":"Lee","first_name":"Jong Yeon","full_name":"Lee, Jong Yeon"},{"last_name":"Legros","first_name":"A.","full_name":"Legros, A."},{"full_name":"Mahmood, Fahad","first_name":"Fahad","last_name":"Mahmood"},{"full_name":"Maximenko, Yulia","first_name":"Yulia","last_name":"Maximenko"},{"last_name":"Pellatz","first_name":"Nick","full_name":"Pellatz, Nick"},{"full_name":"Polshyn, Hryhoriy","id":"edfc7cb1-526e-11ec-b05a-e6ecc27e4e48","orcid":"0000-0001-8223-8896","last_name":"Polshyn","first_name":"Hryhoriy"},{"first_name":"Tarapada","last_name":"Sarkar","full_name":"Sarkar, Tarapada"},{"full_name":"Scheie, Allen","first_name":"Allen","last_name":"Scheie"},{"full_name":"Seyler, Kyle L.","first_name":"Kyle L.","last_name":"Seyler"},{"full_name":"Shi, Zhenzhong","first_name":"Zhenzhong","last_name":"Shi"},{"first_name":"Brian","last_name":"Skinner","full_name":"Skinner, Brian"},{"last_name":"Steinke","first_name":"Lucia","full_name":"Steinke, Lucia"},{"full_name":"Thirunavukkuarasu, K.","first_name":"K.","last_name":"Thirunavukkuarasu"},{"first_name":"Thaís Victa","last_name":"Trevisan","full_name":"Trevisan, Thaís Victa"},{"last_name":"Vogl","first_name":"Michael","full_name":"Vogl, Michael"},{"full_name":"Volkov, Pavel A.","first_name":"Pavel A.","last_name":"Volkov"},{"full_name":"Wang, Yao","last_name":"Wang","first_name":"Yao"},{"last_name":"Wang","first_name":"Yishu","full_name":"Wang, Yishu"},{"full_name":"Wei, Di","first_name":"Di","last_name":"Wei"},{"full_name":"Wei, Kaya","last_name":"Wei","first_name":"Kaya"},{"full_name":"Yang, Shuolong","first_name":"Shuolong","last_name":"Yang"},{"full_name":"Zhang, Xian","first_name":"Xian","last_name":"Zhang"},{"full_name":"Zhang, Ya-Hui","first_name":"Ya-Hui","last_name":"Zhang"},{"full_name":"Zhao, Liuyan","first_name":"Liuyan","last_name":"Zhao"},{"full_name":"Zong, Alfred","first_name":"Alfred","last_name":"Zong"}],"page":"55"},{"conference":{"end_date":"2020-09-09","name":"ESA: Annual European Symposium on Algorithms","location":"Pisa, Italy","start_date":"2020-09-07"},"language":[{"iso":"eng"}],"publication_identifier":{"isbn":["9783959771627"],"issn":["1868-8969"]},"doi":"10.4230/LIPIcs.ESA.2020.58","quality_controlled":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication":"8th Annual European Symposium on Algorithms","article_processing_charge":"No","scopus_import":"1","author":[{"first_name":"Monika H","last_name":"Henzinger","full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630"},{"last_name":"Shahbaz","first_name":"Khan","full_name":"Shahbaz, Khan"},{"last_name":"Paul","first_name":"Richard","full_name":"Paul, Richard"},{"full_name":"Schulz, Christian","last_name":"Schulz","first_name":"Christian"}],"day":"26","article_number":"58","title":"Dynamic matching algorithms in practice","arxiv":1,"alternative_title":["LIPIcs"],"status":"public","external_id":{"arxiv":["2004.09099"]},"extern":"1","intvolume":"       173","citation":{"short":"M.H. Henzinger, K. Shahbaz, R. Paul, C. Schulz, in:, 8th Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.","chicago":"Henzinger, Monika H, Khan Shahbaz, Richard Paul, and Christian Schulz. “Dynamic Matching Algorithms in Practice.” In <i>8th Annual European Symposium on Algorithms</i>, Vol. 173. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. <a href=\"https://doi.org/10.4230/LIPIcs.ESA.2020.58\">https://doi.org/10.4230/LIPIcs.ESA.2020.58</a>.","ieee":"M. H. Henzinger, K. Shahbaz, R. Paul, and C. Schulz, “Dynamic matching algorithms in practice,” in <i>8th Annual European Symposium on Algorithms</i>, Pisa, Italy, 2020, vol. 173.","apa":"Henzinger, M. H., Shahbaz, K., Paul, R., &#38; Schulz, C. (2020). Dynamic matching algorithms in practice. In <i>8th Annual European Symposium on Algorithms</i> (Vol. 173). Pisa, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.ESA.2020.58\">https://doi.org/10.4230/LIPIcs.ESA.2020.58</a>","ista":"Henzinger MH, Shahbaz K, Paul R, Schulz C. 2020. Dynamic matching algorithms in practice. 8th Annual European Symposium on Algorithms. ESA: Annual European Symposium on Algorithms, LIPIcs, vol. 173, 58.","mla":"Henzinger, Monika H., et al. “Dynamic Matching Algorithms in Practice.” <i>8th Annual European Symposium on Algorithms</i>, vol. 173, 58, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:<a href=\"https://doi.org/10.4230/LIPIcs.ESA.2020.58\">10.4230/LIPIcs.ESA.2020.58</a>.","ama":"Henzinger MH, Shahbaz K, Paul R, Schulz C. Dynamic matching algorithms in practice. In: <i>8th Annual European Symposium on Algorithms</i>. Vol 173. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:<a href=\"https://doi.org/10.4230/LIPIcs.ESA.2020.58\">10.4230/LIPIcs.ESA.2020.58</a>"},"publication_status":"published","oa":1,"date_published":"2020-08-26T00:00:00Z","main_file_link":[{"open_access":"1","url":"https://doi.org/10.4230/LIPIcs.ESA.2020.58"}],"year":"2020","_id":"11816","oa_version":"Published Version","type":"conference","month":"08","date_updated":"2023-02-14T08:57:55Z","abstract":[{"lang":"eng","text":"In recent years, significant advances have been made in the design and analysis of fully dynamic maximal matching algorithms. However, these theoretical results have received very little attention from the practical perspective. Few of the algorithms are implemented and tested on real datasets, and their practical potential is far from understood. In this paper, we attempt to bridge the gap between theory and practice that is currently observed for the fully dynamic maximal matching problem. We engineer several algorithms and empirically study those algorithms on an extensive set of dynamic instances."}],"volume":173,"date_created":"2022-08-12T07:13:25Z"},{"title":"Fully-dynamic coresets","arxiv":1,"article_number":"57","day":"26","author":[{"last_name":"Henzinger","first_name":"Monika H","full_name":"Henzinger, Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530"},{"last_name":"Kale","first_name":"Sagar","full_name":"Kale, Sagar"}],"scopus_import":"1","article_processing_charge":"No","publication":"28th Annual European Symposium on Algorithms","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","doi":"10.4230/LIPIcs.ESA.2020.57","publication_identifier":{"issn":["1868-8969"],"isbn":["9783959771627"]},"language":[{"iso":"eng"}],"conference":{"start_date":"2020-09-07","name":"ESA: Annual European Symposium on Algorithms","location":"Pisa, Italy","end_date":"2020-09-09"},"date_created":"2022-08-12T07:22:55Z","volume":173,"abstract":[{"lang":"eng","text":"With input sizes becoming massive, coresets - small yet representative summary of the input - are relevant more than ever. A weighted set C_w that is a subset of the input is an ε-coreset if the cost of any feasible solution S with respect to C_w is within [1±ε] of the cost of S with respect to the original input. We give a very general technique to compute coresets in the fully-dynamic setting where input points can be added or deleted. Given a static (i.e., not dynamic) ε-coreset-construction algorithm that runs in time t(n, ε, λ) and computes a coreset of size s(n, ε, λ), where n is the number of input points and 1-λ is the success probability, we give a fully-dynamic algorithm that computes an ε-coreset with worst-case update time O((log n) ⋅ t(s(n, ε/log n, λ/n), ε/log n, λ/n)) (this bound is stated informally), where the success probability is 1-λ. Our technique is a fully-dynamic analog of the merge-and-reduce technique, which is due to Har-Peled and Mazumdar [Har-Peled and Mazumdar, 2004] and is based on a technique of Bentley and Saxe [Jon Louis Bentley and James B. Saxe, 1980], that applies to the insertion-only setting where points can only be added. Although, our space usage is O(n), our technique works in the presence of an adaptive adversary, and we show that Ω(n) space is required when adversary is adaptive.\r\nAs a concrete implication of our technique, using the result of Braverman et al. [{Braverman} et al., 2016], we get fully-dynamic ε-coreset-construction algorithms for k-median and k-means with worst-case update time O(ε^{-2} k² log⁵ n log³ k) and coreset size O(ε^{-2} k log n log² k) ignoring log log n and log(1/ε) factors and assuming that ε = Ω(1/poly(n)) and λ = Ω(1/poly(n)) (which are very weak assumptions made only to make these bounds easy to parse). This results in the first fully-dynamic constant-approximation algorithms for k-median and k-means with update times O(poly(k, log n, ε^{-1})). Specifically, the dependence on k is only quadratic, and the bounds are worst-case. The best previous bound for both problems was amortized O(nlog n) by Cohen-Addad et al. [Cohen-Addad et al., 2019] via randomized O(1)-coresets in O(n) space.\r\nWe also show that under the OMv conjecture [Monika Henzinger et al., 2015], a fully-dynamic (4 - δ)-approximation algorithm for k-means must either have an amortized update time of Ω(k^{1-γ}) or amortized query time of Ω(k^{2 - γ}), where γ > 0 is a constant."}],"date_updated":"2023-02-14T09:29:51Z","type":"conference","month":"08","oa_version":"Published Version","_id":"11818","year":"2020","main_file_link":[{"url":"https://doi.org/10.4230/LIPIcs.ESA.2020.57","open_access":"1"}],"date_published":"2020-08-26T00:00:00Z","oa":1,"publication_status":"published","citation":{"ama":"Henzinger MH, Kale S. Fully-dynamic coresets. In: <i>28th Annual European Symposium on Algorithms</i>. Vol 173. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:<a href=\"https://doi.org/10.4230/LIPIcs.ESA.2020.57\">10.4230/LIPIcs.ESA.2020.57</a>","apa":"Henzinger, M. H., &#38; Kale, S. (2020). Fully-dynamic coresets. In <i>28th Annual European Symposium on Algorithms</i> (Vol. 173). Pisa, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.ESA.2020.57\">https://doi.org/10.4230/LIPIcs.ESA.2020.57</a>","ista":"Henzinger MH, Kale S. 2020. Fully-dynamic coresets. 28th Annual European Symposium on Algorithms. ESA: Annual European Symposium on Algorithms, LIPIcs, vol. 173, 57.","mla":"Henzinger, Monika H., and Sagar Kale. “Fully-Dynamic Coresets.” <i>28th Annual European Symposium on Algorithms</i>, vol. 173, 57, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:<a href=\"https://doi.org/10.4230/LIPIcs.ESA.2020.57\">10.4230/LIPIcs.ESA.2020.57</a>.","chicago":"Henzinger, Monika H, and Sagar Kale. “Fully-Dynamic Coresets.” In <i>28th Annual European Symposium on Algorithms</i>, Vol. 173. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. <a href=\"https://doi.org/10.4230/LIPIcs.ESA.2020.57\">https://doi.org/10.4230/LIPIcs.ESA.2020.57</a>.","ieee":"M. H. Henzinger and S. Kale, “Fully-dynamic coresets,” in <i>28th Annual European Symposium on Algorithms</i>, Pisa, Italy, 2020, vol. 173.","short":"M.H. Henzinger, S. Kale, in:, 28th Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020."},"extern":"1","intvolume":"       173","external_id":{"arxiv":["2004.14891"]},"status":"public","alternative_title":["LIPIcs"]},{"month":"08","oa_version":"Published Version","type":"conference","date_updated":"2023-02-14T09:39:18Z","abstract":[{"text":"We present a practically efficient algorithm that finds all global minimum cuts in huge undirected graphs. Our algorithm uses a multitude of kernelization rules to reduce the graph to a small equivalent instance and then finds all minimum cuts using an optimized version of the algorithm of Nagamochi, Nakao and Ibaraki. In shared memory we are able to find all minimum cuts of graphs with up to billions of edges and millions of minimum cuts in a few minutes. We also give a new linear time algorithm to find the most balanced minimum cuts given as input the representation of all minimum cuts.","lang":"eng"}],"volume":173,"date_created":"2022-08-12T07:27:42Z","year":"2020","_id":"11819","publication_status":"published","oa":1,"date_published":"2020-08-26T00:00:00Z","main_file_link":[{"open_access":"1","url":"https://doi.org/10.4230/LIPIcs.ESA.2020.59"}],"alternative_title":["LIPIcs"],"external_id":{"arxiv":["2002.06948"]},"status":"public","intvolume":"       173","extern":"1","citation":{"ieee":"M. H. Henzinger, A. Noe, C. Schulz, and D. Strash, “Finding all global minimum cuts in practice,” in <i>28th Annual European Symposium on Algorithms</i>, Pisa, Italy, 2020, vol. 173.","chicago":"Henzinger, Monika H, Alexander Noe, Christian Schulz, and Darren Strash. “Finding All Global Minimum Cuts in Practice.” In <i>28th Annual European Symposium on Algorithms</i>, Vol. 173. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. <a href=\"https://doi.org/10.4230/LIPIcs.ESA.2020.59\">https://doi.org/10.4230/LIPIcs.ESA.2020.59</a>.","short":"M.H. Henzinger, A. Noe, C. Schulz, D. Strash, in:, 28th Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.","ama":"Henzinger MH, Noe A, Schulz C, Strash D. Finding all global minimum cuts in practice. In: <i>28th Annual European Symposium on Algorithms</i>. Vol 173. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:<a href=\"https://doi.org/10.4230/LIPIcs.ESA.2020.59\">10.4230/LIPIcs.ESA.2020.59</a>","ista":"Henzinger MH, Noe A, Schulz C, Strash D. 2020. Finding all global minimum cuts in practice. 28th Annual European Symposium on Algorithms. ESA: Annual European Symposium on Algorithms, LIPIcs, vol. 173, 59.","mla":"Henzinger, Monika H., et al. “Finding All Global Minimum Cuts in Practice.” <i>28th Annual European Symposium on Algorithms</i>, vol. 173, 59, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:<a href=\"https://doi.org/10.4230/LIPIcs.ESA.2020.59\">10.4230/LIPIcs.ESA.2020.59</a>.","apa":"Henzinger, M. H., Noe, A., Schulz, C., &#38; Strash, D. (2020). Finding all global minimum cuts in practice. In <i>28th Annual European Symposium on Algorithms</i> (Vol. 173). Pisa, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.ESA.2020.59\">https://doi.org/10.4230/LIPIcs.ESA.2020.59</a>"},"author":[{"first_name":"Monika H","last_name":"Henzinger","full_name":"Henzinger, Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530"},{"full_name":"Noe, Alexander","first_name":"Alexander","last_name":"Noe"},{"full_name":"Schulz, Christian","last_name":"Schulz","first_name":"Christian"},{"first_name":"Darren","last_name":"Strash","full_name":"Strash, Darren"}],"day":"26","article_number":"59","arxiv":1,"title":"Finding all global minimum cuts in practice","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication":"28th Annual European Symposium on Algorithms","article_processing_charge":"No","scopus_import":"1","publication_identifier":{"issn":["1868-8969"],"isbn":["9783959771627"]},"doi":"10.4230/LIPIcs.ESA.2020.59","quality_controlled":"1","conference":{"end_date":"2020-09-09","start_date":"2020-09-07","location":"Pisa, Italy","name":"ESA: Annual European Symposium on Algorithms"},"language":[{"iso":"eng"}]},{"publication_status":"published","oa":1,"date_published":"2020-06-12T00:00:00Z","main_file_link":[{"open_access":"1","url":"https://doi.org/10.4230/LIPIcs.SEA.2020.14"}],"alternative_title":["LIPIcs"],"external_id":{"arxiv":["2002.00813"]},"status":"public","intvolume":"       160","extern":"1","citation":{"short":"K. Hanauer, M.H. Henzinger, C. Schulz, in:, 18th International Symposium on Experimental Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.","chicago":"Hanauer, Kathrin, Monika H Henzinger, and Christian Schulz. “Faster Fully Dynamic Transitive Closure in Practice.” In <i>18th International Symposium on Experimental Algorithms</i>, Vol. 160. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. <a href=\"https://doi.org/10.4230/LIPIcs.SEA.2020.14\">https://doi.org/10.4230/LIPIcs.SEA.2020.14</a>.","ieee":"K. Hanauer, M. H. Henzinger, and C. Schulz, “Faster fully dynamic transitive closure in practice,” in <i>18th International Symposium on Experimental Algorithms</i>, Pisa, Italy, 2020, vol. 160.","apa":"Hanauer, K., Henzinger, M. H., &#38; Schulz, C. (2020). Faster fully dynamic transitive closure in practice. In <i>18th International Symposium on Experimental Algorithms</i> (Vol. 160). Pisa, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.SEA.2020.14\">https://doi.org/10.4230/LIPIcs.SEA.2020.14</a>","mla":"Hanauer, Kathrin, et al. “Faster Fully Dynamic Transitive Closure in Practice.” <i>18th International Symposium on Experimental Algorithms</i>, vol. 160, 14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:<a href=\"https://doi.org/10.4230/LIPIcs.SEA.2020.14\">10.4230/LIPIcs.SEA.2020.14</a>.","ista":"Hanauer K, Henzinger MH, Schulz C. 2020. Faster fully dynamic transitive closure in practice. 18th International Symposium on Experimental Algorithms. SEA: Symposium on Experimental Algorithms, LIPIcs, vol. 160, 14.","ama":"Hanauer K, Henzinger MH, Schulz C. Faster fully dynamic transitive closure in practice. In: <i>18th International Symposium on Experimental Algorithms</i>. Vol 160. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:<a href=\"https://doi.org/10.4230/LIPIcs.SEA.2020.14\">10.4230/LIPIcs.SEA.2020.14</a>"},"type":"conference","oa_version":"Published Version","month":"06","abstract":[{"text":"The fully dynamic transitive closure problem asks to maintain reachability information in a directed graph between arbitrary pairs of vertices, while the graph undergoes a sequence of edge insertions and deletions. The problem has been thoroughly investigated in theory and many specialized algorithms for solving it have been proposed in the last decades. In two large studies [Frigioni ea, 2001; Krommidas and Zaroliagis, 2008], a number of these algorithms have been evaluated experimentally against simple, static algorithms for graph traversal, showing the competitiveness and even superiority of the simple algorithms in practice, except for very dense random graphs or very high ratios of queries. A major drawback of those studies is that only small and mostly randomly generated graphs are considered.\r\nIn this paper, we engineer new algorithms to maintain all-pairs reachability information which are simple and space-efficient. Moreover, we perform an extensive experimental evaluation on both generated and real-world instances that are several orders of magnitude larger than those in the previous studies. Our results indicate that our new algorithms outperform all state-of-the-art algorithms on all types of input considerably in practice.","lang":"eng"}],"date_updated":"2023-02-14T09:58:42Z","volume":160,"date_created":"2022-08-12T07:32:53Z","year":"2020","_id":"11822","publication_identifier":{"issn":["1868-8969"],"isbn":["9783959771481"]},"doi":"10.4230/LIPIcs.SEA.2020.14","quality_controlled":"1","conference":{"start_date":"2020-09-07","location":"Pisa, Italy","name":"SEA: Symposium on Experimental Algorithms","end_date":"2020-09-09"},"language":[{"iso":"eng"}],"author":[{"full_name":"Hanauer, Kathrin","last_name":"Hanauer","first_name":"Kathrin"},{"first_name":"Monika H","last_name":"Henzinger","orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H"},{"full_name":"Schulz, Christian","first_name":"Christian","last_name":"Schulz"}],"day":"12","article_number":"14","title":"Faster fully dynamic transitive closure in practice","arxiv":1,"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication":"18th International Symposium on Experimental Algorithms","article_processing_charge":"No","scopus_import":"1"},{"_id":"11824","year":"2020","date_created":"2022-08-12T07:46:44Z","volume":164,"date_updated":"2023-02-14T10:00:58Z","abstract":[{"text":"Independent set is a fundamental problem in combinatorial optimization. While in general graphs the problem is essentially inapproximable, for many important graph classes there are approximation algorithms known in the offline setting. These graph classes include interval graphs and geometric intersection graphs, where vertices correspond to intervals/geometric objects and an edge indicates that the two corresponding objects intersect.\r\nWe present dynamic approximation algorithms for independent set of intervals, hypercubes and hyperrectangles in d dimensions. They work in the fully dynamic model where each update inserts or deletes a geometric object. All our algorithms are deterministic and have worst-case update times that are polylogarithmic for constant d and ε>0, assuming that the coordinates of all input objects are in [0, N]^d and each of their edges has length at least 1. We obtain the following results:\r\n- For weighted intervals, we maintain a (1+ε)-approximate solution.\r\n- For d-dimensional hypercubes we maintain a (1+ε)2^d-approximate solution in the unweighted case and a O(2^d)-approximate solution in the weighted case. Also, we show that for maintaining an unweighted (1+ε)-approximate solution one needs polynomial update time for d ≥ 2 if the ETH holds.\r\n- For weighted d-dimensional hyperrectangles we present a dynamic algorithm with approximation ratio (1+ε)log^{d-1}N.","lang":"eng"}],"oa_version":"Published Version","type":"conference","month":"06","citation":{"chicago":"Henzinger, Monika H, Stefan Neumann, and Andreas Wiese. “Dynamic Approximate Maximum Independent Set of Intervals, Hypercubes and Hyperrectangles.” In <i>36th International Symposium on Computational Geometry</i>, Vol. 164. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2020.51\">https://doi.org/10.4230/LIPIcs.SoCG.2020.51</a>.","ieee":"M. H. Henzinger, S. Neumann, and A. Wiese, “Dynamic approximate maximum independent set of intervals, hypercubes and hyperrectangles,” in <i>36th International Symposium on Computational Geometry</i>, Zurich, Switzerland, 2020, vol. 164.","short":"M.H. Henzinger, S. Neumann, A. Wiese, in:, 36th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.","ama":"Henzinger MH, Neumann S, Wiese A. Dynamic approximate maximum independent set of intervals, hypercubes and hyperrectangles. In: <i>36th International Symposium on Computational Geometry</i>. Vol 164. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2020.51\">10.4230/LIPIcs.SoCG.2020.51</a>","apa":"Henzinger, M. H., Neumann, S., &#38; Wiese, A. (2020). Dynamic approximate maximum independent set of intervals, hypercubes and hyperrectangles. In <i>36th International Symposium on Computational Geometry</i> (Vol. 164). Zurich, Switzerland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2020.51\">https://doi.org/10.4230/LIPIcs.SoCG.2020.51</a>","mla":"Henzinger, Monika H., et al. “Dynamic Approximate Maximum Independent Set of Intervals, Hypercubes and Hyperrectangles.” <i>36th International Symposium on Computational Geometry</i>, vol. 164, 51, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2020.51\">10.4230/LIPIcs.SoCG.2020.51</a>.","ista":"Henzinger MH, Neumann S, Wiese A. 2020. Dynamic approximate maximum independent set of intervals, hypercubes and hyperrectangles. 36th International Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 164, 51."},"intvolume":"       164","extern":"1","status":"public","external_id":{"arxiv":["2003.02605"]},"alternative_title":["LIPIcs"],"main_file_link":[{"url":"https://doi.org/10.4230/LIPIcs.SoCG.2020.51","open_access":"1"}],"date_published":"2020-06-08T00:00:00Z","publication_status":"published","oa":1,"scopus_import":"1","article_processing_charge":"No","publication":"36th International Symposium on Computational Geometry","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Dynamic approximate maximum independent set of intervals, hypercubes and hyperrectangles","arxiv":1,"article_number":"51","day":"08","author":[{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H","first_name":"Monika H","last_name":"Henzinger"},{"full_name":"Neumann, Stefan","first_name":"Stefan","last_name":"Neumann"},{"full_name":"Wiese, Andreas","last_name":"Wiese","first_name":"Andreas"}],"language":[{"iso":"eng"}],"conference":{"start_date":"2020-06-23","name":"SoCG: Symposium on Computational Geometry","location":"Zurich, Switzerland","end_date":"2020-06-26"},"quality_controlled":"1","doi":"10.4230/LIPIcs.SoCG.2020.51","publication_identifier":{"issn":["1868-8969"],"isbn":["9783959771436"]}},{"citation":{"apa":"Henzinger, M. H., &#38; Peng, P. (2020). Constant-time dynamic (Δ+1)-coloring. In <i>37th International Symposium on Theoretical Aspects of Computer Science</i> (Vol. 154). Montpellier, France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.STACS.2020.53\">https://doi.org/10.4230/LIPIcs.STACS.2020.53</a>","mla":"Henzinger, Monika H., and Pan Peng. “Constant-Time Dynamic (Δ+1)-Coloring.” <i>37th International Symposium on Theoretical Aspects of Computer Science</i>, vol. 154, 53, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:<a href=\"https://doi.org/10.4230/LIPIcs.STACS.2020.53\">10.4230/LIPIcs.STACS.2020.53</a>.","ista":"Henzinger MH, Peng P. 2020. Constant-time dynamic (Δ+1)-coloring. 37th International Symposium on Theoretical Aspects of Computer Science. STACS: Symposium on Theoretical Aspects of Computer Science, LIPIcs, vol. 154, 53.","ama":"Henzinger MH, Peng P. Constant-time dynamic (Δ+1)-coloring. In: <i>37th International Symposium on Theoretical Aspects of Computer Science</i>. Vol 154. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:<a href=\"https://doi.org/10.4230/LIPIcs.STACS.2020.53\">10.4230/LIPIcs.STACS.2020.53</a>","short":"M.H. Henzinger, P. Peng, in:, 37th International Symposium on Theoretical Aspects of Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.","chicago":"Henzinger, Monika H, and Pan Peng. “Constant-Time Dynamic (Δ+1)-Coloring.” In <i>37th International Symposium on Theoretical Aspects of Computer Science</i>, Vol. 154. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. <a href=\"https://doi.org/10.4230/LIPIcs.STACS.2020.53\">https://doi.org/10.4230/LIPIcs.STACS.2020.53</a>.","ieee":"M. H. Henzinger and P. Peng, “Constant-time dynamic (Δ+1)-coloring,” in <i>37th International Symposium on Theoretical Aspects of Computer Science</i>, Montpellier, France, 2020, vol. 154."},"intvolume":"       154","extern":"1","status":"public","external_id":{"arxiv":["1907.04745"]},"alternative_title":["LIPIcs"],"main_file_link":[{"url":"https://doi.org/10.4230/LIPIcs.STACS.2020.53","open_access":"1"}],"date_published":"2020-03-04T00:00:00Z","publication_status":"published","oa":1,"_id":"11825","year":"2020","date_created":"2022-08-12T07:53:05Z","volume":154,"abstract":[{"text":"We give a fully dynamic (Las-Vegas style) algorithm with constant expected amortized time per update that maintains a proper (Δ+1)-vertex coloring of a graph with maximum degree at most Δ. This improves upon the previous O(log Δ)-time algorithm by Bhattacharya et al. (SODA 2018). Our algorithm uses an approach based on assigning random ranks to vertices and does not need to maintain a hierarchical graph decomposition. We show that our result does not only have optimal running time, but is also optimal in the sense that already deciding whether a Δ-coloring exists in a dynamically changing graph with maximum degree at most Δ takes Ω(log n) time per operation.","lang":"eng"}],"date_updated":"2023-02-14T10:03:43Z","month":"03","type":"conference","oa_version":"Published Version","language":[{"iso":"eng"}],"conference":{"start_date":"2020-03-10","name":"STACS: Symposium on Theoretical Aspects of Computer Science","location":"Montpellier, France","end_date":"2020-03-13"},"quality_controlled":"1","doi":"10.4230/LIPIcs.STACS.2020.53","publication_identifier":{"issn":["1868-8969"],"isbn":["9783959771405"]},"scopus_import":"1","article_processing_charge":"No","publication":"37th International Symposium on Theoretical Aspects of Computer Science","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","title":"Constant-time dynamic (Δ+1)-coloring","arxiv":1,"article_number":"53","day":"04","author":[{"full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger","first_name":"Monika H"},{"full_name":"Peng, Pan","last_name":"Peng","first_name":"Pan"}]},{"publisher":"Institute of Electrical and Electronics Engineers","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication":"61st Annual Symposium on Foundations of Computer Science","scopus_import":"1","article_processing_charge":"No","author":[{"full_name":"Chen, Li","first_name":"Li","last_name":"Chen"},{"first_name":"Gramoz","last_name":"Goranci","full_name":"Goranci, Gramoz"},{"first_name":"Monika H","last_name":"Henzinger","full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630"},{"last_name":"Peng","first_name":"Richard","full_name":"Peng, Richard"},{"first_name":"Thatchaphol","last_name":"Saranurak","full_name":"Saranurak, Thatchaphol"}],"day":"01","arxiv":1,"title":"Fast dynamic cuts, distances and effective resistances via vertex sparsifiers","conference":{"end_date":"2020-11-19","name":"FOCS: Annual Symposium on Foundations of Computer Science","location":"Durham, NC, United States","start_date":"2020-11-16"},"language":[{"iso":"eng"}],"publication_identifier":{"isbn":["978-1-7281-9622-0"],"eissn":["2575-8454"],"eisbn":["978-1-7281-9621-3"]},"doi":"10.1109/focs46700.2020.00109","quality_controlled":"1","year":"2020","_id":"11852","page":"1135-1146","oa_version":"Preprint","type":"conference","month":"11","date_updated":"2023-02-17T09:47:36Z","abstract":[{"text":"We present a general framework of designing efficient dynamic approximate algorithms for optimization problems on undirected graphs. In particular, we develop a technique that, given any problem that admits a certain notion of vertex sparsifiers, gives data structures that maintain approximate solutions in sub-linear update and query time. We illustrate the applicability of our paradigm to the following problems. (1)A fully-dynamic algorithm that approximates all-pair maximum-flows/minimum-cuts up to a nearly logarithmic factor in O~(n2/3) 11The O~(⋅) notation is used in this paper to hide poly-logarithmic factors. amortized time against an oblivious adversary, and O~(m3/4) time against an adaptive adversary. (2)An incremental data structure that maintains O(1) - approximate shortest path in no(1) time per operation, as well as fully dynamic approximate all-pair shortest path and transshipment in O~(n2/3+o(1)) amortized time per operation. (3)A fully-dynamic algorithm that approximates all-pair effective resistance up to an (1+ϵ) factor in O~(n2/3+o(1)ϵ−O(1)) amortized update time per operation. The key tool behind result (1) is the dynamic maintenance of an algorithmic construction due to Madry [FOCS' 10], which partitions a graph into a collection of simpler graph structures (known as j-trees) and approximately captures the cut-flow and metric structure of the graph. The O(1)-approximation guarantee of (2) is by adapting the distance oracles by [Thorup-Zwick JACM '05]. Result (3) is obtained by invoking the random-walk based spectral vertex sparsifier by [Durfee et al. STOC '19] in a hierarchical manner, while carefully keeping track of the recourse among levels in the hierarchy. See https://arxiv.org/pdf/2005.02368.pdf for the full version of this paper.","lang":"eng"}],"date_created":"2022-08-16T07:33:12Z","external_id":{"arxiv":["2005.02368"]},"status":"public","extern":"1","citation":{"ama":"Chen L, Goranci G, Henzinger MH, Peng R, Saranurak T. Fast dynamic cuts, distances and effective resistances via vertex sparsifiers. In: <i>61st Annual Symposium on Foundations of Computer Science</i>. Institute of Electrical and Electronics Engineers; 2020:1135-1146. doi:<a href=\"https://doi.org/10.1109/focs46700.2020.00109\">10.1109/focs46700.2020.00109</a>","mla":"Chen, Li, et al. “Fast Dynamic Cuts, Distances and Effective Resistances via Vertex Sparsifiers.” <i>61st Annual Symposium on Foundations of Computer Science</i>, Institute of Electrical and Electronics Engineers, 2020, pp. 1135–46, doi:<a href=\"https://doi.org/10.1109/focs46700.2020.00109\">10.1109/focs46700.2020.00109</a>.","ista":"Chen L, Goranci G, Henzinger MH, Peng R, Saranurak T. 2020. Fast dynamic cuts, distances and effective resistances via vertex sparsifiers. 61st Annual Symposium on Foundations of Computer Science. FOCS: Annual Symposium on Foundations of Computer Science, 1135–1146.","apa":"Chen, L., Goranci, G., Henzinger, M. H., Peng, R., &#38; Saranurak, T. (2020). Fast dynamic cuts, distances and effective resistances via vertex sparsifiers. In <i>61st Annual Symposium on Foundations of Computer Science</i> (pp. 1135–1146). Durham, NC, United States: Institute of Electrical and Electronics Engineers. <a href=\"https://doi.org/10.1109/focs46700.2020.00109\">https://doi.org/10.1109/focs46700.2020.00109</a>","ieee":"L. Chen, G. Goranci, M. H. Henzinger, R. Peng, and T. Saranurak, “Fast dynamic cuts, distances and effective resistances via vertex sparsifiers,” in <i>61st Annual Symposium on Foundations of Computer Science</i>, Durham, NC, United States, 2020, pp. 1135–1146.","chicago":"Chen, Li, Gramoz Goranci, Monika H Henzinger, Richard Peng, and Thatchaphol Saranurak. “Fast Dynamic Cuts, Distances and Effective Resistances via Vertex Sparsifiers.” In <i>61st Annual Symposium on Foundations of Computer Science</i>, 1135–46. Institute of Electrical and Electronics Engineers, 2020. <a href=\"https://doi.org/10.1109/focs46700.2020.00109\">https://doi.org/10.1109/focs46700.2020.00109</a>.","short":"L. Chen, G. Goranci, M.H. Henzinger, R. Peng, T. Saranurak, in:, 61st Annual Symposium on Foundations of Computer Science, Institute of Electrical and Electronics Engineers, 2020, pp. 1135–1146."},"oa":1,"publication_status":"published","date_published":"2020-11-01T00:00:00Z","main_file_link":[{"url":"https://arxiv.org/abs/2005.02368","open_access":"1"}]},{"abstract":[{"lang":"eng","text":"Given a directed graph and a source vertex, the fully dynamic single-source reachability problem is to maintain the set of vertices that are reachable from the given vertex, subject to edge deletions and insertions. It is one of the most fundamental problems on graphs and appears directly or indirectly in many and varied applications. While there has been theoretical work on this problem, showing both linear conditional lower bounds for the fully dynamic problem and insertions-only and deletions-only upper bounds beating these conditional lower bounds, there has been no experimental study that compares the performance of fully dynamic reachability algorithms in practice. Previous experimental studies in this area concentrated only on the more general all-pairs reachability or transitive closure problem and did not use real-world dynamic graphs.\r\n\r\nIn this paper, we bridge this gap by empirically studying an extensive set of algorithms for the single-source reachability problem in the fully dynamic setting. In particular, we design several fully dynamic variants of well-known approaches to obtain and maintain reachability information with respect to a distinguished source. Moreover, we extend the existing insertions-only or deletions-only upper bounds into fully dynamic algorithms. Even though the worst-case time per operation of all the fully dynamic algorithms we evaluate is at least linear in the number of edges in the graph (as is to be expected given the conditional lower bounds) we show in our extensive experimental evaluation that their performance differs greatly, both on generated as well as on real-world instances."}],"date_updated":"2023-02-17T14:00:37Z","oa_version":"Preprint","type":"conference","month":"01","page":"106-119","date_created":"2022-08-17T06:39:32Z","year":"2020","_id":"11880","publication_status":"published","oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1905.01216"}],"date_published":"2020-01-01T00:00:00Z","external_id":{"arxiv":["1905.01216"]},"status":"public","citation":{"apa":"Hanauer, K., Henzinger, M. H., &#38; Schulz, C. (2020). Fully dynamic single-source reachability in practice: An experimental study. In <i>2020 Symposium on Algorithm Engineering and Experiments</i> (pp. 106–119). Salt Lake City, UT, United States: Society for Industrial and Applied Mathematics. <a href=\"https://doi.org/10.1137/1.9781611976007.9\">https://doi.org/10.1137/1.9781611976007.9</a>","ista":"Hanauer K, Henzinger MH, Schulz C. 2020. Fully dynamic single-source reachability in practice: An experimental study. 2020 Symposium on Algorithm Engineering and Experiments. ALENEX: Symposium on Algorithm Engineering and Experiments, 106–119.","mla":"Hanauer, Kathrin, et al. “Fully Dynamic Single-Source Reachability in Practice: An Experimental Study.” <i>2020 Symposium on Algorithm Engineering and Experiments</i>, Society for Industrial and Applied Mathematics, 2020, pp. 106–19, doi:<a href=\"https://doi.org/10.1137/1.9781611976007.9\">10.1137/1.9781611976007.9</a>.","ama":"Hanauer K, Henzinger MH, Schulz C. Fully dynamic single-source reachability in practice: An experimental study. In: <i>2020 Symposium on Algorithm Engineering and Experiments</i>. Society for Industrial and Applied Mathematics; 2020:106-119. doi:<a href=\"https://doi.org/10.1137/1.9781611976007.9\">10.1137/1.9781611976007.9</a>","short":"K. Hanauer, M.H. Henzinger, C. Schulz, in:, 2020 Symposium on Algorithm Engineering and Experiments, Society for Industrial and Applied Mathematics, 2020, pp. 106–119.","chicago":"Hanauer, Kathrin, Monika H Henzinger, and Christian Schulz. “Fully Dynamic Single-Source Reachability in Practice: An Experimental Study.” In <i>2020 Symposium on Algorithm Engineering and Experiments</i>, 106–19. Society for Industrial and Applied Mathematics, 2020. <a href=\"https://doi.org/10.1137/1.9781611976007.9\">https://doi.org/10.1137/1.9781611976007.9</a>.","ieee":"K. Hanauer, M. H. Henzinger, and C. Schulz, “Fully dynamic single-source reachability in practice: An experimental study,” in <i>2020 Symposium on Algorithm Engineering and Experiments</i>, Salt Lake City, UT, United States, 2020, pp. 106–119."},"extern":"1","day":"01","author":[{"last_name":"Hanauer","first_name":"Kathrin","full_name":"Hanauer, Kathrin"},{"orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H","first_name":"Monika H","last_name":"Henzinger"},{"full_name":"Schulz, Christian","first_name":"Christian","last_name":"Schulz"}],"title":"Fully dynamic single-source reachability in practice: An experimental study","arxiv":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Society for Industrial and Applied Mathematics","scopus_import":"1","article_processing_charge":"No","publication":"2020 Symposium on Algorithm Engineering and Experiments","publication_identifier":{"eisbn":["978-1-61197-600-7"]},"quality_controlled":"1","doi":"10.1137/1.9781611976007.9","language":[{"iso":"eng"}],"conference":{"name":"ALENEX: Symposium on Algorithm Engineering and Experiments","location":"Salt Lake City, UT, United States","start_date":"2020-01-05","end_date":"2020-01-06"}},{"publication":"2020 Symposium on Algorithm Engineering and Experiments","article_processing_charge":"No","scopus_import":"1","publisher":"Society for Industrial and Applied Mathematics","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","arxiv":1,"title":"Shared-memory branch-and-reduce for multiterminal cuts","author":[{"full_name":"Henzinger, Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","last_name":"Henzinger","first_name":"Monika H"},{"first_name":"Alexander","last_name":"Noe","full_name":"Noe, Alexander"},{"first_name":"Christian","last_name":"Schulz","full_name":"Schulz, Christian"}],"day":"01","conference":{"end_date":"2020-01-06","name":"ALENEX: Symposium on Algorithm Engineering and Experiments","location":"Salt Lake City, UT, United States","start_date":"2020-01-05"},"language":[{"iso":"eng"}],"doi":"10.1137/1.9781611976007.4","quality_controlled":"1","publication_identifier":{"eisbn":["978-1-61197-600-7"]},"_id":"11881","year":"2020","date_created":"2022-08-17T06:47:40Z","page":"42-55","oa_version":"Preprint","month":"01","type":"conference","abstract":[{"lang":"eng","text":"We introduce the fastest known exact algorithm for the multiterminal cut problem with k terminals. In particular, we engineer existing as well as new data reduction rules. We use the rules within a branch-and-reduce framework and to boost the performance of an ILP formulation. Our algorithms achieve improvements in running time of up to multiple orders of magnitudes over the ILP formulation without data reductions, which has been the de facto standard used by practitioners. This allows us to solve instances to optimality that are significantly larger than was previously possible."}],"date_updated":"2023-02-17T14:02:04Z","extern":"1","citation":{"short":"M.H. Henzinger, A. Noe, C. Schulz, in:, 2020 Symposium on Algorithm Engineering and Experiments, Society for Industrial and Applied Mathematics, 2020, pp. 42–55.","ieee":"M. H. Henzinger, A. Noe, and C. Schulz, “Shared-memory branch-and-reduce for multiterminal cuts,” in <i>2020 Symposium on Algorithm Engineering and Experiments</i>, Salt Lake City, UT, United States, 2020, pp. 42–55.","chicago":"Henzinger, Monika H, Alexander Noe, and Christian Schulz. “Shared-Memory Branch-and-Reduce for Multiterminal Cuts.” In <i>2020 Symposium on Algorithm Engineering and Experiments</i>, 42–55. Society for Industrial and Applied Mathematics, 2020. <a href=\"https://doi.org/10.1137/1.9781611976007.4\">https://doi.org/10.1137/1.9781611976007.4</a>.","ista":"Henzinger MH, Noe A, Schulz C. 2020. Shared-memory branch-and-reduce for multiterminal cuts. 2020 Symposium on Algorithm Engineering and Experiments. ALENEX: Symposium on Algorithm Engineering and Experiments, 42–55.","mla":"Henzinger, Monika H., et al. “Shared-Memory Branch-and-Reduce for Multiterminal Cuts.” <i>2020 Symposium on Algorithm Engineering and Experiments</i>, Society for Industrial and Applied Mathematics, 2020, pp. 42–55, doi:<a href=\"https://doi.org/10.1137/1.9781611976007.4\">10.1137/1.9781611976007.4</a>.","apa":"Henzinger, M. H., Noe, A., &#38; Schulz, C. (2020). Shared-memory branch-and-reduce for multiterminal cuts. In <i>2020 Symposium on Algorithm Engineering and Experiments</i> (pp. 42–55). Salt Lake City, UT, United States: Society for Industrial and Applied Mathematics. <a href=\"https://doi.org/10.1137/1.9781611976007.4\">https://doi.org/10.1137/1.9781611976007.4</a>","ama":"Henzinger MH, Noe A, Schulz C. Shared-memory branch-and-reduce for multiterminal cuts. In: <i>2020 Symposium on Algorithm Engineering and Experiments</i>. Society for Industrial and Applied Mathematics; 2020:42-55. doi:<a href=\"https://doi.org/10.1137/1.9781611976007.4\">10.1137/1.9781611976007.4</a>"},"external_id":{"arxiv":["1908.04141"]},"status":"public","date_published":"2020-01-01T00:00:00Z","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1908.04141"}],"publication_status":"published","oa":1},{"issue":"1","language":[{"iso":"eng"}],"publication_identifier":{"eissn":["1095-7111"],"issn":["0097-5397"]},"quality_controlled":"1","doi":"10.1137/18m1180335","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Society for Industrial & Applied Mathematics","article_type":"original","scopus_import":"1","article_processing_charge":"No","publication":"SIAM Journal on Computing","day":"01","author":[{"full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger","first_name":"Monika H"},{"last_name":"Rao","first_name":"Satish","full_name":"Rao, Satish"},{"full_name":"Wang, Di","first_name":"Di","last_name":"Wang"}],"title":"Local flow partitioning for faster edge connectivity","arxiv":1,"external_id":{"arxiv":["1704.01254"]},"status":"public","citation":{"short":"M.H. Henzinger, S. Rao, D. Wang, SIAM Journal on Computing 49 (2020) 1–36.","ieee":"M. H. Henzinger, S. Rao, and D. Wang, “Local flow partitioning for faster edge connectivity,” <i>SIAM Journal on Computing</i>, vol. 49, no. 1. Society for Industrial &#38; Applied Mathematics, pp. 1–36, 2020.","chicago":"Henzinger, Monika H, Satish Rao, and Di Wang. “Local Flow Partitioning for Faster Edge Connectivity.” <i>SIAM Journal on Computing</i>. Society for Industrial &#38; Applied Mathematics, 2020. <a href=\"https://doi.org/10.1137/18m1180335\">https://doi.org/10.1137/18m1180335</a>.","ista":"Henzinger MH, Rao S, Wang D. 2020. Local flow partitioning for faster edge connectivity. SIAM Journal on Computing. 49(1), 1–36.","mla":"Henzinger, Monika H., et al. “Local Flow Partitioning for Faster Edge Connectivity.” <i>SIAM Journal on Computing</i>, vol. 49, no. 1, Society for Industrial &#38; Applied Mathematics, 2020, pp. 1–36, doi:<a href=\"https://doi.org/10.1137/18m1180335\">10.1137/18m1180335</a>.","apa":"Henzinger, M. H., Rao, S., &#38; Wang, D. (2020). Local flow partitioning for faster edge connectivity. <i>SIAM Journal on Computing</i>. Society for Industrial &#38; Applied Mathematics. <a href=\"https://doi.org/10.1137/18m1180335\">https://doi.org/10.1137/18m1180335</a>","ama":"Henzinger MH, Rao S, Wang D. Local flow partitioning for faster edge connectivity. <i>SIAM Journal on Computing</i>. 2020;49(1):1-36. doi:<a href=\"https://doi.org/10.1137/18m1180335\">10.1137/18m1180335</a>"},"extern":"1","intvolume":"        49","related_material":{"record":[{"relation":"later_version","status":"public","id":"11873"}]},"publication_status":"published","main_file_link":[{"url":"https://arxiv.org/abs/1704.01254"}],"date_published":"2020-01-01T00:00:00Z","year":"2020","_id":"11889","oa_version":"Preprint","type":"journal_article","month":"01","date_updated":"2023-02-21T16:31:25Z","abstract":[{"lang":"eng","text":"We study the problem of computing a minimum cut in a simple, undirected graph and give a deterministic 𝑂(𝑚log2𝑛loglog2𝑛) time algorithm. This improves on both the best previously known deterministic running time of 𝑂(𝑚log12𝑛) (Kawarabayashi and Thorup [J. ACM, 66 (2018), 4]) and the best previously known randomized running time of 𝑂(𝑚log3𝑛) (Karger [J. ACM, 47 (2000), pp. 46--76]) for this problem, though Karger's algorithm can be further applied to weighted graphs. Moreover, our result extends to balanced directed graphs, where the balance of a directed graph captures how close the graph is to being Eulerian. Our approach is using the Kawarabayashi and Thorup graph compression technique, which repeatedly finds low conductance cuts. To find these cuts they use a diffusion-based local algorithm. We use instead a flow-based local algorithm and suitably adjust their framework to work with our flow-based subroutine. Both flow- and diffusion-based methods have a long history of being applied to finding low conductance cuts. Diffusion algorithms have several variants that are naturally local, while it is more complicated to make flow methods local. Some prior work has proven nice properties for local flow-based algorithms with respect to improving or cleaning up low conductance cuts. Our flow subroutine, however, is the first that both is local and produces low conductance cuts. Thus, it may be of independent interest."}],"page":"1-36","date_created":"2022-08-17T08:09:31Z","volume":49},{"volume":34,"date_created":"2022-08-17T08:50:24Z","page":"130-162","month":"01","type":"journal_article","oa_version":"Preprint","abstract":[{"lang":"eng","text":"Graph sparsification aims at compressing large graphs into smaller ones while preserving important characteristics of the input graph. In this work we study vertex sparsifiers, i.e., sparsifiers whose goal is to reduce the number of vertices. We focus on the following notions: (1) Given a digraph 𝐺=(𝑉,𝐸) and terminal vertices 𝐾⊂𝑉 with |𝐾|=𝑘, a (vertex) reachability sparsifier of 𝐺 is a digraph 𝐻=(𝑉𝐻,𝐸𝐻), 𝐾⊂𝑉𝐻 that preserves all reachability information among terminal pairs. Let |𝑉𝐻| denote the size of 𝐻. In this work we introduce the notion of reachability-preserving minors (RPMs), i.e., we require 𝐻 to be a minor of 𝐺. We show any directed graph 𝐺 admits an RPM 𝐻 of size 𝑂(𝑘3), and if 𝐺 is planar, then the size of 𝐻 improves to 𝑂(𝑘2log𝑘). We complement our upper bound by showing that there exists an infinite family of grids such that any RPM must have Ω(𝑘2) vertices. (2) Given a weighted undirected graph 𝐺=(𝑉,𝐸) and terminal vertices 𝐾 with |𝐾|=𝑘, an exact (vertex) cut sparsifier of 𝐺 is a graph 𝐻 with 𝐾⊂𝑉𝐻 that preserves the value of minimum cuts separating any bipartition of 𝐾. We show that planar graphs with all the 𝑘 terminals lying on the same face admit exact cut sparsifiers of size 𝑂(𝑘2) that are also planar. Our result extends to flow and distance sparsifiers. It improves the previous best-known bound of 𝑂(𝑘222𝑘) for cut and flow sparsifiers by an exponential factor and matches an Ω(𝑘2) lower-bound for this class of graphs."}],"date_updated":"2023-02-21T16:29:44Z","_id":"11894","year":"2020","date_published":"2020-01-01T00:00:00Z","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1702.01136"}],"publication_status":"published","oa":1,"related_material":{"record":[{"id":"11831","status":"public","relation":"earlier_version"}]},"extern":"1","intvolume":"        34","citation":{"ama":"Goranci G, Henzinger MH, Peng P. Improved guarantees for vertex sparsification in planar graphs. <i>SIAM Journal on Discrete Mathematics</i>. 2020;34(1):130-162. doi:<a href=\"https://doi.org/10.1137/17m1163153\">10.1137/17m1163153</a>","ista":"Goranci G, Henzinger MH, Peng P. 2020. Improved guarantees for vertex sparsification in planar graphs. SIAM Journal on Discrete Mathematics. 34(1), 130–162.","mla":"Goranci, Gramoz, et al. “Improved Guarantees for Vertex Sparsification in Planar Graphs.” <i>SIAM Journal on Discrete Mathematics</i>, vol. 34, no. 1, Society for Industrial &#38; Applied Mathematics, 2020, pp. 130–62, doi:<a href=\"https://doi.org/10.1137/17m1163153\">10.1137/17m1163153</a>.","apa":"Goranci, G., Henzinger, M. H., &#38; Peng, P. (2020). Improved guarantees for vertex sparsification in planar graphs. <i>SIAM Journal on Discrete Mathematics</i>. Society for Industrial &#38; Applied Mathematics. <a href=\"https://doi.org/10.1137/17m1163153\">https://doi.org/10.1137/17m1163153</a>","ieee":"G. Goranci, M. H. Henzinger, and P. Peng, “Improved guarantees for vertex sparsification in planar graphs,” <i>SIAM Journal on Discrete Mathematics</i>, vol. 34, no. 1. Society for Industrial &#38; Applied Mathematics, pp. 130–162, 2020.","chicago":"Goranci, Gramoz, Monika H Henzinger, and Pan Peng. “Improved Guarantees for Vertex Sparsification in Planar Graphs.” <i>SIAM Journal on Discrete Mathematics</i>. Society for Industrial &#38; Applied Mathematics, 2020. <a href=\"https://doi.org/10.1137/17m1163153\">https://doi.org/10.1137/17m1163153</a>.","short":"G. Goranci, M.H. Henzinger, P. Peng, SIAM Journal on Discrete Mathematics 34 (2020) 130–162."},"external_id":{"arxiv":["1702.01136"]},"status":"public","title":"Improved guarantees for vertex sparsification in planar graphs","arxiv":1,"author":[{"full_name":"Goranci, Gramoz","first_name":"Gramoz","last_name":"Goranci"},{"first_name":"Monika H","last_name":"Henzinger","full_name":"Henzinger, Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530"},{"first_name":"Pan","last_name":"Peng","full_name":"Peng, Pan"}],"day":"01","publication":"SIAM Journal on Discrete Mathematics","article_type":"original","article_processing_charge":"No","scopus_import":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Society for Industrial & Applied Mathematics","doi":"10.1137/17m1163153","quality_controlled":"1","publication_identifier":{"issn":["0895-4801"],"eissn":["1095-7146"]},"issue":"1","language":[{"iso":"eng"}]},{"quality_controlled":"1","doi":"10.1021/acscatal.0c03950","publication_identifier":{"eissn":["2155-5435"]},"issue":"22","language":[{"iso":"eng"}],"title":"Modular, self-assembling metallaphotocatalyst for cross-couplings using the full visible-light spectrum","day":"02","author":[{"last_name":"Reischauer","first_name":"Susanne","full_name":"Reischauer, Susanne"},{"full_name":"Strauss, Volker","last_name":"Strauss","first_name":"Volker"},{"id":"93e5e5b2-0da6-11ed-8a41-af589a024726","orcid":"0000-0001-8689-388X","full_name":"Pieber, Bartholomäus","last_name":"Pieber","first_name":"Bartholomäus"}],"article_type":"original","article_processing_charge":"No","scopus_import":"1","publication":"ACS Catalysis","publisher":"American Chemical Society","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","main_file_link":[{"open_access":"1","url":"https://doi.org/10.26434/chemrxiv.12444908"}],"date_published":"2020-11-02T00:00:00Z","oa":1,"publication_status":"published","citation":{"ama":"Reischauer S, Strauss V, Pieber B. Modular, self-assembling metallaphotocatalyst for cross-couplings using the full visible-light spectrum. <i>ACS Catalysis</i>. 2020;10(22):13269–13274. doi:<a href=\"https://doi.org/10.1021/acscatal.0c03950\">10.1021/acscatal.0c03950</a>","mla":"Reischauer, Susanne, et al. “Modular, Self-Assembling Metallaphotocatalyst for Cross-Couplings Using the Full Visible-Light Spectrum.” <i>ACS Catalysis</i>, vol. 10, no. 22, American Chemical Society, 2020, pp. 13269–13274, doi:<a href=\"https://doi.org/10.1021/acscatal.0c03950\">10.1021/acscatal.0c03950</a>.","ista":"Reischauer S, Strauss V, Pieber B. 2020. Modular, self-assembling metallaphotocatalyst for cross-couplings using the full visible-light spectrum. ACS Catalysis. 10(22), 13269–13274.","apa":"Reischauer, S., Strauss, V., &#38; Pieber, B. (2020). Modular, self-assembling metallaphotocatalyst for cross-couplings using the full visible-light spectrum. <i>ACS Catalysis</i>. American Chemical Society. <a href=\"https://doi.org/10.1021/acscatal.0c03950\">https://doi.org/10.1021/acscatal.0c03950</a>","ieee":"S. Reischauer, V. Strauss, and B. Pieber, “Modular, self-assembling metallaphotocatalyst for cross-couplings using the full visible-light spectrum,” <i>ACS Catalysis</i>, vol. 10, no. 22. American Chemical Society, pp. 13269–13274, 2020.","chicago":"Reischauer, Susanne, Volker Strauss, and Bartholomäus Pieber. “Modular, Self-Assembling Metallaphotocatalyst for Cross-Couplings Using the Full Visible-Light Spectrum.” <i>ACS Catalysis</i>. American Chemical Society, 2020. <a href=\"https://doi.org/10.1021/acscatal.0c03950\">https://doi.org/10.1021/acscatal.0c03950</a>.","short":"S. Reischauer, V. Strauss, B. Pieber, ACS Catalysis 10 (2020) 13269–13274."},"extern":"1","intvolume":"        10","status":"public","date_created":"2022-08-24T10:40:46Z","volume":10,"type":"journal_article","month":"11","oa_version":"Preprint","date_updated":"2023-02-21T10:09:09Z","abstract":[{"lang":"eng","text":"The combination of nickel and photocatalysis has unlocked a variety of cross-couplings. These protocols rely on a few photocatalysts that can only convert a small portion of visible light (<500 nm) into chemical energy. The high-energy photons that excite the photocatalyst can result in unwanted side reactions. Dyes that absorb a much broader spectrum of light are not applicable because of their short-lived singlet excited states. Here, we describe a self-assembling catalyst system that overcomes this limitation. Immobilization of a nickel catalyst on dye-sensitized titanium dioxide results in a material that catalyzes carbon–heteroatom and carbon–carbon bond formations. The modular approach of dye-sensitized metallaphotocatalysts accesses the entire visible light spectrum and allows tackling selectivity issues resulting from low wavelengths strategically. The concept overcomes current limitations of metallaphotocatalysis by unlocking the potential of dyes that were previously unsuitable."}],"page":"13269–13274","_id":"11954","year":"2020"},{"volume":4,"date_created":"2022-08-25T08:33:38Z","page":"454-454","date_updated":"2023-02-21T10:09:40Z","abstract":[{"text":"The front cover artwork is provided by the group of Dr. Bartholomäus Pieber at the Max Planck Institute of Colloids and Interfaces (Germany). The image symbolizes the activation of a heterogeneous photocatalyst by visible light and its application for organic synthesis. Read the full text of the Review at 10.1002/cptc.202000014.","lang":"eng"}],"type":"journal_article","month":"07","oa_version":"None","_id":"11966","year":"2020","date_published":"2020-07-01T00:00:00Z","publication_status":"published","extern":"1","intvolume":"         4","citation":{"ama":"Gisbertz S, Pieber B. Heterogeneous photocatalysis in organic synthesis. <i>ChemPhotoChem</i>. 2020;4(7):454-454. doi:<a href=\"https://doi.org/10.1002/cptc.202000137\">10.1002/cptc.202000137</a>","ista":"Gisbertz S, Pieber B. 2020. Heterogeneous photocatalysis in organic synthesis. ChemPhotoChem. 4(7), 454–454.","mla":"Gisbertz, Sebastian, and Bartholomäus Pieber. “Heterogeneous Photocatalysis in Organic Synthesis.” <i>ChemPhotoChem</i>, vol. 4, no. 7, Wiley, 2020, pp. 454–454, doi:<a href=\"https://doi.org/10.1002/cptc.202000137\">10.1002/cptc.202000137</a>.","apa":"Gisbertz, S., &#38; Pieber, B. (2020). Heterogeneous photocatalysis in organic synthesis. <i>ChemPhotoChem</i>. Wiley. <a href=\"https://doi.org/10.1002/cptc.202000137\">https://doi.org/10.1002/cptc.202000137</a>","ieee":"S. Gisbertz and B. Pieber, “Heterogeneous photocatalysis in organic synthesis,” <i>ChemPhotoChem</i>, vol. 4, no. 7. Wiley, pp. 454–454, 2020.","chicago":"Gisbertz, Sebastian, and Bartholomäus Pieber. “Heterogeneous Photocatalysis in Organic Synthesis.” <i>ChemPhotoChem</i>. Wiley, 2020. <a href=\"https://doi.org/10.1002/cptc.202000137\">https://doi.org/10.1002/cptc.202000137</a>.","short":"S. Gisbertz, B. Pieber, ChemPhotoChem 4 (2020) 454–454."},"status":"public","title":"Heterogeneous photocatalysis in organic synthesis","author":[{"first_name":"Sebastian","last_name":"Gisbertz","full_name":"Gisbertz, Sebastian"},{"last_name":"Pieber","first_name":"Bartholomäus","id":"93e5e5b2-0da6-11ed-8a41-af589a024726","orcid":"0000-0001-8689-388X","full_name":"Pieber, Bartholomäus"}],"day":"01","publication":"ChemPhotoChem","article_processing_charge":"No","scopus_import":"1","article_type":"original","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Wiley","doi":"10.1002/cptc.202000137","quality_controlled":"1","publication_identifier":{"eissn":["2367-0932"]},"language":[{"iso":"eng"}],"issue":"7"},{"doi":"10.1002/ejoc.201901173","quality_controlled":"1","publication_identifier":{"issn":["1434-193X"],"eissn":["1099-0690"]},"issue":"10","language":[{"iso":"eng"}],"title":"Photochemical strategies for carbon–heteroatom bond formation","author":[{"full_name":"Cavedon, Cristian","last_name":"Cavedon","first_name":"Cristian"},{"last_name":"Seeberger","first_name":"Peter H.","full_name":"Seeberger, Peter H."},{"orcid":"0000-0001-8689-388X","id":"93e5e5b2-0da6-11ed-8a41-af589a024726","full_name":"Pieber, Bartholomäus","first_name":"Bartholomäus","last_name":"Pieber"}],"day":"15","publication":"European Journal of Organic Chemistry","article_type":"review","article_processing_charge":"No","scopus_import":"1","publisher":"Wiley","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2020-03-15T00:00:00Z","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1002/ejoc.201901173"}],"publication_status":"published","oa":1,"extern":"1","intvolume":"      2020","citation":{"short":"C. Cavedon, P.H. Seeberger, B. Pieber, European Journal of Organic Chemistry 2020 (2020) 1379–1392.","chicago":"Cavedon, Cristian, Peter H. Seeberger, and Bartholomäus Pieber. “Photochemical Strategies for Carbon–Heteroatom Bond Formation.” <i>European Journal of Organic Chemistry</i>. Wiley, 2020. <a href=\"https://doi.org/10.1002/ejoc.201901173\">https://doi.org/10.1002/ejoc.201901173</a>.","ieee":"C. Cavedon, P. H. Seeberger, and B. Pieber, “Photochemical strategies for carbon–heteroatom bond formation,” <i>European Journal of Organic Chemistry</i>, vol. 2020, no. 10. Wiley, pp. 1379–1392, 2020.","apa":"Cavedon, C., Seeberger, P. H., &#38; Pieber, B. (2020). Photochemical strategies for carbon–heteroatom bond formation. <i>European Journal of Organic Chemistry</i>. Wiley. <a href=\"https://doi.org/10.1002/ejoc.201901173\">https://doi.org/10.1002/ejoc.201901173</a>","ista":"Cavedon C, Seeberger PH, Pieber B. 2020. Photochemical strategies for carbon–heteroatom bond formation. European Journal of Organic Chemistry. 2020(10), 1379–1392.","mla":"Cavedon, Cristian, et al. “Photochemical Strategies for Carbon–Heteroatom Bond Formation.” <i>European Journal of Organic Chemistry</i>, vol. 2020, no. 10, Wiley, 2020, pp. 1379–92, doi:<a href=\"https://doi.org/10.1002/ejoc.201901173\">10.1002/ejoc.201901173</a>.","ama":"Cavedon C, Seeberger PH, Pieber B. Photochemical strategies for carbon–heteroatom bond formation. <i>European Journal of Organic Chemistry</i>. 2020;2020(10):1379-1392. doi:<a href=\"https://doi.org/10.1002/ejoc.201901173\">10.1002/ejoc.201901173</a>"},"status":"public","volume":2020,"date_created":"2022-08-25T08:49:25Z","page":"1379-1392","month":"03","oa_version":"Published Version","type":"journal_article","date_updated":"2023-02-21T10:09:47Z","abstract":[{"text":"Photochemistry enables new synthetic means to form carbon–heteroatom bonds. Photocatalysts can catalyze carbon–heteroatom cross-couplings by electron or energy transfer either alone or in combination with a second catalyst. Photocatalyst-free methods are possible using photolabile substrates or by generating photoactive electron donor-acceptor complexes. This review summarizes and discusses the strategies used in light-mediated carbon–heteroatom bond formations based on the proposed mechanisms.","lang":"eng"}],"_id":"11969","year":"2020"},{"language":[{"iso":"eng"}],"issue":"25","publication_identifier":{"eissn":["1520-5126"],"issn":["0002-7863"]},"quality_controlled":"1","doi":"10.1021/jacs.0c02848","pmid":1,"publisher":"American Chemical Society","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":"1","article_processing_charge":"No","article_type":"original","publication":"Journal of the American Chemical Society","day":"24","author":[{"full_name":"Malik, Jamal A.","last_name":"Malik","first_name":"Jamal A."},{"full_name":"Madani, Amiera","first_name":"Amiera","last_name":"Madani"},{"id":"93e5e5b2-0da6-11ed-8a41-af589a024726","orcid":"0000-0001-8689-388X","full_name":"Pieber, Bartholomäus","last_name":"Pieber","first_name":"Bartholomäus"},{"full_name":"Seeberger, Peter H.","last_name":"Seeberger","first_name":"Peter H."}],"title":"Evidence for photocatalyst involvement in oxidative additions of nickel-catalyzed carboxylate O-arylations","status":"public","external_id":{"pmid":["32469219"]},"citation":{"apa":"Malik, J. A., Madani, A., Pieber, B., &#38; Seeberger, P. H. (2020). Evidence for photocatalyst involvement in oxidative additions of nickel-catalyzed carboxylate O-arylations. <i>Journal of the American Chemical Society</i>. American Chemical Society. <a href=\"https://doi.org/10.1021/jacs.0c02848\">https://doi.org/10.1021/jacs.0c02848</a>","ista":"Malik JA, Madani A, Pieber B, Seeberger PH. 2020. Evidence for photocatalyst involvement in oxidative additions of nickel-catalyzed carboxylate O-arylations. Journal of the American Chemical Society. 142(25), 11042–11049.","mla":"Malik, Jamal A., et al. “Evidence for Photocatalyst Involvement in Oxidative Additions of Nickel-Catalyzed Carboxylate O-Arylations.” <i>Journal of the American Chemical Society</i>, vol. 142, no. 25, American Chemical Society, 2020, pp. 11042–49, doi:<a href=\"https://doi.org/10.1021/jacs.0c02848\">10.1021/jacs.0c02848</a>.","ama":"Malik JA, Madani A, Pieber B, Seeberger PH. Evidence for photocatalyst involvement in oxidative additions of nickel-catalyzed carboxylate O-arylations. <i>Journal of the American Chemical Society</i>. 2020;142(25):11042-11049. doi:<a href=\"https://doi.org/10.1021/jacs.0c02848\">10.1021/jacs.0c02848</a>","short":"J.A. Malik, A. Madani, B. Pieber, P.H. Seeberger, Journal of the American Chemical Society 142 (2020) 11042–11049.","chicago":"Malik, Jamal A., Amiera Madani, Bartholomäus Pieber, and Peter H. Seeberger. “Evidence for Photocatalyst Involvement in Oxidative Additions of Nickel-Catalyzed Carboxylate O-Arylations.” <i>Journal of the American Chemical Society</i>. American Chemical Society, 2020. <a href=\"https://doi.org/10.1021/jacs.0c02848\">https://doi.org/10.1021/jacs.0c02848</a>.","ieee":"J. A. Malik, A. Madani, B. Pieber, and P. H. Seeberger, “Evidence for photocatalyst involvement in oxidative additions of nickel-catalyzed carboxylate O-arylations,” <i>Journal of the American Chemical Society</i>, vol. 142, no. 25. American Chemical Society, pp. 11042–11049, 2020."},"extern":"1","intvolume":"       142","publication_status":"published","oa":1,"main_file_link":[{"url":"https://doi.org/10.1021/jacs.0c02848","open_access":"1"}],"date_published":"2020-06-24T00:00:00Z","year":"2020","_id":"11978","abstract":[{"text":"Dual photocatalysis and nickel catalysis can effect cross-coupling under mild conditions, but little is known about the in situ kinetics of this class of reactions. We report a comprehensive kinetic examination of a model carboxylate O-arylation, comparing a state-of-the-art homogeneous photocatalyst (Ir(ppy)3) with a competitive heterogeneous photocatalyst (graphitic carbon nitride). Experimental conditions were adjusted such that the nickel catalytic cycle is saturated with excited photocatalyst. This approach was designed to remove the role of the photocatalyst, by which only the intrinsic behaviors of the nickel catalytic cycles are observed. The two reactions did not display identical kinetics. Ir(ppy)3 deactivates the nickel catalytic cycle and creates more dehalogenated side product. Kinetic data for the reaction using Ir(ppy)3 supports a turnover-limiting reductive elimination. Graphitic carbon nitride gave higher selectivity, even at high photocatalyst-to-nickel ratios. The heterogeneous reaction also showed a rate dependence on aryl halide, indicating that oxidative addition plays a role in rate determination. The results argue against the current mechanistic hypothesis, which states that the photocatalyst is only involved to trigger reductive elimination.","lang":"eng"}],"date_updated":"2023-02-21T10:10:06Z","month":"06","type":"journal_article","oa_version":"Published Version","page":"11042-11049","date_created":"2022-08-25T10:57:38Z","volume":142},{"day":"01","author":[{"first_name":"Sebastian","last_name":"Gisbertz","full_name":"Gisbertz, Sebastian"},{"last_name":"Reischauer","first_name":"Susanne","full_name":"Reischauer, Susanne"},{"full_name":"Pieber, Bartholomäus","orcid":"0000-0001-8689-388X","id":"93e5e5b2-0da6-11ed-8a41-af589a024726","first_name":"Bartholomäus","last_name":"Pieber"}],"title":"Overcoming limitations in dual photoredox/nickel-catalysed C–N cross-couplings due to catalyst deactivation","publisher":"Springer Nature","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":"1","article_processing_charge":"No","article_type":"original","publication":"Nature Catalysis","publication_identifier":{"eissn":["2520-1158"]},"quality_controlled":"1","doi":"10.1038/s41929-020-0473-6","language":[{"iso":"eng"}],"issue":"8","abstract":[{"text":"Dual photoredox/nickel-catalysed C–N cross-couplings suffer from low yields for electron-rich aryl halides. The formation of catalytically inactive nickel-black is responsible for this limitation and causes severe reproducibility issues. Here, we demonstrate that catalyst deactivation can be avoided by using a carbon nitride photocatalyst. The broad absorption of the heterogeneous photocatalyst enables wavelength-dependent control of the rate of reductive elimination to prevent nickel-black formation during the coupling of cyclic, secondary amines and aryl halides. A second approach, which is applicable to a broader set of electron-rich aryl halides, is to run the reactions at high concentrations to increase the rate of oxidative addition. Less nucleophilic, primary amines can be coupled with electron-rich aryl halides by stabilizing low-valent nickel intermediates with a suitable additive. The developed protocols enable reproducible, selective C–N cross-couplings of electron-rich aryl bromides and can also be applied for electron-poor aryl chlorides.","lang":"eng"}],"date_updated":"2023-02-21T10:10:09Z","oa_version":"Preprint","month":"08","type":"journal_article","page":"611-620","date_created":"2022-08-25T11:06:16Z","volume":3,"year":"2020","_id":"11979","oa":1,"publication_status":"published","main_file_link":[{"url":"https://doi.org/10.26434/chemrxiv.10298735","open_access":"1"}],"date_published":"2020-08-01T00:00:00Z","status":"public","citation":{"chicago":"Gisbertz, Sebastian, Susanne Reischauer, and Bartholomäus Pieber. “Overcoming Limitations in Dual Photoredox/Nickel-Catalysed C–N Cross-Couplings Due to Catalyst Deactivation.” <i>Nature Catalysis</i>. Springer Nature, 2020. <a href=\"https://doi.org/10.1038/s41929-020-0473-6\">https://doi.org/10.1038/s41929-020-0473-6</a>.","ieee":"S. Gisbertz, S. Reischauer, and B. Pieber, “Overcoming limitations in dual photoredox/nickel-catalysed C–N cross-couplings due to catalyst deactivation,” <i>Nature Catalysis</i>, vol. 3, no. 8. Springer Nature, pp. 611–620, 2020.","short":"S. Gisbertz, S. Reischauer, B. Pieber, Nature Catalysis 3 (2020) 611–620.","ama":"Gisbertz S, Reischauer S, Pieber B. Overcoming limitations in dual photoredox/nickel-catalysed C–N cross-couplings due to catalyst deactivation. <i>Nature Catalysis</i>. 2020;3(8):611-620. doi:<a href=\"https://doi.org/10.1038/s41929-020-0473-6\">10.1038/s41929-020-0473-6</a>","apa":"Gisbertz, S., Reischauer, S., &#38; Pieber, B. (2020). Overcoming limitations in dual photoredox/nickel-catalysed C–N cross-couplings due to catalyst deactivation. <i>Nature Catalysis</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41929-020-0473-6\">https://doi.org/10.1038/s41929-020-0473-6</a>","ista":"Gisbertz S, Reischauer S, Pieber B. 2020. Overcoming limitations in dual photoredox/nickel-catalysed C–N cross-couplings due to catalyst deactivation. Nature Catalysis. 3(8), 611–620.","mla":"Gisbertz, Sebastian, et al. “Overcoming Limitations in Dual Photoredox/Nickel-Catalysed C–N Cross-Couplings Due to Catalyst Deactivation.” <i>Nature Catalysis</i>, vol. 3, no. 8, Springer Nature, 2020, pp. 611–20, doi:<a href=\"https://doi.org/10.1038/s41929-020-0473-6\">10.1038/s41929-020-0473-6</a>."},"extern":"1","intvolume":"         3"},{"language":[{"iso":"eng"}],"publication_identifier":{"eissn":["2041-1723"]},"doi":"10.1038/s41467-020-15131-0","quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Springer Nature","publication":"Nature Communications","article_processing_charge":"No","scopus_import":"1","article_type":"original","author":[{"last_name":"Mazzanti","first_name":"Stefano","full_name":"Mazzanti, Stefano"},{"full_name":"Kurpil, Bogdan","first_name":"Bogdan","last_name":"Kurpil"},{"last_name":"Pieber","first_name":"Bartholomäus","id":"93e5e5b2-0da6-11ed-8a41-af589a024726","orcid":"0000-0001-8689-388X","full_name":"Pieber, Bartholomäus"},{"full_name":"Antonietti, Markus","first_name":"Markus","last_name":"Antonietti"},{"full_name":"Savateev, Aleksandr","first_name":"Aleksandr","last_name":"Savateev"}],"day":"13","title":"Dichloromethylation of enones by carbon nitride photocatalysis","article_number":"1387","status":"public","intvolume":"        11","extern":"1","citation":{"apa":"Mazzanti, S., Kurpil, B., Pieber, B., Antonietti, M., &#38; Savateev, A. (2020). Dichloromethylation of enones by carbon nitride photocatalysis. <i>Nature Communications</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41467-020-15131-0\">https://doi.org/10.1038/s41467-020-15131-0</a>","ista":"Mazzanti S, Kurpil B, Pieber B, Antonietti M, Savateev A. 2020. Dichloromethylation of enones by carbon nitride photocatalysis. Nature Communications. 11, 1387.","mla":"Mazzanti, Stefano, et al. “Dichloromethylation of Enones by Carbon Nitride Photocatalysis.” <i>Nature Communications</i>, vol. 11, 1387, Springer Nature, 2020, doi:<a href=\"https://doi.org/10.1038/s41467-020-15131-0\">10.1038/s41467-020-15131-0</a>.","ama":"Mazzanti S, Kurpil B, Pieber B, Antonietti M, Savateev A. Dichloromethylation of enones by carbon nitride photocatalysis. <i>Nature Communications</i>. 2020;11. doi:<a href=\"https://doi.org/10.1038/s41467-020-15131-0\">10.1038/s41467-020-15131-0</a>","short":"S. Mazzanti, B. Kurpil, B. Pieber, M. Antonietti, A. Savateev, Nature Communications 11 (2020).","chicago":"Mazzanti, Stefano, Bogdan Kurpil, Bartholomäus Pieber, Markus Antonietti, and Aleksandr Savateev. “Dichloromethylation of Enones by Carbon Nitride Photocatalysis.” <i>Nature Communications</i>. Springer Nature, 2020. <a href=\"https://doi.org/10.1038/s41467-020-15131-0\">https://doi.org/10.1038/s41467-020-15131-0</a>.","ieee":"S. Mazzanti, B. Kurpil, B. Pieber, M. Antonietti, and A. Savateev, “Dichloromethylation of enones by carbon nitride photocatalysis,” <i>Nature Communications</i>, vol. 11. Springer Nature, 2020."},"publication_status":"published","oa":1,"date_published":"2020-03-13T00:00:00Z","main_file_link":[{"url":"https://doi.org/10.1038/s41467-020-15131-0","open_access":"1"}],"year":"2020","_id":"11980","abstract":[{"text":"Small organic radicals are ubiquitous intermediates in photocatalysis and are used in organic synthesis to install functional groups and to tune electronic properties and pharmacokinetic parameters of the final molecule. Development of new methods to generate small organic radicals with added functionality can further extend the utility of photocatalysis for synthetic needs. Herein, we present a method to generate dichloromethyl radicals from chloroform using a heterogeneous potassium poly(heptazine imide) (K-PHI) photocatalyst under visible light irradiation for C1-extension of the enone backbone. The method is applied on 15 enones, with γ,γ-dichloroketones yields of 18–89%. Due to negative zeta-potential (−40 mV) and small particle size (100 nm) K-PHI suspension is used in quasi-homogeneous flow-photoreactor increasing the productivity by 19 times compared to the batch approach. The resulting γ,γ-dichloroketones, are used as bifunctional building blocks to access value-added organic compounds such as substituted furans and pyrroles.","lang":"eng"}],"date_updated":"2023-02-21T10:10:14Z","oa_version":"Published Version","type":"journal_article","month":"03","volume":11,"date_created":"2022-08-25T11:10:15Z"},{"issue":"3","language":[{"iso":"eng"}],"doi":"10.1039/d0re00036a","quality_controlled":"1","publication_identifier":{"eissn":["2058-9883"]},"publication":"Reaction Chemistry and Engineering","article_type":"original","article_processing_charge":"No","scopus_import":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Royal Society of Chemistry","title":"An oscillatory plug flow photoreactor facilitates semi-heterogeneous dual nickel/carbon nitride photocatalytic C–N couplings","author":[{"full_name":"Rosso, Cristian","first_name":"Cristian","last_name":"Rosso"},{"full_name":"Gisbertz, Sebastian","first_name":"Sebastian","last_name":"Gisbertz"},{"first_name":"Jason D.","last_name":"Williams","full_name":"Williams, Jason D."},{"full_name":"Gemoets, Hannes P. L.","last_name":"Gemoets","first_name":"Hannes P. L."},{"full_name":"Debrouwer, Wouter","last_name":"Debrouwer","first_name":"Wouter"},{"last_name":"Pieber","first_name":"Bartholomäus","orcid":"0000-0001-8689-388X","id":"93e5e5b2-0da6-11ed-8a41-af589a024726","full_name":"Pieber, Bartholomäus"},{"full_name":"Kappe, C. Oliver","last_name":"Kappe","first_name":"C. Oliver"}],"day":"01","intvolume":"         5","extern":"1","citation":{"short":"C. Rosso, S. Gisbertz, J.D. Williams, H.P.L. Gemoets, W. Debrouwer, B. Pieber, C.O. Kappe, Reaction Chemistry and Engineering 5 (2020) 597–604.","chicago":"Rosso, Cristian, Sebastian Gisbertz, Jason D. Williams, Hannes P. L. Gemoets, Wouter Debrouwer, Bartholomäus Pieber, and C. Oliver Kappe. “An Oscillatory Plug Flow Photoreactor Facilitates Semi-Heterogeneous Dual Nickel/Carbon Nitride Photocatalytic C–N Couplings.” <i>Reaction Chemistry and Engineering</i>. Royal Society of Chemistry, 2020. <a href=\"https://doi.org/10.1039/d0re00036a\">https://doi.org/10.1039/d0re00036a</a>.","ieee":"C. Rosso <i>et al.</i>, “An oscillatory plug flow photoreactor facilitates semi-heterogeneous dual nickel/carbon nitride photocatalytic C–N couplings,” <i>Reaction Chemistry and Engineering</i>, vol. 5, no. 3. Royal Society of Chemistry, pp. 597–604, 2020.","apa":"Rosso, C., Gisbertz, S., Williams, J. D., Gemoets, H. P. L., Debrouwer, W., Pieber, B., &#38; Kappe, C. O. (2020). An oscillatory plug flow photoreactor facilitates semi-heterogeneous dual nickel/carbon nitride photocatalytic C–N couplings. <i>Reaction Chemistry and Engineering</i>. Royal Society of Chemistry. <a href=\"https://doi.org/10.1039/d0re00036a\">https://doi.org/10.1039/d0re00036a</a>","ista":"Rosso C, Gisbertz S, Williams JD, Gemoets HPL, Debrouwer W, Pieber B, Kappe CO. 2020. An oscillatory plug flow photoreactor facilitates semi-heterogeneous dual nickel/carbon nitride photocatalytic C–N couplings. Reaction Chemistry and Engineering. 5(3), 597–604.","mla":"Rosso, Cristian, et al. “An Oscillatory Plug Flow Photoreactor Facilitates Semi-Heterogeneous Dual Nickel/Carbon Nitride Photocatalytic C–N Couplings.” <i>Reaction Chemistry and Engineering</i>, vol. 5, no. 3, Royal Society of Chemistry, 2020, pp. 597–604, doi:<a href=\"https://doi.org/10.1039/d0re00036a\">10.1039/d0re00036a</a>.","ama":"Rosso C, Gisbertz S, Williams JD, et al. An oscillatory plug flow photoreactor facilitates semi-heterogeneous dual nickel/carbon nitride photocatalytic C–N couplings. <i>Reaction Chemistry and Engineering</i>. 2020;5(3):597-604. doi:<a href=\"https://doi.org/10.1039/d0re00036a\">10.1039/d0re00036a</a>"},"status":"public","date_published":"2020-03-01T00:00:00Z","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1039/D0RE00036A"}],"publication_status":"published","oa":1,"_id":"11986","year":"2020","volume":5,"date_created":"2022-08-25T11:45:02Z","page":"597-604","month":"03","oa_version":"Published Version","type":"journal_article","abstract":[{"lang":"eng","text":"Carbon nitride materials have emerged as an efficient and sustainable class of heterogeneous photocatalysts, particularly when paired with nickel in dual catalytic cross-coupling reactions. Performing these transformations on larger scales using a continuous process is difficult due to the problems associated with handling solids in flow. By combining an oscillatory pump with a microstructured plug flow photoreactor, a stable suspension of the photocatalyst can be maintained, circumventing clogging of the reactor channels. Through careful tuning of the oscillator properties, the residence time distribution (RTD) was optimized, whilst maintaining a stable catalyst suspension. Short residence times (20 min) were achieved using optimized conditions and the recyclability of the photocatalyst was demonstrated over 10 cycles with no loss of activity. During a stable 4.5 hour scale-out demonstration, the model substrate could be isolated on 12 g scale (90% yield, 2.67 g h−1). Moreover, the method was applied for the gram scale synthesis of an intermediate of the active pharmaceutical ingredient tetracaine."}],"date_updated":"2023-02-21T10:10:28Z"},{"pmid":1,"department":[{"_id":"XiFe"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Proceedings of the National Academy of Sciences","scopus_import":"1","article_processing_charge":"No","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"article_type":"original","publication":"Proceedings of the National Academy of Sciences","file":[{"access_level":"open_access","date_created":"2023-02-07T11:29:55Z","checksum":"cedee184cb12f454f2fba4158ff47db9","date_updated":"2023-02-07T11:29:55Z","file_id":"12526","creator":"alisjak","relation":"main_file","content_type":"application/pdf","file_size":1105414,"success":1,"file_name":"2020_PNAS_Bloomer.pdf"}],"day":"22","author":[{"last_name":"Bloomer","first_name":"Rebecca H.","full_name":"Bloomer, Rebecca H."},{"first_name":"Claire E.","last_name":"Hutchison","full_name":"Hutchison, Claire E."},{"full_name":"Bäurle, Isabel","first_name":"Isabel","last_name":"Bäurle"},{"full_name":"Walker, James","last_name":"Walker","first_name":"James"},{"last_name":"Fang","first_name":"Xiaofeng","full_name":"Fang, Xiaofeng"},{"last_name":"Perera","first_name":"Pumi","full_name":"Perera, Pumi"},{"last_name":"Velanis","first_name":"Christos N.","full_name":"Velanis, Christos N."},{"first_name":"Serin","last_name":"Gümüs","full_name":"Gümüs, Serin"},{"full_name":"Spanos, Christos","first_name":"Christos","last_name":"Spanos"},{"full_name":"Rappsilber, Juri","first_name":"Juri","last_name":"Rappsilber"},{"full_name":"Feng, Xiaoqi","orcid":"0000-0002-4008-1234","id":"e0164712-22ee-11ed-b12a-d80fcdf35958","last_name":"Feng","first_name":"Xiaoqi"},{"first_name":"Justin","last_name":"Goodrich","full_name":"Goodrich, Justin"},{"first_name":"Caroline","last_name":"Dean","full_name":"Dean, Caroline"}],"title":"The  Arabidopsis epigenetic regulator ICU11 as an accessory protein of polycomb repressive complex 2","language":[{"iso":"eng"}],"issue":"28","keyword":["Multidisciplinary"],"publication_identifier":{"issn":["0027-8424","1091-6490"]},"quality_controlled":"1","doi":"10.1073/pnas.1920621117","year":"2020","acknowledgement":"We would like to thank Scott Berry for help with ICU-GFP nuclear localization microscopy, Hao Yu and Lisha Shen for assistance with 6mA DNA methylation analysis, Donna Gibson for graphic design assistance, and members of the C.D. and Howard laboratories for helpful discussions. This work was funded by the European Research Council grants to “MEXTIM” (to C.D.) and “SexMeth” (to X. Feng), by the Biotechnological and Biological Sciences Research Council (BBSRC) Institute Strategic Programmes GRO (BB/J004588/1), GEN (BB/P013511/1), BBSRC grant (to X. Feng) (BB/S009620/1), and the Marie Sklodowska–Curie Postdoctoral Fellowships “UNRAVEL” (to R.H.B.) and \"WISDOM\" (to X. Fang). Additional funding via the Wellcome Trust through a Senior Research Fellowship (to J.R.) (103139) and a multiuser equipment grant (108504). The Wellcome Centre for Cell Biology is supported by core funding from the Wellcome Trust (203149).","_id":"12188","abstract":[{"lang":"eng","text":"Molecular mechanisms enabling the switching and maintenance of epigenetic states are not fully understood. Distinct histone modifications are often associated with ON/OFF epigenetic states, but how these states are stably maintained through DNA replication, yet in certain situations switch from one to another remains unclear. Here, we address this problem through identification of Arabidopsis INCURVATA11 (ICU11) as a Polycomb Repressive Complex 2 accessory protein. ICU11 robustly immunoprecipitated in vivo with PRC2 core components and the accessory proteins, EMBRYONIC FLOWER 1 (EMF1), LIKE HETEROCHROMATIN PROTEIN1 (LHP1), and TELOMERE_REPEAT_BINDING FACTORS (TRBs). ICU11 encodes a 2-oxoglutarate-dependent dioxygenase, an activity associated with histone demethylation in other organisms, and mutant plants show defects in multiple aspects of the Arabidopsis epigenome. To investigate its primary molecular function we identified the Arabidopsis FLOWERING LOCUS C (FLC) as a direct target and found icu11 disrupted the cold-induced, Polycomb-mediated silencing underlying vernalization. icu11 prevented reduction in H3K36me3 levels normally seen during the early cold phase, supporting a role for ICU11 in H3K36me3 demethylation. This was coincident with an attenuation of H3K27me3 at the internal nucleation site in FLC, and reduction in H3K27me3 levels across the body of the gene after plants were returned to the warm. Thus, ICU11 is required for the cold-induced epigenetic switching between the mutually exclusive chromatin states at FLC, from the active H3K36me3 state to the silenced H3K27me3 state. These data support the importance of physical coupling of histone modification activities to promote epigenetic switching between opposing chromatin states."}],"date_updated":"2023-05-08T10:53:55Z","oa_version":"Published Version","type":"journal_article","month":"05","page":"16660-16666","date_created":"2023-01-16T09:15:44Z","file_date_updated":"2023-02-07T11:29:55Z","volume":117,"external_id":{"pmid":["32601198"]},"status":"public","citation":{"apa":"Bloomer, R. H., Hutchison, C. E., Bäurle, I., Walker, J., Fang, X., Perera, P., … Dean, C. (2020). The  Arabidopsis epigenetic regulator ICU11 as an accessory protein of polycomb repressive complex 2. <i>Proceedings of the National Academy of Sciences</i>. Proceedings of the National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.1920621117\">https://doi.org/10.1073/pnas.1920621117</a>","ista":"Bloomer RH, Hutchison CE, Bäurle I, Walker J, Fang X, Perera P, Velanis CN, Gümüs S, Spanos C, Rappsilber J, Feng X, Goodrich J, Dean C. 2020. The  Arabidopsis epigenetic regulator ICU11 as an accessory protein of polycomb repressive complex 2. Proceedings of the National Academy of Sciences. 117(28), 16660–16666.","mla":"Bloomer, Rebecca H., et al. “The  Arabidopsis Epigenetic Regulator ICU11 as an Accessory Protein of Polycomb Repressive Complex 2.” <i>Proceedings of the National Academy of Sciences</i>, vol. 117, no. 28, Proceedings of the National Academy of Sciences, 2020, pp. 16660–66, doi:<a href=\"https://doi.org/10.1073/pnas.1920621117\">10.1073/pnas.1920621117</a>.","ama":"Bloomer RH, Hutchison CE, Bäurle I, et al. The  Arabidopsis epigenetic regulator ICU11 as an accessory protein of polycomb repressive complex 2. <i>Proceedings of the National Academy of Sciences</i>. 2020;117(28):16660-16666. doi:<a href=\"https://doi.org/10.1073/pnas.1920621117\">10.1073/pnas.1920621117</a>","short":"R.H. Bloomer, C.E. Hutchison, I. Bäurle, J. Walker, X. Fang, P. Perera, C.N. Velanis, S. Gümüs, C. Spanos, J. Rappsilber, X. Feng, J. Goodrich, C. Dean, Proceedings of the National Academy of Sciences 117 (2020) 16660–16666.","chicago":"Bloomer, Rebecca H., Claire E. Hutchison, Isabel Bäurle, James Walker, Xiaofeng Fang, Pumi Perera, Christos N. Velanis, et al. “The  Arabidopsis Epigenetic Regulator ICU11 as an Accessory Protein of Polycomb Repressive Complex 2.” <i>Proceedings of the National Academy of Sciences</i>. Proceedings of the National Academy of Sciences, 2020. <a href=\"https://doi.org/10.1073/pnas.1920621117\">https://doi.org/10.1073/pnas.1920621117</a>.","ieee":"R. H. Bloomer <i>et al.</i>, “The  Arabidopsis epigenetic regulator ICU11 as an accessory protein of polycomb repressive complex 2,” <i>Proceedings of the National Academy of Sciences</i>, vol. 117, no. 28. Proceedings of the National Academy of Sciences, pp. 16660–16666, 2020."},"extern":"1","intvolume":"       117","has_accepted_license":"1","publication_status":"published","oa":1,"main_file_link":[{"url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7368280/","open_access":"1"}],"date_published":"2020-05-22T00:00:00Z","ddc":["580"]}]