[{"title":"Ensembles of bidirectional kinesin Cin8 produce additive forces in both directions of movement","status":"public","page":"2055 - 2067","publist_id":"7369","type":"journal_article","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file_date_updated":"2020-07-14T12:46:31Z","issue":"9","abstract":[{"lang":"eng","text":"Most kinesin motors move in only one direction along microtubules. Members of the kinesin-5 subfamily were initially described as unidirectional plus-end-directed motors and shown to produce piconewton forces. However, some fungal kinesin-5 motors are bidirectional. The force production of a bidirectional kinesin-5 has not yet been measured. Therefore, it remains unknown whether the mechanism of the unconventional minus-end-directed motility differs fundamentally from that of plus-end-directed stepping. Using force spectroscopy, we have measured here the forces that ensembles of purified budding yeast kinesin-5 Cin8 produce in microtubule gliding assays in both plus- and minus-end direction. Correlation analysis of pause forces demonstrated that individual Cin8 molecules produce additive forces in both directions of movement. In ensembles, Cin8 motors were able to produce single-motor forces up to a magnitude of ∼1.5 pN. Hence, these properties appear to be conserved within the kinesin-5 subfamily. Force production was largely independent of the directionality of movement, indicating similarities between the motility mechanisms for both directions. These results provide constraints for the development of models for the bidirectional motility mechanism of fission yeast kinesin-5 and provide insight into the function of this mitotic motor."}],"volume":113,"date_created":"2018-12-11T11:46:33Z","language":[{"iso":"eng"}],"oa":1,"date_updated":"2021-01-12T07:59:28Z","article_type":"original","day":"07","pubrep_id":"965","_id":"453","publisher":"Biophysical Society","citation":{"ieee":"T. Fallesen, J. Roostalu, C. F. Düllberg, G. Pruessner, and T. Surrey, “Ensembles of bidirectional kinesin Cin8 produce additive forces in both directions of movement,” <i>Biophysical Journal</i>, vol. 113, no. 9. Biophysical Society, pp. 2055–2067, 2017.","ista":"Fallesen T, Roostalu J, Düllberg CF, Pruessner G, Surrey T. 2017. Ensembles of bidirectional kinesin Cin8 produce additive forces in both directions of movement. Biophysical Journal. 113(9), 2055–2067.","chicago":"Fallesen, Todd, Johanna Roostalu, Christian F Düllberg, Gunnar Pruessner, and Thomas Surrey. “Ensembles of Bidirectional Kinesin Cin8 Produce Additive Forces in Both Directions of Movement.” <i>Biophysical Journal</i>. Biophysical Society, 2017. <a href=\"https://doi.org/10.1016/j.bpj.2017.09.006\">https://doi.org/10.1016/j.bpj.2017.09.006</a>.","mla":"Fallesen, Todd, et al. “Ensembles of Bidirectional Kinesin Cin8 Produce Additive Forces in Both Directions of Movement.” <i>Biophysical Journal</i>, vol. 113, no. 9, Biophysical Society, 2017, pp. 2055–67, doi:<a href=\"https://doi.org/10.1016/j.bpj.2017.09.006\">10.1016/j.bpj.2017.09.006</a>.","ama":"Fallesen T, Roostalu J, Düllberg CF, Pruessner G, Surrey T. Ensembles of bidirectional kinesin Cin8 produce additive forces in both directions of movement. <i>Biophysical Journal</i>. 2017;113(9):2055-2067. doi:<a href=\"https://doi.org/10.1016/j.bpj.2017.09.006\">10.1016/j.bpj.2017.09.006</a>","apa":"Fallesen, T., Roostalu, J., Düllberg, C. F., Pruessner, G., &#38; Surrey, T. (2017). Ensembles of bidirectional kinesin Cin8 produce additive forces in both directions of movement. <i>Biophysical Journal</i>. Biophysical Society. <a href=\"https://doi.org/10.1016/j.bpj.2017.09.006\">https://doi.org/10.1016/j.bpj.2017.09.006</a>","short":"T. Fallesen, J. Roostalu, C.F. Düllberg, G. Pruessner, T. Surrey, Biophysical Journal 113 (2017) 2055–2067."},"department":[{"_id":"MaLo"}],"ddc":["570"],"year":"2017","has_accepted_license":"1","file":[{"date_updated":"2020-07-14T12:46:31Z","file_id":"5052","content_type":"application/pdf","relation":"main_file","access_level":"open_access","date_created":"2018-12-12T10:14:03Z","file_name":"IST-2018-965-v1+1_2017_Duellberg_Ensembles_of.pdf","creator":"system","checksum":"99a2474088e20ac74b1882c4fbbb45b1","file_size":977192}],"doi":"10.1016/j.bpj.2017.09.006","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","short":"CC BY (4.0)","image":"/images/cc_by.png"},"publication_status":"published","article_processing_charge":"No","oa_version":"Published Version","acknowledgement":"The plasmid for full-length kinesin-1 was a gift from G. Holzwarth and J. Macosko with permission from J. Howard. We thank I. Lueke and N. I. Cade for technical assistance. G.P. thanks the Francis Crick Institute, and in particular the Surrey and Salbreux groups, for their hospitality during his sabbatical stay, as well as Imperial College London for making it possible. This work was supported by the Francis Crick Institute, which receives its core funding from Cancer Research UK (FC001163), the United Kingdom Medical Research Council (FC001163), and the Wellcome Trust (FC001163), and by Imperial College London. J.R. was also supported by a Sir Henry Wellcome Postdoctoral Fellowship (100145/Z/12/Z) and T.S. by the European Research Council (Advanced Grant, project 323042). ","date_published":"2017-11-07T00:00:00Z","publication":"Biophysical Journal","intvolume":"       113","author":[{"last_name":"Fallesen","first_name":"Todd","full_name":"Fallesen, Todd"},{"full_name":"Roostalu, Johanna","first_name":"Johanna","last_name":"Roostalu"},{"orcid":"0000-0001-6335-9748","first_name":"Christian F","full_name":"Düllberg, Christian F","id":"459064DC-F248-11E8-B48F-1D18A9856A87","last_name":"Düllberg"},{"first_name":"Gunnar","full_name":"Pruessner, Gunnar","last_name":"Pruessner"},{"full_name":"Surrey, Thomas","first_name":"Thomas","last_name":"Surrey"}],"month":"11","quality_controlled":"1"},{"date_created":"2018-12-11T11:46:35Z","volume":46,"abstract":[{"lang":"eng","text":"The social insects bees, wasps, ants, and termites are species-rich, occur in many habitats, and often constitute a large part of the biomass. Many are also invasive, including species of termites, the red imported fire ant, and the Argentine ant. While invasive social insects have been a problem in Southern Europe for some time, Central Europa was free of invasive ant species until recently because most ants are adapted to warmer climates. Only in the 1990s, did Lasius neglectus, a close relative of the common black garden ant, arrive in Germany. First described in 1990 based on individuals collected in Budapest, the species has since been detected for example in France, Germany, Spain, England, and Kyrgyzstan. The species is spread with soil during construction work or plantings, and L. neglectus therefore is often found in parks and botanical gardens. Another invasive ant now spreading in southern Germany is Formica fuscocinerea, which occurs along rivers, including in the sandy floodplains of the river Isar. As is typical of pioneer species, F. fuscocinerea quickly becomes extremely abundant and therefore causes problems for example on playgrounds in Munich. All invasive ant species are characterized by cooperation across nests, leading to strongly interconnected, very large super-colonies. The resulting dominance results in the extinction of native ant species as well as other arthropod species and thus in the reduction of biodiversity."}],"language":[{"iso":"eng"}],"oa":1,"date_updated":"2023-10-17T12:28:13Z","day":"04","_id":"459","publisher":"Verlag Dr. Friedrich Pfeil","pubrep_id":"962","citation":{"ieee":"S. Cremer, “Invasive Ameisen in Europa: Wie sie sich ausbreiten und die heimische Fauna verändern,” <i>Rundgespräche Forum Ökologie</i>, vol. 46. Verlag Dr. Friedrich Pfeil, pp. 105–116, 2017.","ista":"Cremer S. 2017. Invasive Ameisen in Europa: Wie sie sich ausbreiten und die heimische Fauna verändern. Rundgespräche Forum Ökologie. 46, 105–116.","chicago":"Cremer, Sylvia. “Invasive Ameisen in Europa: Wie Sie Sich Ausbreiten Und Die Heimische Fauna Verändern.” <i>Rundgespräche Forum Ökologie</i>. Verlag Dr. Friedrich Pfeil, 2017.","mla":"Cremer, Sylvia. “Invasive Ameisen in Europa: Wie Sie Sich Ausbreiten Und Die Heimische Fauna Verändern.” <i>Rundgespräche Forum Ökologie</i>, vol. 46, Verlag Dr. Friedrich Pfeil, 2017, pp. 105–16.","ama":"Cremer S. Invasive Ameisen in Europa: Wie sie sich ausbreiten und die heimische Fauna verändern. <i>Rundgespräche Forum Ökologie</i>. 2017;46:105-116.","apa":"Cremer, S. (2017). Invasive Ameisen in Europa: Wie sie sich ausbreiten und die heimische Fauna verändern. <i>Rundgespräche Forum Ökologie</i>. Verlag Dr. Friedrich Pfeil.","short":"S. Cremer, Rundgespräche Forum Ökologie 46 (2017) 105–116."},"department":[{"_id":"SyCr"}],"publication_identifier":{"issn":["2366-2875"]},"status":"public","title":"Invasive Ameisen in Europa: Wie sie sich ausbreiten und die heimische Fauna verändern","page":"105 - 116","publist_id":"7362","type":"journal_article","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file_date_updated":"2020-07-14T12:46:32Z","license":"https://creativecommons.org/licenses/by-nd/4.0/","date_published":"2017-04-04T00:00:00Z","publication":"Rundgespräche Forum Ökologie","month":"04","intvolume":"        46","author":[{"last_name":"Cremer","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2193-3868","full_name":"Cremer, Sylvia","first_name":"Sylvia"}],"quality_controlled":"1","ddc":["592"],"year":"2017","has_accepted_license":"1","file":[{"checksum":"4919baf9050415ca151fe22497379f78","file_size":1711131,"access_level":"open_access","date_created":"2018-12-12T10:15:52Z","file_name":"IST-2018-962-v1+1_044676698_07_Cremer__Invasive_Ameisen_in_Europa_...__BY-ND_.pdf","creator":"system","date_updated":"2020-07-14T12:46:32Z","content_type":"application/pdf","file_id":"5175","relation":"main_file"}],"tmp":{"name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","short":"CC BY-ND (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode","image":"/image/cc_by_nd.png"},"publication_status":"published","article_processing_charge":"No","oa_version":"Published Version"},{"author":[{"id":"2EE67FDC-F248-11E8-B48F-1D18A9856A87","last_name":"Altmeyer","full_name":"Altmeyer, Sebastian","orcid":"0000-0001-5964-0203","first_name":"Sebastian"},{"last_name":"Do","full_name":"Do, Younghae","first_name":"Younghae"},{"first_name":"Soorok","full_name":"Ryu, Soorok","last_name":"Ryu"}],"intvolume":"        27","month":"11","article_number":"113112","quality_controlled":"1","date_published":"2017-11-01T00:00:00Z","publication":"Chaos","publication_status":"published","article_processing_charge":"No","oa_version":"Published Version","ddc":["530"],"year":"2017","has_accepted_license":"1","file":[{"file_size":7714020,"checksum":"0731f9d416760c1062db258ca51f8bdc","file_id":"6970","content_type":"application/pdf","date_updated":"2020-07-14T12:46:32Z","relation":"main_file","access_level":"open_access","creator":"dernst","date_created":"2019-10-24T15:14:30Z","file_name":"2017_Chaos_Altmeyer.pdf"}],"doi":"10.1063/1.5002771","day":"01","_id":"463","publisher":"AIP Publishing","citation":{"ieee":"S. Altmeyer, Y. Do, and S. Ryu, “Transient behavior between multi-cell flow states in ferrofluidic Taylor-Couette flow,” <i>Chaos</i>, vol. 27, no. 11. AIP Publishing, 2017.","mla":"Altmeyer, Sebastian, et al. “Transient Behavior between Multi-Cell Flow States in Ferrofluidic Taylor-Couette Flow.” <i>Chaos</i>, vol. 27, no. 11, 113112, AIP Publishing, 2017, doi:<a href=\"https://doi.org/10.1063/1.5002771\">10.1063/1.5002771</a>.","chicago":"Altmeyer, Sebastian, Younghae Do, and Soorok Ryu. “Transient Behavior between Multi-Cell Flow States in Ferrofluidic Taylor-Couette Flow.” <i>Chaos</i>. AIP Publishing, 2017. <a href=\"https://doi.org/10.1063/1.5002771\">https://doi.org/10.1063/1.5002771</a>.","ista":"Altmeyer S, Do Y, Ryu S. 2017. Transient behavior between multi-cell flow states in ferrofluidic Taylor-Couette flow. Chaos. 27(11), 113112.","ama":"Altmeyer S, Do Y, Ryu S. Transient behavior between multi-cell flow states in ferrofluidic Taylor-Couette flow. <i>Chaos</i>. 2017;27(11). doi:<a href=\"https://doi.org/10.1063/1.5002771\">10.1063/1.5002771</a>","apa":"Altmeyer, S., Do, Y., &#38; Ryu, S. (2017). Transient behavior between multi-cell flow states in ferrofluidic Taylor-Couette flow. <i>Chaos</i>. AIP Publishing. <a href=\"https://doi.org/10.1063/1.5002771\">https://doi.org/10.1063/1.5002771</a>","short":"S. Altmeyer, Y. Do, S. Ryu, Chaos 27 (2017)."},"department":[{"_id":"BjHo"}],"volume":27,"abstract":[{"text":"We investigate transient behaviors induced by magnetic fields on the dynamics of the flow of a ferrofluid in the gap between two concentric, independently rotating cylinders. Without applying any magnetic fields, we uncover emergence of flow states constituted by a combination of a localized spiral state (SPIl) in the top and bottom of the annulus and different multi-cell flow states (SPI2v, SPI3v) with toroidally closed vortices in the interior of the bulk (SPIl+2v = SPIl + SPI2v and SPIl+3v = SPIl + SPI3v). However, when a magnetic field is presented, we observe the transient behaviors between multi-cell states passing through two critical thresholds in a strength of an axial (transverse) magnetic field. Before the first critical threshold of a magnetic field strength, multi-stable states with different number of cells could be observed. After the first critical threshold, we find the transient behavior between the three- and two-cell flow states. For more strength of magnetic field or after the second critical threshold, we discover that multi-cell states are disappeared and a localized spiral state remains to be stimulated. The studied transient behavior could be understood by the investigation of various quantities including a modal kinetic energy, a mode amplitude of the radial velocity, wavenumber, angular momentum, and torque. In addition, the emergence of new flow states and the transient behavior between their states in ferrofluidic flows indicate that richer and potentially controllable dynamics through magnetic fields could be possible in ferrofluic flow.","lang":"eng"}],"date_created":"2018-12-11T11:46:37Z","language":[{"iso":"eng"}],"oa":1,"article_type":"original","date_updated":"2024-02-28T13:02:12Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file_date_updated":"2020-07-14T12:46:32Z","issue":"11","scopus_import":"1","title":"Transient behavior between multi-cell flow states in ferrofluidic Taylor-Couette flow","status":"public","publication_identifier":{"issn":["10541500"]},"publist_id":"7358","type":"journal_article"},{"project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"grant_number":"S11407","name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications"}],"oa_version":"Published Version","article_processing_charge":"No","tmp":{"name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","short":"CC BY-ND (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode","image":"/image/cc_by_nd.png"},"publication_status":"published","has_accepted_license":"1","file":[{"relation":"main_file","date_updated":"2020-07-14T12:46:32Z","content_type":"application/pdf","file_id":"5010","creator":"system","file_name":"IST-2018-956-v1+1_2017_Chatterjee_Improved_algorithms.pdf","date_created":"2018-12-12T10:13:27Z","access_level":"open_access","file_size":582940,"checksum":"12d469ae69b80361333d7dead965cf5d"}],"doi":"10.23638/LMCS-13(3:26)2017","year":"2017","related_material":{"record":[{"id":"1661","relation":"earlier_version","status":"public"}]},"ddc":["004"],"quality_controlled":"1","article_number":"26","month":"09","author":[{"last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H","full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530"},{"full_name":"Loitzenbauer, Veronika","first_name":"Veronika","last_name":"Loitzenbauer"}],"intvolume":"        13","publication":"Logical Methods in Computer Science","external_id":{"arxiv":["1410.0833"]},"date_published":"2017-09-26T00:00:00Z","arxiv":1,"issue":"3","ec_funded":1,"file_date_updated":"2020-07-14T12:46:32Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"journal_article","publist_id":"7357","title":"Improved algorithms for parity and Streett objectives","scopus_import":"1","status":"public","publication_identifier":{"issn":["1860-5974"]},"department":[{"_id":"KrCh"}],"citation":{"mla":"Chatterjee, Krishnendu, et al. “Improved Algorithms for Parity and Streett Objectives.” <i>Logical Methods in Computer Science</i>, vol. 13, no. 3, 26, International Federation of Computational Logic, 2017, doi:<a href=\"https://doi.org/10.23638/LMCS-13(3:26)2017\">10.23638/LMCS-13(3:26)2017</a>.","ista":"Chatterjee K, Henzinger MH, Loitzenbauer V. 2017. Improved algorithms for parity and Streett objectives. Logical Methods in Computer Science. 13(3), 26.","chicago":"Chatterjee, Krishnendu, Monika H Henzinger, and Veronika Loitzenbauer. “Improved Algorithms for Parity and Streett Objectives.” <i>Logical Methods in Computer Science</i>. International Federation of Computational Logic, 2017. <a href=\"https://doi.org/10.23638/LMCS-13(3:26)2017\">https://doi.org/10.23638/LMCS-13(3:26)2017</a>.","ieee":"K. Chatterjee, M. H. Henzinger, and V. Loitzenbauer, “Improved algorithms for parity and Streett objectives,” <i>Logical Methods in Computer Science</i>, vol. 13, no. 3. International Federation of Computational Logic, 2017.","apa":"Chatterjee, K., Henzinger, M. H., &#38; Loitzenbauer, V. (2017). Improved algorithms for parity and Streett objectives. <i>Logical Methods in Computer Science</i>. International Federation of Computational Logic. <a href=\"https://doi.org/10.23638/LMCS-13(3:26)2017\">https://doi.org/10.23638/LMCS-13(3:26)2017</a>","ama":"Chatterjee K, Henzinger MH, Loitzenbauer V. Improved algorithms for parity and Streett objectives. <i>Logical Methods in Computer Science</i>. 2017;13(3). doi:<a href=\"https://doi.org/10.23638/LMCS-13(3:26)2017\">10.23638/LMCS-13(3:26)2017</a>","short":"K. Chatterjee, M.H. Henzinger, V. Loitzenbauer, Logical Methods in Computer Science 13 (2017)."},"day":"26","_id":"464","pubrep_id":"956","publisher":"International Federation of Computational Logic","date_updated":"2025-06-02T08:53:41Z","oa":1,"language":[{"iso":"eng"}],"volume":13,"abstract":[{"text":"The computation of the winning set for parity objectives and for Streett objectives in graphs as well as in game graphs are central problems in computer-aided verification, with application to the verification of closed systems with strong fairness conditions, the verification of open systems, checking interface compatibility, well-formedness of specifications, and the synthesis of reactive systems. We show how to compute the winning set on n vertices for (1) parity-3 (aka one-pair Streett) objectives in game graphs in time O(n5/2) and for (2) k-pair Streett objectives in graphs in time O(n2+nklogn). For both problems this gives faster algorithms for dense graphs and represents the first improvement in asymptotic running time in 15 years.","lang":"eng"}],"date_created":"2018-12-11T11:46:37Z"},{"publication":"Logical Methods in Computer Science","date_published":"2017-09-13T00:00:00Z","month":"09","intvolume":"        13","author":[{"last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"first_name":"Thomas A","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger"},{"orcid":"0000-0003-4783-0389","full_name":"Ibsen-Jensen, Rasmus","first_name":"Rasmus","last_name":"Ibsen-Jensen","id":"3B699956-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Jan","full_name":"Otop, Jan","last_name":"Otop"}],"quality_controlled":"1","related_material":{"record":[{"id":"1610","status":"public","relation":"earlier_version"},{"status":"public","relation":"earlier_version","id":"5438"}]},"ddc":["004"],"file":[{"access_level":"open_access","date_created":"2018-12-12T10:14:37Z","file_name":"IST-2015-321-v1+1_main.pdf","creator":"system","file_id":"5090","content_type":"application/pdf","date_updated":"2020-07-14T12:46:33Z","relation":"main_file","file_size":279071,"checksum":"08041379ba408d40664f449eb5907a8f"},{"checksum":"08041379ba408d40664f449eb5907a8f","file_size":279071,"creator":"system","date_created":"2018-12-12T10:14:38Z","file_name":"IST-2018-955-v1+1_2017_Chatterjee_Edit_distance.pdf","access_level":"open_access","relation":"main_file","file_id":"5091","content_type":"application/pdf","date_updated":"2020-07-14T12:46:33Z"}],"has_accepted_license":"1","doi":"10.23638/LMCS-13(3:23)2017","year":"2017","tmp":{"name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","short":"CC BY-ND (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode","image":"/image/cc_by_nd.png"},"publication_status":"published","project":[{"name":"Moderne Concurrency Paradigms","grant_number":"S11402-N23","call_identifier":"FWF","_id":"25F5A88A-B435-11E9-9278-68D0E5697425"},{"name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"name":"The Wittgenstein Prize","grant_number":"Z211","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","grant_number":"267989"},{"call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307"},{"name":"Game Theory","grant_number":"S11407","call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425"}],"oa_version":"Published Version","language":[{"iso":"eng"}],"date_created":"2018-12-11T11:46:37Z","abstract":[{"lang":"eng","text":"The edit distance between two words w 1 , w 2 is the minimal number of word operations (letter insertions, deletions, and substitutions) necessary to transform w 1 to w 2 . The edit distance generalizes to languages L 1 , L 2 , where the edit distance from L 1 to L 2 is the minimal number k such that for every word from L 1 there exists a word in L 2 with edit distance at most k . We study the edit distance computation problem between pushdown automata and their subclasses. The problem of computing edit distance to a pushdown automaton is undecidable, and in practice, the interesting question is to compute the edit distance from a pushdown automaton (the implementation, a standard model for programs with recursion) to a regular language (the specification). In this work, we present a complete picture of decidability and complexity for the following problems: (1) deciding whether, for a given threshold k , the edit distance from a pushdown automaton to a finite automaton is at most k , and (2) deciding whether the edit distance from a pushdown automaton to a finite automaton is finite. "}],"volume":13,"date_updated":"2023-02-23T12:26:25Z","oa":1,"citation":{"ama":"Chatterjee K, Henzinger TA, Ibsen-Jensen R, Otop J. Edit distance for pushdown automata. <i>Logical Methods in Computer Science</i>. 2017;13(3). doi:<a href=\"https://doi.org/10.23638/LMCS-13(3:23)2017\">10.23638/LMCS-13(3:23)2017</a>","apa":"Chatterjee, K., Henzinger, T. A., Ibsen-Jensen, R., &#38; Otop, J. (2017). Edit distance for pushdown automata. <i>Logical Methods in Computer Science</i>. International Federation of Computational Logic. <a href=\"https://doi.org/10.23638/LMCS-13(3:23)2017\">https://doi.org/10.23638/LMCS-13(3:23)2017</a>","short":"K. Chatterjee, T.A. Henzinger, R. Ibsen-Jensen, J. Otop, Logical Methods in Computer Science 13 (2017).","ieee":"K. Chatterjee, T. A. Henzinger, R. Ibsen-Jensen, and J. Otop, “Edit distance for pushdown automata,” <i>Logical Methods in Computer Science</i>, vol. 13, no. 3. International Federation of Computational Logic, 2017.","mla":"Chatterjee, Krishnendu, et al. “Edit Distance for Pushdown Automata.” <i>Logical Methods in Computer Science</i>, vol. 13, no. 3, International Federation of Computational Logic, 2017, doi:<a href=\"https://doi.org/10.23638/LMCS-13(3:23)2017\">10.23638/LMCS-13(3:23)2017</a>.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, Rasmus Ibsen-Jensen, and Jan Otop. “Edit Distance for Pushdown Automata.” <i>Logical Methods in Computer Science</i>. International Federation of Computational Logic, 2017. <a href=\"https://doi.org/10.23638/LMCS-13(3:23)2017\">https://doi.org/10.23638/LMCS-13(3:23)2017</a>.","ista":"Chatterjee K, Henzinger TA, Ibsen-Jensen R, Otop J. 2017. Edit distance for pushdown automata. Logical Methods in Computer Science. 13(3)."},"day":"13","pubrep_id":"955","_id":"465","publisher":"International Federation of Computational Logic","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"publist_id":"7356","type":"journal_article","scopus_import":1,"status":"public","publication_identifier":{"issn":["18605974"]},"title":"Edit distance for pushdown automata","file_date_updated":"2020-07-14T12:46:33Z","ec_funded":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","issue":"3"},{"has_accepted_license":"1","file":[{"file_size":511832,"checksum":"bfa405385ec6229ad5ead89ab5751639","content_type":"application/pdf","date_updated":"2020-07-14T12:46:33Z","file_id":"5354","relation":"main_file","access_level":"open_access","creator":"system","date_created":"2018-12-12T10:18:32Z","file_name":"IST-2018-957-v1+1_2017_Chatterjee_Unifying_two.pdf"}],"doi":"10.23638/LMCS-13(2:15)2017","year":"2017","related_material":{"record":[{"status":"public","relation":"earlier_version","id":"1657"},{"id":"5429","relation":"earlier_version","status":"public"},{"id":"5435","relation":"earlier_version","status":"public"}]},"ddc":["004"],"project":[{"name":"International IST Postdoc Fellowship Programme","grant_number":"291734","call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425"},{"grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications"},{"_id":"2590DB08-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"701309","name":"Atomic-Resolution Structures of Mitochondrial Respiratory Chain Supercomplexes (H2020)"}],"oa_version":"Published Version","tmp":{"name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","short":"CC BY-ND (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode","image":"/image/cc_by_nd.png"},"publication_status":"published","publication":"Logical Methods in Computer Science","date_published":"2017-07-03T00:00:00Z","quality_controlled":"1","article_number":"15","month":"07","intvolume":"        13","author":[{"last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu"},{"full_name":"Křetínská, Zuzana","first_name":"Zuzana","last_name":"Křetínská"},{"last_name":"Kretinsky","id":"44CEF464-F248-11E8-B48F-1D18A9856A87","first_name":"Jan","orcid":"0000-0002-8122-2881","full_name":"Kretinsky, Jan"}],"type":"journal_article","publist_id":"7355","title":"Unifying two views on multiple mean-payoff objectives in Markov decision processes","status":"public","publication_identifier":{"issn":["18605974"]},"scopus_import":1,"issue":"2","file_date_updated":"2020-07-14T12:46:33Z","ec_funded":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2023-02-23T12:26:16Z","oa":1,"language":[{"iso":"eng"}],"volume":13,"abstract":[{"text":"We consider Markov decision processes (MDPs) with multiple limit-average (or mean-payoff) objectives. There exist two different views: (i) the expectation semantics, where the goal is to optimize the expected mean-payoff objective, and (ii) the satisfaction semantics, where the goal is to maximize the probability of runs such that the mean-payoff value stays above a given vector. We consider optimization with respect to both objectives at once, thus unifying the existing semantics. Precisely, the goal is to optimize the expectation while ensuring the satisfaction constraint. Our problem captures the notion of optimization with respect to strategies that are risk-averse (i.e., ensure certain probabilistic guarantee). Our main results are as follows: First, we present algorithms for the decision problems which are always polynomial in the size of the MDP. We also show that an approximation of the Pareto-curve can be computed in time polynomial in the size of the MDP, and the approximation factor, but exponential in the number of dimensions. Second, we present a complete characterization of the strategy complexity (in terms of memory bounds and randomization) required to solve our problem. ","lang":"eng"}],"date_created":"2018-12-11T11:46:38Z","department":[{"_id":"KrCh"}],"citation":{"chicago":"Chatterjee, Krishnendu, Zuzana Křetínská, and Jan Kretinsky. “Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes.” <i>Logical Methods in Computer Science</i>. International Federation of Computational Logic, 2017. <a href=\"https://doi.org/10.23638/LMCS-13(2:15)2017\">https://doi.org/10.23638/LMCS-13(2:15)2017</a>.","ista":"Chatterjee K, Křetínská Z, Kretinsky J. 2017. Unifying two views on multiple mean-payoff objectives in Markov decision processes. Logical Methods in Computer Science. 13(2), 15.","mla":"Chatterjee, Krishnendu, et al. “Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes.” <i>Logical Methods in Computer Science</i>, vol. 13, no. 2, 15, International Federation of Computational Logic, 2017, doi:<a href=\"https://doi.org/10.23638/LMCS-13(2:15)2017\">10.23638/LMCS-13(2:15)2017</a>.","ieee":"K. Chatterjee, Z. Křetínská, and J. Kretinsky, “Unifying two views on multiple mean-payoff objectives in Markov decision processes,” <i>Logical Methods in Computer Science</i>, vol. 13, no. 2. International Federation of Computational Logic, 2017.","apa":"Chatterjee, K., Křetínská, Z., &#38; Kretinsky, J. (2017). Unifying two views on multiple mean-payoff objectives in Markov decision processes. <i>Logical Methods in Computer Science</i>. International Federation of Computational Logic. <a href=\"https://doi.org/10.23638/LMCS-13(2:15)2017\">https://doi.org/10.23638/LMCS-13(2:15)2017</a>","ama":"Chatterjee K, Křetínská Z, Kretinsky J. Unifying two views on multiple mean-payoff objectives in Markov decision processes. <i>Logical Methods in Computer Science</i>. 2017;13(2). doi:<a href=\"https://doi.org/10.23638/LMCS-13(2:15)2017\">10.23638/LMCS-13(2:15)2017</a>","short":"K. Chatterjee, Z. Křetínská, J. Kretinsky, Logical Methods in Computer Science 13 (2017)."},"day":"03","pubrep_id":"957","_id":"466","publisher":"International Federation of Computational Logic"},{"quality_controlled":"1","article_number":"31","intvolume":"        18","month":"12","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"full_name":"Henzinger, Thomas A","first_name":"Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger"},{"first_name":"Jan","full_name":"Otop, Jan","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","last_name":"Otop"}],"external_id":{"arxiv":["1606.03598"]},"publication":"ACM Transactions on Computational Logic (TOCL)","date_published":"2017-12-01T00:00:00Z","arxiv":1,"oa_version":"Preprint","project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"},{"call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"The Wittgenstein Prize","grant_number":"Z211"},{"call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23"},{"call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"publication_status":"published","doi":"10.1145/3152769","year":"2017","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"1656"},{"relation":"earlier_version","status":"public","id":"5415"},{"relation":"earlier_version","status":"public","id":"5436"}]},"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"citation":{"mla":"Chatterjee, Krishnendu, et al. “Nested Weighted Automata.” <i>ACM Transactions on Computational Logic (TOCL)</i>, vol. 18, no. 4, 31, ACM, 2017, doi:<a href=\"https://doi.org/10.1145/3152769\">10.1145/3152769</a>.","ista":"Chatterjee K, Henzinger TA, Otop J. 2017. Nested weighted automata. ACM Transactions on Computational Logic (TOCL). 18(4), 31.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Nested Weighted Automata.” <i>ACM Transactions on Computational Logic (TOCL)</i>. ACM, 2017. <a href=\"https://doi.org/10.1145/3152769\">https://doi.org/10.1145/3152769</a>.","ieee":"K. Chatterjee, T. A. Henzinger, and J. Otop, “Nested weighted automata,” <i>ACM Transactions on Computational Logic (TOCL)</i>, vol. 18, no. 4. ACM, 2017.","short":"K. Chatterjee, T.A. Henzinger, J. Otop, ACM Transactions on Computational Logic (TOCL) 18 (2017).","apa":"Chatterjee, K., Henzinger, T. A., &#38; Otop, J. (2017). Nested weighted automata. <i>ACM Transactions on Computational Logic (TOCL)</i>. ACM. <a href=\"https://doi.org/10.1145/3152769\">https://doi.org/10.1145/3152769</a>","ama":"Chatterjee K, Henzinger TA, Otop J. Nested weighted automata. <i>ACM Transactions on Computational Logic (TOCL)</i>. 2017;18(4). doi:<a href=\"https://doi.org/10.1145/3152769\">10.1145/3152769</a>"},"day":"01","_id":"467","publisher":"ACM","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1606.03598"}],"date_updated":"2023-02-23T12:26:19Z","oa":1,"language":[{"iso":"eng"}],"abstract":[{"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.","lang":"eng"}],"date_created":"2018-12-11T11:46:38Z","volume":18,"issue":"4","ec_funded":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"journal_article","publist_id":"7354","scopus_import":1,"title":"Nested weighted automata","status":"public","publication_identifier":{"issn":["15293785"]}},{"department":[{"_id":"ChWo"}],"day":"01","publisher":"ACM","_id":"470","citation":{"ieee":"S. Jeschke and C. Wojtan, “Water wave packets,” <i>ACM Transactions on Graphics</i>, vol. 36, no. 4. ACM, 2017.","mla":"Jeschke, Stefan, and Chris Wojtan. “Water Wave Packets.” <i>ACM Transactions on Graphics</i>, vol. 36, no. 4, 103, ACM, 2017, doi:<a href=\"https://doi.org/10.1145/3072959.3073678\">10.1145/3072959.3073678</a>.","ista":"Jeschke S, Wojtan C. 2017. Water wave packets. ACM Transactions on Graphics. 36(4), 103.","chicago":"Jeschke, Stefan, and Chris Wojtan. “Water Wave Packets.” <i>ACM Transactions on Graphics</i>. ACM, 2017. <a href=\"https://doi.org/10.1145/3072959.3073678\">https://doi.org/10.1145/3072959.3073678</a>.","short":"S. Jeschke, C. Wojtan, ACM Transactions on Graphics 36 (2017).","ama":"Jeschke S, Wojtan C. Water wave packets. <i>ACM Transactions on Graphics</i>. 2017;36(4). doi:<a href=\"https://doi.org/10.1145/3072959.3073678\">10.1145/3072959.3073678</a>","apa":"Jeschke, S., &#38; Wojtan, C. (2017). Water wave packets. <i>ACM Transactions on Graphics</i>. ACM. <a href=\"https://doi.org/10.1145/3072959.3073678\">https://doi.org/10.1145/3072959.3073678</a>"},"oa":1,"date_updated":"2023-02-23T12:20:26Z","article_type":"original","abstract":[{"text":"This paper presents a method for simulating water surface waves as a displacement field on a 2D domain. Our method relies on Lagrangian particles that carry packets of water wave energy; each packet carries information about an entire group of wave trains, as opposed to only a single wave crest. Our approach is unconditionally stable and can simulate high resolution geometric details. This approach also presents a straightforward interface for artistic control, because it is essentially a particle system with intuitive parameters like wavelength and amplitude. Our implementation parallelizes well and runs in real time for moderately challenging scenarios.","lang":"eng"}],"date_created":"2018-12-11T11:46:39Z","volume":36,"language":[{"iso":"eng"}],"issue":"4","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file_date_updated":"2020-07-14T12:46:34Z","ec_funded":1,"publication_identifier":{"issn":["07300301"]},"scopus_import":1,"title":"Water wave packets","status":"public","type":"journal_article","publist_id":"7350","acknowledged_ssus":[{"_id":"ScienComp"}],"article_number":"103","quality_controlled":"1","month":"07","intvolume":"        36","author":[{"last_name":"Jeschke","id":"44D6411A-F248-11E8-B48F-1D18A9856A87","first_name":"Stefan","full_name":"Jeschke, Stefan"},{"last_name":"Wojtan","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","first_name":"Christopher J","full_name":"Wojtan, Christopher J","orcid":"0000-0001-6646-5546"}],"date_published":"2017-07-01T00:00:00Z","publication":"ACM Transactions on Graphics","oa_version":"Published Version","project":[{"name":"Efficient Simulation of Natural Phenomena at Extremely Large Scales","grant_number":"638176","call_identifier":"H2020","_id":"2533E772-B435-11E9-9278-68D0E5697425"}],"publication_status":"published","article_processing_charge":"Yes (in subscription journal)","year":"2017","file":[{"checksum":"82a3b2bfeee4ddef16ecc21675d1a48a","file_size":13131683,"file_name":"wavepackets_final.pdf","date_created":"2020-01-24T09:32:35Z","creator":"wojtan","access_level":"open_access","relation":"main_file","date_updated":"2020-07-14T12:46:34Z","file_id":"7359","content_type":"application/pdf"}],"has_accepted_license":"1","doi":"10.1145/3072959.3073678","ddc":["006"]},{"project":[{"name":"Quantitative Reactive Modeling","grant_number":"267989","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"_id":"25F5A88A-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S11402-N23","name":"Moderne Concurrency Paradigms"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"Z211","name":"The Wittgenstein Prize"},{"_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"291734","name":"International IST Postdoc Fellowship Programme"}],"oa_version":"Submitted Version","publication_status":"published","year":"2017","doi":"10.1145/3060139","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"1234"}]},"article_number":"12","quality_controlled":"1","month":"05","intvolume":"        18","author":[{"last_name":"Daca","id":"49351290-F248-11E8-B48F-1D18A9856A87","full_name":"Daca, Przemyslaw","first_name":"Przemyslaw"},{"first_name":"Thomas A","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Kretinsky","id":"44CEF464-F248-11E8-B48F-1D18A9856A87","first_name":"Jan","orcid":"0000-0002-8122-2881","full_name":"Kretinsky, Jan"},{"id":"3D5811FC-F248-11E8-B48F-1D18A9856A87","last_name":"Petrov","full_name":"Petrov, Tatjana","first_name":"Tatjana","orcid":"0000-0002-9041-0905"}],"date_published":"2017-05-01T00:00:00Z","publication":"ACM Transactions on Computational Logic (TOCL)","issue":"2","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ec_funded":1,"title":"Faster statistical model checking for unbounded temporal properties","publication_identifier":{"issn":["15293785"]},"status":"public","scopus_import":1,"type":"journal_article","publist_id":"7349","department":[{"_id":"ToHe"}],"day":"01","publisher":"ACM","_id":"471","citation":{"chicago":"Daca, Przemyslaw, Thomas A Henzinger, Jan Kretinsky, and Tatjana Petrov. “Faster Statistical Model Checking for Unbounded Temporal Properties.” <i>ACM Transactions on Computational Logic (TOCL)</i>. ACM, 2017. <a href=\"https://doi.org/10.1145/3060139\">https://doi.org/10.1145/3060139</a>.","ista":"Daca P, Henzinger TA, Kretinsky J, Petrov T. 2017. Faster statistical model checking for unbounded temporal properties. ACM Transactions on Computational Logic (TOCL). 18(2), 12.","mla":"Daca, Przemyslaw, et al. “Faster Statistical Model Checking for Unbounded Temporal Properties.” <i>ACM Transactions on Computational Logic (TOCL)</i>, vol. 18, no. 2, 12, ACM, 2017, doi:<a href=\"https://doi.org/10.1145/3060139\">10.1145/3060139</a>.","ieee":"P. Daca, T. A. Henzinger, J. Kretinsky, and T. Petrov, “Faster statistical model checking for unbounded temporal properties,” <i>ACM Transactions on Computational Logic (TOCL)</i>, vol. 18, no. 2. ACM, 2017.","apa":"Daca, P., Henzinger, T. A., Kretinsky, J., &#38; Petrov, T. (2017). Faster statistical model checking for unbounded temporal properties. <i>ACM Transactions on Computational Logic (TOCL)</i>. ACM. <a href=\"https://doi.org/10.1145/3060139\">https://doi.org/10.1145/3060139</a>","ama":"Daca P, Henzinger TA, Kretinsky J, Petrov T. Faster statistical model checking for unbounded temporal properties. <i>ACM Transactions on Computational Logic (TOCL)</i>. 2017;18(2). doi:<a href=\"https://doi.org/10.1145/3060139\">10.1145/3060139</a>","short":"P. Daca, T.A. Henzinger, J. Kretinsky, T. Petrov, ACM Transactions on Computational Logic (TOCL) 18 (2017)."},"oa":1,"date_updated":"2023-02-21T16:48:11Z","main_file_link":[{"url":"https://arxiv.org/abs/1504.05739","open_access":"1"}],"volume":18,"abstract":[{"lang":"eng","text":"We present a new algorithm for the statistical model checking of Markov chains with respect to unbounded temporal properties, including full linear temporal logic. The main idea is that we monitor each simulation run on the fly, in order to detect quickly if a bottom strongly connected component is entered with high probability, in which case the simulation run can be terminated early. As a result, our simulation runs are often much shorter than required by termination bounds that are computed a priori for a desired level of confidence on a large state space. In comparison to previous algorithms for statistical model checking our method is not only faster in many cases but also requires less information about the system, namely, only the minimum transition probability that occurs in the Markov chain. In addition, our method can be generalised to unbounded quantitative properties such as mean-payoff bounds. "}],"date_created":"2018-12-11T11:46:39Z","language":[{"iso":"eng"}]},{"title":"Planar matchings for weighted straight skeletons","scopus_import":1,"status":"public","page":"211 - 229","publist_id":"7338","type":"journal_article","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","file_date_updated":"2020-07-14T12:46:35Z","issue":"3-4","abstract":[{"text":"We introduce planar matchings on directed pseudo-line arrangements, which yield a planar set of pseudo-line segments such that only matching-partners are adjacent. By translating the planar matching problem into a corresponding stable roommates problem we show that such matchings always exist. Using our new framework, we establish, for the first time, a complete, rigorous definition of weighted straight skeletons, which are based on a so-called wavefront propagation process. We present a generalized and unified approach to treat structural changes in the wavefront that focuses on the restoration of weak planarity by finding planar matchings.","lang":"eng"}],"volume":26,"date_created":"2018-12-11T11:46:43Z","language":[{"iso":"eng"}],"oa":1,"date_updated":"2023-02-21T16:06:22Z","day":"13","publisher":"World Scientific Publishing","_id":"481","pubrep_id":"949","citation":{"ama":"Biedl T, Huber S, Palfrader P. Planar matchings for weighted straight skeletons. <i>International Journal of Computational Geometry and Applications</i>. 2017;26(3-4):211-229. doi:<a href=\"https://doi.org/10.1142/S0218195916600050\">10.1142/S0218195916600050</a>","apa":"Biedl, T., Huber, S., &#38; Palfrader, P. (2017). Planar matchings for weighted straight skeletons. <i>International Journal of Computational Geometry and Applications</i>. World Scientific Publishing. <a href=\"https://doi.org/10.1142/S0218195916600050\">https://doi.org/10.1142/S0218195916600050</a>","short":"T. Biedl, S. Huber, P. Palfrader, International Journal of Computational Geometry and Applications 26 (2017) 211–229.","ieee":"T. Biedl, S. Huber, and P. Palfrader, “Planar matchings for weighted straight skeletons,” <i>International Journal of Computational Geometry and Applications</i>, vol. 26, no. 3–4. World Scientific Publishing, pp. 211–229, 2017.","chicago":"Biedl, Therese, Stefan Huber, and Peter Palfrader. “Planar Matchings for Weighted Straight Skeletons.” <i>International Journal of Computational Geometry and Applications</i>. World Scientific Publishing, 2017. <a href=\"https://doi.org/10.1142/S0218195916600050\">https://doi.org/10.1142/S0218195916600050</a>.","ista":"Biedl T, Huber S, Palfrader P. 2017. Planar matchings for weighted straight skeletons. International Journal of Computational Geometry and Applications. 26(3–4), 211–229.","mla":"Biedl, Therese, et al. “Planar Matchings for Weighted Straight Skeletons.” <i>International Journal of Computational Geometry and Applications</i>, vol. 26, no. 3–4, World Scientific Publishing, 2017, pp. 211–29, doi:<a href=\"https://doi.org/10.1142/S0218195916600050\">10.1142/S0218195916600050</a>."},"department":[{"_id":"HeEd"}],"ddc":["004","514","516"],"related_material":{"record":[{"status":"public","relation":"earlier_version","id":"10892"}]},"year":"2017","file":[{"checksum":"f79e8558bfe4b368dfefeb8eec2e3a5e","file_size":769296,"access_level":"open_access","date_created":"2018-12-12T10:09:34Z","file_name":"IST-2018-949-v1+1_2016_huber_PLanar_matchings.pdf","creator":"system","date_updated":"2020-07-14T12:46:35Z","file_id":"4758","content_type":"application/pdf","relation":"main_file"}],"has_accepted_license":"1","doi":"10.1142/S0218195916600050","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","short":"CC BY (4.0)","image":"/images/cc_by.png"},"publication_status":"published","oa_version":"Published Version","acknowledgement":"Supported by NSERC and the Ross and Muriel Cheriton Fellowship. Research supported by Austrian Science Fund (FWF): P25816-N15.","date_published":"2017-04-13T00:00:00Z","publication":"International Journal of Computational Geometry and Applications","intvolume":"        26","author":[{"full_name":"Biedl, Therese","first_name":"Therese","last_name":"Biedl"},{"last_name":"Huber","id":"4700A070-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8871-5814","first_name":"Stefan","full_name":"Huber, Stefan"},{"last_name":"Palfrader","full_name":"Palfrader, Peter","first_name":"Peter"}],"month":"04","quality_controlled":"1"},{"publication":"Advances in Theoretical and Mathematical Physics","date_published":"2017-08-25T00:00:00Z","intvolume":"        21","month":"08","author":[{"last_name":"Bourgade","first_name":"Paul","full_name":"Bourgade, Paul"},{"orcid":"0000-0001-5366-9603","full_name":"Erdös, László","first_name":"László","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","last_name":"Erdös"},{"first_name":"Horng","full_name":"Yau, Horng","last_name":"Yau"},{"first_name":"Jun","full_name":"Yin, Jun","last_name":"Yin"}],"quality_controlled":"1","doi":"10.4310/ATMP.2017.v21.n3.a5","year":"2017","publication_status":"published","project":[{"call_identifier":"FP7","_id":"258DCDE6-B435-11E9-9278-68D0E5697425","name":"Random matrices, universality and disordered quantum systems","grant_number":"338804"}],"oa_version":"Submitted Version","language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"We prove the universality for the eigenvalue gap statistics in the bulk of the spectrum for band matrices, in the regime where the band width is comparable with the dimension of the matrix, W ~ N. All previous results concerning universality of non-Gaussian random matrices are for mean-field models. By relying on a new mean-field reduction technique, we deduce universality from quantum unique ergodicity for band matrices."}],"volume":21,"date_created":"2018-12-11T11:46:43Z","main_file_link":[{"url":"https://arxiv.org/abs/1602.02312","open_access":"1"}],"date_updated":"2021-01-12T08:00:57Z","oa":1,"citation":{"short":"P. Bourgade, L. Erdös, H. Yau, J. Yin, Advances in Theoretical and Mathematical Physics 21 (2017) 739–800.","ama":"Bourgade P, Erdös L, Yau H, Yin J. Universality for a class of random band matrices. <i>Advances in Theoretical and Mathematical Physics</i>. 2017;21(3):739-800. doi:<a href=\"https://doi.org/10.4310/ATMP.2017.v21.n3.a5\">10.4310/ATMP.2017.v21.n3.a5</a>","apa":"Bourgade, P., Erdös, L., Yau, H., &#38; Yin, J. (2017). Universality for a class of random band matrices. <i>Advances in Theoretical and Mathematical Physics</i>. International Press. <a href=\"https://doi.org/10.4310/ATMP.2017.v21.n3.a5\">https://doi.org/10.4310/ATMP.2017.v21.n3.a5</a>","ieee":"P. Bourgade, L. Erdös, H. Yau, and J. Yin, “Universality for a class of random band matrices,” <i>Advances in Theoretical and Mathematical Physics</i>, vol. 21, no. 3. International Press, pp. 739–800, 2017.","mla":"Bourgade, Paul, et al. “Universality for a Class of Random Band Matrices.” <i>Advances in Theoretical and Mathematical Physics</i>, vol. 21, no. 3, International Press, 2017, pp. 739–800, doi:<a href=\"https://doi.org/10.4310/ATMP.2017.v21.n3.a5\">10.4310/ATMP.2017.v21.n3.a5</a>.","ista":"Bourgade P, Erdös L, Yau H, Yin J. 2017. Universality for a class of random band matrices. Advances in Theoretical and Mathematical Physics. 21(3), 739–800.","chicago":"Bourgade, Paul, László Erdös, Horng Yau, and Jun Yin. “Universality for a Class of Random Band Matrices.” <i>Advances in Theoretical and Mathematical Physics</i>. International Press, 2017. <a href=\"https://doi.org/10.4310/ATMP.2017.v21.n3.a5\">https://doi.org/10.4310/ATMP.2017.v21.n3.a5</a>."},"publisher":"International Press","_id":"483","day":"25","department":[{"_id":"LaEr"}],"publist_id":"7337","type":"journal_article","page":"739 - 800","title":"Universality for a class of random band matrices","status":"public","scopus_import":1,"publication_identifier":{"issn":["10950761"]},"ec_funded":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","issue":"3"},{"year":"2017","doi":"10.4310/ATMP.2017.v21.n3.a4","publication_status":"published","project":[{"_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"291734","name":"International IST Postdoc Fellowship Programme"},{"call_identifier":"FWF","_id":"25C878CE-B435-11E9-9278-68D0E5697425","name":"Structure of the Excitation Spectrum for Many-Body Quantum Systems","grant_number":"P27533_N27"}],"oa_version":"Submitted Version","date_published":"2017-01-01T00:00:00Z","publication":"Advances in Theoretical and Mathematical Physics","author":[{"first_name":"Phan","full_name":"Nam, Phan","id":"404092F4-F248-11E8-B48F-1D18A9856A87","last_name":"Nam"},{"first_name":"Marcin M","full_name":"Napiórkowski, Marcin M","last_name":"Napiórkowski","id":"4197AD04-F248-11E8-B48F-1D18A9856A87"}],"intvolume":"        21","month":"01","quality_controlled":"1","scopus_import":1,"publication_identifier":{"issn":["10950761"]},"status":"public","title":"Bogoliubov correction to the mean-field dynamics of interacting bosons","page":"683 - 738","type":"journal_article","publist_id":"7336","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","ec_funded":1,"issue":"3","volume":21,"abstract":[{"lang":"eng","text":"We consider the dynamics of a large quantum system of N identical bosons in 3D interacting via a two-body potential of the form N3β-1w(Nβ(x - y)). For fixed 0 = β &lt; 1/3 and large N, we obtain a norm approximation to the many-body evolution in the Nparticle Hilbert space. The leading order behaviour of the dynamics is determined by Hartree theory while the second order is given by Bogoliubov theory."}],"date_created":"2018-12-11T11:46:43Z","language":[{"iso":"eng"}],"oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1509.04631"}],"date_updated":"2021-01-12T08:00:58Z","day":"01","_id":"484","publisher":"International Press","citation":{"ieee":"P. Nam and M. M. Napiórkowski, “Bogoliubov correction to the mean-field dynamics of interacting bosons,” <i>Advances in Theoretical and Mathematical Physics</i>, vol. 21, no. 3. International Press, pp. 683–738, 2017.","ista":"Nam P, Napiórkowski MM. 2017. Bogoliubov correction to the mean-field dynamics of interacting bosons. Advances in Theoretical and Mathematical Physics. 21(3), 683–738.","chicago":"Nam, Phan, and Marcin M Napiórkowski. “Bogoliubov Correction to the Mean-Field Dynamics of Interacting Bosons.” <i>Advances in Theoretical and Mathematical Physics</i>. International Press, 2017. <a href=\"https://doi.org/10.4310/ATMP.2017.v21.n3.a4\">https://doi.org/10.4310/ATMP.2017.v21.n3.a4</a>.","mla":"Nam, Phan, and Marcin M. Napiórkowski. “Bogoliubov Correction to the Mean-Field Dynamics of Interacting Bosons.” <i>Advances in Theoretical and Mathematical Physics</i>, vol. 21, no. 3, International Press, 2017, pp. 683–738, doi:<a href=\"https://doi.org/10.4310/ATMP.2017.v21.n3.a4\">10.4310/ATMP.2017.v21.n3.a4</a>.","short":"P. Nam, M.M. Napiórkowski, Advances in Theoretical and Mathematical Physics 21 (2017) 683–738.","ama":"Nam P, Napiórkowski MM. Bogoliubov correction to the mean-field dynamics of interacting bosons. <i>Advances in Theoretical and Mathematical Physics</i>. 2017;21(3):683-738. doi:<a href=\"https://doi.org/10.4310/ATMP.2017.v21.n3.a4\">10.4310/ATMP.2017.v21.n3.a4</a>","apa":"Nam, P., &#38; Napiórkowski, M. M. (2017). Bogoliubov correction to the mean-field dynamics of interacting bosons. <i>Advances in Theoretical and Mathematical Physics</i>. International Press. <a href=\"https://doi.org/10.4310/ATMP.2017.v21.n3.a4\">https://doi.org/10.4310/ATMP.2017.v21.n3.a4</a>"},"department":[{"_id":"RoSe"}]},{"date_created":"2018-12-11T11:46:44Z","volume":36,"abstract":[{"lang":"eng","text":"Color texture reproduction in 3D printing commonly ignores volumetric light transport (cross-talk) between surface points on a 3D print. Such light diffusion leads to significant blur of details and color bleeding, and is particularly severe for highly translucent resin-based print materials. Given their widely varying scattering properties, this cross-talk between surface points strongly depends on the internal structure of the volume surrounding each surface point. Existing scattering-aware methods use simplified models for light diffusion, and often accept the visual blur as an immutable property of the print medium. In contrast, our work counteracts heterogeneous scattering to obtain the impression of a crisp albedo texture on top of the 3D print, by optimizing for a fully volumetric material distribution that preserves the target appearance. Our method employs an efficient numerical optimizer on top of a general Monte-Carlo simulation of heterogeneous scattering, supported by a practical calibration procedure to obtain scattering parameters from a given set of printer materials. Despite the inherent translucency of the medium, we reproduce detailed surface textures on 3D prints. We evaluate our system using a commercial, five-tone 3D print process and compare against the printer’s native color texturing mode, demonstrating that our method preserves high-frequency features well without having to compromise on color gamut."}],"language":[{"iso":"eng"}],"oa":1,"date_updated":"2023-09-07T13:11:15Z","article_type":"original","day":"20","publisher":"ACM","_id":"486","pubrep_id":"1052","citation":{"ieee":"O. Elek <i>et al.</i>, “Scattering-aware texture reproduction for 3D printing,” <i>ACM Transactions on Graphics</i>, vol. 36, no. 6. ACM, 2017.","chicago":"Elek, Oskar, Denis Sumin, Ran Zhang, Tim Weyrich, Karol Myszkowski, Bernd Bickel, Alexander Wilkie, and Jaroslav Krivanek. “Scattering-Aware Texture Reproduction for 3D Printing.” <i>ACM Transactions on Graphics</i>. ACM, 2017. <a href=\"https://doi.org/10.1145/3130800.3130890\">https://doi.org/10.1145/3130800.3130890</a>.","ista":"Elek O, Sumin D, Zhang R, Weyrich T, Myszkowski K, Bickel B, Wilkie A, Krivanek J. 2017. Scattering-aware texture reproduction for 3D printing. ACM Transactions on Graphics. 36(6), 241.","mla":"Elek, Oskar, et al. “Scattering-Aware Texture Reproduction for 3D Printing.” <i>ACM Transactions on Graphics</i>, vol. 36, no. 6, 241, ACM, 2017, doi:<a href=\"https://doi.org/10.1145/3130800.3130890\">10.1145/3130800.3130890</a>.","short":"O. Elek, D. Sumin, R. Zhang, T. Weyrich, K. Myszkowski, B. Bickel, A. Wilkie, J. Krivanek, ACM Transactions on Graphics 36 (2017).","ama":"Elek O, Sumin D, Zhang R, et al. Scattering-aware texture reproduction for 3D printing. <i>ACM Transactions on Graphics</i>. 2017;36(6). doi:<a href=\"https://doi.org/10.1145/3130800.3130890\">10.1145/3130800.3130890</a>","apa":"Elek, O., Sumin, D., Zhang, R., Weyrich, T., Myszkowski, K., Bickel, B., … Krivanek, J. (2017). Scattering-aware texture reproduction for 3D printing. <i>ACM Transactions on Graphics</i>. ACM. <a href=\"https://doi.org/10.1145/3130800.3130890\">https://doi.org/10.1145/3130800.3130890</a>"},"department":[{"_id":"BeBi"}],"publication_identifier":{"issn":["07300301"]},"scopus_import":1,"title":"Scattering-aware texture reproduction for 3D printing","status":"public","type":"journal_article","publist_id":"7334","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ec_funded":1,"file_date_updated":"2020-07-14T12:46:35Z","issue":"6","date_published":"2017-11-20T00:00:00Z","publication":"ACM Transactions on Graphics","month":"11","author":[{"full_name":"Elek, Oskar","first_name":"Oskar","last_name":"Elek"},{"full_name":"Sumin, Denis","first_name":"Denis","last_name":"Sumin"},{"id":"4DDBCEB0-F248-11E8-B48F-1D18A9856A87","last_name":"Zhang","full_name":"Zhang, Ran","orcid":"0000-0002-3808-281X","first_name":"Ran"},{"first_name":"Tim","full_name":"Weyrich, Tim","last_name":"Weyrich"},{"full_name":"Myszkowski, Karol","first_name":"Karol","last_name":"Myszkowski"},{"full_name":"Bickel, Bernd","orcid":"0000-0001-6511-9385","first_name":"Bernd","id":"49876194-F248-11E8-B48F-1D18A9856A87","last_name":"Bickel"},{"full_name":"Wilkie, Alexander","first_name":"Alexander","last_name":"Wilkie"},{"first_name":"Jaroslav","full_name":"Krivanek, Jaroslav","last_name":"Krivanek"}],"intvolume":"        36","article_number":"241","quality_controlled":"1","ddc":["003","000","005"],"related_material":{"record":[{"id":"8386","status":"public","relation":"dissertation_contains"}]},"year":"2017","has_accepted_license":"1","file":[{"access_level":"open_access","creator":"system","file_name":"IST-2018-1052-v1+1_ElekSumin2017SGA.pdf","date_created":"2018-12-12T10:10:46Z","date_updated":"2020-07-14T12:46:35Z","file_id":"4836","content_type":"application/pdf","relation":"main_file","file_size":107349827,"checksum":"48386fa6956c3645fc89594dc898b147"},{"relation":"main_file","file_id":"7189","date_updated":"2020-07-14T12:46:35Z","content_type":"application/pdf","file_name":"ElekSumin2017SGA_reduced_file_size.pdf","date_created":"2019-12-16T14:48:57Z","creator":"bbickel","access_level":"open_access","file_size":4683145,"checksum":"21c89c28fb8d70f6602f752bf997aa0f"}],"doi":"10.1145/3130800.3130890","publication_status":"published","article_processing_charge":"No","project":[{"grant_number":"642841","name":"Distributed 3D Object Design","_id":"2508E324-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"},{"call_identifier":"H2020","_id":"24F9549A-B435-11E9-9278-68D0E5697425","name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling","grant_number":"715767"},{"name":"International IST Postdoc Fellowship Programme","grant_number":"291734","call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425"}],"oa_version":"Submitted Version"},{"department":[{"_id":"KrCh"}],"day":"06","_id":"512","pubrep_id":"938","publisher":"Nature Publishing Group","citation":{"mla":"Pavlogiannis, Andreas, et al. “Amplification on Undirected Population Structures: Comets Beat Stars.” <i>Scientific Reports</i>, vol. 7, no. 1, 82, Nature Publishing Group, 2017, doi:<a href=\"https://doi.org/10.1038/s41598-017-00107-w\">10.1038/s41598-017-00107-w</a>.","chicago":"Pavlogiannis, Andreas, Josef Tkadlec, Krishnendu Chatterjee, and Martin Nowak. “Amplification on Undirected Population Structures: Comets Beat Stars.” <i>Scientific Reports</i>. Nature Publishing Group, 2017. <a href=\"https://doi.org/10.1038/s41598-017-00107-w\">https://doi.org/10.1038/s41598-017-00107-w</a>.","ista":"Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. 2017. Amplification on undirected population structures: Comets beat stars. Scientific Reports. 7(1), 82.","ieee":"A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. Nowak, “Amplification on undirected population structures: Comets beat stars,” <i>Scientific Reports</i>, vol. 7, no. 1. Nature Publishing Group, 2017.","apa":"Pavlogiannis, A., Tkadlec, J., Chatterjee, K., &#38; Nowak, M. (2017). Amplification on undirected population structures: Comets beat stars. <i>Scientific Reports</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/s41598-017-00107-w\">https://doi.org/10.1038/s41598-017-00107-w</a>","ama":"Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. Amplification on undirected population structures: Comets beat stars. <i>Scientific Reports</i>. 2017;7(1). doi:<a href=\"https://doi.org/10.1038/s41598-017-00107-w\">10.1038/s41598-017-00107-w</a>","short":"A. Pavlogiannis, J. Tkadlec, K. Chatterjee, M. Nowak, Scientific Reports 7 (2017)."},"oa":1,"date_updated":"2023-02-23T12:26:57Z","volume":7,"date_created":"2018-12-11T11:46:53Z","abstract":[{"lang":"eng","text":"The fixation probability is the probability that a new mutant introduced in a homogeneous population eventually takes over the entire population. The fixation probability is a fundamental quantity of natural selection, and known to depend on the population structure. Amplifiers of natural selection are population structures which increase the fixation probability of advantageous mutants, as compared to the baseline case of well-mixed populations. In this work we focus on symmetric population structures represented as undirected graphs. In the regime of undirected graphs, the strongest amplifier known has been the Star graph, and the existence of undirected graphs with stronger amplification properties has remained open for over a decade. In this work we present the Comet and Comet-swarm families of undirected graphs. We show that for a range of fitness values of the mutants, the Comet and Cometswarm graphs have fixation probability strictly larger than the fixation probability of the Star graph, for fixed population size and at the limit of large populations, respectively. "}],"language":[{"iso":"eng"}],"issue":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ec_funded":1,"file_date_updated":"2020-07-14T12:46:36Z","scopus_import":1,"title":"Amplification on undirected population structures: Comets beat stars","status":"public","publication_identifier":{"issn":["20452322"]},"publist_id":"7307","type":"journal_article","article_number":"82","quality_controlled":"1","intvolume":"         7","author":[{"orcid":"0000-0002-8943-0722","full_name":"Pavlogiannis, Andreas","first_name":"Andreas","last_name":"Pavlogiannis","id":"49704004-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Josef","orcid":"0000-0002-1097-9684","full_name":"Tkadlec, Josef","last_name":"Tkadlec","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Martin","full_name":"Nowak, Martin","last_name":"Nowak"}],"month":"03","date_published":"2017-03-06T00:00:00Z","publication":"Scientific Reports","oa_version":"Published Version","project":[{"grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S11407","name":"Game Theory"},{"call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307"}],"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","short":"CC BY (4.0)","image":"/images/cc_by.png"},"publication_status":"published","article_processing_charge":"No","year":"2017","has_accepted_license":"1","file":[{"checksum":"7d05cbdd914e194a019c0f91fb64e9a8","file_size":1536783,"relation":"main_file","file_id":"5357","content_type":"application/pdf","date_updated":"2020-07-14T12:46:36Z","file_name":"IST-2018-938-v1+1_2017_Pavlogiannis_Amplification_on.pdf","date_created":"2018-12-12T10:18:35Z","creator":"system","access_level":"open_access"}],"doi":"10.1038/s41598-017-00107-w","ddc":["004"],"related_material":{"record":[{"id":"5449","status":"public","relation":"earlier_version"}]}},{"status":"public","year":"2017","scopus_import":1,"title":"Couette-Poiseuille flow experiment with zero mean advection velocity: Subcritical transition to turbulence","doi":"10.1103/PhysRevFluids.2.043904","publist_id":"7306","type":"journal_article","issue":"4","oa_version":"Preprint","publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"date_published":"2017-04-01T00:00:00Z","date_updated":"2021-01-12T08:01:16Z","main_file_link":[{"url":"https://arxiv.org/abs/1704.02619","open_access":"1"}],"publication":"Physical Review Fluids","volume":2,"abstract":[{"text":"We present an experimental setup that creates a shear flow with zero mean advection velocity achieved by counterbalancing the nonzero streamwise pressure gradient by moving boundaries, which generates plane Couette-Poiseuille flow. We obtain experimental results in the transitional regime for this flow. Using flow visualization, we characterize the subcritical transition to turbulence in Couette-Poiseuille flow and show the existence of turbulent spots generated by a permanent perturbation. Due to the zero mean advection velocity of the base profile, these turbulent structures are nearly stationary. We distinguish two regions of the turbulent spot: the active turbulent core, which is characterized by waviness of the streaks similar to traveling waves, and the surrounding region, which includes in addition the weak undisturbed streaks and oblique waves at the laminar-turbulent interface. We also study the dependence of the size of these two regions on Reynolds number. Finally, we show that the traveling waves move in the downstream (Poiseuille) direction.","lang":"eng"}],"date_created":"2018-12-11T11:46:54Z","language":[{"iso":"eng"}],"article_number":"043904","department":[{"_id":"BjHo"}],"quality_controlled":"1","publisher":"American Physical Society","_id":"513","day":"01","citation":{"apa":"Klotz, L., Lemoult, G. M., Frontczak, I., Tuckerman, L., &#38; Wesfreid, J. (2017). Couette-Poiseuille flow experiment with zero mean advection velocity: Subcritical transition to turbulence. <i>Physical Review Fluids</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevFluids.2.043904\">https://doi.org/10.1103/PhysRevFluids.2.043904</a>","ama":"Klotz L, Lemoult GM, Frontczak I, Tuckerman L, Wesfreid J. Couette-Poiseuille flow experiment with zero mean advection velocity: Subcritical transition to turbulence. <i>Physical Review Fluids</i>. 2017;2(4). doi:<a href=\"https://doi.org/10.1103/PhysRevFluids.2.043904\">10.1103/PhysRevFluids.2.043904</a>","short":"L. Klotz, G.M. Lemoult, I. Frontczak, L. Tuckerman, J. Wesfreid, Physical Review Fluids 2 (2017).","chicago":"Klotz, Lukasz, Grégoire M Lemoult, Idalia Frontczak, Laurette Tuckerman, and José Wesfreid. “Couette-Poiseuille Flow Experiment with Zero Mean Advection Velocity: Subcritical Transition to Turbulence.” <i>Physical Review Fluids</i>. American Physical Society, 2017. <a href=\"https://doi.org/10.1103/PhysRevFluids.2.043904\">https://doi.org/10.1103/PhysRevFluids.2.043904</a>.","mla":"Klotz, Lukasz, et al. “Couette-Poiseuille Flow Experiment with Zero Mean Advection Velocity: Subcritical Transition to Turbulence.” <i>Physical Review Fluids</i>, vol. 2, no. 4, 043904, American Physical Society, 2017, doi:<a href=\"https://doi.org/10.1103/PhysRevFluids.2.043904\">10.1103/PhysRevFluids.2.043904</a>.","ista":"Klotz L, Lemoult GM, Frontczak I, Tuckerman L, Wesfreid J. 2017. Couette-Poiseuille flow experiment with zero mean advection velocity: Subcritical transition to turbulence. Physical Review Fluids. 2(4), 043904.","ieee":"L. Klotz, G. M. Lemoult, I. Frontczak, L. Tuckerman, and J. Wesfreid, “Couette-Poiseuille flow experiment with zero mean advection velocity: Subcritical transition to turbulence,” <i>Physical Review Fluids</i>, vol. 2, no. 4. American Physical Society, 2017."},"author":[{"orcid":"0000-0003-1740-7635","full_name":"Klotz, Lukasz","first_name":"Lukasz","last_name":"Klotz","id":"2C9AF1C2-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Grégoire M","full_name":"Lemoult, Grégoire M","last_name":"Lemoult","id":"4787FE80-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Idalia","full_name":"Frontczak, Idalia","last_name":"Frontczak"},{"last_name":"Tuckerman","first_name":"Laurette","full_name":"Tuckerman, Laurette"},{"last_name":"Wesfreid","full_name":"Wesfreid, José","first_name":"José"}],"month":"04","intvolume":"         2"},{"file_date_updated":"2020-07-14T12:46:36Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"7305","type":"journal_article","title":"Activity dependent feedback inhibition may maintain head direction signals in mouse presubiculum","scopus_import":1,"publication_identifier":{"issn":["20411723"]},"status":"public","citation":{"short":"J. Simonnet, M. Nassar, F. Stella, I. Cohen, B. Mathon, C.N. Boccara, R. Miles, D. Fricker, Nature Communications 8 (2017).","ama":"Simonnet J, Nassar M, Stella F, et al. Activity dependent feedback inhibition may maintain head direction signals in mouse presubiculum. <i>Nature Communications</i>. 2017;8. doi:<a href=\"https://doi.org/10.1038/ncomms16032\">10.1038/ncomms16032</a>","apa":"Simonnet, J., Nassar, M., Stella, F., Cohen, I., Mathon, B., Boccara, C. N., … Fricker, D. (2017). Activity dependent feedback inhibition may maintain head direction signals in mouse presubiculum. <i>Nature Communications</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/ncomms16032\">https://doi.org/10.1038/ncomms16032</a>","ieee":"J. Simonnet <i>et al.</i>, “Activity dependent feedback inhibition may maintain head direction signals in mouse presubiculum,” <i>Nature Communications</i>, vol. 8. Nature Publishing Group, 2017.","ista":"Simonnet J, Nassar M, Stella F, Cohen I, Mathon B, Boccara CN, Miles R, Fricker D. 2017. Activity dependent feedback inhibition may maintain head direction signals in mouse presubiculum. Nature Communications. 8, 16032.","mla":"Simonnet, Jean, et al. “Activity Dependent Feedback Inhibition May Maintain Head Direction Signals in Mouse Presubiculum.” <i>Nature Communications</i>, vol. 8, 16032, Nature Publishing Group, 2017, doi:<a href=\"https://doi.org/10.1038/ncomms16032\">10.1038/ncomms16032</a>.","chicago":"Simonnet, Jean, Mérie Nassar, Federico Stella, Ivan Cohen, Bertrand Mathon, Charlotte N. Boccara, Richard Miles, and Desdemona Fricker. “Activity Dependent Feedback Inhibition May Maintain Head Direction Signals in Mouse Presubiculum.” <i>Nature Communications</i>. Nature Publishing Group, 2017. <a href=\"https://doi.org/10.1038/ncomms16032\">https://doi.org/10.1038/ncomms16032</a>."},"_id":"514","pubrep_id":"937","publisher":"Nature Publishing Group","day":"01","department":[{"_id":"JoCs"}],"language":[{"iso":"eng"}],"volume":8,"abstract":[{"lang":"eng","text":"Orientation in space is represented in specialized brain circuits. Persistent head direction signals are transmitted from anterior thalamus to the presubiculum, but the identity of the presubicular target neurons, their connectivity and function in local microcircuits are unknown. Here, we examine how thalamic afferents recruit presubicular principal neurons and Martinotti interneurons, and the ensuing synaptic interactions between these cells. Pyramidal neuron activation of Martinotti cells in superficial layers is strongly facilitating such that high-frequency head directional stimulation efficiently unmutes synaptic excitation. Martinotti-cell feedback plays a dual role: precisely timed spikes may not inhibit the firing of in-tune head direction cells, while exerting lateral inhibition. Autonomous attractor dynamics emerge from a modelled network implementing wiring motifs and timing sensitive synaptic interactions in the pyramidal - Martinotti-cell feedback loop. This inhibitory microcircuit is therefore tuned to refine and maintain head direction information in the presubiculum."}],"date_created":"2018-12-11T11:46:54Z","date_updated":"2021-01-12T08:01:16Z","oa":1,"publication_status":"published","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","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa_version":"Published Version","ddc":["571"],"doi":"10.1038/ncomms16032","file":[{"access_level":"open_access","date_created":"2018-12-12T10:14:31Z","file_name":"IST-2018-937-v1+1_2017_Stella_Activity_dependent.pdf","creator":"system","content_type":"application/pdf","file_id":"5083","date_updated":"2020-07-14T12:46:36Z","relation":"main_file","file_size":2948357,"checksum":"76d8a2b72a58e56adb410ec37dfa7eee"}],"has_accepted_license":"1","year":"2017","author":[{"full_name":"Simonnet, Jean","first_name":"Jean","last_name":"Simonnet"},{"last_name":"Nassar","first_name":"Mérie","full_name":"Nassar, Mérie"},{"id":"39AF1E74-F248-11E8-B48F-1D18A9856A87","last_name":"Stella","orcid":"0000-0001-9439-3148","first_name":"Federico","full_name":"Stella, Federico"},{"first_name":"Ivan","full_name":"Cohen, Ivan","last_name":"Cohen"},{"last_name":"Mathon","first_name":"Bertrand","full_name":"Mathon, Bertrand"},{"last_name":"Boccara","id":"3FC06552-F248-11E8-B48F-1D18A9856A87","full_name":"Boccara, Charlotte","orcid":"0000-0001-7237-5109","first_name":"Charlotte"},{"first_name":"Richard","full_name":"Miles, Richard","last_name":"Miles"},{"last_name":"Fricker","first_name":"Desdemona","full_name":"Fricker, Desdemona"}],"month":"07","intvolume":"         8","quality_controlled":"1","article_number":"16032","publication":"Nature Communications","date_published":"2017-07-01T00:00:00Z"},{"publisher":"Nature Publishing Group","_id":"515","day":"05","citation":{"chicago":"Letts, James A, and Leonid A Sazanov. “Clarifying the Supercomplex: The Higher-Order Organization of the Mitochondrial Electron Transport Chain.” <i>Nature Structural and Molecular Biology</i>. Nature Publishing Group, 2017. <a href=\"https://doi.org/10.1038/nsmb.3460\">https://doi.org/10.1038/nsmb.3460</a>.","mla":"Letts, James A., and Leonid A. Sazanov. “Clarifying the Supercomplex: The Higher-Order Organization of the Mitochondrial Electron Transport Chain.” <i>Nature Structural and Molecular Biology</i>, vol. 24, no. 10, Nature Publishing Group, 2017, pp. 800–08, doi:<a href=\"https://doi.org/10.1038/nsmb.3460\">10.1038/nsmb.3460</a>.","ista":"Letts JA, Sazanov LA. 2017. Clarifying the supercomplex: The higher-order organization of the mitochondrial electron transport chain. Nature Structural and Molecular Biology. 24(10), 800–808.","ieee":"J. A. Letts and L. A. Sazanov, “Clarifying the supercomplex: The higher-order organization of the mitochondrial electron transport chain,” <i>Nature Structural and Molecular Biology</i>, vol. 24, no. 10. Nature Publishing Group, pp. 800–808, 2017.","apa":"Letts, J. A., &#38; Sazanov, L. A. (2017). Clarifying the supercomplex: The higher-order organization of the mitochondrial electron transport chain. <i>Nature Structural and Molecular Biology</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/nsmb.3460\">https://doi.org/10.1038/nsmb.3460</a>","ama":"Letts JA, Sazanov LA. Clarifying the supercomplex: The higher-order organization of the mitochondrial electron transport chain. <i>Nature Structural and Molecular Biology</i>. 2017;24(10):800-808. doi:<a href=\"https://doi.org/10.1038/nsmb.3460\">10.1038/nsmb.3460</a>","short":"J.A. Letts, L.A. Sazanov, Nature Structural and Molecular Biology 24 (2017) 800–808."},"department":[{"_id":"LeSa"}],"abstract":[{"text":"The oxidative phosphorylation electron transport chain (OXPHOS-ETC) of the inner mitochondrial membrane is composed of five large protein complexes, named CI-CV. These complexes convert energy from the food we eat into ATP, a small molecule used to power a multitude of essential reactions throughout the cell. OXPHOS-ETC complexes are organized into supercomplexes (SCs) of defined stoichiometry: CI forms a supercomplex with CIII2 and CIV (SC I+III2+IV, known as the respirasome), as well as with CIII2 alone (SC I+III2). CIII2 forms a supercomplex with CIV (SC III2+IV) and CV forms dimers (CV2). Recent cryo-EM studies have revealed the structures of SC I+III2+IV and SC I+III2. Furthermore, recent work has shed light on the assembly and function of the SCs. Here we review and compare these recent studies and discuss how they have advanced our understanding of mitochondrial electron transport.","lang":"eng"}],"date_created":"2018-12-11T11:46:54Z","volume":24,"language":[{"iso":"eng"}],"oa":1,"date_updated":"2021-01-12T08:01:17Z","article_type":"original","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file_date_updated":"2020-07-14T12:46:36Z","ec_funded":1,"issue":"10","page":"800 - 808","status":"public","title":"Clarifying the supercomplex: The higher-order organization of the mitochondrial electron transport chain","scopus_import":1,"publication_identifier":{"issn":["15459993"]},"publist_id":"7304","type":"journal_article","month":"10","author":[{"last_name":"Letts","id":"322DA418-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9864-3586","full_name":"Letts, James A","first_name":"James A"},{"last_name":"Sazanov","id":"338D39FE-F248-11E8-B48F-1D18A9856A87","first_name":"Leonid A","full_name":"Sazanov, Leonid A","orcid":"0000-0002-0977-7989"}],"intvolume":"        24","quality_controlled":"1","date_published":"2017-10-05T00:00:00Z","publication":"Nature Structural and Molecular Biology","publication_status":"published","oa_version":"Submitted Version","project":[{"grant_number":"701309","name":"Atomic-Resolution Structures of Mitochondrial Respiratory Chain Supercomplexes (H2020)","_id":"2590DB08-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"ddc":["572"],"year":"2017","doi":"10.1038/nsmb.3460","file":[{"file_size":4118385,"checksum":"9bc7e8c41b43636dd7566289e511f096","file_name":"29893_2_merged_1501257589_red.pdf","date_created":"2019-11-07T12:51:07Z","creator":"lsazanov","access_level":"open_access","relation":"main_file","file_id":"6993","date_updated":"2020-07-14T12:46:36Z","content_type":"application/pdf"}],"has_accepted_license":"1"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","oa_version":"Submitted Version","type":"journal_article","publist_id":"7299","doi":"10.1016/j.topol.2016.10.005","year":"2017","publication_identifier":{"issn":["01668641"]},"status":"public","title":"Higson compactification and dimension raising","page":"45 - 57","month":"01","author":[{"last_name":"Austin","first_name":"Kyle","full_name":"Austin, Kyle"},{"last_name":"Virk","id":"2E36B656-F248-11E8-B48F-1D18A9856A87","first_name":"Ziga","full_name":"Virk, Ziga"}],"intvolume":"       215","citation":{"ieee":"K. Austin and Z. Virk, “Higson compactification and dimension raising,” <i>Topology and its Applications</i>, vol. 215. Elsevier, pp. 45–57, 2017.","ista":"Austin K, Virk Z. 2017. Higson compactification and dimension raising. Topology and its Applications. 215, 45–57.","mla":"Austin, Kyle, and Ziga Virk. “Higson Compactification and Dimension Raising.” <i>Topology and Its Applications</i>, vol. 215, Elsevier, 2017, pp. 45–57, doi:<a href=\"https://doi.org/10.1016/j.topol.2016.10.005\">10.1016/j.topol.2016.10.005</a>.","chicago":"Austin, Kyle, and Ziga Virk. “Higson Compactification and Dimension Raising.” <i>Topology and Its Applications</i>. Elsevier, 2017. <a href=\"https://doi.org/10.1016/j.topol.2016.10.005\">https://doi.org/10.1016/j.topol.2016.10.005</a>.","ama":"Austin K, Virk Z. Higson compactification and dimension raising. <i>Topology and its Applications</i>. 2017;215:45-57. doi:<a href=\"https://doi.org/10.1016/j.topol.2016.10.005\">10.1016/j.topol.2016.10.005</a>","apa":"Austin, K., &#38; Virk, Z. (2017). Higson compactification and dimension raising. <i>Topology and Its Applications</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.topol.2016.10.005\">https://doi.org/10.1016/j.topol.2016.10.005</a>","short":"K. Austin, Z. Virk, Topology and Its Applications 215 (2017) 45–57."},"day":"01","publisher":"Elsevier","_id":"521","quality_controlled":"1","department":[{"_id":"HeEd"}],"language":[{"iso":"eng"}],"abstract":[{"text":"Let X and Y be proper metric spaces. We show that a coarsely n-to-1 map f:X→Y induces an n-to-1 map of Higson coronas. This viewpoint turns out to be successful in showing that the classical dimension raising theorems hold in large scale; that is, if f:X→Y is a coarsely n-to-1 map between proper metric spaces X and Y then asdim(Y)≤asdim(X)+n−1. Furthermore we introduce coarsely open coarsely n-to-1 maps, which include the natural quotient maps via a finite group action, and prove that they preserve the asymptotic dimension.","lang":"eng"}],"volume":215,"date_created":"2018-12-11T11:46:56Z","publication":"Topology and its Applications","date_updated":"2021-01-12T08:01:21Z","main_file_link":[{"url":"https://arxiv.org/abs/1608.03954v1","open_access":"1"}],"date_published":"2017-01-01T00:00:00Z","oa":1},{"issue":"5","publication_status":"published","file_date_updated":"2020-07-14T12:46:38Z","page":"R172 - R174","title":"Plant biology: Building barriers… in roots","status":"public","year":"2017","doi":"10.1016/j.cub.2017.01.060","publist_id":"7294","type":"journal_article","file":[{"checksum":"81fd4475c5a2a2c6f4313beeab215ed9","file_size":2840413,"file_name":"IST-2018-983-v1+1_Plant_biology_Building_barriers__in_roots.pdf","date_created":"2018-12-12T10:18:11Z","creator":"system","access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_id":"5330","date_updated":"2020-07-14T12:46:38Z"}],"quality_controlled":0,"pubrep_id":"983","_id":"525","publisher":"Cell Press","extern":1,"day":"06","citation":{"ama":"von Wangenheim D, Goh T, Dietrich D, Bennett M. Plant biology: Building barriers… in roots. <i>Current Biology</i>. 2017;27(5):R172-R174. doi:<a href=\"https://doi.org/10.1016/j.cub.2017.01.060\">10.1016/j.cub.2017.01.060</a>","apa":"von Wangenheim, D., Goh, T., Dietrich, D., &#38; Bennett, M. (2017). Plant biology: Building barriers… in roots. <i>Current Biology</i>. Cell Press. <a href=\"https://doi.org/10.1016/j.cub.2017.01.060\">https://doi.org/10.1016/j.cub.2017.01.060</a>","short":"D. von Wangenheim, T. Goh, D. Dietrich, M. Bennett, Current Biology 27 (2017) R172–R174.","ieee":"D. von Wangenheim, T. Goh, D. Dietrich, and M. Bennett, “Plant biology: Building barriers… in roots,” <i>Current Biology</i>, vol. 27, no. 5. Cell Press, pp. R172–R174, 2017.","ista":"von Wangenheim D, Goh T, Dietrich D, Bennett M. 2017. Plant biology: Building barriers… in roots. Current Biology. 27(5), R172–R174.","mla":"von Wangenheim, Daniel, et al. “Plant Biology: Building Barriers… in Roots.” <i>Current Biology</i>, vol. 27, no. 5, Cell Press, 2017, pp. R172–74, doi:<a href=\"https://doi.org/10.1016/j.cub.2017.01.060\">10.1016/j.cub.2017.01.060</a>.","chicago":"Wangenheim, Daniel von, Tatsuaki Goh, Daniela Dietrich, and Malcolm Bennett. “Plant Biology: Building Barriers… in Roots.” <i>Current Biology</i>. Cell Press, 2017. <a href=\"https://doi.org/10.1016/j.cub.2017.01.060\">https://doi.org/10.1016/j.cub.2017.01.060</a>."},"intvolume":"        27","month":"03","author":[{"id":"49E91952-F248-11E8-B48F-1D18A9856A87","last_name":"Von Wangenheim","full_name":"Daniel von Wangenheim","first_name":"Daniel","orcid":"0000-0002-6862-1247"},{"last_name":"Goh","first_name":"Tatsuaki","full_name":"Goh, Tatsuaki"},{"last_name":"Dietrich","first_name":"Daniela","full_name":"Dietrich, Daniela"},{"last_name":"Bennett","full_name":"Bennett, Malcolm J","first_name":"Malcolm"}],"oa":1,"date_published":"2017-03-06T00:00:00Z","main_file_link":[{"open_access":"1","url":"https://repository.ist.ac.at/id/eprint/983"}],"date_updated":"2021-01-12T08:01:23Z","publication":"Current Biology","acknowledgement":"Biotechnology and Biological Sciences Research Council:\tBBSRC BB/M001806/1 and BB/H020314/1\t","volume":27,"abstract":[{"text":"The Casparian strip is an important barrier regulating water and nutrient uptake into root tissues. New research reveals two peptide signals and their co-receptors play critical roles patterning and maintaining barrier integrity. ","lang":"eng"}],"date_created":"2018-12-11T11:46:58Z"},{"oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/1602.07907","open_access":"1"}],"date_updated":"2023-02-21T17:01:34Z","article_type":"original","date_created":"2018-12-11T11:47:01Z","volume":58,"abstract":[{"text":"We investigate the complexity of finding an embedded non-orientable surface of Euler genus g in a triangulated 3-manifold. This problem occurs both as a natural question in low-dimensional topology, and as a first non-trivial instance of embeddability of complexes into 3-manifolds. We prove that the problem is NP-hard, thus adding to the relatively few hardness results that are currently known in 3-manifold topology. In addition, we show that the problem lies in NP when the Euler genus g is odd, and we give an explicit algorithm in this case.","lang":"eng"}],"language":[{"iso":"eng"}],"department":[{"_id":"UlWa"}],"day":"09","publisher":"Springer","_id":"534","citation":{"chicago":"Burton, Benjamin, Arnaud N de Mesmay, and Uli Wagner. “Finding Non-Orientable Surfaces in 3-Manifolds.” <i>Discrete &#38; Computational Geometry</i>. Springer, 2017. <a href=\"https://doi.org/10.1007/s00454-017-9900-0\">https://doi.org/10.1007/s00454-017-9900-0</a>.","ista":"Burton B, de Mesmay AN, Wagner U. 2017. Finding non-orientable surfaces in 3-Manifolds. Discrete &#38; Computational Geometry. 58(4), 871–888.","mla":"Burton, Benjamin, et al. “Finding Non-Orientable Surfaces in 3-Manifolds.” <i>Discrete &#38; Computational Geometry</i>, vol. 58, no. 4, Springer, 2017, pp. 871–88, doi:<a href=\"https://doi.org/10.1007/s00454-017-9900-0\">10.1007/s00454-017-9900-0</a>.","ieee":"B. Burton, A. N. de Mesmay, and U. Wagner, “Finding non-orientable surfaces in 3-Manifolds,” <i>Discrete &#38; Computational Geometry</i>, vol. 58, no. 4. Springer, pp. 871–888, 2017.","short":"B. Burton, A.N. de Mesmay, U. Wagner, Discrete &#38; Computational Geometry 58 (2017) 871–888.","apa":"Burton, B., de Mesmay, A. N., &#38; Wagner, U. (2017). Finding non-orientable surfaces in 3-Manifolds. <i>Discrete &#38; Computational Geometry</i>. Springer. <a href=\"https://doi.org/10.1007/s00454-017-9900-0\">https://doi.org/10.1007/s00454-017-9900-0</a>","ama":"Burton B, de Mesmay AN, Wagner U. Finding non-orientable surfaces in 3-Manifolds. <i>Discrete &#38; Computational Geometry</i>. 2017;58(4):871-888. doi:<a href=\"https://doi.org/10.1007/s00454-017-9900-0\">10.1007/s00454-017-9900-0</a>"},"title":"Finding non-orientable surfaces in 3-Manifolds","scopus_import":1,"status":"public","publication_identifier":{"issn":["01795376"]},"page":"871 - 888","type":"journal_article","publist_id":"7283","issue":"4","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2017-06-09T00:00:00Z","external_id":{"arxiv":["1602.07907"]},"publication":"Discrete & Computational Geometry","arxiv":1,"quality_controlled":"1","intvolume":"        58","author":[{"first_name":"Benjamin","full_name":"Burton, Benjamin","last_name":"Burton"},{"last_name":"De Mesmay","id":"3DB2F25C-F248-11E8-B48F-1D18A9856A87","first_name":"Arnaud N","full_name":"De Mesmay, Arnaud N"},{"orcid":"0000-0002-1494-0568","first_name":"Uli","full_name":"Wagner, Uli","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","last_name":"Wagner"}],"month":"06","year":"2017","doi":"10.1007/s00454-017-9900-0","related_material":{"record":[{"id":"1379","status":"public","relation":"earlier_version"}]},"oa_version":"Preprint","publication_status":"published","article_processing_charge":"No"}]