[{"scopus_import":"1","publisher":"Royal Society of Chemistry","oa":1,"intvolume":"        11","date_updated":"2026-07-07T05:50:51Z","doi":"10.1039/9781782626800-00444","citation":{"apa":"Lemeshko, M., &#38; Schmidt, R. (2017). Molecular impurities interacting with a many-particle environment: From ultracold gases to helium nanodroplets. In O. Dulieu &#38; A. Osterwalder (Eds.), <i>Cold Chemistry: Molecular Scattering and Reactivity Near Absolute Zero </i> (Vol. 11, pp. 444–495). Royal Society of Chemistry. <a href=\"https://doi.org/10.1039/9781782626800-00444\">https://doi.org/10.1039/9781782626800-00444</a>","ieee":"M. Lemeshko and R. Schmidt, “Molecular impurities interacting with a many-particle environment: From ultracold gases to helium nanodroplets,” in <i>Cold Chemistry: Molecular Scattering and Reactivity Near Absolute Zero </i>, vol. 11, O. Dulieu and A. Osterwalder, Eds. Royal Society of Chemistry, 2017, pp. 444–495.","mla":"Lemeshko, Mikhail, and Richard Schmidt. “Molecular Impurities Interacting with a Many-Particle Environment: From Ultracold Gases to Helium Nanodroplets.” <i>Cold Chemistry: Molecular Scattering and Reactivity Near Absolute Zero </i>, edited by Oliver Dulieu and Andreas Osterwalder, vol. 11, Royal Society of Chemistry, 2017, pp. 444–95, doi:<a href=\"https://doi.org/10.1039/9781782626800-00444\">10.1039/9781782626800-00444</a>.","ama":"Lemeshko M, Schmidt R. Molecular impurities interacting with a many-particle environment: From ultracold gases to helium nanodroplets. In: Dulieu O, Osterwalder A, eds. <i>Cold Chemistry: Molecular Scattering and Reactivity Near Absolute Zero </i>. Vol 11. Theoretical and Computational Chemistry Series. Royal Society of Chemistry; 2017:444-495. doi:<a href=\"https://doi.org/10.1039/9781782626800-00444\">10.1039/9781782626800-00444</a>","ista":"Lemeshko M, Schmidt R. 2017.Molecular impurities interacting with a many-particle environment: From ultracold gases to helium nanodroplets. In: Cold Chemistry: Molecular Scattering and Reactivity Near Absolute Zero . Theoretical and Computational Chemistry Series, vol. 11, 444–495.","short":"M. Lemeshko, R. Schmidt, in:, O. Dulieu, A. Osterwalder (Eds.), Cold Chemistry: Molecular Scattering and Reactivity Near Absolute Zero , Royal Society of Chemistry, 2017, pp. 444–495.","chicago":"Lemeshko, Mikhail, and Richard Schmidt. “Molecular Impurities Interacting with a Many-Particle Environment: From Ultracold Gases to Helium Nanodroplets.” In <i>Cold Chemistry: Molecular Scattering and Reactivity Near Absolute Zero </i>, edited by Oliver Dulieu and Andreas Osterwalder, 11:444–95. Theoretical and Computational Chemistry Series. Royal Society of Chemistry, 2017. <a href=\"https://doi.org/10.1039/9781782626800-00444\">https://doi.org/10.1039/9781782626800-00444</a>."},"alternative_title":["Theoretical and Computational Chemistry Series"],"type":"book_chapter","volume":11,"publication":"Cold Chemistry: Molecular Scattering and Reactivity Near Absolute Zero ","das_tickbox":"1","publication_status":"published","day":"14","arxiv":1,"fulldoi":"https://doi.org/10.1039/9781782626800-00444","abstract":[{"lang":"eng","text":"In several settings of physics and chemistry one has to deal with molecules interacting with some kind of an external environment, be it a gas, a solution, or a crystal surface. Understanding molecular processes in the presence of such a many-particle bath is inherently challenging, and usually requires large-scale numerical computations. Here, we present an alternative approach to the problem, based on the notion of the angulon quasiparticle. We show that molecules rotating inside superfluid helium nanodroplets and Bose–Einstein condensates form angulons, and therefore can be described by straightforward solutions of a simple microscopic Hamiltonian. Casting the problem in the language of angulons allows us not only to greatly simplify it, but also to gain insights into the origins of the observed phenomena and to make predictions for future experimental studies."}],"publist_id":"7201","author":[{"last_name":"Lemeshko","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","full_name":"Lemeshko, Mikhail","first_name":"Mikhail","orcid":"0000-0002-6990-7802"},{"last_name":"Schmidt","first_name":"Richard","full_name":"Schmidt, Richard"}],"publication_identifier":{"issn":["2041-3181"]},"language":[{"iso":"eng"}],"month":"12","_id":"604","quality_controlled":"1","year":"2017","status":"public","page":"444 - 495","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1703.06753"}],"title":"Molecular impurities interacting with a many-particle environment: From ultracold gases to helium nanodroplets","oa_version":"Submitted Version","external_id":{"arxiv":["1703.06753"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","date_created":"2018-12-11T11:47:27Z","series_title":"Theoretical and Computational Chemistry Series","date_published":"2017-12-14T00:00:00Z","editor":[{"full_name":"Dulieu, Oliver","first_name":"Oliver","last_name":"Dulieu"},{"first_name":"Andreas","full_name":"Osterwalder, Andreas","last_name":"Osterwalder"}],"department":[{"_id":"MiLe"}]},{"language":[{"iso":"eng"}],"publication_identifier":{"issn":["1742-5468"]},"month":"09","ec_funded":1,"_id":"823","project":[{"name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734"}],"quality_controlled":"1","status":"public","year":"2017","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1705.06303"}],"title":"Phase transitions in integer linear problems","oa_version":"Submitted Version","external_id":{"arxiv":["1705.06303"],"isi":["000411842900001"]},"isi":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","date_created":"2018-12-11T11:48:41Z","date_published":"2017-09-26T00:00:00Z","department":[{"_id":"GaTk"}],"scopus_import":"1","publisher":"IOP Publishing","oa":1,"date_updated":"2026-07-07T13:11:04Z","intvolume":"      2017","doi":"10.1088/1742-5468/aa85c3","citation":{"ieee":"S. Colabrese, D. De Martino, L. Leuzzi, and E. Marinari, “Phase transitions in integer linear problems,” <i>Journal of Statistical Mechanics: Theory and Experiment</i>, vol. 2017, no. 9. IOP Publishing, 2017.","apa":"Colabrese, S., De Martino, D., Leuzzi, L., &#38; Marinari, E. (2017). Phase transitions in integer linear problems. <i>Journal of Statistical Mechanics: Theory and Experiment</i>. IOP Publishing. <a href=\"https://doi.org/10.1088/1742-5468/aa85c3\">https://doi.org/10.1088/1742-5468/aa85c3</a>","chicago":"Colabrese, Simona, Daniele De Martino, Luca Leuzzi, and Enzo Marinari. “Phase Transitions in Integer Linear Problems.” <i>Journal of Statistical Mechanics: Theory and Experiment</i>. IOP Publishing, 2017. <a href=\"https://doi.org/10.1088/1742-5468/aa85c3\">https://doi.org/10.1088/1742-5468/aa85c3</a>.","ama":"Colabrese S, De Martino D, Leuzzi L, Marinari E. Phase transitions in integer linear problems. <i>Journal of Statistical Mechanics: Theory and Experiment</i>. 2017;2017(9). doi:<a href=\"https://doi.org/10.1088/1742-5468/aa85c3\">10.1088/1742-5468/aa85c3</a>","mla":"Colabrese, Simona, et al. “Phase Transitions in Integer Linear Problems.” <i>Journal of Statistical Mechanics: Theory and Experiment</i>, vol. 2017, no. 9, 093404, IOP Publishing, 2017, doi:<a href=\"https://doi.org/10.1088/1742-5468/aa85c3\">10.1088/1742-5468/aa85c3</a>.","ista":"Colabrese S, De Martino D, Leuzzi L, Marinari E. 2017. Phase transitions in integer linear problems. Journal of Statistical Mechanics: Theory and Experiment. 2017(9), 093404.","short":"S. Colabrese, D. De Martino, L. Leuzzi, E. Marinari, Journal of Statistical Mechanics: Theory and Experiment 2017 (2017)."},"article_number":"093404","type":"journal_article","publication":"Journal of Statistical Mechanics: Theory and Experiment","volume":2017,"das_tickbox":"1","issue":"9","publication_status":"published","day":"26","arxiv":1,"fulldoi":"https://doi.org/10.1088/1742-5468/aa85c3","abstract":[{"text":"The resolution of a linear system with positive integer variables is a basic yet difficult computational problem with many applications. We consider sparse uncorrelated random systems parametrised by the density c and the ratio α=N/M between number of variables N and number of constraints M. By means of ensemble calculations we show that the space of feasible solutions endows a Van-Der-Waals phase diagram in the plane (c, α). We give numerical evidence that the associated computational problems become more difficult across the critical point and in particular in the coexistence region.","lang":"eng"}],"publist_id":"6826","author":[{"full_name":"Colabrese, Simona","first_name":"Simona","last_name":"Colabrese"},{"full_name":"De Martino, Daniele","first_name":"Daniele","id":"3FF5848A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-5214-4706","last_name":"De Martino"},{"first_name":"Luca","full_name":"Leuzzi, Luca","last_name":"Leuzzi"},{"full_name":"Marinari, Enzo","first_name":"Enzo","last_name":"Marinari"}]},{"intvolume":"        58","date_updated":"2026-07-07T13:10:46Z","doi":"10.1063/1.4996580","publisher":"AIP Publishing","scopus_import":"1","oa":1,"volume":58,"publication":"Journal of Mathematical Physics","type":"journal_article","issue":"8","das_tickbox":"1","article_number":"081901","citation":{"ieee":"A. Deuchert, “A lower bound for the BCS functional with boundary conditions at infinity,” <i>Journal of Mathematical Physics</i>, vol. 58, no. 8. AIP Publishing, 2017.","apa":"Deuchert, A. (2017). A lower bound for the BCS functional with boundary conditions at infinity. <i>Journal of Mathematical Physics</i>. AIP Publishing. <a href=\"https://doi.org/10.1063/1.4996580\">https://doi.org/10.1063/1.4996580</a>","chicago":"Deuchert, Andreas. “A Lower Bound for the BCS Functional with Boundary Conditions at Infinity.” <i>Journal of Mathematical Physics</i>. AIP Publishing, 2017. <a href=\"https://doi.org/10.1063/1.4996580\">https://doi.org/10.1063/1.4996580</a>.","mla":"Deuchert, Andreas. “A Lower Bound for the BCS Functional with Boundary Conditions at Infinity.” <i>Journal of Mathematical Physics</i>, vol. 58, no. 8, 081901, AIP Publishing, 2017, doi:<a href=\"https://doi.org/10.1063/1.4996580\">10.1063/1.4996580</a>.","ama":"Deuchert A. A lower bound for the BCS functional with boundary conditions at infinity. <i>Journal of Mathematical Physics</i>. 2017;58(8). doi:<a href=\"https://doi.org/10.1063/1.4996580\">10.1063/1.4996580</a>","ista":"Deuchert A. 2017. A lower bound for the BCS functional with boundary conditions at infinity. Journal of Mathematical Physics. 58(8), 081901.","short":"A. Deuchert, Journal of Mathematical Physics 58 (2017)."},"fulldoi":"https://doi.org/10.1063/1.4996580","corr_author":"1","abstract":[{"lang":"eng","text":"We consider a many-body system of fermionic atoms interacting via a local pair potential and subject to an external potential within the framework of Bardeen-Cooper-Schrieffer (BCS) theory. We measure the free energy of the whole sample with respect to the free energy of a reference state which allows us to define a BCS functional with boundary conditions at infinity. Our main result is a lower bound for this energy functional in terms of expressions that typically appear in Ginzburg-Landau functionals.\r\n"}],"publication_status":"published","day":"01","arxiv":1,"publist_id":"6531","author":[{"orcid":"0000-0003-3146-6746","id":"4DA65CD0-F248-11E8-B48F-1D18A9856A87","full_name":"Deuchert, Andreas","first_name":"Andreas","last_name":"Deuchert"}],"ec_funded":1,"_id":"912","publication_identifier":{"issn":["0022-2488"]},"language":[{"iso":"eng"}],"month":"08","main_file_link":[{"url":"https://arxiv.org/abs/1703.04616","open_access":"1"}],"quality_controlled":"1","year":"2017","status":"public","project":[{"call_identifier":"H2020","_id":"25C6DC12-B435-11E9-9278-68D0E5697425","grant_number":"694227","name":"Analysis of quantum many-body systems"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","oa_version":"Submitted Version","title":"A lower bound for the BCS functional with boundary conditions at infinity","isi":1,"external_id":{"arxiv":["1703.04616"],"isi":["000409197200015"]},"department":[{"_id":"RoSe"}],"date_created":"2018-12-11T11:49:10Z","date_published":"2017-08-01T00:00:00Z"},{"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","isi":1,"external_id":{"pmid":["28867224"],"isi":["000412039800007"]},"oa_version":"Submitted Version","title":"Optional interactions and suspicious behaviour facilitates trustful cooperation in prisoners dilemma","ddc":["000","570"],"department":[{"_id":"KrCh"}],"date_published":"2017-11-21T00:00:00Z","date_created":"2018-12-11T11:48:16Z","file":[{"access_level":"open_access","content_type":"application/pdf","date_updated":"2020-07-14T12:47:58Z","file_id":"7047","relation":"main_file","file_size":537323,"creator":"dernst","file_name":"2017_JournTheoretBio_Priklopil.pdf","checksum":"4b43af1615ebf1a861840cb03d8a320c","date_created":"2019-11-19T07:57:39Z"}],"_id":"744","ec_funded":1,"has_accepted_license":"1","month":"11","publication_identifier":{"issn":["0022-5193"]},"language":[{"iso":"eng"}],"page":"64 - 72","license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","year":"2017","status":"public","quality_controlled":"1","project":[{"name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"291734"},{"call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications"}],"abstract":[{"text":"In evolutionary game theory interactions between individuals are often assumed obligatory. However, in many real-life situations, individuals can decide to opt out of an interaction depending on the information they have about the opponent. We consider a simple evolutionary game theoretic model to study such a scenario, where at each encounter between two individuals the type of the opponent (cooperator/defector) is known with some probability, and where each individual either accepts or opts out of the interaction. If the type of the opponent is unknown, a trustful individual accepts the interaction, whereas a suspicious individual opts out of the interaction. If either of the two individuals opt out both individuals remain without an interaction. We show that in the prisoners dilemma optional interactions along with suspicious behaviour facilitates the emergence of trustful cooperation.","lang":"eng"}],"fulldoi":"https://doi.org/10.1016/j.jtbi.2017.08.025","file_date_updated":"2020-07-14T12:47:58Z","corr_author":"1","day":"21","publication_status":"published","author":[{"last_name":"Priklopil","full_name":"Priklopil, Tadeas","first_name":"Tadeas","id":"3C869AA0-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"last_name":"Nowak","full_name":"Nowak, Martin","first_name":"Martin"}],"publist_id":"6923","article_type":"original","doi":"10.1016/j.jtbi.2017.08.025","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","image":"/images/cc_by_nc_nd.png","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","short":"CC BY-NC-ND (4.0)"},"date_updated":"2026-07-07T13:11:54Z","intvolume":"       433","oa":1,"pmid":1,"publisher":"Elsevier","scopus_import":"1","das_tickbox":"1","publication":"Journal of Theoretical Biology","volume":433,"type":"journal_article","citation":{"ieee":"T. Priklopil, K. Chatterjee, and M. Nowak, “Optional interactions and suspicious behaviour facilitates trustful cooperation in prisoners dilemma,” <i>Journal of Theoretical Biology</i>, vol. 433. Elsevier, pp. 64–72, 2017.","apa":"Priklopil, T., Chatterjee, K., &#38; Nowak, M. (2017). Optional interactions and suspicious behaviour facilitates trustful cooperation in prisoners dilemma. <i>Journal of Theoretical Biology</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.jtbi.2017.08.025\">https://doi.org/10.1016/j.jtbi.2017.08.025</a>","chicago":"Priklopil, Tadeas, Krishnendu Chatterjee, and Martin Nowak. “Optional Interactions and Suspicious Behaviour Facilitates Trustful Cooperation in Prisoners Dilemma.” <i>Journal of Theoretical Biology</i>. Elsevier, 2017. <a href=\"https://doi.org/10.1016/j.jtbi.2017.08.025\">https://doi.org/10.1016/j.jtbi.2017.08.025</a>.","short":"T. Priklopil, K. Chatterjee, M. Nowak, Journal of Theoretical Biology 433 (2017) 64–72.","ista":"Priklopil T, Chatterjee K, Nowak M. 2017. Optional interactions and suspicious behaviour facilitates trustful cooperation in prisoners dilemma. Journal of Theoretical Biology. 433, 64–72.","mla":"Priklopil, Tadeas, et al. “Optional Interactions and Suspicious Behaviour Facilitates Trustful Cooperation in Prisoners Dilemma.” <i>Journal of Theoretical Biology</i>, vol. 433, Elsevier, 2017, pp. 64–72, doi:<a href=\"https://doi.org/10.1016/j.jtbi.2017.08.025\">10.1016/j.jtbi.2017.08.025</a>.","ama":"Priklopil T, Chatterjee K, Nowak M. Optional interactions and suspicious behaviour facilitates trustful cooperation in prisoners dilemma. <i>Journal of Theoretical Biology</i>. 2017;433:64-72. doi:<a href=\"https://doi.org/10.1016/j.jtbi.2017.08.025\">10.1016/j.jtbi.2017.08.025</a>"}},{"abstract":[{"text":"Signatures of the Coulomb corrections in the photoelectron momentum distribution during laser-induced ionization of atoms or ions in tunneling and multiphoton regimes are investigated analytically in the case of a one-dimensional problem. A high-order Coulomb-corrected strong-field approximation is applied, where the exact continuum state in the S matrix is approximated by the eikonal Coulomb-Volkov state including the second-order corrections to the eikonal. Although without high-order corrections our theory coincides with the known analytical R-matrix (ARM) theory, we propose a simplified procedure for the matrix element derivation. Rather than matching the eikonal Coulomb-Volkov wave function with the bound state as in the ARM theory to remove the Coulomb singularity, we calculate the matrix element via the saddle-point integration method by time as well as by coordinate, and in this way avoiding the Coulomb singularity. The momentum shift in the photoelectron momentum distribution with respect to the ARM theory due to high-order corrections is analyzed for tunneling and multiphoton regimes. The relation of the quantum corrections to the tunneling delay time is discussed.","lang":"eng"}],"fulldoi":"https://doi.org/10.1103/PhysRevA.95.023403","arxiv":1,"publication_status":"published","day":"01","author":[{"last_name":"Klaiber","first_name":"Michael","full_name":"Klaiber, Michael"},{"last_name":"Daněk","full_name":"Daněk, Jiří","first_name":"Jiří"},{"last_name":"Yakaboylu","orcid":"0000-0001-5973-0874","first_name":"Enderalp","id":"38CB71F6-F248-11E8-B48F-1D18A9856A87","full_name":"Yakaboylu, Enderalp"},{"first_name":"Karen","full_name":"Hatsagortsyan, Karen","last_name":"Hatsagortsyan"},{"last_name":"Keitel","full_name":"Keitel, Christoph","first_name":"Christoph"}],"publist_id":"6305","doi":"10.1103/PhysRevA.95.023403","intvolume":"        95","date_updated":"2026-07-07T13:17:34Z","oa":1,"publisher":"American Physical Society","scopus_import":"1","issue":"2","das_tickbox":"1","volume":95,"publication":"Physical Review A","type":"journal_article","article_number":"023403","citation":{"apa":"Klaiber, M., Daněk, J., Yakaboylu, E., Hatsagortsyan, K., &#38; Keitel, C. (2017). Strong-field ionization via a high-order Coulomb-corrected strong-field approximation. <i>Physical Review A</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevA.95.023403\">https://doi.org/10.1103/PhysRevA.95.023403</a>","ieee":"M. Klaiber, J. Daněk, E. Yakaboylu, K. Hatsagortsyan, and C. Keitel, “Strong-field ionization via a high-order Coulomb-corrected strong-field approximation,” <i>Physical Review A</i>, vol. 95, no. 2. American Physical Society, 2017.","mla":"Klaiber, Michael, et al. “Strong-Field Ionization via a High-Order Coulomb-Corrected Strong-Field Approximation.” <i>Physical Review A</i>, vol. 95, no. 2, 023403, American Physical Society, 2017, doi:<a href=\"https://doi.org/10.1103/PhysRevA.95.023403\">10.1103/PhysRevA.95.023403</a>.","ama":"Klaiber M, Daněk J, Yakaboylu E, Hatsagortsyan K, Keitel C. Strong-field ionization via a high-order Coulomb-corrected strong-field approximation. <i>Physical Review A</i>. 2017;95(2). doi:<a href=\"https://doi.org/10.1103/PhysRevA.95.023403\">10.1103/PhysRevA.95.023403</a>","ista":"Klaiber M, Daněk J, Yakaboylu E, Hatsagortsyan K, Keitel C. 2017. Strong-field ionization via a high-order Coulomb-corrected strong-field approximation. Physical Review A. 95(2), 023403.","short":"M. Klaiber, J. Daněk, E. Yakaboylu, K. Hatsagortsyan, C. Keitel, Physical Review A 95 (2017).","chicago":"Klaiber, Michael, Jiří Daněk, Enderalp Yakaboylu, Karen Hatsagortsyan, and Christoph Keitel. “Strong-Field Ionization via a High-Order Coulomb-Corrected Strong-Field Approximation.” <i>Physical Review A</i>. American Physical Society, 2017. <a href=\"https://doi.org/10.1103/PhysRevA.95.023403\">https://doi.org/10.1103/PhysRevA.95.023403</a>."},"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","isi":1,"external_id":{"isi":["000400571700011"],"arxiv":["1609.07018"]},"oa_version":"Submitted Version","title":"Strong-field ionization via a high-order Coulomb-corrected strong-field approximation","department":[{"_id":"MiLe"}],"date_published":"2017-02-01T00:00:00Z","date_created":"2018-12-11T11:50:01Z","_id":"1076","ec_funded":1,"month":"02","publication_identifier":{"issn":["2469-9926"]},"language":[{"iso":"eng"}],"main_file_link":[{"url":"https://arxiv.org/abs/1609.07018","open_access":"1"}],"year":"2017","status":"public","quality_controlled":"1","project":[{"name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734"}]},{"external_id":{"arxiv":["1702.01666"]},"oa_version":"Preprint","title":"On the complexity of estimating Rènyi divergences","article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2017-08-09T00:00:00Z","date_created":"2019-06-06T12:53:09Z","department":[{"_id":"KrPi"}],"month":"08","publication_identifier":{"isbn":["9781509040964"]},"language":[{"iso":"eng"}],"_id":"6526","ec_funded":1,"status":"public","quality_controlled":"1","year":"2017","project":[{"name":"Teaching Old Crypto New Tricks","grant_number":"682815","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"main_file_link":[{"url":"https://arxiv.org/abs/1702.01666","open_access":"1"}],"publication_status":"published","arxiv":1,"day":"09","conference":{"name":"ISIT: International Symposium on Information Theory","location":"Aachen, Germany","start_date":"2017-06-25","end_date":"2017-06-30"},"abstract":[{"text":"This paper studies the complexity of estimating Rényi divergences of discrete distributions: p observed from samples and the baseline distribution q known a priori. Extending the results of Acharya et al. (SODA'15) on estimating Rényi entropy, we present improved estimation techniques together with upper and lower bounds on the sample complexity. We show that, contrarily to estimating Rényi entropy where a sublinear (in the alphabet size) number of samples suffices, the sample complexity is heavily dependent on events occurring unlikely in q, and is unbounded in general (no matter what an estimation technique is used). For any divergence of integer order bigger than 1, we provide upper and lower bounds on the number of samples dependent on probabilities of p and q (the lower bounds hold for non-integer orders as well). We conclude that the worst-case sample complexity is polynomial in the alphabet size if and only if the probabilities of q are non-negligible. This gives theoretical insights into heuristics used in the applied literature to handle numerical instability, which occurs for small probabilities of q. Our result shows that they should be handled with care not only because of numerical issues, but also because of a blow up in the sample complexity.","lang":"eng"}],"fulldoi":"https://doi.org/10.1109/isit.2017.8006529","author":[{"last_name":"Skórski","id":"EC09FA6A-02D0-11E9-8223-86B7C91467DD","full_name":"Skórski, Maciej","first_name":"Maciej"}],"oa":1,"publisher":"IEEE","scopus_import":"1","doi":"10.1109/isit.2017.8006529","date_updated":"2026-07-07T13:32:59Z","article_number":"8006529","citation":{"apa":"Skórski, M. (2017). On the complexity of estimating Rènyi divergences. In <i>2017 IEEE International Symposium on Information Theory</i>. Aachen, Germany: IEEE. <a href=\"https://doi.org/10.1109/isit.2017.8006529\">https://doi.org/10.1109/isit.2017.8006529</a>","ieee":"M. Skórski, “On the complexity of estimating Rènyi divergences,” in <i>2017 IEEE International Symposium on Information Theory</i>, Aachen, Germany, 2017.","ista":"Skórski M. 2017. On the complexity of estimating Rènyi divergences. 2017 IEEE International Symposium on Information Theory. ISIT: International Symposium on Information Theory, 8006529.","short":"M. Skórski, in:, 2017 IEEE International Symposium on Information Theory, IEEE, 2017.","mla":"Skórski, Maciej. “On the Complexity of Estimating Rènyi Divergences.” <i>2017 IEEE International Symposium on Information Theory</i>, 8006529, IEEE, 2017, doi:<a href=\"https://doi.org/10.1109/isit.2017.8006529\">10.1109/isit.2017.8006529</a>.","ama":"Skórski M. On the complexity of estimating Rènyi divergences. In: <i>2017 IEEE International Symposium on Information Theory</i>. IEEE; 2017. doi:<a href=\"https://doi.org/10.1109/isit.2017.8006529\">10.1109/isit.2017.8006529</a>","chicago":"Skórski, Maciej. “On the Complexity of Estimating Rènyi Divergences.” In <i>2017 IEEE International Symposium on Information Theory</i>. IEEE, 2017. <a href=\"https://doi.org/10.1109/isit.2017.8006529\">https://doi.org/10.1109/isit.2017.8006529</a>."},"das_tickbox":"1","publication":"2017 IEEE International Symposium on Information Theory","type":"conference"},{"oa":1,"publisher":"ACM","scopus_import":"1","doi":"10.1145/3152769","date_updated":"2026-07-07T14:01:10Z","intvolume":"        18","citation":{"chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Nested Weighted Automata.” <i>ACM Transactions on Computational Logic</i>. ACM, 2017. <a href=\"https://doi.org/10.1145/3152769\">https://doi.org/10.1145/3152769</a>.","mla":"Chatterjee, Krishnendu, et al. “Nested Weighted Automata.” <i>ACM Transactions on Computational Logic</i>, vol. 18, no. 4, 31, ACM, 2017, doi:<a href=\"https://doi.org/10.1145/3152769\">10.1145/3152769</a>.","ama":"Chatterjee K, Henzinger TA, Otop J. Nested weighted automata. <i>ACM Transactions on Computational Logic</i>. 2017;18(4). doi:<a href=\"https://doi.org/10.1145/3152769\">10.1145/3152769</a>","short":"K. Chatterjee, T.A. Henzinger, J. Otop, ACM Transactions on Computational Logic 18 (2017).","ista":"Chatterjee K, Henzinger TA, Otop J. 2017. Nested weighted automata. ACM Transactions on Computational Logic. 18(4), 31.","ieee":"K. Chatterjee, T. A. Henzinger, and J. Otop, “Nested weighted automata,” <i>ACM Transactions on Computational Logic</i>, vol. 18, no. 4. ACM, 2017.","apa":"Chatterjee, K., Henzinger, T. A., &#38; Otop, J. (2017). Nested weighted automata. <i>ACM Transactions on Computational Logic</i>. ACM. <a href=\"https://doi.org/10.1145/3152769\">https://doi.org/10.1145/3152769</a>"},"article_number":"31","das_tickbox":"1","issue":"4","type":"journal_article","volume":18,"publication":"ACM Transactions on Computational Logic","arxiv":1,"publication_status":"published","day":"01","abstract":[{"lang":"eng","text":"Recently there has been a significant effort to handle quantitative properties in formal verification and synthesis. While weighted automata over finite and infinite words provide a natural and flexible framework to express quantitative properties, perhaps surprisingly, some basic system properties such as average response time cannot be expressed using weighted automata or in any other known decidable formalism. In this work, we introduce nested weighted automata as a natural extension of weighted automata, which makes it possible to express important quantitative properties such as average response time. In nested weighted automata, a master automaton spins off and collects results from weighted slave automata, each of which computes a quantity along a finite portion of an infinite word. Nested weighted automata can be viewed as the quantitative analogue of monitor automata, which are used in runtime verification. We establish an almost-complete decidability picture for the basic decision problems about nested weighted automata and illustrate their applicability in several domains. In particular, nested weighted automata can be used to decide average response time properties."}],"corr_author":"1","fulldoi":"https://doi.org/10.1145/3152769","author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee"},{"last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724"},{"first_name":"Jan","full_name":"Otop, Jan","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","last_name":"Otop"}],"publist_id":"7354","month":"12","language":[{"iso":"eng"}],"publication_identifier":{"issn":["1529-3785"]},"_id":"467","ec_funded":1,"project":[{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"},{"name":"Formal methods for the design and analysis of complex systems","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211"},{"name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"P 23499-N23"},{"name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","status":"public","year":"2017","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1606.03598"}],"external_id":{"isi":["000419237100006"],"arxiv":["1606.03598"]},"isi":1,"title":"Nested weighted automata","oa_version":"Preprint","related_material":{"record":[{"status":"public","relation":"earlier_version","id":"5415"},{"status":"public","relation":"earlier_version","id":"5436"},{"status":"public","relation":"earlier_version","id":"1656"}]},"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2017-12-01T00:00:00Z","date_created":"2018-12-11T11:46:38Z","department":[{"_id":"KrCh"},{"_id":"ToHe"}]},{"doi":"10.15479/AT:ISTA:th_873","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)"},"date_updated":"2026-07-28T13:38:07Z","degree_awarded":"PhD","oa":1,"publisher":"Institute of Science and Technology Austria","type":"dissertation","alternative_title":["ISTA Thesis"],"citation":{"chicago":"Nikitenko, Anton. “Discrete Morse Theory for Random Complexes .” Institute of Science and Technology Austria, 2017. <a href=\"https://doi.org/10.15479/AT:ISTA:th_873\">https://doi.org/10.15479/AT:ISTA:th_873</a>.","ama":"Nikitenko A. Discrete Morse theory for random complexes . 2017. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:th_873\">10.15479/AT:ISTA:th_873</a>","mla":"Nikitenko, Anton. <i>Discrete Morse Theory for Random Complexes </i>. Institute of Science and Technology Austria, 2017, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:th_873\">10.15479/AT:ISTA:th_873</a>.","short":"A. Nikitenko, Discrete Morse Theory for Random Complexes , Institute of Science and Technology Austria, 2017.","ista":"Nikitenko A. 2017. Discrete Morse theory for random complexes . Institute of Science and Technology Austria.","ieee":"A. Nikitenko, “Discrete Morse theory for random complexes ,” Institute of Science and Technology Austria, 2017.","apa":"Nikitenko, A. (2017). <i>Discrete Morse theory for random complexes </i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:th_873\">https://doi.org/10.15479/AT:ISTA:th_873</a>"},"abstract":[{"text":"The main objects considered in the present work are simplicial and CW-complexes with vertices forming a random point cloud. In particular, we consider a Poisson point process in R^n and study Delaunay and Voronoi complexes of the first and higher orders and weighted Delaunay complexes obtained as sections of Delaunay complexes, as well as the Čech complex. Further, we examine theDelaunay complex of a Poisson point process on the sphere S^n, as well as of a uniform point cloud, which is equivalent to the convex hull, providing a connection to the theory of random polytopes. Each of the complexes in question can be endowed with a radius function, which maps its cells to the radii of appropriately chosen circumspheres, called the radius of the cell. Applying and developing discrete Morse theory for these functions, joining it together with probabilistic and sometimes analytic machinery, and developing several integral geometric tools, we aim at getting the distributions of circumradii of typical cells. For all considered complexes, we are able to generalize and obtain up to constants the distribution of radii of typical intervals of all types. In low dimensions the constants can be computed explicitly, thus providing the explicit expressions for the expected numbers of cells. In particular, it allows to find the expected density of simplices of every dimension for a Poisson point process in R^4, whereas the result for R^3 was known already in 1970's.","lang":"eng"}],"fulldoi":"https://doi.org/10.15479/AT:ISTA:th_873","corr_author":"1","file_date_updated":"2020-07-14T12:47:26Z","OA_place":"publisher","supervisor":[{"orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner"}],"day":"27","publication_status":"published","author":[{"last_name":"Nikitenko","orcid":"0000-0002-0659-3201","id":"3E4FF1BA-F248-11E8-B48F-1D18A9856A87","full_name":"Nikitenko, Anton","first_name":"Anton"}],"_id":"6287","pubrep_id":"873","has_accepted_license":"1","month":"10","publication_identifier":{"issn":["2663-337X"]},"language":[{"iso":"eng"}],"page":"86","license":"https://creativecommons.org/licenses/by/4.0/","status":"public","year":"2017","article_processing_charge":"No","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","related_material":{"record":[{"relation":"part_of_dissertation","status":"public","id":"87"},{"id":"718","relation":"part_of_dissertation","status":"public"},{"status":"public","relation":"part_of_dissertation","id":"5678"}]},"oa_version":"Published Version","title":"Discrete Morse theory for random complexes ","ddc":["514","516","519"],"department":[{"_id":"HeEd"}],"date_published":"2017-10-27T00:00:00Z","file":[{"relation":"main_file","file_size":2324870,"access_level":"open_access","file_id":"6289","date_updated":"2020-07-14T12:47:26Z","content_type":"application/pdf","checksum":"ece7e598a2f060b263c2febf7f3fe7f9","date_created":"2019-04-09T14:54:51Z","creator":"dernst","file_name":"2017_Thesis_Nikitenko.pdf"},{"checksum":"99b7ad76e317efd447af60f91e29b49b","date_created":"2019-04-09T14:54:51Z","creator":"dernst","file_name":"2017_Thesis_Nikitenko_source.zip","relation":"source_file","file_size":2863219,"access_level":"closed","date_updated":"2020-07-14T12:47:26Z","content_type":"application/zip","file_id":"6290"}],"date_created":"2019-04-09T15:04:32Z"},{"oa":1,"publisher":"Institute of Science and Technology Austria","date_updated":"2026-07-29T12:01:27Z","degree_awarded":"PhD","citation":{"apa":"Prat, T. (2017). <i>Identification of novel regulators of PIN polarity and development of novel auxin sensor</i>. Institute of Science and Technology Austria.","ieee":"T. Prat, “Identification of novel regulators of PIN polarity and development of novel auxin sensor,” Institute of Science and Technology Austria, 2017.","short":"T. Prat, Identification of Novel Regulators of PIN Polarity and Development of Novel Auxin Sensor, Institute of Science and Technology Austria, 2017.","ista":"Prat T. 2017. Identification of novel regulators of PIN polarity and development of novel auxin sensor. Institute of Science and Technology Austria.","ama":"Prat T. Identification of novel regulators of PIN polarity and development of novel auxin sensor. 2017.","mla":"Prat, Tomas. <i>Identification of Novel Regulators of PIN Polarity and Development of Novel Auxin Sensor</i>. Institute of Science and Technology Austria, 2017.","chicago":"Prat, Tomas. “Identification of Novel Regulators of PIN Polarity and Development of Novel Auxin Sensor.” Institute of Science and Technology Austria, 2017."},"alternative_title":["ISTA Thesis"],"type":"dissertation","publication_status":"published","day":"12","abstract":[{"lang":"eng","text":"Plant hormone auxin and its transport between cells belong to the most important\r\nmechanisms controlling plant development. Auxin itself could change localization of PINs and\r\nthereby control direction of its own flow. We performed an expression profiling experiment\r\nin Arabidopsis roots to identify potential regulators of PIN polarity which are transcriptionally\r\nregulated by auxin signalling. We identified several novel regulators and performed a detailed\r\ncharacterization of the transcription factor WRKY23 (At2g47260) and its role in auxin\r\nfeedback on PIN polarity. Gain-of-function and dominant-negative mutants revealed that\r\nWRKY23 plays a crucial role in mediating the auxin effect on PIN polarity. In concordance,\r\ntypical polar auxin transport processes such as gravitropism and leaf vascular pattern\r\nformation were disturbed by interfering with WRKY23 function.\r\nIn order to identify direct targets of WRKY23, we performed consequential expression\r\nprofiling experiments using a WRKY23 inducible gain-of-function line and dominant-negative\r\nWRKY23 line that is defunct in PIN re-arrangement. Among several genes mostly related to\r\nthe groups of cell wall and defense process regulators, we identified LYSINE-HISTIDINE\r\nTRANSPORTER 1 (LHT1; At5g40780), a small amino acid permease gene from the amino\r\nacid/auxin permease family (AAAP), we present its detailed characterisation in auxin feedback\r\non PIN repolarization, identified its transcriptional regulation, we propose a potential\r\nmechanism of its action. Moreover, we identified also a member of receptor-like protein\r\nkinase LRR-RLK (LEUCINE-RICH REPEAT TRANSMEMBRANE PROTEIN KINASE PROTEIN 1;\r\nLRRK1; At1g05700), which also affects auxin-dependent PIN re-arrangement. We described\r\nits transcriptional behaviour, subcellular localization. Based on global expression data, we\r\ntried to identify ligand responsible for mechanism of signalling and suggest signalling partner\r\nand interactors. Additionally, we described role of novel phytohormone group, strigolactone,\r\nin auxin-dependent PIN re-arrangement, that could be a fundament for future studies in this\r\nfield.\r\nOur results provide first insights into an auxin transcriptional network targeting PIN\r\nlocalization and thus regulating plant development. We highlighted WRKY23 transcriptional\r\nnetwork and characterised its mediatory role in plant development. We identified direct\r\neffectors of this network, LHT1 and LRRK1, and describe their roles in PIN re-arrangement and\r\nPIN-dependent auxin transport processes."}],"supervisor":[{"last_name":"Friml","orcid":"0000-0002-8302-7596","id":"4159519E-F248-11E8-B48F-1D18A9856A87","first_name":"Jiří","full_name":"Friml, Jiří"}],"file_date_updated":"2021-02-22T11:52:56Z","OA_place":"publisher","corr_author":"1","author":[{"full_name":"Prat, Tomas","id":"3DA3BFEE-F248-11E8-B48F-1D18A9856A87","first_name":"Tomas","last_name":"Prat"}],"publist_id":"6233","month":"01","has_accepted_license":"1","language":[{"iso":"eng"}],"publication_identifier":{"issn":["2663-337X"]},"_id":"1127","status":"public","year":"2017","page":"131","doi_confirm":"1","acknowledgement":"I would like to first acknowledge my supervisor Jiří Friml for support, kind advice and patience. It was a pleasure to be a part of your lab, Jiří. I will remember the atmosphere present in auxin lab at VIB in Ghent and at IST in Klosterneuburg forever. I would like to thank all past and present lab members for the friendship and friendly and scientific environment in the groups. It was so nice to cooperate with you, guys. There was always someone who helped me with experiments, troubleshoot issues coming from our work etc. At this place, I would like to thank especially to Gergo Molnár. I’m happy (and lucky) that I have met him; he naturally became my tutor and guide through my PhD. From no one else during my entire professional career, I’ve learned that much.","title":"Identification of novel regulators of PIN polarity and development of novel auxin sensor","related_material":{"record":[{"id":"449","relation":"part_of_dissertation","status":"public"}]},"oa_version":"Published Version","article_processing_charge":"No","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","date_published":"2017-01-12T00:00:00Z","file":[{"date_updated":"2019-04-05T08:45:14Z","content_type":"application/pdf","file_id":"6209","access_level":"closed","file_size":10285946,"relation":"main_file","file_name":"IST_Austria_Thesis_Tomáš_Prát.pdf","creator":"dernst","date_created":"2019-04-05T08:45:14Z","checksum":"d192c7c6c5ea32c8432437286dc4909e"},{"file_size":9802991,"relation":"main_file","access_level":"open_access","content_type":"application/pdf","date_updated":"2021-02-22T11:52:56Z","file_id":"9185","checksum":"bab18b52cf98145926042d8ed99fdb3b","date_created":"2021-02-22T11:52:56Z","success":1,"creator":"dernst","file_name":"2017_Thesis_Prat.pdf"}],"date_created":"2018-12-11T11:50:17Z","ddc":["580"],"department":[{"_id":"JiFr"},{"_id":"GradSch"}]},{"date_published":"2017-08-14T00:00:00Z","file":[{"access_level":"open_access","content_type":"application/pdf","date_updated":"2020-07-14T12:48:13Z","file_id":"5100","file_size":14596191,"relation":"main_file","creator":"system","file_name":"IST-2017-855-v1+1_thesis_online_pdfA.pdf","checksum":"6c1ae8c90bfaba5e089417fefbc4a272","date_created":"2018-12-12T10:14:46Z"},{"relation":"source_file","file_size":15060566,"access_level":"closed","file_id":"6207","date_updated":"2020-07-14T12:48:13Z","content_type":"application/zip","checksum":"421672f68d563b029869c5cf1713f919","date_created":"2019-04-05T08:40:30Z","creator":"dernst","file_name":"2017_thesis_Hahn_source.zip"}],"date_created":"2018-12-11T11:48:47Z","ddc":["004","005","006","531","621"],"department":[{"_id":"ChWo"},{"_id":"GradSch"}],"doi_confirm":"1","related_material":{"record":[{"status":"public","relation":"popular_science","id":"5568"},{"relation":"part_of_dissertation","status":"public","id":"1362"},{"id":"1633","relation":"part_of_dissertation","status":"public"}]},"oa_version":"Published Version","acknowledgement":"ERC H2020 programme (grant agreement no. 638176)\r\nFirst of all, let me thank my committee members, especially my supervisor, Chris\r\nWojtan, for supporting me throughout my PhD. Obviously, none of this work would\r\nhave been possible without you.\r\nFurthermore, Thank You to all the people who have contributed to this work in various\r\nways, in particular Martin Schanz and his group for providing and supporting the\r\nHyENA boundary element library, as well as Eder Miguel and Morten Bojsen-Hansen\r\nfor (repeatedly) proof reading and providing valuable suggestions during the writing\r\nof this thesis.\r\nI would also like to thank Bernd Bickel, and all the members – past and present – of his\r\nand Chris’ research groups at IST Austria for always providing honest and insightful\r\nfeedback throughout many joint group meetings, as well as Christopher Batty, Eitan\r\nGrinspun, and Fang Da for many insights into boundary element methods during our\r\ncollaboration.\r\nAs only virtual objects have been harmed in the process of creating this work, I would\r\nlike to acknowledge the Stanford scanning repository for providing the “Bunny” and\r\n“Armadillo” models, the AIM@SHAPE repository for “Pierre’s hand, watertight”, and\r\nS. Gainsbourg for the “Column” via Archive3D.net. Sorry for breaking these models\r\nin many different ways.\r\n","title":"Brittle fracture simulation with boundary elements for computer graphics","article_processing_charge":"No","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","year":"2017","status":"public","project":[{"name":"Big Splash: Efficient Simulation of Natural Phenomena at Extremely Large Scales","grant_number":"638176","_id":"2533E772-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"page":"124","license":"https://creativecommons.org/licenses/by-sa/4.0/","has_accepted_license":"1","month":"08","language":[{"iso":"eng"}],"publication_identifier":{"issn":["2663-337X"]},"pubrep_id":"855","_id":"839","ec_funded":1,"author":[{"last_name":"Hahn","id":"357A6A66-F248-11E8-B48F-1D18A9856A87","first_name":"David","full_name":"Hahn, David"}],"publist_id":"6809","day":"14","publication_status":"published","abstract":[{"text":"This thesis describes a brittle fracture simulation method for visual effects applications. Building upon a symmetric Galerkin boundary element method, we first compute stress intensity factors following the theory of linear elastic fracture mechanics. We then use these stress intensities to simulate the motion of a propagating crack front at a significantly higher resolution than the overall deformation of the breaking object. Allowing for spatial variations of the material's toughness during crack propagation produces visually realistic, highly-detailed fracture surfaces. Furthermore, we introduce approximations for stress intensities and crack opening displacements, resulting in both practical speed-up and theoretically superior runtime complexity compared to previous methods. While we choose a quasi-static approach to fracture mechanics, ignoring dynamic deformations, we also couple our fracture simulation framework to a standard rigid-body dynamics solver, enabling visual effects artists to simulate both large scale motion, as well as fracturing due to collision forces in a combined system. As fractures inside of an object grow, their geometry must be represented both in the coarse boundary element mesh, as well as at the desired fine output resolution. Using a boundary element method, we avoid complicated volumetric meshing operations. Instead we describe a simple set of surface meshing operations that allow us to progressively add cracks to the mesh of an object and still re-use all previously computed entries of the linear boundary element system matrix. On the high resolution level, we opt for an implicit surface representation. We then describe how to capture fracture surfaces during crack propagation, as well as separate the individual fragments resulting from the fracture process, based on this implicit representation. We show results obtained with our method, either solving the full boundary element system in every time step, or alternatively using our fast approximations. These results demonstrate that both of these methods perform well in basic test cases and produce realistic fracture surfaces. Furthermore we show that our fast approximations substantially out-perform the standard approach in more demanding scenarios. Finally, these two methods naturally combine, using the full solution while the problem size is manageably small and switching to the fast approximations later on. The resulting hybrid method gives the user a direct way to choose between speed and accuracy of the simulation. ","lang":"eng"}],"fulldoi":"https://doi.org/10.15479/AT:ISTA:th_855","file_date_updated":"2020-07-14T12:48:13Z","corr_author":"1","supervisor":[{"last_name":"Wojtan","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","first_name":"Christopher J","full_name":"Wojtan, Christopher J","orcid":"0000-0001-6646-5546"}],"OA_place":"publisher","alternative_title":["ISTA Thesis"],"citation":{"apa":"Hahn, D. (2017). <i>Brittle fracture simulation with boundary elements for computer graphics</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:th_855\">https://doi.org/10.15479/AT:ISTA:th_855</a>","ieee":"D. Hahn, “Brittle fracture simulation with boundary elements for computer graphics,” Institute of Science and Technology Austria, 2017.","ista":"Hahn D. 2017. Brittle fracture simulation with boundary elements for computer graphics. Institute of Science and Technology Austria.","short":"D. Hahn, Brittle Fracture Simulation with Boundary Elements for Computer Graphics, Institute of Science and Technology Austria, 2017.","mla":"Hahn, David. <i>Brittle Fracture Simulation with Boundary Elements for Computer Graphics</i>. Institute of Science and Technology Austria, 2017, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:th_855\">10.15479/AT:ISTA:th_855</a>.","ama":"Hahn D. Brittle fracture simulation with boundary elements for computer graphics. 2017. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:th_855\">10.15479/AT:ISTA:th_855</a>","chicago":"Hahn, David. “Brittle Fracture Simulation with Boundary Elements for Computer Graphics.” Institute of Science and Technology Austria, 2017. <a href=\"https://doi.org/10.15479/AT:ISTA:th_855\">https://doi.org/10.15479/AT:ISTA:th_855</a>."},"type":"dissertation","oa":1,"publisher":"Institute of Science and Technology Austria","doi":"10.15479/AT:ISTA:th_855","tmp":{"name":"Creative Commons Attribution-ShareAlike 4.0 International Public License (CC BY-SA 4.0)","image":"/images/cc_by_sa.png","legal_code_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","short":"CC BY-SA (4.0)"},"date_updated":"2026-07-29T13:27:25Z","degree_awarded":"PhD"},{"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","datarep_id":"73","title":"Source codes: Brittle fracture simulation with boundary elements for computer graphics","related_material":{"record":[{"id":"839","relation":"research_paper","status":"public"}]},"oa_version":"Published Version","ddc":["004"],"department":[{"_id":"ChWo"}],"date_published":"2017-08-16T00:00:00Z","file":[{"relation":"main_file","file_size":199353471,"date_updated":"2020-07-14T12:47:04Z","content_type":"application/zip","file_id":"5615","access_level":"open_access","date_created":"2018-12-12T13:02:57Z","checksum":"2323a755842a3399cbc47d76545fc9a0","file_name":"IST-2017-73-v1+1_FractureRB_v1.1_2017_07_20_final_public.zip","creator":"system"}],"date_created":"2018-12-12T12:31:35Z","_id":"5568","ec_funded":1,"month":"08","has_accepted_license":"1","project":[{"name":"Big Splash: Efficient Simulation of Natural Phenomena at Extremely Large Scales","call_identifier":"H2020","_id":"2533E772-B435-11E9-9278-68D0E5697425","grant_number":"638176"}],"status":"public","year":"2017","abstract":[{"lang":"eng","text":"Includes source codes, test cases, and example data used in the thesis Brittle Fracture Simulation with Boundary Elements for Computer Graphics. Also includes pre-built binaries of the HyENA library, but not sources - please contact the HyENA authors to obtain these sources if required (https://mech.tugraz.at/hyena)"}],"file_date_updated":"2020-07-14T12:47:04Z","fulldoi":"https://doi.org/10.15479/AT:ISTA:73","keyword":["Boundary elements","brittle fracture","computer graphics","fracture simulation"],"day":"16","author":[{"last_name":"Hahn","id":"357A6A66-F248-11E8-B48F-1D18A9856A87","first_name":"David","full_name":"Hahn, David"}],"tmp":{"name":"Creative Commons Attribution-ShareAlike 4.0 International Public License (CC BY-SA 4.0)","image":"/images/cc_by_sa.png","legal_code_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","short":"CC BY-SA (4.0)"},"doi":"10.15479/AT:ISTA:73","date_updated":"2026-07-29T13:27:24Z","oa":1,"publisher":"Institute of Science and Technology Austria","type":"research_data","citation":{"apa":"Hahn, D. (2017). Source codes: Brittle fracture simulation with boundary elements for computer graphics. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:73\">https://doi.org/10.15479/AT:ISTA:73</a>","ieee":"D. Hahn, “Source codes: Brittle fracture simulation with boundary elements for computer graphics.” Institute of Science and Technology Austria, 2017.","ama":"Hahn D. Source codes: Brittle fracture simulation with boundary elements for computer graphics. 2017. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:73\">10.15479/AT:ISTA:73</a>","mla":"Hahn, David. <i>Source Codes: Brittle Fracture Simulation with Boundary Elements for Computer Graphics</i>. Institute of Science and Technology Austria, 2017, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:73\">10.15479/AT:ISTA:73</a>.","ista":"Hahn D. 2017. Source codes: Brittle fracture simulation with boundary elements for computer graphics, Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT:ISTA:73\">10.15479/AT:ISTA:73</a>.","short":"D. Hahn, (2017).","chicago":"Hahn, David. “Source Codes: Brittle Fracture Simulation with Boundary Elements for Computer Graphics.” Institute of Science and Technology Austria, 2017. <a href=\"https://doi.org/10.15479/AT:ISTA:73\">https://doi.org/10.15479/AT:ISTA:73</a>."}},{"doi":"10.1007/978-3-319-70697-9_13","intvolume":"     10625","date_updated":"2026-07-29T13:38:07Z","oa":1,"scopus_import":1,"publisher":"Springer","volume":10625,"type":"conference","alternative_title":["LNCS"],"citation":{"chicago":"Abusalah, Hamza M, Joel F Alwen, Bram Cohen, Danylo Khilko, Krzysztof Z Pietrzak, and Leonid Reyzin. “Beyond Hellman’s Time-Memory Trade-Offs with Applications to Proofs of Space,” 10625:357–79. Springer, 2017. <a href=\"https://doi.org/10.1007/978-3-319-70697-9_13\">https://doi.org/10.1007/978-3-319-70697-9_13</a>.","mla":"Abusalah, Hamza M., et al. <i>Beyond Hellman’s Time-Memory Trade-Offs with Applications to Proofs of Space</i>. Vol. 10625, Springer, 2017, pp. 357–79, doi:<a href=\"https://doi.org/10.1007/978-3-319-70697-9_13\">10.1007/978-3-319-70697-9_13</a>.","ama":"Abusalah HM, Alwen JF, Cohen B, Khilko D, Pietrzak KZ, Reyzin L. Beyond Hellman’s time-memory trade-offs with applications to proofs of space. In: Vol 10625. Springer; 2017:357-379. doi:<a href=\"https://doi.org/10.1007/978-3-319-70697-9_13\">10.1007/978-3-319-70697-9_13</a>","ista":"Abusalah HM, Alwen JF, Cohen B, Khilko D, Pietrzak KZ, Reyzin L. 2017. Beyond Hellman’s time-memory trade-offs with applications to proofs of space. ASIACRYPT: Theory and Applications of Cryptology and Information Security, LNCS, vol. 10625, 357–379.","short":"H.M. Abusalah, J.F. Alwen, B. Cohen, D. Khilko, K.Z. Pietrzak, L. Reyzin, in:, Springer, 2017, pp. 357–379.","ieee":"H. M. Abusalah, J. F. Alwen, B. Cohen, D. Khilko, K. Z. Pietrzak, and L. Reyzin, “Beyond Hellman’s time-memory trade-offs with applications to proofs of space,” presented at the ASIACRYPT: Theory and Applications of Cryptology and Information Security, Hong Kong, China, 2017, vol. 10625, pp. 357–379.","apa":"Abusalah, H. M., Alwen, J. F., Cohen, B., Khilko, D., Pietrzak, K. Z., &#38; Reyzin, L. (2017). Beyond Hellman’s time-memory trade-offs with applications to proofs of space (Vol. 10625, pp. 357–379). Presented at the ASIACRYPT: Theory and Applications of Cryptology and Information Security, Hong Kong, China: Springer. <a href=\"https://doi.org/10.1007/978-3-319-70697-9_13\">https://doi.org/10.1007/978-3-319-70697-9_13</a>"},"abstract":[{"text":"Proofs of space (PoS) were suggested as more ecological and economical alternative to proofs of work, which are currently used in blockchain designs like Bitcoin. The existing PoS are based on rather sophisticated graph pebbling lower bounds. Much simpler and in several aspects more efficient schemes based on inverting random functions have been suggested, but they don’t give meaningful security guarantees due to existing time-memory trade-offs. In particular, Hellman showed that any permutation over a domain of size N can be inverted in time T by an algorithm that is given S bits of auxiliary information whenever (Formula presented). For functions Hellman gives a weaker attack with S2· T≈ N2 (e.g., S= T≈ N2/3). To prove lower bounds, one considers an adversary who has access to an oracle f: [ N] → [N] and can make T oracle queries. The best known lower bound is S· T∈ Ω(N) and holds for random functions and permutations. We construct functions that provably require more time and/or space to invert. Specifically, for any constant k we construct a function [N] → [N] that cannot be inverted unless Sk· T∈ Ω(Nk) (in particular, S= T≈ (Formula presented). Our construction does not contradict Hellman’s time-memory trade-off, because it cannot be efficiently evaluated in forward direction. However, its entire function table can be computed in time quasilinear in N, which is sufficient for the PoS application. Our simplest construction is built from a random function oracle g: [N] × [N] → [ N] and a random permutation oracle f: [N] → N] and is defined as h(x) = g(x, x′) where f(x) = π(f(x′)) with π being any involution without a fixed point, e.g. flipping all the bits. For this function we prove that any adversary who gets S bits of auxiliary information, makes at most T oracle queries, and inverts h on an ϵ fraction of outputs must satisfy S2· T∈ Ω(ϵ2N2).","lang":"eng"}],"fulldoi":"https://doi.org/10.1007/978-3-319-70697-9_13","corr_author":"1","publication_status":"published","day":"18","conference":{"end_date":"2017-12-07","start_date":"2017-12-03","location":"Hong Kong, China","name":"ASIACRYPT: Theory and Applications of Cryptology and Information Security"},"author":[{"full_name":"Abusalah, Hamza M","id":"40297222-F248-11E8-B48F-1D18A9856A87","first_name":"Hamza M","last_name":"Abusalah"},{"full_name":"Alwen, Joel F","first_name":"Joel F","id":"2A8DFA8C-F248-11E8-B48F-1D18A9856A87","last_name":"Alwen"},{"first_name":"Bram","full_name":"Cohen, Bram","last_name":"Cohen"},{"last_name":"Khilko","first_name":"Danylo","full_name":"Khilko, Danylo"},{"last_name":"Pietrzak","orcid":"0000-0002-9139-1654","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","full_name":"Pietrzak, Krzysztof Z","first_name":"Krzysztof Z"},{"last_name":"Reyzin","first_name":"Leonid","full_name":"Reyzin, Leonid"}],"publist_id":"7257","_id":"559","ec_funded":1,"month":"11","language":[{"iso":"eng"}],"publication_identifier":{"isbn":["978-331970696-2"]},"main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2017/893.pdf"}],"page":"357 - 379","status":"public","quality_controlled":"1","year":"2017","project":[{"call_identifier":"H2020","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","grant_number":"682815","name":"Teaching Old Crypto New Tricks"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Submitted Version","related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"83"}]},"title":"Beyond Hellman’s time-memory trade-offs with applications to proofs of space","department":[{"_id":"KrPi"}],"date_published":"2017-11-18T00:00:00Z","date_created":"2018-12-11T11:47:10Z"},{"publist_id":"6214","author":[{"orcid":"0000-0001-5366-9603","first_name":"László","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","full_name":"Erdös, László","last_name":"Erdös"},{"full_name":"Schröder, Dominik J","id":"408ED176-F248-11E8-B48F-1D18A9856A87","first_name":"Dominik J","orcid":"0000-0002-2904-1856","last_name":"Schröder"}],"day":"02","publication_status":"published","file_date_updated":"2018-12-12T10:18:10Z","fulldoi":"https://doi.org/10.1214/16-ECP38","abstract":[{"text":"We show that matrix elements of functions of N × N Wigner matrices fluctuate on a scale of order N−1/2 and we identify the limiting fluctuation. Our result holds for any function f of the matrix that has bounded variation thus considerably relaxing the regularity requirement imposed in [7, 11].","lang":"eng"}],"citation":{"ieee":"L. Erdös and D. J. Schröder, “Fluctuations of functions of Wigner matrices,” <i>Electronic Communications in Probability</i>, vol. 21. Institute of Mathematical Statistics, 2017.","apa":"Erdös, L., &#38; Schröder, D. J. (2017). Fluctuations of functions of Wigner matrices. <i>Electronic Communications in Probability</i>. Institute of Mathematical Statistics. <a href=\"https://doi.org/10.1214/16-ECP38\">https://doi.org/10.1214/16-ECP38</a>","chicago":"Erdös, László, and Dominik J Schröder. “Fluctuations of Functions of Wigner Matrices.” <i>Electronic Communications in Probability</i>. Institute of Mathematical Statistics, 2017. <a href=\"https://doi.org/10.1214/16-ECP38\">https://doi.org/10.1214/16-ECP38</a>.","ista":"Erdös L, Schröder DJ. 2017. Fluctuations of functions of Wigner matrices. Electronic Communications in Probability. 21, 86.","short":"L. Erdös, D.J. Schröder, Electronic Communications in Probability 21 (2017).","ama":"Erdös L, Schröder DJ. Fluctuations of functions of Wigner matrices. <i>Electronic Communications in Probability</i>. 2017;21. doi:<a href=\"https://doi.org/10.1214/16-ECP38\">10.1214/16-ECP38</a>","mla":"Erdös, László, and Dominik J. Schröder. “Fluctuations of Functions of Wigner Matrices.” <i>Electronic Communications in Probability</i>, vol. 21, 86, Institute of Mathematical Statistics, 2017, doi:<a href=\"https://doi.org/10.1214/16-ECP38\">10.1214/16-ECP38</a>."},"article_number":"86","type":"journal_article","volume":21,"publication":"Electronic Communications in Probability","publisher":"Institute of Mathematical Statistics","scopus_import":"1","oa":1,"intvolume":"        21","date_updated":"2026-07-29T13:46:19Z","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)"},"doi":"10.1214/16-ECP38","file":[{"file_name":"IST-2017-747-v1+1_euclid.ecp.1483347665.pdf","creator":"system","date_created":"2018-12-12T10:18:10Z","file_id":"5329","date_updated":"2018-12-12T10:18:10Z","content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_size":440770}],"date_created":"2018-12-11T11:50:23Z","date_published":"2017-01-02T00:00:00Z","department":[{"_id":"LaEr"}],"ddc":["510"],"acknowledgement":"Partially supported by the IST Austria Excellence Scholarship.","title":"Fluctuations of functions of Wigner matrices","oa_version":"Published Version","related_material":{"record":[{"id":"6179","status":"public","relation":"dissertation_contains"}]},"external_id":{"isi":["000396604900037"]},"isi":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","article_processing_charge":"No","project":[{"name":"Random matrices, universality and disordered quantum systems","call_identifier":"FP7","_id":"258DCDE6-B435-11E9-9278-68D0E5697425","grant_number":"338804"}],"quality_controlled":"1","year":"2017","status":"public","language":[{"iso":"eng"}],"month":"01","has_accepted_license":"1","ec_funded":1,"pubrep_id":"747","_id":"1144"},{"fulldoi":"https://doi.org/10.37236/6663","file_date_updated":"2020-07-14T12:48:06Z","corr_author":"1","abstract":[{"lang":"eng","text":"We introduce a common generalization of the strong Hanani–Tutte theorem and the weak Hanani–Tutte theorem: if a graph G has a drawing D in the plane where every pair of independent edges crosses an even number of times, then G has a planar drawing preserving the rotation of each vertex whose incident edges cross each other evenly in D. The theorem is implicit in the proof of the strong Hanani–Tutte theorem by Pelsmajer, Schaefer and Štefankovič. We give a new, somewhat simpler proof."}],"day":"28","publication_status":"published","publist_id":"6859","author":[{"last_name":"Fulek","orcid":"0000-0001-8485-1774","full_name":"Fulek, Radoslav","id":"39F3FFE4-F248-11E8-B48F-1D18A9856A87","first_name":"Radoslav"},{"first_name":"Jan","full_name":"Kynčl, Jan","last_name":"Kynčl"},{"first_name":"Dömötör","full_name":"Pálvölgyi, Dömötör","last_name":"Pálvölgyi"}],"article_type":"original","date_updated":"2026-08-04T09:30:34Z","intvolume":"        24","doi":"10.37236/6663","publisher":"Electronic Journal of Combinatorics","scopus_import":"1","oa":1,"volume":24,"publication":"The Electronic Journal of Combinatorics","type":"journal_article","issue":"3","article_number":"P3.18","citation":{"chicago":"Fulek, Radoslav, Jan Kynčl, and Dömötör Pálvölgyi. “Unified Hanani Tutte Theorem.” <i>The Electronic Journal of Combinatorics</i>. Electronic Journal of Combinatorics, 2017. <a href=\"https://doi.org/10.37236/6663\">https://doi.org/10.37236/6663</a>.","mla":"Fulek, Radoslav, et al. “Unified Hanani Tutte Theorem.” <i>The Electronic Journal of Combinatorics</i>, vol. 24, no. 3, P3.18, Electronic Journal of Combinatorics, 2017, doi:<a href=\"https://doi.org/10.37236/6663\">10.37236/6663</a>.","ama":"Fulek R, Kynčl J, Pálvölgyi D. Unified Hanani Tutte theorem. <i>The Electronic Journal of Combinatorics</i>. 2017;24(3). doi:<a href=\"https://doi.org/10.37236/6663\">10.37236/6663</a>","ista":"Fulek R, Kynčl J, Pálvölgyi D. 2017. Unified Hanani Tutte theorem. The Electronic Journal of Combinatorics. 24(3), P3.18.","short":"R. Fulek, J. Kynčl, D. Pálvölgyi, The Electronic Journal of Combinatorics 24 (2017).","ieee":"R. Fulek, J. Kynčl, and D. Pálvölgyi, “Unified Hanani Tutte theorem,” <i>The Electronic Journal of Combinatorics</i>, vol. 24, no. 3. Electronic Journal of Combinatorics, 2017.","apa":"Fulek, R., Kynčl, J., &#38; Pálvölgyi, D. (2017). Unified Hanani Tutte theorem. <i>The Electronic Journal of Combinatorics</i>. Electronic Journal of Combinatorics. <a href=\"https://doi.org/10.37236/6663\">https://doi.org/10.37236/6663</a>"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","oa_version":"Published Version","title":"Unified Hanani Tutte theorem","department":[{"_id":"UlWa"}],"ddc":["000"],"file":[{"creator":"dernst","file_name":"2017_ElectrCombi_Fulek.pdf","checksum":"ef320cff0f062051e858f929be6a3581","date_created":"2019-01-18T14:04:08Z","access_level":"open_access","content_type":"application/pdf","date_updated":"2020-07-14T12:48:06Z","file_id":"5853","relation":"main_file","file_size":236944}],"date_created":"2018-12-11T11:48:32Z","date_published":"2017-07-28T00:00:00Z","ec_funded":1,"_id":"795","publication_identifier":{"issn":["1077-8926"]},"language":[{"iso":"eng"}],"has_accepted_license":"1","month":"07","year":"2017","status":"public","quality_controlled":"1","project":[{"name":"International IST Postdoc Fellowship Programme","grant_number":"291734","call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425"}]},{"author":[{"last_name":"Giehr","full_name":"Giehr, Julia","first_name":"Julia"},{"id":"406F989C-F248-11E8-B48F-1D18A9856A87","full_name":"Grasse, Anna V","first_name":"Anna V","last_name":"Grasse"},{"full_name":"Cremer, Sylvia","first_name":"Sylvia","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2193-3868","last_name":"Cremer"},{"last_name":"Heinze","full_name":"Heinze, Jürgen","first_name":"Jürgen"},{"last_name":"Schrempf","first_name":"Alexandra","full_name":"Schrempf, Alexandra"}],"publist_id":"6527","publication_status":"published","day":"05","abstract":[{"lang":"eng","text":"Infections with potentially lethal pathogens may negatively affect an individual’s lifespan and decrease its reproductive value. The terminal investment hypothesis predicts that individuals faced with a reduced survival should invest more into reproduction instead of maintenance and growth. Several studies suggest that individuals are indeed able to estimate their body condition and to increase their reproductive effort with approaching death, while other studies gave ambiguous results. We investigate whether queens of a perennial social insect (ant) are able to boost their reproduction following infection with an obligate killing pathogen. Social insect queens are special with regard to reproduction and aging, as they outlive conspecific non-reproductive workers. Moreover, in the ant Cardiocondyla obscurior, fecundity increases with queen age. However, it remained unclear whether this reflects negative reproductive senescence or terminal investment in response to approaching death. Here, we test whether queens of C. obscurior react to infection with the entomopathogenic fungus Metarhizium brunneum by an increased egg-laying rate. We show that a fungal infection triggers a reinforced investment in reproduction in queens. This adjustment of the reproductive rate by ant queens is consistent with predictions of the terminal investment hypothesis and is reported for the first time in a social insect."}],"fulldoi":"https://doi.org/10.1098/rsos.170547","file_date_updated":"2020-07-14T12:48:15Z","article_number":"170547","citation":{"chicago":"Giehr, Julia, Anna V Grasse, Sylvia Cremer, Jürgen Heinze, and Alexandra Schrempf. “Ant Queens Increase Their Reproductive Efforts after Pathogen Infection.” <i>Royal Society Open Science</i>. Royal Society, 2017. <a href=\"https://doi.org/10.1098/rsos.170547\">https://doi.org/10.1098/rsos.170547</a>.","ama":"Giehr J, Grasse AV, Cremer S, Heinze J, Schrempf A. Ant queens increase their reproductive efforts after pathogen infection. <i>Royal Society Open Science</i>. 2017;4(7). doi:<a href=\"https://doi.org/10.1098/rsos.170547\">10.1098/rsos.170547</a>","mla":"Giehr, Julia, et al. “Ant Queens Increase Their Reproductive Efforts after Pathogen Infection.” <i>Royal Society Open Science</i>, vol. 4, no. 7, 170547, Royal Society, 2017, doi:<a href=\"https://doi.org/10.1098/rsos.170547\">10.1098/rsos.170547</a>.","ista":"Giehr J, Grasse AV, Cremer S, Heinze J, Schrempf A. 2017. Ant queens increase their reproductive efforts after pathogen infection. Royal Society Open Science. 4(7), 170547.","short":"J. Giehr, A.V. Grasse, S. Cremer, J. Heinze, A. Schrempf, Royal Society Open Science 4 (2017).","ieee":"J. Giehr, A. V. Grasse, S. Cremer, J. Heinze, and A. Schrempf, “Ant queens increase their reproductive efforts after pathogen infection,” <i>Royal Society Open Science</i>, vol. 4, no. 7. Royal Society, 2017.","apa":"Giehr, J., Grasse, A. V., Cremer, S., Heinze, J., &#38; Schrempf, A. (2017). Ant queens increase their reproductive efforts after pathogen infection. <i>Royal Society Open Science</i>. Royal Society. <a href=\"https://doi.org/10.1098/rsos.170547\">https://doi.org/10.1098/rsos.170547</a>"},"issue":"7","publication":"Royal Society Open Science","volume":4,"type":"journal_article","oa":1,"publisher":"Royal Society","scopus_import":"1","doi":"10.1098/rsos.170547","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)"},"date_updated":"2026-08-12T06:25:39Z","intvolume":"         4","date_published":"2017-07-05T00:00:00Z","file":[{"relation":"main_file","file_size":530412,"content_type":"application/pdf","date_updated":"2020-07-14T12:48:15Z","file_id":"4684","access_level":"open_access","date_created":"2018-12-12T10:08:24Z","checksum":"351ae5e7a37e6e7d9295cd41146c4190","file_name":"IST-2017-849-v1+1_2017_Grasse_Cremer_AntQueens.pdf","creator":"system"}],"date_created":"2018-12-11T11:49:10Z","ddc":["576","592"],"department":[{"_id":"SyCr"}],"isi":1,"external_id":{"isi":["000406670000025"]},"oa_version":"Published Version","related_material":{"record":[{"id":"9853","status":"public","relation":"research_data"}]},"acknowledgement":"We thank two anonymous reviewers for helpful suggestions on the manuscript.","title":"Ant queens increase their reproductive efforts after pathogen infection","article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2017","status":"public","quality_controlled":"1","has_accepted_license":"1","month":"07","publication_identifier":{"issn":["2054-5703"]},"language":[{"iso":"eng"}],"pubrep_id":"849","_id":"914"},{"main_file_link":[{"url":"https://doi.org/10.6084/m9.figshare.5117788.v1","open_access":"1"}],"type":"research_data_reference","year":"2017","status":"public","citation":{"ama":"Giehr J, Grasse AV, Cremer S, Heinze J, Schrempf A. Raw data from ant queens increase their reproductive efforts after pathogen infection. 2017. doi:<a href=\"https://doi.org/10.6084/m9.figshare.5117788.v1\">10.6084/m9.figshare.5117788.v1</a>","mla":"Giehr, Julia, et al. <i>Raw Data from Ant Queens Increase Their Reproductive Efforts after Pathogen Infection</i>. The Royal Society, 2017, doi:<a href=\"https://doi.org/10.6084/m9.figshare.5117788.v1\">10.6084/m9.figshare.5117788.v1</a>.","short":"J. Giehr, A.V. Grasse, S. Cremer, J. Heinze, A. Schrempf, (2017).","ista":"Giehr J, Grasse AV, Cremer S, Heinze J, Schrempf A. 2017. Raw data from ant queens increase their reproductive efforts after pathogen infection, The Royal Society, <a href=\"https://doi.org/10.6084/m9.figshare.5117788.v1\">10.6084/m9.figshare.5117788.v1</a>.","chicago":"Giehr, Julia, Anna V Grasse, Sylvia Cremer, Jürgen Heinze, and Alexandra Schrempf. “Raw Data from Ant Queens Increase Their Reproductive Efforts after Pathogen Infection.” The Royal Society, 2017. <a href=\"https://doi.org/10.6084/m9.figshare.5117788.v1\">https://doi.org/10.6084/m9.figshare.5117788.v1</a>.","apa":"Giehr, J., Grasse, A. V., Cremer, S., Heinze, J., &#38; Schrempf, A. (2017). Raw data from ant queens increase their reproductive efforts after pathogen infection. The Royal Society. <a href=\"https://doi.org/10.6084/m9.figshare.5117788.v1\">https://doi.org/10.6084/m9.figshare.5117788.v1</a>","ieee":"J. Giehr, A. V. Grasse, S. Cremer, J. Heinze, and A. Schrempf, “Raw data from ant queens increase their reproductive efforts after pathogen infection.” The Royal Society, 2017."},"_id":"9853","doi":"10.6084/m9.figshare.5117788.v1","date_updated":"2026-08-12T06:25:39Z","month":"06","oa":1,"publisher":"The Royal Society","author":[{"first_name":"Julia","full_name":"Giehr, Julia","last_name":"Giehr"},{"first_name":"Anna V","full_name":"Grasse, Anna V","id":"406F989C-F248-11E8-B48F-1D18A9856A87","last_name":"Grasse"},{"last_name":"Cremer","full_name":"Cremer, Sylvia","first_name":"Sylvia","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2193-3868"},{"first_name":"Jürgen","full_name":"Heinze, Jürgen","last_name":"Heinze"},{"last_name":"Schrempf","full_name":"Schrempf, Alexandra","first_name":"Alexandra"}],"department":[{"_id":"SyCr"}],"date_published":"2017-06-19T00:00:00Z","date_created":"2021-08-10T06:57:57Z","article_processing_charge":"No","abstract":[{"text":"Egg laying rates and infection loads of C. obscurior queens","lang":"eng"}],"user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","fulldoi":"https://doi.org/10.6084/m9.figshare.5117788.v1","day":"19","title":"Raw data from ant queens increase their reproductive efforts after pathogen infection","related_material":{"record":[{"id":"914","relation":"used_in_publication","status":"public"}]},"oa_version":"Published Version"},{"article_number":"20162864","citation":{"short":"D. Charlesworth, N.H. Barton, B. Charlesworth, Proceedings of the Royal Society of London Series B Biological Sciences 284 (2017).","ista":"Charlesworth D, Barton NH, Charlesworth B. 2017. The sources of adaptive evolution. Proceedings of the Royal Society of London Series B Biological Sciences. 284(1855), 20162864.","mla":"Charlesworth, Deborah, et al. “The Sources of Adaptive Evolution.” <i>Proceedings of the Royal Society of London Series B Biological Sciences</i>, vol. 284, no. 1855, 20162864, Royal Society, 2017, doi:<a href=\"https://doi.org/10.1098/rspb.2016.2864\">10.1098/rspb.2016.2864</a>.","ama":"Charlesworth D, Barton NH, Charlesworth B. The sources of adaptive evolution. <i>Proceedings of the Royal Society of London Series B Biological Sciences</i>. 2017;284(1855). doi:<a href=\"https://doi.org/10.1098/rspb.2016.2864\">10.1098/rspb.2016.2864</a>","chicago":"Charlesworth, Deborah, Nicholas H Barton, and Brian Charlesworth. “The Sources of Adaptive Evolution.” <i>Proceedings of the Royal Society of London Series B Biological Sciences</i>. Royal Society, 2017. <a href=\"https://doi.org/10.1098/rspb.2016.2864\">https://doi.org/10.1098/rspb.2016.2864</a>.","apa":"Charlesworth, D., Barton, N. H., &#38; Charlesworth, B. (2017). The sources of adaptive evolution. <i>Proceedings of the Royal Society of London Series B Biological Sciences</i>. Royal Society. <a href=\"https://doi.org/10.1098/rspb.2016.2864\">https://doi.org/10.1098/rspb.2016.2864</a>","ieee":"D. Charlesworth, N. H. Barton, and B. Charlesworth, “The sources of adaptive evolution,” <i>Proceedings of the Royal Society of London Series B Biological Sciences</i>, vol. 284, no. 1855. Royal Society, 2017."},"publication":"Proceedings of the Royal Society of London Series B Biological Sciences","volume":284,"type":"journal_article","issue":"1855","publisher":"Royal Society","scopus_import":"1","oa":1,"pmid":1,"intvolume":"       284","date_updated":"2026-08-12T06:26:59Z","doi":"10.1098/rspb.2016.2864","publist_id":"6462","author":[{"last_name":"Charlesworth","full_name":"Charlesworth, Deborah","first_name":"Deborah"},{"full_name":"Barton, Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","first_name":"Nicholas H","orcid":"0000-0002-8548-5240","last_name":"Barton"},{"full_name":"Charlesworth, Brian","first_name":"Brian","last_name":"Charlesworth"}],"publication_status":"published","day":"31","fulldoi":"https://doi.org/10.1098/rspb.2016.2864","abstract":[{"lang":"eng","text":"The role of natural selection in the evolution of adaptive phenotypes has undergone constant probing by evolutionary biologists, employing both theoretical and empirical approaches. As Darwin noted, natural selection can act together with other processes, including random changes in the frequencies of phenotypic differences that are not under strong selection, and changes in the environment, which may reflect evolutionary changes in the organisms themselves. As understanding of genetics developed after 1900, the new genetic discoveries were incorporated into evolutionary biology. The resulting general principles were summarized by Julian Huxley in his 1942 book Evolution: the modern synthesis. Here, we examine how recent advances in genetics, developmental biology and molecular biology, including epigenetics, relate to today's understanding of the evolution of adaptations. We illustrate how careful genetic studies have repeatedly shown that apparently puzzling results in a wide diversity of organisms involve processes that are consistent with neo-Darwinism. They do not support important roles in adaptation for processes such as directed mutation or the inheritance of acquired characters, and therefore no radical revision of our understanding of the mechanism of adaptive evolution is needed."}],"status":"public","quality_controlled":"1","year":"2017","main_file_link":[{"url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5454256/","open_access":"1"}],"language":[{"iso":"eng"}],"month":"05","_id":"953","date_created":"2018-12-11T11:49:23Z","date_published":"2017-05-31T00:00:00Z","department":[{"_id":"NiBa"}],"oa_version":"Submitted Version","title":"The sources of adaptive evolution","isi":1,"external_id":{"pmid":["28566483"],"isi":["000405148800021"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No"},{"publication":"Investigative Ophthalmology and Visual Science","volume":58,"type":"journal_article","issue":"14","citation":{"chicago":"Nickells, Robert, Heather Schmitt, Margaret E Maes, and Cassandra Schlamp. “AAV2 Mediated Transduction of the Mouse Retina after Optic Nerve Injury.” <i>Investigative Ophthalmology and Visual Science</i>. Association for Research in Vision &#38; Ophthalmology, 2017. <a href=\"https://doi.org/10.1167/iovs.17-22634\">https://doi.org/10.1167/iovs.17-22634</a>.","ama":"Nickells R, Schmitt H, Maes ME, Schlamp C. AAV2 mediated transduction of the mouse retina after optic nerve injury. <i>Investigative Ophthalmology and Visual Science</i>. 2017;58(14):6091-6104. doi:<a href=\"https://doi.org/10.1167/iovs.17-22634\">10.1167/iovs.17-22634</a>","mla":"Nickells, Robert, et al. “AAV2 Mediated Transduction of the Mouse Retina after Optic Nerve Injury.” <i>Investigative Ophthalmology and Visual Science</i>, vol. 58, no. 14, Association for Research in Vision &#38; Ophthalmology, 2017, pp. 6091–104, doi:<a href=\"https://doi.org/10.1167/iovs.17-22634\">10.1167/iovs.17-22634</a>.","short":"R. Nickells, H. Schmitt, M.E. Maes, C. Schlamp, Investigative Ophthalmology and Visual Science 58 (2017) 6091–6104.","ista":"Nickells R, Schmitt H, Maes ME, Schlamp C. 2017. AAV2 mediated transduction of the mouse retina after optic nerve injury. Investigative Ophthalmology and Visual Science. 58(14), 6091–6104.","ieee":"R. Nickells, H. Schmitt, M. E. Maes, and C. Schlamp, “AAV2 mediated transduction of the mouse retina after optic nerve injury,” <i>Investigative Ophthalmology and Visual Science</i>, vol. 58, no. 14. Association for Research in Vision &#38; Ophthalmology, pp. 6091–6104, 2017.","apa":"Nickells, R., Schmitt, H., Maes, M. E., &#38; Schlamp, C. (2017). AAV2 mediated transduction of the mouse retina after optic nerve injury. <i>Investigative Ophthalmology and Visual Science</i>. Association for Research in Vision &#38; Ophthalmology. <a href=\"https://doi.org/10.1167/iovs.17-22634\">https://doi.org/10.1167/iovs.17-22634</a>"},"date_updated":"2026-08-12T11:16:45Z","intvolume":"        58","doi":"10.1167/iovs.17-22634","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","image":"/images/cc_by_nc_nd.png","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","short":"CC BY-NC-ND (4.0)"},"scopus_import":"1","publisher":"Association for Research in Vision & Ophthalmology","oa":1,"publist_id":"7254","author":[{"full_name":"Nickells, Robert","first_name":"Robert","last_name":"Nickells"},{"full_name":"Schmitt, Heather","first_name":"Heather","last_name":"Schmitt"},{"full_name":"Maes, Margaret E","first_name":"Margaret E","id":"3838F452-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-9642-1085","last_name":"Maes"},{"last_name":"Schlamp","full_name":"Schlamp, Cassandra","first_name":"Cassandra"}],"fulldoi":"https://doi.org/10.1167/iovs.17-22634","file_date_updated":"2020-07-14T12:47:04Z","abstract":[{"lang":"eng","text":"PURPOSE. Gene therapy of retinal ganglion cells (RGCs) has promise as a powerful therapeutic for the rescue and regeneration of these cells after optic nerve damage. However, early after damage, RGCs undergo atrophic changes, including gene silencing. It is not known if these changes will deleteriously affect transduction and transgene expression, or if the therapeutic protein can influence reactivation of the endogenous genome. METHODS. Double-transgenic mice carrying a Rosa26-(LoxP)-tdTomato reporter, and a mutant allele for the proapoptotic Bax gene were reared. The Bax mutant blocks apoptosis, but RGCs still exhibit nuclear atrophy and gene silencing. At times ranging from 1 hour to 4 weeks after optic nerve crush (ONC), eyes received an intravitreal injection of AAV2 virus carrying the Cre recombinase. Successful transduction was monitored by expression of the tdTomato reporter. Immunostaining was used to localize tdTomato expression in select cell types. RESULTS. Successful transduction of RGCs was achieved at all time points after ONC using AAV2 expressing Cre from the phosphoglycerate kinase (Pgk) promoter, but not the CMV promoter. ONC promoted an increase in the transduction of cell types in the inner nuclear layer, including Müller cells and rod bipolar neurons. There was minimal evidence of transduction of amacrine cells and astrocytes in the inner retina or optic nerve. CONCLUSIONS. Damaged RGCs can be transduced and at least some endogenous genes can be subsequently activated. Optic nerve damage may change retinal architecture to allow greater penetration of an AAV2 virus to transduce several additional cell types in the inner nuclear layer."}],"publication_status":"published","day":"14","page":"6091 - 6104","quality_controlled":"1","year":"2017","status":"public","_id":"557","pubrep_id":"920","language":[{"iso":"eng"}],"publication_identifier":{"issn":["0146-0404"]},"has_accepted_license":"1","month":"12","department":[{"_id":"SaSi"}],"ddc":["576"],"file":[{"access_level":"open_access","date_updated":"2020-07-14T12:47:04Z","content_type":"application/pdf","file_id":"5311","file_size":2955559,"relation":"main_file","creator":"system","file_name":"IST-2018-920-v1+1_i1552-5783-58-14-6091.pdf","checksum":"d7a7b6f1fa9211a04e5e65634a0265d9","date_created":"2018-12-12T10:17:53Z"}],"date_created":"2018-12-11T11:47:10Z","date_published":"2017-12-14T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","oa_version":"Published Version","title":"AAV2 mediated transduction of the mouse retina after optic nerve injury","isi":1,"external_id":{"isi":["000426781300012"]}},{"publist_id":"6302","author":[{"last_name":"Von Wangenheim","orcid":"0000-0002-6862-1247","first_name":"Daniel","full_name":"Von Wangenheim, Daniel","id":"49E91952-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Hauschild","id":"4E01D6B4-F248-11E8-B48F-1D18A9856A87","full_name":"Hauschild, Robert","first_name":"Robert","orcid":"0000-0001-9843-3522"},{"last_name":"Friml","orcid":"0000-0002-8302-7596","full_name":"Friml, Jirí","id":"4159519E-F248-11E8-B48F-1D18A9856A87","first_name":"Jirí"}],"publication_status":"published","day":"18","file_date_updated":"2018-12-12T10:16:32Z","fulldoi":"https://doi.org/10.3791/55044","abstract":[{"lang":"eng","text":"One of the key questions in understanding plant development is how single cells behave in a larger context of the tissue. Therefore, it requires the observation of the whole organ with a high spatial- as well as temporal resolution over prolonged periods of time, which may cause photo-toxic effects. This protocol shows a plant sample preparation method for light-sheet microscopy, which is characterized by mounting the plant vertically on the surface of a gel. The plant is mounted in such a way that the roots are submerged in a liquid medium while the leaves remain in the air. In order to ensure photosynthetic activity of the plant, a custom-made lighting system illuminates the leaves. To keep the roots in darkness the water surface is covered with sheets of black plastic foil. This method allows long-term imaging of plant organ development in standardized conditions. "}],"citation":{"mla":"von Wangenheim, Daniel, et al. “Light Sheet Fluorescence Microscopy of Plant Roots Growing on the Surface of a Gel.” <i>Journal of Visualized Experiments</i>, vol. 2017, no. 119, e55044, MyJove Corporation, 2017, doi:<a href=\"https://doi.org/10.3791/55044\">10.3791/55044</a>.","ama":"von Wangenheim D, Hauschild R, Friml J. Light sheet fluorescence microscopy of plant roots growing on the surface of a gel. <i>Journal of Visualized Experiments</i>. 2017;2017(119). doi:<a href=\"https://doi.org/10.3791/55044\">10.3791/55044</a>","ista":"von Wangenheim D, Hauschild R, Friml J. 2017. Light sheet fluorescence microscopy of plant roots growing on the surface of a gel. Journal of Visualized Experiments. 2017(119), e55044.","short":"D. von Wangenheim, R. Hauschild, J. Friml, Journal of Visualized Experiments 2017 (2017).","chicago":"Wangenheim, Daniel von, Robert Hauschild, and Jiří Friml. “Light Sheet Fluorescence Microscopy of Plant Roots Growing on the Surface of a Gel.” <i>Journal of Visualized Experiments</i>. MyJove Corporation, 2017. <a href=\"https://doi.org/10.3791/55044\">https://doi.org/10.3791/55044</a>.","apa":"von Wangenheim, D., Hauschild, R., &#38; Friml, J. (2017). Light sheet fluorescence microscopy of plant roots growing on the surface of a gel. <i>Journal of Visualized Experiments</i>. MyJove Corporation. <a href=\"https://doi.org/10.3791/55044\">https://doi.org/10.3791/55044</a>","ieee":"D. von Wangenheim, R. Hauschild, and J. Friml, “Light sheet fluorescence microscopy of plant roots growing on the surface of a gel,” <i>Journal of Visualized Experiments</i>, vol. 2017, no. 119. MyJove Corporation, 2017."},"article_number":"e55044","type":"journal_article","volume":2017,"publication":"Journal of Visualized Experiments","issue":"119","scopus_import":"1","publisher":"MyJove Corporation","oa":1,"date_updated":"2026-08-12T14:11:08Z","intvolume":"      2017","doi":"10.3791/55044","file":[{"access_level":"open_access","file_id":"5219","date_updated":"2018-12-12T10:16:31Z","content_type":"application/pdf","file_size":57678,"relation":"main_file","creator":"system","file_name":"IST-2017-808-v1+1_2017_VWangenheim_list.pdf","date_created":"2018-12-12T10:16:31Z"},{"content_type":"application/pdf","date_updated":"2018-12-12T10:16:32Z","file_id":"5220","access_level":"open_access","file_size":1317820,"relation":"main_file","file_name":"IST-2017-808-v1+2_2017_VWangenheim_article.pdf","creator":"system","date_created":"2018-12-12T10:16:32Z"}],"date_created":"2018-12-11T11:50:01Z","acknowledged_ssus":[{"_id":"M-Shop"},{"_id":"Bio"}],"date_published":"2017-01-18T00:00:00Z","department":[{"_id":"JiFr"},{"_id":"Bio"}],"ddc":["580"],"title":"Light sheet fluorescence microscopy of plant roots growing on the surface of a gel","related_material":{"record":[{"relation":"popular_science","status":"public","id":"5565"}]},"oa_version":"Published Version","external_id":{"isi":["000397847200041"]},"isi":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","project":[{"name":"International IST Postdoc Fellowship Programme","grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"name":"Polarity and subcellular dynamics in plants","grant_number":"282300","call_identifier":"FP7","_id":"25716A02-B435-11E9-9278-68D0E5697425"}],"status":"public","year":"2017","language":[{"iso":"eng"}],"month":"01","has_accepted_license":"1","ec_funded":1,"pubrep_id":"808","_id":"1078"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","acknowledgement":"fund: FP7-ERC 0101109","datarep_id":"66","title":"Light Sheet Fluorescence microscopy of plant roots growing on the surface of a gel","related_material":{"record":[{"id":"1078","status":"public","relation":"research_paper"}]},"oa_version":"Published Version","department":[{"_id":"JiFr"},{"_id":"Bio"}],"ddc":["580"],"file":[{"access_level":"open_access","content_type":"video/mp4","date_updated":"2020-07-14T12:47:03Z","file_id":"5599","relation":"main_file","file_size":101497758,"creator":"system","file_name":"IST-2017-66-v1+1_WangenheimHighResolution55044-NEW_1.mp4","checksum":"b7552fc23540a85dc5a22fd4484eae71","date_created":"2018-12-12T13:02:33Z"}],"date_created":"2018-12-12T12:31:34Z","date_published":"2017-04-10T00:00:00Z","ec_funded":1,"_id":"5565","month":"04","has_accepted_license":"1","project":[{"name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734"}],"year":"2017","status":"public","file_date_updated":"2020-07-14T12:47:03Z","fulldoi":"https://doi.org/10.15479/AT:ISTA:66","abstract":[{"lang":"eng","text":"One of the key questions in understanding plant development is how single cells behave in a larger context of the tissue. Therefore, it requires the observation of the whole organ with a high spatial- as well as temporal resolution over prolonged periods of time, which may cause photo-toxic effects. This protocol shows a plant sample preparation method for light-sheet microscopy, which is characterized by mounting the plant vertically on the surface of a gel. The plant is mounted in such a way that the roots are submerged in a liquid medium while the leaves remain in the air. In order to ensure photosynthetic activity of the plant, a custom-made lighting system illuminates the leaves. To keep the roots in darkness the water surface is covered with sheets of black plastic foil. This method allows long-term imaging of plant organ development in standardized conditions. \r\nThe Video is licensed under a CC BY NC ND license. "}],"day":"10","publist_id":"6302","author":[{"last_name":"Von Wangenheim","orcid":"0000-0002-6862-1247","first_name":"Daniel","id":"49E91952-F248-11E8-B48F-1D18A9856A87","full_name":"Von Wangenheim, Daniel"},{"full_name":"Hauschild, Robert","id":"4E01D6B4-F248-11E8-B48F-1D18A9856A87","first_name":"Robert","orcid":"0000-0001-9843-3522","last_name":"Hauschild"},{"last_name":"Friml","full_name":"Friml, Jirí","first_name":"Jirí","id":"4159519E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8302-7596"}],"date_updated":"2026-08-12T14:11:07Z","doi":"10.15479/AT:ISTA:66","publisher":"Institute of Science and Technology Austria","oa":1,"type":"research_data","citation":{"apa":"von Wangenheim, D., Hauschild, R., &#38; Friml, J. (2017). Light Sheet Fluorescence microscopy of plant roots growing on the surface of a gel. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:66\">https://doi.org/10.15479/AT:ISTA:66</a>","ieee":"D. von Wangenheim, R. Hauschild, and J. Friml, “Light Sheet Fluorescence microscopy of plant roots growing on the surface of a gel.” Institute of Science and Technology Austria, 2017.","mla":"von Wangenheim, Daniel, et al. <i>Light Sheet Fluorescence Microscopy of Plant Roots Growing on the Surface of a Gel</i>. Institute of Science and Technology Austria, 2017, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:66\">10.15479/AT:ISTA:66</a>.","ama":"von Wangenheim D, Hauschild R, Friml J. Light Sheet Fluorescence microscopy of plant roots growing on the surface of a gel. 2017. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:66\">10.15479/AT:ISTA:66</a>","short":"D. von Wangenheim, R. Hauschild, J. Friml, (2017).","ista":"von Wangenheim D, Hauschild R, Friml J. 2017. Light Sheet Fluorescence microscopy of plant roots growing on the surface of a gel, Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT:ISTA:66\">10.15479/AT:ISTA:66</a>.","chicago":"Wangenheim, Daniel von, Robert Hauschild, and Jiří Friml. “Light Sheet Fluorescence Microscopy of Plant Roots Growing on the Surface of a Gel.” Institute of Science and Technology Austria, 2017. <a href=\"https://doi.org/10.15479/AT:ISTA:66\">https://doi.org/10.15479/AT:ISTA:66</a>."}}]