[{"day":"18","publisher":"Society for Industrial and Applied Mathematics","doi":"10.1137/21M1410968","arxiv":1,"scopus_import":"1","acknowledgement":"This work was supported by the European Research Council (ERC) under the European Union's Horizon 2020 Research and Innovation Programme grant 716117 and by the AustrianScience Fund (FWF) through grants F65 and W1245.","corr_author":"1","external_id":{"isi":["000889274600001"],"arxiv":["2008.10962"]},"language":[{"iso":"eng"}],"oa":1,"date_created":"2022-08-07T22:01:59Z","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","main_file_link":[{"url":" https://doi.org/10.48550/arXiv.2008.10962","open_access":"1"}],"project":[{"call_identifier":"H2020","grant_number":"716117","_id":"256E75B8-B435-11E9-9278-68D0E5697425","name":"Optimal Transport and Stochastic Dynamics"},{"name":"Taming Complexity in Partial Differential Systems","_id":"fc31cba2-9c52-11eb-aca3-ff467d239cd2","grant_number":"F6504"},{"name":"Dissipation and dispersion in nonlinear partial differential equations","_id":"260788DE-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"W1245"}],"department":[{"_id":"JaMa"}],"intvolume":"        54","year":"2022","ec_funded":1,"_id":"11739","status":"public","citation":{"apa":"Forkert, D. L., Maas, J., &#38; Portinale, L. (2022). Evolutionary $\\Gamma$-convergence of entropic gradient flow structures for Fokker-Planck equations in multiple dimensions. <i>SIAM Journal on Mathematical Analysis</i>. Society for Industrial and Applied Mathematics. <a href=\"https://doi.org/10.1137/21M1410968\">https://doi.org/10.1137/21M1410968</a>","ama":"Forkert DL, Maas J, Portinale L. Evolutionary $\\Gamma$-convergence of entropic gradient flow structures for Fokker-Planck equations in multiple dimensions. <i>SIAM Journal on Mathematical Analysis</i>. 2022;54(4):4297-4333. doi:<a href=\"https://doi.org/10.1137/21M1410968\">10.1137/21M1410968</a>","chicago":"Forkert, Dominik L, Jan Maas, and Lorenzo Portinale. “Evolutionary $\\Gamma$-Convergence of Entropic Gradient Flow Structures for Fokker-Planck Equations in Multiple Dimensions.” <i>SIAM Journal on Mathematical Analysis</i>. Society for Industrial and Applied Mathematics, 2022. <a href=\"https://doi.org/10.1137/21M1410968\">https://doi.org/10.1137/21M1410968</a>.","ieee":"D. L. Forkert, J. Maas, and L. Portinale, “Evolutionary $\\Gamma$-convergence of entropic gradient flow structures for Fokker-Planck equations in multiple dimensions,” <i>SIAM Journal on Mathematical Analysis</i>, vol. 54, no. 4. Society for Industrial and Applied Mathematics, pp. 4297–4333, 2022.","mla":"Forkert, Dominik L., et al. “Evolutionary $\\Gamma$-Convergence of Entropic Gradient Flow Structures for Fokker-Planck Equations in Multiple Dimensions.” <i>SIAM Journal on Mathematical Analysis</i>, vol. 54, no. 4, Society for Industrial and Applied Mathematics, 2022, pp. 4297–333, doi:<a href=\"https://doi.org/10.1137/21M1410968\">10.1137/21M1410968</a>.","short":"D.L. Forkert, J. Maas, L. Portinale, SIAM Journal on Mathematical Analysis 54 (2022) 4297–4333.","ista":"Forkert DL, Maas J, Portinale L. 2022. Evolutionary $\\Gamma$-convergence of entropic gradient flow structures for Fokker-Planck equations in multiple dimensions. SIAM Journal on Mathematical Analysis. 54(4), 4297–4333."},"article_processing_charge":"No","publication_identifier":{"issn":["0036-1410"],"eissn":["1095-7154"]},"type":"journal_article","isi":1,"oa_version":"Preprint","date_updated":"2025-04-15T08:31:31Z","issue":"4","abstract":[{"text":"We consider finite-volume approximations of Fokker--Planck equations on bounded convex domains in $\\mathbb{R}^d$ and study the corresponding gradient flow structures. We reprove the convergence of the discrete to continuous Fokker--Planck equation via the method of evolutionary $\\Gamma$-convergence, i.e., we pass to the limit at the level of the gradient flow structures, generalizing the one-dimensional result obtained by Disser and Liero. The proof is of variational nature and relies on a Mosco convergence result for functionals in the discrete-to-continuum limit that is of independent interest. Our results apply to arbitrary regular meshes, even though the associated discrete transport distances may fail to converge to the Wasserstein distance in this generality.","lang":"eng"}],"month":"07","volume":54,"related_material":{"record":[{"relation":"earlier_version","id":"10022","status":"public"}]},"keyword":["Fokker--Planck equation","gradient flow","evolutionary $\\Gamma$-convergence"],"article_type":"original","author":[{"last_name":"Forkert","full_name":"Forkert, Dominik L","id":"35C79D68-F248-11E8-B48F-1D18A9856A87","first_name":"Dominik L"},{"first_name":"Jan","id":"4C5696CE-F248-11E8-B48F-1D18A9856A87","full_name":"Maas, Jan","last_name":"Maas","orcid":"0000-0002-0845-1338"},{"full_name":"Portinale, Lorenzo","last_name":"Portinale","first_name":"Lorenzo","id":"30AD2CBC-F248-11E8-B48F-1D18A9856A87"}],"date_published":"2022-07-18T00:00:00Z","title":"Evolutionary $\\Gamma$-convergence of entropic gradient flow structures for Fokker-Planck equations in multiple dimensions","publication":"SIAM Journal on Mathematical Analysis","quality_controlled":"1","page":"4297-4333","publication_status":"published"},{"publication_status":"published","quality_controlled":"1","file":[{"file_size":1768663,"date_created":"2022-08-08T06:28:52Z","file_id":"11742","file_name":"2022_ElecJournCombinatorics_Cooley.pdf","access_level":"open_access","content_type":"application/pdf","creator":"dernst","success":1,"relation":"main_file","checksum":"057c676dcee70236aa234d4ce6138c69","date_updated":"2022-08-08T06:28:52Z"}],"publication":"Electronic Journal of Combinatorics","title":"Phase transition in cohomology groups of non-uniform random simplicial complexes","article_number":"P3.27","date_published":"2022-07-29T00:00:00Z","author":[{"full_name":"Cooley, Oliver","last_name":"Cooley","first_name":"Oliver","id":"43f4ddd0-a46b-11ec-8df6-ef3703bd721d"},{"full_name":"Del Giudice, Nicola","last_name":"Del Giudice","first_name":"Nicola"},{"first_name":"Mihyun","last_name":"Kang","full_name":"Kang, Mihyun"},{"first_name":"Philipp","last_name":"Sprüssel","full_name":"Sprüssel, Philipp"}],"article_type":"original","month":"07","abstract":[{"lang":"eng","text":"We consider a generalised model of a random simplicial complex, which arises from a random hypergraph. Our model is generated by taking the downward-closure of a non-uniform binomial random hypergraph, in which for each k, each set of k+1 vertices forms an edge with some probability pk independently. As a special case, this contains an extensively studied model of a (uniform) random simplicial complex, introduced by Meshulam and Wallach [Random Structures & Algorithms 34 (2009), no. 3, pp. 408–417].\r\nWe consider a higher-dimensional notion of connectedness on this new model according to the vanishing of cohomology groups over an arbitrary abelian group R. We prove that this notion of connectedness displays a phase transition and determine the threshold. We also prove a hitting time result for a natural process interpretation, in which simplices and their downward-closure are added one by one. In addition, we determine the asymptotic behaviour of cohomology groups inside the critical window around the time of the phase transition."}],"volume":29,"date_updated":"2024-10-09T21:03:03Z","issue":"3","has_accepted_license":"1","isi":1,"oa_version":"Published Version","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode","short":"CC BY-ND (4.0)","name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","image":"/image/cc_by_nd.png"},"type":"journal_article","publication_identifier":{"eissn":["1077-8926"]},"article_processing_charge":"No","citation":{"short":"O. Cooley, N. Del Giudice, M. Kang, P. Sprüssel, Electronic Journal of Combinatorics 29 (2022).","ista":"Cooley O, Del Giudice N, Kang M, Sprüssel P. 2022. Phase transition in cohomology groups of non-uniform random simplicial complexes. Electronic Journal of Combinatorics. 29(3), P3.27.","ieee":"O. Cooley, N. Del Giudice, M. Kang, and P. Sprüssel, “Phase transition in cohomology groups of non-uniform random simplicial complexes,” <i>Electronic Journal of Combinatorics</i>, vol. 29, no. 3. Electronic Journal of Combinatorics, 2022.","chicago":"Cooley, Oliver, Nicola Del Giudice, Mihyun Kang, and Philipp Sprüssel. “Phase Transition in Cohomology Groups of Non-Uniform Random Simplicial Complexes.” <i>Electronic Journal of Combinatorics</i>. Electronic Journal of Combinatorics, 2022. <a href=\"https://doi.org/10.37236/10607\">https://doi.org/10.37236/10607</a>.","mla":"Cooley, Oliver, et al. “Phase Transition in Cohomology Groups of Non-Uniform Random Simplicial Complexes.” <i>Electronic Journal of Combinatorics</i>, vol. 29, no. 3, P3.27, Electronic Journal of Combinatorics, 2022, doi:<a href=\"https://doi.org/10.37236/10607\">10.37236/10607</a>.","ama":"Cooley O, Del Giudice N, Kang M, Sprüssel P. Phase transition in cohomology groups of non-uniform random simplicial complexes. <i>Electronic Journal of Combinatorics</i>. 2022;29(3). doi:<a href=\"https://doi.org/10.37236/10607\">10.37236/10607</a>","apa":"Cooley, O., Del Giudice, N., Kang, M., &#38; Sprüssel, P. (2022). Phase transition in cohomology groups of non-uniform random simplicial complexes. <i>Electronic Journal of Combinatorics</i>. Electronic Journal of Combinatorics. <a href=\"https://doi.org/10.37236/10607\">https://doi.org/10.37236/10607</a>"},"status":"public","_id":"11740","intvolume":"        29","department":[{"_id":"MaKw"}],"year":"2022","license":"https://creativecommons.org/licenses/by-nd/4.0/","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","date_created":"2022-08-07T22:01:59Z","oa":1,"file_date_updated":"2022-08-08T06:28:52Z","language":[{"iso":"eng"}],"external_id":{"arxiv":["2005.07103"],"isi":["000836200300001"]},"corr_author":"1","acknowledgement":"Supported by Austrian Science Fund (FWF): I3747, W1230.","ddc":["510"],"scopus_import":"1","arxiv":1,"doi":"10.37236/10607","publisher":"Electronic Journal of Combinatorics","day":"29"},{"ddc":["500","516","514"],"publisher":"Institute of Science and Technology Austria","doi":"10.15479/at:ista:11777","day":"11","alternative_title":["ISTA Thesis"],"project":[{"name":"International IST Doctoral Program","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"665385"}],"year":"2022","department":[{"_id":"GradSch"},{"_id":"UlWa"}],"ec_funded":1,"file_date_updated":"2022-08-11T16:09:19Z","oa":1,"degree_awarded":"PhD","date_created":"2022-08-10T15:51:19Z","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","corr_author":"1","OA_place":"publisher","language":[{"iso":"eng"}],"date_updated":"2026-04-07T14:18:26Z","abstract":[{"lang":"eng","text":"In this dissertation we study coboundary expansion of simplicial complex with a view of giving geometric applications.\r\nOur main novel tool is an equivariant version of Gromov's celebrated Topological Overlap Theorem. The equivariant topological overlap theorem leads to various geometric applications including a quantitative non-embeddability result for sufficiently thick buildings (which partially resolves a conjecture of Tancer and Vorwerk) and an improved lower bound on the pair-crossing number of (bounded degree) expander graphs. Additionally, we will give new proofs for several known lower bounds for geometric problems such as the number of Tverberg partitions or the crossing number of complete bipartite graphs.\r\nFor the aforementioned applications one is naturally lead to study expansion properties of joins of simplicial complexes. In the presence of a special certificate for expansion (as it is the case, e.g., for spherical buildings), the join of two expanders is an expander. On the flip-side, we report quite some evidence that coboundary expansion exhibits very non-product-like behaviour under taking joins. For instance, we exhibit infinite families of graphs $(G_n)_{n\\in \\mathbb{N}}$ and $(H_n)_{n\\in\\mathbb{N}}$ whose join $G_n*H_n$ has expansion of lower order than the product of the expansion constant of the graphs. Moreover, we show an upper bound of $(d+1)/2^d$ on the normalized coboundary expansion constants for the complete multipartite complex $[n]^{*(d+1)}$ (under a mild divisibility condition on $n$).\r\nVia the probabilistic method the latter result extends to an upper bound of $(d+1)/2^d+\\varepsilon$ on the coboundary expansion constant of the spherical building associated with $\\mathrm{PGL}_{d+2}(\\mathbb{F}_q)$ for any $\\varepsilon>0$ and sufficiently large $q=q(\\varepsilon)$. This disproves a conjecture of Lubotzky, Meshulam and Mozes -- in a rather strong sense.\r\nBy improving on existing lower bounds we make further progress towards closing the gap between the known lower and upper bounds on the coboundary expansion constants of $[n]^{*(d+1)}$. The best improvements we achieve using computer-aided proofs and flag algebras. The exact value even for the complete $3$-partite $2$-dimensional complex $[n]^{*3}$ remains unknown but we are happy to conjecture a precise value for every $n$. %Moreover, we show that a previously shown lower bound on the expansion constant of the spherical building associated with $\\mathrm{PGL}_{2}(\\mathbb{F}_q)$ is not tight.\r\nIn a loosely structured, last chapter of this thesis we collect further smaller observations related to expansion. We point out a link between discrete Morse theory and a technique for showing coboundary expansion, elaborate a bit on the hardness of computing coboundary expansion constants, propose a new criterion for coboundary expansion (in a very dense setting) and give one way of making the folklore result that expansion of links is a necessary condition for a simplicial complex to be an expander precise."}],"month":"08","oa_version":"Published Version","has_accepted_license":"1","citation":{"mla":"Wild, Pascal. <i>High-Dimensional Expansion and Crossing Numbers of Simplicial Complexes</i>. Institute of Science and Technology Austria, 2022, doi:<a href=\"https://doi.org/10.15479/at:ista:11777\">10.15479/at:ista:11777</a>.","ieee":"P. Wild, “High-dimensional expansion and crossing numbers of simplicial complexes,” Institute of Science and Technology Austria, 2022.","chicago":"Wild, Pascal. “High-Dimensional Expansion and Crossing Numbers of Simplicial Complexes.” Institute of Science and Technology Austria, 2022. <a href=\"https://doi.org/10.15479/at:ista:11777\">https://doi.org/10.15479/at:ista:11777</a>.","ista":"Wild P. 2022. High-dimensional expansion and crossing numbers of simplicial complexes. Institute of Science and Technology Austria.","short":"P. Wild, High-Dimensional Expansion and Crossing Numbers of Simplicial Complexes, Institute of Science and Technology Austria, 2022.","apa":"Wild, P. (2022). <i>High-dimensional expansion and crossing numbers of simplicial complexes</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:11777\">https://doi.org/10.15479/at:ista:11777</a>","ama":"Wild P. High-dimensional expansion and crossing numbers of simplicial complexes. 2022. doi:<a href=\"https://doi.org/10.15479/at:ista:11777\">10.15479/at:ista:11777</a>"},"article_processing_charge":"No","publication_identifier":{"issn":["2663-337X"],"isbn":["978-3-99078-021-3"]},"type":"dissertation","supervisor":[{"last_name":"Wagner","orcid":"0000-0002-1494-0568","full_name":"Wagner, Uli","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","first_name":"Uli"}],"_id":"11777","status":"public","page":"170","publication_status":"published","file":[{"description":"Code for computer-assisted proofs in Section 8.4.7 in Thesis","creator":"pwild","relation":"supplementary_material","checksum":"f5f3af1fb7c8a24b71ddc88ad7f7c5b4","date_updated":"2022-08-10T15:34:04Z","file_size":16828,"date_created":"2022-08-10T15:34:04Z","file_id":"11780","file_name":"flags.py","content_type":"text/x-python","access_level":"open_access"},{"date_updated":"2022-08-10T15:34:10Z","creator":"pwild","checksum":"1f7c12dfe3bdaa9b147e4fbc3d34e3d5","relation":"supplementary_material","description":"Code for proof of Lemma 8.20 in Thesis","access_level":"open_access","file_name":"lowerbound.cpp","file_id":"11781","content_type":"text/x-c++src","date_created":"2022-08-10T15:34:10Z","file_size":12226},{"file_id":"11782","file_name":"upperbound.py","content_type":"text/x-python","access_level":"open_access","date_created":"2022-08-10T15:34:17Z","file_size":3240,"description":"Code for proof of Proposition 7.9 in Thesis","date_updated":"2022-08-10T15:34:17Z","creator":"pwild","relation":"supplementary_material","checksum":"4cf81455c49e5dec3b9b2e3980137eeb"},{"date_updated":"2022-08-11T16:08:33Z","relation":"main_file","checksum":"4e96575b10cbe4e0d0db2045b2847774","creator":"pwild","file_id":"11809","content_type":"application/pdf","file_name":"finalthesisPascalWildPDFA.pdf","access_level":"open_access","file_size":5086282,"title":"High-Dimensional Expansion and Crossing Numbers of Simplicial Complexes","date_created":"2022-08-11T16:08:33Z"},{"file_size":18150068,"date_created":"2022-08-11T16:09:19Z","content_type":"application/zip","access_level":"closed","file_id":"11810","file_name":"ThesisSubmission.zip","relation":"source_file","checksum":"92d94842a1fb6dca5808448137573b2e","creator":"pwild","date_updated":"2022-08-11T16:09:19Z"}],"title":"High-dimensional expansion and crossing numbers of simplicial complexes","author":[{"first_name":"Pascal","id":"4C20D868-F248-11E8-B48F-1D18A9856A87","full_name":"Wild, Pascal","last_name":"Wild"}],"date_published":"2022-08-11T00:00:00Z"},{"publication_status":"published","quality_controlled":"1","publication":"Journal of Mathematical Physics","file":[{"success":1,"relation":"main_file","checksum":"d0d32c338c1896680174be88c70968fa","creator":"dernst","date_updated":"2022-08-11T07:03:02Z","date_created":"2022-08-11T07:03:02Z","file_size":5957888,"file_id":"11784","content_type":"application/pdf","access_level":"open_access","file_name":"2022_JourMathPhysics_Bossmann.pdf"}],"title":"Low-energy spectrum and dynamics of the weakly interacting Bose gas","article_number":"061102","date_published":"2022-06-10T00:00:00Z","author":[{"full_name":"Bossmann, Lea","last_name":"Bossmann","orcid":"0000-0002-6854-1343","first_name":"Lea","id":"A2E3BCBE-5FCC-11E9-AA4B-76F3E5697425"}],"keyword":["Mathematical Physics","Statistical and Nonlinear Physics"],"article_type":"original","volume":63,"month":"06","abstract":[{"lang":"eng","text":"We consider a gas of N bosons with interactions in the mean-field scaling regime. We review the proof of an asymptotic expansion of its low-energy spectrum, eigenstates, and dynamics, which provides corrections to Bogoliubov theory to all orders in 1/ N. This is based on joint works with Petrat, Pickl, Seiringer, and Soffer. In addition, we derive a full asymptotic expansion of the ground state one-body reduced density matrix."}],"issue":"6","date_updated":"2025-04-14T07:43:58Z","has_accepted_license":"1","oa_version":"Published Version","isi":1,"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"type":"journal_article","publication_identifier":{"eissn":["1089-7658"],"issn":["0022-2488"]},"article_processing_charge":"Yes (via OA deal)","citation":{"apa":"Bossmann, L. (2022). Low-energy spectrum and dynamics of the weakly interacting Bose gas. <i>Journal of Mathematical Physics</i>. AIP Publishing. <a href=\"https://doi.org/10.1063/5.0089983\">https://doi.org/10.1063/5.0089983</a>","ama":"Bossmann L. Low-energy spectrum and dynamics of the weakly interacting Bose gas. <i>Journal of Mathematical Physics</i>. 2022;63(6). doi:<a href=\"https://doi.org/10.1063/5.0089983\">10.1063/5.0089983</a>","mla":"Bossmann, Lea. “Low-Energy Spectrum and Dynamics of the Weakly Interacting Bose Gas.” <i>Journal of Mathematical Physics</i>, vol. 63, no. 6, 061102, AIP Publishing, 2022, doi:<a href=\"https://doi.org/10.1063/5.0089983\">10.1063/5.0089983</a>.","ieee":"L. Bossmann, “Low-energy spectrum and dynamics of the weakly interacting Bose gas,” <i>Journal of Mathematical Physics</i>, vol. 63, no. 6. AIP Publishing, 2022.","chicago":"Bossmann, Lea. “Low-Energy Spectrum and Dynamics of the Weakly Interacting Bose Gas.” <i>Journal of Mathematical Physics</i>. AIP Publishing, 2022. <a href=\"https://doi.org/10.1063/5.0089983\">https://doi.org/10.1063/5.0089983</a>.","ista":"Bossmann L. 2022. Low-energy spectrum and dynamics of the weakly interacting Bose gas. Journal of Mathematical Physics. 63(6), 061102.","short":"L. Bossmann, Journal of Mathematical Physics 63 (2022)."},"_id":"11783","status":"public","ec_funded":1,"intvolume":"        63","department":[{"_id":"RoSe"}],"year":"2022","project":[{"call_identifier":"H2020","grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","date_created":"2022-08-11T06:37:52Z","oa":1,"file_date_updated":"2022-08-11T07:03:02Z","language":[{"iso":"eng"}],"external_id":{"isi":["000809648100002"],"arxiv":["2203.00730"]},"corr_author":"1","ddc":["530"],"acknowledgement":"The author thanks Nataˇsa Pavlovic, Sören Petrat, Peter Pickl, Robert Seiringer, and Avy Soffer for the collaboration on Refs. 1, 2 and 21. Funding from the European Union’s Horizon 2020 Research and Innovation Programme under Marie Skℓodowska-Curie Grant Agreement\r\nNo. 754411 is gratefully acknowledged.","scopus_import":"1","arxiv":1,"doi":"10.1063/5.0089983","publisher":"AIP Publishing","day":"10"},{"year":"2022","intvolume":"       221","main_file_link":[{"open_access":"1","url":"https://doi.org/10.4230/LIPIcs.SAND.2022.1"}],"oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2022-08-11T14:35:52Z","external_id":{"arxiv":["2102.11169"]},"language":[{"iso":"eng"}],"scopus_import":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","doi":"10.4230/LIPIcs.SAND.2022.1","arxiv":1,"day":"29","alternative_title":["LIPIcs"],"publication_status":"published","extern":"1","publication":"1st Symposium on Algorithmic Foundations of Dynamic Networks","quality_controlled":"1","conference":{"end_date":"2022-03-30","name":"SAND: Symposium on Algorithmic Foundations of Dynamic Networks","start_date":"2022-03-28","location":"Virtual"},"title":"Recent advances in fully dynamic graph algorithms","author":[{"first_name":"Kathrin","last_name":"Hanauer","full_name":"Hanauer, Kathrin"},{"first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","last_name":"Henzinger"},{"first_name":"Christian","last_name":"Schulz","full_name":"Schulz, Christian"}],"date_published":"2022-04-29T00:00:00Z","article_number":"1","date_updated":"2024-11-06T08:23:49Z","month":"04","volume":221,"abstract":[{"lang":"eng","text":"In recent years, significant advances have been made in the design and analysis of fully dynamic 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. Here, we present a quick reference guide to recent engineering and theory results in the area of fully dynamic graph algorithms."}],"oa_version":"Published Version","citation":{"apa":"Hanauer, K., Henzinger, M., &#38; Schulz, C. (2022). Recent advances in fully dynamic graph algorithms. In <i>1st Symposium on Algorithmic Foundations of Dynamic Networks</i> (Vol. 221). Virtual: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.SAND.2022.1\">https://doi.org/10.4230/LIPIcs.SAND.2022.1</a>","ama":"Hanauer K, Henzinger M, Schulz C. Recent advances in fully dynamic graph algorithms. In: <i>1st Symposium on Algorithmic Foundations of Dynamic Networks</i>. Vol 221. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022. doi:<a href=\"https://doi.org/10.4230/LIPIcs.SAND.2022.1\">10.4230/LIPIcs.SAND.2022.1</a>","mla":"Hanauer, Kathrin, et al. “Recent Advances in Fully Dynamic Graph Algorithms.” <i>1st Symposium on Algorithmic Foundations of Dynamic Networks</i>, vol. 221, 1, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, doi:<a href=\"https://doi.org/10.4230/LIPIcs.SAND.2022.1\">10.4230/LIPIcs.SAND.2022.1</a>.","ieee":"K. Hanauer, M. Henzinger, and C. Schulz, “Recent advances in fully dynamic graph algorithms,” in <i>1st Symposium on Algorithmic Foundations of Dynamic Networks</i>, Virtual, 2022, vol. 221.","chicago":"Hanauer, Kathrin, Monika Henzinger, and Christian Schulz. “Recent Advances in Fully Dynamic Graph Algorithms.” In <i>1st Symposium on Algorithmic Foundations of Dynamic Networks</i>, Vol. 221. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. <a href=\"https://doi.org/10.4230/LIPIcs.SAND.2022.1\">https://doi.org/10.4230/LIPIcs.SAND.2022.1</a>.","ista":"Hanauer K, Henzinger M, Schulz C. 2022. Recent advances in fully dynamic graph algorithms. 1st Symposium on Algorithmic Foundations of Dynamic Networks. SAND: Symposium on Algorithmic Foundations of Dynamic Networks, LIPIcs, vol. 221, 1.","short":"K. Hanauer, M. Henzinger, C. Schulz, in:, 1st Symposium on Algorithmic Foundations of Dynamic Networks, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022."},"article_processing_charge":"No","publication_identifier":{"isbn":["9783959772242"],"eissn":["1868-8969"]},"type":"conference","status":"public","_id":"11808"},{"scopus_import":"1","alternative_title":["LIPIcs"],"day":"29","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","doi":"10.4230/LIPIcs.SAND.2022.18","arxiv":1,"main_file_link":[{"url":"https://doi.org/10.4230/LIPIcs.SAND.2022.18","open_access":"1"}],"intvolume":"       221","year":"2022","external_id":{"arxiv":["2106.15524"]},"language":[{"iso":"eng"}],"oa":1,"date_created":"2022-08-12T06:57:55Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","date_updated":"2024-11-06T08:22:47Z","abstract":[{"lang":"eng","text":"This paper presents a comprehensive study of algorithms for maintaining the number of all connected four-vertex subgraphs in a dynamic graph. Specifically, our algorithms maintain the number of paths of length three in deterministic amortized O(m^{1/2}) update time, and any other connected four-vertex subgraph which is not a clique in deterministic amortized update time O(m^{2/3}). Queries can be answered in constant time. We also study the query times for subgraphs containing an arbitrary edge that is supplied only with the query as well as the case where only subgraphs containing a vertex s that is fixed beforehand are considered. For length-3 paths, paws, 4-cycles, and diamonds our bounds match or are not far from (conditional) lower bounds: Based on the OMv conjecture we show that any dynamic algorithm that detects the existence of paws, diamonds, or 4-cycles or that counts length-3 paths takes update time Ω(m^{1/2-δ}).\r\nAdditionally, for 4-cliques and all connected induced subgraphs, we show a lower bound of Ω(m^{1-δ}) for any small constant δ > 0 for the amortized update time, assuming the static combinatorial 4-clique conjecture holds. This shows that the O(m) algorithm by Eppstein et al. [David Eppstein et al., 2012] for these subgraphs cannot be improved by a polynomial factor."}],"month":"04","volume":221,"status":"public","_id":"11812","citation":{"ama":"Hanauer K, Henzinger M, Hua QC. Fully dynamic four-vertex subgraph counting. In: <i>1st Symposium on Algorithmic Foundations of Dynamic Networks</i>. Vol 221. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022. doi:<a href=\"https://doi.org/10.4230/LIPIcs.SAND.2022.18\">10.4230/LIPIcs.SAND.2022.18</a>","apa":"Hanauer, K., Henzinger, M., &#38; Hua, Q. C. (2022). Fully dynamic four-vertex subgraph counting. In <i>1st Symposium on Algorithmic Foundations of Dynamic Networks</i> (Vol. 221). Virtual: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.SAND.2022.18\">https://doi.org/10.4230/LIPIcs.SAND.2022.18</a>","short":"K. Hanauer, M. Henzinger, Q.C. Hua, in:, 1st Symposium on Algorithmic Foundations of Dynamic Networks, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.","ista":"Hanauer K, Henzinger M, Hua QC. 2022. Fully dynamic four-vertex subgraph counting. 1st Symposium on Algorithmic Foundations of Dynamic Networks. SAND: Symposium on Algorithmic Foundations of Dynamic Networks, LIPIcs, vol. 221, 18.","chicago":"Hanauer, Kathrin, Monika Henzinger, and Qi Cheng Hua. “Fully Dynamic Four-Vertex Subgraph Counting.” In <i>1st Symposium on Algorithmic Foundations of Dynamic Networks</i>, Vol. 221. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. <a href=\"https://doi.org/10.4230/LIPIcs.SAND.2022.18\">https://doi.org/10.4230/LIPIcs.SAND.2022.18</a>.","ieee":"K. Hanauer, M. Henzinger, and Q. C. Hua, “Fully dynamic four-vertex subgraph counting,” in <i>1st Symposium on Algorithmic Foundations of Dynamic Networks</i>, Virtual, 2022, vol. 221.","mla":"Hanauer, Kathrin, et al. “Fully Dynamic Four-Vertex Subgraph Counting.” <i>1st Symposium on Algorithmic Foundations of Dynamic Networks</i>, vol. 221, 18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, doi:<a href=\"https://doi.org/10.4230/LIPIcs.SAND.2022.18\">10.4230/LIPIcs.SAND.2022.18</a>."},"article_processing_charge":"No","publication_identifier":{"isbn":["9783959772242"],"issn":["1868-8969"]},"type":"conference","publication":"1st Symposium on Algorithmic Foundations of Dynamic Networks","extern":"1","quality_controlled":"1","publication_status":"published","author":[{"full_name":"Hanauer, Kathrin","last_name":"Hanauer","first_name":"Kathrin"},{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H","orcid":"0000-0002-5008-6530","last_name":"Henzinger","full_name":"Henzinger, Monika H"},{"first_name":"Qi Cheng","last_name":"Hua","full_name":"Hua, Qi Cheng"}],"date_published":"2022-04-29T00:00:00Z","article_number":"18","conference":{"location":"Virtual","start_date":"2022-04-28","end_date":"2022-04-30","name":"SAND: Symposium on Algorithmic Foundations of Dynamic Networks"},"title":"Fully dynamic four-vertex subgraph counting"},{"publication_status":"published","pmid":1,"quality_controlled":"1","publication":"Proceedings of the National Academy of Sciences of the United States of America","file":[{"date_updated":"2023-10-04T09:05:44Z","relation":"main_file","creator":"dernst","success":1,"checksum":"0fe3878896cbeb6c44e29222ec2f336a","content_type":"application/pdf","access_level":"open_access","file_name":"2022_PNAS_Toprakcioglu.pdf","file_id":"14386","date_created":"2023-10-04T09:05:44Z","file_size":2476021}],"title":"Adsorption free energy predicts amyloid protein nucleation rates","author":[{"full_name":"Toprakcioglu, Zenon","last_name":"Toprakcioglu","first_name":"Zenon"},{"first_name":"Ayaka","last_name":"Kamada","full_name":"Kamada, Ayaka"},{"full_name":"Michaels, Thomas C.T.","last_name":"Michaels","first_name":"Thomas C.T."},{"first_name":"Mengqi","last_name":"Xie","full_name":"Xie, Mengqi"},{"first_name":"Johannes","full_name":"Krausser, Johannes","last_name":"Krausser"},{"full_name":"Wei, Jiapeng","last_name":"Wei","first_name":"Jiapeng"},{"id":"bf63d406-f056-11eb-b41d-f263a6566d8b","first_name":"Anđela","orcid":"0000-0002-7854-2139","last_name":"Šarić","full_name":"Šarić, Anđela"},{"first_name":"Michele","full_name":"Vendruscolo, Michele","last_name":"Vendruscolo"},{"last_name":"Knowles","full_name":"Knowles, Tuomas P.J.","first_name":"Tuomas P.J."}],"article_number":"e2109718119","date_published":"2022-07-28T00:00:00Z","article_type":"original","issue":"31","date_updated":"2025-06-12T06:21:34Z","month":"07","abstract":[{"text":"Primary nucleation is the fundamental event that initiates the conversion of proteins from their normal physiological forms into pathological amyloid aggregates associated with the onset and development of disorders including systemic amyloidosis, as well as the neurodegenerative conditions Alzheimer’s and Parkinson’s diseases. It has become apparent that the presence of surfaces can dramatically modulate nucleation. However, the underlying physicochemical parameters governing this process have been challenging to elucidate, with interfaces in some cases having been found to accelerate aggregation, while in others they can inhibit the kinetics of this process. Here we show through kinetic analysis that for three different fibril-forming proteins, interfaces affect the aggregation reaction mainly through modulating the primary nucleation step. Moreover, we show through direct measurements of the Gibbs free energy of adsorption, combined with theory and coarse-grained computer simulations, that overall nucleation rates are suppressed at high and at low surface interaction strengths but significantly enhanced at intermediate strengths, and we verify these regimes experimentally. Taken together, these results provide a quantitative description of the fundamental process which triggers amyloid formation and shed light on the key factors that control this process.","lang":"eng"}],"volume":119,"isi":1,"oa_version":"Published Version","has_accepted_license":"1","tmp":{"image":"/images/cc_by_nc_nd.png","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","short":"CC BY-NC-ND (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode"},"publication_identifier":{"eissn":["1091-6490"],"issn":["0027-8424"]},"type":"journal_article","citation":{"mla":"Toprakcioglu, Zenon, et al. “Adsorption Free Energy Predicts Amyloid Protein Nucleation Rates.” <i>Proceedings of the National Academy of Sciences of the United States of America</i>, vol. 119, no. 31, e2109718119, National Academy of Sciences, 2022, doi:<a href=\"https://doi.org/10.1073/pnas.2109718119\">10.1073/pnas.2109718119</a>.","ieee":"Z. Toprakcioglu <i>et al.</i>, “Adsorption free energy predicts amyloid protein nucleation rates,” <i>Proceedings of the National Academy of Sciences of the United States of America</i>, vol. 119, no. 31. National Academy of Sciences, 2022.","chicago":"Toprakcioglu, Zenon, Ayaka Kamada, Thomas C.T. Michaels, Mengqi Xie, Johannes Krausser, Jiapeng Wei, Anđela Šarić, Michele Vendruscolo, and Tuomas P.J. Knowles. “Adsorption Free Energy Predicts Amyloid Protein Nucleation Rates.” <i>Proceedings of the National Academy of Sciences of the United States of America</i>. National Academy of Sciences, 2022. <a href=\"https://doi.org/10.1073/pnas.2109718119\">https://doi.org/10.1073/pnas.2109718119</a>.","ista":"Toprakcioglu Z, Kamada A, Michaels TCT, Xie M, Krausser J, Wei J, Šarić A, Vendruscolo M, Knowles TPJ. 2022. Adsorption free energy predicts amyloid protein nucleation rates. Proceedings of the National Academy of Sciences of the United States of America. 119(31), e2109718119.","short":"Z. Toprakcioglu, A. Kamada, T.C.T. Michaels, M. Xie, J. Krausser, J. Wei, A. Šarić, M. Vendruscolo, T.P.J. Knowles, Proceedings of the National Academy of Sciences of the United States of America 119 (2022).","apa":"Toprakcioglu, Z., Kamada, A., Michaels, T. C. T., Xie, M., Krausser, J., Wei, J., … Knowles, T. P. J. (2022). Adsorption free energy predicts amyloid protein nucleation rates. <i>Proceedings of the National Academy of Sciences of the United States of America</i>. National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.2109718119\">https://doi.org/10.1073/pnas.2109718119</a>","ama":"Toprakcioglu Z, Kamada A, Michaels TCT, et al. Adsorption free energy predicts amyloid protein nucleation rates. <i>Proceedings of the National Academy of Sciences of the United States of America</i>. 2022;119(31). doi:<a href=\"https://doi.org/10.1073/pnas.2109718119\">10.1073/pnas.2109718119</a>"},"article_processing_charge":"No","_id":"11841","status":"public","ec_funded":1,"project":[{"_id":"eba2549b-77a9-11ec-83b8-a81e493eae4e","name":"Non-Equilibrium Protein Assembly: from Building Blocks to Biological Machines","grant_number":"802960","call_identifier":"H2020"}],"intvolume":"       119","year":"2022","department":[{"_id":"AnSa"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2022-08-14T22:01:45Z","file_date_updated":"2023-10-04T09:05:44Z","oa":1,"external_id":{"pmid":["35901206"],"isi":["000903753500002"]},"language":[{"iso":"eng"}],"acknowledgement":"The research leading to these results has received funding from the European Research Council (ERC) under the European Union’s Seventh Framework Programme (FP7/2007-2013) through the ERC grant PhysProt\r\n(agreement 337969). We are grateful for financial support from the Biotechnology and Biological Sciences Research Council (BBSRC) (T.P.J.K.), the Newman\r\nFoundation (T.P.J.K.), the Wellcome Trust (T.P.J.K. and M.V.), Peterhouse College\r\nCambridge (T.C.T.M.), the ERC Starting Grant (StG) Non-Equilibrium Protein Assembly (NEPA) (A.S.), the Royal Society (A.S.), the Academy of Medical Sciences\r\n(A.S. and J.K.), and the Cambridge Centre for Misfolding Diseases (CMD).","ddc":["570"],"scopus_import":"1","doi":"10.1073/pnas.2109718119","publisher":"National Academy of Sciences","day":"28"},{"corr_author":"1","external_id":{"arxiv":["2112.11154"],"isi":["000834834300001"]},"language":[{"iso":"eng"}],"file_date_updated":"2022-08-16T06:55:22Z","oa":1,"date_created":"2022-08-14T22:01:45Z","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","project":[{"call_identifier":"H2020","grant_number":"948819","name":"Bridging Scales in Random Materials","_id":"0aa76401-070f-11eb-9043-b5bb049fa26d"}],"department":[{"_id":"JuFi"}],"year":"2022","intvolume":"        24","ec_funded":1,"day":"01","publisher":"Springer Nature","doi":"10.1007/s00021-022-00722-2","arxiv":1,"scopus_import":"1","acknowledgement":"The authors warmly thank their former resp. current PhD advisor Julian Fischer for the suggestion of this problem and for valuable initial discussions on the subjects of this paper. This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 948819) , and from the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) under Germany’s Excellence Strategy – EXC-2047/1 – 390685813.","ddc":["510"],"author":[{"id":"4D23B7DA-F248-11E8-B48F-1D18A9856A87","first_name":"Sebastian","orcid":"0000-0001-7252-8072","last_name":"Hensel","full_name":"Hensel, Sebastian"},{"full_name":"Marveggio, Alice","last_name":"Marveggio","first_name":"Alice","id":"25647992-AA84-11E9-9D75-8427E6697425"}],"article_number":"93","date_published":"2022-08-01T00:00:00Z","title":"Weak-strong uniqueness for the Navier–Stokes equation for two fluids with ninety degree contact angle and same viscosities","publication":"Journal of Mathematical Fluid Mechanics","file":[{"date_updated":"2022-08-16T06:55:22Z","checksum":"75c5f286300e6f0539cf57b4dba108d5","success":1,"relation":"main_file","creator":"cchlebak","access_level":"open_access","content_type":"application/pdf","file_name":"2022_JMathFluidMech_Hensel.pdf","file_id":"11848","file_size":2045570,"date_created":"2022-08-16T06:55:22Z"}],"quality_controlled":"1","publication_status":"published","status":"public","_id":"11842","citation":{"mla":"Hensel, Sebastian, and Alice Marveggio. “Weak-Strong Uniqueness for the Navier–Stokes Equation for Two Fluids with Ninety Degree Contact Angle and Same Viscosities.” <i>Journal of Mathematical Fluid Mechanics</i>, vol. 24, no. 3, 93, Springer Nature, 2022, doi:<a href=\"https://doi.org/10.1007/s00021-022-00722-2\">10.1007/s00021-022-00722-2</a>.","chicago":"Hensel, Sebastian, and Alice Marveggio. “Weak-Strong Uniqueness for the Navier–Stokes Equation for Two Fluids with Ninety Degree Contact Angle and Same Viscosities.” <i>Journal of Mathematical Fluid Mechanics</i>. Springer Nature, 2022. <a href=\"https://doi.org/10.1007/s00021-022-00722-2\">https://doi.org/10.1007/s00021-022-00722-2</a>.","ieee":"S. Hensel and A. Marveggio, “Weak-strong uniqueness for the Navier–Stokes equation for two fluids with ninety degree contact angle and same viscosities,” <i>Journal of Mathematical Fluid Mechanics</i>, vol. 24, no. 3. Springer Nature, 2022.","ista":"Hensel S, Marveggio A. 2022. Weak-strong uniqueness for the Navier–Stokes equation for two fluids with ninety degree contact angle and same viscosities. Journal of Mathematical Fluid Mechanics. 24(3), 93.","short":"S. Hensel, A. Marveggio, Journal of Mathematical Fluid Mechanics 24 (2022).","apa":"Hensel, S., &#38; Marveggio, A. (2022). Weak-strong uniqueness for the Navier–Stokes equation for two fluids with ninety degree contact angle and same viscosities. <i>Journal of Mathematical Fluid Mechanics</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00021-022-00722-2\">https://doi.org/10.1007/s00021-022-00722-2</a>","ama":"Hensel S, Marveggio A. Weak-strong uniqueness for the Navier–Stokes equation for two fluids with ninety degree contact angle and same viscosities. <i>Journal of Mathematical Fluid Mechanics</i>. 2022;24(3). doi:<a href=\"https://doi.org/10.1007/s00021-022-00722-2\">10.1007/s00021-022-00722-2</a>"},"article_processing_charge":"No","publication_identifier":{"issn":["1422-6928"],"eissn":["1422-6952"]},"type":"journal_article","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"oa_version":"Published Version","isi":1,"has_accepted_license":"1","date_updated":"2026-04-07T13:28:13Z","issue":"3","month":"08","abstract":[{"text":"We consider the flow of two viscous and incompressible fluids within a bounded domain modeled by means of a two-phase Navier–Stokes system. The two fluids are assumed to be immiscible, meaning that they are separated by an interface. With respect to the motion of the interface, we consider pure transport by the fluid flow. Along the boundary of the domain, a complete slip boundary condition for the fluid velocities and a constant ninety degree contact angle condition for the interface are assumed. In the present work, we devise for the resulting evolution problem a suitable weak solution concept based on the framework of varifolds and establish as the main result a weak-strong uniqueness principle in 2D. The proof is based on a relative entropy argument and requires a non-trivial further development of ideas from the recent work of Fischer and the first author (Arch. Ration. Mech. Anal. 236, 2020) to incorporate the contact angle condition. To focus on the effects of the necessarily singular geometry of the evolving fluid domains, we work for simplicity in the regime of same viscosities for the two fluids.","lang":"eng"}],"volume":24,"related_material":{"record":[{"relation":"dissertation_contains","id":"14587","status":"public"}]},"article_type":"original"},{"oa":1,"file_date_updated":"2022-08-16T08:05:15Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_created":"2022-08-14T22:01:46Z","corr_author":"1","language":[{"iso":"eng"}],"external_id":{"isi":["001031439100030"],"arxiv":["2205.12597"]},"year":"2022","department":[{"_id":"DaAl"}],"project":[{"call_identifier":"H2020","grant_number":"805223","_id":"268A44D6-B435-11E9-9278-68D0E5697425","name":"Elastic Coordination for Scalable Machine Learning"}],"ec_funded":1,"publisher":"Association for Computing Machinery","arxiv":1,"doi":"10.1145/3519270.3538435","day":"21","scopus_import":"1","ddc":["000"],"acknowledgement":"We thank the anonymous reviewers for their helpful comments. We gratefully acknowledge funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 805223 ScaleML).","conference":{"location":"Salerno, Italy","start_date":"2022-07-25","name":"PODC: Symposium on Principles of Distributed Computing","end_date":"2022-07-29"},"title":"Near-optimal leader election in population protocols on graphs","date_published":"2022-07-21T00:00:00Z","author":[{"first_name":"Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","full_name":"Alistarh, Dan-Adrian","orcid":"0000-0003-3650-940X","last_name":"Alistarh"},{"id":"334EFD2E-F248-11E8-B48F-1D18A9856A87","first_name":"Joel","orcid":"0000-0002-6432-6646","last_name":"Rybicki","full_name":"Rybicki, Joel"},{"first_name":"Sasha","last_name":"Voitovych","full_name":"Voitovych, Sasha"}],"page":"246-256","publication_status":"published","file":[{"relation":"main_file","checksum":"4c6b29172b8e355b4fbc364a2e0827b2","creator":"cchlebak","success":1,"date_updated":"2022-08-16T08:05:15Z","date_created":"2022-08-16T08:05:15Z","file_size":1593474,"file_id":"11854","access_level":"open_access","file_name":"2022_PODC_Alistarh.pdf","content_type":"application/pdf"}],"publication":"Proceedings of the Annual ACM Symposium on Principles of Distributed Computing","quality_controlled":"1","article_processing_charge":"Yes (via OA deal)","citation":{"apa":"Alistarh, D.-A., Rybicki, J., &#38; Voitovych, S. (2022). Near-optimal leader election in population protocols on graphs. In <i>Proceedings of the Annual ACM Symposium on Principles of Distributed Computing</i> (pp. 246–256). Salerno, Italy: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3519270.3538435\">https://doi.org/10.1145/3519270.3538435</a>","ama":"Alistarh D-A, Rybicki J, Voitovych S. Near-optimal leader election in population protocols on graphs. In: <i>Proceedings of the Annual ACM Symposium on Principles of Distributed Computing</i>. Association for Computing Machinery; 2022:246-256. doi:<a href=\"https://doi.org/10.1145/3519270.3538435\">10.1145/3519270.3538435</a>","ieee":"D.-A. Alistarh, J. Rybicki, and S. Voitovych, “Near-optimal leader election in population protocols on graphs,” in <i>Proceedings of the Annual ACM Symposium on Principles of Distributed Computing</i>, Salerno, Italy, 2022, pp. 246–256.","chicago":"Alistarh, Dan-Adrian, Joel Rybicki, and Sasha Voitovych. “Near-Optimal Leader Election in Population Protocols on Graphs.” In <i>Proceedings of the Annual ACM Symposium on Principles of Distributed Computing</i>, 246–56. Association for Computing Machinery, 2022. <a href=\"https://doi.org/10.1145/3519270.3538435\">https://doi.org/10.1145/3519270.3538435</a>.","mla":"Alistarh, Dan-Adrian, et al. “Near-Optimal Leader Election in Population Protocols on Graphs.” <i>Proceedings of the Annual ACM Symposium on Principles of Distributed Computing</i>, Association for Computing Machinery, 2022, pp. 246–56, doi:<a href=\"https://doi.org/10.1145/3519270.3538435\">10.1145/3519270.3538435</a>.","short":"D.-A. Alistarh, J. Rybicki, S. Voitovych, in:, Proceedings of the Annual ACM Symposium on Principles of Distributed Computing, Association for Computing Machinery, 2022, pp. 246–256.","ista":"Alistarh D-A, Rybicki J, Voitovych S. 2022. Near-optimal leader election in population protocols on graphs. Proceedings of the Annual ACM Symposium on Principles of Distributed Computing. PODC: Symposium on Principles of Distributed Computing, 246–256."},"type":"conference","publication_identifier":{"isbn":["9781450392624"]},"status":"public","_id":"11844","month":"07","abstract":[{"text":"In the stochastic population protocol model, we are given a connected graph with n nodes, and in every time step, a scheduler samples an edge of the graph uniformly at random and the nodes connected by this edge interact. A fundamental task in this model is stable leader election, in which all nodes start in an identical state and the aim is to reach a configuration in which (1) exactly one node is elected as leader and (2) this node remains as the unique leader no matter what sequence of interactions follows. On cliques, the complexity of this problem has recently been settled: time-optimal protocols stabilize in Θ(n log n) expected steps using Θ(log log n) states, whereas protocols that use O(1) states require Θ(n2) expected steps.\r\n\r\nIn this work, we investigate the complexity of stable leader election on general graphs. We provide the first non-trivial time lower bounds for leader election on general graphs, showing that, when moving beyond cliques, the complexity landscape of leader election becomes very diverse: the time required to elect a leader can range from O(1) to Θ(n3) expected steps. On the upper bound side, we first observe that there exists a protocol that is time-optimal on many graph families, but uses polynomially-many states. In contrast, we give a near-time-optimal protocol that uses only O(log2n) states that is at most a factor log n slower. Finally, we show that the constant-state protocol of Beauquier et al. [OPODIS 2013] is at most a factor n log n slower than the fast polynomial-state protocol. Moreover, among constant-state protocols, this protocol has near-optimal average case complexity on dense random graphs.","lang":"eng"}],"date_updated":"2025-12-30T09:04:17Z","related_material":{"record":[{"relation":"later_version","status":"public","id":"19969"}]},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"has_accepted_license":"1","isi":1,"oa_version":"Published Version"},{"publisher":"Springer Nature","doi":"10.1007/s00028-022-00786-7","day":"01","scopus_import":"1","acknowledgement":"The authors thank Emiel Lorist for helpful comments. The authors thank the anonymous referees for their helpful remarks to improve the presentation.\r\nOpen access funding provided by Institute of Science and Technology (IST Austria).","ddc":["510"],"oa":1,"file_date_updated":"2022-08-16T08:52:46Z","date_created":"2022-08-16T08:39:43Z","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","corr_author":"1","language":[{"iso":"eng"}],"external_id":{"isi":["000809108500001"]},"intvolume":"        22","department":[{"_id":"JuFi"}],"year":"2022","article_processing_charge":"Yes (via OA deal)","citation":{"apa":"Agresti, A., &#38; Veraar, M. (2022). Nonlinear parabolic stochastic evolution equations in critical spaces part II. <i>Journal of Evolution Equations</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00028-022-00786-7\">https://doi.org/10.1007/s00028-022-00786-7</a>","ama":"Agresti A, Veraar M. Nonlinear parabolic stochastic evolution equations in critical spaces part II. <i>Journal of Evolution Equations</i>. 2022;22(2). doi:<a href=\"https://doi.org/10.1007/s00028-022-00786-7\">10.1007/s00028-022-00786-7</a>","chicago":"Agresti, Antonio, and Mark Veraar. “Nonlinear Parabolic Stochastic Evolution Equations in Critical Spaces Part II.” <i>Journal of Evolution Equations</i>. Springer Nature, 2022. <a href=\"https://doi.org/10.1007/s00028-022-00786-7\">https://doi.org/10.1007/s00028-022-00786-7</a>.","ieee":"A. Agresti and M. Veraar, “Nonlinear parabolic stochastic evolution equations in critical spaces part II,” <i>Journal of Evolution Equations</i>, vol. 22, no. 2. Springer Nature, 2022.","mla":"Agresti, Antonio, and Mark Veraar. “Nonlinear Parabolic Stochastic Evolution Equations in Critical Spaces Part II.” <i>Journal of Evolution Equations</i>, vol. 22, no. 2, 56, Springer Nature, 2022, doi:<a href=\"https://doi.org/10.1007/s00028-022-00786-7\">10.1007/s00028-022-00786-7</a>.","short":"A. Agresti, M. Veraar, Journal of Evolution Equations 22 (2022).","ista":"Agresti A, Veraar M. 2022. Nonlinear parabolic stochastic evolution equations in critical spaces part II. Journal of Evolution Equations. 22(2), 56."},"type":"journal_article","publication_identifier":{"eissn":["1424-3202"],"issn":["1424-3199"]},"status":"public","_id":"11858","abstract":[{"lang":"eng","text":"This paper is a continuation of Part I of this project, where we developed a new local well-posedness theory for nonlinear stochastic PDEs with Gaussian noise. In the current Part II we consider blow-up criteria and regularization phenomena. As in Part I we can allow nonlinearities with polynomial growth and rough initial values from critical spaces. In the first main result we obtain several new blow-up criteria for quasi- and semilinear stochastic evolution equations. In particular, for semilinear equations we obtain a Serrin type blow-up criterium, which extends a recent result of Prüss–Simonett–Wilke (J Differ Equ 264(3):2028–2074, 2018) to the stochastic setting. Blow-up criteria can be used to prove global well-posedness for SPDEs. As in Part I, maximal regularity techniques and weights in time play a central role in the proofs. Our second contribution is a new method to bootstrap Sobolev and Hölder regularity in time and space, which does not require smoothness of the initial data. The blow-up criteria are at the basis of these new methods. Moreover, in applications the bootstrap results can be combined with our blow-up criteria, to obtain efficient ways to prove global existence. This gives new results even in classical 𝐿2-settings, which we illustrate for a concrete SPDE. In future works in preparation we apply the results of the current paper to obtain global well-posedness results and regularity for several concrete SPDEs. These include stochastic Navier–Stokes equations, reaction– diffusion equations and the Allen–Cahn equation. Our setting allows to put these SPDEs into a more flexible framework, where less restrictions on the nonlinearities are needed, and we are able to treat rough initial values from critical spaces. Moreover, we will obtain higher-order regularity results."}],"volume":22,"month":"06","date_updated":"2024-10-09T21:03:06Z","issue":"2","article_type":"original","keyword":["Mathematics (miscellaneous)"],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"has_accepted_license":"1","isi":1,"oa_version":"Published Version","title":"Nonlinear parabolic stochastic evolution equations in critical spaces part II","article_number":"56","date_published":"2022-06-01T00:00:00Z","author":[{"first_name":"Antonio","id":"673cd0cc-9b9a-11eb-b144-88f30e1fbb72","full_name":"Agresti, Antonio","last_name":"Agresti","orcid":"0000-0002-9573-2962"},{"first_name":"Mark","last_name":"Veraar","full_name":"Veraar, Mark"}],"publication_status":"published","publication":"Journal of Evolution Equations","file":[{"file_size":1758371,"date_created":"2022-08-16T08:52:46Z","file_id":"11862","content_type":"application/pdf","file_name":"2022_Journal of Evolution Equations_Agresti.pdf","access_level":"open_access","relation":"main_file","checksum":"59b99d1b48b6bd40983e7ce298524a21","creator":"kschuh","success":1,"date_updated":"2022-08-16T08:52:46Z"}],"quality_controlled":"1"},{"ddc":["510"],"acknowledgement":"The author was supported by the German Academic Scholarship Foundation (Studienstiftung des deutschen Volkes) and by the German Research Foundation (DFG) via RTG 1523/2. The author would like to thank Daniel Lenz for his support and encouragement during the author’s ongoing graduate studies and him as well as Marcel Schmidt for fruitful discussions on domination of quadratic forms. He wants to thank Batu Güneysu and Peter Stollmann for valuable comments on a preliminary version of this article. He would also like to thank the organizers of the conference Analysis and Geometry on Graphs and Manifolds in Potsdam, where the initial motivation of this article was conceived, and the organizers of the intense activity period Metric Measure Spaces and Ricci Curvature at MPIM in Bonn, where this work was finished.\r\nOpen access funding provided by Institute of Science and Technology (IST Austria).","scopus_import":"1","doi":"10.1007/s43036-022-00199-w","publisher":"Springer Nature","day":"01","year":"2022","intvolume":"         7","department":[{"_id":"JaMa"}],"date_created":"2022-08-18T07:22:24Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"file_date_updated":"2022-08-18T08:02:34Z","language":[{"iso":"eng"}],"corr_author":"1","article_type":"original","keyword":["Algebra and Number Theory","Analysis"],"abstract":[{"lang":"eng","text":"A domain is called Kac regular for a quadratic form on L2 if every functions vanishing almost everywhere outside the domain can be approximated in form norm by functions with compact support in the domain. It is shown that this notion is stable under domination of quadratic forms. As applications measure perturbations of quasi-regular Dirichlet forms, Cheeger energies on metric measure spaces and Schrödinger operators on manifolds are studied. Along the way a characterization of the Sobolev space with Dirichlet boundary conditions on domains in infinitesimally Riemannian metric measure spaces is obtained."}],"month":"07","volume":7,"issue":"3","date_updated":"2024-10-09T21:03:07Z","has_accepted_license":"1","oa_version":"Published Version","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"type":"journal_article","publication_identifier":{"eissn":["2538-225X"]},"article_processing_charge":"Yes (via OA deal)","citation":{"apa":"Wirth, M. (2022). Kac regularity and domination of quadratic forms. <i>Advances in Operator Theory</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s43036-022-00199-w\">https://doi.org/10.1007/s43036-022-00199-w</a>","ama":"Wirth M. Kac regularity and domination of quadratic forms. <i>Advances in Operator Theory</i>. 2022;7(3). doi:<a href=\"https://doi.org/10.1007/s43036-022-00199-w\">10.1007/s43036-022-00199-w</a>","chicago":"Wirth, Melchior. “Kac Regularity and Domination of Quadratic Forms.” <i>Advances in Operator Theory</i>. Springer Nature, 2022. <a href=\"https://doi.org/10.1007/s43036-022-00199-w\">https://doi.org/10.1007/s43036-022-00199-w</a>.","ieee":"M. Wirth, “Kac regularity and domination of quadratic forms,” <i>Advances in Operator Theory</i>, vol. 7, no. 3. Springer Nature, 2022.","mla":"Wirth, Melchior. “Kac Regularity and Domination of Quadratic Forms.” <i>Advances in Operator Theory</i>, vol. 7, no. 3, 38, Springer Nature, 2022, doi:<a href=\"https://doi.org/10.1007/s43036-022-00199-w\">10.1007/s43036-022-00199-w</a>.","short":"M. Wirth, Advances in Operator Theory 7 (2022).","ista":"Wirth M. 2022. Kac regularity and domination of quadratic forms. Advances in Operator Theory. 7(3), 38."},"_id":"11916","status":"public","publication_status":"published","quality_controlled":"1","publication":"Advances in Operator Theory","file":[{"file_size":389060,"date_created":"2022-08-18T08:02:34Z","file_id":"11921","access_level":"open_access","file_name":"2022_AdvancesOperatorTheory_Wirth.pdf","content_type":"application/pdf","relation":"main_file","creator":"dernst","success":1,"checksum":"913474844a1b38264fb710746d5e2e98","date_updated":"2022-08-18T08:02:34Z"}],"title":"Kac regularity and domination of quadratic forms","article_number":"38","date_published":"2022-07-01T00:00:00Z","author":[{"full_name":"Wirth, Melchior","last_name":"Wirth","orcid":"0000-0002-0519-4241","first_name":"Melchior","id":"88644358-0A0E-11EA-8FA5-49A33DDC885E"}]},{"quality_controlled":"1","file":[{"date_updated":"2022-08-18T08:09:00Z","creator":"dernst","success":1,"checksum":"44418cb44f07fa21ed3907f85abf7f39","relation":"main_file","access_level":"open_access","file_name":"2022_JournalStatisticalPhysics_Rademacher.pdf","file_id":"11922","content_type":"application/pdf","date_created":"2022-08-18T08:09:00Z","file_size":483481}],"publication":"Journal of Statistical Physics","publication_status":"published","article_number":"9","date_published":"2022-07-01T00:00:00Z","author":[{"id":"856966FE-A408-11E9-977E-802DE6697425","first_name":"Simone Anna Elvira","orcid":"0000-0001-5059-4466","last_name":"Rademacher","full_name":"Rademacher, Simone Anna Elvira"},{"full_name":"Seiringer, Robert","orcid":"0000-0002-6781-0521","last_name":"Seiringer","first_name":"Robert","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87"}],"title":"Large deviation estimates for weakly interacting bosons","has_accepted_license":"1","oa_version":"Published Version","isi":1,"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"keyword":["Mathematical Physics","Statistical and Nonlinear Physics"],"article_type":"original","volume":188,"abstract":[{"text":"We study the many-body dynamics of an initially factorized bosonic wave function in the mean-field regime. We prove large deviation estimates for the fluctuations around the condensate. We derive an upper bound extending a recent result to more general interactions. Furthermore, we derive a new lower bound which agrees with the upper bound in leading order.","lang":"eng"}],"month":"07","date_updated":"2025-04-14T07:26:59Z","_id":"11917","status":"public","type":"journal_article","publication_identifier":{"issn":["0022-4715"],"eissn":["1572-9613"]},"article_processing_charge":"Yes (via OA deal)","citation":{"ama":"Rademacher SAE, Seiringer R. Large deviation estimates for weakly interacting bosons. <i>Journal of Statistical Physics</i>. 2022;188. doi:<a href=\"https://doi.org/10.1007/s10955-022-02940-4\">10.1007/s10955-022-02940-4</a>","apa":"Rademacher, S. A. E., &#38; Seiringer, R. (2022). Large deviation estimates for weakly interacting bosons. <i>Journal of Statistical Physics</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s10955-022-02940-4\">https://doi.org/10.1007/s10955-022-02940-4</a>","ista":"Rademacher SAE, Seiringer R. 2022. Large deviation estimates for weakly interacting bosons. Journal of Statistical Physics. 188, 9.","short":"S.A.E. Rademacher, R. Seiringer, Journal of Statistical Physics 188 (2022).","mla":"Rademacher, Simone Anna Elvira, and Robert Seiringer. “Large Deviation Estimates for Weakly Interacting Bosons.” <i>Journal of Statistical Physics</i>, vol. 188, 9, Springer Nature, 2022, doi:<a href=\"https://doi.org/10.1007/s10955-022-02940-4\">10.1007/s10955-022-02940-4</a>.","chicago":"Rademacher, Simone Anna Elvira, and Robert Seiringer. “Large Deviation Estimates for Weakly Interacting Bosons.” <i>Journal of Statistical Physics</i>. Springer Nature, 2022. <a href=\"https://doi.org/10.1007/s10955-022-02940-4\">https://doi.org/10.1007/s10955-022-02940-4</a>.","ieee":"S. A. E. Rademacher and R. Seiringer, “Large deviation estimates for weakly interacting bosons,” <i>Journal of Statistical Physics</i>, vol. 188. Springer Nature, 2022."},"ec_funded":1,"intvolume":"       188","year":"2022","department":[{"_id":"RoSe"}],"project":[{"grant_number":"694227","call_identifier":"H2020","_id":"25C6DC12-B435-11E9-9278-68D0E5697425","name":"Analysis of quantum many-body systems"},{"grant_number":"754411","call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425"}],"language":[{"iso":"eng"}],"external_id":{"isi":["000805175000001"]},"corr_author":"1","date_created":"2022-08-18T07:23:26Z","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","oa":1,"file_date_updated":"2022-08-18T08:09:00Z","acknowledgement":"The authors thank Gérard Ben Arous for pointing out the question of a lower bound. Funding from the European Union’s Horizon 2020 research and innovation programme under the ERC Grant Agreement No. 694227 (R.S.) and under the Marie Skłodowska-Curie Grant Agreement No. 754411 (S.R.) is gratefully acknowledged.\r\nOpen access funding provided by IST Austria.","ddc":["510"],"scopus_import":"1","day":"01","doi":"10.1007/s10955-022-02940-4","publisher":"Springer Nature"},{"_id":"11918","status":"public","day":"01","type":"conference","doi":"10.1137/1.9781611977073.23","publication_identifier":{"eisbn":["978-1-61197-707-3"]},"article_processing_charge":"No","publisher":"Society for Industrial and Applied Mathematics","citation":{"ieee":"M. Henzinger, A. Lincoln, and B. Saha, “The complexity of average-case dynamic subgraph counting,” in <i>33rd Annual ACM-SIAM Symposium on Discrete Algorithms</i>, Alexandria, VA, United States, 2022, pp. 459–498.","chicago":"Henzinger, Monika, Andrea Lincoln, and Barna Saha. “The Complexity of Average-Case Dynamic Subgraph Counting.” In <i>33rd Annual ACM-SIAM Symposium on Discrete Algorithms</i>, 459–98. Society for Industrial and Applied Mathematics, 2022. <a href=\"https://doi.org/10.1137/1.9781611977073.23\">https://doi.org/10.1137/1.9781611977073.23</a>.","mla":"Henzinger, Monika, et al. “The Complexity of Average-Case Dynamic Subgraph Counting.” <i>33rd Annual ACM-SIAM Symposium on Discrete Algorithms</i>, Society for Industrial and Applied Mathematics, 2022, pp. 459–98, doi:<a href=\"https://doi.org/10.1137/1.9781611977073.23\">10.1137/1.9781611977073.23</a>.","short":"M. Henzinger, A. Lincoln, B. Saha, in:, 33rd Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2022, pp. 459–498.","ista":"Henzinger M, Lincoln A, Saha B. 2022. The complexity of average-case dynamic subgraph counting. 33rd Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 459–498.","apa":"Henzinger, M., Lincoln, A., &#38; Saha, B. (2022). The complexity of average-case dynamic subgraph counting. In <i>33rd Annual ACM-SIAM Symposium on Discrete Algorithms</i> (pp. 459–498). Alexandria, VA, United States: Society for Industrial and Applied Mathematics. <a href=\"https://doi.org/10.1137/1.9781611977073.23\">https://doi.org/10.1137/1.9781611977073.23</a>","ama":"Henzinger M, Lincoln A, Saha B. The complexity of average-case dynamic subgraph counting. In: <i>33rd Annual ACM-SIAM Symposium on Discrete Algorithms</i>. Society for Industrial and Applied Mathematics; 2022:459-498. doi:<a href=\"https://doi.org/10.1137/1.9781611977073.23\">10.1137/1.9781611977073.23</a>"},"oa_version":"None","scopus_import":"1","month":"01","abstract":[{"lang":"eng","text":"Statistics of small subgraph counts such as triangles, four-cycles, and s-t paths of short lengths reveal important structural properties of the underlying graph. These problems have been widely studied in social network analysis. In most relevant applications, the graphs are not only massive but also change dynamically over time. Most of these problems become hard in the dynamic setting when considering the worst case. In this paper, we ask whether the question of small subgraph counting over dynamic graphs is hard also in the average case.\r\n\r\nWe consider the simplest possible average case model where the updates follow an Erdős-Rényi graph: each update selects a pair of vertices (u, v) uniformly at random and flips the existence of the edge (u, v). We develop new lower bounds and matching algorithms in this model for counting four-cycles, counting triangles through a specified point s, or a random queried point, and st paths of length 3, 4 and 5. Our results indicate while computing st paths of length 3, and 4 are easy in the average case with O(1) update time (note that they are hard in the worst case), it becomes hard when considering st paths of length 5.\r\n\r\nWe introduce new techniques which allow us to get average-case hardness for these graph problems from the worst-case hardness of the Online Matrix vector problem (OMv). Our techniques rely on recent advances in fine-grained average-case complexity. Our techniques advance this literature, giving the ability to prove new lower bounds on average-case dynamic algorithms."}],"date_updated":"2024-11-06T12:25:50Z","language":[{"iso":"eng"}],"date_published":"2022-01-01T00:00:00Z","author":[{"first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H","last_name":"Henzinger","orcid":"0000-0002-5008-6530"},{"first_name":"Andrea","full_name":"Lincoln, Andrea","last_name":"Lincoln"},{"full_name":"Saha, Barna","last_name":"Saha","first_name":"Barna"}],"title":"The complexity of average-case dynamic subgraph counting","date_created":"2022-08-18T07:26:19Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","conference":{"end_date":"2022-01-12","name":"SODA: Symposium on Discrete Algorithms","location":"Alexandria, VA, United States","start_date":"2022-01-09"},"quality_controlled":"1","publication":"33rd Annual ACM-SIAM Symposium on Discrete Algorithms","extern":"1","year":"2022","page":"459-498","publication_status":"published"},{"date_updated":"2024-11-06T12:26:51Z","abstract":[{"lang":"eng","text":"We present a practically efficient algorithm for maintaining a global minimum cut in large dynamic graphs under both edge insertions and deletions. While there has been theoretical work on this problem, our algorithm is the first implementation of a fully-dynamic algorithm. The algorithm uses the theoretical foundation and combines it with efficient and finely-tuned implementations to give an algorithm that can maintain the global minimum cut of a graph with rapid update times. We show that our algorithm gives up to multiple orders of magnitude speedup compared to static approaches both on edge insertions and deletions."}],"month":"01","oa_version":"Preprint","publication_identifier":{"eisbn":["978-1-61197-704-2"]},"type":"conference","citation":{"apa":"Henzinger, M., Noe, A., &#38; Schulz, C. (2022). Practical fully dynamic minimum cut algorithms. In <i>2022 Proceedings of the Symposium on Algorithm Engineering and Experiments</i> (pp. 13–26). Alexandria, VA, United States: Society for Industrial and Applied Mathematics. <a href=\"https://doi.org/10.1137/1.9781611977042.2\">https://doi.org/10.1137/1.9781611977042.2</a>","ama":"Henzinger M, Noe A, Schulz C. Practical fully dynamic minimum cut algorithms. In: <i>2022 Proceedings of the Symposium on Algorithm Engineering and Experiments</i>. Society for Industrial and Applied Mathematics; 2022:13-26. doi:<a href=\"https://doi.org/10.1137/1.9781611977042.2\">10.1137/1.9781611977042.2</a>","ieee":"M. Henzinger, A. Noe, and C. Schulz, “Practical fully dynamic minimum cut algorithms,” in <i>2022 Proceedings of the Symposium on Algorithm Engineering and Experiments</i>, Alexandria, VA, United States, 2022, pp. 13–26.","chicago":"Henzinger, Monika, Alexander Noe, and Christian Schulz. “Practical Fully Dynamic Minimum Cut Algorithms.” In <i>2022 Proceedings of the Symposium on Algorithm Engineering and Experiments</i>, 13–26. Society for Industrial and Applied Mathematics, 2022. <a href=\"https://doi.org/10.1137/1.9781611977042.2\">https://doi.org/10.1137/1.9781611977042.2</a>.","mla":"Henzinger, Monika, et al. “Practical Fully Dynamic Minimum Cut Algorithms.” <i>2022 Proceedings of the Symposium on Algorithm Engineering and Experiments</i>, Society for Industrial and Applied Mathematics, 2022, pp. 13–26, doi:<a href=\"https://doi.org/10.1137/1.9781611977042.2\">10.1137/1.9781611977042.2</a>.","short":"M. Henzinger, A. Noe, C. Schulz, in:, 2022 Proceedings of the Symposium on Algorithm Engineering and Experiments, Society for Industrial and Applied Mathematics, 2022, pp. 13–26.","ista":"Henzinger M, Noe A, Schulz C. 2022. Practical fully dynamic minimum cut algorithms. 2022 Proceedings of the Symposium on Algorithm Engineering and Experiments. ALENEX: Symposium on Algorithm Engineering and Experiments, 13–26."},"article_processing_charge":"No","_id":"11930","status":"public","page":"13-26","publication_status":"published","quality_controlled":"1","extern":"1","publication":"2022 Proceedings of the Symposium on Algorithm Engineering and Experiments","title":"Practical fully dynamic minimum cut algorithms","conference":{"start_date":"2022-01-09","location":"Alexandria, VA, United States","end_date":"2022-01-10","name":"ALENEX: Symposium on Algorithm Engineering and Experiments"},"author":[{"full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","last_name":"Henzinger","first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630"},{"last_name":"Noe","full_name":"Noe, Alexander","first_name":"Alexander"},{"first_name":"Christian","full_name":"Schulz, Christian","last_name":"Schulz"}],"date_published":"2022-01-01T00:00:00Z","scopus_import":"1","doi":"10.1137/1.9781611977042.2","arxiv":1,"publisher":"Society for Industrial and Applied Mathematics","day":"01","year":"2022","main_file_link":[{"url":"https://arxiv.org/abs/2101.05033","open_access":"1"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2022-08-19T07:27:51Z","oa":1,"external_id":{"arxiv":["2101.05033"]},"language":[{"iso":"eng"}]},{"publisher":"Brown University","doi":"10.7155/jgaa.00591","arxiv":1,"day":"01","scopus_import":"1","acknowledgement":"A.A. funded by the Marie Sklodowska-Curie grant agreement No 754411. Z.M. partially funded by Wittgenstein Prize, Austrian Science Fund (FWF), grant no. Z 342-N31. I.P., D.P., and B.V. partially supported by FWF within the collaborative DACH project Arrangements and Drawings as FWF project I 3340-N35. A.P. supported by a Schrödinger fellowship of the FWF: J-3847-N35. J.T. partially supported by ERC Start grant no. (279307: Graph Games), FWF grant no. P23499-N23 and S11407-N23 (RiSE).","ddc":["000"],"file_date_updated":"2022-08-22T06:42:42Z","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2022-08-21T22:01:56Z","corr_author":"1","external_id":{"arxiv":["2101.03928"]},"language":[{"iso":"eng"}],"project":[{"call_identifier":"H2020","grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships"},{"_id":"268116B8-B435-11E9-9278-68D0E5697425","name":"Mathematics, Computer Science","grant_number":"Z00342","call_identifier":"FWF"},{"grant_number":"279307","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications"},{"call_identifier":"FWF","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","name":"Game Theory","grant_number":"S11407","call_identifier":"FWF"}],"year":"2022","department":[{"_id":"UlWa"},{"_id":"HeEd"},{"_id":"KrCh"}],"intvolume":"        26","ec_funded":1,"citation":{"chicago":"Aichholzer, Oswin, Alan M Arroyo Guevara, Zuzana Masárová, Irene Parada, Daniel Perz, Alexander Pilz, Josef Tkadlec, and Birgit Vogtenhuber. “On Compatible Matchings.” <i>Journal of Graph Algorithms and Applications</i>. Brown University, 2022. <a href=\"https://doi.org/10.7155/jgaa.00591\">https://doi.org/10.7155/jgaa.00591</a>.","ieee":"O. Aichholzer <i>et al.</i>, “On compatible matchings,” <i>Journal of Graph Algorithms and Applications</i>, vol. 26, no. 2. Brown University, pp. 225–240, 2022.","mla":"Aichholzer, Oswin, et al. “On Compatible Matchings.” <i>Journal of Graph Algorithms and Applications</i>, vol. 26, no. 2, Brown University, 2022, pp. 225–40, doi:<a href=\"https://doi.org/10.7155/jgaa.00591\">10.7155/jgaa.00591</a>.","short":"O. Aichholzer, A.M. Arroyo Guevara, Z. Masárová, I. Parada, D. Perz, A. Pilz, J. Tkadlec, B. Vogtenhuber, Journal of Graph Algorithms and Applications 26 (2022) 225–240.","ista":"Aichholzer O, Arroyo Guevara AM, Masárová Z, Parada I, Perz D, Pilz A, Tkadlec J, Vogtenhuber B. 2022. On compatible matchings. Journal of Graph Algorithms and Applications. 26(2), 225–240.","apa":"Aichholzer, O., Arroyo Guevara, A. M., Masárová, Z., Parada, I., Perz, D., Pilz, A., … Vogtenhuber, B. (2022). On compatible matchings. <i>Journal of Graph Algorithms and Applications</i>. Brown University. <a href=\"https://doi.org/10.7155/jgaa.00591\">https://doi.org/10.7155/jgaa.00591</a>","ama":"Aichholzer O, Arroyo Guevara AM, Masárová Z, et al. On compatible matchings. <i>Journal of Graph Algorithms and Applications</i>. 2022;26(2):225-240. doi:<a href=\"https://doi.org/10.7155/jgaa.00591\">10.7155/jgaa.00591</a>"},"article_processing_charge":"No","publication_identifier":{"issn":["1526-1719"]},"type":"journal_article","_id":"11938","status":"public","issue":"2","date_updated":"2026-04-16T09:18:20Z","abstract":[{"lang":"eng","text":"A matching is compatible to two or more labeled point sets of size n with labels {1, . . . , n} if its straight-line drawing on each of these point sets is crossing-free. We study the maximum number of edges in a matching compatible to two or more labeled point sets in general position in the plane. We show that for any two labeled sets of n points in convex position there exists a compatible matching with ⌊√2n + 1 − 1⌋ edges. More generally, for any ℓ labeled point sets we construct compatible matchings of size Ω(n1/ℓ). As a corresponding upper bound, we use probabilistic arguments to show that for any ℓ given sets of n points there exists a labeling of each set such that the largest compatible matching has O(n2/(ℓ+1)) edges. Finally, we show that Θ(log n) copies of any set of n points are necessary and sufficient for the existence of labelings of these point sets such that any compatible matching consists only of a single edge."}],"month":"06","volume":26,"related_material":{"record":[{"id":"9296","status":"public","relation":"earlier_version"}]},"article_type":"original","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"oa_version":"Published Version","has_accepted_license":"1","title":"On compatible matchings","author":[{"full_name":"Aichholzer, Oswin","last_name":"Aichholzer","first_name":"Oswin"},{"id":"3207FDC6-F248-11E8-B48F-1D18A9856A87","first_name":"Alan M","orcid":"0000-0003-2401-8670","last_name":"Arroyo Guevara","full_name":"Arroyo Guevara, Alan M"},{"full_name":"Masárová, Zuzana","last_name":"Masárová","orcid":"0000-0002-6660-1322","first_name":"Zuzana","id":"45CFE238-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Irene","last_name":"Parada","full_name":"Parada, Irene"},{"last_name":"Perz","full_name":"Perz, Daniel","first_name":"Daniel"},{"first_name":"Alexander","last_name":"Pilz","full_name":"Pilz, Alexander"},{"full_name":"Tkadlec, Josef","orcid":"0000-0002-1097-9684","last_name":"Tkadlec","first_name":"Josef","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Vogtenhuber, Birgit","last_name":"Vogtenhuber","first_name":"Birgit"}],"date_published":"2022-06-01T00:00:00Z","publication_status":"published","page":"225-240","publication":"Journal of Graph Algorithms and Applications","file":[{"date_updated":"2022-08-22T06:42:42Z","relation":"main_file","creator":"dernst","checksum":"dc6e255e3558faff924fd9e370886c11","success":1,"content_type":"application/pdf","access_level":"open_access","file_name":"2022_JourGraphAlgorithmsApplic_Aichholzer.pdf","file_id":"11940","date_created":"2022-08-22T06:42:42Z","file_size":694538}],"quality_controlled":"1"},{"page":"133","publication_status":"published","file":[{"relation":"main_file","creator":"rschulz","success":1,"checksum":"61b1b666a210ff7cdd0e95ea75207a13","date_updated":"2022-08-25T08:59:57Z","file_size":28079331,"date_created":"2022-08-25T08:59:57Z","access_level":"open_access","file_id":"11970","content_type":"application/pdf","file_name":"Thesis_Rouven_Schulz_2022_final.pdf"},{"checksum":"2b8f95ea1c134dbdb927b41b1dbeeeb5","relation":"source_file","creator":"rschulz","date_updated":"2022-08-25T09:33:31Z","file_size":27226963,"date_created":"2022-08-25T09:00:11Z","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","file_id":"11971","access_level":"closed","file_name":"Thesis_Rouven_Schulz_2022_final.docx"}],"title":"Chimeric G protein-coupled receptors mimic distinct signaling pathways and modulate microglia function","date_published":"2022-08-23T00:00:00Z","author":[{"first_name":"Rouven","id":"4C5E7B96-F248-11E8-B48F-1D18A9856A87","full_name":"Schulz, Rouven","last_name":"Schulz","orcid":"0000-0001-5297-733X"}],"acknowledged_ssus":[{"_id":"Bio"},{"_id":"PreCl"},{"_id":"LifeSc"}],"related_material":{"record":[{"id":"11995","status":"public","relation":"dissertation_contains"}]},"abstract":[{"text":"G protein-coupled receptors (GPCRs) respond to specific ligands and regulate multiple processes ranging from cell growth and immune responses to neuronal signal transmission. However, ligands for many GPCRs remain unknown, suffer from off-target effects or have poor bioavailability. Additional challenges exist to dissect cell-type specific responses when the same GPCR is expressed on several cell types within the body. Here, we overcome these limitations by engineering DREADD-based GPCR chimeras that selectively bind their agonist clozapine-N-oxide (CNO) and mimic a GPCR-of-interest in a desired cell type.\r\nWe validated our approach with β2-adrenergic receptor (β2AR/ADRB2) and show that our chimeric DREADD-β2AR triggers comparable responses on second messenger and kinase activity, post-translational modifications, and protein-protein interactions. Since β2AR is also enriched in microglia, which can drive inflammation in the central nervous system, we expressed chimeric DREADD-β2AR in primary microglia and successfully recapitulate β2AR-mediated filopodia formation through CNO stimulation. To dissect the role of selected GPCRs during microglial inflammation, we additionally generated DREADD-based chimeras for microglia-enriched GPR65 and GPR109A/HCAR2. In a microglia cell line, DREADD-β2AR and DREADD-GPR65 both modulated the inflammatory response with a similar profile as endogenously expressed β2AR, while DREADD-GPR109A showed no impact.\r\nOur DREADD-based approach provides the means to obtain mechanistic and functional insights into GPCR signaling on a cell-type specific level.","lang":"eng"}],"month":"08","date_updated":"2026-04-07T14:17:59Z","has_accepted_license":"1","oa_version":"Published Version","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"type":"dissertation","publication_identifier":{"issn":["2663-337X"]},"article_processing_charge":"No","citation":{"short":"R. Schulz, Chimeric G Protein-Coupled Receptors Mimic Distinct Signaling Pathways and Modulate Microglia Function, Institute of Science and Technology Austria, 2022.","ista":"Schulz R. 2022. Chimeric G protein-coupled receptors mimic distinct signaling pathways and modulate microglia function. Institute of Science and Technology Austria.","ieee":"R. Schulz, “Chimeric G protein-coupled receptors mimic distinct signaling pathways and modulate microglia function,” Institute of Science and Technology Austria, 2022.","chicago":"Schulz, Rouven. “Chimeric G Protein-Coupled Receptors Mimic Distinct Signaling Pathways and Modulate Microglia Function.” Institute of Science and Technology Austria, 2022. <a href=\"https://doi.org/10.15479/at:ista:11945\">https://doi.org/10.15479/at:ista:11945</a>.","mla":"Schulz, Rouven. <i>Chimeric G Protein-Coupled Receptors Mimic Distinct Signaling Pathways and Modulate Microglia Function</i>. Institute of Science and Technology Austria, 2022, doi:<a href=\"https://doi.org/10.15479/at:ista:11945\">10.15479/at:ista:11945</a>.","ama":"Schulz R. Chimeric G protein-coupled receptors mimic distinct signaling pathways and modulate microglia function. 2022. doi:<a href=\"https://doi.org/10.15479/at:ista:11945\">10.15479/at:ista:11945</a>","apa":"Schulz, R. (2022). <i>Chimeric G protein-coupled receptors mimic distinct signaling pathways and modulate microglia function</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:11945\">https://doi.org/10.15479/at:ista:11945</a>"},"supervisor":[{"id":"36ACD32E-F248-11E8-B48F-1D18A9856A87","first_name":"Sandra","last_name":"Siegert","orcid":"0000-0001-8635-0877","full_name":"Siegert, Sandra"}],"_id":"11945","status":"public","department":[{"_id":"GradSch"},{"_id":"SaSi"}],"year":"2022","project":[{"name":"Modulating microglia through G protein-coupled receptor (GPCR) signaling","_id":"267F75D8-B435-11E9-9278-68D0E5697425"}],"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","degree_awarded":"PhD","date_created":"2022-08-23T11:33:11Z","oa":1,"file_date_updated":"2022-08-25T09:33:31Z","language":[{"iso":"eng"}],"OA_place":"publisher","corr_author":"1","ddc":["570"],"doi":"10.15479/at:ista:11945","publisher":"Institute of Science and Technology Austria","day":"23","alternative_title":["ISTA Thesis"]},{"day":"16","publisher":"Springer Nature","doi":"10.1038/s41467-022-32559-8","scopus_import":"1","ddc":["570"],"acknowledgement":"We thank F. Marr and A. Schlögl for technical assistance, E. Kralli-Beller for manuscript editing, as well as C. Sommer and the Imaging and Optics Facility of the Institute of Science and Technology Austria (ISTA) for image analysis scripts and microscopy support. We extend our gratitude to J. Wallenschus and D. Rangel Guerrero for technical assistance acquiring single-unit data and I. Gridchyn for help with single-unit clustering. Finally, we also thank B. Suter for discussions, A. Saunders, M. Jösch, and H. Monyer for critically reading earlier versions of the manuscript, C. Petersen for sharing clearing protocols, and the Scientific Service Units of ISTA for efficient support. This project was funded by the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (ERC advanced grant No 692692 to P.J.) and the Fond zur Förderung der Wissenschaftlichen Forschung (Z 312-B27, Wittgenstein award for P.J. and I3600-B27 for J.G.D. and P.V.).","corr_author":"1","language":[{"iso":"eng"}],"external_id":{"isi":["000841396400008"],"pmid":["35974109"]},"oa":1,"file_date_updated":"2022-08-26T11:51:40Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2022-08-24T08:25:50Z","department":[{"_id":"JoCs"},{"_id":"PeJo"},{"_id":"JoDa"}],"year":"2022","intvolume":"        13","project":[{"call_identifier":"H2020","grant_number":"692692","name":"Biophysics and circuit function of a giant cortical glutamatergic synapse","_id":"25B7EB9E-B435-11E9-9278-68D0E5697425"},{"name":"Optical control of synaptic function via adhesion molecules","_id":"265CB4D0-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"I03600"},{"call_identifier":"FWF","grant_number":"Z00312","name":"Synaptic communication in neuronal microcircuits","_id":"25C5A090-B435-11E9-9278-68D0E5697425"}],"ec_funded":1,"status":"public","_id":"11951","article_processing_charge":"No","citation":{"ama":"Ben Simon Y, Käfer K, Velicky P, Csicsvari JL, Danzl JG, Jonas PM. A direct excitatory projection from entorhinal layer 6b neurons to the hippocampus contributes to spatial coding and memory. <i>Nature Communications</i>. 2022;13. doi:<a href=\"https://doi.org/10.1038/s41467-022-32559-8\">10.1038/s41467-022-32559-8</a>","apa":"Ben Simon, Y., Käfer, K., Velicky, P., Csicsvari, J. L., Danzl, J. G., &#38; Jonas, P. M. (2022). A direct excitatory projection from entorhinal layer 6b neurons to the hippocampus contributes to spatial coding and memory. <i>Nature Communications</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41467-022-32559-8\">https://doi.org/10.1038/s41467-022-32559-8</a>","ista":"Ben Simon Y, Käfer K, Velicky P, Csicsvari JL, Danzl JG, Jonas PM. 2022. A direct excitatory projection from entorhinal layer 6b neurons to the hippocampus contributes to spatial coding and memory. Nature Communications. 13, 4826.","short":"Y. Ben Simon, K. Käfer, P. Velicky, J.L. Csicsvari, J.G. Danzl, P.M. Jonas, Nature Communications 13 (2022).","mla":"Ben Simon, Yoav, et al. “A Direct Excitatory Projection from Entorhinal Layer 6b Neurons to the Hippocampus Contributes to Spatial Coding and Memory.” <i>Nature Communications</i>, vol. 13, 4826, Springer Nature, 2022, doi:<a href=\"https://doi.org/10.1038/s41467-022-32559-8\">10.1038/s41467-022-32559-8</a>.","chicago":"Ben Simon, Yoav, Karola Käfer, Philipp Velicky, Jozsef L Csicsvari, Johann G Danzl, and Peter M Jonas. “A Direct Excitatory Projection from Entorhinal Layer 6b Neurons to the Hippocampus Contributes to Spatial Coding and Memory.” <i>Nature Communications</i>. Springer Nature, 2022. <a href=\"https://doi.org/10.1038/s41467-022-32559-8\">https://doi.org/10.1038/s41467-022-32559-8</a>.","ieee":"Y. Ben Simon, K. Käfer, P. Velicky, J. L. Csicsvari, J. G. Danzl, and P. M. Jonas, “A direct excitatory projection from entorhinal layer 6b neurons to the hippocampus contributes to spatial coding and memory,” <i>Nature Communications</i>, vol. 13. Springer Nature, 2022."},"type":"journal_article","publication_identifier":{"issn":["2041-1723"]},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"has_accepted_license":"1","oa_version":"Published Version","isi":1,"abstract":[{"lang":"eng","text":"The mammalian hippocampal formation (HF) plays a key role in several higher brain functions, such as spatial coding, learning and memory. Its simple circuit architecture is often viewed as a trisynaptic loop, processing input originating from the superficial layers of the entorhinal cortex (EC) and sending it back to its deeper layers. Here, we show that excitatory neurons in layer 6b of the mouse EC project to all sub-regions comprising the HF and receive input from the CA1, thalamus and claustrum. Furthermore, their output is characterized by unique slow-decaying excitatory postsynaptic currents capable of driving plateau-like potentials in their postsynaptic targets. Optogenetic inhibition of the EC-6b pathway affects spatial coding in CA1 pyramidal neurons, while cell ablation impairs not only acquisition of new spatial memories, but also degradation of previously acquired ones. Our results provide evidence of a functional role for cortical layer 6b neurons in the adult brain."}],"volume":13,"month":"08","date_updated":"2025-06-12T06:10:44Z","article_type":"original","keyword":["General Physics and Astronomy","General Biochemistry","Genetics and Molecular Biology","General Chemistry","Multidisciplinary"],"article_number":"4826","date_published":"2022-08-16T00:00:00Z","acknowledged_ssus":[{"_id":"Bio"},{"_id":"SSU"}],"author":[{"id":"43DF3136-F248-11E8-B48F-1D18A9856A87","first_name":"Yoav","last_name":"Ben Simon","full_name":"Ben Simon, Yoav"},{"first_name":"Karola","id":"2DAA49AA-F248-11E8-B48F-1D18A9856A87","full_name":"Käfer, Karola","last_name":"Käfer"},{"first_name":"Philipp","id":"39BDC62C-F248-11E8-B48F-1D18A9856A87","full_name":"Velicky, Philipp","orcid":"0000-0002-2340-7431","last_name":"Velicky"},{"id":"3FA14672-F248-11E8-B48F-1D18A9856A87","first_name":"Jozsef L","last_name":"Csicsvari","orcid":"0000-0002-5193-4036","full_name":"Csicsvari, Jozsef L"},{"orcid":"0000-0001-8559-3973","last_name":"Danzl","full_name":"Danzl, Johann G","id":"42EFD3B6-F248-11E8-B48F-1D18A9856A87","first_name":"Johann G"},{"id":"353C1B58-F248-11E8-B48F-1D18A9856A87","first_name":"Peter M","orcid":"0000-0001-5001-4804","last_name":"Jonas","full_name":"Jonas, Peter M"}],"title":"A direct excitatory projection from entorhinal layer 6b neurons to the hippocampus contributes to spatial coding and memory","file":[{"content_type":"application/pdf","file_id":"11990","access_level":"open_access","file_name":"2022_NatureCommunications_BenSimon.pdf","date_created":"2022-08-26T11:51:40Z","file_size":5910357,"date_updated":"2022-08-26T11:51:40Z","checksum":"405936d9e4d33625d80c093c9713a91f","relation":"main_file","success":1,"creator":"dernst"}],"publication":"Nature Communications","quality_controlled":"1","pmid":1,"publication_status":"published"},{"publication_status":"published","extern":"1","publication":"Angewandte Chemie International Edition","quality_controlled":"1","pmid":1,"title":"Acridine‐functionalized covalent organic frameworks (COFs) as photocatalysts for metallaphotocatalytic C−N cross‐coupling","date_published":"2022-05-16T00:00:00Z","article_number":"e202117738","author":[{"first_name":"Michael","full_name":"Traxler, Michael","last_name":"Traxler"},{"last_name":"Gisbertz","full_name":"Gisbertz, Sebastian","first_name":"Sebastian"},{"first_name":"Pradip","last_name":"Pachfule","full_name":"Pachfule, Pradip"},{"last_name":"Schmidt","full_name":"Schmidt, Johannes","first_name":"Johannes"},{"full_name":"Roeser, Jérôme","last_name":"Roeser","first_name":"Jérôme"},{"first_name":"Susanne","full_name":"Reischauer, Susanne","last_name":"Reischauer"},{"last_name":"Rabeah","full_name":"Rabeah, Jabor","first_name":"Jabor"},{"last_name":"Pieber","orcid":"0000-0001-8689-388X","full_name":"Pieber, Bartholomäus","id":"93e5e5b2-0da6-11ed-8a41-af589a024726","first_name":"Bartholomäus"},{"first_name":"Arne","full_name":"Thomas, Arne","last_name":"Thomas"}],"abstract":[{"text":"Covalent organic frameworks (COFs) are structurally tuneable, porous and crystalline polymers constructed through the covalent attachment of small organic building blocks as elementary units. Using the myriad of such building blocks, a broad spectrum of functionalities has been applied for COF syntheses for broad applications, including heterogeneous catalysis. Herein, we report the synthesis of a new family of porous and crystalline COFs using a novel acridine linker and benzene-1,3,5-tricarbaldehyde derivatives bearing a variable number of hydroxy groups. With the broad absorption in the visible light region, the COFs were applied as photocatalysts in metallaphotocatalytic C−N cross-coupling. The fully β-ketoenamine linked COF showed the highest activity, due to the increased charge separation upon irradiation. The COF showed good to excellent yields for several aryl bromides, good recyclability and even catalyzed the organic transformation in presence of green light as energy source.","lang":"eng"}],"volume":61,"month":"05","date_updated":"2024-10-14T11:42:54Z","issue":"21","article_type":"original","oa_version":"Published Version","article_processing_charge":"No","citation":{"short":"M. Traxler, S. Gisbertz, P. Pachfule, J. Schmidt, J. Roeser, S. Reischauer, J. Rabeah, B. Pieber, A. Thomas, Angewandte Chemie International Edition 61 (2022).","ista":"Traxler M, Gisbertz S, Pachfule P, Schmidt J, Roeser J, Reischauer S, Rabeah J, Pieber B, Thomas A. 2022. Acridine‐functionalized covalent organic frameworks (COFs) as photocatalysts for metallaphotocatalytic C−N cross‐coupling. Angewandte Chemie International Edition. 61(21), e202117738.","ieee":"M. Traxler <i>et al.</i>, “Acridine‐functionalized covalent organic frameworks (COFs) as photocatalysts for metallaphotocatalytic C−N cross‐coupling,” <i>Angewandte Chemie International Edition</i>, vol. 61, no. 21. Wiley, 2022.","chicago":"Traxler, Michael, Sebastian Gisbertz, Pradip Pachfule, Johannes Schmidt, Jérôme Roeser, Susanne Reischauer, Jabor Rabeah, Bartholomäus Pieber, and Arne Thomas. “Acridine‐functionalized Covalent Organic Frameworks (COFs) as Photocatalysts for Metallaphotocatalytic C−N Cross‐coupling.” <i>Angewandte Chemie International Edition</i>. Wiley, 2022. <a href=\"https://doi.org/10.1002/anie.202117738\">https://doi.org/10.1002/anie.202117738</a>.","mla":"Traxler, Michael, et al. “Acridine‐functionalized Covalent Organic Frameworks (COFs) as Photocatalysts for Metallaphotocatalytic C−N Cross‐coupling.” <i>Angewandte Chemie International Edition</i>, vol. 61, no. 21, e202117738, Wiley, 2022, doi:<a href=\"https://doi.org/10.1002/anie.202117738\">10.1002/anie.202117738</a>.","ama":"Traxler M, Gisbertz S, Pachfule P, et al. Acridine‐functionalized covalent organic frameworks (COFs) as photocatalysts for metallaphotocatalytic C−N cross‐coupling. <i>Angewandte Chemie International Edition</i>. 2022;61(21). doi:<a href=\"https://doi.org/10.1002/anie.202117738\">10.1002/anie.202117738</a>","apa":"Traxler, M., Gisbertz, S., Pachfule, P., Schmidt, J., Roeser, J., Reischauer, S., … Thomas, A. (2022). Acridine‐functionalized covalent organic frameworks (COFs) as photocatalysts for metallaphotocatalytic C−N cross‐coupling. <i>Angewandte Chemie International Edition</i>. Wiley. <a href=\"https://doi.org/10.1002/anie.202117738\">https://doi.org/10.1002/anie.202117738</a>"},"type":"journal_article","publication_identifier":{"issn":["1433-7851"],"eissn":["1521-3773"]},"status":"public","_id":"11955","intvolume":"        61","year":"2022","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1002/anie.202117738"}],"oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2022-08-24T10:41:25Z","language":[{"iso":"eng"}],"external_id":{"pmid":["35188714"]},"scopus_import":"1","publisher":"Wiley","doi":"10.1002/anie.202117738","day":"16"},{"article_type":"original","issue":"3","date_updated":"2022-09-05T08:19:38Z","volume":9,"abstract":[{"lang":"eng","text":"The study of the complexity of the constraint satisfaction problem (CSP), centred around the Feder-Vardi Dichotomy Conjecture, has been very prominent in the last two decades. After a long concerted effort and many partial results, the Dichotomy Conjecture has been proved in 2017 independently by Bulatov and Zhuk. At about the same time, a vast generalisation of CSP, called promise CSP, has started to gain prominence. In this survey, we explain the importance of promise CSP and highlight many new very interesting features that the study of promise CSP has brought to light. The complexity classification quest for the promise CSP is wide open, and we argue that, despite the promise CSP being more general, this quest is rather more accessible to a wide range of researchers than the dichotomy-led study of the CSP has been."}],"month":"07","oa_version":"Preprint","publication_identifier":{"issn":["2372-3491"]},"type":"journal_article","citation":{"ama":"Krokhin A, Opršal J. An invitation to the promise constraint satisfaction problem. <i>ACM SIGLOG News</i>. 2022;9(3):30-59. doi:<a href=\"https://doi.org/10.1145/3559736.3559740\">10.1145/3559736.3559740</a>","apa":"Krokhin, A., &#38; Opršal, J. (2022). An invitation to the promise constraint satisfaction problem. <i>ACM SIGLOG News</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3559736.3559740\">https://doi.org/10.1145/3559736.3559740</a>","ista":"Krokhin A, Opršal J. 2022. An invitation to the promise constraint satisfaction problem. ACM SIGLOG News. 9(3), 30–59.","short":"A. Krokhin, J. Opršal, ACM SIGLOG News 9 (2022) 30–59.","mla":"Krokhin, Andrei, and Jakub Opršal. “An Invitation to the Promise Constraint Satisfaction Problem.” <i>ACM SIGLOG News</i>, vol. 9, no. 3, Association for Computing Machinery, 2022, pp. 30–59, doi:<a href=\"https://doi.org/10.1145/3559736.3559740\">10.1145/3559736.3559740</a>.","chicago":"Krokhin, Andrei, and Jakub Opršal. “An Invitation to the Promise Constraint Satisfaction Problem.” <i>ACM SIGLOG News</i>. Association for Computing Machinery, 2022. <a href=\"https://doi.org/10.1145/3559736.3559740\">https://doi.org/10.1145/3559736.3559740</a>.","ieee":"A. Krokhin and J. Opršal, “An invitation to the promise constraint satisfaction problem,” <i>ACM SIGLOG News</i>, vol. 9, no. 3. Association for Computing Machinery, pp. 30–59, 2022."},"article_processing_charge":"No","status":"public","_id":"11991","page":"30-59","publication_status":"published","quality_controlled":"1","publication":"ACM SIGLOG News","title":"An invitation to the promise constraint satisfaction problem","author":[{"first_name":"Andrei","last_name":"Krokhin","full_name":"Krokhin, Andrei"},{"orcid":"0000-0003-1245-3456","last_name":"Opršal","full_name":"Opršal, Jakub","id":"ec596741-c539-11ec-b829-c79322a91242","first_name":"Jakub"}],"date_published":"2022-07-01T00:00:00Z","doi":"10.1145/3559736.3559740","arxiv":1,"publisher":"Association for Computing Machinery","day":"01","intvolume":"         9","department":[{"_id":"UlWa"}],"year":"2022","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/2208.13538"}],"date_created":"2022-08-27T11:23:37Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"external_id":{"arxiv":["2208.13538"]},"language":[{"iso":"eng"}]},{"date_published":"2022-09-01T00:00:00Z","author":[{"first_name":"Thomas","last_name":"Alderighi","full_name":"Alderighi, Thomas"},{"full_name":"Malomo, Luigi","last_name":"Malomo","first_name":"Luigi"},{"full_name":"Auzinger, Thomas","orcid":"0000-0002-1546-3265","last_name":"Auzinger","first_name":"Thomas","id":"4718F954-F248-11E8-B48F-1D18A9856A87"},{"id":"49876194-F248-11E8-B48F-1D18A9856A87","first_name":"Bernd","last_name":"Bickel","orcid":"0000-0001-6511-9385","full_name":"Bickel, Bernd"},{"last_name":"Cignoni","full_name":"Cignoni, Paulo","first_name":"Paulo"},{"full_name":"Pietroni, Nico","last_name":"Pietroni","first_name":"Nico"}],"title":"State of the art in computational mould design","quality_controlled":"1","publication":"Computer Graphics Forum","file":[{"description":"This is the pre-peer reviewed version of the following article: Alderighi, T., Malomo, L., Auzinger, T., Bickel, B., Cignoni, P. and Pietroni, N. (2022), State of the Art in Computational Mould Design. Computer Graphics Forum, which has been published in final form at https://doi.org/10.1111/cgf.14581. This article may be used for non-commercial purposes in accordance with Wiley Terms and Conditions for Use of Self-Archived Versions.","date_updated":"2022-08-28T18:18:08Z","relation":"main_file","checksum":"c40cc8ceb7b7f0512172b883d712198e","creator":"bbickel","access_level":"open_access","content_type":"application/pdf","file_name":"star_molding_preprint.pdf","file_id":"11994","date_created":"2022-08-28T18:18:08Z","file_size":32480850,"title":"pre-peer reviewed version"}],"publication_status":"published","page":"435-452","status":"public","_id":"11993","type":"journal_article","publication_identifier":{"issn":["0167-7055"],"eissn":["1467-8659"]},"article_processing_charge":"No","citation":{"apa":"Alderighi, T., Malomo, L., Auzinger, T., Bickel, B., Cignoni, P., &#38; Pietroni, N. (2022). State of the art in computational mould design. <i>Computer Graphics Forum</i>. Wiley. <a href=\"https://doi.org/10.1111/cgf.14581\">https://doi.org/10.1111/cgf.14581</a>","ama":"Alderighi T, Malomo L, Auzinger T, Bickel B, Cignoni P, Pietroni N. State of the art in computational mould design. <i>Computer Graphics Forum</i>. 2022;41(6):435-452. doi:<a href=\"https://doi.org/10.1111/cgf.14581\">10.1111/cgf.14581</a>","mla":"Alderighi, Thomas, et al. “State of the Art in Computational Mould Design.” <i>Computer Graphics Forum</i>, vol. 41, no. 6, Wiley, 2022, pp. 435–52, doi:<a href=\"https://doi.org/10.1111/cgf.14581\">10.1111/cgf.14581</a>.","ieee":"T. Alderighi, L. Malomo, T. Auzinger, B. Bickel, P. Cignoni, and N. Pietroni, “State of the art in computational mould design,” <i>Computer Graphics Forum</i>, vol. 41, no. 6. Wiley, pp. 435–452, 2022.","chicago":"Alderighi, Thomas, Luigi Malomo, Thomas Auzinger, Bernd Bickel, Paulo Cignoni, and Nico Pietroni. “State of the Art in Computational Mould Design.” <i>Computer Graphics Forum</i>. Wiley, 2022. <a href=\"https://doi.org/10.1111/cgf.14581\">https://doi.org/10.1111/cgf.14581</a>.","ista":"Alderighi T, Malomo L, Auzinger T, Bickel B, Cignoni P, Pietroni N. 2022. State of the art in computational mould design. Computer Graphics Forum. 41(6), 435–452.","short":"T. Alderighi, L. Malomo, T. Auzinger, B. Bickel, P. Cignoni, N. Pietroni, Computer Graphics Forum 41 (2022) 435–452."},"has_accepted_license":"1","oa_version":"Submitted Version","isi":1,"article_type":"original","keyword":["Computer Graphics and Computer-Aided Design"],"month":"09","volume":41,"abstract":[{"text":"Moulding refers to a set of manufacturing techniques in which a mould, usually a cavity or a solid frame, is used to shape a liquid or pliable material into an object of the desired shape. The popularity of moulding comes from its effectiveness, scalability and versatility in terms of employed materials. Its relevance as a fabrication process is demonstrated by the extensive literature covering different aspects related to mould design, from material flow simulation to the automation of mould geometry design. In this state-of-the-art report, we provide an extensive review of the automatic methods for the design of moulds, focusing on contributions from a geometric perspective. We classify existing mould design methods based on their computational approach and the nature of their target moulding process. We summarize the relationships between computational approaches and moulding techniques, highlighting their strengths and limitations. Finally, we discuss potential future research directions.","lang":"eng"}],"issue":"6","date_updated":"2024-10-09T21:03:21Z","language":[{"iso":"eng"}],"external_id":{"isi":["000842638900001"]},"corr_author":"1","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","date_created":"2022-08-28T18:17:01Z","oa":1,"file_date_updated":"2022-08-28T18:18:08Z","year":"2022","intvolume":"        41","department":[{"_id":"BeBi"}],"day":"01","doi":"10.1111/cgf.14581","publisher":"Wiley","ddc":["000"],"scopus_import":"1"}]