[{"external_id":{"isi":["000552662100001"],"pmid":["32654637"]},"quality_controlled":"1","scopus_import":"1","oa_version":"Published Version","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","day":"12","pmid":1,"article_processing_charge":"No","language":[{"iso":"eng"}],"year":"2020","status":"public","month":"07","isi":1,"publication":"Philosophical Transactions of the Royal Society. Series B: Biological sciences","doi":"10.1098/rstb.2019.0528","project":[{"_id":"265B41B8-B435-11E9-9278-68D0E5697425","name":"Theoretical and empirical approaches to understanding Parallel Adaptation","call_identifier":"H2020","grant_number":"797747"}],"oa":1,"volume":375,"date_updated":"2023-08-22T08:21:31Z","abstract":[{"text":"Speciation, that is, the evolution of reproductive barriers eventually leading to complete isolation, is a crucial process generating biodiversity. Recent work has contributed much to our understanding of how reproductive barriers begin to evolve, and how they are maintained in the face of gene flow. However, little is known about the transition from partial to strong reproductive isolation (RI) and the completion of speciation. We argue that the evolution of strong RI is likely to involve different processes, or new interactions among processes, compared with the evolution of the first reproductive barriers. Transition to strong RI may be brought about by changing external conditions, for example, following secondary contact. However, the increasing levels of RI themselves create opportunities for new barriers to evolve and, and interaction or coupling among barriers. These changing processes may depend on genomic architecture and leave detectable signals in the genome. We outline outstanding questions and suggest more theoretical and empirical work, considering both patterns and processes associated with strong RI, is needed to understand how speciation is completed.","lang":"eng"}],"article_number":"20190528","article_type":"original","issue":"1806","main_file_link":[{"url":"https://doi.org/10.1098/rstb.2019.0528","open_access":"1"}],"author":[{"last_name":"Kulmuni","first_name":"Jonna","full_name":"Kulmuni, Jonna"},{"full_name":"Butlin, Roger K.","first_name":"Roger K.","last_name":"Butlin"},{"last_name":"Lucek","first_name":"Kay","full_name":"Lucek, Kay"},{"full_name":"Savolainen, Vincent","first_name":"Vincent","last_name":"Savolainen"},{"id":"3C147470-F248-11E8-B48F-1D18A9856A87","last_name":"Westram","full_name":"Westram, Anja M","first_name":"Anja M","orcid":"0000-0003-1050-4969"}],"publication_identifier":{"eissn":["1471-2970"],"issn":["0962-8436"]},"intvolume":"       375","type":"journal_article","publisher":"The Royal Society","department":[{"_id":"NiBa"}],"publication_status":"published","citation":{"ista":"Kulmuni J, Butlin RK, Lucek K, Savolainen V, Westram AM. 2020. Towards the completion of speciation: The evolution of reproductive isolation beyond the first barriers. Philosophical Transactions of the Royal Society. Series B: Biological sciences. 375(1806), 20190528.","chicago":"Kulmuni, Jonna, Roger K. Butlin, Kay Lucek, Vincent Savolainen, and Anja M Westram. “Towards the Completion of Speciation: The Evolution of Reproductive Isolation beyond the First Barriers.” <i>Philosophical Transactions of the Royal Society. Series B: Biological Sciences</i>. The Royal Society, 2020. <a href=\"https://doi.org/10.1098/rstb.2019.0528\">https://doi.org/10.1098/rstb.2019.0528</a>.","mla":"Kulmuni, Jonna, et al. “Towards the Completion of Speciation: The Evolution of Reproductive Isolation beyond the First Barriers.” <i>Philosophical Transactions of the Royal Society. Series B: Biological Sciences</i>, vol. 375, no. 1806, 20190528, The Royal Society, 2020, doi:<a href=\"https://doi.org/10.1098/rstb.2019.0528\">10.1098/rstb.2019.0528</a>.","short":"J. Kulmuni, R.K. Butlin, K. Lucek, V. Savolainen, A.M. Westram, Philosophical Transactions of the Royal Society. Series B: Biological Sciences 375 (2020).","ieee":"J. Kulmuni, R. K. Butlin, K. Lucek, V. Savolainen, and A. M. Westram, “Towards the completion of speciation: The evolution of reproductive isolation beyond the first barriers,” <i>Philosophical Transactions of the Royal Society. Series B: Biological sciences</i>, vol. 375, no. 1806. The Royal Society, 2020.","ama":"Kulmuni J, Butlin RK, Lucek K, Savolainen V, Westram AM. Towards the completion of speciation: The evolution of reproductive isolation beyond the first barriers. <i>Philosophical Transactions of the Royal Society Series B: Biological sciences</i>. 2020;375(1806). doi:<a href=\"https://doi.org/10.1098/rstb.2019.0528\">10.1098/rstb.2019.0528</a>","apa":"Kulmuni, J., Butlin, R. K., Lucek, K., Savolainen, V., &#38; Westram, A. M. (2020). Towards the completion of speciation: The evolution of reproductive isolation beyond the first barriers. <i>Philosophical Transactions of the Royal Society. Series B: Biological Sciences</i>. The Royal Society. <a href=\"https://doi.org/10.1098/rstb.2019.0528\">https://doi.org/10.1098/rstb.2019.0528</a>"},"date_created":"2020-07-26T22:01:01Z","date_published":"2020-07-12T00:00:00Z","_id":"8168","ec_funded":1,"title":"Towards the completion of speciation: The evolution of reproductive isolation beyond the first barriers"},{"type":"journal_article","intvolume":"       125","publication_identifier":{"issn":["00319007"],"eissn":["10797114"]},"author":[{"first_name":"Adam S.","full_name":"Chatterley, Adam S.","last_name":"Chatterley"},{"last_name":"Christiansen","first_name":"Lars","full_name":"Christiansen, Lars"},{"full_name":"Schouder, Constant A.","first_name":"Constant A.","last_name":"Schouder"},{"last_name":"Jørgensen","first_name":"Anders V.","full_name":"Jørgensen, Anders V."},{"last_name":"Shepperson","first_name":"Benjamin","full_name":"Shepperson, Benjamin"},{"last_name":"Cherepanov","id":"339C7E5A-F248-11E8-B48F-1D18A9856A87","first_name":"Igor","full_name":"Cherepanov, Igor"},{"last_name":"Bighin","id":"4CA96FD4-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8823-9777","full_name":"Bighin, Giacomo","first_name":"Giacomo"},{"first_name":"Robert E.","full_name":"Zillich, Robert E.","last_name":"Zillich"},{"first_name":"Mikhail","full_name":"Lemeshko, Mikhail","orcid":"0000-0002-6990-7802","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","last_name":"Lemeshko"},{"last_name":"Stapelfeldt","full_name":"Stapelfeldt, Henrik","first_name":"Henrik"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2006.02694"}],"acknowledgement":"H. S. acknowledges support from the European Research Council-AdG (Project No. 320459, DropletControl)\r\nand from The Villum Foundation through a Villum Investigator Grant No. 25886. M. L. acknowledges support\r\nby the Austrian Science Fund (FWF), under Project No. P29902-N27, and by the European Research Council\r\n(ERC) Starting Grant No. 801770 (ANGULON). G. B. acknowledges support from the Austrian Science Fund\r\n(FWF), under Project No. M2641-N27. I. C. acknowledges support by the European Union’s Horizon 2020 research and\r\ninnovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385. Computational resources for\r\nthe PIMC simulations were provided by the division for scientific computing at the Johannes Kepler University.","issue":"1","abstract":[{"text":"Alignment of OCS, CS2, and I2 molecules embedded in helium nanodroplets is measured as a function\r\nof time following rotational excitation by a nonresonant, comparatively weak ps laser pulse. The distinct\r\npeaks in the power spectra, obtained by Fourier analysis, are used to determine the rotational, B, and\r\ncentrifugal distortion, D, constants. For OCS, B and D match the values known from IR spectroscopy. For\r\nCS2 and I2, they are the first experimental results reported. The alignment dynamics calculated from the\r\ngas-phase rotational Schrödinger equation, using the experimental in-droplet B and D values, agree in\r\ndetail with the measurement for all three molecules. The rotational spectroscopy technique for molecules in\r\nhelium droplets introduced here should apply to a range of molecules and complexes.","lang":"eng"}],"article_type":"original","article_number":"013001","date_updated":"2024-08-07T07:16:52Z","title":"Rotational coherence spectroscopy of molecules in Helium nanodroplets: Reconciling the time and the frequency domains","ec_funded":1,"_id":"8170","date_published":"2020-07-03T00:00:00Z","date_created":"2020-07-26T22:01:02Z","publication_status":"published","citation":{"ista":"Chatterley AS, Christiansen L, Schouder CA, Jørgensen AV, Shepperson B, Cherepanov I, Bighin G, Zillich RE, Lemeshko M, Stapelfeldt H. 2020. Rotational coherence spectroscopy of molecules in Helium nanodroplets: Reconciling the time and the frequency domains. Physical Review Letters. 125(1), 013001.","short":"A.S. Chatterley, L. Christiansen, C.A. Schouder, A.V. Jørgensen, B. Shepperson, I. Cherepanov, G. Bighin, R.E. Zillich, M. Lemeshko, H. Stapelfeldt, Physical Review Letters 125 (2020).","chicago":"Chatterley, Adam S., Lars Christiansen, Constant A. Schouder, Anders V. Jørgensen, Benjamin Shepperson, Igor Cherepanov, Giacomo Bighin, Robert E. Zillich, Mikhail Lemeshko, and Henrik Stapelfeldt. “Rotational Coherence Spectroscopy of Molecules in Helium Nanodroplets: Reconciling the Time and the Frequency Domains.” <i>Physical Review Letters</i>. American Physical Society, 2020. <a href=\"https://doi.org/10.1103/PhysRevLett.125.013001\">https://doi.org/10.1103/PhysRevLett.125.013001</a>.","mla":"Chatterley, Adam S., et al. “Rotational Coherence Spectroscopy of Molecules in Helium Nanodroplets: Reconciling the Time and the Frequency Domains.” <i>Physical Review Letters</i>, vol. 125, no. 1, 013001, American Physical Society, 2020, doi:<a href=\"https://doi.org/10.1103/PhysRevLett.125.013001\">10.1103/PhysRevLett.125.013001</a>.","apa":"Chatterley, A. S., Christiansen, L., Schouder, C. A., Jørgensen, A. V., Shepperson, B., Cherepanov, I., … Stapelfeldt, H. (2020). Rotational coherence spectroscopy of molecules in Helium nanodroplets: Reconciling the time and the frequency domains. <i>Physical Review Letters</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevLett.125.013001\">https://doi.org/10.1103/PhysRevLett.125.013001</a>","ieee":"A. S. Chatterley <i>et al.</i>, “Rotational coherence spectroscopy of molecules in Helium nanodroplets: Reconciling the time and the frequency domains,” <i>Physical Review Letters</i>, vol. 125, no. 1. American Physical Society, 2020.","ama":"Chatterley AS, Christiansen L, Schouder CA, et al. Rotational coherence spectroscopy of molecules in Helium nanodroplets: Reconciling the time and the frequency domains. <i>Physical Review Letters</i>. 2020;125(1). doi:<a href=\"https://doi.org/10.1103/PhysRevLett.125.013001\">10.1103/PhysRevLett.125.013001</a>"},"department":[{"_id":"MiLe"}],"publisher":"American Physical Society","month":"07","language":[{"iso":"eng"}],"year":"2020","status":"public","article_processing_charge":"No","day":"03","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","oa_version":"Preprint","scopus_import":"1","quality_controlled":"1","external_id":{"arxiv":["2006.02694"],"isi":["000544526900006"]},"volume":125,"oa":1,"project":[{"_id":"26031614-B435-11E9-9278-68D0E5697425","name":"Quantum rotations in the presence of a many-body environment","call_identifier":"FWF","grant_number":"P29902"},{"name":"Angulon: physics and applications of a new quasiparticle","_id":"2688CF98-B435-11E9-9278-68D0E5697425","grant_number":"801770","call_identifier":"H2020"},{"_id":"26986C82-B435-11E9-9278-68D0E5697425","name":"A path-integral approach to composite impurities","call_identifier":"FWF","grant_number":"M02641"},{"name":"International IST Doctoral Program","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","grant_number":"665385","call_identifier":"H2020"}],"doi":"10.1103/PhysRevLett.125.013001","arxiv":1,"publication":"Physical Review Letters","isi":1},{"file_date_updated":"2020-08-24T15:43:52Z","author":[{"last_name":"Hauschild","id":"4E01D6B4-F248-11E8-B48F-1D18A9856A87","first_name":"Robert","full_name":"Hauschild, Robert","orcid":"0000-0001-9843-3522"}],"date_updated":"2021-01-11T15:29:08Z","has_accepted_license":"1","type":"software","status":"public","year":"2020","month":"08","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"24","department":[{"_id":"Bio"}],"doi":"10.15479/AT:ISTA:8181","publisher":"IST Austria","file":[{"content_type":"text/plain","file_name":"centriolesDistance.m","date_created":"2020-08-24T15:43:49Z","creator":"rhauschild","success":1,"file_size":6577,"file_id":"8290","checksum":"878c60885ce30afb59a884dd5eef451c","date_updated":"2020-08-24T15:43:49Z","relation":"main_file","access_level":"open_access"},{"content_type":"text/plain","date_created":"2020-08-24T15:43:52Z","file_name":"goTracking.m","file_id":"8291","file_size":2680,"success":1,"creator":"rhauschild","access_level":"open_access","relation":"main_file","checksum":"5a93ac7be2b66b28e4bd8b113ee6aade","date_updated":"2020-08-24T15:43:52Z"}],"license":"https://opensource.org/licenses/BSD-3-Clause","tmp":{"name":"The 3-Clause BSD License","short":"3-Clause BSD","legal_code_url":"https://opensource.org/licenses/BSD-3-Clause"},"_id":"8181","date_published":"2020-08-24T00:00:00Z","title":"Amplified centrosomes in dendritic cells promote immune cell effector functions","oa":1,"date_created":"2020-07-28T16:24:37Z","citation":{"chicago":"Hauschild, Robert. “Amplified Centrosomes in Dendritic Cells Promote Immune Cell Effector Functions.” IST Austria, 2020. <a href=\"https://doi.org/10.15479/AT:ISTA:8181\">https://doi.org/10.15479/AT:ISTA:8181</a>.","mla":"Hauschild, Robert. <i>Amplified Centrosomes in Dendritic Cells Promote Immune Cell Effector Functions</i>. IST Austria, 2020, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:8181\">10.15479/AT:ISTA:8181</a>.","short":"R. Hauschild, (2020).","ama":"Hauschild R. Amplified centrosomes in dendritic cells promote immune cell effector functions. 2020. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:8181\">10.15479/AT:ISTA:8181</a>","ieee":"R. Hauschild, “Amplified centrosomes in dendritic cells promote immune cell effector functions.” IST Austria, 2020.","apa":"Hauschild, R. (2020). Amplified centrosomes in dendritic cells promote immune cell effector functions. IST Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:8181\">https://doi.org/10.15479/AT:ISTA:8181</a>","ista":"Hauschild R. 2020. Amplified centrosomes in dendritic cells promote immune cell effector functions, IST Austria, <a href=\"https://doi.org/10.15479/AT:ISTA:8181\">10.15479/AT:ISTA:8181</a>."}},{"oa":1,"doi":"10.1109/CVPR42600.2020.00752","publication":"Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition","arxiv":1,"month":"07","article_processing_charge":"No","year":"2020","status":"public","language":[{"iso":"eng"}],"day":"01","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Submitted Version","scopus_import":"1","quality_controlled":"1","external_id":{"arxiv":["2004.04180"]},"has_accepted_license":"1","title":"Leveraging 2D data to learn textured 3D mesh generation","date_published":"2020-07-01T00:00:00Z","_id":"8186","citation":{"apa":"Henderson, P. M., Tsiminaki, V., &#38; Lampert, C. (2020). Leveraging 2D data to learn textured 3D mesh generation. In <i>Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition</i> (pp. 7498–7507). Virtual: IEEE. <a href=\"https://doi.org/10.1109/CVPR42600.2020.00752\">https://doi.org/10.1109/CVPR42600.2020.00752</a>","ieee":"P. M. Henderson, V. Tsiminaki, and C. Lampert, “Leveraging 2D data to learn textured 3D mesh generation,” in <i>Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition</i>, Virtual, 2020, pp. 7498–7507.","ama":"Henderson PM, Tsiminaki V, Lampert C. Leveraging 2D data to learn textured 3D mesh generation. In: <i>Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition</i>. IEEE; 2020:7498-7507. doi:<a href=\"https://doi.org/10.1109/CVPR42600.2020.00752\">10.1109/CVPR42600.2020.00752</a>","short":"P.M. Henderson, V. Tsiminaki, C. Lampert, in:, Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, IEEE, 2020, pp. 7498–7507.","mla":"Henderson, Paul M., et al. “Leveraging 2D Data to Learn Textured 3D Mesh Generation.” <i>Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition</i>, IEEE, 2020, pp. 7498–507, doi:<a href=\"https://doi.org/10.1109/CVPR42600.2020.00752\">10.1109/CVPR42600.2020.00752</a>.","chicago":"Henderson, Paul M, Vagia Tsiminaki, and Christoph Lampert. “Leveraging 2D Data to Learn Textured 3D Mesh Generation.” In <i>Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition</i>, 7498–7507. IEEE, 2020. <a href=\"https://doi.org/10.1109/CVPR42600.2020.00752\">https://doi.org/10.1109/CVPR42600.2020.00752</a>.","ista":"Henderson PM, Tsiminaki V, Lampert C. 2020. Leveraging 2D data to learn textured 3D mesh generation. Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. CVPR: Conference on Computer Vision and Pattern Recognition, 7498–7507."},"publication_status":"published","date_created":"2020-07-31T16:53:49Z","publisher":"IEEE","department":[{"_id":"ChLa"}],"file":[{"file_name":"paper.pdf","date_created":"2020-07-31T16:57:12Z","content_type":"application/pdf","date_updated":"2020-07-31T16:57:12Z","relation":"main_file","access_level":"open_access","creator":"phenders","success":1,"file_size":10262773,"file_id":"8187"}],"type":"conference","ddc":["004"],"publication_identifier":{"eissn":["2575-7075"],"eisbn":["9781728171685"]},"author":[{"id":"13C09E74-18D9-11E9-8878-32CFE5697425","last_name":"Henderson","first_name":"Paul M","full_name":"Henderson, Paul M","orcid":"0000-0002-5198-7445"},{"first_name":"Vagia","full_name":"Tsiminaki, Vagia","last_name":"Tsiminaki"},{"id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","last_name":"Lampert","first_name":"Christoph","full_name":"Lampert, Christoph","orcid":"0000-0001-8622-7887"}],"main_file_link":[{"url":"https://openaccess.thecvf.com/content_CVPR_2020/papers/Henderson_Leveraging_2D_Data_to_Learn_Textured_3D_Mesh_Generation_CVPR_2020_paper.pdf","open_access":"1"}],"file_date_updated":"2020-07-31T16:57:12Z","conference":{"location":"Virtual","name":"CVPR: Conference on Computer Vision and Pattern Recognition","end_date":"2020-06-19","start_date":"2020-06-14"},"page":"7498-7507","abstract":[{"text":"Numerous methods have been proposed for probabilistic generative modelling of\r\n3D objects. However, none of these is able to produce textured objects, which\r\nrenders them of limited use for practical tasks. In this work, we present the\r\nfirst generative model of textured 3D meshes. Training such a model would\r\ntraditionally require a large dataset of textured meshes, but unfortunately,\r\nexisting datasets of meshes lack detailed textures. We instead propose a new\r\ntraining methodology that allows learning from collections of 2D images without\r\nany 3D information. To do so, we train our model to explain a distribution of\r\nimages by modelling each image as a 3D foreground object placed in front of a\r\n2D background. Thus, it learns to generate meshes that when rendered, produce\r\nimages similar to those in its training set.\r\n  A well-known problem when generating meshes with deep networks is the\r\nemergence of self-intersections, which are problematic for many use-cases. As a\r\nsecond contribution we therefore introduce a new generation process for 3D\r\nmeshes that guarantees no self-intersections arise, based on the physical\r\nintuition that faces should push one another out of the way as they move.\r\n  We conduct extensive experiments on our approach, reporting quantitative and\r\nqualitative results on both synthetic data and natural images. These show our\r\nmethod successfully learns to generate plausible and diverse textured 3D\r\nsamples for five challenging object classes.","lang":"eng"}],"date_updated":"2023-10-17T07:37:11Z"},{"page":"3106–3117","abstract":[{"text":"A natural approach to generative modeling of videos is to represent them as a composition of moving objects. Recent works model a set of 2D sprites over a slowly-varying background, but without considering the underlying 3D scene that\r\ngives rise to them. We instead propose to model a video as the view seen while moving through a scene with multiple 3D objects and a 3D background. Our model is trained from monocular videos without any supervision, yet learns to\r\ngenerate coherent 3D scenes containing several moving objects. We conduct detailed experiments on two datasets, going beyond the visual complexity supported by state-of-the-art generative approaches. We evaluate our method on\r\ndepth-prediction and 3D object detection---tasks which cannot be addressed by those earlier works---and show it out-performs them even on 2D instance segmentation and tracking.","lang":"eng"}],"conference":{"location":"Vancouver, Canada","name":"NeurIPS: Neural Information Processing Systems","end_date":"2020-12-12","start_date":"2020-12-06"},"date_updated":"2023-04-25T09:49:58Z","acknowledgement":"This research was supported by the Scientific Service Units (SSU) of IST Austria through resources\r\nprovided by Scientific Computing (SciComp). PH is employed part-time by Blackford Analysis, but\r\nthey did not support this project in any way.","author":[{"orcid":"0000-0002-5198-7445","full_name":"Henderson, Paul M","first_name":"Paul M","last_name":"Henderson","id":"13C09E74-18D9-11E9-8878-32CFE5697425"},{"id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","last_name":"Lampert","orcid":"0000-0001-8622-7887","full_name":"Lampert, Christoph","first_name":"Christoph"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2007.06705"}],"publication_identifier":{"isbn":["9781713829546"]},"type":"conference","intvolume":"        33","department":[{"_id":"ChLa"}],"publisher":"Curran Associates","date_created":"2020-07-31T16:59:19Z","publication_status":"published","citation":{"short":"P.M. Henderson, C. Lampert, in:, 34th Conference on Neural Information Processing Systems, Curran Associates, 2020, pp. 3106–3117.","chicago":"Henderson, Paul M, and Christoph Lampert. “Unsupervised Object-Centric Video Generation and Decomposition in 3D.” In <i>34th Conference on Neural Information Processing Systems</i>, 33:3106–3117. Curran Associates, 2020.","mla":"Henderson, Paul M., and Christoph Lampert. “Unsupervised Object-Centric Video Generation and Decomposition in 3D.” <i>34th Conference on Neural Information Processing Systems</i>, vol. 33, Curran Associates, 2020, pp. 3106–3117.","apa":"Henderson, P. M., &#38; Lampert, C. (2020). Unsupervised object-centric video generation and decomposition in 3D. In <i>34th Conference on Neural Information Processing Systems</i> (Vol. 33, pp. 3106–3117). Vancouver, Canada: Curran Associates.","ieee":"P. M. Henderson and C. Lampert, “Unsupervised object-centric video generation and decomposition in 3D,” in <i>34th Conference on Neural Information Processing Systems</i>, Vancouver, Canada, 2020, vol. 33, pp. 3106–3117.","ama":"Henderson PM, Lampert C. Unsupervised object-centric video generation and decomposition in 3D. In: <i>34th Conference on Neural Information Processing Systems</i>. Vol 33. Curran Associates; 2020:3106–3117.","ista":"Henderson PM, Lampert C. 2020. Unsupervised object-centric video generation and decomposition in 3D. 34th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems vol. 33, 3106–3117."},"title":"Unsupervised object-centric video generation and decomposition in 3D","_id":"8188","date_published":"2020-07-07T00:00:00Z","quality_controlled":"1","external_id":{"arxiv":["2007.06705"]},"oa_version":"Preprint","day":"07","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"07","status":"public","language":[{"iso":"eng"}],"year":"2020","article_processing_charge":"No","arxiv":1,"publication":"34th Conference on Neural Information Processing Systems","acknowledged_ssus":[{"_id":"ScienComp"}],"volume":33,"oa":1},{"oa":1,"volume":219,"doi":"10.1083/jcb.202007029","publication":"The Journal of Cell Biology","isi":1,"month":"07","article_processing_charge":"No","year":"2020","language":[{"iso":"eng"}],"status":"public","day":"22","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","scopus_import":"1","external_id":{"isi":["000573631000004"]},"has_accepted_license":"1","title":"Zena Werb (1945-2020): Cell biology in context","_id":"8190","date_published":"2020-07-22T00:00:00Z","publication_status":"published","citation":{"ista":"Sixt MK, Huttenlocher A. 2020. Zena Werb (1945-2020): Cell biology in context. The Journal of Cell Biology. 219(8), e202007029.","ieee":"M. K. Sixt and A. Huttenlocher, “Zena Werb (1945-2020): Cell biology in context,” <i>The Journal of Cell Biology</i>, vol. 219, no. 8. Rockefeller University Press, 2020.","ama":"Sixt MK, Huttenlocher A. Zena Werb (1945-2020): Cell biology in context. <i>The Journal of Cell Biology</i>. 2020;219(8). doi:<a href=\"https://doi.org/10.1083/jcb.202007029\">10.1083/jcb.202007029</a>","apa":"Sixt, M. K., &#38; Huttenlocher, A. (2020). Zena Werb (1945-2020): Cell biology in context. <i>The Journal of Cell Biology</i>. Rockefeller University Press. <a href=\"https://doi.org/10.1083/jcb.202007029\">https://doi.org/10.1083/jcb.202007029</a>","chicago":"Sixt, Michael K, and Anna Huttenlocher. “Zena Werb (1945-2020): Cell Biology in Context.” <i>The Journal of Cell Biology</i>. Rockefeller University Press, 2020. <a href=\"https://doi.org/10.1083/jcb.202007029\">https://doi.org/10.1083/jcb.202007029</a>.","mla":"Sixt, Michael K., and Anna Huttenlocher. “Zena Werb (1945-2020): Cell Biology in Context.” <i>The Journal of Cell Biology</i>, vol. 219, no. 8, e202007029, Rockefeller University Press, 2020, doi:<a href=\"https://doi.org/10.1083/jcb.202007029\">10.1083/jcb.202007029</a>.","short":"M.K. Sixt, A. Huttenlocher, The Journal of Cell Biology 219 (2020)."},"date_created":"2020-08-02T22:00:57Z","publisher":"Rockefeller University Press","department":[{"_id":"MiSi"}],"tmp":{"short":"CC BY-NC-SA (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode","image":"/images/cc_by_nc_sa.png","name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)"},"license":"https://creativecommons.org/licenses/by-nc-sa/4.0/","file":[{"date_created":"2020-08-04T13:11:52Z","file_name":"2020_JCB_Sixt.pdf","content_type":"application/pdf","embargo":"2021-02-01","relation":"main_file","access_level":"open_access","date_updated":"2021-02-02T23:30:03Z","checksum":"30016d778d266b8e17d01094917873b8","creator":"dernst","file_id":"8200","file_size":830725}],"intvolume":"       219","type":"journal_article","ddc":["570"],"publication_identifier":{"eissn":["1540-8140"]},"author":[{"orcid":"0000-0002-6620-9179","full_name":"Sixt, Michael K","first_name":"Michael K","last_name":"Sixt","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Huttenlocher, Anna","first_name":"Anna","last_name":"Huttenlocher"}],"issue":"8","file_date_updated":"2021-02-02T23:30:03Z","article_type":"letter_note","article_number":"e202007029","date_updated":"2023-10-17T10:04:49Z"},{"quality_controlled":"1","external_id":{"isi":["000884318000002"]},"oa_version":"Published Version","scopus_import":"1","day":"24","alternative_title":["LNCS"],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","month":"06","language":[{"iso":"eng"}],"status":"public","year":"2020","article_processing_charge":"No","publication":"Automated Reasoning","isi":1,"project":[{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"The Wittgenstein Prize","call_identifier":"FWF","grant_number":"Z211"}],"doi":"10.1007/978-3-030-51074-9_2","volume":12166,"oa":1,"abstract":[{"text":"Fixed-point arithmetic is a popular alternative to floating-point arithmetic on embedded systems. Existing work on the verification of fixed-point programs relies on custom formalizations of fixed-point arithmetic, which makes it hard to compare the described techniques or reuse the implementations. In this paper, we address this issue by proposing and formalizing an SMT theory of fixed-point arithmetic. We present an intuitive yet comprehensive syntax of the fixed-point theory, and provide formal semantics for it based on rational arithmetic. We also describe two decision procedures for this theory: one based on the theory of bit-vectors and the other on the theory of reals. We implement the two decision procedures, and evaluate our implementations using existing mature SMT solvers on a benchmark suite we created. Finally, we perform a case study of using the theory we propose to verify properties of quantized neural networks.","lang":"eng"}],"page":"13-31","conference":{"name":"IJCAR: International Joint Conference on Automated Reasoning","location":"Paris, France","start_date":"2020-07-01","end_date":"2020-07-04"},"date_updated":"2023-08-22T08:27:25Z","author":[{"full_name":"Baranowski, Marek","first_name":"Marek","last_name":"Baranowski"},{"last_name":"He","first_name":"Shaobo","full_name":"He, Shaobo"},{"id":"3DC22916-F248-11E8-B48F-1D18A9856A87","last_name":"Lechner","full_name":"Lechner, Mathias","first_name":"Mathias"},{"last_name":"Nguyen","first_name":"Thanh Son","full_name":"Nguyen, Thanh Son"},{"last_name":"Rakamarić","first_name":"Zvonimir","full_name":"Rakamarić, Zvonimir"}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1007/978-3-030-51074-9_2"}],"publication_identifier":{"isbn":["9783030510732"],"issn":["03029743"],"eissn":["16113349"]},"type":"conference","intvolume":"     12166","department":[{"_id":"ToHe"}],"publisher":"Springer Nature","date_created":"2020-08-02T22:00:59Z","publication_status":"published","citation":{"ista":"Baranowski M, He S, Lechner M, Nguyen TS, Rakamarić Z. 2020. An SMT theory of fixed-point arithmetic. Automated Reasoning. IJCAR: International Joint Conference on Automated Reasoning, LNCS, vol. 12166, 13–31.","short":"M. Baranowski, S. He, M. Lechner, T.S. Nguyen, Z. Rakamarić, in:, Automated Reasoning, Springer Nature, 2020, pp. 13–31.","mla":"Baranowski, Marek, et al. “An SMT Theory of Fixed-Point Arithmetic.” <i>Automated Reasoning</i>, vol. 12166, Springer Nature, 2020, pp. 13–31, doi:<a href=\"https://doi.org/10.1007/978-3-030-51074-9_2\">10.1007/978-3-030-51074-9_2</a>.","chicago":"Baranowski, Marek, Shaobo He, Mathias Lechner, Thanh Son Nguyen, and Zvonimir Rakamarić. “An SMT Theory of Fixed-Point Arithmetic.” In <i>Automated Reasoning</i>, 12166:13–31. Springer Nature, 2020. <a href=\"https://doi.org/10.1007/978-3-030-51074-9_2\">https://doi.org/10.1007/978-3-030-51074-9_2</a>.","apa":"Baranowski, M., He, S., Lechner, M., Nguyen, T. S., &#38; Rakamarić, Z. (2020). An SMT theory of fixed-point arithmetic. In <i>Automated Reasoning</i> (Vol. 12166, pp. 13–31). Paris, France: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-51074-9_2\">https://doi.org/10.1007/978-3-030-51074-9_2</a>","ama":"Baranowski M, He S, Lechner M, Nguyen TS, Rakamarić Z. An SMT theory of fixed-point arithmetic. In: <i>Automated Reasoning</i>. Vol 12166. Springer Nature; 2020:13-31. doi:<a href=\"https://doi.org/10.1007/978-3-030-51074-9_2\">10.1007/978-3-030-51074-9_2</a>","ieee":"M. Baranowski, S. He, M. Lechner, T. S. Nguyen, and Z. Rakamarić, “An SMT theory of fixed-point arithmetic,” in <i>Automated Reasoning</i>, Paris, France, 2020, vol. 12166, pp. 13–31."},"title":"An SMT theory of fixed-point arithmetic","_id":"8194","date_published":"2020-06-24T00:00:00Z"},{"date_updated":"2023-09-07T13:18:00Z","abstract":[{"lang":"eng","text":"This paper presents a foundation for refining concurrent programs with structured control flow. The verification problem is decomposed into subproblems that aid interactive program development, proof reuse, and automation. The formalization in this paper is the basis of a new design and implementation of the Civl verifier."}],"page":"275-298","file_date_updated":"2020-08-06T08:14:54Z","author":[{"last_name":"Kragl","id":"320FC952-F248-11E8-B48F-1D18A9856A87","first_name":"Bernhard","full_name":"Kragl, Bernhard","orcid":"0000-0001-7745-9117"},{"first_name":"Shaz","full_name":"Qadeer, Shaz","last_name":"Qadeer"},{"orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger"}],"acknowledgement":"Bernhard Kragl and Thomas A. Henzinger were supported by\r\nthe Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award).","publication_identifier":{"eissn":["1611-3349"],"eisbn":["9783030532888"],"isbn":["9783030532871"],"issn":["0302-9743"]},"ddc":["000"],"type":"conference","intvolume":"     12224","license":"https://creativecommons.org/licenses/by/4.0/","file":[{"content_type":"application/pdf","date_created":"2020-08-06T08:14:54Z","file_name":"2020_LNCS_Kragl.pdf","file_size":804237,"success":1,"file_id":"8201","creator":"dernst","access_level":"open_access","relation":"main_file","date_updated":"2020-08-06T08:14:54Z"}],"tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"department":[{"_id":"ToHe"}],"publisher":"Springer Nature","date_created":"2020-08-03T11:45:35Z","citation":{"ista":"Kragl B, Qadeer S, Henzinger TA. 2020. Refinement for structured concurrent programs. Computer Aided Verification. , LNCS, vol. 12224, 275–298.","apa":"Kragl, B., Qadeer, S., &#38; Henzinger, T. A. (2020). Refinement for structured concurrent programs. In <i>Computer Aided Verification</i> (Vol. 12224, pp. 275–298). Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-53288-8_14\">https://doi.org/10.1007/978-3-030-53288-8_14</a>","ama":"Kragl B, Qadeer S, Henzinger TA. Refinement for structured concurrent programs. In: <i>Computer Aided Verification</i>. Vol 12224. Springer Nature; 2020:275-298. doi:<a href=\"https://doi.org/10.1007/978-3-030-53288-8_14\">10.1007/978-3-030-53288-8_14</a>","ieee":"B. Kragl, S. Qadeer, and T. A. Henzinger, “Refinement for structured concurrent programs,” in <i>Computer Aided Verification</i>, 2020, vol. 12224, pp. 275–298.","short":"B. Kragl, S. Qadeer, T.A. Henzinger, in:, Computer Aided Verification, Springer Nature, 2020, pp. 275–298.","mla":"Kragl, Bernhard, et al. “Refinement for Structured Concurrent Programs.” <i>Computer Aided Verification</i>, vol. 12224, Springer Nature, 2020, pp. 275–98, doi:<a href=\"https://doi.org/10.1007/978-3-030-53288-8_14\">10.1007/978-3-030-53288-8_14</a>.","chicago":"Kragl, Bernhard, Shaz Qadeer, and Thomas A Henzinger. “Refinement for Structured Concurrent Programs.” In <i>Computer Aided Verification</i>, 12224:275–98. Springer Nature, 2020. <a href=\"https://doi.org/10.1007/978-3-030-53288-8_14\">https://doi.org/10.1007/978-3-030-53288-8_14</a>."},"publication_status":"published","_id":"8195","date_published":"2020-07-14T00:00:00Z","title":"Refinement for structured concurrent programs","has_accepted_license":"1","external_id":{"isi":["000695276000014"]},"quality_controlled":"1","scopus_import":"1","related_material":{"record":[{"status":"public","id":"8332","relation":"dissertation_contains"}]},"oa_version":"Published Version","alternative_title":["LNCS"],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","day":"14","year":"2020","language":[{"iso":"eng"}],"status":"public","article_processing_charge":"No","month":"07","isi":1,"publication":"Computer Aided Verification","project":[{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"The Wittgenstein Prize","call_identifier":"FWF","grant_number":"Z211"}],"doi":"10.1007/978-3-030-53288-8_14","volume":12224,"oa":1},{"oa_version":"Preprint","scopus_import":"1","quality_controlled":"1","external_id":{"arxiv":["1903.04046"]},"month":"01","year":"2020","language":[{"iso":"eng"}],"status":"public","article_processing_charge":"No","day":"01","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.2140/paa.2020.2.35","arxiv":1,"publication":"Pure and Applied Analysis","volume":2,"oa":1,"author":[{"full_name":"Lewin, Mathieu","first_name":"Mathieu","last_name":"Lewin"},{"last_name":"Lieb","first_name":"Elliott H.","full_name":"Lieb, Elliott H."},{"last_name":"Seiringer","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","first_name":"Robert","full_name":"Seiringer, Robert","orcid":"0000-0002-6781-0521"}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.1903.04046"}],"issue":"1","page":"35-73","article_type":"original","abstract":[{"text":"We give the first mathematically rigorous justification of the local density approximation in density functional theory. We provide a quantitative estimate on the difference between the grand-canonical Levy–Lieb energy of a given density (the lowest possible energy of all quantum states having this density) and the integral over the uniform electron gas energy of this density. The error involves gradient terms and justifies the use of the local density approximation in the situation where the density is very flat on sufficiently large regions in space.","lang":"eng"}],"date_updated":"2024-01-29T09:01:12Z","intvolume":"         2","type":"journal_article","publication_identifier":{"eissn":["2578-5885"],"issn":["2578-5893"]},"department":[{"_id":"RoSe"}],"publisher":"Mathematical Sciences Publishers","title":" The local density approximation in density functional theory","_id":"14891","date_published":"2020-01-01T00:00:00Z","date_created":"2024-01-28T23:01:44Z","publication_status":"published","citation":{"ista":"Lewin M, Lieb EH, Seiringer R. 2020.  The local density approximation in density functional theory. Pure and Applied Analysis. 2(1), 35–73.","ama":"Lewin M, Lieb EH, Seiringer R.  The local density approximation in density functional theory. <i>Pure and Applied Analysis</i>. 2020;2(1):35-73. doi:<a href=\"https://doi.org/10.2140/paa.2020.2.35\">10.2140/paa.2020.2.35</a>","ieee":"M. Lewin, E. H. Lieb, and R. Seiringer, “ The local density approximation in density functional theory,” <i>Pure and Applied Analysis</i>, vol. 2, no. 1. Mathematical Sciences Publishers, pp. 35–73, 2020.","apa":"Lewin, M., Lieb, E. H., &#38; Seiringer, R. (2020).  The local density approximation in density functional theory. <i>Pure and Applied Analysis</i>. Mathematical Sciences Publishers. <a href=\"https://doi.org/10.2140/paa.2020.2.35\">https://doi.org/10.2140/paa.2020.2.35</a>","chicago":"Lewin, Mathieu, Elliott H. Lieb, and Robert Seiringer. “ The Local Density Approximation in Density Functional Theory.” <i>Pure and Applied Analysis</i>. Mathematical Sciences Publishers, 2020. <a href=\"https://doi.org/10.2140/paa.2020.2.35\">https://doi.org/10.2140/paa.2020.2.35</a>.","mla":"Lewin, Mathieu, et al. “ The Local Density Approximation in Density Functional Theory.” <i>Pure and Applied Analysis</i>, vol. 2, no. 1, Mathematical Sciences Publishers, 2020, pp. 35–73, doi:<a href=\"https://doi.org/10.2140/paa.2020.2.35\">10.2140/paa.2020.2.35</a>.","short":"M. Lewin, E.H. Lieb, R. Seiringer, Pure and Applied Analysis 2 (2020) 35–73."}},{"issue":"21","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1016/j.jmb.2020.09.001"}],"author":[{"last_name":"Rosa","first_name":"Higor Vinícius Dias","full_name":"Rosa, Higor Vinícius Dias"},{"full_name":"Leonardo, Diego Antonio","first_name":"Diego Antonio","last_name":"Leonardo"},{"first_name":"Gabriel","full_name":"Brognara, Gabriel","id":"D96FFDA0-A884-11E9-9968-DC26E6697425","last_name":"Brognara"},{"last_name":"Brandão-Neto","full_name":"Brandão-Neto, José","first_name":"José"},{"last_name":"D'Muniz Pereira","first_name":"Humberto","full_name":"D'Muniz Pereira, Humberto"},{"first_name":"Ana Paula Ulian","full_name":"Araújo, Ana Paula Ulian","last_name":"Araújo"},{"last_name":"Garratt","full_name":"Garratt, Richard Charles","first_name":"Richard Charles"}],"date_updated":"2024-02-28T12:37:54Z","abstract":[{"lang":"eng","text":"The assembly of a septin filament requires that homologous monomers must distinguish between one another in establishing appropriate interfaces with their neighbors. To understand this phenomenon at the molecular level, we present the first four crystal structures of heterodimeric septin complexes. We describe in detail the two distinct types of G-interface present within the octameric particles, which must polymerize to form filaments. These are formed between SEPT2 and SEPT6 and between SEPT7 and SEPT3, and their description permits an understanding of the structural basis for the selectivity necessary for correct filament assembly. By replacing SEPT6 by SEPT8 or SEPT11, it is possible to rationalize Kinoshita's postulate, which predicts the exchangeability of septins from within a subgroup. Switches I and II, which in classical small GTPases provide a mechanism for nucleotide-dependent conformational change, have been repurposed in septins to play a fundamental role in molecular recognition. Specifically, it is switch I which holds the key to discriminating between the two different G-interfaces. Moreover, residues which are characteristic for a given subgroup play subtle, but pivotal, roles in guaranteeing that the correct interfaces are formed."}],"page":"5784-5801","article_type":"original","type":"journal_article","intvolume":"       432","publication_identifier":{"issn":["0022-2836"]},"publisher":"Elsevier","department":[{"_id":"MaLo"}],"_id":"15036","date_published":"2020-10-02T00:00:00Z","title":"Molecular recognition at septin interfaces: The switches hold the key","publication_status":"published","citation":{"apa":"Rosa, H. V. D., Leonardo, D. A., Brognara, G., Brandão-Neto, J., D’Muniz Pereira, H., Araújo, A. P. U., &#38; Garratt, R. C. (2020). Molecular recognition at septin interfaces: The switches hold the key. <i>Journal of Molecular Biology</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.jmb.2020.09.001\">https://doi.org/10.1016/j.jmb.2020.09.001</a>","ama":"Rosa HVD, Leonardo DA, Brognara G, et al. Molecular recognition at septin interfaces: The switches hold the key. <i>Journal of Molecular Biology</i>. 2020;432(21):5784-5801. doi:<a href=\"https://doi.org/10.1016/j.jmb.2020.09.001\">10.1016/j.jmb.2020.09.001</a>","ieee":"H. V. D. Rosa <i>et al.</i>, “Molecular recognition at septin interfaces: The switches hold the key,” <i>Journal of Molecular Biology</i>, vol. 432, no. 21. Elsevier, pp. 5784–5801, 2020.","short":"H.V.D. Rosa, D.A. Leonardo, G. Brognara, J. Brandão-Neto, H. D’Muniz Pereira, A.P.U. Araújo, R.C. Garratt, Journal of Molecular Biology 432 (2020) 5784–5801.","chicago":"Rosa, Higor Vinícius Dias, Diego Antonio Leonardo, Gabriel Brognara, José Brandão-Neto, Humberto D’Muniz Pereira, Ana Paula Ulian Araújo, and Richard Charles Garratt. “Molecular Recognition at Septin Interfaces: The Switches Hold the Key.” <i>Journal of Molecular Biology</i>. Elsevier, 2020. <a href=\"https://doi.org/10.1016/j.jmb.2020.09.001\">https://doi.org/10.1016/j.jmb.2020.09.001</a>.","mla":"Rosa, Higor Vinícius Dias, et al. “Molecular Recognition at Septin Interfaces: The Switches Hold the Key.” <i>Journal of Molecular Biology</i>, vol. 432, no. 21, Elsevier, 2020, pp. 5784–801, doi:<a href=\"https://doi.org/10.1016/j.jmb.2020.09.001\">10.1016/j.jmb.2020.09.001</a>.","ista":"Rosa HVD, Leonardo DA, Brognara G, Brandão-Neto J, D’Muniz Pereira H, Araújo APU, Garratt RC. 2020. Molecular recognition at septin interfaces: The switches hold the key. Journal of Molecular Biology. 432(21), 5784–5801."},"date_created":"2024-02-28T08:50:34Z","oa_version":"Published Version","external_id":{"pmid":["32910969"]},"quality_controlled":"1","article_processing_charge":"No","language":[{"iso":"eng"}],"year":"2020","status":"public","month":"10","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"02","pmid":1,"doi":"10.1016/j.jmb.2020.09.001","keyword":["Molecular Biology","Structural Biology"],"publication":"Journal of Molecular Biology","oa":1,"volume":432},{"intvolume":"        13","type":"journal_article","ddc":["580"],"publication_identifier":{"issn":["1674-2052"]},"author":[{"first_name":"Jeanette","full_name":"Moulinier-Anzola, Jeanette","last_name":"Moulinier-Anzola"},{"last_name":"Schwihla","full_name":"Schwihla, Maximilian","first_name":"Maximilian"},{"last_name":"De-Araújo","full_name":"De-Araújo, Lucinda","first_name":"Lucinda"},{"first_name":"Christina","full_name":"Artner, Christina","last_name":"Artner","id":"45DF286A-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Jörg","full_name":"Jörg, Lisa","first_name":"Lisa"},{"full_name":"Konstantinova, Nataliia","first_name":"Nataliia","last_name":"Konstantinova"},{"last_name":"Luschnig","full_name":"Luschnig, Christian","first_name":"Christian"},{"first_name":"Barbara","full_name":"Korbei, Barbara","last_name":"Korbei"}],"issue":"5","file_date_updated":"2024-02-28T12:39:56Z","abstract":[{"text":"Protein abundance and localization at the plasma membrane (PM) shapes plant development and mediates adaptation to changing environmental conditions. It is regulated by ubiquitination, a post-translational modification crucial for the proper sorting of endocytosed PM proteins to the vacuole for subsequent degradation. To understand the significance and the variety of roles played by this reversible modification, the function of ubiquitin receptors, which translate the ubiquitin signature into a cellular response, needs to be elucidated. In this study, we show that TOL (TOM1-like) proteins function in plants as multivalent ubiquitin receptors, governing ubiquitinated cargo delivery to the vacuole via the conserved Endosomal Sorting Complex Required for Transport (ESCRT) pathway. TOL2 and TOL6 interact with components of the ESCRT machinery and bind to K63-linked ubiquitin via two tandemly arranged conserved ubiquitin-binding domains. Mutation of these domains results not only in a loss of ubiquitin binding but also altered localization, abolishing TOL6 ubiquitin receptor activity. Function and localization of TOL6 is itself regulated by ubiquitination, whereby TOL6 ubiquitination potentially modulates degradation of PM-localized cargoes, assisting in the fine-tuning of the delicate interplay between protein recycling and downregulation. Taken together, our findings demonstrate the function and regulation of a ubiquitin receptor that mediates vacuolar degradation of PM proteins in higher plants.","lang":"eng"}],"article_type":"original","page":"717-731","date_updated":"2024-02-28T12:41:52Z","title":"TOLs function as ubiquitin receptors in the early steps of the ESCRT pathway in higher plants","_id":"15037","date_published":"2020-05-04T00:00:00Z","publication_status":"published","citation":{"ista":"Moulinier-Anzola J, Schwihla M, De-Araújo L, Artner C, Jörg L, Konstantinova N, Luschnig C, Korbei B. 2020. TOLs function as ubiquitin receptors in the early steps of the ESCRT pathway in higher plants. Molecular Plant. 13(5), 717–731.","apa":"Moulinier-Anzola, J., Schwihla, M., De-Araújo, L., Artner, C., Jörg, L., Konstantinova, N., … Korbei, B. (2020). TOLs function as ubiquitin receptors in the early steps of the ESCRT pathway in higher plants. <i>Molecular Plant</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.molp.2020.02.012\">https://doi.org/10.1016/j.molp.2020.02.012</a>","ama":"Moulinier-Anzola J, Schwihla M, De-Araújo L, et al. TOLs function as ubiquitin receptors in the early steps of the ESCRT pathway in higher plants. <i>Molecular Plant</i>. 2020;13(5):717-731. doi:<a href=\"https://doi.org/10.1016/j.molp.2020.02.012\">10.1016/j.molp.2020.02.012</a>","ieee":"J. Moulinier-Anzola <i>et al.</i>, “TOLs function as ubiquitin receptors in the early steps of the ESCRT pathway in higher plants,” <i>Molecular Plant</i>, vol. 13, no. 5. Elsevier, pp. 717–731, 2020.","short":"J. Moulinier-Anzola, M. Schwihla, L. De-Araújo, C. Artner, L. Jörg, N. Konstantinova, C. Luschnig, B. Korbei, Molecular Plant 13 (2020) 717–731.","chicago":"Moulinier-Anzola, Jeanette, Maximilian Schwihla, Lucinda De-Araújo, Christina Artner, Lisa Jörg, Nataliia Konstantinova, Christian Luschnig, and Barbara Korbei. “TOLs Function as Ubiquitin Receptors in the Early Steps of the ESCRT Pathway in Higher Plants.” <i>Molecular Plant</i>. Elsevier, 2020. <a href=\"https://doi.org/10.1016/j.molp.2020.02.012\">https://doi.org/10.1016/j.molp.2020.02.012</a>.","mla":"Moulinier-Anzola, Jeanette, et al. “TOLs Function as Ubiquitin Receptors in the Early Steps of the ESCRT Pathway in Higher Plants.” <i>Molecular Plant</i>, vol. 13, no. 5, Elsevier, 2020, pp. 717–31, doi:<a href=\"https://doi.org/10.1016/j.molp.2020.02.012\">10.1016/j.molp.2020.02.012</a>."},"date_created":"2024-02-28T08:55:56Z","publisher":"Elsevier","department":[{"_id":"EvBe"}],"tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"file":[{"date_updated":"2024-02-28T12:39:56Z","checksum":"c538a5008f7827f62d17d40a3bfabe65","access_level":"open_access","relation":"main_file","success":1,"file_size":3089212,"file_id":"15038","creator":"dernst","file_name":"2020_MolecularPlant_MoulinierAnzola.pdf","date_created":"2024-02-28T12:39:56Z","content_type":"application/pdf"}],"month":"05","article_processing_charge":"No","status":"public","language":[{"iso":"eng"}],"year":"2020","day":"04","pmid":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","quality_controlled":"1","external_id":{"pmid":["32087370"]},"has_accepted_license":"1","oa":1,"volume":13,"doi":"10.1016/j.molp.2020.02.012","keyword":["Plant Science","Molecular Biology"],"publication":"Molecular Plant"},{"publisher":"Association for the Advancement of Artificial Intelligence","department":[{"_id":"KrCh"}],"title":"Reinforcement learning of risk-constrained policies in Markov decision processes","_id":"15055","date_published":"2020-04-03T00:00:00Z","publication_status":"published","citation":{"ista":"Brázdil T, Chatterjee K, Novotný P, Vahala J. 2020. Reinforcement learning of risk-constrained policies in Markov decision processes. Proceedings of the 34th AAAI Conference on Artificial Intelligence. 34(06), 9794–9801.","ieee":"T. Brázdil, K. Chatterjee, P. Novotný, and J. Vahala, “Reinforcement learning of risk-constrained policies in Markov decision processes,” <i>Proceedings of the 34th AAAI Conference on Artificial Intelligence</i>, vol. 34, no. 06. Association for the Advancement of Artificial Intelligence, pp. 9794–9801, 2020.","ama":"Brázdil T, Chatterjee K, Novotný P, Vahala J. Reinforcement learning of risk-constrained policies in Markov decision processes. <i>Proceedings of the 34th AAAI Conference on Artificial Intelligence</i>. 2020;34(06):9794-9801. doi:<a href=\"https://doi.org/10.1609/aaai.v34i06.6531\">10.1609/aaai.v34i06.6531</a>","apa":"Brázdil, T., Chatterjee, K., Novotný, P., &#38; Vahala, J. (2020). Reinforcement learning of risk-constrained policies in Markov decision processes. <i>Proceedings of the 34th AAAI Conference on Artificial Intelligence</i>. New York, NY, United States: Association for the Advancement of Artificial Intelligence. <a href=\"https://doi.org/10.1609/aaai.v34i06.6531\">https://doi.org/10.1609/aaai.v34i06.6531</a>","chicago":"Brázdil, Tomáš, Krishnendu Chatterjee, Petr Novotný, and Jiří Vahala. “Reinforcement Learning of Risk-Constrained Policies in Markov Decision Processes.” <i>Proceedings of the 34th AAAI Conference on Artificial Intelligence</i>. Association for the Advancement of Artificial Intelligence, 2020. <a href=\"https://doi.org/10.1609/aaai.v34i06.6531\">https://doi.org/10.1609/aaai.v34i06.6531</a>.","mla":"Brázdil, Tomáš, et al. “Reinforcement Learning of Risk-Constrained Policies in Markov Decision Processes.” <i>Proceedings of the 34th AAAI Conference on Artificial Intelligence</i>, vol. 34, no. 06, Association for the Advancement of Artificial Intelligence, 2020, pp. 9794–801, doi:<a href=\"https://doi.org/10.1609/aaai.v34i06.6531\">10.1609/aaai.v34i06.6531</a>.","short":"T. Brázdil, K. Chatterjee, P. Novotný, J. Vahala, Proceedings of the 34th AAAI Conference on Artificial Intelligence 34 (2020) 9794–9801."},"date_created":"2024-03-04T08:07:22Z","author":[{"last_name":"Brázdil","full_name":"Brázdil, Tomáš","first_name":"Tomáš"},{"orcid":"0000-0002-4561-241X","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee"},{"full_name":"Novotný, Petr","first_name":"Petr","last_name":"Novotný"},{"last_name":"Vahala","full_name":"Vahala, Jiří","first_name":"Jiří"}],"acknowledgement":"Krishnendu Chatterjee is supported by the Austrian Science Fund (FWF) NFN Grant No. S11407-N23 (RiSE/SHiNE), and COST Action GAMENET. Tomas Brazdil is supported by the Grant Agency of Masaryk University grant no. MUNI/G/0739/2017 and by the Czech Science Foundation grant No. 18-11193S. Petr Novotny and Jirı Vahala are supported by the Czech Science Foundation grant No. GJ19-15134Y.","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2002.12086"}],"issue":"06","conference":{"start_date":"2020-02-07","end_date":"2020-02-12","location":"New York, NY, United States","name":"AAAI: Conference on Artificial Intelligence"},"page":"9794-9801","abstract":[{"text":"<jats:p>Markov decision processes (MDPs) are the defacto framework for sequential decision making in the presence of stochastic uncertainty. A classical optimization criterion for MDPs is to maximize the expected discounted-sum payoff, which ignores low probability catastrophic events with highly negative impact on the system. On the other hand, risk-averse policies require the probability of undesirable events to be below a given threshold, but they do not account for optimization of the expected payoff. We consider MDPs with discounted-sum payoff with failure states which represent catastrophic outcomes. The objective of risk-constrained planning is to maximize the expected discounted-sum payoff among risk-averse policies that ensure the probability to encounter a failure state is below a desired threshold. Our main contribution is an efficient risk-constrained planning algorithm that combines UCT-like search with a predictor learned through interaction with the MDP (in the style of AlphaZero) and with a risk-constrained action selection via linear programming. We demonstrate the effectiveness of our approach with experiments on classical MDPs from the literature, including benchmarks with an order of 106 states.</jats:p>","lang":"eng"}],"article_type":"original","date_updated":"2024-03-04T08:30:16Z","type":"journal_article","intvolume":"        34","publication_identifier":{"issn":["2374-3468"]},"doi":"10.1609/aaai.v34i06.6531","project":[{"grant_number":"S11407","call_identifier":"FWF","name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425"}],"keyword":["General Medicine"],"publication":"Proceedings of the 34th AAAI Conference on Artificial Intelligence","arxiv":1,"oa":1,"volume":34,"oa_version":"Preprint","quality_controlled":"1","external_id":{"arxiv":["2002.12086"]},"month":"04","article_processing_charge":"No","language":[{"iso":"eng"}],"year":"2020","status":"public","day":"03","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"publication":"Science Advances","doi":"10.1126/sciadv.aaw7824","oa":1,"volume":6,"quality_controlled":"1","has_accepted_license":"1","oa_version":"Published Version","day":"01","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"07","article_processing_charge":"No","year":"2020","status":"public","language":[{"iso":"eng"}],"tmp":{"short":"CC BY-NC (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","image":"/images/cc_by_nc.png"},"file":[{"success":1,"file_id":"15058","file_size":1864415,"creator":"dernst","checksum":"a37157cd0de709dce5fe03f4a31cd0b6","date_updated":"2024-03-04T09:46:41Z","access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_name":"2020_ScienceAdvances_Park.pdf","date_created":"2024-03-04T09:46:41Z"}],"license":"https://creativecommons.org/licenses/by-nc/4.0/","publisher":"American Association for the Advancement of Science","department":[{"_id":"MaDe"}],"publication_status":"published","citation":{"ista":"Park S, Artan M, Han SH, Park H-EH, Jung Y, Hwang AB, Shin WS, Kim K-T, Lee S-JV. 2020. VRK-1 extends life span by activation of AMPK via phosphorylation. Science Advances. 6(27), aaw7824.","short":"S. Park, M. Artan, S.H. Han, H.-E.H. Park, Y. Jung, A.B. Hwang, W.S. Shin, K.-T. Kim, S.-J.V. Lee, Science Advances 6 (2020).","mla":"Park, Sangsoon, et al. “VRK-1 Extends Life Span by Activation of AMPK via Phosphorylation.” <i>Science Advances</i>, vol. 6, no. 27, aaw7824, American Association for the Advancement of Science, 2020, doi:<a href=\"https://doi.org/10.1126/sciadv.aaw7824\">10.1126/sciadv.aaw7824</a>.","chicago":"Park, Sangsoon, Murat Artan, Seung Hyun Han, Hae-Eun H. Park, Yoonji Jung, Ara B. Hwang, Won Sik Shin, Kyong-Tai Kim, and Seung-Jae V. Lee. “VRK-1 Extends Life Span by Activation of AMPK via Phosphorylation.” <i>Science Advances</i>. American Association for the Advancement of Science, 2020. <a href=\"https://doi.org/10.1126/sciadv.aaw7824\">https://doi.org/10.1126/sciadv.aaw7824</a>.","apa":"Park, S., Artan, M., Han, S. H., Park, H.-E. H., Jung, Y., Hwang, A. B., … Lee, S.-J. V. (2020). VRK-1 extends life span by activation of AMPK via phosphorylation. <i>Science Advances</i>. American Association for the Advancement of Science. <a href=\"https://doi.org/10.1126/sciadv.aaw7824\">https://doi.org/10.1126/sciadv.aaw7824</a>","ama":"Park S, Artan M, Han SH, et al. VRK-1 extends life span by activation of AMPK via phosphorylation. <i>Science Advances</i>. 2020;6(27). doi:<a href=\"https://doi.org/10.1126/sciadv.aaw7824\">10.1126/sciadv.aaw7824</a>","ieee":"S. Park <i>et al.</i>, “VRK-1 extends life span by activation of AMPK via phosphorylation,” <i>Science Advances</i>, vol. 6, no. 27. American Association for the Advancement of Science, 2020."},"date_created":"2024-03-04T09:41:57Z","title":"VRK-1 extends life span by activation of AMPK via phosphorylation","_id":"15057","date_published":"2020-07-01T00:00:00Z","article_type":"original","abstract":[{"lang":"eng","text":"Vaccinia virus–related kinase (VRK) is an evolutionarily conserved nuclear protein kinase. VRK-1, the single Caenorhabditis elegans VRK ortholog, functions in cell division and germline proliferation. However, the role of VRK-1 in postmitotic cells and adult life span remains unknown. Here, we show that VRK-1 increases organismal longevity by activating the cellular energy sensor, AMP-activated protein kinase (AMPK), via direct phosphorylation. We found that overexpression of vrk-1 in the soma of adult C. elegans increased life span and, conversely, inhibition of vrk-1 decreased life span. In addition, vrk-1 was required for longevity conferred by mutations that inhibit C. elegans mitochondrial respiration, which requires AMPK. VRK-1 directly phosphorylated and up-regulated AMPK in both C. elegans and cultured human cells. Thus, our data show that the somatic nuclear kinase, VRK-1, promotes longevity through AMPK activation, and this function appears to be conserved between C. elegans and humans."}],"article_number":"aaw7824","date_updated":"2024-03-04T09:52:09Z","acknowledgement":"This research was supported by grants NRF-2019R1A3B2067745 and NRF-2017R1A5A1015366 funded by the Korean Government (MSIT) through the National Research Foundation (NRF) of Korea to S.-J.V.L. and by grant Basic Science Research Program (No. 2019R1A2C2009440) funded by the Korean Government (MSIT) through the NRF of Korea to K.-T.K. ","author":[{"last_name":"Park","full_name":"Park, Sangsoon","first_name":"Sangsoon"},{"last_name":"Artan","id":"C407B586-6052-11E9-B3AE-7006E6697425","orcid":"0000-0001-8945-6992","full_name":"Artan, Murat","first_name":"Murat"},{"last_name":"Han","full_name":"Han, Seung Hyun","first_name":"Seung Hyun"},{"last_name":"Park","full_name":"Park, Hae-Eun H.","first_name":"Hae-Eun H."},{"first_name":"Yoonji","full_name":"Jung, Yoonji","last_name":"Jung"},{"last_name":"Hwang","full_name":"Hwang, Ara B.","first_name":"Ara B."},{"last_name":"Shin","first_name":"Won Sik","full_name":"Shin, Won Sik"},{"last_name":"Kim","full_name":"Kim, Kyong-Tai","first_name":"Kyong-Tai"},{"last_name":"Lee","first_name":"Seung-Jae V.","full_name":"Lee, Seung-Jae V."}],"issue":"27","file_date_updated":"2024-03-04T09:46:41Z","ddc":["570"],"publication_identifier":{"eissn":["2375-2548"]},"type":"journal_article","intvolume":"         6"},{"doi":"10.1073/pnas.1917269117","acknowledged_ssus":[{"_id":"LifeSc"}],"publication":"Proceedings of the National Academy of Sciences","volume":117,"oa":1,"oa_version":"Published Version","quality_controlled":"1","external_id":{"pmid":["32848067"]},"month":"09","year":"2020","language":[{"iso":"eng"}],"status":"public","article_processing_charge":"No","pmid":1,"day":"08","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"CaBe"}],"publisher":"Proceedings of the National Academy of Sciences","title":"Calcium modulates the domain flexibility and function of an α-actinin similar to the ancestral α-actinin","date_published":"2020-09-08T00:00:00Z","_id":"15061","date_created":"2024-03-04T10:03:52Z","citation":{"ista":"Pinotsis N, Zielinska K, Babuta M, Arolas JL, Kostan J, Khan MB, Schreiner C, Testa Salmazo AP, Ciccarelli L, Puchinger M, Gkougkoulia EA, Ribeiro E de A, Marlovits TC, Bhattacharya A, Djinovic-Carugo K. 2020. Calcium modulates the domain flexibility and function of an α-actinin similar to the ancestral α-actinin. Proceedings of the National Academy of Sciences. 117(36), 22101–22112.","short":"N. Pinotsis, K. Zielinska, M. Babuta, J.L. Arolas, J. Kostan, M.B. Khan, C. Schreiner, A.P. Testa Salmazo, L. Ciccarelli, M. Puchinger, E.A. Gkougkoulia, E. de A. Ribeiro, T.C. Marlovits, A. Bhattacharya, K. Djinovic-Carugo, Proceedings of the National Academy of Sciences 117 (2020) 22101–22112.","mla":"Pinotsis, Nikos, et al. “Calcium Modulates the Domain Flexibility and Function of an α-Actinin Similar to the Ancestral α-Actinin.” <i>Proceedings of the National Academy of Sciences</i>, vol. 117, no. 36, Proceedings of the National Academy of Sciences, 2020, pp. 22101–12, doi:<a href=\"https://doi.org/10.1073/pnas.1917269117\">10.1073/pnas.1917269117</a>.","chicago":"Pinotsis, Nikos, Karolina Zielinska, Mrigya Babuta, Joan L. Arolas, Julius Kostan, Muhammad Bashir Khan, Claudia Schreiner, et al. “Calcium Modulates the Domain Flexibility and Function of an α-Actinin Similar to the Ancestral α-Actinin.” <i>Proceedings of the National Academy of Sciences</i>. Proceedings of the National Academy of Sciences, 2020. <a href=\"https://doi.org/10.1073/pnas.1917269117\">https://doi.org/10.1073/pnas.1917269117</a>.","apa":"Pinotsis, N., Zielinska, K., Babuta, M., Arolas, J. L., Kostan, J., Khan, M. B., … Djinovic-Carugo, K. (2020). Calcium modulates the domain flexibility and function of an α-actinin similar to the ancestral α-actinin. <i>Proceedings of the National Academy of Sciences</i>. Proceedings of the National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.1917269117\">https://doi.org/10.1073/pnas.1917269117</a>","ieee":"N. Pinotsis <i>et al.</i>, “Calcium modulates the domain flexibility and function of an α-actinin similar to the ancestral α-actinin,” <i>Proceedings of the National Academy of Sciences</i>, vol. 117, no. 36. Proceedings of the National Academy of Sciences, pp. 22101–22112, 2020.","ama":"Pinotsis N, Zielinska K, Babuta M, et al. Calcium modulates the domain flexibility and function of an α-actinin similar to the ancestral α-actinin. <i>Proceedings of the National Academy of Sciences</i>. 2020;117(36):22101-22112. doi:<a href=\"https://doi.org/10.1073/pnas.1917269117\">10.1073/pnas.1917269117</a>"},"publication_status":"published","acknowledgement":"We thank the staff of the macromolecular crystallography (MX) and SAXS beamlines at the European Synchrotron Radiation facility, Diamond, and Swiss Light Source for excellent support, and the Life Sciences Facility of the Institute of Science and Technology Austria for usage of the rheometer. We thank Life Sciences editors for editing assistance. EM data were\r\nrecorded at the EM Facility of the Vienna BioCenter Core Facilities (Austria). Confocal microscopy was carried out at the Advanced Instrument Research Facility, Jawaharlal Nehru University. K.D.-C.’s research was supported by the Initial Training Network MUZIC (ITN-MUZIC) (N°238423), Austrian Science Fund (FWF) Projects I525, I1593, P22276, P19060, and W1221, Laura Bassi Centre of Optimized Structural Studies (N°253275), a Wellcome Trust Collaborative Award (201543/Z/16/Z), COST Action BM1405, Vienna Science and Technology Fund (WWTF) Chemical Biology Project LS17-008, and Christian Doppler Laboratory for High-Content Structural Biology and Biotechnology. K.Z., J.L.A., C.S., E.A.G., and A.S. were supported by the University of Vienna, J.K. by a Wellcome Trust Collaborative Award and by the Centre of Optimized Structural Studies, M.P. by FWF Project I1593, E.d.A.R. ITN-MUZIC, and FWF Projects I525 and I1593, and T.C.M. and L.C. by FWF Project I 2408-B22. E.A.G. acknowledges the PhD program Structure and Interaction of Biological Macromolecules. M.B. acknowledges the University Grant Commission, India, for a senior research fellowship. A.B. acknowledges a JC Bose Fellowship from the Science Engineering Research Council. ","author":[{"first_name":"Nikos","full_name":"Pinotsis, Nikos","last_name":"Pinotsis"},{"last_name":"Zielinska","first_name":"Karolina","full_name":"Zielinska, Karolina"},{"last_name":"Babuta","full_name":"Babuta, Mrigya","first_name":"Mrigya"},{"last_name":"Arolas","full_name":"Arolas, Joan L.","first_name":"Joan L."},{"last_name":"Kostan","first_name":"Julius","full_name":"Kostan, Julius"},{"last_name":"Khan","first_name":"Muhammad Bashir","full_name":"Khan, Muhammad Bashir"},{"last_name":"Schreiner","first_name":"Claudia","full_name":"Schreiner, Claudia"},{"id":"41F1F098-F248-11E8-B48F-1D18A9856A87","last_name":"Testa Salmazo","first_name":"Anita P","full_name":"Testa Salmazo, Anita P"},{"first_name":"Luciano","full_name":"Ciccarelli, Luciano","last_name":"Ciccarelli"},{"last_name":"Puchinger","full_name":"Puchinger, Martin","first_name":"Martin"},{"last_name":"Gkougkoulia","first_name":"Eirini A.","full_name":"Gkougkoulia, Eirini A."},{"first_name":"Euripedes de Almeida","full_name":"Ribeiro, Euripedes de Almeida","last_name":"Ribeiro"},{"full_name":"Marlovits, Thomas C.","first_name":"Thomas C.","last_name":"Marlovits"},{"last_name":"Bhattacharya","full_name":"Bhattacharya, Alok","first_name":"Alok"},{"full_name":"Djinovic-Carugo, Kristina","first_name":"Kristina","last_name":"Djinovic-Carugo"}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1073/pnas.191726911"}],"issue":"36","page":"22101-22112","article_type":"original","abstract":[{"text":"The actin cytoskeleton, a dynamic network of actin filaments and associated F-actin–binding proteins, is fundamentally important in eukaryotes. α-Actinins are major F-actin bundlers that are inhibited by Ca2+ in nonmuscle cells. Here we report the mechanism of Ca2+-mediated regulation of Entamoeba histolytica α-actinin-2 (EhActn2) with features expected for the common ancestor of Entamoeba and higher eukaryotic α-actinins. Crystal structures of Ca2+-free and Ca2+-bound EhActn2 reveal a calmodulin-like domain (CaMD) uniquely inserted within the rod domain. Integrative studies reveal an exceptionally high affinity of the EhActn2 CaMD for Ca2+, binding of which can only be regulated in the presence of physiological concentrations of Mg2+. Ca2+ binding triggers an increase in protein multidomain rigidity, reducing conformational flexibility of F-actin–binding domains via interdomain cross-talk and consequently inhibiting F-actin bundling. In vivo studies uncover that EhActn2 plays an important role in phagocytic cup formation and might constitute a new drug target for amoebic dysentery.","lang":"eng"}],"date_updated":"2024-03-04T10:14:44Z","intvolume":"       117","type":"journal_article","publication_identifier":{"issn":["0027-8424"],"eissn":["1091-6490"]}},{"quality_controlled":"1","external_id":{"arxiv":["1908.01653"]},"oa_version":"Preprint","scopus_import":"1","day":"16","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"11","article_processing_charge":"No","year":"2020","status":"public","language":[{"iso":"eng"}],"publication":"Probability and Mathematical Physics","arxiv":1,"doi":"10.2140/pmp.2020.1.101","keyword":["General Medicine"],"project":[{"call_identifier":"FP7","grant_number":"338804","_id":"258DCDE6-B435-11E9-9278-68D0E5697425","name":"Random matrices, universality and disordered quantum systems"},{"_id":"2564DBCA-B435-11E9-9278-68D0E5697425","name":"International IST Doctoral Program","call_identifier":"H2020","grant_number":"665385"}],"oa":1,"volume":1,"article_type":"original","page":"101-146","abstract":[{"text":"We consider the least singular value of a large random matrix with real or complex i.i.d. Gaussian entries shifted by a constant z∈C. We prove an optimal lower tail estimate on this singular value in the critical regime where z is around the spectral edge, thus improving the classical bound of Sankar, Spielman and Teng (SIAM J. Matrix Anal. Appl. 28:2 (2006), 446–476) for the particular shift-perturbation in the edge regime. Lacking Brézin–Hikami formulas in the real case, we rely on the superbosonization formula (Comm. Math. Phys. 283:2 (2008), 343–395).","lang":"eng"}],"date_updated":"2024-03-04T10:33:15Z","author":[{"last_name":"Cipolloni","id":"42198EFA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4901-7992","first_name":"Giorgio","full_name":"Cipolloni, Giorgio"},{"first_name":"László","full_name":"Erdös, László","orcid":"0000-0001-5366-9603","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","last_name":"Erdös"},{"last_name":"Schröder","id":"408ED176-F248-11E8-B48F-1D18A9856A87","first_name":"Dominik J","full_name":"Schröder, Dominik J","orcid":"0000-0002-2904-1856"}],"acknowledgement":"Partially supported by ERC Advanced Grant No. 338804. This project has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Sklodowska-Curie Grant Agreement No. 66538","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.1908.01653","open_access":"1"}],"issue":"1","publication_identifier":{"issn":["2690-1005","2690-0998"]},"intvolume":"         1","type":"journal_article","publisher":"Mathematical Sciences Publishers","department":[{"_id":"LaEr"}],"citation":{"ieee":"G. Cipolloni, L. Erdös, and D. J. Schröder, “Optimal lower bound on the least singular value of the shifted Ginibre ensemble,” <i>Probability and Mathematical Physics</i>, vol. 1, no. 1. Mathematical Sciences Publishers, pp. 101–146, 2020.","ama":"Cipolloni G, Erdös L, Schröder DJ. Optimal lower bound on the least singular value of the shifted Ginibre ensemble. <i>Probability and Mathematical Physics</i>. 2020;1(1):101-146. doi:<a href=\"https://doi.org/10.2140/pmp.2020.1.101\">10.2140/pmp.2020.1.101</a>","apa":"Cipolloni, G., Erdös, L., &#38; Schröder, D. J. (2020). Optimal lower bound on the least singular value of the shifted Ginibre ensemble. <i>Probability and Mathematical Physics</i>. Mathematical Sciences Publishers. <a href=\"https://doi.org/10.2140/pmp.2020.1.101\">https://doi.org/10.2140/pmp.2020.1.101</a>","mla":"Cipolloni, Giorgio, et al. “Optimal Lower Bound on the Least Singular Value of the Shifted Ginibre Ensemble.” <i>Probability and Mathematical Physics</i>, vol. 1, no. 1, Mathematical Sciences Publishers, 2020, pp. 101–46, doi:<a href=\"https://doi.org/10.2140/pmp.2020.1.101\">10.2140/pmp.2020.1.101</a>.","chicago":"Cipolloni, Giorgio, László Erdös, and Dominik J Schröder. “Optimal Lower Bound on the Least Singular Value of the Shifted Ginibre Ensemble.” <i>Probability and Mathematical Physics</i>. Mathematical Sciences Publishers, 2020. <a href=\"https://doi.org/10.2140/pmp.2020.1.101\">https://doi.org/10.2140/pmp.2020.1.101</a>.","short":"G. Cipolloni, L. Erdös, D.J. Schröder, Probability and Mathematical Physics 1 (2020) 101–146.","ista":"Cipolloni G, Erdös L, Schröder DJ. 2020. Optimal lower bound on the least singular value of the shifted Ginibre ensemble. Probability and Mathematical Physics. 1(1), 101–146."},"publication_status":"published","date_created":"2024-03-04T10:27:57Z","ec_funded":1,"title":"Optimal lower bound on the least singular value of the shifted Ginibre ensemble","_id":"15063","date_published":"2020-11-16T00:00:00Z"},{"oa":1,"volume":4,"doi":"10.1007/s41468-020-00058-8","publication":"Journal of Applied and Computational Topology","month":"12","article_processing_charge":"Yes (via OA deal)","language":[{"iso":"eng"}],"year":"2020","status":"public","day":"01","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","scopus_import":"1","quality_controlled":"1","has_accepted_license":"1","title":"Čech-Delaunay gradient flow and homology inference for self-maps","_id":"15064","date_published":"2020-12-01T00:00:00Z","publication_status":"published","citation":{"apa":"Bauer, U., Edelsbrunner, H., Jablonski, G., &#38; Mrozek, M. (2020). Čech-Delaunay gradient flow and homology inference for self-maps. <i>Journal of Applied and Computational Topology</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s41468-020-00058-8\">https://doi.org/10.1007/s41468-020-00058-8</a>","ama":"Bauer U, Edelsbrunner H, Jablonski G, Mrozek M. Čech-Delaunay gradient flow and homology inference for self-maps. <i>Journal of Applied and Computational Topology</i>. 2020;4(4):455-480. doi:<a href=\"https://doi.org/10.1007/s41468-020-00058-8\">10.1007/s41468-020-00058-8</a>","ieee":"U. Bauer, H. Edelsbrunner, G. Jablonski, and M. Mrozek, “Čech-Delaunay gradient flow and homology inference for self-maps,” <i>Journal of Applied and Computational Topology</i>, vol. 4, no. 4. Springer Nature, pp. 455–480, 2020.","short":"U. Bauer, H. Edelsbrunner, G. Jablonski, M. Mrozek, Journal of Applied and Computational Topology 4 (2020) 455–480.","mla":"Bauer, U., et al. “Čech-Delaunay Gradient Flow and Homology Inference for Self-Maps.” <i>Journal of Applied and Computational Topology</i>, vol. 4, no. 4, Springer Nature, 2020, pp. 455–80, doi:<a href=\"https://doi.org/10.1007/s41468-020-00058-8\">10.1007/s41468-020-00058-8</a>.","chicago":"Bauer, U., Herbert Edelsbrunner, Grzegorz Jablonski, and M. Mrozek. “Čech-Delaunay Gradient Flow and Homology Inference for Self-Maps.” <i>Journal of Applied and Computational Topology</i>. Springer Nature, 2020. <a href=\"https://doi.org/10.1007/s41468-020-00058-8\">https://doi.org/10.1007/s41468-020-00058-8</a>.","ista":"Bauer U, Edelsbrunner H, Jablonski G, Mrozek M. 2020. Čech-Delaunay gradient flow and homology inference for self-maps. Journal of Applied and Computational Topology. 4(4), 455–480."},"date_created":"2024-03-04T10:47:49Z","publisher":"Springer Nature","department":[{"_id":"HeEd"}],"tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"file":[{"content_type":"application/pdf","date_created":"2024-03-04T10:52:42Z","file_name":"2020_JourApplCompTopology_Bauer.pdf","file_size":851190,"file_id":"15065","success":1,"creator":"dernst","access_level":"open_access","relation":"main_file","checksum":"eed1168b6e66cd55272c19bb7fca8a1c","date_updated":"2024-03-04T10:52:42Z"}],"type":"journal_article","intvolume":"         4","ddc":["500"],"publication_identifier":{"issn":["2367-1726"],"eissn":["2367-1734"]},"acknowledgement":"This research has been supported by the DFG Collaborative Research Center SFB/TRR 109 “Discretization in Geometry and Dynamics”, by Polish MNiSzW Grant No. 2621/7.PR/12/2013/2, by the Polish National Science Center under Maestro Grant No. 2014/14/A/ST1/00453 and Grant No. DEC-2013/09/N/ST6/02995. Open Access funding provided by Projekt DEAL.","author":[{"full_name":"Bauer, U.","first_name":"U.","last_name":"Bauer"},{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","first_name":"Herbert"},{"orcid":"0000-0002-3536-9866","first_name":"Grzegorz","full_name":"Jablonski, Grzegorz","id":"4483EF78-F248-11E8-B48F-1D18A9856A87","last_name":"Jablonski"},{"last_name":"Mrozek","first_name":"M.","full_name":"Mrozek, M."}],"issue":"4","file_date_updated":"2024-03-04T10:52:42Z","article_type":"original","page":"455-480","abstract":[{"text":"We call a continuous self-map that reveals itself through a discrete set of point-value pairs a sampled dynamical system. Capturing the available information with chain maps on Delaunay complexes, we use persistent homology to quantify the evidence of recurrent behavior. We establish a sampling theorem to recover the eigenspaces of the endomorphism on homology induced by the self-map. Using a combinatorial gradient flow arising from the discrete Morse theory for Čech and Delaunay complexes, we construct a chain map to transform the problem from the natural but expensive Čech complexes to the computationally efficient Delaunay triangulations. The fast chain map algorithm has applications beyond dynamical systems.","lang":"eng"}],"date_updated":"2024-03-04T10:54:04Z"},{"author":[{"full_name":"Brandt, Sebastian","first_name":"Sebastian","last_name":"Brandt"},{"full_name":"Keller, Barbara","first_name":"Barbara","last_name":"Keller"},{"first_name":"Joel","full_name":"Rybicki, Joel","orcid":"0000-0002-6432-6646","last_name":"Rybicki","id":"334EFD2E-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Suomela, Jukka","first_name":"Jukka","last_name":"Suomela"},{"last_name":"Uitto","full_name":"Uitto, Jara","first_name":"Jara"}],"file_date_updated":"2024-03-05T07:08:27Z","conference":{"location":"Virtual","name":"DISC: Symposium on Distributed Computing","end_date":"2020-10-16","start_date":"2020-10-12"},"article_number":"40","abstract":[{"text":"We introduce a new graph problem, the token dropping game, and we show how to solve it efficiently in a distributed setting. We use the token dropping game as a tool to design an efficient distributed algorithm for the stable orientation problem, which is a special case of the more general locally optimal semi-matching problem. The prior work by Czygrinow et al. (DISC 2012) finds a locally optimal semi-matching in O(Δ⁵) rounds in graphs of maximum degree Δ, which directly implies an algorithm with the same runtime for stable orientations. We improve the runtime to O(Δ⁴) for stable orientations and prove a lower bound of Ω(Δ) rounds.","lang":"eng"}],"date_updated":"2024-03-05T07:13:13Z","intvolume":"       179","type":"conference","ddc":["000"],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","department":[{"_id":"DaAl"}],"tmp":{"name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)","image":"/images/cc_by.png","short":"CC BY (3.0)","legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode"},"file":[{"date_created":"2024-03-05T07:08:27Z","file_name":"2020_LIPIcs_Brandt.pdf","content_type":"application/pdf","relation":"main_file","access_level":"open_access","date_updated":"2024-03-05T07:08:27Z","checksum":"23e2d9321aef53092dc1e24a8ab82d72","creator":"dernst","success":1,"file_size":303529,"file_id":"15075"}],"license":"https://creativecommons.org/licenses/by/3.0/","title":"Brief announcement: Efficient load-balancing through distributed token dropping","_id":"15074","date_published":"2020-10-07T00:00:00Z","publication_status":"published","citation":{"apa":"Brandt, S., Keller, B., Rybicki, J., Suomela, J., &#38; Uitto, J. (2020). Brief announcement: Efficient load-balancing through distributed token dropping. In <i>34th International Symposium on Distributed Computing</i> (Vol. 179). Virtual: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.DISC.2020.40\">https://doi.org/10.4230/LIPIcs.DISC.2020.40</a>","ama":"Brandt S, Keller B, Rybicki J, Suomela J, Uitto J. Brief announcement: Efficient load-balancing through distributed token dropping. In: <i>34th International Symposium on Distributed Computing</i>. Vol 179. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:<a href=\"https://doi.org/10.4230/LIPIcs.DISC.2020.40\">10.4230/LIPIcs.DISC.2020.40</a>","ieee":"S. Brandt, B. Keller, J. Rybicki, J. Suomela, and J. Uitto, “Brief announcement: Efficient load-balancing through distributed token dropping,” in <i>34th International Symposium on Distributed Computing</i>, Virtual, 2020, vol. 179.","short":"S. Brandt, B. Keller, J. Rybicki, J. Suomela, J. Uitto, in:, 34th International Symposium on Distributed Computing, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.","chicago":"Brandt, Sebastian, Barbara Keller, Joel Rybicki, Jukka Suomela, and Jara Uitto. “Brief Announcement: Efficient Load-Balancing through Distributed Token Dropping.” In <i>34th International Symposium on Distributed Computing</i>, Vol. 179. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. <a href=\"https://doi.org/10.4230/LIPIcs.DISC.2020.40\">https://doi.org/10.4230/LIPIcs.DISC.2020.40</a>.","mla":"Brandt, Sebastian, et al. “Brief Announcement: Efficient Load-Balancing through Distributed Token Dropping.” <i>34th International Symposium on Distributed Computing</i>, vol. 179, 40, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:<a href=\"https://doi.org/10.4230/LIPIcs.DISC.2020.40\">10.4230/LIPIcs.DISC.2020.40</a>.","ista":"Brandt S, Keller B, Rybicki J, Suomela J, Uitto J. 2020. Brief announcement: Efficient load-balancing through distributed token dropping. 34th International Symposium on Distributed Computing. DISC: Symposium on Distributed Computing, LIPIcs, vol. 179, 40."},"date_created":"2024-03-05T07:09:12Z","oa_version":"Published Version","scopus_import":"1","related_material":{"record":[{"status":"public","id":"9678","relation":"later_version"}]},"quality_controlled":"1","external_id":{"arxiv":["2005.07761"]},"has_accepted_license":"1","month":"10","article_processing_charge":"No","year":"2020","status":"public","language":[{"iso":"eng"}],"day":"07","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","alternative_title":["LIPIcs"],"doi":"10.4230/LIPIcs.DISC.2020.40","publication":"34th International Symposium on Distributed Computing","arxiv":1,"oa":1,"volume":179},{"file":[{"success":1,"file_id":"15078","file_size":782987,"creator":"dernst","checksum":"e5eb16199f4ccfd77a321977eb3f026f","date_updated":"2024-03-05T07:25:15Z","access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_name":"2020_LIPIcs_Alistarh.pdf","date_created":"2024-03-05T07:25:15Z"}],"tmp":{"name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)","image":"/images/cc_by.png","short":"CC BY (3.0)","legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode"},"department":[{"_id":"DaAl"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","date_created":"2024-03-05T07:25:37Z","publication_status":"published","citation":{"ama":"Alistarh D-A, Nadiradze G, Sabour A. Dynamic averaging load balancing on cycles. In: <i>47th International Colloquium on Automata, Languages, and Programming</i>. Vol 168. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:<a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2020.7\">10.4230/LIPIcs.ICALP.2020.7</a>","ieee":"D.-A. Alistarh, G. Nadiradze, and A. Sabour, “Dynamic averaging load balancing on cycles,” in <i>47th International Colloquium on Automata, Languages, and Programming</i>, Saarbrücken, Germany, Virtual, 2020, vol. 168.","apa":"Alistarh, D.-A., Nadiradze, G., &#38; Sabour, A. (2020). Dynamic averaging load balancing on cycles. In <i>47th International Colloquium on Automata, Languages, and Programming</i> (Vol. 168). Saarbrücken, Germany, Virtual: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2020.7\">https://doi.org/10.4230/LIPIcs.ICALP.2020.7</a>","mla":"Alistarh, Dan-Adrian, et al. “Dynamic Averaging Load Balancing on Cycles.” <i>47th International Colloquium on Automata, Languages, and Programming</i>, vol. 168, 7, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:<a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2020.7\">10.4230/LIPIcs.ICALP.2020.7</a>.","chicago":"Alistarh, Dan-Adrian, Giorgi Nadiradze, and Amirmojtaba Sabour. “Dynamic Averaging Load Balancing on Cycles.” In <i>47th International Colloquium on Automata, Languages, and Programming</i>, Vol. 168. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. <a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2020.7\">https://doi.org/10.4230/LIPIcs.ICALP.2020.7</a>.","short":"D.-A. Alistarh, G. Nadiradze, A. Sabour, in:, 47th International Colloquium on Automata, Languages, and Programming, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.","ista":"Alistarh D-A, Nadiradze G, Sabour A. 2020. Dynamic averaging load balancing on cycles. 47th International Colloquium on Automata, Languages, and Programming. ICALP: International Colloquium on Automata, Languages, and Programming, LIPIcs, vol. 168, 7."},"date_published":"2020-06-29T00:00:00Z","_id":"15077","ec_funded":1,"title":"Dynamic averaging load balancing on cycles","date_updated":"2024-03-05T07:35:53Z","abstract":[{"lang":"eng","text":"We consider the following dynamic load-balancing process: given an underlying graph G with n nodes, in each step t≥ 0, one unit of load is created, and placed at a randomly chosen graph node. In the same step, the chosen node picks a random neighbor, and the two nodes balance their loads by averaging them. We are interested in the expected gap between the minimum and maximum loads at nodes as the process progresses, and its dependence on n and on the graph structure. Variants of the above graphical balanced allocation process have been studied previously by Peres, Talwar, and Wieder [Peres et al., 2015], and by Sauerwald and Sun [Sauerwald and Sun, 2015]. These authors left as open the question of characterizing the gap in the case of cycle graphs in the dynamic case, where weights are created during the algorithm’s execution. For this case, the only known upper bound is of 𝒪(n log n), following from a majorization argument due to [Peres et al., 2015], which analyzes a related graphical allocation process. In this paper, we provide an upper bound of 𝒪 (√n log n) on the expected gap of the above process for cycles of length n. We introduce a new potential analysis technique, which enables us to bound the difference in load between k-hop neighbors on the cycle, for any k ≤ n/2. We complement this with a \"gap covering\" argument, which bounds the maximum value of the gap by bounding its value across all possible subsets of a certain structure, and recursively bounding the gaps within each subset. We provide analytical and experimental evidence that our upper bound on the gap is tight up to a logarithmic factor."}],"article_number":"7","conference":{"name":"ICALP: International Colloquium on Automata, Languages, and Programming","location":"Saarbrücken, Germany, Virtual","start_date":"2020-07-08","end_date":"2020-07-11"},"file_date_updated":"2024-03-05T07:25:15Z","acknowledgement":"The authors sincerely thank Thomas Sauerwald and George Giakkoupis for insightful discussions, and Mohsen Ghaffari, Yuval Peres, and Udi Wieder for feedback on earlier\r\nversions of this draft. We also thank the ICALP anonymous reviewers for their very useful comments.\r\nFunding: European Research Council funding award PR1042ERC01","author":[{"orcid":"0000-0003-3650-940X","full_name":"Alistarh, Dan-Adrian","first_name":"Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","last_name":"Alistarh"},{"first_name":"Giorgi","full_name":"Nadiradze, Giorgi","orcid":"0000-0001-5634-0731","last_name":"Nadiradze","id":"3279A00C-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Sabour, Amirmojtaba","first_name":"Amirmojtaba","last_name":"Sabour","id":"bcc145fd-e77f-11ea-ae8b-80d661dbff67"}],"ddc":["000"],"type":"conference","intvolume":"       168","arxiv":1,"publication":"47th International Colloquium on Automata, Languages, and Programming","project":[{"_id":"268A44D6-B435-11E9-9278-68D0E5697425","name":"Elastic Coordination for Scalable Machine Learning","call_identifier":"H2020","grant_number":"805223"}],"doi":"10.4230/LIPIcs.ICALP.2020.7","volume":168,"oa":1,"has_accepted_license":"1","external_id":{"arxiv":["2003.09297"]},"quality_controlled":"1","related_material":{"record":[{"status":"public","id":"8286","relation":"later_version"}]},"scopus_import":"1","oa_version":"Published Version","alternative_title":["LIPIcs"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"29","status":"public","language":[{"iso":"eng"}],"year":"2020","article_processing_charge":"No","month":"06"},{"day":"01","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"04","year":"2020","type":"conference","language":[{"iso":"eng"}],"status":"public","article_processing_charge":"No","abstract":[{"text":"Two plane drawings of geometric graphs on the same set of points are called disjoint compatible if their union is plane and they do not have an edge in common. For a given set S of 2n points two plane drawings of perfect matchings M1 and M2 (which do not need to be disjoint nor compatible) are disjoint tree-compatible if there exists a plane drawing of a spanning tree T on S which is disjoint compatible to both M1 and M2.\r\nWe show that the graph of all disjoint tree-compatible perfect geometric matchings on 2n points in convex position is connected if and only if 2n ≥ 10. Moreover, in that case the diameter\r\nof this graph is either 4 or 5, independent of n.","lang":"eng"}],"article_number":"56","quality_controlled":"1","conference":{"name":"EuroCG: European Workshop on Computational Geometry","location":"Würzburg, Germany, Virtual","end_date":"2020-03-18","start_date":"2020-03-16"},"date_updated":"2024-03-05T09:00:07Z","acknowledgement":"Research on this work was initiated at the 6th Austrian-Japanese-Mexican-Spanish Workshop on Discrete Geometry and continued during the 16th European Geometric Graph-Week, both held near Strobl, Austria. We are grateful to the participants for the inspiring atmosphere. We especially thank Alexander Pilz for bringing this class of problems to our attention and Birgit Vogtenhuber for inspiring discussions. D.P. is partially supported by the FWF grant I 3340-N35 (Collaborative DACH project Arrangements and Drawings). The research stay of P.P. at IST Austria is funded by the project CZ.02.2.69/0.0/0.0/17_050/0008466 Improvement of internationalization in the field of research and development at Charles University, through the support of quality projects MSCA-IF. This project has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No 734922.","author":[{"last_name":"Aichholzer","full_name":"Aichholzer, Oswin","first_name":"Oswin"},{"first_name":"Julia","full_name":"Obmann, Julia","last_name":"Obmann"},{"first_name":"Pavel","full_name":"Patak, Pavel","id":"B593B804-1035-11EA-B4F1-947645A5BB83","last_name":"Patak"},{"first_name":"Daniel","full_name":"Perz, Daniel","last_name":"Perz"},{"last_name":"Tkadlec","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","full_name":"Tkadlec, Josef","first_name":"Josef","orcid":"0000-0002-1097-9684"}],"oa_version":"Published Version","main_file_link":[{"url":"https://www1.pub.informatik.uni-wuerzburg.de/eurocg2020/data/uploads/papers/eurocg20_paper_56.pdf","open_access":"1"}],"date_created":"2024-03-05T08:57:17Z","citation":{"ista":"Aichholzer O, Obmann J, Patak P, Perz D, Tkadlec J. 2020. Disjoint tree-compatible plane perfect matchings. 36th European Workshop on Computational Geometry. EuroCG: European Workshop on Computational Geometry, 56.","short":"O. Aichholzer, J. Obmann, P. Patak, D. Perz, J. Tkadlec, in:, 36th European Workshop on Computational Geometry, 2020.","chicago":"Aichholzer, Oswin, Julia Obmann, Pavel Patak, Daniel Perz, and Josef Tkadlec. “Disjoint Tree-Compatible Plane Perfect Matchings.” In <i>36th European Workshop on Computational Geometry</i>, 2020.","mla":"Aichholzer, Oswin, et al. “Disjoint Tree-Compatible Plane Perfect Matchings.” <i>36th European Workshop on Computational Geometry</i>, 56, 2020.","apa":"Aichholzer, O., Obmann, J., Patak, P., Perz, D., &#38; Tkadlec, J. (2020). Disjoint tree-compatible plane perfect matchings. In <i>36th European Workshop on Computational Geometry</i>. Würzburg, Germany, Virtual.","ama":"Aichholzer O, Obmann J, Patak P, Perz D, Tkadlec J. Disjoint tree-compatible plane perfect matchings. In: <i>36th European Workshop on Computational Geometry</i>. ; 2020.","ieee":"O. Aichholzer, J. Obmann, P. Patak, D. Perz, and J. Tkadlec, “Disjoint tree-compatible plane perfect matchings,” in <i>36th European Workshop on Computational Geometry</i>, Würzburg, Germany, Virtual, 2020."},"publication_status":"published","title":"Disjoint tree-compatible plane perfect matchings","oa":1,"date_published":"2020-04-01T00:00:00Z","_id":"15082","publication":"36th European Workshop on Computational Geometry","department":[{"_id":"KrCh"},{"_id":"UlWa"}]},{"volume":191,"oa":1,"isi":1,"arxiv":1,"publication":"Annals of Mathematics","doi":"10.4007/annals.2020.191.3.4","publist_id":"7744","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","day":"01","year":"2020","language":[{"iso":"eng"}],"status":"public","article_processing_charge":"No","month":"05","external_id":{"arxiv":["1711.10451"],"isi":["000526986300004"]},"quality_controlled":"1","oa_version":"Preprint","date_created":"2018-12-11T11:45:02Z","publication_status":"published","citation":{"ista":"Browning TD, Sawin W. 2020. A geometric version of the circle method. Annals of Mathematics. 191(3), 893–948.","mla":"Browning, Timothy D., and Will Sawin. “A Geometric Version of the Circle Method.” <i>Annals of Mathematics</i>, vol. 191, no. 3, Princeton University, 2020, pp. 893–948, doi:<a href=\"https://doi.org/10.4007/annals.2020.191.3.4\">10.4007/annals.2020.191.3.4</a>.","chicago":"Browning, Timothy D, and Will Sawin. “A Geometric Version of the Circle Method.” <i>Annals of Mathematics</i>. Princeton University, 2020. <a href=\"https://doi.org/10.4007/annals.2020.191.3.4\">https://doi.org/10.4007/annals.2020.191.3.4</a>.","short":"T.D. Browning, W. Sawin, Annals of Mathematics 191 (2020) 893–948.","ama":"Browning TD, Sawin W. A geometric version of the circle method. <i>Annals of Mathematics</i>. 2020;191(3):893-948. doi:<a href=\"https://doi.org/10.4007/annals.2020.191.3.4\">10.4007/annals.2020.191.3.4</a>","ieee":"T. D. Browning and W. Sawin, “A geometric version of the circle method,” <i>Annals of Mathematics</i>, vol. 191, no. 3. Princeton University, pp. 893–948, 2020.","apa":"Browning, T. D., &#38; Sawin, W. (2020). A geometric version of the circle method. <i>Annals of Mathematics</i>. Princeton University. <a href=\"https://doi.org/10.4007/annals.2020.191.3.4\">https://doi.org/10.4007/annals.2020.191.3.4</a>"},"date_published":"2020-05-01T00:00:00Z","_id":"177","title":"A geometric version of the circle method","department":[{"_id":"TiBr"}],"publisher":"Princeton University","type":"journal_article","intvolume":"       191","date_updated":"2023-08-17T07:12:37Z","article_type":"original","abstract":[{"text":"We develop a geometric version of the circle method and use it to compute the compactly supported cohomology of the space of rational curves through a point on a smooth affine hypersurface of sufficiently low degree.","lang":"eng"}],"page":"893-948","issue":"3","main_file_link":[{"url":"https://arxiv.org/abs/1711.10451","open_access":"1"}],"author":[{"id":"35827D50-F248-11E8-B48F-1D18A9856A87","last_name":"Browning","orcid":"0000-0002-8314-0177","full_name":"Browning, Timothy D","first_name":"Timothy D"},{"last_name":"Sawin","first_name":"Will","full_name":"Sawin, Will"}]}]