--- _id: '11674' abstract: - lang: eng text: In this paper, we study the problem of opening centers to cluster a set of clients in a metric space so as to minimize the sum of the costs of the centers and of the cluster radii, in a dynamic environment where clients arrive and depart, and the solution must be updated efficiently while remaining competitive with respect to the current optimal solution. We call this dynamic sum-of-radii clustering problem. We present a data structure that maintains a solution whose cost is within a constant factor of the cost of an optimal solution in metric spaces with bounded doubling dimension and whose worst-case update time is logarithmic in the parameters of the problem. article_processing_charge: No article_type: original author: - first_name: Monika H full_name: Henzinger, Monika H id: 540c9bbd-f2de-11ec-812d-d04a5be85630 last_name: Henzinger orcid: 0000-0002-5008-6530 - first_name: Dariusz full_name: Leniowski, Dariusz last_name: Leniowski - first_name: Claire full_name: Mathieu, Claire last_name: Mathieu citation: ama: Henzinger MH, Leniowski D, Mathieu C. Dynamic clustering to minimize the sum of radii. Algorithmica. 2020;82(11):3183-3194. doi:10.1007/s00453-020-00721-7 apa: Henzinger, M. H., Leniowski, D., & Mathieu, C. (2020). Dynamic clustering to minimize the sum of radii. Algorithmica. Springer Nature. https://doi.org/10.1007/s00453-020-00721-7 chicago: Henzinger, Monika H, Dariusz Leniowski, and Claire Mathieu. “Dynamic Clustering to Minimize the Sum of Radii.” Algorithmica. Springer Nature, 2020. https://doi.org/10.1007/s00453-020-00721-7. ieee: M. H. Henzinger, D. Leniowski, and C. Mathieu, “Dynamic clustering to minimize the sum of radii,” Algorithmica, vol. 82, no. 11. Springer Nature, pp. 3183–3194, 2020. ista: Henzinger MH, Leniowski D, Mathieu C. 2020. Dynamic clustering to minimize the sum of radii. Algorithmica. 82(11), 3183–3194. mla: Henzinger, Monika H., et al. “Dynamic Clustering to Minimize the Sum of Radii.” Algorithmica, vol. 82, no. 11, Springer Nature, 2020, pp. 3183–94, doi:10.1007/s00453-020-00721-7. short: M.H. Henzinger, D. Leniowski, C. Mathieu, Algorithmica 82 (2020) 3183–3194. date_created: 2022-07-27T13:58:58Z date_published: 2020-11-01T00:00:00Z date_updated: 2022-09-12T08:50:14Z day: '01' doi: 10.1007/s00453-020-00721-7 extern: '1' external_id: arxiv: - '1707.02577' intvolume: ' 82' issue: '11' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.48550/arXiv.1707.02577 month: '11' oa: 1 oa_version: Preprint page: 3183-3194 publication: Algorithmica publication_identifier: eissn: - 1432-0541 issn: - 0178-4617 publication_status: published publisher: Springer Nature quality_controlled: '1' scopus_import: '1' status: public title: Dynamic clustering to minimize the sum of radii type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 82 year: '2020' ... --- _id: '11818' abstract: - lang: eng text: "With input sizes becoming massive, coresets - small yet representative summary of the input - are relevant more than ever. A weighted set C_w that is a subset of the input is an ε-coreset if the cost of any feasible solution S with respect to C_w is within [1±ε] of the cost of S with respect to the original input. We give a very general technique to compute coresets in the fully-dynamic setting where input points can be added or deleted. Given a static (i.e., not dynamic) ε-coreset-construction algorithm that runs in time t(n, ε, λ) and computes a coreset of size s(n, ε, λ), where n is the number of input points and 1-λ is the success probability, we give a fully-dynamic algorithm that computes an ε-coreset with worst-case update time O((log n) ⋅ t(s(n, ε/log n, λ/n), ε/log n, λ/n)) (this bound is stated informally), where the success probability is 1-λ. Our technique is a fully-dynamic analog of the merge-and-reduce technique, which is due to Har-Peled and Mazumdar [Har-Peled and Mazumdar, 2004] and is based on a technique of Bentley and Saxe [Jon Louis Bentley and James B. Saxe, 1980], that applies to the insertion-only setting where points can only be added. Although, our space usage is O(n), our technique works in the presence of an adaptive adversary, and we show that Ω(n) space is required when adversary is adaptive.\r\nAs a concrete implication of our technique, using the result of Braverman et al. [{Braverman} et al., 2016], we get fully-dynamic ε-coreset-construction algorithms for k-median and k-means with worst-case update time O(ε^{-2} k² log⁵ n log³ k) and coreset size O(ε^{-2} k log n log² k) ignoring log log n and log(1/ε) factors and assuming that ε = Ω(1/poly(n)) and λ = Ω(1/poly(n)) (which are very weak assumptions made only to make these bounds easy to parse). This results in the first fully-dynamic constant-approximation algorithms for k-median and k-means with update times O(poly(k, log n, ε^{-1})). Specifically, the dependence on k is only quadratic, and the bounds are worst-case. The best previous bound for both problems was amortized O(nlog n) by Cohen-Addad et al. [Cohen-Addad et al., 2019] via randomized O(1)-coresets in O(n) space.\r\nWe also show that under the OMv conjecture [Monika Henzinger et al., 2015], a fully-dynamic (4 - δ)-approximation algorithm for k-means must either have an amortized update time of Ω(k^{1-γ}) or amortized query time of Ω(k^{2 - γ}), where γ > 0 is a constant." alternative_title: - LIPIcs article_number: '57' article_processing_charge: No author: - first_name: Monika H full_name: Henzinger, Monika H id: 540c9bbd-f2de-11ec-812d-d04a5be85630 last_name: Henzinger orcid: 0000-0002-5008-6530 - first_name: Sagar full_name: Kale, Sagar last_name: Kale citation: ama: 'Henzinger MH, Kale S. Fully-dynamic coresets. In: 28th Annual European Symposium on Algorithms. Vol 173. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.ESA.2020.57' apa: 'Henzinger, M. H., & Kale, S. (2020). Fully-dynamic coresets. In 28th Annual European Symposium on Algorithms (Vol. 173). Pisa, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ESA.2020.57' chicago: Henzinger, Monika H, and Sagar Kale. “Fully-Dynamic Coresets.” In 28th Annual European Symposium on Algorithms, Vol. 173. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.ESA.2020.57. ieee: M. H. Henzinger and S. Kale, “Fully-dynamic coresets,” in 28th Annual European Symposium on Algorithms, Pisa, Italy, 2020, vol. 173. ista: 'Henzinger MH, Kale S. 2020. Fully-dynamic coresets. 28th Annual European Symposium on Algorithms. ESA: Annual European Symposium on Algorithms, LIPIcs, vol. 173, 57.' mla: Henzinger, Monika H., and Sagar Kale. “Fully-Dynamic Coresets.” 28th Annual European Symposium on Algorithms, vol. 173, 57, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.ESA.2020.57. short: M.H. Henzinger, S. Kale, in:, 28th Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. conference: end_date: 2020-09-09 location: Pisa, Italy name: 'ESA: Annual European Symposium on Algorithms' start_date: 2020-09-07 date_created: 2022-08-12T07:22:55Z date_published: 2020-08-26T00:00:00Z date_updated: 2023-02-14T09:29:51Z day: '26' doi: 10.4230/LIPIcs.ESA.2020.57 extern: '1' external_id: arxiv: - '2004.14891' intvolume: ' 173' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.4230/LIPIcs.ESA.2020.57 month: '08' oa: 1 oa_version: Published Version publication: 28th Annual European Symposium on Algorithms publication_identifier: isbn: - '9783959771627' issn: - 1868-8969 publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik quality_controlled: '1' scopus_import: '1' status: public title: Fully-dynamic coresets type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 173 year: '2020' ... --- _id: '11816' abstract: - lang: eng text: In recent years, significant advances have been made in the design and analysis of fully dynamic maximal matching algorithms. However, these theoretical results have received very little attention from the practical perspective. Few of the algorithms are implemented and tested on real datasets, and their practical potential is far from understood. In this paper, we attempt to bridge the gap between theory and practice that is currently observed for the fully dynamic maximal matching problem. We engineer several algorithms and empirically study those algorithms on an extensive set of dynamic instances. alternative_title: - LIPIcs article_number: '58' article_processing_charge: No author: - first_name: Monika H full_name: Henzinger, Monika H id: 540c9bbd-f2de-11ec-812d-d04a5be85630 last_name: Henzinger orcid: 0000-0002-5008-6530 - first_name: Khan full_name: Shahbaz, Khan last_name: Shahbaz - first_name: Richard full_name: Paul, Richard last_name: Paul - first_name: Christian full_name: Schulz, Christian last_name: Schulz citation: ama: 'Henzinger MH, Shahbaz K, Paul R, Schulz C. Dynamic matching algorithms in practice. In: 8th Annual European Symposium on Algorithms. Vol 173. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.ESA.2020.58' apa: 'Henzinger, M. H., Shahbaz, K., Paul, R., & Schulz, C. (2020). Dynamic matching algorithms in practice. In 8th Annual European Symposium on Algorithms (Vol. 173). Pisa, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ESA.2020.58' chicago: Henzinger, Monika H, Khan Shahbaz, Richard Paul, and Christian Schulz. “Dynamic Matching Algorithms in Practice.” In 8th Annual European Symposium on Algorithms, Vol. 173. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.ESA.2020.58. ieee: M. H. Henzinger, K. Shahbaz, R. Paul, and C. Schulz, “Dynamic matching algorithms in practice,” in 8th Annual European Symposium on Algorithms, Pisa, Italy, 2020, vol. 173. ista: 'Henzinger MH, Shahbaz K, Paul R, Schulz C. 2020. Dynamic matching algorithms in practice. 8th Annual European Symposium on Algorithms. ESA: Annual European Symposium on Algorithms, LIPIcs, vol. 173, 58.' mla: Henzinger, Monika H., et al. “Dynamic Matching Algorithms in Practice.” 8th Annual European Symposium on Algorithms, vol. 173, 58, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.ESA.2020.58. short: M.H. Henzinger, K. Shahbaz, R. Paul, C. Schulz, in:, 8th Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. conference: end_date: 2020-09-09 location: Pisa, Italy name: 'ESA: Annual European Symposium on Algorithms' start_date: 2020-09-07 date_created: 2022-08-12T07:13:25Z date_published: 2020-08-26T00:00:00Z date_updated: 2023-02-14T08:57:55Z day: '26' doi: 10.4230/LIPIcs.ESA.2020.58 extern: '1' external_id: arxiv: - '2004.09099' intvolume: ' 173' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.4230/LIPIcs.ESA.2020.58 month: '08' oa: 1 oa_version: Published Version publication: 8th Annual European Symposium on Algorithms publication_identifier: isbn: - '9783959771627' issn: - 1868-8969 publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik quality_controlled: '1' scopus_import: '1' status: public title: Dynamic matching algorithms in practice type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 173 year: '2020' ... --- _id: '11824' abstract: - lang: eng text: "Independent set is a fundamental problem in combinatorial optimization. While in general graphs the problem is essentially inapproximable, for many important graph classes there are approximation algorithms known in the offline setting. These graph classes include interval graphs and geometric intersection graphs, where vertices correspond to intervals/geometric objects and an edge indicates that the two corresponding objects intersect.\r\nWe present dynamic approximation algorithms for independent set of intervals, hypercubes and hyperrectangles in d dimensions. They work in the fully dynamic model where each update inserts or deletes a geometric object. All our algorithms are deterministic and have worst-case update times that are polylogarithmic for constant d and ε>0, assuming that the coordinates of all input objects are in [0, N]^d and each of their edges has length at least 1. We obtain the following results:\r\n- For weighted intervals, we maintain a (1+ε)-approximate solution.\r\n- For d-dimensional hypercubes we maintain a (1+ε)2^d-approximate solution in the unweighted case and a O(2^d)-approximate solution in the weighted case. Also, we show that for maintaining an unweighted (1+ε)-approximate solution one needs polynomial update time for d ≥ 2 if the ETH holds.\r\n- For weighted d-dimensional hyperrectangles we present a dynamic algorithm with approximation ratio (1+ε)log^{d-1}N." alternative_title: - LIPIcs article_number: '51' article_processing_charge: No author: - first_name: Monika H full_name: Henzinger, Monika H id: 540c9bbd-f2de-11ec-812d-d04a5be85630 last_name: Henzinger orcid: 0000-0002-5008-6530 - first_name: Stefan full_name: Neumann, Stefan last_name: Neumann - first_name: Andreas full_name: Wiese, Andreas last_name: Wiese citation: ama: 'Henzinger MH, Neumann S, Wiese A. Dynamic approximate maximum independent set of intervals, hypercubes and hyperrectangles. In: 36th International Symposium on Computational Geometry. Vol 164. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.SoCG.2020.51' apa: 'Henzinger, M. H., Neumann, S., & Wiese, A. (2020). Dynamic approximate maximum independent set of intervals, hypercubes and hyperrectangles. In 36th International Symposium on Computational Geometry (Vol. 164). Zurich, Switzerland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2020.51' chicago: Henzinger, Monika H, Stefan Neumann, and Andreas Wiese. “Dynamic Approximate Maximum Independent Set of Intervals, Hypercubes and Hyperrectangles.” In 36th International Symposium on Computational Geometry, Vol. 164. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.SoCG.2020.51. ieee: M. H. Henzinger, S. Neumann, and A. Wiese, “Dynamic approximate maximum independent set of intervals, hypercubes and hyperrectangles,” in 36th International Symposium on Computational Geometry, Zurich, Switzerland, 2020, vol. 164. ista: 'Henzinger MH, Neumann S, Wiese A. 2020. Dynamic approximate maximum independent set of intervals, hypercubes and hyperrectangles. 36th International Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 164, 51.' mla: Henzinger, Monika H., et al. “Dynamic Approximate Maximum Independent Set of Intervals, Hypercubes and Hyperrectangles.” 36th International Symposium on Computational Geometry, vol. 164, 51, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.SoCG.2020.51. short: M.H. Henzinger, S. Neumann, A. Wiese, in:, 36th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. conference: end_date: 2020-06-26 location: Zurich, Switzerland name: 'SoCG: Symposium on Computational Geometry' start_date: 2020-06-23 date_created: 2022-08-12T07:46:44Z date_published: 2020-06-08T00:00:00Z date_updated: 2023-02-14T10:00:58Z day: '08' doi: 10.4230/LIPIcs.SoCG.2020.51 extern: '1' external_id: arxiv: - '2003.02605' intvolume: ' 164' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.4230/LIPIcs.SoCG.2020.51 month: '06' oa: 1 oa_version: Published Version publication: 36th International Symposium on Computational Geometry publication_identifier: isbn: - '9783959771436' issn: - 1868-8969 publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik quality_controlled: '1' scopus_import: '1' status: public title: Dynamic approximate maximum independent set of intervals, hypercubes and hyperrectangles type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 164 year: '2020' ... --- _id: '11822' abstract: - lang: eng text: "The fully dynamic transitive closure problem asks to maintain reachability information in a directed graph between arbitrary pairs of vertices, while the graph undergoes a sequence of edge insertions and deletions. The problem has been thoroughly investigated in theory and many specialized algorithms for solving it have been proposed in the last decades. In two large studies [Frigioni ea, 2001; Krommidas and Zaroliagis, 2008], a number of these algorithms have been evaluated experimentally against simple, static algorithms for graph traversal, showing the competitiveness and even superiority of the simple algorithms in practice, except for very dense random graphs or very high ratios of queries. A major drawback of those studies is that only small and mostly randomly generated graphs are considered.\r\nIn this paper, we engineer new algorithms to maintain all-pairs reachability information which are simple and space-efficient. Moreover, we perform an extensive experimental evaluation on both generated and real-world instances that are several orders of magnitude larger than those in the previous studies. Our results indicate that our new algorithms outperform all state-of-the-art algorithms on all types of input considerably in practice." alternative_title: - LIPIcs article_number: '14' article_processing_charge: No author: - first_name: Kathrin full_name: Hanauer, Kathrin last_name: Hanauer - first_name: Monika H full_name: Henzinger, Monika H id: 540c9bbd-f2de-11ec-812d-d04a5be85630 last_name: Henzinger orcid: 0000-0002-5008-6530 - first_name: Christian full_name: Schulz, Christian last_name: Schulz citation: ama: 'Hanauer K, Henzinger MH, Schulz C. Faster fully dynamic transitive closure in practice. In: 18th International Symposium on Experimental Algorithms. Vol 160. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.SEA.2020.14' apa: 'Hanauer, K., Henzinger, M. H., & Schulz, C. (2020). Faster fully dynamic transitive closure in practice. In 18th International Symposium on Experimental Algorithms (Vol. 160). Pisa, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SEA.2020.14' chicago: Hanauer, Kathrin, Monika H Henzinger, and Christian Schulz. “Faster Fully Dynamic Transitive Closure in Practice.” In 18th International Symposium on Experimental Algorithms, Vol. 160. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.SEA.2020.14. ieee: K. Hanauer, M. H. Henzinger, and C. Schulz, “Faster fully dynamic transitive closure in practice,” in 18th International Symposium on Experimental Algorithms, Pisa, Italy, 2020, vol. 160. ista: 'Hanauer K, Henzinger MH, Schulz C. 2020. Faster fully dynamic transitive closure in practice. 18th International Symposium on Experimental Algorithms. SEA: Symposium on Experimental Algorithms, LIPIcs, vol. 160, 14.' mla: Hanauer, Kathrin, et al. “Faster Fully Dynamic Transitive Closure in Practice.” 18th International Symposium on Experimental Algorithms, vol. 160, 14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.SEA.2020.14. short: K. Hanauer, M.H. Henzinger, C. Schulz, in:, 18th International Symposium on Experimental Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. conference: end_date: 2020-09-09 location: Pisa, Italy name: 'SEA: Symposium on Experimental Algorithms' start_date: 2020-09-07 date_created: 2022-08-12T07:32:53Z date_published: 2020-06-12T00:00:00Z date_updated: 2023-02-14T09:58:42Z day: '12' doi: 10.4230/LIPIcs.SEA.2020.14 extern: '1' external_id: arxiv: - '2002.00813' intvolume: ' 160' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.4230/LIPIcs.SEA.2020.14 month: '06' oa: 1 oa_version: Published Version publication: 18th International Symposium on Experimental Algorithms publication_identifier: isbn: - '9783959771481' issn: - 1868-8969 publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik quality_controlled: '1' scopus_import: '1' status: public title: Faster fully dynamic transitive closure in practice type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 160 year: '2020' ... --- _id: '11825' abstract: - lang: eng text: We give a fully dynamic (Las-Vegas style) algorithm with constant expected amortized time per update that maintains a proper (Δ+1)-vertex coloring of a graph with maximum degree at most Δ. This improves upon the previous O(log Δ)-time algorithm by Bhattacharya et al. (SODA 2018). Our algorithm uses an approach based on assigning random ranks to vertices and does not need to maintain a hierarchical graph decomposition. We show that our result does not only have optimal running time, but is also optimal in the sense that already deciding whether a Δ-coloring exists in a dynamically changing graph with maximum degree at most Δ takes Ω(log n) time per operation. alternative_title: - LIPIcs article_number: '53' article_processing_charge: No author: - first_name: Monika H full_name: Henzinger, Monika H id: 540c9bbd-f2de-11ec-812d-d04a5be85630 last_name: Henzinger orcid: 0000-0002-5008-6530 - first_name: Pan full_name: Peng, Pan last_name: Peng citation: ama: 'Henzinger MH, Peng P. Constant-time dynamic (Δ+1)-coloring. In: 37th International Symposium on Theoretical Aspects of Computer Science. Vol 154. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.STACS.2020.53' apa: 'Henzinger, M. H., & Peng, P. (2020). Constant-time dynamic (Δ+1)-coloring. In 37th International Symposium on Theoretical Aspects of Computer Science (Vol. 154). Montpellier, France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.STACS.2020.53' chicago: Henzinger, Monika H, and Pan Peng. “Constant-Time Dynamic (Δ+1)-Coloring.” In 37th International Symposium on Theoretical Aspects of Computer Science, Vol. 154. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.STACS.2020.53. ieee: M. H. Henzinger and P. Peng, “Constant-time dynamic (Δ+1)-coloring,” in 37th International Symposium on Theoretical Aspects of Computer Science, Montpellier, France, 2020, vol. 154. ista: 'Henzinger MH, Peng P. 2020. Constant-time dynamic (Δ+1)-coloring. 37th International Symposium on Theoretical Aspects of Computer Science. STACS: Symposium on Theoretical Aspects of Computer Science, LIPIcs, vol. 154, 53.' mla: Henzinger, Monika H., and Pan Peng. “Constant-Time Dynamic (Δ+1)-Coloring.” 37th International Symposium on Theoretical Aspects of Computer Science, vol. 154, 53, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.STACS.2020.53. short: M.H. Henzinger, P. Peng, in:, 37th International Symposium on Theoretical Aspects of Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. conference: end_date: 2020-03-13 location: Montpellier, France name: 'STACS: Symposium on Theoretical Aspects of Computer Science' start_date: 2020-03-10 date_created: 2022-08-12T07:53:05Z date_published: 2020-03-04T00:00:00Z date_updated: 2023-02-14T10:03:43Z day: '04' doi: 10.4230/LIPIcs.STACS.2020.53 extern: '1' external_id: arxiv: - '1907.04745' intvolume: ' 154' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.4230/LIPIcs.STACS.2020.53 month: '03' oa: 1 oa_version: Published Version publication: 37th International Symposium on Theoretical Aspects of Computer Science publication_identifier: isbn: - '9783959771405' issn: - 1868-8969 publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik quality_controlled: '1' scopus_import: '1' status: public title: Constant-time dynamic (Δ+1)-coloring type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 154 year: '2020' ... --- _id: '11819' abstract: - lang: eng text: We present a practically efficient algorithm that finds all global minimum cuts in huge undirected graphs. Our algorithm uses a multitude of kernelization rules to reduce the graph to a small equivalent instance and then finds all minimum cuts using an optimized version of the algorithm of Nagamochi, Nakao and Ibaraki. In shared memory we are able to find all minimum cuts of graphs with up to billions of edges and millions of minimum cuts in a few minutes. We also give a new linear time algorithm to find the most balanced minimum cuts given as input the representation of all minimum cuts. alternative_title: - LIPIcs article_number: '59' article_processing_charge: No author: - first_name: Monika H full_name: Henzinger, Monika H id: 540c9bbd-f2de-11ec-812d-d04a5be85630 last_name: Henzinger orcid: 0000-0002-5008-6530 - first_name: Alexander full_name: Noe, Alexander last_name: Noe - first_name: Christian full_name: Schulz, Christian last_name: Schulz - first_name: Darren full_name: Strash, Darren last_name: Strash citation: ama: 'Henzinger MH, Noe A, Schulz C, Strash D. Finding all global minimum cuts in practice. In: 28th Annual European Symposium on Algorithms. Vol 173. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.ESA.2020.59' apa: 'Henzinger, M. H., Noe, A., Schulz, C., & Strash, D. (2020). Finding all global minimum cuts in practice. In 28th Annual European Symposium on Algorithms (Vol. 173). Pisa, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ESA.2020.59' chicago: Henzinger, Monika H, Alexander Noe, Christian Schulz, and Darren Strash. “Finding All Global Minimum Cuts in Practice.” In 28th Annual European Symposium on Algorithms, Vol. 173. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.ESA.2020.59. ieee: M. H. Henzinger, A. Noe, C. Schulz, and D. Strash, “Finding all global minimum cuts in practice,” in 28th Annual European Symposium on Algorithms, Pisa, Italy, 2020, vol. 173. ista: 'Henzinger MH, Noe A, Schulz C, Strash D. 2020. Finding all global minimum cuts in practice. 28th Annual European Symposium on Algorithms. ESA: Annual European Symposium on Algorithms, LIPIcs, vol. 173, 59.' mla: Henzinger, Monika H., et al. “Finding All Global Minimum Cuts in Practice.” 28th Annual European Symposium on Algorithms, vol. 173, 59, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.ESA.2020.59. short: M.H. Henzinger, A. Noe, C. Schulz, D. Strash, in:, 28th Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. conference: end_date: 2020-09-09 location: Pisa, Italy name: 'ESA: Annual European Symposium on Algorithms' start_date: 2020-09-07 date_created: 2022-08-12T07:27:42Z date_published: 2020-08-26T00:00:00Z date_updated: 2023-02-14T09:39:18Z day: '26' doi: 10.4230/LIPIcs.ESA.2020.59 extern: '1' external_id: arxiv: - '2002.06948' intvolume: ' 173' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.4230/LIPIcs.ESA.2020.59 month: '08' oa: 1 oa_version: Published Version publication: 28th Annual European Symposium on Algorithms publication_identifier: isbn: - '9783959771627' issn: - 1868-8969 publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik quality_controlled: '1' scopus_import: '1' status: public title: Finding all global minimum cuts in practice type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 173 year: '2020' ... --- _id: '11852' abstract: - lang: eng text: We present a general framework of designing efficient dynamic approximate algorithms for optimization problems on undirected graphs. In particular, we develop a technique that, given any problem that admits a certain notion of vertex sparsifiers, gives data structures that maintain approximate solutions in sub-linear update and query time. We illustrate the applicability of our paradigm to the following problems. (1)A fully-dynamic algorithm that approximates all-pair maximum-flows/minimum-cuts up to a nearly logarithmic factor in O~(n2/3) 11The O~(⋅) notation is used in this paper to hide poly-logarithmic factors. amortized time against an oblivious adversary, and O~(m3/4) time against an adaptive adversary. (2)An incremental data structure that maintains O(1) - approximate shortest path in no(1) time per operation, as well as fully dynamic approximate all-pair shortest path and transshipment in O~(n2/3+o(1)) amortized time per operation. (3)A fully-dynamic algorithm that approximates all-pair effective resistance up to an (1+ϵ) factor in O~(n2/3+o(1)ϵ−O(1)) amortized update time per operation. The key tool behind result (1) is the dynamic maintenance of an algorithmic construction due to Madry [FOCS' 10], which partitions a graph into a collection of simpler graph structures (known as j-trees) and approximately captures the cut-flow and metric structure of the graph. The O(1)-approximation guarantee of (2) is by adapting the distance oracles by [Thorup-Zwick JACM '05]. Result (3) is obtained by invoking the random-walk based spectral vertex sparsifier by [Durfee et al. STOC '19] in a hierarchical manner, while carefully keeping track of the recourse among levels in the hierarchy. See https://arxiv.org/pdf/2005.02368.pdf for the full version of this paper. article_processing_charge: No author: - first_name: Li full_name: Chen, Li last_name: Chen - first_name: Gramoz full_name: Goranci, Gramoz last_name: Goranci - first_name: Monika H full_name: Henzinger, Monika H id: 540c9bbd-f2de-11ec-812d-d04a5be85630 last_name: Henzinger orcid: 0000-0002-5008-6530 - first_name: Richard full_name: Peng, Richard last_name: Peng - first_name: Thatchaphol full_name: Saranurak, Thatchaphol last_name: Saranurak citation: ama: 'Chen L, Goranci G, Henzinger MH, Peng R, Saranurak T. Fast dynamic cuts, distances and effective resistances via vertex sparsifiers. In: 61st Annual Symposium on Foundations of Computer Science. Institute of Electrical and Electronics Engineers; 2020:1135-1146. doi:10.1109/focs46700.2020.00109' apa: 'Chen, L., Goranci, G., Henzinger, M. H., Peng, R., & Saranurak, T. (2020). Fast dynamic cuts, distances and effective resistances via vertex sparsifiers. In 61st Annual Symposium on Foundations of Computer Science (pp. 1135–1146). Durham, NC, United States: Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/focs46700.2020.00109' chicago: Chen, Li, Gramoz Goranci, Monika H Henzinger, Richard Peng, and Thatchaphol Saranurak. “Fast Dynamic Cuts, Distances and Effective Resistances via Vertex Sparsifiers.” In 61st Annual Symposium on Foundations of Computer Science, 1135–46. Institute of Electrical and Electronics Engineers, 2020. https://doi.org/10.1109/focs46700.2020.00109. ieee: L. Chen, G. Goranci, M. H. Henzinger, R. Peng, and T. Saranurak, “Fast dynamic cuts, distances and effective resistances via vertex sparsifiers,” in 61st Annual Symposium on Foundations of Computer Science, Durham, NC, United States, 2020, pp. 1135–1146. ista: 'Chen L, Goranci G, Henzinger MH, Peng R, Saranurak T. 2020. Fast dynamic cuts, distances and effective resistances via vertex sparsifiers. 61st Annual Symposium on Foundations of Computer Science. FOCS: Annual Symposium on Foundations of Computer Science, 1135–1146.' mla: Chen, Li, et al. “Fast Dynamic Cuts, Distances and Effective Resistances via Vertex Sparsifiers.” 61st Annual Symposium on Foundations of Computer Science, Institute of Electrical and Electronics Engineers, 2020, pp. 1135–46, doi:10.1109/focs46700.2020.00109. short: L. Chen, G. Goranci, M.H. Henzinger, R. Peng, T. Saranurak, in:, 61st Annual Symposium on Foundations of Computer Science, Institute of Electrical and Electronics Engineers, 2020, pp. 1135–1146. conference: end_date: 2020-11-19 location: Durham, NC, United States name: 'FOCS: Annual Symposium on Foundations of Computer Science' start_date: 2020-11-16 date_created: 2022-08-16T07:33:12Z date_published: 2020-11-01T00:00:00Z date_updated: 2023-02-17T09:47:36Z day: '01' doi: 10.1109/focs46700.2020.00109 extern: '1' external_id: arxiv: - '2005.02368' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/2005.02368 month: '11' oa: 1 oa_version: Preprint page: 1135-1146 publication: 61st Annual Symposium on Foundations of Computer Science publication_identifier: eisbn: - 978-1-7281-9621-3 eissn: - 2575-8454 isbn: - 978-1-7281-9622-0 publication_status: published publisher: Institute of Electrical and Electronics Engineers quality_controlled: '1' scopus_import: '1' status: public title: Fast dynamic cuts, distances and effective resistances via vertex sparsifiers type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2020' ... --- _id: '11880' abstract: - lang: eng text: "Given a directed graph and a source vertex, the fully dynamic single-source reachability problem is to maintain the set of vertices that are reachable from the given vertex, subject to edge deletions and insertions. It is one of the most fundamental problems on graphs and appears directly or indirectly in many and varied applications. While there has been theoretical work on this problem, showing both linear conditional lower bounds for the fully dynamic problem and insertions-only and deletions-only upper bounds beating these conditional lower bounds, there has been no experimental study that compares the performance of fully dynamic reachability algorithms in practice. Previous experimental studies in this area concentrated only on the more general all-pairs reachability or transitive closure problem and did not use real-world dynamic graphs.\r\n\r\nIn this paper, we bridge this gap by empirically studying an extensive set of algorithms for the single-source reachability problem in the fully dynamic setting. In particular, we design several fully dynamic variants of well-known approaches to obtain and maintain reachability information with respect to a distinguished source. Moreover, we extend the existing insertions-only or deletions-only upper bounds into fully dynamic algorithms. Even though the worst-case time per operation of all the fully dynamic algorithms we evaluate is at least linear in the number of edges in the graph (as is to be expected given the conditional lower bounds) we show in our extensive experimental evaluation that their performance differs greatly, both on generated as well as on real-world instances." article_processing_charge: No author: - first_name: Kathrin full_name: Hanauer, Kathrin last_name: Hanauer - first_name: Monika H full_name: Henzinger, Monika H id: 540c9bbd-f2de-11ec-812d-d04a5be85630 last_name: Henzinger orcid: 0000-0002-5008-6530 - first_name: Christian full_name: Schulz, Christian last_name: Schulz citation: ama: 'Hanauer K, Henzinger MH, Schulz C. Fully dynamic single-source reachability in practice: An experimental study. In: 2020 Symposium on Algorithm Engineering and Experiments. Society for Industrial and Applied Mathematics; 2020:106-119. doi:10.1137/1.9781611976007.9' apa: 'Hanauer, K., Henzinger, M. H., & Schulz, C. (2020). Fully dynamic single-source reachability in practice: An experimental study. In 2020 Symposium on Algorithm Engineering and Experiments (pp. 106–119). Salt Lake City, UT, United States: Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611976007.9' chicago: 'Hanauer, Kathrin, Monika H Henzinger, and Christian Schulz. “Fully Dynamic Single-Source Reachability in Practice: An Experimental Study.” In 2020 Symposium on Algorithm Engineering and Experiments, 106–19. Society for Industrial and Applied Mathematics, 2020. https://doi.org/10.1137/1.9781611976007.9.' ieee: 'K. Hanauer, M. H. Henzinger, and C. Schulz, “Fully dynamic single-source reachability in practice: An experimental study,” in 2020 Symposium on Algorithm Engineering and Experiments, Salt Lake City, UT, United States, 2020, pp. 106–119.' ista: 'Hanauer K, Henzinger MH, Schulz C. 2020. Fully dynamic single-source reachability in practice: An experimental study. 2020 Symposium on Algorithm Engineering and Experiments. ALENEX: Symposium on Algorithm Engineering and Experiments, 106–119.' mla: 'Hanauer, Kathrin, et al. “Fully Dynamic Single-Source Reachability in Practice: An Experimental Study.” 2020 Symposium on Algorithm Engineering and Experiments, Society for Industrial and Applied Mathematics, 2020, pp. 106–19, doi:10.1137/1.9781611976007.9.' short: K. Hanauer, M.H. Henzinger, C. Schulz, in:, 2020 Symposium on Algorithm Engineering and Experiments, Society for Industrial and Applied Mathematics, 2020, pp. 106–119. conference: end_date: 2020-01-06 location: Salt Lake City, UT, United States name: 'ALENEX: Symposium on Algorithm Engineering and Experiments' start_date: 2020-01-05 date_created: 2022-08-17T06:39:32Z date_published: 2020-01-01T00:00:00Z date_updated: 2023-02-17T14:00:37Z day: '01' doi: 10.1137/1.9781611976007.9 extern: '1' external_id: arxiv: - '1905.01216' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1905.01216 month: '01' oa: 1 oa_version: Preprint page: 106-119 publication: 2020 Symposium on Algorithm Engineering and Experiments publication_identifier: eisbn: - 978-1-61197-600-7 publication_status: published publisher: Society for Industrial and Applied Mathematics quality_controlled: '1' scopus_import: '1' status: public title: 'Fully dynamic single-source reachability in practice: An experimental study' type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2020' ... --- _id: '11881' abstract: - lang: eng text: We introduce the fastest known exact algorithm for the multiterminal cut problem with k terminals. In particular, we engineer existing as well as new data reduction rules. We use the rules within a branch-and-reduce framework and to boost the performance of an ILP formulation. Our algorithms achieve improvements in running time of up to multiple orders of magnitudes over the ILP formulation without data reductions, which has been the de facto standard used by practitioners. This allows us to solve instances to optimality that are significantly larger than was previously possible. article_processing_charge: No author: - first_name: Monika H full_name: Henzinger, Monika H id: 540c9bbd-f2de-11ec-812d-d04a5be85630 last_name: Henzinger orcid: 0000-0002-5008-6530 - first_name: Alexander full_name: Noe, Alexander last_name: Noe - first_name: Christian full_name: Schulz, Christian last_name: Schulz citation: ama: 'Henzinger MH, Noe A, Schulz C. Shared-memory branch-and-reduce for multiterminal cuts. In: 2020 Symposium on Algorithm Engineering and Experiments. Society for Industrial and Applied Mathematics; 2020:42-55. doi:10.1137/1.9781611976007.4' apa: 'Henzinger, M. H., Noe, A., & Schulz, C. (2020). Shared-memory branch-and-reduce for multiterminal cuts. In 2020 Symposium on Algorithm Engineering and Experiments (pp. 42–55). Salt Lake City, UT, United States: Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611976007.4' chicago: Henzinger, Monika H, Alexander Noe, and Christian Schulz. “Shared-Memory Branch-and-Reduce for Multiterminal Cuts.” In 2020 Symposium on Algorithm Engineering and Experiments, 42–55. Society for Industrial and Applied Mathematics, 2020. https://doi.org/10.1137/1.9781611976007.4. ieee: M. H. Henzinger, A. Noe, and C. Schulz, “Shared-memory branch-and-reduce for multiterminal cuts,” in 2020 Symposium on Algorithm Engineering and Experiments, Salt Lake City, UT, United States, 2020, pp. 42–55. ista: 'Henzinger MH, Noe A, Schulz C. 2020. Shared-memory branch-and-reduce for multiterminal cuts. 2020 Symposium on Algorithm Engineering and Experiments. ALENEX: Symposium on Algorithm Engineering and Experiments, 42–55.' mla: Henzinger, Monika H., et al. “Shared-Memory Branch-and-Reduce for Multiterminal Cuts.” 2020 Symposium on Algorithm Engineering and Experiments, Society for Industrial and Applied Mathematics, 2020, pp. 42–55, doi:10.1137/1.9781611976007.4. short: M.H. Henzinger, A. Noe, C. Schulz, in:, 2020 Symposium on Algorithm Engineering and Experiments, Society for Industrial and Applied Mathematics, 2020, pp. 42–55. conference: end_date: 2020-01-06 location: Salt Lake City, UT, United States name: 'ALENEX: Symposium on Algorithm Engineering and Experiments' start_date: 2020-01-05 date_created: 2022-08-17T06:47:40Z date_published: 2020-01-01T00:00:00Z date_updated: 2023-02-17T14:02:04Z day: '01' doi: 10.1137/1.9781611976007.4 extern: '1' external_id: arxiv: - '1908.04141' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1908.04141 month: '01' oa: 1 oa_version: Preprint page: 42-55 publication: 2020 Symposium on Algorithm Engineering and Experiments publication_identifier: eisbn: - 978-1-61197-600-7 publication_status: published publisher: Society for Industrial and Applied Mathematics quality_controlled: '1' scopus_import: '1' status: public title: Shared-memory branch-and-reduce for multiterminal cuts type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2020' ... --- _id: '11894' abstract: - lang: eng text: "Graph sparsification aims at compressing large graphs into smaller ones while preserving important characteristics of the input graph. In this work we study vertex sparsifiers, i.e., sparsifiers whose goal is to reduce the number of vertices. We focus on the following notions: (1) Given a digraph \U0001D43A=(\U0001D449,\U0001D438) and terminal vertices \U0001D43E⊂\U0001D449 with |\U0001D43E|=\U0001D458, a (vertex) reachability sparsifier of \U0001D43A is a digraph \U0001D43B=(\U0001D449\U0001D43B,\U0001D438\U0001D43B), \U0001D43E⊂\U0001D449\U0001D43B that preserves all reachability information among terminal pairs. Let |\U0001D449\U0001D43B| denote the size of \U0001D43B. In this work we introduce the notion of reachability-preserving minors (RPMs), i.e., we require \U0001D43B to be a minor of \U0001D43A. We show any directed graph \U0001D43A admits an RPM \U0001D43B of size \U0001D442(\U0001D4583), and if \U0001D43A is planar, then the size of \U0001D43B improves to \U0001D442(\U0001D4582log\U0001D458). We complement our upper bound by showing that there exists an infinite family of grids such that any RPM must have Ω(\U0001D4582) vertices. (2) Given a weighted undirected graph \U0001D43A=(\U0001D449,\U0001D438) and terminal vertices \U0001D43E with |\U0001D43E|=\U0001D458, an exact (vertex) cut sparsifier of \U0001D43A is a graph \U0001D43B with \U0001D43E⊂\U0001D449\U0001D43B that preserves the value of minimum cuts separating any bipartition of \U0001D43E. We show that planar graphs with all the \U0001D458 terminals lying on the same face admit exact cut sparsifiers of size \U0001D442(\U0001D4582) that are also planar. Our result extends to flow and distance sparsifiers. It improves the previous best-known bound of \U0001D442(\U0001D458222\U0001D458) for cut and flow sparsifiers by an exponential factor and matches an Ω(\U0001D4582) lower-bound for this class of graphs." article_processing_charge: No article_type: original author: - first_name: Gramoz full_name: Goranci, Gramoz last_name: Goranci - first_name: Monika H full_name: Henzinger, Monika H id: 540c9bbd-f2de-11ec-812d-d04a5be85630 last_name: Henzinger orcid: 0000-0002-5008-6530 - first_name: Pan full_name: Peng, Pan last_name: Peng citation: ama: Goranci G, Henzinger MH, Peng P. Improved guarantees for vertex sparsification in planar graphs. SIAM Journal on Discrete Mathematics. 2020;34(1):130-162. doi:10.1137/17m1163153 apa: Goranci, G., Henzinger, M. H., & Peng, P. (2020). Improved guarantees for vertex sparsification in planar graphs. SIAM Journal on Discrete Mathematics. Society for Industrial & Applied Mathematics. https://doi.org/10.1137/17m1163153 chicago: Goranci, Gramoz, Monika H Henzinger, and Pan Peng. “Improved Guarantees for Vertex Sparsification in Planar Graphs.” SIAM Journal on Discrete Mathematics. Society for Industrial & Applied Mathematics, 2020. https://doi.org/10.1137/17m1163153. ieee: G. Goranci, M. H. Henzinger, and P. Peng, “Improved guarantees for vertex sparsification in planar graphs,” SIAM Journal on Discrete Mathematics, vol. 34, no. 1. Society for Industrial & Applied Mathematics, pp. 130–162, 2020. ista: Goranci G, Henzinger MH, Peng P. 2020. Improved guarantees for vertex sparsification in planar graphs. SIAM Journal on Discrete Mathematics. 34(1), 130–162. mla: Goranci, Gramoz, et al. “Improved Guarantees for Vertex Sparsification in Planar Graphs.” SIAM Journal on Discrete Mathematics, vol. 34, no. 1, Society for Industrial & Applied Mathematics, 2020, pp. 130–62, doi:10.1137/17m1163153. short: G. Goranci, M.H. Henzinger, P. Peng, SIAM Journal on Discrete Mathematics 34 (2020) 130–162. date_created: 2022-08-17T08:50:24Z date_published: 2020-01-01T00:00:00Z date_updated: 2023-02-21T16:29:44Z day: '01' doi: 10.1137/17m1163153 extern: '1' external_id: arxiv: - '1702.01136' intvolume: ' 34' issue: '1' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1702.01136 month: '01' oa: 1 oa_version: Preprint page: 130-162 publication: SIAM Journal on Discrete Mathematics publication_identifier: eissn: - 1095-7146 issn: - 0895-4801 publication_status: published publisher: Society for Industrial & Applied Mathematics quality_controlled: '1' related_material: record: - id: '11831' relation: earlier_version status: public scopus_import: '1' status: public title: Improved guarantees for vertex sparsification in planar graphs type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 34 year: '2020' ... --- _id: '11954' abstract: - lang: eng text: The combination of nickel and photocatalysis has unlocked a variety of cross-couplings. These protocols rely on a few photocatalysts that can only convert a small portion of visible light (<500 nm) into chemical energy. The high-energy photons that excite the photocatalyst can result in unwanted side reactions. Dyes that absorb a much broader spectrum of light are not applicable because of their short-lived singlet excited states. Here, we describe a self-assembling catalyst system that overcomes this limitation. Immobilization of a nickel catalyst on dye-sensitized titanium dioxide results in a material that catalyzes carbon–heteroatom and carbon–carbon bond formations. The modular approach of dye-sensitized metallaphotocatalysts accesses the entire visible light spectrum and allows tackling selectivity issues resulting from low wavelengths strategically. The concept overcomes current limitations of metallaphotocatalysis by unlocking the potential of dyes that were previously unsuitable. article_processing_charge: No article_type: original author: - first_name: Susanne full_name: Reischauer, Susanne last_name: Reischauer - first_name: Volker full_name: Strauss, Volker last_name: Strauss - first_name: Bartholomäus full_name: Pieber, Bartholomäus id: 93e5e5b2-0da6-11ed-8a41-af589a024726 last_name: Pieber orcid: 0000-0001-8689-388X citation: ama: Reischauer S, Strauss V, Pieber B. Modular, self-assembling metallaphotocatalyst for cross-couplings using the full visible-light spectrum. ACS Catalysis. 2020;10(22):13269–13274. doi:10.1021/acscatal.0c03950 apa: Reischauer, S., Strauss, V., & Pieber, B. (2020). Modular, self-assembling metallaphotocatalyst for cross-couplings using the full visible-light spectrum. ACS Catalysis. American Chemical Society. https://doi.org/10.1021/acscatal.0c03950 chicago: Reischauer, Susanne, Volker Strauss, and Bartholomäus Pieber. “Modular, Self-Assembling Metallaphotocatalyst for Cross-Couplings Using the Full Visible-Light Spectrum.” ACS Catalysis. American Chemical Society, 2020. https://doi.org/10.1021/acscatal.0c03950. ieee: S. Reischauer, V. Strauss, and B. Pieber, “Modular, self-assembling metallaphotocatalyst for cross-couplings using the full visible-light spectrum,” ACS Catalysis, vol. 10, no. 22. American Chemical Society, pp. 13269–13274, 2020. ista: Reischauer S, Strauss V, Pieber B. 2020. Modular, self-assembling metallaphotocatalyst for cross-couplings using the full visible-light spectrum. ACS Catalysis. 10(22), 13269–13274. mla: Reischauer, Susanne, et al. “Modular, Self-Assembling Metallaphotocatalyst for Cross-Couplings Using the Full Visible-Light Spectrum.” ACS Catalysis, vol. 10, no. 22, American Chemical Society, 2020, pp. 13269–13274, doi:10.1021/acscatal.0c03950. short: S. Reischauer, V. Strauss, B. Pieber, ACS Catalysis 10 (2020) 13269–13274. date_created: 2022-08-24T10:40:46Z date_published: 2020-11-02T00:00:00Z date_updated: 2023-02-21T10:09:09Z day: '02' doi: 10.1021/acscatal.0c03950 extern: '1' intvolume: ' 10' issue: '22' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.26434/chemrxiv.12444908 month: '11' oa: 1 oa_version: Preprint page: 13269–13274 publication: ACS Catalysis publication_identifier: eissn: - 2155-5435 publication_status: published publisher: American Chemical Society quality_controlled: '1' scopus_import: '1' status: public title: Modular, self-assembling metallaphotocatalyst for cross-couplings using the full visible-light spectrum type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 10 year: '2020' ... --- _id: '11969' abstract: - lang: eng text: Photochemistry enables new synthetic means to form carbon–heteroatom bonds. Photocatalysts can catalyze carbon–heteroatom cross-couplings by electron or energy transfer either alone or in combination with a second catalyst. Photocatalyst-free methods are possible using photolabile substrates or by generating photoactive electron donor-acceptor complexes. This review summarizes and discusses the strategies used in light-mediated carbon–heteroatom bond formations based on the proposed mechanisms. article_processing_charge: No article_type: review author: - first_name: Cristian full_name: Cavedon, Cristian last_name: Cavedon - first_name: Peter H. full_name: Seeberger, Peter H. last_name: Seeberger - first_name: Bartholomäus full_name: Pieber, Bartholomäus id: 93e5e5b2-0da6-11ed-8a41-af589a024726 last_name: Pieber orcid: 0000-0001-8689-388X citation: ama: Cavedon C, Seeberger PH, Pieber B. Photochemical strategies for carbon–heteroatom bond formation. European Journal of Organic Chemistry. 2020;2020(10):1379-1392. doi:10.1002/ejoc.201901173 apa: Cavedon, C., Seeberger, P. H., & Pieber, B. (2020). Photochemical strategies for carbon–heteroatom bond formation. European Journal of Organic Chemistry. Wiley. https://doi.org/10.1002/ejoc.201901173 chicago: Cavedon, Cristian, Peter H. Seeberger, and Bartholomäus Pieber. “Photochemical Strategies for Carbon–Heteroatom Bond Formation.” European Journal of Organic Chemistry. Wiley, 2020. https://doi.org/10.1002/ejoc.201901173. ieee: C. Cavedon, P. H. Seeberger, and B. Pieber, “Photochemical strategies for carbon–heteroatom bond formation,” European Journal of Organic Chemistry, vol. 2020, no. 10. Wiley, pp. 1379–1392, 2020. ista: Cavedon C, Seeberger PH, Pieber B. 2020. Photochemical strategies for carbon–heteroatom bond formation. European Journal of Organic Chemistry. 2020(10), 1379–1392. mla: Cavedon, Cristian, et al. “Photochemical Strategies for Carbon–Heteroatom Bond Formation.” European Journal of Organic Chemistry, vol. 2020, no. 10, Wiley, 2020, pp. 1379–92, doi:10.1002/ejoc.201901173. short: C. Cavedon, P.H. Seeberger, B. Pieber, European Journal of Organic Chemistry 2020 (2020) 1379–1392. date_created: 2022-08-25T08:49:25Z date_published: 2020-03-15T00:00:00Z date_updated: 2023-02-21T10:09:47Z day: '15' doi: 10.1002/ejoc.201901173 extern: '1' intvolume: ' 2020' issue: '10' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.1002/ejoc.201901173 month: '03' oa: 1 oa_version: Published Version page: 1379-1392 publication: European Journal of Organic Chemistry publication_identifier: eissn: - 1099-0690 issn: - 1434-193X publication_status: published publisher: Wiley quality_controlled: '1' scopus_import: '1' status: public title: Photochemical strategies for carbon–heteroatom bond formation type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 2020 year: '2020' ... --- _id: '11978' abstract: - lang: eng text: Dual photocatalysis and nickel catalysis can effect cross-coupling under mild conditions, but little is known about the in situ kinetics of this class of reactions. We report a comprehensive kinetic examination of a model carboxylate O-arylation, comparing a state-of-the-art homogeneous photocatalyst (Ir(ppy)3) with a competitive heterogeneous photocatalyst (graphitic carbon nitride). Experimental conditions were adjusted such that the nickel catalytic cycle is saturated with excited photocatalyst. This approach was designed to remove the role of the photocatalyst, by which only the intrinsic behaviors of the nickel catalytic cycles are observed. The two reactions did not display identical kinetics. Ir(ppy)3 deactivates the nickel catalytic cycle and creates more dehalogenated side product. Kinetic data for the reaction using Ir(ppy)3 supports a turnover-limiting reductive elimination. Graphitic carbon nitride gave higher selectivity, even at high photocatalyst-to-nickel ratios. The heterogeneous reaction also showed a rate dependence on aryl halide, indicating that oxidative addition plays a role in rate determination. The results argue against the current mechanistic hypothesis, which states that the photocatalyst is only involved to trigger reductive elimination. article_processing_charge: No article_type: original author: - first_name: Jamal A. full_name: Malik, Jamal A. last_name: Malik - first_name: Amiera full_name: Madani, Amiera last_name: Madani - first_name: Bartholomäus full_name: Pieber, Bartholomäus id: 93e5e5b2-0da6-11ed-8a41-af589a024726 last_name: Pieber orcid: 0000-0001-8689-388X - first_name: Peter H. full_name: Seeberger, Peter H. last_name: Seeberger citation: ama: Malik JA, Madani A, Pieber B, Seeberger PH. Evidence for photocatalyst involvement in oxidative additions of nickel-catalyzed carboxylate O-arylations. Journal of the American Chemical Society. 2020;142(25):11042-11049. doi:10.1021/jacs.0c02848 apa: Malik, J. A., Madani, A., Pieber, B., & Seeberger, P. H. (2020). Evidence for photocatalyst involvement in oxidative additions of nickel-catalyzed carboxylate O-arylations. Journal of the American Chemical Society. American Chemical Society. https://doi.org/10.1021/jacs.0c02848 chicago: Malik, Jamal A., Amiera Madani, Bartholomäus Pieber, and Peter H. Seeberger. “Evidence for Photocatalyst Involvement in Oxidative Additions of Nickel-Catalyzed Carboxylate O-Arylations.” Journal of the American Chemical Society. American Chemical Society, 2020. https://doi.org/10.1021/jacs.0c02848. ieee: J. A. Malik, A. Madani, B. Pieber, and P. H. Seeberger, “Evidence for photocatalyst involvement in oxidative additions of nickel-catalyzed carboxylate O-arylations,” Journal of the American Chemical Society, vol. 142, no. 25. American Chemical Society, pp. 11042–11049, 2020. ista: Malik JA, Madani A, Pieber B, Seeberger PH. 2020. Evidence for photocatalyst involvement in oxidative additions of nickel-catalyzed carboxylate O-arylations. Journal of the American Chemical Society. 142(25), 11042–11049. mla: Malik, Jamal A., et al. “Evidence for Photocatalyst Involvement in Oxidative Additions of Nickel-Catalyzed Carboxylate O-Arylations.” Journal of the American Chemical Society, vol. 142, no. 25, American Chemical Society, 2020, pp. 11042–49, doi:10.1021/jacs.0c02848. short: J.A. Malik, A. Madani, B. Pieber, P.H. Seeberger, Journal of the American Chemical Society 142 (2020) 11042–11049. date_created: 2022-08-25T10:57:38Z date_published: 2020-06-24T00:00:00Z date_updated: 2023-02-21T10:10:06Z day: '24' doi: 10.1021/jacs.0c02848 extern: '1' external_id: pmid: - '32469219' intvolume: ' 142' issue: '25' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.1021/jacs.0c02848 month: '06' oa: 1 oa_version: Published Version page: 11042-11049 pmid: 1 publication: Journal of the American Chemical Society publication_identifier: eissn: - 1520-5126 issn: - 0002-7863 publication_status: published publisher: American Chemical Society quality_controlled: '1' scopus_import: '1' status: public title: Evidence for photocatalyst involvement in oxidative additions of nickel-catalyzed carboxylate O-arylations type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 142 year: '2020' ... --- _id: '11980' abstract: - lang: eng text: Small organic radicals are ubiquitous intermediates in photocatalysis and are used in organic synthesis to install functional groups and to tune electronic properties and pharmacokinetic parameters of the final molecule. Development of new methods to generate small organic radicals with added functionality can further extend the utility of photocatalysis for synthetic needs. Herein, we present a method to generate dichloromethyl radicals from chloroform using a heterogeneous potassium poly(heptazine imide) (K-PHI) photocatalyst under visible light irradiation for C1-extension of the enone backbone. The method is applied on 15 enones, with γ,γ-dichloroketones yields of 18–89%. Due to negative zeta-potential (−40 mV) and small particle size (100 nm) K-PHI suspension is used in quasi-homogeneous flow-photoreactor increasing the productivity by 19 times compared to the batch approach. The resulting γ,γ-dichloroketones, are used as bifunctional building blocks to access value-added organic compounds such as substituted furans and pyrroles. article_number: '1387' article_processing_charge: No article_type: original author: - first_name: Stefano full_name: Mazzanti, Stefano last_name: Mazzanti - first_name: Bogdan full_name: Kurpil, Bogdan last_name: Kurpil - first_name: Bartholomäus full_name: Pieber, Bartholomäus id: 93e5e5b2-0da6-11ed-8a41-af589a024726 last_name: Pieber orcid: 0000-0001-8689-388X - first_name: Markus full_name: Antonietti, Markus last_name: Antonietti - first_name: Aleksandr full_name: Savateev, Aleksandr last_name: Savateev citation: ama: Mazzanti S, Kurpil B, Pieber B, Antonietti M, Savateev A. Dichloromethylation of enones by carbon nitride photocatalysis. Nature Communications. 2020;11. doi:10.1038/s41467-020-15131-0 apa: Mazzanti, S., Kurpil, B., Pieber, B., Antonietti, M., & Savateev, A. (2020). Dichloromethylation of enones by carbon nitride photocatalysis. Nature Communications. Springer Nature. https://doi.org/10.1038/s41467-020-15131-0 chicago: Mazzanti, Stefano, Bogdan Kurpil, Bartholomäus Pieber, Markus Antonietti, and Aleksandr Savateev. “Dichloromethylation of Enones by Carbon Nitride Photocatalysis.” Nature Communications. Springer Nature, 2020. https://doi.org/10.1038/s41467-020-15131-0. ieee: S. Mazzanti, B. Kurpil, B. Pieber, M. Antonietti, and A. Savateev, “Dichloromethylation of enones by carbon nitride photocatalysis,” Nature Communications, vol. 11. Springer Nature, 2020. ista: Mazzanti S, Kurpil B, Pieber B, Antonietti M, Savateev A. 2020. Dichloromethylation of enones by carbon nitride photocatalysis. Nature Communications. 11, 1387. mla: Mazzanti, Stefano, et al. “Dichloromethylation of Enones by Carbon Nitride Photocatalysis.” Nature Communications, vol. 11, 1387, Springer Nature, 2020, doi:10.1038/s41467-020-15131-0. short: S. Mazzanti, B. Kurpil, B. Pieber, M. Antonietti, A. Savateev, Nature Communications 11 (2020). date_created: 2022-08-25T11:10:15Z date_published: 2020-03-13T00:00:00Z date_updated: 2023-02-21T10:10:14Z day: '13' doi: 10.1038/s41467-020-15131-0 extern: '1' intvolume: ' 11' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.1038/s41467-020-15131-0 month: '03' oa: 1 oa_version: Published Version publication: Nature Communications publication_identifier: eissn: - 2041-1723 publication_status: published publisher: Springer Nature quality_controlled: '1' scopus_import: '1' status: public title: Dichloromethylation of enones by carbon nitride photocatalysis type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 11 year: '2020' ... --- _id: '11979' abstract: - lang: eng text: Dual photoredox/nickel-catalysed C–N cross-couplings suffer from low yields for electron-rich aryl halides. The formation of catalytically inactive nickel-black is responsible for this limitation and causes severe reproducibility issues. Here, we demonstrate that catalyst deactivation can be avoided by using a carbon nitride photocatalyst. The broad absorption of the heterogeneous photocatalyst enables wavelength-dependent control of the rate of reductive elimination to prevent nickel-black formation during the coupling of cyclic, secondary amines and aryl halides. A second approach, which is applicable to a broader set of electron-rich aryl halides, is to run the reactions at high concentrations to increase the rate of oxidative addition. Less nucleophilic, primary amines can be coupled with electron-rich aryl halides by stabilizing low-valent nickel intermediates with a suitable additive. The developed protocols enable reproducible, selective C–N cross-couplings of electron-rich aryl bromides and can also be applied for electron-poor aryl chlorides. article_processing_charge: No article_type: original author: - first_name: Sebastian full_name: Gisbertz, Sebastian last_name: Gisbertz - first_name: Susanne full_name: Reischauer, Susanne last_name: Reischauer - first_name: Bartholomäus full_name: Pieber, Bartholomäus id: 93e5e5b2-0da6-11ed-8a41-af589a024726 last_name: Pieber orcid: 0000-0001-8689-388X citation: ama: Gisbertz S, Reischauer S, Pieber B. Overcoming limitations in dual photoredox/nickel-catalysed C–N cross-couplings due to catalyst deactivation. Nature Catalysis. 2020;3(8):611-620. doi:10.1038/s41929-020-0473-6 apa: Gisbertz, S., Reischauer, S., & Pieber, B. (2020). Overcoming limitations in dual photoredox/nickel-catalysed C–N cross-couplings due to catalyst deactivation. Nature Catalysis. Springer Nature. https://doi.org/10.1038/s41929-020-0473-6 chicago: Gisbertz, Sebastian, Susanne Reischauer, and Bartholomäus Pieber. “Overcoming Limitations in Dual Photoredox/Nickel-Catalysed C–N Cross-Couplings Due to Catalyst Deactivation.” Nature Catalysis. Springer Nature, 2020. https://doi.org/10.1038/s41929-020-0473-6. ieee: S. Gisbertz, S. Reischauer, and B. Pieber, “Overcoming limitations in dual photoredox/nickel-catalysed C–N cross-couplings due to catalyst deactivation,” Nature Catalysis, vol. 3, no. 8. Springer Nature, pp. 611–620, 2020. ista: Gisbertz S, Reischauer S, Pieber B. 2020. Overcoming limitations in dual photoredox/nickel-catalysed C–N cross-couplings due to catalyst deactivation. Nature Catalysis. 3(8), 611–620. mla: Gisbertz, Sebastian, et al. “Overcoming Limitations in Dual Photoredox/Nickel-Catalysed C–N Cross-Couplings Due to Catalyst Deactivation.” Nature Catalysis, vol. 3, no. 8, Springer Nature, 2020, pp. 611–20, doi:10.1038/s41929-020-0473-6. short: S. Gisbertz, S. Reischauer, B. Pieber, Nature Catalysis 3 (2020) 611–620. date_created: 2022-08-25T11:06:16Z date_published: 2020-08-01T00:00:00Z date_updated: 2023-02-21T10:10:09Z day: '01' doi: 10.1038/s41929-020-0473-6 extern: '1' intvolume: ' 3' issue: '8' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.26434/chemrxiv.10298735 month: '08' oa: 1 oa_version: Preprint page: 611-620 publication: Nature Catalysis publication_identifier: eissn: - 2520-1158 publication_status: published publisher: Springer Nature quality_controlled: '1' scopus_import: '1' status: public title: Overcoming limitations in dual photoredox/nickel-catalysed C–N cross-couplings due to catalyst deactivation type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 3 year: '2020' ... --- _id: '11986' abstract: - lang: eng text: Carbon nitride materials have emerged as an efficient and sustainable class of heterogeneous photocatalysts, particularly when paired with nickel in dual catalytic cross-coupling reactions. Performing these transformations on larger scales using a continuous process is difficult due to the problems associated with handling solids in flow. By combining an oscillatory pump with a microstructured plug flow photoreactor, a stable suspension of the photocatalyst can be maintained, circumventing clogging of the reactor channels. Through careful tuning of the oscillator properties, the residence time distribution (RTD) was optimized, whilst maintaining a stable catalyst suspension. Short residence times (20 min) were achieved using optimized conditions and the recyclability of the photocatalyst was demonstrated over 10 cycles with no loss of activity. During a stable 4.5 hour scale-out demonstration, the model substrate could be isolated on 12 g scale (90% yield, 2.67 g h−1). Moreover, the method was applied for the gram scale synthesis of an intermediate of the active pharmaceutical ingredient tetracaine. article_processing_charge: No article_type: original author: - first_name: Cristian full_name: Rosso, Cristian last_name: Rosso - first_name: Sebastian full_name: Gisbertz, Sebastian last_name: Gisbertz - first_name: Jason D. full_name: Williams, Jason D. last_name: Williams - first_name: Hannes P. L. full_name: Gemoets, Hannes P. L. last_name: Gemoets - first_name: Wouter full_name: Debrouwer, Wouter last_name: Debrouwer - first_name: Bartholomäus full_name: Pieber, Bartholomäus id: 93e5e5b2-0da6-11ed-8a41-af589a024726 last_name: Pieber orcid: 0000-0001-8689-388X - first_name: C. Oliver full_name: Kappe, C. Oliver last_name: Kappe citation: ama: Rosso C, Gisbertz S, Williams JD, et al. An oscillatory plug flow photoreactor facilitates semi-heterogeneous dual nickel/carbon nitride photocatalytic C–N couplings. Reaction Chemistry and Engineering. 2020;5(3):597-604. doi:10.1039/d0re00036a apa: Rosso, C., Gisbertz, S., Williams, J. D., Gemoets, H. P. L., Debrouwer, W., Pieber, B., & Kappe, C. O. (2020). An oscillatory plug flow photoreactor facilitates semi-heterogeneous dual nickel/carbon nitride photocatalytic C–N couplings. Reaction Chemistry and Engineering. Royal Society of Chemistry. https://doi.org/10.1039/d0re00036a chicago: Rosso, Cristian, Sebastian Gisbertz, Jason D. Williams, Hannes P. L. Gemoets, Wouter Debrouwer, Bartholomäus Pieber, and C. Oliver Kappe. “An Oscillatory Plug Flow Photoreactor Facilitates Semi-Heterogeneous Dual Nickel/Carbon Nitride Photocatalytic C–N Couplings.” Reaction Chemistry and Engineering. Royal Society of Chemistry, 2020. https://doi.org/10.1039/d0re00036a. ieee: C. Rosso et al., “An oscillatory plug flow photoreactor facilitates semi-heterogeneous dual nickel/carbon nitride photocatalytic C–N couplings,” Reaction Chemistry and Engineering, vol. 5, no. 3. Royal Society of Chemistry, pp. 597–604, 2020. ista: Rosso C, Gisbertz S, Williams JD, Gemoets HPL, Debrouwer W, Pieber B, Kappe CO. 2020. An oscillatory plug flow photoreactor facilitates semi-heterogeneous dual nickel/carbon nitride photocatalytic C–N couplings. Reaction Chemistry and Engineering. 5(3), 597–604. mla: Rosso, Cristian, et al. “An Oscillatory Plug Flow Photoreactor Facilitates Semi-Heterogeneous Dual Nickel/Carbon Nitride Photocatalytic C–N Couplings.” Reaction Chemistry and Engineering, vol. 5, no. 3, Royal Society of Chemistry, 2020, pp. 597–604, doi:10.1039/d0re00036a. short: C. Rosso, S. Gisbertz, J.D. Williams, H.P.L. Gemoets, W. Debrouwer, B. Pieber, C.O. Kappe, Reaction Chemistry and Engineering 5 (2020) 597–604. date_created: 2022-08-25T11:45:02Z date_published: 2020-03-01T00:00:00Z date_updated: 2023-02-21T10:10:28Z day: '01' doi: 10.1039/d0re00036a extern: '1' intvolume: ' 5' issue: '3' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.1039/D0RE00036A month: '03' oa: 1 oa_version: Published Version page: 597-604 publication: Reaction Chemistry and Engineering publication_identifier: eissn: - 2058-9883 publication_status: published publisher: Royal Society of Chemistry quality_controlled: '1' scopus_import: '1' status: public title: An oscillatory plug flow photoreactor facilitates semi-heterogeneous dual nickel/carbon nitride photocatalytic C–N couplings type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 5 year: '2020' ... --- _id: '7084' abstract: - lang: eng text: The unusual correlated state that emerges in URu2Si2 below THO = 17.5 K is known as “hidden order” because even basic characteristics of the order parameter, such as its dimensionality (whether it has one component or two), are “hidden.” We use resonant ultrasound spectroscopy to measure the symmetry-resolved elastic anomalies across THO. We observe no anomalies in the shear elastic moduli, providing strong thermodynamic evidence for a one-component order parameter. We develop a machine learning framework that reaches this conclusion directly from the raw data, even in a crystal that is too small for traditional resonant ultrasound. Our result rules out a broad class of theories of hidden order based on two-component order parameters, and constrains the nature of the fluctuations from which unconventional superconductivity emerges at lower temperature. Our machine learning framework is a powerful new tool for classifying the ubiquitous competing orders in correlated electron systems. article_number: eaaz4074 article_processing_charge: No article_type: original author: - first_name: Sayak full_name: Ghosh, Sayak last_name: Ghosh - first_name: Michael full_name: Matty, Michael last_name: Matty - first_name: Ryan full_name: Baumbach, Ryan last_name: Baumbach - first_name: Eric D. full_name: Bauer, Eric D. last_name: Bauer - first_name: Kimberly A full_name: Modic, Kimberly A id: 13C26AC0-EB69-11E9-87C6-5F3BE6697425 last_name: Modic orcid: 0000-0001-9760-3147 - first_name: Arkady full_name: Shekhter, Arkady last_name: Shekhter - first_name: J. A. full_name: Mydosh, J. A. last_name: Mydosh - first_name: Eun-Ah full_name: Kim, Eun-Ah last_name: Kim - first_name: B. J. full_name: Ramshaw, B. J. last_name: Ramshaw citation: ama: Ghosh S, Matty M, Baumbach R, et al. One-component order parameter in URu2Si2 uncovered by resonant  ultrasound spectroscopy and machine learning. Science Advances. 2020;6(10). doi:10.1126/sciadv.aaz4074 apa: Ghosh, S., Matty, M., Baumbach, R., Bauer, E. D., Modic, K. A., Shekhter, A., … Ramshaw, B. J. (2020). One-component order parameter in URu2Si2 uncovered by resonant  ultrasound spectroscopy and machine learning. Science Advances. American Association for the Advancement of Science. https://doi.org/10.1126/sciadv.aaz4074 chicago: Ghosh, Sayak, Michael Matty, Ryan Baumbach, Eric D. Bauer, Kimberly A Modic, Arkady Shekhter, J. A. Mydosh, Eun-Ah Kim, and B. J. Ramshaw. “One-Component Order Parameter in URu2Si2 Uncovered by Resonant  Ultrasound Spectroscopy and Machine Learning.” Science Advances. American Association for the Advancement of Science, 2020. https://doi.org/10.1126/sciadv.aaz4074. ieee: S. Ghosh et al., “One-component order parameter in URu2Si2 uncovered by resonant  ultrasound spectroscopy and machine learning,” Science Advances, vol. 6, no. 10. American Association for the Advancement of Science, 2020. ista: Ghosh S, Matty M, Baumbach R, Bauer ED, Modic KA, Shekhter A, Mydosh JA, Kim E-A, Ramshaw BJ. 2020. One-component order parameter in URu2Si2 uncovered by resonant  ultrasound spectroscopy and machine learning. Science Advances. 6(10), eaaz4074. mla: Ghosh, Sayak, et al. “One-Component Order Parameter in URu2Si2 Uncovered by Resonant  Ultrasound Spectroscopy and Machine Learning.” Science Advances, vol. 6, no. 10, eaaz4074, American Association for the Advancement of Science, 2020, doi:10.1126/sciadv.aaz4074. short: S. Ghosh, M. Matty, R. Baumbach, E.D. Bauer, K.A. Modic, A. Shekhter, J.A. Mydosh, E.-A. Kim, B.J. Ramshaw, Science Advances 6 (2020). date_created: 2019-11-19T14:01:10Z date_published: 2020-03-06T00:00:00Z date_updated: 2022-08-25T15:08:41Z day: '06' doi: 10.1126/sciadv.aaz4074 extern: '1' external_id: arxiv: - '1903.00552' pmid: - '32181367' intvolume: ' 6' issue: '10' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1903.00552 month: '03' oa: 1 oa_version: Preprint pmid: 1 publication: Science Advances publication_status: published publisher: American Association for the Advancement of Science quality_controlled: '1' status: public title: One-component order parameter in URu2Si2 uncovered by resonant ultrasound spectroscopy and machine learning type: journal_article user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 6 year: '2020' ... --- _id: '7272' abstract: - lang: eng text: "Many systems rely on optimistic concurrent search trees for multi-core scalability. In principle, optimistic trees have a simple performance story: searches are read-only and so run in parallel, with writes to shared memory occurring only when modifying the data structure. However, this paper shows that in practice, obtaining the full performance benefits of optimistic search trees is not so simple.\r\n\r\nWe focus on optimistic binary search trees (BSTs) and perform a detailed performance analysis of 10 state-of-the-art BSTs on large scale x86-64 hardware, using both microbenchmarks and an in-memory database system. We find and explain significant unexpected performance differences between BSTs with similar tree structure and search implementations, which we trace to subtle performance-degrading interactions of BSTs with systems software and hardware subsystems. We further derive a prescriptive approach to avoid this performance degradation, as well as algorithmic insights on optimistic BST design. Our work underlines the gap between the theory and practice of multi-core performance, and calls for further research to help bridge this gap." article_processing_charge: No author: - first_name: Maya full_name: Arbel-Raviv, Maya last_name: Arbel-Raviv - first_name: Trevor A full_name: Brown, Trevor A id: 3569F0A0-F248-11E8-B48F-1D18A9856A87 last_name: Brown - first_name: Adam full_name: Morrison, Adam last_name: Morrison citation: ama: 'Arbel-Raviv M, Brown TA, Morrison A. Getting to the root of concurrent binary search tree performance. In: Proceedings of the 2018 USENIX Annual Technical Conference. USENIX Association; 2020:295-306.' apa: 'Arbel-Raviv, M., Brown, T. A., & Morrison, A. (2020). Getting to the root of concurrent binary search tree performance. In Proceedings of the 2018 USENIX Annual Technical Conference (pp. 295–306). Boston, MA, United States: USENIX Association.' chicago: Arbel-Raviv, Maya, Trevor A Brown, and Adam Morrison. “Getting to the Root of Concurrent Binary Search Tree Performance.” In Proceedings of the 2018 USENIX Annual Technical Conference, 295–306. USENIX Association, 2020. ieee: M. Arbel-Raviv, T. A. Brown, and A. Morrison, “Getting to the root of concurrent binary search tree performance,” in Proceedings of the 2018 USENIX Annual Technical Conference, Boston, MA, United States, 2020, pp. 295–306. ista: 'Arbel-Raviv M, Brown TA, Morrison A. 2020. Getting to the root of concurrent binary search tree performance. Proceedings of the 2018 USENIX Annual Technical Conference. USENIX: Annual Technical Conference, 295–306.' mla: Arbel-Raviv, Maya, et al. “Getting to the Root of Concurrent Binary Search Tree Performance.” Proceedings of the 2018 USENIX Annual Technical Conference, USENIX Association, 2020, pp. 295–306. short: M. Arbel-Raviv, T.A. Brown, A. Morrison, in:, Proceedings of the 2018 USENIX Annual Technical Conference, USENIX Association, 2020, pp. 295–306. conference: end_date: 2018-07-13 location: Boston, MA, United States name: 'USENIX: Annual Technical Conference' start_date: 2018-07-11 date_created: 2020-01-14T07:27:08Z date_published: 2020-01-01T00:00:00Z date_updated: 2021-01-11T15:25:48Z day: '01' ddc: - '000' department: - _id: DaAl language: - iso: eng main_file_link: - open_access: '1' url: https://www.usenix.org/system/files/conference/atc18/atc18-arbel-raviv.pdf month: '01' oa: 1 oa_version: Published Version page: 295-306 project: - _id: 26450934-B435-11E9-9278-68D0E5697425 name: NSERC Postdoctoral fellowship publication: Proceedings of the 2018 USENIX Annual Technical Conference publication_identifier: isbn: - '9781939133021' publication_status: published publisher: USENIX Association quality_controlled: '1' scopus_import: '1' status: public title: Getting to the root of concurrent binary search tree performance type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2020' ... --- _id: '7346' abstract: - lang: eng text: 'The Price of Anarchy (PoA) is a well-established game-theoretic concept to shed light on coordination issues arising in open distributed systems. Leaving agents to selfishly optimize comes with the risk of ending up in sub-optimal states (in terms of performance and/or costs), compared to a centralized system design. However, the PoA relies on strong assumptions about agents'' rationality (e.g., resources and information) and interactions, whereas in many distributed systems agents interact locally with bounded resources. They do so repeatedly over time (in contrast to "one-shot games"), and their strategies may evolve. Using a more realistic evolutionary game model, this paper introduces a realized evolutionary Price of Anarchy (ePoA). The ePoA allows an exploration of equilibrium selection in dynamic distributed systems with multiple equilibria, based on local interactions of simple memoryless agents. Considering a fundamental game related to virus propagation on networks, we present analytical bounds on the ePoA in basic network topologies and for different strategy update dynamics. In particular, deriving stationary distributions of the stochastic evolutionary process, we find that the Nash equilibria are not always the most abundant states, and that different processes can feature significant off-equilibrium behavior, leading to a significantly higher ePoA compared to the PoA studied traditionally in the literature. ' alternative_title: - LIPIcs article_number: '21' article_processing_charge: No author: - first_name: Laura full_name: Schmid, Laura id: 38B437DE-F248-11E8-B48F-1D18A9856A87 last_name: Schmid orcid: 0000-0002-6978-7329 - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Stefan full_name: Schmid, Stefan last_name: Schmid citation: ama: 'Schmid L, Chatterjee K, Schmid S. The evolutionary price of anarchy: Locally bounded agents in a dynamic virus game. In: Proceedings of the 23rd International Conference on Principles of Distributed Systems. Vol 153. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.OPODIS.2019.21' apa: 'Schmid, L., Chatterjee, K., & Schmid, S. (2020). The evolutionary price of anarchy: Locally bounded agents in a dynamic virus game. In Proceedings of the 23rd International Conference on Principles of Distributed Systems (Vol. 153). Neuchâtel, Switzerland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.OPODIS.2019.21' chicago: 'Schmid, Laura, Krishnendu Chatterjee, and Stefan Schmid. “The Evolutionary Price of Anarchy: Locally Bounded Agents in a Dynamic Virus Game.” In Proceedings of the 23rd International Conference on Principles of Distributed Systems, Vol. 153. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.OPODIS.2019.21.' ieee: 'L. Schmid, K. Chatterjee, and S. Schmid, “The evolutionary price of anarchy: Locally bounded agents in a dynamic virus game,” in Proceedings of the 23rd International Conference on Principles of Distributed Systems, Neuchâtel, Switzerland, 2020, vol. 153.' ista: 'Schmid L, Chatterjee K, Schmid S. 2020. The evolutionary price of anarchy: Locally bounded agents in a dynamic virus game. Proceedings of the 23rd International Conference on Principles of Distributed Systems. OPODIS: International Conference on Principles of Distributed Systems, LIPIcs, vol. 153, 21.' mla: 'Schmid, Laura, et al. “The Evolutionary Price of Anarchy: Locally Bounded Agents in a Dynamic Virus Game.” Proceedings of the 23rd International Conference on Principles of Distributed Systems, vol. 153, 21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.OPODIS.2019.21.' short: L. Schmid, K. Chatterjee, S. Schmid, in:, Proceedings of the 23rd International Conference on Principles of Distributed Systems, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. conference: end_date: 2019-12-19 location: Neuchâtel, Switzerland name: 'OPODIS: International Conference on Principles of Distributed Systems' start_date: 2019-12-17 date_created: 2020-01-21T16:00:26Z date_published: 2020-02-10T00:00:00Z date_updated: 2023-02-23T13:05:49Z day: '10' ddc: - '000' department: - _id: KrCh doi: 10.4230/LIPIcs.OPODIS.2019.21 external_id: arxiv: - '1906.00110' file: - access_level: open_access checksum: 9a91916ac2c21ab42458fcda39ef0b8d content_type: application/pdf creator: dernst date_created: 2020-03-23T09:14:06Z date_updated: 2020-07-14T12:47:56Z file_id: '7608' file_name: 2019_LIPIcS_Schmid.pdf file_size: 630752 relation: main_file file_date_updated: 2020-07-14T12:47:56Z has_accepted_license: '1' intvolume: ' 153' language: - iso: eng license: https://creativecommons.org/licenses/by/4.0/ month: '02' oa: 1 oa_version: Preprint project: - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering publication: Proceedings of the 23rd International Conference on Principles of Distributed Systems publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik quality_controlled: '1' scopus_import: '1' status: public title: 'The evolutionary price of anarchy: Locally bounded agents in a dynamic virus game' tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 153 year: '2020' ... --- _id: '7348' abstract: - lang: eng text: 'The monitoring of event frequencies can be used to recognize behavioral anomalies, to identify trends, and to deduce or discard hypotheses about the underlying system. For example, the performance of a web server may be monitored based on the ratio of the total count of requests from the least and most active clients. Exact frequency monitoring, however, can be prohibitively expensive; in the above example it would require as many counters as there are clients. In this paper, we propose the efficient probabilistic monitoring of common frequency properties, including the mode (i.e., the most common event) and the median of an event sequence. We define a logic to express composite frequency properties as a combination of atomic frequency properties. Our main contribution is an algorithm that, under suitable probabilistic assumptions, can be used to monitor these important frequency properties with four counters, independent of the number of different events. Our algorithm samples longer and longer subwords of an infinite event sequence. We prove the almost-sure convergence of our algorithm by generalizing ergodic theory from increasing-length prefixes to increasing-length subwords of an infinite sequence. A similar algorithm could be used to learn a connected Markov chain of a given structure from observing its outputs, to arbitrary precision, for a given confidence. ' alternative_title: - LIPIcs article_number: '20' article_processing_charge: No author: - first_name: Thomas full_name: Ferrere, Thomas id: 40960E6E-F248-11E8-B48F-1D18A9856A87 last_name: Ferrere orcid: 0000-0001-5199-3143 - first_name: Thomas A full_name: Henzinger, Thomas A id: 40876CD8-F248-11E8-B48F-1D18A9856A87 last_name: Henzinger orcid: 0000−0002−2985−7724 - first_name: Bernhard full_name: Kragl, Bernhard id: 320FC952-F248-11E8-B48F-1D18A9856A87 last_name: Kragl orcid: 0000-0001-7745-9117 citation: ama: 'Ferrere T, Henzinger TA, Kragl B. Monitoring event frequencies. In: 28th EACSL Annual Conference on Computer Science Logic. Vol 152. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.CSL.2020.20' apa: 'Ferrere, T., Henzinger, T. A., & Kragl, B. (2020). Monitoring event frequencies. In 28th EACSL Annual Conference on Computer Science Logic (Vol. 152). Barcelona, Spain: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CSL.2020.20' chicago: Ferrere, Thomas, Thomas A Henzinger, and Bernhard Kragl. “Monitoring Event Frequencies.” In 28th EACSL Annual Conference on Computer Science Logic, Vol. 152. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.CSL.2020.20. ieee: T. Ferrere, T. A. Henzinger, and B. Kragl, “Monitoring event frequencies,” in 28th EACSL Annual Conference on Computer Science Logic, Barcelona, Spain, 2020, vol. 152. ista: 'Ferrere T, Henzinger TA, Kragl B. 2020. Monitoring event frequencies. 28th EACSL Annual Conference on Computer Science Logic. CSL: Computer Science Logic, LIPIcs, vol. 152, 20.' mla: Ferrere, Thomas, et al. “Monitoring Event Frequencies.” 28th EACSL Annual Conference on Computer Science Logic, vol. 152, 20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.CSL.2020.20. short: T. Ferrere, T.A. Henzinger, B. Kragl, in:, 28th EACSL Annual Conference on Computer Science Logic, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. conference: end_date: 2020-01-16 location: Barcelona, Spain name: 'CSL: Computer Science Logic' start_date: 2020-01-13 date_created: 2020-01-21T11:22:21Z date_published: 2020-01-15T00:00:00Z date_updated: 2021-01-12T08:13:12Z day: '15' ddc: - '000' department: - _id: ToHe doi: 10.4230/LIPIcs.CSL.2020.20 external_id: arxiv: - '1910.06097' file: - access_level: open_access checksum: b9a691d658d075c6369d3304d17fb818 content_type: application/pdf creator: bkragl date_created: 2020-01-21T11:21:04Z date_updated: 2020-07-14T12:47:56Z file_id: '7349' file_name: main.pdf file_size: 617206 relation: main_file file_date_updated: 2020-07-14T12:47:56Z has_accepted_license: '1' intvolume: ' 152' language: - iso: eng month: '01' oa: 1 oa_version: Published Version project: - _id: 25F2ACDE-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S11402-N23 name: Rigorous Systems Engineering - _id: 25F42A32-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: Z211 name: The Wittgenstein Prize publication: 28th EACSL Annual Conference on Computer Science Logic publication_identifier: isbn: - '9783959771320' issn: - 1868-8969 publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik quality_controlled: '1' scopus_import: 1 status: public title: Monitoring event frequencies tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 152 year: '2020' ... --- _id: '7477' abstract: - lang: eng text: We present conductance-matrix measurements of a three-terminal superconductor-semiconductor hybrid device consisting of two normal leads and one superconducting lead. Using a symmetry decomposition of the conductance, we find that antisymmetric components of pairs of local and nonlocal conductances qualitatively match at energies below the superconducting gap, and we compare this finding with symmetry relations based on a noninteracting scattering matrix approach. Further, the local charge character of Andreev bound states is extracted from the symmetry-decomposed conductance data and is found to be similar at both ends of the device and tunable with gate voltage. Finally, we measure the conductance matrix as a function of magnetic field and identify correlated splittings in low-energy features, demonstrating how conductance-matrix measurements can complement traditional single-probe measurements in the search for Majorana zero modes. article_number: '036802' article_processing_charge: No article_type: original author: - first_name: G. C. full_name: Ménard, G. C. last_name: Ménard - first_name: G. L. R. full_name: Anselmetti, G. L. R. last_name: Anselmetti - first_name: E. A. full_name: Martinez, E. A. last_name: Martinez - first_name: D. full_name: Puglia, D. last_name: Puglia - first_name: F. K. full_name: Malinowski, F. K. last_name: Malinowski - first_name: J. S. full_name: Lee, J. S. last_name: Lee - first_name: S. full_name: Choi, S. last_name: Choi - first_name: M. full_name: Pendharkar, M. last_name: Pendharkar - first_name: C. J. full_name: Palmstrøm, C. J. last_name: Palmstrøm - first_name: K. full_name: Flensberg, K. last_name: Flensberg - first_name: C. M. full_name: Marcus, C. M. last_name: Marcus - first_name: L. full_name: Casparis, L. last_name: Casparis - first_name: Andrew P full_name: Higginbotham, Andrew P id: 4AD6785A-F248-11E8-B48F-1D18A9856A87 last_name: Higginbotham orcid: 0000-0003-2607-2363 citation: ama: Ménard GC, Anselmetti GLR, Martinez EA, et al. Conductance-matrix symmetries of a three-terminal hybrid device. Physical Review Letters. 2020;124(3). doi:10.1103/physrevlett.124.036802 apa: Ménard, G. C., Anselmetti, G. L. R., Martinez, E. A., Puglia, D., Malinowski, F. K., Lee, J. S., … Higginbotham, A. P. (2020). Conductance-matrix symmetries of a three-terminal hybrid device. Physical Review Letters. APS. https://doi.org/10.1103/physrevlett.124.036802 chicago: Ménard, G. C., G. L. R. Anselmetti, E. A. Martinez, D. Puglia, F. K. Malinowski, J. S. Lee, S. Choi, et al. “Conductance-Matrix Symmetries of a Three-Terminal Hybrid Device.” Physical Review Letters. APS, 2020. https://doi.org/10.1103/physrevlett.124.036802. ieee: G. C. Ménard et al., “Conductance-matrix symmetries of a three-terminal hybrid device,” Physical Review Letters, vol. 124, no. 3. APS, 2020. ista: Ménard GC, Anselmetti GLR, Martinez EA, Puglia D, Malinowski FK, Lee JS, Choi S, Pendharkar M, Palmstrøm CJ, Flensberg K, Marcus CM, Casparis L, Higginbotham AP. 2020. Conductance-matrix symmetries of a three-terminal hybrid device. Physical Review Letters. 124(3), 036802. mla: Ménard, G. C., et al. “Conductance-Matrix Symmetries of a Three-Terminal Hybrid Device.” Physical Review Letters, vol. 124, no. 3, 036802, APS, 2020, doi:10.1103/physrevlett.124.036802. short: G.C. Ménard, G.L.R. Anselmetti, E.A. Martinez, D. Puglia, F.K. Malinowski, J.S. Lee, S. Choi, M. Pendharkar, C.J. Palmstrøm, K. Flensberg, C.M. Marcus, L. Casparis, A.P. Higginbotham, Physical Review Letters 124 (2020). date_created: 2020-02-11T08:50:02Z date_published: 2020-01-24T00:00:00Z date_updated: 2021-01-12T08:13:48Z day: '24' doi: 10.1103/physrevlett.124.036802 extern: '1' external_id: arxiv: - '1905.05505' intvolume: ' 124' issue: '3' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1905.05505 month: '01' oa: 1 oa_version: Preprint publication: Physical Review Letters publication_identifier: issn: - 0031-9007 - 1079-7114 publication_status: published publisher: APS quality_controlled: '1' status: public title: Conductance-matrix symmetries of a three-terminal hybrid device type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 124 year: '2020' ... --- _id: '7478' abstract: - lang: eng text: Two-terminal conductance spectroscopy of superconducting devices is a common tool for probing Andreev and Majorana bound states. Here, we study theoretically a three-terminal setup, with two normal leads coupled to a grounded superconducting terminal. Using a single-electron scattering matrix, we derive the subgap conductance matrix for the normal leads and discuss its symmetries. In particular, we show that the local and the nonlocal elements of the conductance matrix have pairwise identical antisymmetric components. Moreover, we find that the nonlocal elements are directly related to the local BCS charges of the bound states close to the normal probes and we show how the BCS charge of overlapping Majorana bound states can be extracted from experiments. article_number: '036801' article_processing_charge: No article_type: original author: - first_name: Jeroen full_name: Danon, Jeroen last_name: Danon - first_name: Anna Birk full_name: Hellenes, Anna Birk last_name: Hellenes - first_name: Esben Bork full_name: Hansen, Esben Bork last_name: Hansen - first_name: Lucas full_name: Casparis, Lucas last_name: Casparis - first_name: Andrew P full_name: Higginbotham, Andrew P id: 4AD6785A-F248-11E8-B48F-1D18A9856A87 last_name: Higginbotham orcid: 0000-0003-2607-2363 - first_name: Karsten full_name: Flensberg, Karsten last_name: Flensberg citation: ama: 'Danon J, Hellenes AB, Hansen EB, Casparis L, Higginbotham AP, Flensberg K. Nonlocal conductance spectroscopy of Andreev bound states: Symmetry relations and BCS charges. Physical Review Letters. 2020;124(3). doi:10.1103/physrevlett.124.036801' apa: 'Danon, J., Hellenes, A. B., Hansen, E. B., Casparis, L., Higginbotham, A. P., & Flensberg, K. (2020). Nonlocal conductance spectroscopy of Andreev bound states: Symmetry relations and BCS charges. Physical Review Letters. APS. https://doi.org/10.1103/physrevlett.124.036801' chicago: 'Danon, Jeroen, Anna Birk Hellenes, Esben Bork Hansen, Lucas Casparis, Andrew P Higginbotham, and Karsten Flensberg. “Nonlocal Conductance Spectroscopy of Andreev Bound States: Symmetry Relations and BCS Charges.” Physical Review Letters. APS, 2020. https://doi.org/10.1103/physrevlett.124.036801.' ieee: 'J. Danon, A. B. Hellenes, E. B. Hansen, L. Casparis, A. P. Higginbotham, and K. Flensberg, “Nonlocal conductance spectroscopy of Andreev bound states: Symmetry relations and BCS charges,” Physical Review Letters, vol. 124, no. 3. APS, 2020.' ista: 'Danon J, Hellenes AB, Hansen EB, Casparis L, Higginbotham AP, Flensberg K. 2020. Nonlocal conductance spectroscopy of Andreev bound states: Symmetry relations and BCS charges. Physical Review Letters. 124(3), 036801.' mla: 'Danon, Jeroen, et al. “Nonlocal Conductance Spectroscopy of Andreev Bound States: Symmetry Relations and BCS Charges.” Physical Review Letters, vol. 124, no. 3, 036801, APS, 2020, doi:10.1103/physrevlett.124.036801.' short: J. Danon, A.B. Hellenes, E.B. Hansen, L. Casparis, A.P. Higginbotham, K. Flensberg, Physical Review Letters 124 (2020). date_created: 2020-02-11T08:55:40Z date_published: 2020-01-24T00:00:00Z date_updated: 2021-01-12T08:13:48Z day: '24' doi: 10.1103/physrevlett.124.036801 extern: '1' external_id: arxiv: - '1905.05438' intvolume: ' 124' issue: '3' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1905.05438 month: '01' oa: 1 oa_version: Preprint publication: Physical Review Letters publication_identifier: issn: - 0031-9007 - 1079-7114 publication_status: published publisher: APS quality_controlled: '1' status: public title: 'Nonlocal conductance spectroscopy of Andreev bound states: Symmetry relations and BCS charges' type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 124 year: '2020' ... --- _id: '7530' abstract: - lang: eng text: In developing technologies based on superconducting quantum circuits, the need to control and route heating is a significant challenge in the experimental realisation and operation of these devices. One of the more ubiquitous devices in the current quantum computing toolbox is the transmon-type superconducting quantum bit, embedded in a resonator-based architecture. In the study of heat transport in superconducting circuits, a versatile and sensitive thermometer is based on studying the tunnelling characteristics of superconducting probes weakly coupled to a normal-metal island. Here we show that by integrating superconducting quantum bit coupled to two superconducting resonators at different frequencies, each resonator terminated (and thermally populated) by such a mesoscopic thin film metal island, one can experimentally observe magnetic flux-tunable photonic heat rectification between 0 and 10%. article_number: '40' article_processing_charge: No article_type: original author: - first_name: Jorden L full_name: Senior, Jorden L id: 5479D234-2D30-11EA-89CC-40953DDC885E last_name: Senior - first_name: Azat full_name: Gubaydullin, Azat last_name: Gubaydullin - first_name: Bayan full_name: Karimi, Bayan last_name: Karimi - first_name: Joonas T. full_name: Peltonen, Joonas T. last_name: Peltonen - first_name: Joachim full_name: Ankerhold, Joachim last_name: Ankerhold - first_name: Jukka P. full_name: Pekola, Jukka P. last_name: Pekola citation: ama: Senior JL, Gubaydullin A, Karimi B, Peltonen JT, Ankerhold J, Pekola JP. Heat rectification via a superconducting artificial atom. Communications Physics. 2020;3(1). doi:10.1038/s42005-020-0307-5 apa: Senior, J. L., Gubaydullin, A., Karimi, B., Peltonen, J. T., Ankerhold, J., & Pekola, J. P. (2020). Heat rectification via a superconducting artificial atom. Communications Physics. Springer Nature. https://doi.org/10.1038/s42005-020-0307-5 chicago: Senior, Jorden L, Azat Gubaydullin, Bayan Karimi, Joonas T. Peltonen, Joachim Ankerhold, and Jukka P. Pekola. “Heat Rectification via a Superconducting Artificial Atom.” Communications Physics. Springer Nature, 2020. https://doi.org/10.1038/s42005-020-0307-5. ieee: J. L. Senior, A. Gubaydullin, B. Karimi, J. T. Peltonen, J. Ankerhold, and J. P. Pekola, “Heat rectification via a superconducting artificial atom,” Communications Physics, vol. 3, no. 1. Springer Nature, 2020. ista: Senior JL, Gubaydullin A, Karimi B, Peltonen JT, Ankerhold J, Pekola JP. 2020. Heat rectification via a superconducting artificial atom. Communications Physics. 3(1), 40. mla: Senior, Jorden L., et al. “Heat Rectification via a Superconducting Artificial Atom.” Communications Physics, vol. 3, no. 1, 40, Springer Nature, 2020, doi:10.1038/s42005-020-0307-5. short: J.L. Senior, A. Gubaydullin, B. Karimi, J.T. Peltonen, J. Ankerhold, J.P. Pekola, Communications Physics 3 (2020). date_created: 2020-02-26T13:51:14Z date_published: 2020-02-25T00:00:00Z date_updated: 2021-01-12T08:14:03Z day: '25' ddc: - '536' doi: 10.1038/s42005-020-0307-5 extern: '1' file: - access_level: open_access checksum: 59255f51d9f113c40e3047e9ac83d367 content_type: application/pdf creator: dernst date_created: 2020-03-03T10:41:13Z date_updated: 2020-07-14T12:48:00Z file_id: '7559' file_name: s42005-020-0307-5.pdf file_size: 1590721 relation: main_file - access_level: open_access checksum: 8325ae7b3c869d9aa6ed84823da4000a content_type: application/pdf creator: dernst date_created: 2020-03-03T10:41:13Z date_updated: 2020-07-14T12:48:00Z file_id: '7560' file_name: 42005_2020_307_MOESM1_ESM.pdf file_size: 1007249 relation: main_file file_date_updated: 2020-07-14T12:48:00Z has_accepted_license: '1' intvolume: ' 3' issue: '1' language: - iso: eng month: '02' oa: 1 oa_version: Published Version publication: Communications Physics publication_identifier: issn: - 2399-3650 publication_status: published publisher: Springer Nature quality_controlled: '1' status: public title: Heat rectification via a superconducting artificial atom tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 3 year: '2020' ... --- _id: '7545' abstract: - lang: eng text: Neuronal activity often leads to alterations in gene expression and cellular architecture. The nematode Caenorhabditis elegans, owing to its compact translucent nervous system, is a powerful system in which to study conserved aspects of the development and plasticity of neuronal morphology. Here we focus on one pair of sensory neurons, termed URX, which the worm uses to sense and avoid high levels of environmental oxygen. Previous studies have reported that the URX neuron pair has variable branched endings at its dendritic sensory tip. By controlling oxygen levels and analyzing mutants, we found that these microtubule-rich branched endings grow over time as a consequence of neuronal activity in adulthood. We also find that the growth of these branches correlates with an increase in cellular sensitivity to particular ranges of oxygen that is observable in the behavior of older worms. Given the strengths of C. elegans as a model organism, URX may serve as a potent system for uncovering genes and mechanisms involved in activity-dependent morphological changes in neurons and possible adaptive changes in the aging nervous system. article_processing_charge: No article_type: original author: - first_name: Jesse A. full_name: Cohn, Jesse A. last_name: Cohn - first_name: Elizabeth R. full_name: Cebul, Elizabeth R. last_name: Cebul - first_name: Giulio full_name: Valperga, Giulio last_name: Valperga - first_name: Lotti full_name: Brose, Lotti last_name: Brose - first_name: Mario full_name: de Bono, Mario id: 4E3FF80E-F248-11E8-B48F-1D18A9856A87 last_name: de Bono orcid: 0000-0001-8347-0443 - first_name: Maxwell G. full_name: Heiman, Maxwell G. last_name: Heiman - first_name: Jonathan T. full_name: Pierce, Jonathan T. last_name: Pierce citation: ama: Cohn JA, Cebul ER, Valperga G, et al. Long-term activity drives dendritic branch elaboration of a C. elegans sensory neuron. Developmental Biology. 2020;461(1):66-74. doi:10.1016/j.ydbio.2020.01.005 apa: Cohn, J. A., Cebul, E. R., Valperga, G., Brose, L., de Bono, M., Heiman, M. G., & Pierce, J. T. (2020). Long-term activity drives dendritic branch elaboration of a C. elegans sensory neuron. Developmental Biology. Elsevier. https://doi.org/10.1016/j.ydbio.2020.01.005 chicago: Cohn, Jesse A., Elizabeth R. Cebul, Giulio Valperga, Lotti Brose, Mario de Bono, Maxwell G. Heiman, and Jonathan T. Pierce. “Long-Term Activity Drives Dendritic Branch Elaboration of a C. Elegans Sensory Neuron.” Developmental Biology. Elsevier, 2020. https://doi.org/10.1016/j.ydbio.2020.01.005. ieee: J. A. Cohn et al., “Long-term activity drives dendritic branch elaboration of a C. elegans sensory neuron,” Developmental Biology, vol. 461, no. 1. Elsevier, pp. 66–74, 2020. ista: Cohn JA, Cebul ER, Valperga G, Brose L, de Bono M, Heiman MG, Pierce JT. 2020. Long-term activity drives dendritic branch elaboration of a C. elegans sensory neuron. Developmental Biology. 461(1), 66–74. mla: Cohn, Jesse A., et al. “Long-Term Activity Drives Dendritic Branch Elaboration of a C. Elegans Sensory Neuron.” Developmental Biology, vol. 461, no. 1, Elsevier, 2020, pp. 66–74, doi:10.1016/j.ydbio.2020.01.005. short: J.A. Cohn, E.R. Cebul, G. Valperga, L. Brose, M. de Bono, M.G. Heiman, J.T. Pierce, Developmental Biology 461 (2020) 66–74. date_created: 2020-02-28T10:38:32Z date_published: 2020-05-01T00:00:00Z date_updated: 2021-01-12T08:14:06Z day: '01' doi: 10.1016/j.ydbio.2020.01.005 extern: '1' intvolume: ' 461' issue: '1' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.1101/685339 month: '05' oa: 1 oa_version: Preprint page: 66-74 publication: Developmental Biology publication_identifier: issn: - 0012-1606 publication_status: published publisher: Elsevier quality_controlled: '1' status: public title: Long-term activity drives dendritic branch elaboration of a C. elegans sensory neuron type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 461 year: '2020' ... --- _id: '7567' abstract: - lang: eng text: Coxeter triangulations are triangulations of Euclidean space based on a single simplex. By this we mean that given an individual simplex we can recover the entire triangulation of Euclidean space by inductively reflecting in the faces of the simplex. In this paper we establish that the quality of the simplices in all Coxeter triangulations is O(1/d−−√) of the quality of regular simplex. We further investigate the Delaunay property for these triangulations. Moreover, we consider an extension of the Delaunay property, namely protection, which is a measure of non-degeneracy of a Delaunay triangulation. In particular, one family of Coxeter triangulations achieves the protection O(1/d2). We conjecture that both bounds are optimal for triangulations in Euclidean space. article_processing_charge: Yes (via OA deal) article_type: original author: - first_name: Aruni full_name: Choudhary, Aruni last_name: Choudhary - first_name: Siargey full_name: Kachanovich, Siargey last_name: Kachanovich - first_name: Mathijs full_name: Wintraecken, Mathijs id: 307CFBC8-F248-11E8-B48F-1D18A9856A87 last_name: Wintraecken orcid: 0000-0002-7472-2220 citation: ama: Choudhary A, Kachanovich S, Wintraecken M. Coxeter triangulations have good quality. Mathematics in Computer Science. 2020;14:141-176. doi:10.1007/s11786-020-00461-5 apa: Choudhary, A., Kachanovich, S., & Wintraecken, M. (2020). Coxeter triangulations have good quality. Mathematics in Computer Science. Springer Nature. https://doi.org/10.1007/s11786-020-00461-5 chicago: Choudhary, Aruni, Siargey Kachanovich, and Mathijs Wintraecken. “Coxeter Triangulations Have Good Quality.” Mathematics in Computer Science. Springer Nature, 2020. https://doi.org/10.1007/s11786-020-00461-5. ieee: A. Choudhary, S. Kachanovich, and M. Wintraecken, “Coxeter triangulations have good quality,” Mathematics in Computer Science, vol. 14. Springer Nature, pp. 141–176, 2020. ista: Choudhary A, Kachanovich S, Wintraecken M. 2020. Coxeter triangulations have good quality. Mathematics in Computer Science. 14, 141–176. mla: Choudhary, Aruni, et al. “Coxeter Triangulations Have Good Quality.” Mathematics in Computer Science, vol. 14, Springer Nature, 2020, pp. 141–76, doi:10.1007/s11786-020-00461-5. short: A. Choudhary, S. Kachanovich, M. Wintraecken, Mathematics in Computer Science 14 (2020) 141–176. date_created: 2020-03-05T13:30:18Z date_published: 2020-03-01T00:00:00Z date_updated: 2021-01-12T08:14:13Z day: '01' ddc: - '510' department: - _id: HeEd doi: 10.1007/s11786-020-00461-5 ec_funded: 1 file: - access_level: open_access checksum: 1d145f3ab50ccee735983cb89236e609 content_type: application/pdf creator: dernst date_created: 2020-11-20T10:18:02Z date_updated: 2020-11-20T10:18:02Z file_id: '8783' file_name: 2020_MathCompScie_Choudhary.pdf file_size: 872275 relation: main_file success: 1 file_date_updated: 2020-11-20T10:18:02Z has_accepted_license: '1' intvolume: ' 14' language: - iso: eng month: '03' oa: 1 oa_version: Published Version page: 141-176 project: - _id: B67AFEDC-15C9-11EA-A837-991A96BB2854 name: IST Austria Open Access Fund - _id: 260C2330-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '754411' name: ISTplus - Postdoctoral Fellowships publication: Mathematics in Computer Science publication_identifier: eissn: - 1661-8289 issn: - 1661-8270 publication_status: published publisher: Springer Nature quality_controlled: '1' scopus_import: '1' status: public title: Coxeter triangulations have good quality tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 14 year: '2020' ... --- _id: '7594' abstract: - lang: eng text: The concept of the entanglement between spin and orbital degrees of freedom plays a crucial role in our understanding of various phases and exotic ground states in a broad class of materials, including orbitally ordered materials and spin liquids. We investigate how the spin-orbital entanglement in a Mott insulator depends on the value of the spin-orbit coupling of the relativistic origin. To this end, we numerically diagonalize a one-dimensional spin-orbital model with Kugel-Khomskii exchange interactions between spins and orbitals on different sites supplemented by the on-site spin-orbit coupling. In the regime of small spin-orbit coupling with regard to the spin-orbital exchange, the ground state to a large extent resembles the one obtained in the limit of vanishing spin-orbit coupling. On the other hand, for large spin-orbit coupling the ground state can, depending on the model parameters, either still show negligible spin-orbital entanglement or evolve to a highly spin-orbitally-entangled phase with completely distinct properties that are described by an effective XXZ model. The presented results suggest that (i) the spin-orbital entanglement may be induced by large on-site spin-orbit coupling, as found in the 5d transition metal oxides, such as the iridates; (ii) for Mott insulators with weak spin-orbit coupling of Ising type, such as, e.g., the alkali hyperoxides, the effects of the spin-orbit coupling on the ground state can, in the first order of perturbation theory, be neglected. article_number: '013353' article_processing_charge: No article_type: original author: - first_name: Dorota full_name: Gotfryd, Dorota last_name: Gotfryd - first_name: Ekaterina full_name: Paerschke, Ekaterina id: 8275014E-6063-11E9-9B7F-6338E6697425 last_name: Paerschke orcid: 0000-0003-0853-8182 - first_name: Jiri full_name: Chaloupka, Jiri last_name: Chaloupka - first_name: Andrzej M. full_name: Oles, Andrzej M. last_name: Oles - first_name: Krzysztof full_name: Wohlfeld, Krzysztof last_name: Wohlfeld citation: ama: Gotfryd D, Paerschke E, Chaloupka J, Oles AM, Wohlfeld K. How spin-orbital entanglement depends on the spin-orbit coupling in a Mott insulator. Physical Review Research. 2020;2(1). doi:10.1103/PhysRevResearch.2.013353 apa: Gotfryd, D., Paerschke, E., Chaloupka, J., Oles, A. M., & Wohlfeld, K. (2020). How spin-orbital entanglement depends on the spin-orbit coupling in a Mott insulator. Physical Review Research. American Physical Society. https://doi.org/10.1103/PhysRevResearch.2.013353 chicago: Gotfryd, Dorota, Ekaterina Paerschke, Jiri Chaloupka, Andrzej M. Oles, and Krzysztof Wohlfeld. “How Spin-Orbital Entanglement Depends on the Spin-Orbit Coupling in a Mott Insulator.” Physical Review Research. American Physical Society, 2020. https://doi.org/10.1103/PhysRevResearch.2.013353. ieee: D. Gotfryd, E. Paerschke, J. Chaloupka, A. M. Oles, and K. Wohlfeld, “How spin-orbital entanglement depends on the spin-orbit coupling in a Mott insulator,” Physical Review Research, vol. 2, no. 1. American Physical Society, 2020. ista: Gotfryd D, Paerschke E, Chaloupka J, Oles AM, Wohlfeld K. 2020. How spin-orbital entanglement depends on the spin-orbit coupling in a Mott insulator. Physical Review Research. 2(1), 013353. mla: Gotfryd, Dorota, et al. “How Spin-Orbital Entanglement Depends on the Spin-Orbit Coupling in a Mott Insulator.” Physical Review Research, vol. 2, no. 1, 013353, American Physical Society, 2020, doi:10.1103/PhysRevResearch.2.013353. short: D. Gotfryd, E. Paerschke, J. Chaloupka, A.M. Oles, K. Wohlfeld, Physical Review Research 2 (2020). date_created: 2020-03-20T15:21:10Z date_published: 2020-03-20T00:00:00Z date_updated: 2021-01-12T08:14:23Z day: '20' ddc: - '530' department: - _id: MiLe doi: 10.1103/PhysRevResearch.2.013353 ec_funded: 1 file: - access_level: open_access checksum: 1be551fd5f5583635076017d7391ffdc content_type: application/pdf creator: dernst date_created: 2020-03-23T10:18:38Z date_updated: 2020-07-14T12:48:00Z file_id: '7610' file_name: 2020_PhysRevResearch_Gotfryd.pdf file_size: 1436735 relation: main_file file_date_updated: 2020-07-14T12:48:00Z has_accepted_license: '1' intvolume: ' 2' issue: '1' language: - iso: eng month: '03' oa: 1 oa_version: Published Version project: - _id: 260C2330-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '754411' name: ISTplus - Postdoctoral Fellowships publication: Physical Review Research publication_status: published publisher: American Physical Society quality_controlled: '1' status: public title: How spin-orbital entanglement depends on the spin-orbit coupling in a Mott insulator tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 2 year: '2020' ... --- _id: '7605' abstract: - lang: eng text: 'Union-Find (or Disjoint-Set Union) is one of the fundamental problems in computer science; it has been well-studied from both theoretical and practical perspectives in the sequential case. Recently, there has been mounting interest in analyzing this problem in the concurrent scenario, and several asymptotically-efficient algorithms have been proposed. Yet, to date, there is very little known about the practical performance of concurrent Union-Find. This work addresses this gap. We evaluate and analyze the performance of several concurrent Union-Find algorithms and optimization strategies across a wide range of platforms (Intel, AMD, and ARM) and workloads (social, random, and road networks, as well as integrations into more complex algorithms). We first observe that, due to the limited computational cost, the number of induced cache misses is the critical determining factor for the performance of existing algorithms. We introduce new techniques to reduce this cost by storing node priorities implicitly and by using plain reads and writes in a way that does not affect the correctness of the algorithms. Finally, we show that Union-Find implementations are an interesting application for Transactional Memory (TM): one of the fastest algorithm variants we discovered is a sequential one that uses coarse-grained locking with the lock elision optimization to reduce synchronization cost and increase scalability. ' alternative_title: - LIPIcs article_processing_charge: No author: - first_name: Dan-Adrian full_name: Alistarh, Dan-Adrian id: 4A899BFC-F248-11E8-B48F-1D18A9856A87 last_name: Alistarh orcid: 0000-0003-3650-940X - first_name: Alexander full_name: Fedorov, Alexander last_name: Fedorov - first_name: Nikita full_name: Koval, Nikita id: 2F4DB10C-F248-11E8-B48F-1D18A9856A87 last_name: Koval citation: ama: 'Alistarh D-A, Fedorov A, Koval N. In search of the fastest concurrent union-find algorithm. In: 23rd International Conference on Principles of Distributed Systems. Vol 153. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020:15:1-15:16. doi:10.4230/LIPIcs.OPODIS.2019.15' apa: 'Alistarh, D.-A., Fedorov, A., & Koval, N. (2020). In search of the fastest concurrent union-find algorithm. In 23rd International Conference on Principles of Distributed Systems (Vol. 153, p. 15:1-15:16). Neuchatal, Switzerland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.OPODIS.2019.15' chicago: Alistarh, Dan-Adrian, Alexander Fedorov, and Nikita Koval. “In Search of the Fastest Concurrent Union-Find Algorithm.” In 23rd International Conference on Principles of Distributed Systems, 153:15:1-15:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.OPODIS.2019.15. ieee: D.-A. Alistarh, A. Fedorov, and N. Koval, “In search of the fastest concurrent union-find algorithm,” in 23rd International Conference on Principles of Distributed Systems, Neuchatal, Switzerland, 2020, vol. 153, p. 15:1-15:16. ista: 'Alistarh D-A, Fedorov A, Koval N. 2020. In search of the fastest concurrent union-find algorithm. 23rd International Conference on Principles of Distributed Systems. OPODIS: International Conference on Principles of Distributed Systems, LIPIcs, vol. 153, 15:1-15:16.' mla: Alistarh, Dan-Adrian, et al. “In Search of the Fastest Concurrent Union-Find Algorithm.” 23rd International Conference on Principles of Distributed Systems, vol. 153, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, p. 15:1-15:16, doi:10.4230/LIPIcs.OPODIS.2019.15. short: D.-A. Alistarh, A. Fedorov, N. Koval, in:, 23rd International Conference on Principles of Distributed Systems, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, p. 15:1-15:16. conference: end_date: 2019-12-19 location: Neuchatal, Switzerland name: 'OPODIS: International Conference on Principles of Distributed Systems' start_date: 2019-12-17 date_created: 2020-03-22T23:00:46Z date_published: 2020-02-01T00:00:00Z date_updated: 2023-02-23T13:12:12Z day: '01' ddc: - '000' department: - _id: DaAl doi: 10.4230/LIPIcs.OPODIS.2019.15 external_id: arxiv: - '1911.06347' file: - access_level: open_access checksum: d66f07ecb609d9f02433e39f80a447e9 content_type: application/pdf creator: dernst date_created: 2020-03-23T09:22:48Z date_updated: 2020-07-14T12:48:01Z file_id: '7609' file_name: 2019_LIPIcs_Alistarh.pdf file_size: 13074131 relation: main_file file_date_updated: 2020-07-14T12:48:01Z has_accepted_license: '1' intvolume: ' 153' language: - iso: eng license: https://creativecommons.org/licenses/by/3.0/ month: '02' oa: 1 oa_version: Published Version page: 15:1-15:16 publication: 23rd International Conference on Principles of Distributed Systems publication_identifier: isbn: - '9783959771337' issn: - '18688969' publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik quality_controlled: '1' scopus_import: '1' status: public title: In search of the fastest concurrent union-find algorithm tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/3.0/legalcode name: Creative Commons Attribution 3.0 Unported (CC BY 3.0) short: CC BY (3.0) type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 153 year: '2020' ... --- _id: '7601' abstract: - lang: eng text: Plasmodesmata (PD) are crucial structures for intercellular communication in multicellular plants with remorins being their crucial plant-specific structural and functional constituents. The PD biogenesis is an intriguing but poorly understood process. By expressing an Arabidopsis remorin protein in mammalian cells, we have reconstituted a PD-like filamentous structure, termed remorin filament (RF), connecting neighboring cells physically and physiologically. Notably, RFs are capable of transporting macromolecules intercellularly, in a way similar to plant PD. With further super-resolution microscopic analysis and biochemical characterization, we found that RFs are also composed of actin filaments, forming the core skeleton structure, aligned with the remorin protein. This unique heterologous filamentous structure might explain the molecular mechanism for remorin function as well as PD construction. Furthermore, remorin protein exhibits a specific distribution manner in the plasma membrane in mammalian cells, representing a lipid nanodomain, depending on its lipid modification status. Our studies not only provide crucial insights into the mechanism of PD biogenesis, but also uncovers unsuspected fundamental mechanistic and evolutionary links between intercellular communication systems of plants and animals. article_processing_charge: No author: - first_name: Zhuang full_name: Wei, Zhuang last_name: Wei - first_name: Shutang full_name: Tan, Shutang id: 2DE75584-F248-11E8-B48F-1D18A9856A87 last_name: Tan orcid: 0000-0002-0471-8285 - first_name: Tao full_name: Liu, Tao last_name: Liu - first_name: Yuan full_name: Wu, Yuan last_name: Wu - first_name: Ji-Gang full_name: Lei, Ji-Gang last_name: Lei - first_name: ZhengJun full_name: Chen, ZhengJun last_name: Chen - first_name: Jiří full_name: Friml, Jiří id: 4159519E-F248-11E8-B48F-1D18A9856A87 last_name: Friml orcid: 0000-0002-8302-7596 - first_name: Hong-Wei full_name: Xue, Hong-Wei last_name: Xue - first_name: Kan full_name: Liao, Kan last_name: Liao citation: ama: Wei Z, Tan S, Liu T, et al. Plasmodesmata-like intercellular connections by plant remorin in animal cells. bioRxiv. 2020. doi:10.1101/791137 apa: Wei, Z., Tan, S., Liu, T., Wu, Y., Lei, J.-G., Chen, Z., … Liao, K. (2020). Plasmodesmata-like intercellular connections by plant remorin in animal cells. bioRxiv. Cold Spring Harbor Laboratory. https://doi.org/10.1101/791137 chicago: Wei, Zhuang, Shutang Tan, Tao Liu, Yuan Wu, Ji-Gang Lei, ZhengJun Chen, Jiří Friml, Hong-Wei Xue, and Kan Liao. “Plasmodesmata-like Intercellular Connections by Plant Remorin in Animal Cells.” BioRxiv. Cold Spring Harbor Laboratory, 2020. https://doi.org/10.1101/791137. ieee: Z. Wei et al., “Plasmodesmata-like intercellular connections by plant remorin in animal cells,” bioRxiv. Cold Spring Harbor Laboratory, 2020. ista: Wei Z, Tan S, Liu T, Wu Y, Lei J-G, Chen Z, Friml J, Xue H-W, Liao K. 2020. Plasmodesmata-like intercellular connections by plant remorin in animal cells. bioRxiv, 10.1101/791137. mla: Wei, Zhuang, et al. “Plasmodesmata-like Intercellular Connections by Plant Remorin in Animal Cells.” BioRxiv, Cold Spring Harbor Laboratory, 2020, doi:10.1101/791137. short: Z. Wei, S. Tan, T. Liu, Y. Wu, J.-G. Lei, Z. Chen, J. Friml, H.-W. Xue, K. Liao, BioRxiv (2020). date_created: 2020-03-21T16:34:42Z date_published: 2020-02-19T00:00:00Z date_updated: 2021-01-12T08:14:26Z day: '19' department: - _id: JiFr doi: 10.1101/791137 language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.1101/791137 month: '02' oa: 1 oa_version: Preprint page: '22' publication: bioRxiv publication_status: published publisher: Cold Spring Harbor Laboratory status: public title: Plasmodesmata-like intercellular connections by plant remorin in animal cells type: preprint user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2020' ... --- _id: '7651' abstract: - lang: eng text: The growth of snail shells can be described by simple mathematical rules. Variation in a few parameters can explain much of the diversity of shell shapes seen in nature. However, empirical studies of gastropod shell shape variation typically use geometric morphometric approaches, which do not capture this growth pattern. We have developed a way to infer a set of developmentally descriptive shape parameters based on three-dimensional logarithmic helicospiral growth and using landmarks from two-dimensional shell images as input. We demonstrate the utility of this approach, and compare it to the geometric morphometric approach, using a large set of Littorina saxatilis shells in which locally adapted populations differ in shape. Our method can be modified easily to make it applicable to a wide range of shell forms, which would allow for investigations of the similarities and differences between and within many different species of gastropods. article_number: '20190721' article_processing_charge: No article_type: original author: - first_name: J. full_name: Larsson, J. last_name: Larsson - first_name: Anja M full_name: Westram, Anja M id: 3C147470-F248-11E8-B48F-1D18A9856A87 last_name: Westram orcid: 0000-0003-1050-4969 - first_name: S. full_name: Bengmark, S. last_name: Bengmark - first_name: T. full_name: Lundh, T. last_name: Lundh - first_name: R. K. full_name: Butlin, R. K. last_name: Butlin citation: ama: Larsson J, Westram AM, Bengmark S, Lundh T, Butlin RK. A developmentally descriptive method for quantifying shape in gastropod shells. Journal of The Royal Society Interface. 2020;17(163). doi:10.1098/rsif.2019.0721 apa: Larsson, J., Westram, A. M., Bengmark, S., Lundh, T., & Butlin, R. K. (2020). A developmentally descriptive method for quantifying shape in gastropod shells. Journal of The Royal Society Interface. The Royal Society. https://doi.org/10.1098/rsif.2019.0721 chicago: Larsson, J., Anja M Westram, S. Bengmark, T. Lundh, and R. K. Butlin. “A Developmentally Descriptive Method for Quantifying Shape in Gastropod Shells.” Journal of The Royal Society Interface. The Royal Society, 2020. https://doi.org/10.1098/rsif.2019.0721. ieee: J. Larsson, A. M. Westram, S. Bengmark, T. Lundh, and R. K. Butlin, “A developmentally descriptive method for quantifying shape in gastropod shells,” Journal of The Royal Society Interface, vol. 17, no. 163. The Royal Society, 2020. ista: Larsson J, Westram AM, Bengmark S, Lundh T, Butlin RK. 2020. A developmentally descriptive method for quantifying shape in gastropod shells. Journal of The Royal Society Interface. 17(163), 20190721. mla: Larsson, J., et al. “A Developmentally Descriptive Method for Quantifying Shape in Gastropod Shells.” Journal of The Royal Society Interface, vol. 17, no. 163, 20190721, The Royal Society, 2020, doi:10.1098/rsif.2019.0721. short: J. Larsson, A.M. Westram, S. Bengmark, T. Lundh, R.K. Butlin, Journal of The Royal Society Interface 17 (2020). date_created: 2020-04-08T15:19:17Z date_published: 2020-02-01T00:00:00Z date_updated: 2021-01-12T08:14:41Z day: '01' ddc: - '570' department: - _id: NiBa doi: 10.1098/rsif.2019.0721 file: - access_level: open_access checksum: 4eb102304402f5c56432516b84df86d6 content_type: application/pdf creator: dernst date_created: 2020-04-14T12:31:16Z date_updated: 2020-07-14T12:48:01Z file_id: '7660' file_name: 2020_JournRoyalSociety_Larsson.pdf file_size: 1556190 relation: main_file file_date_updated: 2020-07-14T12:48:01Z has_accepted_license: '1' intvolume: ' 17' issue: '163' language: - iso: eng month: '02' oa: 1 oa_version: Published Version publication: Journal of The Royal Society Interface publication_identifier: eissn: - 1742-5662 issn: - 1742-5689 publication_status: published publisher: The Royal Society quality_controlled: '1' scopus_import: 1 status: public title: A developmentally descriptive method for quantifying shape in gastropod shells tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 17 year: '2020' ... --- _id: '7708' abstract: - lang: eng text: We conducted DNA methylation association analyses using Illumina 450K data from whole blood for an Australian amyotrophic lateral sclerosis (ALS) case–control cohort (782 cases and 613 controls). Analyses used mixed linear models as implemented in the OSCA software. We found a significantly higher proportion of neutrophils in cases compared to controls which replicated in an independent cohort from the Netherlands (1159 cases and 637 controls). The OSCA MOMENT linear mixed model has been shown in simulations to best account for confounders. When combined in a methylation profile score, the 25 most-associated probes identified by MOMENT significantly classified case–control status in the Netherlands sample (area under the curve, AUC = 0.65, CI95% = [0.62–0.68], p = 8.3 × 10−22). The maximum AUC achieved was 0.69 (CI95% = [0.66–0.71], p = 4.3 × 10−34) when cell-type proportion was included in the predictor. article_number: '10' article_processing_charge: No article_type: original author: - first_name: Marta F. full_name: Nabais, Marta F. last_name: Nabais - first_name: Tian full_name: Lin, Tian last_name: Lin - first_name: Beben full_name: Benyamin, Beben last_name: Benyamin - first_name: Kelly L. full_name: Williams, Kelly L. last_name: Williams - first_name: Fleur C. full_name: Garton, Fleur C. last_name: Garton - first_name: Anna A. E. full_name: Vinkhuyzen, Anna A. E. last_name: Vinkhuyzen - first_name: Futao full_name: Zhang, Futao last_name: Zhang - first_name: Costanza L. full_name: Vallerga, Costanza L. last_name: Vallerga - first_name: Restuadi full_name: Restuadi, Restuadi last_name: Restuadi - first_name: Anna full_name: Freydenzon, Anna last_name: Freydenzon - first_name: Ramona A. J. full_name: Zwamborn, Ramona A. J. last_name: Zwamborn - first_name: Paul J. full_name: Hop, Paul J. last_name: Hop - first_name: Matthew Richard full_name: Robinson, Matthew Richard id: E5D42276-F5DA-11E9-8E24-6303E6697425 last_name: Robinson orcid: 0000-0001-8982-8813 - first_name: Jacob full_name: Gratten, Jacob last_name: Gratten - first_name: Peter M. full_name: Visscher, Peter M. last_name: Visscher - first_name: Eilis full_name: Hannon, Eilis last_name: Hannon - first_name: Jonathan full_name: Mill, Jonathan last_name: Mill - first_name: Matthew A. full_name: Brown, Matthew A. last_name: Brown - first_name: Nigel G. full_name: Laing, Nigel G. last_name: Laing - first_name: Karen A. full_name: Mather, Karen A. last_name: Mather - first_name: Perminder S. full_name: Sachdev, Perminder S. last_name: Sachdev - first_name: Shyuan T. full_name: Ngo, Shyuan T. last_name: Ngo - first_name: Frederik J. full_name: Steyn, Frederik J. last_name: Steyn - first_name: Leanne full_name: Wallace, Leanne last_name: Wallace - first_name: Anjali K. full_name: Henders, Anjali K. last_name: Henders - first_name: Merrilee full_name: Needham, Merrilee last_name: Needham - first_name: Jan H. full_name: Veldink, Jan H. last_name: Veldink - first_name: Susan full_name: Mathers, Susan last_name: Mathers - first_name: Garth full_name: Nicholson, Garth last_name: Nicholson - first_name: Dominic B. full_name: Rowe, Dominic B. last_name: Rowe - first_name: Robert D. full_name: Henderson, Robert D. last_name: Henderson - first_name: Pamela A. full_name: McCombe, Pamela A. last_name: McCombe - first_name: Roger full_name: Pamphlett, Roger last_name: Pamphlett - first_name: Jian full_name: Yang, Jian last_name: Yang - first_name: Ian P. full_name: Blair, Ian P. last_name: Blair - first_name: Allan F. full_name: McRae, Allan F. last_name: McRae - first_name: Naomi R. full_name: Wray, Naomi R. last_name: Wray citation: ama: Nabais MF, Lin T, Benyamin B, et al. Significant out-of-sample classification from methylation profile scoring for amyotrophic lateral sclerosis. npj Genomic Medicine. 2020;5. doi:10.1038/s41525-020-0118-3 apa: Nabais, M. F., Lin, T., Benyamin, B., Williams, K. L., Garton, F. C., Vinkhuyzen, A. A. E., … Wray, N. R. (2020). Significant out-of-sample classification from methylation profile scoring for amyotrophic lateral sclerosis. Npj Genomic Medicine. Springer Nature. https://doi.org/10.1038/s41525-020-0118-3 chicago: Nabais, Marta F., Tian Lin, Beben Benyamin, Kelly L. Williams, Fleur C. Garton, Anna A. E. Vinkhuyzen, Futao Zhang, et al. “Significant Out-of-Sample Classification from Methylation Profile Scoring for Amyotrophic Lateral Sclerosis.” Npj Genomic Medicine. Springer Nature, 2020. https://doi.org/10.1038/s41525-020-0118-3. ieee: M. F. Nabais et al., “Significant out-of-sample classification from methylation profile scoring for amyotrophic lateral sclerosis,” npj Genomic Medicine, vol. 5. Springer Nature, 2020. ista: Nabais MF, Lin T, Benyamin B, Williams KL, Garton FC, Vinkhuyzen AAE, Zhang F, Vallerga CL, Restuadi R, Freydenzon A, Zwamborn RAJ, Hop PJ, Robinson MR, Gratten J, Visscher PM, Hannon E, Mill J, Brown MA, Laing NG, Mather KA, Sachdev PS, Ngo ST, Steyn FJ, Wallace L, Henders AK, Needham M, Veldink JH, Mathers S, Nicholson G, Rowe DB, Henderson RD, McCombe PA, Pamphlett R, Yang J, Blair IP, McRae AF, Wray NR. 2020. Significant out-of-sample classification from methylation profile scoring for amyotrophic lateral sclerosis. npj Genomic Medicine. 5, 10. mla: Nabais, Marta F., et al. “Significant Out-of-Sample Classification from Methylation Profile Scoring for Amyotrophic Lateral Sclerosis.” Npj Genomic Medicine, vol. 5, 10, Springer Nature, 2020, doi:10.1038/s41525-020-0118-3. short: M.F. Nabais, T. Lin, B. Benyamin, K.L. Williams, F.C. Garton, A.A.E. Vinkhuyzen, F. Zhang, C.L. Vallerga, R. Restuadi, A. Freydenzon, R.A.J. Zwamborn, P.J. Hop, M.R. Robinson, J. Gratten, P.M. Visscher, E. Hannon, J. Mill, M.A. Brown, N.G. Laing, K.A. Mather, P.S. Sachdev, S.T. Ngo, F.J. Steyn, L. Wallace, A.K. Henders, M. Needham, J.H. Veldink, S. Mathers, G. Nicholson, D.B. Rowe, R.D. Henderson, P.A. McCombe, R. Pamphlett, J. Yang, I.P. Blair, A.F. McRae, N.R. Wray, Npj Genomic Medicine 5 (2020). date_created: 2020-04-30T10:39:54Z date_published: 2020-02-27T00:00:00Z date_updated: 2021-01-12T08:14:59Z day: '27' doi: 10.1038/s41525-020-0118-3 extern: '1' intvolume: ' 5' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.1038/s41525-020-0118-3 month: '02' oa: 1 oa_version: Published Version publication: npj Genomic Medicine publication_identifier: issn: - 2056-7944 publication_status: published publisher: Springer Nature quality_controlled: '1' status: public title: Significant out-of-sample classification from methylation profile scoring for amyotrophic lateral sclerosis type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 5 year: '2020' ... --- _id: '7707' abstract: - lang: eng text: The growing sample size of genome-wide association studies has facilitated the discovery of gene-environment interactions (GxE). Here we propose a maximum likelihood method to estimate the contribution of GxE to continuous traits taking into account all interacting environmental variables, without the need to measure any. Extensive simulations demonstrate that our method provides unbiased interaction estimates and excellent coverage. We also offer strategies to distinguish specific GxE from general scale effects. Applying our method to 32 traits in the UK Biobank reveals that while the genetic risk score (GRS) of 376 variants explains 5.2% of body mass index (BMI) variance, GRSxE explains an additional 1.9%. Nevertheless, this interaction holds for any variable with identical correlation to BMI as the GRS, hence may not be GRS-specific. Still, we observe that the global contribution of specific GRSxE to complex traits is substantial for nine obesity-related measures (including leg impedance and trunk fat-free mass). article_number: '1385' article_processing_charge: No article_type: original author: - first_name: Jonathan full_name: Sulc, Jonathan last_name: Sulc - first_name: Ninon full_name: Mounier, Ninon last_name: Mounier - first_name: Felix full_name: Günther, Felix last_name: Günther - first_name: Thomas full_name: Winkler, Thomas last_name: Winkler - first_name: Andrew R. full_name: Wood, Andrew R. last_name: Wood - first_name: Timothy M. full_name: Frayling, Timothy M. last_name: Frayling - first_name: Iris M. full_name: Heid, Iris M. last_name: Heid - first_name: Matthew Richard full_name: Robinson, Matthew Richard id: E5D42276-F5DA-11E9-8E24-6303E6697425 last_name: Robinson orcid: 0000-0001-8982-8813 - first_name: Zoltán full_name: Kutalik, Zoltán last_name: Kutalik citation: ama: Sulc J, Mounier N, Günther F, et al. Quantification of the overall contribution of gene-environment interaction for obesity-related traits. Nature Communications. 2020;11. doi:10.1038/s41467-020-15107-0 apa: Sulc, J., Mounier, N., Günther, F., Winkler, T., Wood, A. R., Frayling, T. M., … Kutalik, Z. (2020). Quantification of the overall contribution of gene-environment interaction for obesity-related traits. Nature Communications. Springer Nature. https://doi.org/10.1038/s41467-020-15107-0 chicago: Sulc, Jonathan, Ninon Mounier, Felix Günther, Thomas Winkler, Andrew R. Wood, Timothy M. Frayling, Iris M. Heid, Matthew Richard Robinson, and Zoltán Kutalik. “Quantification of the Overall Contribution of Gene-Environment Interaction for Obesity-Related Traits.” Nature Communications. Springer Nature, 2020. https://doi.org/10.1038/s41467-020-15107-0. ieee: J. Sulc et al., “Quantification of the overall contribution of gene-environment interaction for obesity-related traits,” Nature Communications, vol. 11. Springer Nature, 2020. ista: Sulc J, Mounier N, Günther F, Winkler T, Wood AR, Frayling TM, Heid IM, Robinson MR, Kutalik Z. 2020. Quantification of the overall contribution of gene-environment interaction for obesity-related traits. Nature Communications. 11, 1385. mla: Sulc, Jonathan, et al. “Quantification of the Overall Contribution of Gene-Environment Interaction for Obesity-Related Traits.” Nature Communications, vol. 11, 1385, Springer Nature, 2020, doi:10.1038/s41467-020-15107-0. short: J. Sulc, N. Mounier, F. Günther, T. Winkler, A.R. Wood, T.M. Frayling, I.M. Heid, M.R. Robinson, Z. Kutalik, Nature Communications 11 (2020). date_created: 2020-04-30T10:39:33Z date_published: 2020-03-20T00:00:00Z date_updated: 2021-01-12T08:14:59Z day: '20' doi: 10.1038/s41467-020-15107-0 extern: '1' intvolume: ' 11' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.1038/s41467-020-15107-0 month: '03' oa: 1 oa_version: Published Version publication: Nature Communications publication_identifier: issn: - 2041-1723 publication_status: published publisher: Springer Nature quality_controlled: '1' status: public title: Quantification of the overall contribution of gene-environment interaction for obesity-related traits type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 11 year: '2020' ... --- _id: '7778' abstract: - lang: eng text: Recent advances in synthetic posttranslational protein circuits are substantially impacting the landscape of cellular engineering and offer several advantages compared to traditional gene circuits. However, engineering dynamic phenomena such as oscillations in protein-level circuits remains an outstanding challenge. Few examples of biological posttranslational oscillators are known, necessitating theoretical progress to determine realizable oscillators. We construct mathematical models for two posttranslational oscillators, using few components that interact only through reversible binding and phosphorylation/dephosphorylation reactions. Our designed oscillators rely on the self-assembly of two protein species into multimeric functional enzymes that respectively inhibit and enhance this self-assembly. We limit our analysis to within experimental constraints, finding (i) significant portions of the restricted parameter space yielding oscillations and (ii) that oscillation periods can be tuned by several orders of magnitude using recent advances in computational protein design. Our work paves the way for the rational design and realization of protein-based dynamic systems. article_number: eabc1939 article_processing_charge: No article_type: original author: - first_name: Ofer full_name: Kimchi, Ofer last_name: Kimchi - first_name: Carl Peter full_name: Goodrich, Carl Peter id: EB352CD2-F68A-11E9-89C5-A432E6697425 last_name: Goodrich orcid: 0000-0002-1307-5074 - first_name: Alexis full_name: Courbet, Alexis last_name: Courbet - first_name: Agnese I. full_name: Curatolo, Agnese I. last_name: Curatolo - first_name: Nicholas B. full_name: Woodall, Nicholas B. last_name: Woodall - first_name: David full_name: Baker, David last_name: Baker - first_name: Michael P. full_name: Brenner, Michael P. last_name: Brenner citation: ama: Kimchi O, Goodrich CP, Courbet A, et al. Self-assembly-based posttranslational protein oscillators. Science Advances. 2020;6(51). doi:10.1126/sciadv.abc1939 apa: Kimchi, O., Goodrich, C. P., Courbet, A., Curatolo, A. I., Woodall, N. B., Baker, D., & Brenner, M. P. (2020). Self-assembly-based posttranslational protein oscillators. Science Advances. https://doi.org/10.1126/sciadv.abc1939 chicago: Kimchi, Ofer, Carl Peter Goodrich, Alexis Courbet, Agnese I. Curatolo, Nicholas B. Woodall, David Baker, and Michael P. Brenner. “Self-Assembly-Based Posttranslational Protein Oscillators.” Science Advances, 2020. https://doi.org/10.1126/sciadv.abc1939. ieee: O. Kimchi et al., “Self-assembly-based posttranslational protein oscillators,” Science Advances, vol. 6, no. 51. 2020. ista: Kimchi O, Goodrich CP, Courbet A, Curatolo AI, Woodall NB, Baker D, Brenner MP. 2020. Self-assembly-based posttranslational protein oscillators. Science Advances. 6(51), eabc1939. mla: Kimchi, Ofer, et al. “Self-Assembly-Based Posttranslational Protein Oscillators.” Science Advances, vol. 6, no. 51, eabc1939, 2020, doi:10.1126/sciadv.abc1939. short: O. Kimchi, C.P. Goodrich, A. Courbet, A.I. Curatolo, N.B. Woodall, D. Baker, M.P. Brenner, Science Advances 6 (2020). date_created: 2020-04-30T12:07:55Z date_published: 2020-12-16T00:00:00Z date_updated: 2021-04-12T08:35:19Z day: '16' ddc: - '570' doi: 10.1126/sciadv.abc1939 extern: '1' file: - access_level: open_access checksum: eb6d950b6a68ddc4a2fb31ec80a2a1bd content_type: application/pdf creator: dernst date_created: 2021-04-12T08:33:23Z date_updated: 2021-04-12T08:33:23Z file_id: '9320' file_name: 2020_ScienceAdv_Kimchi.pdf file_size: 1259758 relation: main_file success: 1 file_date_updated: 2021-04-12T08:33:23Z has_accepted_license: '1' intvolume: ' 6' issue: '51' language: - iso: eng month: '12' oa: 1 oa_version: Published Version publication: Science Advances publication_status: published quality_controlled: '1' status: public title: Self-assembly-based posttranslational protein oscillators tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 6 year: '2020' ... --- _id: '7803' abstract: - lang: eng text: "We settle the complexity of the (Δ+1)-coloring and (Δ+1)-list coloring problems in the CONGESTED CLIQUE model by presenting a simple deterministic algorithm for both problems running in a constant number of rounds. This matches the complexity of the recent breakthrough randomized constant-round (Δ+1)-list coloring algorithm due to Chang et al. (PODC'19), and significantly improves upon the state-of-the-art O(logΔ)-round deterministic (Δ+1)-coloring bound of Parter (ICALP'18).\r\nA remarkable property of our algorithm is its simplicity. Whereas the state-of-the-art randomized algorithms for this problem are based on the quite involved local coloring algorithm of Chang et al. (STOC'18), our algorithm can be described in just a few lines. At a high level, it applies a careful derandomization of a recursive procedure which partitions the nodes and their respective palettes into separate bins. We show that after O(1) recursion steps, the remaining uncolored subgraph within each bin has linear size, and thus can be solved locally by collecting it to a single node. This algorithm can also be implemented in the Massively Parallel Computation (MPC) model provided that each machine has linear (in n, the number of nodes in the input graph) space.\r\nWe also show an extension of our algorithm to the MPC regime in which machines have sublinear space: we present the first deterministic (Δ+1)-list coloring algorithm designed for sublinear-space MPC, which runs in O(logΔ+loglogn) rounds." article_processing_charge: No author: - first_name: Artur full_name: Czumaj, Artur last_name: Czumaj orcid: 0000-0002-5646-9524 - first_name: Peter full_name: Davies, Peter id: 11396234-BB50-11E9-B24C-90FCE5697425 last_name: Davies orcid: 0000-0002-5646-9524 - first_name: Merav full_name: Parter, Merav last_name: Parter citation: ama: 'Czumaj A, Davies P, Parter M. Simple, deterministic, constant-round coloring in the congested clique. In: Proceedings of the 2020 ACM Symposium on Principles of Distributed Computing. Association for Computing Machinery; 2020:309-318. doi:10.1145/3382734.3405751' apa: 'Czumaj, A., Davies, P., & Parter, M. (2020). Simple, deterministic, constant-round coloring in the congested clique. In Proceedings of the 2020 ACM Symposium on Principles of Distributed Computing (pp. 309–318). Salerno, Italy: Association for Computing Machinery. https://doi.org/10.1145/3382734.3405751' chicago: Czumaj, Artur, Peter Davies, and Merav Parter. “Simple, Deterministic, Constant-Round Coloring in the Congested Clique.” In Proceedings of the 2020 ACM Symposium on Principles of Distributed Computing, 309–18. Association for Computing Machinery, 2020. https://doi.org/10.1145/3382734.3405751. ieee: A. Czumaj, P. Davies, and M. Parter, “Simple, deterministic, constant-round coloring in the congested clique,” in Proceedings of the 2020 ACM Symposium on Principles of Distributed Computing, Salerno, Italy, 2020, pp. 309–318. ista: 'Czumaj A, Davies P, Parter M. 2020. Simple, deterministic, constant-round coloring in the congested clique. Proceedings of the 2020 ACM Symposium on Principles of Distributed Computing. PODC: Symposium on Principles of Distributed Computing, 309–318.' mla: Czumaj, Artur, et al. “Simple, Deterministic, Constant-Round Coloring in the Congested Clique.” Proceedings of the 2020 ACM Symposium on Principles of Distributed Computing, Association for Computing Machinery, 2020, pp. 309–18, doi:10.1145/3382734.3405751. short: A. Czumaj, P. Davies, M. Parter, in:, Proceedings of the 2020 ACM Symposium on Principles of Distributed Computing, Association for Computing Machinery, 2020, pp. 309–318. conference: end_date: 2020-08-07 location: Salerno, Italy name: 'PODC: Symposium on Principles of Distributed Computing' start_date: 2020-08-03 date_created: 2020-05-06T09:02:14Z date_published: 2020-07-01T00:00:00Z date_updated: 2021-01-12T08:15:37Z day: '01' ddc: - '000' department: - _id: DaAl doi: 10.1145/3382734.3405751 ec_funded: 1 external_id: arxiv: - '2009.06043' file: - access_level: open_access checksum: 46fe4fc58a64eb04068115573f631d4c content_type: application/pdf creator: pdavies date_created: 2020-10-08T08:17:36Z date_updated: 2020-10-08T08:17:36Z file_id: '8624' file_name: ColoringArxiv.pdf file_size: 520051 relation: main_file success: 1 file_date_updated: 2020-10-08T08:17:36Z has_accepted_license: '1' language: - iso: eng month: '07' oa: 1 oa_version: Submitted Version page: 309-318 project: - _id: 260C2330-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '754411' name: ISTplus - Postdoctoral Fellowships publication: Proceedings of the 2020 ACM Symposium on Principles of Distributed Computing publication_status: published publisher: Association for Computing Machinery quality_controlled: '1' status: public title: Simple, deterministic, constant-round coloring in the congested clique type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2020' ... --- _id: '7806' abstract: - lang: eng text: "We consider the following decision problem EMBEDk→d in computational topology (where k ≤ d are fixed positive integers): Given a finite simplicial complex K of dimension k, does there exist a (piecewise-linear) embedding of K into ℝd?\r\nThe special case EMBED1→2 is graph planarity, which is decidable in linear time, as shown by Hopcroft and Tarjan. In higher dimensions, EMBED2→3 and EMBED3→3 are known to be decidable (as well as NP-hard), and recent results of Čadek et al. in computational homotopy theory, in combination with the classical Haefliger–Weber theorem in geometric topology, imply that EMBEDk→d can be solved in polynomial time for any fixed pair (k, d) of dimensions in the so-called metastable range .\r\nHere, by contrast, we prove that EMBEDk→d is algorithmically undecidable for almost all pairs of dimensions outside the metastable range, namely for . This almost completely resolves the decidability vs. undecidability of EMBEDk→d in higher dimensions and establishes a sharp dichotomy between polynomial-time solvability and undecidability.\r\nOur result complements (and in a wide range of dimensions strengthens) earlier results of Matoušek, Tancer, and the second author, who showed that EMBEDk→d is undecidable for 4 ≤ k ϵ {d – 1, d}, and NP-hard for all remaining pairs (k, d) outside the metastable range and satisfying d ≥ 4." article_processing_charge: No author: - first_name: Marek full_name: Filakovský, Marek id: 3E8AF77E-F248-11E8-B48F-1D18A9856A87 last_name: Filakovský - first_name: Uli full_name: Wagner, Uli id: 36690CA2-F248-11E8-B48F-1D18A9856A87 last_name: Wagner orcid: 0000-0002-1494-0568 - first_name: Stephan Y full_name: Zhechev, Stephan Y id: 3AA52972-F248-11E8-B48F-1D18A9856A87 last_name: Zhechev citation: ama: 'Filakovský M, Wagner U, Zhechev SY. Embeddability of simplicial complexes is undecidable. In: Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. Vol 2020-January. SIAM; 2020:767-785. doi:10.1137/1.9781611975994.47' apa: 'Filakovský, M., Wagner, U., & Zhechev, S. Y. (2020). Embeddability of simplicial complexes is undecidable. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (Vol. 2020–January, pp. 767–785). Salt Lake City, UT, United States: SIAM. https://doi.org/10.1137/1.9781611975994.47' chicago: Filakovský, Marek, Uli Wagner, and Stephan Y Zhechev. “Embeddability of Simplicial Complexes Is Undecidable.” In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, 2020–January:767–85. SIAM, 2020. https://doi.org/10.1137/1.9781611975994.47. ieee: M. Filakovský, U. Wagner, and S. Y. Zhechev, “Embeddability of simplicial complexes is undecidable,” in Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, Salt Lake City, UT, United States, 2020, vol. 2020–January, pp. 767–785. ista: 'Filakovský M, Wagner U, Zhechev SY. 2020. Embeddability of simplicial complexes is undecidable. Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms vol. 2020–January, 767–785.' mla: Filakovský, Marek, et al. “Embeddability of Simplicial Complexes Is Undecidable.” Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, vol. 2020–January, SIAM, 2020, pp. 767–85, doi:10.1137/1.9781611975994.47. short: M. Filakovský, U. Wagner, S.Y. Zhechev, in:, Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, 2020, pp. 767–785. conference: end_date: 2020-01-08 location: Salt Lake City, UT, United States name: 'SODA: Symposium on Discrete Algorithms' start_date: 2020-01-05 date_created: 2020-05-10T22:00:48Z date_published: 2020-01-01T00:00:00Z date_updated: 2021-01-12T08:15:38Z day: '01' department: - _id: UlWa doi: 10.1137/1.9781611975994.47 language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.1137/1.9781611975994.47 month: '01' oa: 1 oa_version: Published Version page: 767-785 project: - _id: 26611F5C-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: P31312 name: Algorithms for Embeddings and Homotopy Theory publication: Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms publication_identifier: isbn: - '9781611975994' publication_status: published publisher: SIAM quality_controlled: '1' scopus_import: 1 status: public title: Embeddability of simplicial complexes is undecidable type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 2020-January year: '2020' ... --- _id: '7814' abstract: - lang: eng text: 'Scientific research is to date largely restricted to wealthy laboratories in developed nations due to the necessity of complex and expensive equipment. This inequality limits the capacity of science to be used as a diplomatic channel. Maker movements use open-source technologies including additive manufacturing (3D printing) and laser cutting, together with low-cost computers for developing novel products. This movement is setting the groundwork for a revolution, allowing scientific equipment to be sourced at a fraction of the cost and has the potential to increase the availability of equipment for scientists around the world. Science education is increasingly recognized as another channel for science diplomacy. In this perspective, we introduce the idea that the Maker movement and open-source technologies have the potential to revolutionize science, technology, engineering and mathematics (STEM) education worldwide. We present an open-source STEM didactic tool called SCOPES (Sparking Curiosity through Open-source Platforms in Education and Science). SCOPES is self-contained, independent of local resources, and cost-effective. SCOPES can be adapted to communicate complex subjects from genetics to neurobiology, perform real-world biological experiments and explore digitized scientific samples. We envision such platforms will enhance science diplomacy by providing a means for scientists to share their findings with classrooms and for educators to incorporate didactic concepts into STEM lessons. By providing students the opportunity to design, perform, and share scientific experiments, students also experience firsthand the benefits of a multinational scientific community. We provide instructions on how to build and use SCOPES on our webpage: http://scopeseducation.org.' acknowledged_ssus: - _id: Bio - _id: LifeSc - _id: PreCl - _id: EM-Fac article_number: '48' article_processing_charge: No article_type: original author: - first_name: Robert J full_name: Beattie, Robert J id: 2E26DF60-F248-11E8-B48F-1D18A9856A87 last_name: Beattie orcid: 0000-0002-8483-8753 - first_name: Simon full_name: Hippenmeyer, Simon id: 37B36620-F248-11E8-B48F-1D18A9856A87 last_name: Hippenmeyer orcid: 0000-0003-2279-1061 - first_name: Florian full_name: Pauler, Florian id: 48EA0138-F248-11E8-B48F-1D18A9856A87 last_name: Pauler citation: ama: 'Beattie RJ, Hippenmeyer S, Pauler F. SCOPES: Sparking curiosity through Open-Source platforms in education and science. Frontiers in Education. 2020;5. doi:10.3389/feduc.2020.00048' apa: 'Beattie, R. J., Hippenmeyer, S., & Pauler, F. (2020). SCOPES: Sparking curiosity through Open-Source platforms in education and science. Frontiers in Education. Frontiers Media. https://doi.org/10.3389/feduc.2020.00048' chicago: 'Beattie, Robert J, Simon Hippenmeyer, and Florian Pauler. “SCOPES: Sparking Curiosity through Open-Source Platforms in Education and Science.” Frontiers in Education. Frontiers Media, 2020. https://doi.org/10.3389/feduc.2020.00048.' ieee: 'R. J. Beattie, S. Hippenmeyer, and F. Pauler, “SCOPES: Sparking curiosity through Open-Source platforms in education and science,” Frontiers in Education, vol. 5. Frontiers Media, 2020.' ista: 'Beattie RJ, Hippenmeyer S, Pauler F. 2020. SCOPES: Sparking curiosity through Open-Source platforms in education and science. Frontiers in Education. 5, 48.' mla: 'Beattie, Robert J., et al. “SCOPES: Sparking Curiosity through Open-Source Platforms in Education and Science.” Frontiers in Education, vol. 5, 48, Frontiers Media, 2020, doi:10.3389/feduc.2020.00048.' short: R.J. Beattie, S. Hippenmeyer, F. Pauler, Frontiers in Education 5 (2020). date_created: 2020-05-11T08:18:48Z date_published: 2020-05-08T00:00:00Z date_updated: 2021-01-12T08:15:42Z day: '08' ddc: - '570' department: - _id: SiHi doi: 10.3389/feduc.2020.00048 ec_funded: 1 file: - access_level: open_access checksum: a24ec24e38d843341ae620ec76c53688 content_type: application/pdf creator: dernst date_created: 2020-05-11T11:34:08Z date_updated: 2020-07-14T12:48:03Z file_id: '7818' file_name: 2020_FrontiersEduc_Beattie.pdf file_size: 1402146 relation: main_file file_date_updated: 2020-07-14T12:48:03Z has_accepted_license: '1' intvolume: ' 5' language: - iso: eng month: '05' oa: 1 oa_version: Published Version project: - _id: 264E56E2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: M02416 name: Molecular Mechanisms Regulating Gliogenesis in the Cerebral Cortex - _id: 260018B0-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '725780' name: Principles of Neural Stem Cell Lineage Progression in Cerebral Cortex Development publication: Frontiers in Education publication_identifier: issn: - 2504-284X publication_status: published publisher: Frontiers Media quality_controlled: '1' status: public title: 'SCOPES: Sparking curiosity through Open-Source platforms in education and science' tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 5 year: '2020' ... --- _id: '7866' abstract: - lang: eng text: In this paper, we establish convergence to equilibrium for a drift–diffusion–recombination system modelling the charge transport within certain semiconductor devices. More precisely, we consider a two-level system for electrons and holes which is augmented by an intermediate energy level for electrons in so-called trapped states. The recombination dynamics use the mass action principle by taking into account this additional trap level. The main part of the paper is concerned with the derivation of an entropy–entropy production inequality, which entails exponential convergence to the equilibrium via the so-called entropy method. The novelty of our approach lies in the fact that the entropy method is applied uniformly in a fast-reaction parameter which governs the lifetime of electrons on the trap level. Thus, the resulting decay estimate for the densities of electrons and holes extends to the corresponding quasi-steady-state approximation. acknowledgement: Open access funding provided by Austrian Science Fund (FWF). The second author has been supported by the International Research Training Group IGDK 1754 “Optimization and Numerical Analysis for Partial Differential Equations with Nonsmooth Structures”, funded by the German Research Council (DFG) and the Austrian Science Fund (FWF) under grant number [W 1244-N18]. article_processing_charge: No article_type: original author: - first_name: Klemens full_name: Fellner, Klemens last_name: Fellner - first_name: Michael full_name: Kniely, Michael id: 2CA2C08C-F248-11E8-B48F-1D18A9856A87 last_name: Kniely orcid: 0000-0001-5645-4333 citation: ama: Fellner K, Kniely M. Uniform convergence to equilibrium for a family of drift–diffusion models with trap-assisted recombination and the limiting Shockley–Read–Hall model. Journal of Elliptic and Parabolic Equations. 2020;6:529-598. doi:10.1007/s41808-020-00068-8 apa: Fellner, K., & Kniely, M. (2020). Uniform convergence to equilibrium for a family of drift–diffusion models with trap-assisted recombination and the limiting Shockley–Read–Hall model. Journal of Elliptic and Parabolic Equations. Springer Nature. https://doi.org/10.1007/s41808-020-00068-8 chicago: Fellner, Klemens, and Michael Kniely. “Uniform Convergence to Equilibrium for a Family of Drift–Diffusion Models with Trap-Assisted Recombination and the Limiting Shockley–Read–Hall Model.” Journal of Elliptic and Parabolic Equations. Springer Nature, 2020. https://doi.org/10.1007/s41808-020-00068-8. ieee: K. Fellner and M. Kniely, “Uniform convergence to equilibrium for a family of drift–diffusion models with trap-assisted recombination and the limiting Shockley–Read–Hall model,” Journal of Elliptic and Parabolic Equations, vol. 6. Springer Nature, pp. 529–598, 2020. ista: Fellner K, Kniely M. 2020. Uniform convergence to equilibrium for a family of drift–diffusion models with trap-assisted recombination and the limiting Shockley–Read–Hall model. Journal of Elliptic and Parabolic Equations. 6, 529–598. mla: Fellner, Klemens, and Michael Kniely. “Uniform Convergence to Equilibrium for a Family of Drift–Diffusion Models with Trap-Assisted Recombination and the Limiting Shockley–Read–Hall Model.” Journal of Elliptic and Parabolic Equations, vol. 6, Springer Nature, 2020, pp. 529–98, doi:10.1007/s41808-020-00068-8. short: K. Fellner, M. Kniely, Journal of Elliptic and Parabolic Equations 6 (2020) 529–598. date_created: 2020-05-17T22:00:45Z date_published: 2020-12-01T00:00:00Z date_updated: 2021-01-12T08:15:47Z day: '01' ddc: - '510' department: - _id: JuFi doi: 10.1007/s41808-020-00068-8 file: - access_level: open_access checksum: 6bc6832caacddceee1471291e93dcf1d content_type: application/pdf creator: dernst date_created: 2020-11-25T08:59:59Z date_updated: 2020-11-25T08:59:59Z file_id: '8802' file_name: 2020_JourEllipticParabEquat_Fellner.pdf file_size: 8408694 relation: main_file success: 1 file_date_updated: 2020-11-25T08:59:59Z has_accepted_license: '1' intvolume: ' 6' language: - iso: eng month: '12' oa: 1 oa_version: Published Version page: 529-598 project: - _id: 3AC91DDA-15DF-11EA-824D-93A3E7B544D1 call_identifier: FWF name: FWF Open Access Fund publication: Journal of Elliptic and Parabolic Equations publication_identifier: eissn: - '22969039' issn: - '22969020' publication_status: published publisher: Springer Nature quality_controlled: '1' scopus_import: '1' status: public title: Uniform convergence to equilibrium for a family of drift–diffusion models with trap-assisted recombination and the limiting Shockley–Read–Hall model tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 6 year: '2020' ... --- _id: '7919' abstract: - lang: eng text: We explore the time evolution of two impurities in a trapped one-dimensional Bose gas that follows a change of the boson-impurity interaction. We study the induced impurity-impurity interactions and their effect on the quench dynamics. In particular, we report on the size of the impurity cloud, the impurity-impurity entanglement, and the impurity-impurity correlation function. The presented numerical simulations are based upon the variational multilayer multiconfiguration time-dependent Hartree method for bosons. To analyze and quantify induced impurity-impurity correlations, we employ an effective two-body Hamiltonian with a contact interaction. We show that the effective model consistent with the mean-field attraction of two heavy impurities explains qualitatively our results for weak interactions. Our findings suggest that the quench dynamics in cold-atom systems can be a tool for studying impurity-impurity correlations. article_number: '023154 ' article_processing_charge: No article_type: original author: - first_name: S. I. full_name: Mistakidis, S. I. last_name: Mistakidis - first_name: Artem full_name: Volosniev, Artem id: 37D278BC-F248-11E8-B48F-1D18A9856A87 last_name: Volosniev orcid: 0000-0003-0393-5525 - first_name: P. full_name: Schmelcher, P. last_name: Schmelcher citation: ama: Mistakidis SI, Volosniev A, Schmelcher P. Induced correlations between impurities in a one-dimensional quenched Bose gas. Physical Review Research. 2020;2. doi:10.1103/physrevresearch.2.023154 apa: Mistakidis, S. I., Volosniev, A., & Schmelcher, P. (2020). Induced correlations between impurities in a one-dimensional quenched Bose gas. Physical Review Research. American Physical Society. https://doi.org/10.1103/physrevresearch.2.023154 chicago: Mistakidis, S. I., Artem Volosniev, and P. Schmelcher. “Induced Correlations between Impurities in a One-Dimensional Quenched Bose Gas.” Physical Review Research. American Physical Society, 2020. https://doi.org/10.1103/physrevresearch.2.023154. ieee: S. I. Mistakidis, A. Volosniev, and P. Schmelcher, “Induced correlations between impurities in a one-dimensional quenched Bose gas,” Physical Review Research, vol. 2. American Physical Society, 2020. ista: Mistakidis SI, Volosniev A, Schmelcher P. 2020. Induced correlations between impurities in a one-dimensional quenched Bose gas. Physical Review Research. 2, 023154. mla: Mistakidis, S. I., et al. “Induced Correlations between Impurities in a One-Dimensional Quenched Bose Gas.” Physical Review Research, vol. 2, 023154, American Physical Society, 2020, doi:10.1103/physrevresearch.2.023154. short: S.I. Mistakidis, A. Volosniev, P. Schmelcher, Physical Review Research 2 (2020). date_created: 2020-06-03T11:30:10Z date_published: 2020-05-11T00:00:00Z date_updated: 2023-02-23T13:20:16Z day: '11' ddc: - '530' department: - _id: MiLe doi: 10.1103/physrevresearch.2.023154 ec_funded: 1 file: - access_level: open_access checksum: e1c362fe094d6b246b3cd4a49722e78b content_type: application/pdf creator: dernst date_created: 2020-06-04T13:51:59Z date_updated: 2020-07-14T12:48:05Z file_id: '7926' file_name: 2020_PhysRevResearch_Mistakidis.pdf file_size: 1741098 relation: main_file file_date_updated: 2020-07-14T12:48:05Z has_accepted_license: '1' intvolume: ' 2' language: - iso: eng month: '05' oa: 1 oa_version: Published Version project: - _id: 260C2330-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '754411' name: ISTplus - Postdoctoral Fellowships publication: Physical Review Research publication_identifier: issn: - 2643-1564 publication_status: published publisher: American Physical Society quality_controlled: '1' status: public title: Induced correlations between impurities in a one-dimensional quenched Bose gas tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 2 year: '2020' ... --- _id: '7991' abstract: - lang: eng text: 'We define and study a discrete process that generalizes the convex-layer decomposition of a planar point set. Our process, which we call homotopic curve shortening (HCS), starts with a closed curve (which might self-intersect) in the presence of a set P⊂ ℝ² of point obstacles, and evolves in discrete steps, where each step consists of (1) taking shortcuts around the obstacles, and (2) reducing the curve to its shortest homotopic equivalent. We find experimentally that, if the initial curve is held fixed and P is chosen to be either a very fine regular grid or a uniformly random point set, then HCS behaves at the limit like the affine curve-shortening flow (ACSF). This connection between HCS and ACSF generalizes the link between "grid peeling" and the ACSF observed by Eppstein et al. (2017), which applied only to convex curves, and which was studied only for regular grids. We prove that HCS satisfies some properties analogous to those of ACSF: HCS is invariant under affine transformations, preserves convexity, and does not increase the total absolute curvature. Furthermore, the number of self-intersections of a curve, or intersections between two curves (appropriately defined), does not increase. Finally, if the initial curve is simple, then the number of inflection points (appropriately defined) does not increase.' alternative_title: - LIPIcs article_number: 12:1 - 12:15 article_processing_charge: No author: - first_name: Sergey full_name: Avvakumov, Sergey id: 3827DAC8-F248-11E8-B48F-1D18A9856A87 last_name: Avvakumov - first_name: Gabriel full_name: Nivasch, Gabriel last_name: Nivasch citation: ama: 'Avvakumov S, Nivasch G. Homotopic curve shortening and the affine curve-shortening flow. In: 36th International Symposium on Computational Geometry. Vol 164. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.SoCG.2020.12' apa: 'Avvakumov, S., & Nivasch, G. (2020). Homotopic curve shortening and the affine curve-shortening flow. In 36th International Symposium on Computational Geometry (Vol. 164). Zürich, Switzerland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2020.12' chicago: Avvakumov, Sergey, and Gabriel Nivasch. “Homotopic Curve Shortening and the Affine Curve-Shortening Flow.” In 36th International Symposium on Computational Geometry, Vol. 164. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.SoCG.2020.12. ieee: S. Avvakumov and G. Nivasch, “Homotopic curve shortening and the affine curve-shortening flow,” in 36th International Symposium on Computational Geometry, Zürich, Switzerland, 2020, vol. 164. ista: 'Avvakumov S, Nivasch G. 2020. Homotopic curve shortening and the affine curve-shortening flow. 36th International Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 164, 12:1-12:15.' mla: Avvakumov, Sergey, and Gabriel Nivasch. “Homotopic Curve Shortening and the Affine Curve-Shortening Flow.” 36th International Symposium on Computational Geometry, vol. 164, 12:1-12:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.SoCG.2020.12. short: S. Avvakumov, G. Nivasch, in:, 36th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. conference: end_date: 2020-06-26 location: Zürich, Switzerland name: 'SoCG: Symposium on Computational Geometry' start_date: 2020-06-22 date_created: 2020-06-22T09:14:19Z date_published: 2020-06-01T00:00:00Z date_updated: 2021-01-12T08:16:23Z day: '01' ddc: - '510' department: - _id: UlWa doi: 10.4230/LIPIcs.SoCG.2020.12 external_id: arxiv: - '1909.00263' file: - access_level: open_access checksum: 6872df6549142f709fb6354a1b2f2c06 content_type: application/pdf creator: dernst date_created: 2020-06-23T11:13:49Z date_updated: 2020-07-14T12:48:06Z file_id: '8007' file_name: 2020_LIPIcsSoCG_Avvakumov.pdf file_size: 575896 relation: main_file file_date_updated: 2020-07-14T12:48:06Z has_accepted_license: '1' intvolume: ' 164' language: - iso: eng month: '06' oa: 1 oa_version: Published Version project: - _id: 26611F5C-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: P31312 name: Algorithms for Embeddings and Homotopy Theory publication: 36th International Symposium on Computational Geometry publication_identifier: isbn: - '9783959771436' issn: - '18688969' publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik quality_controlled: '1' scopus_import: '1' status: public title: Homotopic curve shortening and the affine curve-shortening flow tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/3.0/legalcode name: Creative Commons Attribution 3.0 Unported (CC BY 3.0) short: CC BY (3.0) type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 164 year: '2020' ... --- _id: '7989' abstract: - lang: eng text: 'We prove general topological Radon-type theorems for sets in ℝ^d, smooth real manifolds or finite dimensional simplicial complexes. Combined with a recent result of Holmsen and Lee, it gives fractional Helly theorem, and consequently the existence of weak ε-nets as well as a (p,q)-theorem. More precisely: Let X be either ℝ^d, smooth real d-manifold, or a finite d-dimensional simplicial complex. Then if F is a finite, intersection-closed family of sets in X such that the ith reduced Betti number (with ℤ₂ coefficients) of any set in F is at most b for every non-negative integer i less or equal to k, then the Radon number of F is bounded in terms of b and X. Here k is the smallest integer larger or equal to d/2 - 1 if X = ℝ^d; k=d-1 if X is a smooth real d-manifold and not a surface, k=0 if X is a surface and k=d if X is a d-dimensional simplicial complex. Using the recent result of the author and Kalai, we manage to prove the following optimal bound on fractional Helly number for families of open sets in a surface: Let F be a finite family of open sets in a surface S such that the intersection of any subfamily of F is either empty, or path-connected. Then the fractional Helly number of F is at most three. This also settles a conjecture of Holmsen, Kim, and Lee about an existence of a (p,q)-theorem for open subsets of a surface.' alternative_title: - LIPIcs article_number: 61:1-61:13 article_processing_charge: No author: - first_name: Zuzana full_name: Patakova, Zuzana id: 48B57058-F248-11E8-B48F-1D18A9856A87 last_name: Patakova orcid: 0000-0002-3975-1683 citation: ama: 'Patakova Z. Bounding radon number via Betti numbers. In: 36th International Symposium on Computational Geometry. Vol 164. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.SoCG.2020.61' apa: 'Patakova, Z. (2020). Bounding radon number via Betti numbers. In 36th International Symposium on Computational Geometry (Vol. 164). Zürich, Switzerland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2020.61' chicago: Patakova, Zuzana. “Bounding Radon Number via Betti Numbers.” In 36th International Symposium on Computational Geometry, Vol. 164. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.SoCG.2020.61. ieee: Z. Patakova, “Bounding radon number via Betti numbers,” in 36th International Symposium on Computational Geometry, Zürich, Switzerland, 2020, vol. 164. ista: 'Patakova Z. 2020. Bounding radon number via Betti numbers. 36th International Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 164, 61:1-61:13.' mla: Patakova, Zuzana. “Bounding Radon Number via Betti Numbers.” 36th International Symposium on Computational Geometry, vol. 164, 61:1-61:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.SoCG.2020.61. short: Z. Patakova, in:, 36th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. conference: end_date: 2020-06-26 location: Zürich, Switzerland name: 'SoCG: Symposium on Computational Geometry' start_date: 2020-06-22 date_created: 2020-06-22T09:14:18Z date_published: 2020-06-01T00:00:00Z date_updated: 2021-01-12T08:16:22Z day: '01' ddc: - '510' department: - _id: UlWa doi: 10.4230/LIPIcs.SoCG.2020.61 external_id: arxiv: - '1908.01677' file: - access_level: open_access checksum: d0996ca5f6eb32ce955ce782b4f2afbe content_type: application/pdf creator: dernst date_created: 2020-06-23T06:56:23Z date_updated: 2020-07-14T12:48:06Z file_id: '8005' file_name: 2020_LIPIcsSoCG_Patakova_61.pdf file_size: 645421 relation: main_file file_date_updated: 2020-07-14T12:48:06Z has_accepted_license: '1' intvolume: ' 164' language: - iso: eng month: '06' oa: 1 oa_version: Published Version publication: 36th International Symposium on Computational Geometry publication_identifier: isbn: - '9783959771436' issn: - '18688969' publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik quality_controlled: '1' scopus_import: '1' status: public title: Bounding radon number via Betti numbers tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 164 year: '2020' ... --- _id: '7992' abstract: - lang: eng text: 'Let K be a convex body in ℝⁿ (i.e., a compact convex set with nonempty interior). Given a point p in the interior of K, a hyperplane h passing through p is called barycentric if p is the barycenter of K ∩ h. In 1961, Grünbaum raised the question whether, for every K, there exists an interior point p through which there are at least n+1 distinct barycentric hyperplanes. Two years later, this was seemingly resolved affirmatively by showing that this is the case if p=p₀ is the point of maximal depth in K. However, while working on a related question, we noticed that one of the auxiliary claims in the proof is incorrect. Here, we provide a counterexample; this re-opens Grünbaum’s question. It follows from known results that for n ≥ 2, there are always at least three distinct barycentric cuts through the point p₀ ∈ K of maximal depth. Using tools related to Morse theory we are able to improve this bound: four distinct barycentric cuts through p₀ are guaranteed if n ≥ 3.' alternative_title: - LIPIcs article_number: 62:1 - 62:16 article_processing_charge: No author: - first_name: Zuzana full_name: Patakova, Zuzana id: 48B57058-F248-11E8-B48F-1D18A9856A87 last_name: Patakova orcid: 0000-0002-3975-1683 - first_name: Martin full_name: Tancer, Martin id: 38AC689C-F248-11E8-B48F-1D18A9856A87 last_name: Tancer orcid: 0000-0002-1191-6714 - first_name: Uli full_name: Wagner, Uli id: 36690CA2-F248-11E8-B48F-1D18A9856A87 last_name: Wagner orcid: 0000-0002-1494-0568 citation: ama: 'Patakova Z, Tancer M, Wagner U. Barycentric cuts through a convex body. In: 36th International Symposium on Computational Geometry. Vol 164. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.SoCG.2020.62' apa: 'Patakova, Z., Tancer, M., & Wagner, U. (2020). Barycentric cuts through a convex body. In 36th International Symposium on Computational Geometry (Vol. 164). Zürich, Switzerland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2020.62' chicago: Patakova, Zuzana, Martin Tancer, and Uli Wagner. “Barycentric Cuts through a Convex Body.” In 36th International Symposium on Computational Geometry, Vol. 164. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.SoCG.2020.62. ieee: Z. Patakova, M. Tancer, and U. Wagner, “Barycentric cuts through a convex body,” in 36th International Symposium on Computational Geometry, Zürich, Switzerland, 2020, vol. 164. ista: 'Patakova Z, Tancer M, Wagner U. 2020. Barycentric cuts through a convex body. 36th International Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 164, 62:1-62:16.' mla: Patakova, Zuzana, et al. “Barycentric Cuts through a Convex Body.” 36th International Symposium on Computational Geometry, vol. 164, 62:1-62:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.SoCG.2020.62. short: Z. Patakova, M. Tancer, U. Wagner, in:, 36th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. conference: end_date: 2020-06-26 location: Zürich, Switzerland name: 'SoCG: Symposium on Computational Geometry' start_date: 2020-06-22 date_created: 2020-06-22T09:14:20Z date_published: 2020-06-01T00:00:00Z date_updated: 2021-01-12T08:16:23Z day: '01' ddc: - '510' department: - _id: UlWa doi: 10.4230/LIPIcs.SoCG.2020.62 external_id: arxiv: - '2003.13536' file: - access_level: open_access checksum: ce1c9194139a664fb59d1efdfc88eaae content_type: application/pdf creator: dernst date_created: 2020-06-23T06:45:52Z date_updated: 2020-07-14T12:48:06Z file_id: '8004' file_name: 2020_LIPIcsSoCG_Patakova.pdf file_size: 750318 relation: main_file file_date_updated: 2020-07-14T12:48:06Z has_accepted_license: '1' intvolume: ' 164' language: - iso: eng month: '06' oa: 1 oa_version: Published Version publication: 36th International Symposium on Computational Geometry publication_identifier: isbn: - '9783959771436' issn: - '18688969' publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik quality_controlled: '1' scopus_import: 1 status: public title: Barycentric cuts through a convex body tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 164 year: '2020' ... --- _id: '7994' abstract: - lang: eng text: In the recent study of crossing numbers, drawings of graphs that can be extended to an arrangement of pseudolines (pseudolinear drawings) have played an important role as they are a natural combinatorial extension of rectilinear (or straight-line) drawings. A characterization of the pseudolinear drawings of K_n was found recently. We extend this characterization to all graphs, by describing the set of minimal forbidden subdrawings for pseudolinear drawings. Our characterization also leads to a polynomial-time algorithm to recognize pseudolinear drawings and construct the pseudolines when it is possible. alternative_title: - LIPIcs article_number: 9:1 - 9:14 article_processing_charge: No author: - first_name: Alan M full_name: Arroyo Guevara, Alan M id: 3207FDC6-F248-11E8-B48F-1D18A9856A87 last_name: Arroyo Guevara orcid: 0000-0003-2401-8670 - first_name: Julien full_name: Bensmail, Julien last_name: Bensmail - first_name: R. full_name: Bruce Richter, R. last_name: Bruce Richter citation: ama: 'Arroyo Guevara AM, Bensmail J, Bruce Richter R. Extending drawings of graphs to arrangements of pseudolines. In: 36th International Symposium on Computational Geometry. Vol 164. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.SoCG.2020.9' apa: 'Arroyo Guevara, A. M., Bensmail, J., & Bruce Richter, R. (2020). Extending drawings of graphs to arrangements of pseudolines. In 36th International Symposium on Computational Geometry (Vol. 164). Zürich, Switzerland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2020.9' chicago: Arroyo Guevara, Alan M, Julien Bensmail, and R. Bruce Richter. “Extending Drawings of Graphs to Arrangements of Pseudolines.” In 36th International Symposium on Computational Geometry, Vol. 164. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.SoCG.2020.9. ieee: A. M. Arroyo Guevara, J. Bensmail, and R. Bruce Richter, “Extending drawings of graphs to arrangements of pseudolines,” in 36th International Symposium on Computational Geometry, Zürich, Switzerland, 2020, vol. 164. ista: 'Arroyo Guevara AM, Bensmail J, Bruce Richter R. 2020. Extending drawings of graphs to arrangements of pseudolines. 36th International Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 164, 9:1-9:14.' mla: Arroyo Guevara, Alan M., et al. “Extending Drawings of Graphs to Arrangements of Pseudolines.” 36th International Symposium on Computational Geometry, vol. 164, 9:1-9:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.SoCG.2020.9. short: A.M. Arroyo Guevara, J. Bensmail, R. Bruce Richter, in:, 36th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. conference: end_date: 2020-06-26 location: Zürich, Switzerland name: 'SoCG: Symposium on Computational Geometry' start_date: 2020-06-22 date_created: 2020-06-22T09:14:21Z date_published: 2020-06-01T00:00:00Z date_updated: 2023-02-23T13:22:12Z day: '01' ddc: - '510' department: - _id: UlWa doi: 10.4230/LIPIcs.SoCG.2020.9 ec_funded: 1 external_id: arxiv: - '1804.09317' file: - access_level: open_access checksum: 93571b76cf97d5b7c8aabaeaa694dd7e content_type: application/pdf creator: dernst date_created: 2020-06-23T11:06:23Z date_updated: 2020-07-14T12:48:06Z file_id: '8006' file_name: 2020_LIPIcsSoCG_Arroyo.pdf file_size: 592661 relation: main_file file_date_updated: 2020-07-14T12:48:06Z has_accepted_license: '1' intvolume: ' 164' language: - iso: eng month: '06' oa: 1 oa_version: Published Version project: - _id: 260C2330-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '754411' name: ISTplus - Postdoctoral Fellowships publication: 36th International Symposium on Computational Geometry publication_identifier: isbn: - '9783959771436' issn: - '18688969' publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik quality_controlled: '1' scopus_import: '1' status: public title: Extending drawings of graphs to arrangements of pseudolines tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 164 year: '2020' ... --- _id: '8011' abstract: - lang: eng text: 'Relaxation to a thermal state is the inevitable fate of nonequilibrium interacting quantum systems without special conservation laws. While thermalization in one-dimensional systems can often be suppressed by integrability mechanisms, in two spatial dimensions thermalization is expected to be far more effective due to the increased phase space. In this work we propose a general framework for escaping or delaying the emergence of the thermal state in two-dimensional arrays of Rydberg atoms via the mechanism of quantum scars, i.e., initial states that fail to thermalize. The suppression of thermalization is achieved in two complementary ways: by adding local perturbations or by adjusting the driving Rabi frequency according to the local connectivity of the lattice. We demonstrate that these mechanisms allow us to realize robust quantum scars in various two-dimensional lattices, including decorated lattices with nonconstant connectivity. In particular, we show that a small decrease of the Rabi frequency at the corners of the lattice is crucial for mitigating the strong boundary effects in two-dimensional systems. Our results identify synchronization as an important tool for future experiments on two-dimensional quantum scars.' article_number: '022065' article_processing_charge: No article_type: original author: - first_name: Alexios full_name: Michailidis, Alexios id: 36EBAD38-F248-11E8-B48F-1D18A9856A87 last_name: Michailidis - first_name: C. J. full_name: Turner, C. J. last_name: Turner - first_name: Z. full_name: Papić, Z. last_name: Papić - first_name: D. A. full_name: Abanin, D. A. last_name: Abanin - first_name: Maksym full_name: Serbyn, Maksym id: 47809E7E-F248-11E8-B48F-1D18A9856A87 last_name: Serbyn orcid: 0000-0002-2399-5827 citation: ama: Michailidis A, Turner CJ, Papić Z, Abanin DA, Serbyn M. Stabilizing two-dimensional quantum scars by deformation and synchronization. Physical Review Research. 2020;2(2). doi:10.1103/physrevresearch.2.022065 apa: Michailidis, A., Turner, C. J., Papić, Z., Abanin, D. A., & Serbyn, M. (2020). Stabilizing two-dimensional quantum scars by deformation and synchronization. Physical Review Research. American Physical Society. https://doi.org/10.1103/physrevresearch.2.022065 chicago: Michailidis, Alexios, C. J. Turner, Z. Papić, D. A. Abanin, and Maksym Serbyn. “Stabilizing Two-Dimensional Quantum Scars by Deformation and Synchronization.” Physical Review Research. American Physical Society, 2020. https://doi.org/10.1103/physrevresearch.2.022065. ieee: A. Michailidis, C. J. Turner, Z. Papić, D. A. Abanin, and M. Serbyn, “Stabilizing two-dimensional quantum scars by deformation and synchronization,” Physical Review Research, vol. 2, no. 2. American Physical Society, 2020. ista: Michailidis A, Turner CJ, Papić Z, Abanin DA, Serbyn M. 2020. Stabilizing two-dimensional quantum scars by deformation and synchronization. Physical Review Research. 2(2), 022065. mla: Michailidis, Alexios, et al. “Stabilizing Two-Dimensional Quantum Scars by Deformation and Synchronization.” Physical Review Research, vol. 2, no. 2, 022065, American Physical Society, 2020, doi:10.1103/physrevresearch.2.022065. short: A. Michailidis, C.J. Turner, Z. Papić, D.A. Abanin, M. Serbyn, Physical Review Research 2 (2020). date_created: 2020-06-23T12:00:19Z date_published: 2020-06-22T00:00:00Z date_updated: 2021-01-12T08:16:30Z day: '22' ddc: - '530' department: - _id: MaSe doi: 10.1103/physrevresearch.2.022065 ec_funded: 1 file: - access_level: open_access checksum: e6959dc8220f14a008d1933858795e6d content_type: application/pdf creator: dernst date_created: 2020-06-29T14:41:27Z date_updated: 2020-07-14T12:48:08Z file_id: '8050' file_name: 2020_PhysicalReviewResearch_Michailidis.pdf file_size: 2066011 relation: main_file file_date_updated: 2020-07-14T12:48:08Z has_accepted_license: '1' intvolume: ' 2' issue: '2' language: - iso: eng month: '06' oa: 1 oa_version: Published Version project: - _id: 23841C26-32DE-11EA-91FC-C7463DDC885E call_identifier: H2020 grant_number: '850899' name: 'Non-Ergodic Quantum Matter: Universality, Dynamics and Control' publication: Physical Review Research publication_identifier: issn: - 2643-1564 publication_status: published publisher: American Physical Society quality_controlled: '1' status: public title: Stabilizing two-dimensional quantum scars by deformation and synchronization tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 2 year: '2020' ... --- _id: '8063' abstract: - lang: eng text: "We present a generative model of images that explicitly reasons over the set\r\nof objects they show. Our model learns a structured latent representation that\r\nseparates objects from each other and from the background; unlike prior works,\r\nit explicitly represents the 2D position and depth of each object, as well as\r\nan embedding of its segmentation mask and appearance. The model can be trained\r\nfrom images alone in a purely unsupervised fashion without the need for object\r\nmasks or depth information. Moreover, it always generates complete objects,\r\neven though a significant fraction of training images contain occlusions.\r\nFinally, we show that our model can infer decompositions of novel images into\r\ntheir constituent objects, including accurate prediction of depth ordering and\r\nsegmentation of occluded parts." article_number: '2004.00642' article_processing_charge: No author: - first_name: Titas full_name: Anciukevicius, Titas last_name: Anciukevicius - first_name: Christoph full_name: Lampert, Christoph id: 40C20FD2-F248-11E8-B48F-1D18A9856A87 last_name: Lampert orcid: 0000-0001-8622-7887 - first_name: Paul M full_name: Henderson, Paul M id: 13C09E74-18D9-11E9-8878-32CFE5697425 last_name: Henderson orcid: 0000-0002-5198-7445 citation: ama: Anciukevicius T, Lampert C, Henderson PM. Object-centric image generation with factored depths, locations, and appearances. arXiv. apa: Anciukevicius, T., Lampert, C., & Henderson, P. M. (n.d.). Object-centric image generation with factored depths, locations, and appearances. arXiv. chicago: Anciukevicius, Titas, Christoph Lampert, and Paul M Henderson. “Object-Centric Image Generation with Factored Depths, Locations, and Appearances.” ArXiv, n.d. ieee: T. Anciukevicius, C. Lampert, and P. M. Henderson, “Object-centric image generation with factored depths, locations, and appearances,” arXiv. . ista: Anciukevicius T, Lampert C, Henderson PM. Object-centric image generation with factored depths, locations, and appearances. arXiv, 2004.00642. mla: Anciukevicius, Titas, et al. “Object-Centric Image Generation with Factored Depths, Locations, and Appearances.” ArXiv, 2004.00642. short: T. Anciukevicius, C. Lampert, P.M. Henderson, ArXiv (n.d.). date_created: 2020-06-29T23:55:23Z date_published: 2020-04-01T00:00:00Z date_updated: 2021-01-12T08:16:44Z day: '01' ddc: - '004' department: - _id: ChLa external_id: arxiv: - '2004.00642' language: - iso: eng license: https://creativecommons.org/licenses/by-sa/4.0/ main_file_link: - open_access: '1' url: https://arxiv.org/abs/2004.00642 month: '04' oa: 1 oa_version: Preprint publication: arXiv publication_status: submitted status: public title: Object-centric image generation with factored depths, locations, and appearances tmp: image: /images/cc_by_sa.png legal_code_url: https://creativecommons.org/licenses/by-sa/4.0/legalcode name: Creative Commons Attribution-ShareAlike 4.0 International Public License (CC BY-SA 4.0) short: CC BY-SA (4.0) type: preprint user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2020' ... --- _id: '8081' abstract: - lang: eng text: "Here, we employ micro- and nanosized cellulose particles, namely paper fines and cellulose\r\nnanocrystals, to induce hierarchical organization over a wide length scale. After processing\r\nthem into carbonaceous materials, we demonstrate that these hierarchically organized materials\r\noutperform the best materials for supercapacitors operating with organic electrolytes reported\r\nin literature in terms of specific energy/power (Ragone plot) while showing hardly any capacity\r\nfade over 4,000 cycles. The highly porous materials feature a specific surface area as high as\r\n2500 m2ˑg-1 and exhibit pore sizes in the range of 0.5 to 200 nm as proven by scanning electron\r\nmicroscopy and N2 physisorption. The carbonaceous materials have been further investigated\r\nby X-ray photoelectron spectroscopy and RAMAN spectroscopy. Since paper fines are an\r\nunderutilized side stream in any paper production process, they are a cheap and highly available\r\nfeedstock to prepare carbonaceous materials with outstanding performance in electrochemical\r\napplications. " acknowledgement: 'The authors M.A.H., S.S., R.E., and W.B. acknowledge the industrial partners Sappi Gratkorn, Zellstoff Pöls and Mondi Frantschach, the Austrian Research Promotion Agency (FFG), COMET, BMVIT, BMWFJ, the Province of Styria and Carinthia for their financial support of the K-project Flippr²-Process Integration. E.M. and S.A.F. are indebted to the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation program (grant agreement No 636069). W. T. and S. E. thank FWO (G.0C60.13N) and the European Union’s European Fund for Regional Development and Flanders Innovation & Entrepreneurship (Accelerate3 project, Interreg Vlaanderen-Nederland program) for financial support. W. T. also thanks the Provincie West-Vlaanderen (Belgium) for his Provincial Chair in Advanced Materials. S. B. thanks the European Regional Development Fund (EFRE) and the province of Upper Austria for financial support through the program IWB 2014-2020 (project BioCarb-K). AMR gratefully acknowledges funding support through the SC EPSCoR/IDeAProgram under Award #18-SR03, and the NASA EPSCoR Program under Award #NNH17ZHA002C. Icons in Scheme 1 were provided by Good Ware, monkik, photo3idea_studio, and OCHA from www.flaticon.com.' article_processing_charge: No author: - first_name: 'Mathias A. ' full_name: 'Hobisch, Mathias A. ' last_name: Hobisch - first_name: 'Eléonore ' full_name: 'Mourad, Eléonore ' last_name: Mourad - first_name: 'Wolfgang J. ' full_name: 'Fischer, Wolfgang J. ' last_name: Fischer - first_name: 'Christian ' full_name: 'Prehal, Christian ' last_name: Prehal - first_name: 'Samuel ' full_name: 'Eyley, Samuel ' last_name: Eyley - first_name: 'Anthony ' full_name: 'Childress, Anthony ' last_name: Childress - first_name: 'Armin ' full_name: 'Zankel, Armin ' last_name: Zankel - first_name: 'Andreas ' full_name: 'Mautner, Andreas ' last_name: Mautner - first_name: 'Stefan ' full_name: 'Breitenbach, Stefan ' last_name: Breitenbach - first_name: 'Apparao M. ' full_name: 'Rao, Apparao M. ' last_name: Rao - first_name: 'Wim ' full_name: 'Thielemans, Wim ' last_name: Thielemans - first_name: Stefan Alexander full_name: Freunberger, Stefan Alexander id: A8CA28E6-CE23-11E9-AD2D-EC27E6697425 last_name: Freunberger orcid: 0000-0003-2902-5319 - first_name: 'Rene ' full_name: 'Eckhart, Rene ' last_name: Eckhart - first_name: 'Wolfgang ' full_name: 'Bauer, Wolfgang ' last_name: Bauer - first_name: 'Stefan ' full_name: 'Spirk, Stefan ' last_name: Spirk citation: ama: Hobisch MA, Mourad E, Fischer WJ, et al. High specific capacitance supercapacitors from hierarchically organized all-cellulose composites. apa: Hobisch, M. A., Mourad, E., Fischer, W. J., Prehal, C., Eyley, S., Childress, A., … Spirk, S. (n.d.). High specific capacitance supercapacitors from hierarchically organized all-cellulose composites. chicago: Hobisch, Mathias A. , Eléonore Mourad, Wolfgang J. Fischer, Christian Prehal, Samuel Eyley, Anthony Childress, Armin Zankel, et al. “High Specific Capacitance Supercapacitors from Hierarchically Organized All-Cellulose Composites,” n.d. ieee: M. A. Hobisch et al., “High specific capacitance supercapacitors from hierarchically organized all-cellulose composites.” . ista: Hobisch MA, Mourad E, Fischer WJ, Prehal C, Eyley S, Childress A, Zankel A, Mautner A, Breitenbach S, Rao AM, Thielemans W, Freunberger SA, Eckhart R, Bauer W, Spirk S. High specific capacitance supercapacitors from hierarchically organized all-cellulose composites. mla: Hobisch, Mathias A., et al. High Specific Capacitance Supercapacitors from Hierarchically Organized All-Cellulose Composites. short: M.A. Hobisch, E. Mourad, W.J. Fischer, C. Prehal, S. Eyley, A. Childress, A. Zankel, A. Mautner, S. Breitenbach, A.M. Rao, W. Thielemans, S.A. Freunberger, R. Eckhart, W. Bauer, S. Spirk, (n.d.). date_created: 2020-07-02T20:24:42Z date_published: 2020-07-13T00:00:00Z date_updated: 2022-06-17T08:39:49Z day: '13' ddc: - '540' department: - _id: StFr file: - access_level: open_access checksum: 6970d621984c03ebc2eee71adfe706dd content_type: application/pdf creator: sfreunbe date_created: 2020-07-02T20:21:59Z date_updated: 2020-07-14T12:48:09Z file_id: '8082' file_name: AM.pdf file_size: 1129852 relation: main_file - access_level: open_access checksum: cd74c7bd47d6e7163d54d67f074dcc36 content_type: application/pdf creator: cziletti date_created: 2020-07-08T12:14:04Z date_updated: 2020-07-14T12:48:09Z file_id: '8102' file_name: Supporting_Information.pdf file_size: 945565 relation: supplementary_material file_date_updated: 2020-07-14T12:48:09Z has_accepted_license: '1' language: - iso: eng month: '07' oa: 1 oa_version: Submitted Version publication_status: submitted status: public title: High specific capacitance supercapacitors from hierarchically organized all-cellulose composites type: preprint user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2020' ... --- _id: '8105' abstract: - lang: eng text: Physical and biological systems often exhibit intermittent dynamics with bursts or avalanches (active states) characterized by power-law size and duration distributions. These emergent features are typical of systems at the critical point of continuous phase transitions, and have led to the hypothesis that such systems may self-organize at criticality, i.e. without any fine tuning of parameters. Since the introduction of the Bak-Tang-Wiesenfeld (BTW) model, the paradigm of self-organized criticality (SOC) has been very fruitful for the analysis of emergent collective behaviors in a number of systems, including the brain. Although considerable effort has been devoted in identifying and modeling scaling features of burst and avalanche statistics, dynamical aspects related to the temporal organization of bursts remain often poorly understood or controversial. Of crucial importance to understand the mechanisms responsible for emergent behaviors is the relationship between active and quiet periods, and the nature of the correlations. Here we investigate the dynamics of active (θ-bursts) and quiet states (δ-bursts) in brain activity during the sleep-wake cycle. We show the duality of power-law (θ, active phase) and exponential-like (δ, quiescent phase) duration distributions, typical of SOC, jointly emerge with power-law temporal correlations and anti-correlated coupling between active and quiet states. Importantly, we demonstrate that such temporal organization shares important similarities with earthquake dynamics, and propose that specific power-law correlations and coupling between active and quiet states are distinctive characteristics of a class of systems with self-organization at criticality. article_number: '00005' article_processing_charge: No article_type: original author: - first_name: Fabrizio full_name: Lombardi, Fabrizio id: A057D288-3E88-11E9-986D-0CF4E5697425 last_name: Lombardi orcid: 0000-0003-2623-5249 - first_name: Jilin W.J.L. full_name: Wang, Jilin W.J.L. last_name: Wang - first_name: Xiyun full_name: Zhang, Xiyun last_name: Zhang - first_name: Plamen Ch full_name: Ivanov, Plamen Ch last_name: Ivanov citation: ama: Lombardi F, Wang JWJL, Zhang X, Ivanov PC. Power-law correlations and coupling of active and quiet states underlie a class of complex systems with self-organization at criticality. EPJ Web of Conferences. 2020;230. doi:10.1051/epjconf/202023000005 apa: Lombardi, F., Wang, J. W. J. L., Zhang, X., & Ivanov, P. C. (2020). Power-law correlations and coupling of active and quiet states underlie a class of complex systems with self-organization at criticality. EPJ Web of Conferences. EDP Sciences. https://doi.org/10.1051/epjconf/202023000005 chicago: Lombardi, Fabrizio, Jilin W.J.L. Wang, Xiyun Zhang, and Plamen Ch Ivanov. “Power-Law Correlations and Coupling of Active and Quiet States Underlie a Class of Complex Systems with Self-Organization at Criticality.” EPJ Web of Conferences. EDP Sciences, 2020. https://doi.org/10.1051/epjconf/202023000005. ieee: F. Lombardi, J. W. J. L. Wang, X. Zhang, and P. C. Ivanov, “Power-law correlations and coupling of active and quiet states underlie a class of complex systems with self-organization at criticality,” EPJ Web of Conferences, vol. 230. EDP Sciences, 2020. ista: Lombardi F, Wang JWJL, Zhang X, Ivanov PC. 2020. Power-law correlations and coupling of active and quiet states underlie a class of complex systems with self-organization at criticality. EPJ Web of Conferences. 230, 00005. mla: Lombardi, Fabrizio, et al. “Power-Law Correlations and Coupling of Active and Quiet States Underlie a Class of Complex Systems with Self-Organization at Criticality.” EPJ Web of Conferences, vol. 230, 00005, EDP Sciences, 2020, doi:10.1051/epjconf/202023000005. short: F. Lombardi, J.W.J.L. Wang, X. Zhang, P.C. Ivanov, EPJ Web of Conferences 230 (2020). date_created: 2020-07-12T16:20:33Z date_published: 2020-03-11T00:00:00Z date_updated: 2021-01-12T08:16:55Z day: '11' ddc: - '530' department: - _id: GaTk doi: 10.1051/epjconf/202023000005 file: - access_level: open_access content_type: application/pdf creator: dernst date_created: 2020-07-22T06:17:11Z date_updated: 2020-07-22T06:17:11Z file_id: '8144' file_name: 2020_EPJWebConf_Lombardi.pdf file_size: 2197543 relation: main_file success: 1 file_date_updated: 2020-07-22T06:17:11Z has_accepted_license: '1' intvolume: ' 230' language: - iso: eng month: '03' oa: 1 oa_version: Published Version publication: EPJ Web of Conferences publication_identifier: issn: - 2100-014X publication_status: published publisher: EDP Sciences quality_controlled: '1' status: public title: Power-law correlations and coupling of active and quiet states underlie a class of complex systems with self-organization at criticality tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 230 year: '2020' ... --- _id: '8135' abstract: - lang: eng text: Discrete Morse theory has recently lead to new developments in the theory of random geometric complexes. This article surveys the methods and results obtained with this new approach, and discusses some of its shortcomings. It uses simulations to illustrate the results and to form conjectures, getting numerical estimates for combinatorial, topological, and geometric properties of weighted and unweighted Delaunay mosaics, their dual Voronoi tessellations, and the Alpha and Wrap complexes contained in the mosaics. acknowledgement: This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreements No 78818 Alpha and No 638176). It is also partially supported by the DFG Collaborative Research Center TRR 109, ‘Discretization in Geometry and Dynamics’, through grant no. I02979-N35 of the Austrian Science Fund (FWF). alternative_title: - Abel Symposia article_processing_charge: No author: - first_name: Herbert full_name: Edelsbrunner, Herbert id: 3FB178DA-F248-11E8-B48F-1D18A9856A87 last_name: Edelsbrunner orcid: 0000-0002-9823-6833 - first_name: Anton full_name: Nikitenko, Anton id: 3E4FF1BA-F248-11E8-B48F-1D18A9856A87 last_name: Nikitenko - first_name: Katharina full_name: Ölsböck, Katharina id: 4D4AA390-F248-11E8-B48F-1D18A9856A87 last_name: Ölsböck - first_name: Peter full_name: Synak, Peter id: 331776E2-F248-11E8-B48F-1D18A9856A87 last_name: Synak citation: ama: 'Edelsbrunner H, Nikitenko A, Ölsböck K, Synak P. Radius functions on Poisson–Delaunay mosaics and related complexes experimentally. In: Topological Data Analysis. Vol 15. Springer Nature; 2020:181-218. doi:10.1007/978-3-030-43408-3_8' apa: Edelsbrunner, H., Nikitenko, A., Ölsböck, K., & Synak, P. (2020). Radius functions on Poisson–Delaunay mosaics and related complexes experimentally. In Topological Data Analysis (Vol. 15, pp. 181–218). Springer Nature. https://doi.org/10.1007/978-3-030-43408-3_8 chicago: Edelsbrunner, Herbert, Anton Nikitenko, Katharina Ölsböck, and Peter Synak. “Radius Functions on Poisson–Delaunay Mosaics and Related Complexes Experimentally.” In Topological Data Analysis, 15:181–218. Springer Nature, 2020. https://doi.org/10.1007/978-3-030-43408-3_8. ieee: H. Edelsbrunner, A. Nikitenko, K. Ölsböck, and P. Synak, “Radius functions on Poisson–Delaunay mosaics and related complexes experimentally,” in Topological Data Analysis, 2020, vol. 15, pp. 181–218. ista: Edelsbrunner H, Nikitenko A, Ölsböck K, Synak P. 2020. Radius functions on Poisson–Delaunay mosaics and related complexes experimentally. Topological Data Analysis. , Abel Symposia, vol. 15, 181–218. mla: Edelsbrunner, Herbert, et al. “Radius Functions on Poisson–Delaunay Mosaics and Related Complexes Experimentally.” Topological Data Analysis, vol. 15, Springer Nature, 2020, pp. 181–218, doi:10.1007/978-3-030-43408-3_8. short: H. Edelsbrunner, A. Nikitenko, K. Ölsböck, P. Synak, in:, Topological Data Analysis, Springer Nature, 2020, pp. 181–218. date_created: 2020-07-19T22:00:59Z date_published: 2020-06-22T00:00:00Z date_updated: 2021-01-12T08:17:06Z day: '22' ddc: - '510' department: - _id: HeEd doi: 10.1007/978-3-030-43408-3_8 ec_funded: 1 file: - access_level: open_access checksum: 7b5e0de10675d787a2ddb2091370b8d8 content_type: application/pdf creator: dernst date_created: 2020-10-08T08:56:14Z date_updated: 2020-10-08T08:56:14Z file_id: '8628' file_name: 2020-B-01-PoissonExperimentalSurvey.pdf file_size: 2207071 relation: main_file success: 1 file_date_updated: 2020-10-08T08:56:14Z has_accepted_license: '1' intvolume: ' 15' language: - iso: eng month: '06' oa: 1 oa_version: Submitted Version page: 181-218 project: - _id: 266A2E9E-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '788183' name: Alpha Shape Theory Extended - _id: 2533E772-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '638176' name: Efficient Simulation of Natural Phenomena at Extremely Large Scales - _id: 2561EBF4-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: I02979-N35 name: Persistence and stability of geometric complexes publication: Topological Data Analysis publication_identifier: eissn: - '21978549' isbn: - '9783030434076' issn: - '21932808' publication_status: published publisher: Springer Nature quality_controlled: '1' scopus_import: '1' status: public title: Radius functions on Poisson–Delaunay mosaics and related complexes experimentally type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 15 year: '2020' ... --- _id: '8181' author: - first_name: Robert full_name: Hauschild, Robert id: 4E01D6B4-F248-11E8-B48F-1D18A9856A87 last_name: Hauschild orcid: 0000-0001-9843-3522 citation: ama: Hauschild R. Amplified centrosomes in dendritic cells promote immune cell effector functions. 2020. doi:10.15479/AT:ISTA:8181 apa: Hauschild, R. (2020). Amplified centrosomes in dendritic cells promote immune cell effector functions. IST Austria. https://doi.org/10.15479/AT:ISTA:8181 chicago: Hauschild, Robert. “Amplified Centrosomes in Dendritic Cells Promote Immune Cell Effector Functions.” IST Austria, 2020. https://doi.org/10.15479/AT:ISTA:8181. ieee: R. Hauschild, “Amplified centrosomes in dendritic cells promote immune cell effector functions.” IST Austria, 2020. ista: Hauschild R. 2020. Amplified centrosomes in dendritic cells promote immune cell effector functions, IST Austria, 10.15479/AT:ISTA:8181. mla: Hauschild, Robert. Amplified Centrosomes in Dendritic Cells Promote Immune Cell Effector Functions. IST Austria, 2020, doi:10.15479/AT:ISTA:8181. short: R. Hauschild, (2020). date_created: 2020-07-28T16:24:37Z date_published: 2020-08-24T00:00:00Z date_updated: 2021-01-11T15:29:08Z day: '24' department: - _id: Bio doi: 10.15479/AT:ISTA:8181 file: - access_level: open_access checksum: 878c60885ce30afb59a884dd5eef451c content_type: text/plain creator: rhauschild date_created: 2020-08-24T15:43:49Z date_updated: 2020-08-24T15:43:49Z file_id: '8290' file_name: centriolesDistance.m file_size: 6577 relation: main_file success: 1 - access_level: open_access checksum: 5a93ac7be2b66b28e4bd8b113ee6aade content_type: text/plain creator: rhauschild date_created: 2020-08-24T15:43:52Z date_updated: 2020-08-24T15:43:52Z file_id: '8291' file_name: goTracking.m file_size: 2680 relation: main_file success: 1 file_date_updated: 2020-08-24T15:43:52Z has_accepted_license: '1' license: https://opensource.org/licenses/BSD-3-Clause month: '08' oa: 1 publisher: IST Austria status: public title: Amplified centrosomes in dendritic cells promote immune cell effector functions tmp: legal_code_url: https://opensource.org/licenses/BSD-3-Clause name: The 3-Clause BSD License short: 3-Clause BSD type: software user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2020' ... --- _id: '8225' abstract: - lang: eng text: Birch pollen allergy is among the most prevalent pollen allergies in Northern and Central Europe. This IgE-mediated disease can be treated with allergen immunotherapy (AIT), which typically gives rise to IgG antibodies inducing tolerance. Although the main mechanisms of allergen immunotherapy (AIT) are known, questions regarding possible Fc-mediated effects of IgG antibodies remain unanswered. This can mainly be attributed to the unavailability of appropriate tools, i.e., well-characterised recombinant antibodies (rAbs). We hereby aimed at providing human rAbs of several classes for mechanistic studies and as possible candidates for passive immunotherapy. We engineered IgE, IgG1, and IgG4 sharing the same variable region against the major birch pollen allergen Bet v 1 using Polymerase Incomplete Primer Extension (PIPE) cloning. We tested IgE functionality and IgG blocking capabilities using appropriate model cell lines. In vitro studies showed IgE engagement with FcεRI and CD23 and Bet v 1-dependent degranulation. Overall, we hereby present fully functional, human IgE, IgG1, and IgG4 sharing the same variable region against Bet v 1 and showcase possible applications in first mechanistic studies. Furthermore, our IgG antibodies might be useful candidates for passive immunotherapy of birch pollen allergy. article_number: '5693' article_processing_charge: No article_type: original author: - first_name: Verena K. full_name: Köhler, Verena K. last_name: Köhler orcid: 0000-0001-5581-398X - first_name: Silvia full_name: Crescioli, Silvia last_name: Crescioli orcid: 0000-0002-1909-5957 - first_name: Judit full_name: Fazekas-Singer, Judit id: 36432834-F248-11E8-B48F-1D18A9856A87 last_name: Fazekas-Singer orcid: 0000-0002-8777-3502 - first_name: Heather J. full_name: Bax, Heather J. last_name: Bax orcid: 0000-0003-0432-4160 - first_name: Gerhard full_name: Hofer, Gerhard last_name: Hofer - first_name: Christina L. full_name: Pranger, Christina L. last_name: Pranger - first_name: Karin full_name: Hufnagl, Karin last_name: Hufnagl - first_name: Rodolfo full_name: Bianchini, Rodolfo last_name: Bianchini orcid: 0000-0003-0351-6937 - first_name: Sabine full_name: Flicker, Sabine last_name: Flicker orcid: 0000-0003-4768-8693 - first_name: Walter full_name: Keller, Walter last_name: Keller orcid: 0000-0002-2261-958X - first_name: Sophia N. full_name: Karagiannis, Sophia N. last_name: Karagiannis orcid: 0000-0002-4100-7810 - first_name: Erika full_name: Jensen-Jarolim, Erika last_name: Jensen-Jarolim orcid: 0000-0003-4019-5765 citation: ama: 'Köhler VK, Crescioli S, Singer J, et al. Filling the antibody pipeline in allergy: PIPE cloning of IgE, IgG1 and IgG4 against the major birch pollen allergen Bet v 1. International Journal of Molecular Sciences. 2020;21(16). doi:10.3390/ijms21165693' apa: 'Köhler, V. K., Crescioli, S., Singer, J., Bax, H. J., Hofer, G., Pranger, C. L., … Jensen-Jarolim, E. (2020). Filling the antibody pipeline in allergy: PIPE cloning of IgE, IgG1 and IgG4 against the major birch pollen allergen Bet v 1. International Journal of Molecular Sciences. MDPI. https://doi.org/10.3390/ijms21165693' chicago: 'Köhler, Verena K., Silvia Crescioli, Judit Singer, Heather J. Bax, Gerhard Hofer, Christina L. Pranger, Karin Hufnagl, et al. “Filling the Antibody Pipeline in Allergy: PIPE Cloning of IgE, IgG1 and IgG4 against the Major Birch Pollen Allergen Bet v 1.” International Journal of Molecular Sciences. MDPI, 2020. https://doi.org/10.3390/ijms21165693.' ieee: 'V. K. Köhler et al., “Filling the antibody pipeline in allergy: PIPE cloning of IgE, IgG1 and IgG4 against the major birch pollen allergen Bet v 1,” International Journal of Molecular Sciences, vol. 21, no. 16. MDPI, 2020.' ista: 'Köhler VK, Crescioli S, Singer J, Bax HJ, Hofer G, Pranger CL, Hufnagl K, Bianchini R, Flicker S, Keller W, Karagiannis SN, Jensen-Jarolim E. 2020. Filling the antibody pipeline in allergy: PIPE cloning of IgE, IgG1 and IgG4 against the major birch pollen allergen Bet v 1. International Journal of Molecular Sciences. 21(16), 5693.' mla: 'Köhler, Verena K., et al. “Filling the Antibody Pipeline in Allergy: PIPE Cloning of IgE, IgG1 and IgG4 against the Major Birch Pollen Allergen Bet v 1.” International Journal of Molecular Sciences, vol. 21, no. 16, 5693, MDPI, 2020, doi:10.3390/ijms21165693.' short: V.K. Köhler, S. Crescioli, J. Singer, H.J. Bax, G. Hofer, C.L. Pranger, K. Hufnagl, R. Bianchini, S. Flicker, W. Keller, S.N. Karagiannis, E. Jensen-Jarolim, International Journal of Molecular Sciences 21 (2020). date_created: 2020-08-10T11:47:29Z date_published: 2020-08-08T00:00:00Z date_updated: 2021-01-12T08:17:34Z day: '08' ddc: - '570' doi: 10.3390/ijms21165693 extern: '1' external_id: pmid: - '32784509' file: - access_level: open_access checksum: dac7ccef7cdcea9be292664d8c488425 content_type: application/pdf creator: dernst date_created: 2020-09-10T07:06:22Z date_updated: 2020-09-10T07:06:22Z file_id: '8356' file_name: 2020_IntMolecSciences_Koehler.pdf file_size: 2680908 relation: main_file success: 1 file_date_updated: 2020-09-10T07:06:22Z has_accepted_license: '1' intvolume: ' 21' issue: '16' language: - iso: eng month: '08' oa: 1 oa_version: Published Version pmid: 1 publication: International Journal of Molecular Sciences publication_identifier: issn: - 1422-0067 publication_status: published publisher: MDPI quality_controlled: '1' status: public title: 'Filling the antibody pipeline in allergy: PIPE cloning of IgE, IgG1 and IgG4 against the major birch pollen allergen Bet v 1' tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 21 year: '2020' ... --- _id: '8226' article_processing_charge: No article_type: letter_note author: - first_name: Jelena full_name: Gotovina, Jelena last_name: Gotovina orcid: 0000-0003-1503-5276 - first_name: Rodolfo full_name: Bianchini, Rodolfo last_name: Bianchini orcid: 0000-0003-0351-6937 - first_name: Judit full_name: Fazekas-Singer, Judit id: 36432834-F248-11E8-B48F-1D18A9856A87 last_name: Fazekas-Singer orcid: 0000-0002-8777-3502 - first_name: Ina full_name: Herrmann, Ina last_name: Herrmann orcid: 0000-0003-2772-9144 - first_name: Giulia full_name: Pellizzari, Giulia last_name: Pellizzari orcid: 0000-0003-0387-1912 - first_name: Ian D. full_name: Haidl, Ian D. last_name: Haidl orcid: 0000-0002-5301-0822 - first_name: Karin full_name: Hufnagl, Karin last_name: Hufnagl orcid: 0000-0002-2288-2468 - first_name: Sophia N. full_name: Karagiannis, Sophia N. last_name: Karagiannis orcid: 0000-0002-4100-7810 - first_name: Jean S. full_name: Marshall, Jean S. last_name: Marshall orcid: 0000-0002-5642-1379 - first_name: Erika full_name: Jensen‐Jarolim, Erika last_name: Jensen‐Jarolim orcid: 0000-0003-4019-5765 citation: ama: Gotovina J, Bianchini R, Singer J, et al. Epinephrine drives human M2a allergic macrophages to a regulatory phenotype reducing mast cell degranulation in vitro. Allergy. 2020. doi:10.1111/all.14299 apa: Gotovina, J., Bianchini, R., Singer, J., Herrmann, I., Pellizzari, G., Haidl, I. D., … Jensen‐Jarolim, E. (2020). Epinephrine drives human M2a allergic macrophages to a regulatory phenotype reducing mast cell degranulation in vitro. Allergy. Wiley. https://doi.org/10.1111/all.14299 chicago: Gotovina, Jelena, Rodolfo Bianchini, Judit Singer, Ina Herrmann, Giulia Pellizzari, Ian D. Haidl, Karin Hufnagl, Sophia N. Karagiannis, Jean S. Marshall, and Erika Jensen‐Jarolim. “Epinephrine Drives Human M2a Allergic Macrophages to a Regulatory Phenotype Reducing Mast Cell Degranulation in Vitro.” Allergy. Wiley, 2020. https://doi.org/10.1111/all.14299. ieee: J. Gotovina et al., “Epinephrine drives human M2a allergic macrophages to a regulatory phenotype reducing mast cell degranulation in vitro,” Allergy. Wiley, 2020. ista: Gotovina J, Bianchini R, Singer J, Herrmann I, Pellizzari G, Haidl ID, Hufnagl K, Karagiannis SN, Marshall JS, Jensen‐Jarolim E. 2020. Epinephrine drives human M2a allergic macrophages to a regulatory phenotype reducing mast cell degranulation in vitro. Allergy. mla: Gotovina, Jelena, et al. “Epinephrine Drives Human M2a Allergic Macrophages to a Regulatory Phenotype Reducing Mast Cell Degranulation in Vitro.” Allergy, Wiley, 2020, doi:10.1111/all.14299. short: J. Gotovina, R. Bianchini, J. Singer, I. Herrmann, G. Pellizzari, I.D. Haidl, K. Hufnagl, S.N. Karagiannis, J.S. Marshall, E. Jensen‐Jarolim, Allergy (2020). date_created: 2020-08-10T11:50:30Z date_published: 2020-04-04T00:00:00Z date_updated: 2021-01-12T08:17:35Z day: '04' doi: 10.1111/all.14299 extern: '1' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.1111/all.14299 month: '04' oa: 1 oa_version: Published Version publication: Allergy publication_identifier: issn: - 0105-4538 - 1398-9995 publication_status: epub_ahead publisher: Wiley quality_controlled: '1' status: public title: Epinephrine drives human M2a allergic macrophages to a regulatory phenotype reducing mast cell degranulation in vitro type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2020' ...