[{"publication":"Scientific Reports","publist_id":"6380","article_number":"45702","citation":{"ieee":"G. Bighin and L. Salasnich, “Vortices and antivortices in two-dimensional ultracold Fermi gases,” <i>Scientific Reports</i>, vol. 7. Nature Publishing Group, 2017.","ista":"Bighin G, Salasnich L. 2017. Vortices and antivortices in two-dimensional ultracold Fermi gases. Scientific Reports. 7, 45702.","apa":"Bighin, G., &#38; Salasnich, L. (2017). Vortices and antivortices in two-dimensional ultracold Fermi gases. <i>Scientific Reports</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/srep45702\">https://doi.org/10.1038/srep45702</a>","short":"G. Bighin, L. Salasnich, Scientific Reports 7 (2017).","chicago":"Bighin, Giacomo, and Luca Salasnich. “Vortices and Antivortices in Two-Dimensional Ultracold Fermi Gases.” <i>Scientific Reports</i>. Nature Publishing Group, 2017. <a href=\"https://doi.org/10.1038/srep45702\">https://doi.org/10.1038/srep45702</a>.","mla":"Bighin, Giacomo, and Luca Salasnich. “Vortices and Antivortices in Two-Dimensional Ultracold Fermi Gases.” <i>Scientific Reports</i>, vol. 7, 45702, Nature Publishing Group, 2017, doi:<a href=\"https://doi.org/10.1038/srep45702\">10.1038/srep45702</a>.","ama":"Bighin G, Salasnich L. Vortices and antivortices in two-dimensional ultracold Fermi gases. <i>Scientific Reports</i>. 2017;7. doi:<a href=\"https://doi.org/10.1038/srep45702\">10.1038/srep45702</a>"},"article_processing_charge":"No","external_id":{"isi":["000398148100001"]},"_id":"1015","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","year":"2017","quality_controlled":"1","doi":"10.1038/srep45702","publication_status":"published","author":[{"orcid":"0000-0001-8823-9777","first_name":"Giacomo","id":"4CA96FD4-F248-11E8-B48F-1D18A9856A87","full_name":"Bighin, Giacomo","last_name":"Bighin"},{"full_name":"Salasnich, Luca","last_name":"Salasnich","first_name":"Luca"}],"abstract":[{"lang":"eng","text":"Vortices are commonly observed in the context of classical hydrodynamics: from whirlpools after stirring the coffee in a cup to a violent atmospheric phenomenon such as a tornado, all classical vortices are characterized by an arbitrary circulation value of the local velocity field. On the other hand the appearance of vortices with quantized circulation represents one of the fundamental signatures of macroscopic quantum phenomena. In two-dimensional superfluids quantized vortices play a key role in determining finite-temperature properties, as the superfluid phase and the normal state are separated by a vortex unbinding transition, the Berezinskii-Kosterlitz-Thouless transition. Very recent experiments with two-dimensional superfluid fermions motivate the present work: we present theoretical results based on the renormalization group showing that the universal jump of the superfluid density and the critical temperature crucially depend on the interaction strength, providing a strong benchmark for forthcoming investigations."}],"intvolume":"         7","fulldoi":"https://doi.org/10.1038/srep45702","oa_version":"Published Version","date_published":"2017-04-04T00:00:00Z","isi":1,"day":"04","oa":1,"title":"Vortices and antivortices in two-dimensional ultracold Fermi gases","date_updated":"2025-07-10T11:49:43Z","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"publisher":"Nature Publishing Group","publication_identifier":{"issn":["2045-2322"]},"scopus_import":"1","file_date_updated":"2018-12-12T10:12:32Z","has_accepted_license":"1","department":[{"_id":"MiLe"}],"language":[{"iso":"eng"}],"file":[{"access_level":"open_access","date_created":"2018-12-12T10:12:32Z","date_updated":"2018-12-12T10:12:32Z","creator":"system","file_name":"IST-2017-809-v1+1_srep45702.pdf","relation":"main_file","content_type":"application/pdf","file_id":"4950","file_size":478289}],"ddc":["539"],"month":"04","type":"journal_article","date_created":"2018-12-11T11:49:42Z","pubrep_id":"809","volume":7},{"year":"2017","_id":"1016","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","status":"public","citation":{"short":"M. Breuss, T. Nguyen, A. Srivatsan, I. Leca, G. Tian, T. Fritz, A.H. Hansen, D. Musaev, J. Mcevoy Venneri, J. Kiely, R. Rosti, E. Scott, U. Tan, R. Kolodner, N. Cowan, D. Keays, J. Gleeson, Human Molecular Genetics 26 (2017) 258–269.","mla":"Breuss, Martin, et al. “Uner Tan Syndrome Caused by a Homozygous TUBB2B Mutation Affecting Microtubule Stability.” <i>Human Molecular Genetics</i>, vol. 26, no. 2, Oxford University Press, 2017, pp. 258–69, doi:<a href=\"https://doi.org/10.1093/hmg/ddw383\">10.1093/hmg/ddw383</a>.","chicago":"Breuss, Martin, Thai Nguyen, Anjana Srivatsan, Ines Leca, Guoling Tian, Tanja Fritz, Andi H Hansen, et al. “Uner Tan Syndrome Caused by a Homozygous TUBB2B Mutation Affecting Microtubule Stability.” <i>Human Molecular Genetics</i>. Oxford University Press, 2017. <a href=\"https://doi.org/10.1093/hmg/ddw383\">https://doi.org/10.1093/hmg/ddw383</a>.","ista":"Breuss M, Nguyen T, Srivatsan A, Leca I, Tian G, Fritz T, Hansen AH, Musaev D, Mcevoy Venneri J, Kiely J, Rosti R, Scott E, Tan U, Kolodner R, Cowan N, Keays D, Gleeson J. 2017. Uner Tan syndrome caused by a homozygous TUBB2B mutation affecting microtubule stability. Human Molecular Genetics. 26(2), 258–269.","ieee":"M. Breuss <i>et al.</i>, “Uner Tan syndrome caused by a homozygous TUBB2B mutation affecting microtubule stability,” <i>Human Molecular Genetics</i>, vol. 26, no. 2. Oxford University Press, pp. 258–269, 2017.","apa":"Breuss, M., Nguyen, T., Srivatsan, A., Leca, I., Tian, G., Fritz, T., … Gleeson, J. (2017). Uner Tan syndrome caused by a homozygous TUBB2B mutation affecting microtubule stability. <i>Human Molecular Genetics</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/hmg/ddw383\">https://doi.org/10.1093/hmg/ddw383</a>","ama":"Breuss M, Nguyen T, Srivatsan A, et al. Uner Tan syndrome caused by a homozygous TUBB2B mutation affecting microtubule stability. <i>Human Molecular Genetics</i>. 2017;26(2):258-269. doi:<a href=\"https://doi.org/10.1093/hmg/ddw383\">10.1093/hmg/ddw383</a>"},"article_processing_charge":"No","external_id":{"isi":["000397066400002"]},"publication":"Human Molecular Genetics","publist_id":"6379","isi":1,"fulldoi":"https://doi.org/10.1093/hmg/ddw383","oa_version":"None","date_published":"2017-01-01T00:00:00Z","issue":"2","author":[{"last_name":"Breuss","full_name":"Breuss, Martin","first_name":"Martin"},{"first_name":"Thai","last_name":"Nguyen","full_name":"Nguyen, Thai"},{"first_name":"Anjana","full_name":"Srivatsan, Anjana","last_name":"Srivatsan"},{"full_name":"Leca, Ines","last_name":"Leca","first_name":"Ines"},{"full_name":"Tian, Guoling","last_name":"Tian","first_name":"Guoling"},{"full_name":"Fritz, Tanja","last_name":"Fritz","first_name":"Tanja"},{"first_name":"Andi H","last_name":"Hansen","id":"38853E16-F248-11E8-B48F-1D18A9856A87","full_name":"Hansen, Andi H"},{"last_name":"Musaev","full_name":"Musaev, Damir","first_name":"Damir"},{"full_name":"Mcevoy Venneri, Jennifer","last_name":"Mcevoy Venneri","first_name":"Jennifer"},{"first_name":"James","full_name":"Kiely, James","last_name":"Kiely"},{"first_name":"Rasim","full_name":"Rosti, Rasim","last_name":"Rosti"},{"first_name":"Eric","full_name":"Scott, Eric","last_name":"Scott"},{"full_name":"Tan, Uner","last_name":"Tan","first_name":"Uner"},{"first_name":"Richard","full_name":"Kolodner, Richard","last_name":"Kolodner"},{"full_name":"Cowan, Nicholas","last_name":"Cowan","first_name":"Nicholas"},{"first_name":"David","full_name":"Keays, David","last_name":"Keays"},{"first_name":"Joseph","last_name":"Gleeson","full_name":"Gleeson, Joseph"}],"publication_status":"published","abstract":[{"text":"The integrity and dynamic properties of the microtubule cytoskeleton are indispensable for the development of the mammalian brain. Consequently, mutations in the genes that encode the structural component (the α/β-tubulin heterodimer) can give rise to severe, sporadic neurodevelopmental disorders. These are commonly referred to as the tubulinopathies. Here we report the addition of recessive quadrupedalism, also known as Uner Tan syndrome (UTS), to the growing list of diseases caused by tubulin variants. Analysis of a consanguineous UTS family identified a biallelic TUBB2B mutation, resulting in a p.R390Q amino acid substitution. In addition to the identifying quadrupedal locomotion, all three patients showed severe cerebellar hypoplasia. None, however, displayed the basal ganglia malformations typically associated with TUBB2B mutations. Functional analysis of the R390Q substitution revealed that it did not affect the ability of β-tubulin to fold or become assembled into the α/β-heterodimer, nor did it influence the incorporation of mutant-containing heterodimers into microtubule polymers. The 390Q mutation in S. cerevisiae TUB2 did not affect growth under basal conditions, but did result in increased sensitivity to microtubule-depolymerizing drugs, indicative of a mild impact of this mutation on microtubule function. The TUBB2B mutation described here represents an unusual recessive mode of inheritance for missense-mediated tubulinopathies and reinforces the sensitivity of the developing cerebellum to microtubule defects.","lang":"eng"}],"intvolume":"        26","quality_controlled":"1","doi":"10.1093/hmg/ddw383","date_updated":"2026-04-16T09:56:51Z","title":"Uner Tan syndrome caused by a homozygous TUBB2B mutation affecting microtubule stability","day":"01","type":"journal_article","month":"01","date_created":"2018-12-11T11:49:42Z","page":"258 - 269","volume":26,"department":[{"_id":"SiHi"}],"language":[{"iso":"eng"}],"scopus_import":"1","publisher":"Oxford University Press","publication_identifier":{"issn":["0964-6906"]}},{"quality_controlled":"1","doi":"10.1016/j.mcn.2017.03.002","author":[{"last_name":"Breuss","full_name":"Breuss, Martin","first_name":"Martin"},{"first_name":"Ines","full_name":"Leca, Ines","last_name":"Leca"},{"full_name":"Gstrein, Thomas","last_name":"Gstrein","first_name":"Thomas"},{"first_name":"Andi H","last_name":"Hansen","id":"38853E16-F248-11E8-B48F-1D18A9856A87","full_name":"Hansen, Andi H"},{"full_name":"Keays, David","last_name":"Keays","first_name":"David"}],"publication_status":"published","abstract":[{"text":"The development of the vertebrate central nervous system is reliant on a complex cascade of biological processes that include mitotic division, relocation of migrating neurons, and the extension of dendritic and axonal processes. Each of these cellular events requires the diverse functional repertoire of the microtubule cytoskeleton for the generation of forces, assembly of macromolecular complexes and transport of molecules and organelles. The tubulins are a multi-gene family that encode for the constituents of microtubules, and have been implicated in a spectrum of neurological disorders. Evidence is building that different tubulins tune the functional properties of the microtubule cytoskeleton dependent on the cell type, developmental profile and subcellular localisation. Here we review of the origins of the functional specification of the tubulin gene family in the developing brain at a transcriptional, translational, and post-transcriptional level. We remind the reader that tubulins are not just loading controls for your average Western blot.","lang":"eng"}],"intvolume":"        84","date_published":"2017-10-01T00:00:00Z","fulldoi":"https://doi.org/10.1016/j.mcn.2017.03.002","isi":1,"oa_version":"Published Version","publication":"Molecular and Cellular Neuroscience","publist_id":"6377","citation":{"ama":"Breuss M, Leca I, Gstrein T, Hansen AH, Keays D. Tubulins and brain development: The origins of functional specification. <i>Molecular and Cellular Neuroscience</i>. 2017;84:58-67. doi:<a href=\"https://doi.org/10.1016/j.mcn.2017.03.002\">10.1016/j.mcn.2017.03.002</a>","mla":"Breuss, Martin, et al. “Tubulins and Brain Development: The Origins of Functional Specification.” <i>Molecular and Cellular Neuroscience</i>, vol. 84, Academic Press, 2017, pp. 58–67, doi:<a href=\"https://doi.org/10.1016/j.mcn.2017.03.002\">10.1016/j.mcn.2017.03.002</a>.","chicago":"Breuss, Martin, Ines Leca, Thomas Gstrein, Andi H Hansen, and David Keays. “Tubulins and Brain Development: The Origins of Functional Specification.” <i>Molecular and Cellular Neuroscience</i>. Academic Press, 2017. <a href=\"https://doi.org/10.1016/j.mcn.2017.03.002\">https://doi.org/10.1016/j.mcn.2017.03.002</a>.","short":"M. Breuss, I. Leca, T. Gstrein, A.H. Hansen, D. Keays, Molecular and Cellular Neuroscience 84 (2017) 58–67.","ista":"Breuss M, Leca I, Gstrein T, Hansen AH, Keays D. 2017. Tubulins and brain development: The origins of functional specification. Molecular and Cellular Neuroscience. 84, 58–67.","apa":"Breuss, M., Leca, I., Gstrein, T., Hansen, A. H., &#38; Keays, D. (2017). Tubulins and brain development: The origins of functional specification. <i>Molecular and Cellular Neuroscience</i>. Academic Press. <a href=\"https://doi.org/10.1016/j.mcn.2017.03.002\">https://doi.org/10.1016/j.mcn.2017.03.002</a>","ieee":"M. Breuss, I. Leca, T. Gstrein, A. H. Hansen, and D. Keays, “Tubulins and brain development: The origins of functional specification,” <i>Molecular and Cellular Neuroscience</i>, vol. 84. Academic Press, pp. 58–67, 2017."},"article_processing_charge":"No","external_id":{"isi":["000415140700007"]},"_id":"1017","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2017","publisher":"Academic Press","publication_identifier":{"issn":["1044-7431"]},"scopus_import":"1","file_date_updated":"2018-12-12T10:09:19Z","has_accepted_license":"1","department":[{"_id":"SiHi"}],"language":[{"iso":"eng"}],"file":[{"file_name":"IST-2017-806-v1+2_1-s2.0-S1044743116302500-main_1_.pdf","creator":"system","date_updated":"2018-12-12T10:09:19Z","access_level":"open_access","date_created":"2018-12-12T10:09:19Z","file_size":1436377,"file_id":"4742","content_type":"application/pdf","relation":"main_file"}],"month":"10","ddc":["571"],"type":"journal_article","page":"58 - 67","date_created":"2018-12-11T11:49:42Z","volume":84,"pubrep_id":"806","day":"01","oa":1,"title":"Tubulins and brain development: The origins of functional specification","date_updated":"2025-07-10T11:49:44Z","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)","image":"/images/cc_by_nc_nd.png","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)"}},{"day":"17","title":"Light regulated expression of sensor histidine kinase CKI1 controls cytokinin related development","date_updated":"2023-09-22T09:41:48Z","publisher":"American Society of Plant Biologists","scopus_import":"1","language":[{"iso":"eng"}],"department":[{"_id":"EvBe"}],"volume":174,"page":"387 - 404","date_created":"2018-12-11T11:49:43Z","type":"journal_article","month":"05","publist_id":"6375","publication":"Plant Physiology","external_id":{"isi":["000402057200028"]},"article_processing_charge":"No","citation":{"ama":"Dobisova T, Hrdinova V, Cuesta C, et al. Light regulated expression of sensor histidine kinase CKI1 controls cytokinin related development. <i>Plant Physiology</i>. 2017;174(1):387-404. doi:<a href=\"https://doi.org/10.1104/pp.16.01964\">10.1104/pp.16.01964</a>","short":"T. Dobisova, V. Hrdinova, C. Cuesta, S. Michlickova, I. Urbankova, R. Hejatkova, P. Zadnikova, M. Pernisová, E. Benková, J. Hejátko, Plant Physiology 174 (2017) 387–404.","mla":"Dobisova, Tereza, et al. “Light Regulated Expression of Sensor Histidine Kinase CKI1 Controls Cytokinin Related Development.” <i>Plant Physiology</i>, vol. 174, no. 1, American Society of Plant Biologists, 2017, pp. 387–404, doi:<a href=\"https://doi.org/10.1104/pp.16.01964\">10.1104/pp.16.01964</a>.","chicago":"Dobisova, Tereza, Vendula Hrdinova, Candela Cuesta, Sarka Michlickova, Ivana Urbankova, Romana Hejatkova, Petra Zadnikova, Markéta Pernisová, Eva Benková, and Jan Hejátko. “Light Regulated Expression of Sensor Histidine Kinase CKI1 Controls Cytokinin Related Development.” <i>Plant Physiology</i>. American Society of Plant Biologists, 2017. <a href=\"https://doi.org/10.1104/pp.16.01964\">https://doi.org/10.1104/pp.16.01964</a>.","ista":"Dobisova T, Hrdinova V, Cuesta C, Michlickova S, Urbankova I, Hejatkova R, Zadnikova P, Pernisová M, Benková E, Hejátko J. 2017. Light regulated expression of sensor histidine kinase CKI1 controls cytokinin related development. Plant Physiology. 174(1), 387–404.","ieee":"T. Dobisova <i>et al.</i>, “Light regulated expression of sensor histidine kinase CKI1 controls cytokinin related development,” <i>Plant Physiology</i>, vol. 174, no. 1. American Society of Plant Biologists, pp. 387–404, 2017.","apa":"Dobisova, T., Hrdinova, V., Cuesta, C., Michlickova, S., Urbankova, I., Hejatkova, R., … Hejátko, J. (2017). Light regulated expression of sensor histidine kinase CKI1 controls cytokinin related development. <i>Plant Physiology</i>. American Society of Plant Biologists. <a href=\"https://doi.org/10.1104/pp.16.01964\">https://doi.org/10.1104/pp.16.01964</a>"},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","status":"public","_id":"1018","year":"2017","doi":"10.1104/pp.16.01964","quality_controlled":"1","intvolume":"       174","abstract":[{"lang":"eng","text":"In plants, the multistep phosphorelay (MSP) pathway mediates a range of regulatory processes, including those activated by cytokinins. The crosstalk between cytokinin response and light is known for a long time. However, the molecular mechanism underlying the interactionbetween light and cytokinin signaling remains elusive. In the screen for upstream regulators we identified a LONG PALE HYPOCOTYL (LPH) gene whose activity is indispensable for spatiotemporally correct expression of CYTOKININ INDEPENDENT-1 (CKI1), encoding the constitutively active sensor histidine kinase that activates MSP signaling. lph is a new allele of HEME OXYGENASE 1 (HY1) which encodes the key protein in the biosynthesis of phytochromobilin, a cofactor of photoconvertiblephytochromes. Our analysis confirmed the light-dependent regulation oftheCKI1 expression pattern. We show that CKI1 expression is under the control of phytochrome A (phyA), functioning as a dual (both positive and negative) regulator of CKI1 expression, presumably via the phyA-regulated transcription factors PHYTOCHROME INTERACTING FACTOR 3 (PIF3) and CIRCADIAN CLOCK ASSOCIATED 1 (CCA1). Changes in CKI1 expression observed in lph/hy1-7 and phy mutants correlatewithmisregulation of MSP signaling, changedcytokinin sensitivity and developmental aberrations,previously shown to be associated with cytokinin and/or CKI1 action. Besides that, we demonstrate novel role of phyA-dependent CKI1 expression in the hypocotyl elongation and hook development during skotomorphogenesis. Based on these results, we propose that the light-dependent regulation of CKI1 provides a plausible mechanistic link underlying the well-known interaction between light- and cytokinin-controlled plant development."}],"publication_status":"published","issue":"1","author":[{"first_name":"Tereza","last_name":"Dobisova","full_name":"Dobisova, Tereza"},{"first_name":"Vendula","full_name":"Hrdinova, Vendula","last_name":"Hrdinova"},{"first_name":"Candela","orcid":"0000-0003-1923-2410","last_name":"Cuesta","id":"33A3C818-F248-11E8-B48F-1D18A9856A87","full_name":"Cuesta, Candela"},{"first_name":"Sarka","full_name":"Michlickova, Sarka","last_name":"Michlickova"},{"first_name":"Ivana","full_name":"Urbankova, Ivana","last_name":"Urbankova"},{"full_name":"Hejatkova, Romana","last_name":"Hejatkova","first_name":"Romana"},{"first_name":"Petra","full_name":"Zadnikova, Petra","last_name":"Zadnikova"},{"first_name":"Markéta","last_name":"Pernisová","full_name":"Pernisová, Markéta"},{"first_name":"Eva","orcid":"0000-0002-8510-9739","last_name":"Benková","full_name":"Benková, Eva","id":"38F4F166-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Hejátko","full_name":"Hejátko, Jan","first_name":"Jan"}],"fulldoi":"https://doi.org/10.1104/pp.16.01964","date_published":"2017-05-17T00:00:00Z","isi":1,"oa_version":"None"},{"day":"01","related_material":{"record":[{"status":"public","id":"9861","relation":"research_data"}]},"title":"X-linkage is not a general inhibitor of tissue-specific gene expression in Drosophila melanogaster","date_updated":"2025-07-10T11:49:45Z","publisher":"Nature Publishing Group","publication_identifier":{"issn":["0018-067X"]},"scopus_import":"1","department":[{"_id":"BeVi"}],"language":[{"iso":"eng"}],"type":"journal_article","month":"07","page":"27 - 34","date_created":"2018-12-11T11:49:43Z","volume":119,"publication":"Heredity","publist_id":"6374","citation":{"mla":"Argyridou, Eliza, et al. “X-Linkage Is Not a General Inhibitor of Tissue-Specific Gene Expression in Drosophila Melanogaster.” <i>Heredity</i>, vol. 119, no. 1, Nature Publishing Group, 2017, pp. 27–34, doi:<a href=\"https://doi.org/10.1038/hdy.2017.12\">10.1038/hdy.2017.12</a>.","chicago":"Argyridou, Eliza, Ann K Huylmans, Annabella Königer, and John Parsch. “X-Linkage Is Not a General Inhibitor of Tissue-Specific Gene Expression in Drosophila Melanogaster.” <i>Heredity</i>. Nature Publishing Group, 2017. <a href=\"https://doi.org/10.1038/hdy.2017.12\">https://doi.org/10.1038/hdy.2017.12</a>.","short":"E. Argyridou, A.K. Huylmans, A. Königer, J. Parsch, Heredity 119 (2017) 27–34.","ista":"Argyridou E, Huylmans AK, Königer A, Parsch J. 2017. X-linkage is not a general inhibitor of tissue-specific gene expression in Drosophila melanogaster. Heredity. 119(1), 27–34.","ieee":"E. Argyridou, A. K. Huylmans, A. Königer, and J. Parsch, “X-linkage is not a general inhibitor of tissue-specific gene expression in Drosophila melanogaster,” <i>Heredity</i>, vol. 119, no. 1. Nature Publishing Group, pp. 27–34, 2017.","apa":"Argyridou, E., Huylmans, A. K., Königer, A., &#38; Parsch, J. (2017). X-linkage is not a general inhibitor of tissue-specific gene expression in Drosophila melanogaster. <i>Heredity</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/hdy.2017.12\">https://doi.org/10.1038/hdy.2017.12</a>","ama":"Argyridou E, Huylmans AK, Königer A, Parsch J. X-linkage is not a general inhibitor of tissue-specific gene expression in Drosophila melanogaster. <i>Heredity</i>. 2017;119(1):27-34. doi:<a href=\"https://doi.org/10.1038/hdy.2017.12\">10.1038/hdy.2017.12</a>"},"article_processing_charge":"No","external_id":{"isi":["000405397800004"]},"_id":"1019","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","year":"2017","quality_controlled":"1","doi":"10.1038/hdy.2017.12","author":[{"first_name":"Eliza","last_name":"Argyridou","full_name":"Argyridou, Eliza"},{"orcid":"0000-0001-8871-4961","first_name":"Ann K","full_name":"Huylmans, Ann K","id":"4C0A3874-F248-11E8-B48F-1D18A9856A87","last_name":"Huylmans"},{"first_name":"Annabella","last_name":"Königer","full_name":"Königer, Annabella"},{"first_name":"John","full_name":"Parsch, John","last_name":"Parsch"}],"publication_status":"published","issue":"1","intvolume":"       119","abstract":[{"text":"As a consequence of its difference in copy number between males and females, the X chromosome is subject to unique evolutionary forces and gene regulatory mechanisms. Previous studies of Drosophila melanogaster have shown that the expression of X-linked, testis-specific reporter genes is suppressed in the male germline. However, it is not known whether this phenomenon is restricted to testis-expressed genes or if it is a more general property of genes with tissue-specific expression, which are also underrepresented on the X chromosome. To test this, we compared the expression of three tissue-specific reporter genes (ovary, accessory gland and Malpighian tubule) inserted at various autosomal and X-chromosomal locations. In contrast to testis-specific reporter genes, we found no reduction of X-linked expression in any of the other tissues. In accessory gland and Malpighian tubule, we detected higher expression of the X-linked reporter genes, which suggests that they are at least partially dosage compensated. We found no difference in the tissue-specificity of X-linked and autosomal reporter genes. These findings indicate that, in general, the X chromosome is not a detrimental environment for tissue-specific gene expression and that the suppression of X-linked expression is limited to the male germline.","lang":"eng"}],"fulldoi":"https://doi.org/10.1038/hdy.2017.12","date_published":"2017-07-01T00:00:00Z","isi":1,"oa_version":"None"},{"title":"Disordered cellulose based nanostructures for enhanced light scattering","date_updated":"2025-06-04T08:09:49Z","day":"08","oa":1,"department":[{"_id":"JoFi"}],"main_file_link":[{"url":"https://arxiv.org/abs/1702.01415","open_access":"1"}],"language":[{"iso":"eng"}],"arxiv":1,"date_created":"2018-12-11T11:49:44Z","page":"7885 - 7890","volume":9,"acknowledgement":"This research was funded by the EPSRC (EP/M027961/1), the Leverhulme Trust (RPG-2014-238), Royal Society (RG140457), the BBSRC David Phillips fellowship (BB/K014617/1), and the European Research Council (ERC-2014-STG H2020 639088). All data created during this research are provided in full in the results section and Supporting Information. They are openly available from figshare and can be accessed at ref 30.","type":"journal_article","month":"03","publication_identifier":{"issn":["1944-8244"]},"publisher":"American Chemical Society","scopus_import":"1","_id":"1020","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2017","publist_id":"6372","publication":"ACS Applied Materials and Interfaces","article_processing_charge":"No","external_id":{"arxiv":["1702.01415"],"isi":["000396186000002"]},"citation":{"ista":"Caixeiro S, Peruzzo M, Onelli O, Vignolini S, Sapienza R. 2017. Disordered cellulose based nanostructures for enhanced light scattering. ACS Applied Materials and Interfaces. 9(9), 7885–7890.","ieee":"S. Caixeiro, M. Peruzzo, O. Onelli, S. Vignolini, and R. Sapienza, “Disordered cellulose based nanostructures for enhanced light scattering,” <i>ACS Applied Materials and Interfaces</i>, vol. 9, no. 9. American Chemical Society, pp. 7885–7890, 2017.","apa":"Caixeiro, S., Peruzzo, M., Onelli, O., Vignolini, S., &#38; Sapienza, R. (2017). Disordered cellulose based nanostructures for enhanced light scattering. <i>ACS Applied Materials and Interfaces</i>. American Chemical Society. <a href=\"https://doi.org/10.1021/acsami.6b15986\">https://doi.org/10.1021/acsami.6b15986</a>","short":"S. Caixeiro, M. Peruzzo, O. Onelli, S. Vignolini, R. Sapienza, ACS Applied Materials and Interfaces 9 (2017) 7885–7890.","chicago":"Caixeiro, Soraya, Matilda Peruzzo, Olimpia Onelli, Silvia Vignolini, and Riccardo Sapienza. “Disordered Cellulose Based Nanostructures for Enhanced Light Scattering.” <i>ACS Applied Materials and Interfaces</i>. American Chemical Society, 2017. <a href=\"https://doi.org/10.1021/acsami.6b15986\">https://doi.org/10.1021/acsami.6b15986</a>.","mla":"Caixeiro, Soraya, et al. “Disordered Cellulose Based Nanostructures for Enhanced Light Scattering.” <i>ACS Applied Materials and Interfaces</i>, vol. 9, no. 9, American Chemical Society, 2017, pp. 7885–90, doi:<a href=\"https://doi.org/10.1021/acsami.6b15986\">10.1021/acsami.6b15986</a>.","ama":"Caixeiro S, Peruzzo M, Onelli O, Vignolini S, Sapienza R. Disordered cellulose based nanostructures for enhanced light scattering. <i>ACS Applied Materials and Interfaces</i>. 2017;9(9):7885-7890. doi:<a href=\"https://doi.org/10.1021/acsami.6b15986\">10.1021/acsami.6b15986</a>"},"abstract":[{"text":"Cellulose is the most abundant biopolymer on Earth. Cellulose fibers, such as the one extracted form cotton or woodpulp, have been used by humankind for hundreds of years to make textiles and paper. Here we show how, by engineering light-matter interaction, we can optimize light scattering using exclusively cellulose nanocrystals. The produced material is sustainable, biocompatible, and when compared to ordinary microfiber-based paper, it shows enhanced scattering strength (×4), yielding a transport mean free path as low as 3.5 μm in the visible light range. The experimental results are in a good agreement with the theoretical predictions obtained with a diffusive model for light propagation.","lang":"eng"}],"intvolume":"         9","author":[{"first_name":"Soraya","full_name":"Caixeiro, Soraya","last_name":"Caixeiro"},{"full_name":"Peruzzo, Matilda","id":"3F920B30-F248-11E8-B48F-1D18A9856A87","last_name":"Peruzzo","orcid":"0000-0002-3415-4628","first_name":"Matilda"},{"full_name":"Onelli, Olimpia","last_name":"Onelli","first_name":"Olimpia"},{"first_name":"Silvia","full_name":"Vignolini, Silvia","last_name":"Vignolini"},{"full_name":"Sapienza, Riccardo","last_name":"Sapienza","first_name":"Riccardo"}],"issue":"9","publication_status":"published","fulldoi":"https://doi.org/10.1021/acsami.6b15986","isi":1,"oa_version":"Submitted Version","date_published":"2017-03-08T00:00:00Z","quality_controlled":"1","doi":"10.1021/acsami.6b15986"},{"citation":{"mla":"Lopez Alonso, Jose M., and Marc Avila. “Boundary Layer Turbulence in Experiments on Quasi Keplerian Flows.” <i>Journal of Fluid Mechanics</i>, vol. 817, Cambridge University Press, 2017, pp. 21–34, doi:<a href=\"https://doi.org/10.1017/jfm.2017.109\">10.1017/jfm.2017.109</a>.","chicago":"Lopez Alonso, Jose M, and Marc Avila. “Boundary Layer Turbulence in Experiments on Quasi Keplerian Flows.” <i>Journal of Fluid Mechanics</i>. Cambridge University Press, 2017. <a href=\"https://doi.org/10.1017/jfm.2017.109\">https://doi.org/10.1017/jfm.2017.109</a>.","short":"J.M. Lopez Alonso, M. Avila, Journal of Fluid Mechanics 817 (2017) 21–34.","ieee":"J. M. Lopez Alonso and M. Avila, “Boundary layer turbulence in experiments on quasi Keplerian flows,” <i>Journal of Fluid Mechanics</i>, vol. 817. Cambridge University Press, pp. 21–34, 2017.","ista":"Lopez Alonso JM, Avila M. 2017. Boundary layer turbulence in experiments on quasi Keplerian flows. Journal of Fluid Mechanics. 817, 21–34.","apa":"Lopez Alonso, J. M., &#38; Avila, M. (2017). Boundary layer turbulence in experiments on quasi Keplerian flows. <i>Journal of Fluid Mechanics</i>. Cambridge University Press. <a href=\"https://doi.org/10.1017/jfm.2017.109\">https://doi.org/10.1017/jfm.2017.109</a>","ama":"Lopez Alonso JM, Avila M. Boundary layer turbulence in experiments on quasi Keplerian flows. <i>Journal of Fluid Mechanics</i>. 2017;817:21-34. doi:<a href=\"https://doi.org/10.1017/jfm.2017.109\">10.1017/jfm.2017.109</a>"},"article_processing_charge":"No","external_id":{"arxiv":["1608.05527"],"isi":["000398179100006"]},"publication":"Journal of Fluid Mechanics","publist_id":"6371","year":"2017","_id":"1021","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","quality_controlled":"1","doi":"10.1017/jfm.2017.109","fulldoi":"https://doi.org/10.1017/jfm.2017.109","isi":1,"oa_version":"Submitted Version","project":[{"grant_number":"RGP0065/2012","name":"Information processing and computation in fish groups","_id":"255008E4-B435-11E9-9278-68D0E5697425"}],"date_published":"2017-04-25T00:00:00Z","publication_status":"published","author":[{"orcid":"0000-0002-0384-2022","first_name":"Jose M","id":"40770848-F248-11E8-B48F-1D18A9856A87","full_name":"Lopez Alonso, Jose M","last_name":"Lopez Alonso"},{"full_name":"Avila, Marc","last_name":"Avila","first_name":"Marc"}],"abstract":[{"text":"Most flows in nature and engineering are turbulent because of their large velocities and spatial scales. Laboratory experiments on rotating quasi-Keplerian flows, for which the angular velocity decreases radially but the angular momentum increases, are however laminar at Reynolds numbers exceeding one million. This is in apparent contradiction to direct numerical simulations showing that in these experiments turbulence transition is triggered by the axial boundaries. We here show numerically that as the Reynolds number increases, turbulence becomes progressively confined to the boundary layers and the flow in the bulk fully relaminarizes. Our findings support that turbulence is unlikely to occur in isothermal constant-density quasi-Keplerian flows.","lang":"eng"}],"intvolume":"       817","oa":1,"day":"25","date_updated":"2025-06-04T08:10:13Z","title":"Boundary layer turbulence in experiments on quasi Keplerian flows","scopus_import":"1","publisher":"Cambridge University Press","publication_identifier":{"issn":["0022-1120"]},"type":"journal_article","month":"04","date_created":"2018-12-11T11:49:44Z","page":"21 - 34","volume":817,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1608.05527"}],"department":[{"_id":"BjHo"}],"arxiv":1,"language":[{"iso":"eng"}]},{"doi":"10.1093/mnras/stw2862","quality_controlled":"1","oa_version":"Submitted Version","fulldoi":"https://doi.org/10.1093/mnras/stw2862","isi":1,"date_published":"2017-01-01T00:00:00Z","publication_status":"published","author":[{"first_name":"Pratyush","last_name":"Pranav","full_name":"Pranav, Pratyush"},{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","first_name":"Herbert"},{"first_name":"Rien","last_name":"Van De Weygaert","full_name":"Van De Weygaert, Rien"},{"last_name":"Vegter","full_name":"Vegter, Gert","first_name":"Gert"},{"first_name":"Michael","last_name":"Kerber","full_name":"Kerber, Michael"},{"last_name":"Jones","full_name":"Jones, Bernard","first_name":"Bernard"},{"first_name":"Mathijs","orcid":"0000-0002-7472-2220","last_name":"Wintraecken","full_name":"Wintraecken, Mathijs","id":"307CFBC8-F248-11E8-B48F-1D18A9856A87"}],"issue":"4","abstract":[{"lang":"eng","text":"We introduce a multiscale topological description of the Megaparsec web-like cosmic matter distribution. Betti numbers and topological persistence offer a powerful means of describing the rich connectivity structure of the cosmic web and of its multiscale arrangement of matter and galaxies. Emanating from algebraic topology and Morse theory, Betti numbers and persistence diagrams represent an extension and deepening of the cosmologically familiar topological genus measure and the related geometric Minkowski functionals. In addition to a description of the mathematical background, this study presents the computational procedure for computing Betti numbers and persistence diagrams for density field filtrations. The field may be computed starting from a discrete spatial distribution of galaxies or simulation particles. The main emphasis of this study concerns an extensive and systematic exploration of the imprint of different web-like morphologies and different levels of multiscale clustering in the corresponding computed Betti numbers and persistence diagrams. To this end, we use Voronoi clustering models as templates for a rich variety of web-like configurations and the fractal-like Soneira-Peebles models exemplify a range of multiscale configurations. We have identified the clear imprint of cluster nodes, filaments, walls, and voids in persistence diagrams, along with that of the nested hierarchy of structures in multiscale point distributions. We conclude by outlining the potential of persistent topology for understanding the connectivity structure of the cosmic web, in large simulations of cosmic structure formation and in the challenging context of the observed galaxy distribution in large galaxy surveys."}],"intvolume":"       465","citation":{"ieee":"P. Pranav <i>et al.</i>, “The topology of the cosmic web in terms of persistent Betti numbers,” <i>Monthly Notices of the Royal Astronomical Society</i>, vol. 465, no. 4. Oxford University Press, pp. 4281–4310, 2017.","apa":"Pranav, P., Edelsbrunner, H., Van De Weygaert, R., Vegter, G., Kerber, M., Jones, B., &#38; Wintraecken, M. (2017). The topology of the cosmic web in terms of persistent Betti numbers. <i>Monthly Notices of the Royal Astronomical Society</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/mnras/stw2862\">https://doi.org/10.1093/mnras/stw2862</a>","ista":"Pranav P, Edelsbrunner H, Van De Weygaert R, Vegter G, Kerber M, Jones B, Wintraecken M. 2017. The topology of the cosmic web in terms of persistent Betti numbers. Monthly Notices of the Royal Astronomical Society. 465(4), 4281–4310.","short":"P. Pranav, H. Edelsbrunner, R. Van De Weygaert, G. Vegter, M. Kerber, B. Jones, M. Wintraecken, Monthly Notices of the Royal Astronomical Society 465 (2017) 4281–4310.","mla":"Pranav, Pratyush, et al. “The Topology of the Cosmic Web in Terms of Persistent Betti Numbers.” <i>Monthly Notices of the Royal Astronomical Society</i>, vol. 465, no. 4, Oxford University Press, 2017, pp. 4281–310, doi:<a href=\"https://doi.org/10.1093/mnras/stw2862\">10.1093/mnras/stw2862</a>.","chicago":"Pranav, Pratyush, Herbert Edelsbrunner, Rien Van De Weygaert, Gert Vegter, Michael Kerber, Bernard Jones, and Mathijs Wintraecken. “The Topology of the Cosmic Web in Terms of Persistent Betti Numbers.” <i>Monthly Notices of the Royal Astronomical Society</i>. Oxford University Press, 2017. <a href=\"https://doi.org/10.1093/mnras/stw2862\">https://doi.org/10.1093/mnras/stw2862</a>.","ama":"Pranav P, Edelsbrunner H, Van De Weygaert R, et al. The topology of the cosmic web in terms of persistent Betti numbers. <i>Monthly Notices of the Royal Astronomical Society</i>. 2017;465(4):4281-4310. doi:<a href=\"https://doi.org/10.1093/mnras/stw2862\">10.1093/mnras/stw2862</a>"},"external_id":{"isi":["000395170200039"],"arxiv":["1608.04519"]},"article_processing_charge":"No","publication":"Monthly Notices of the Royal Astronomical Society","publist_id":"6373","year":"2017","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"1022","scopus_import":"1","publisher":"Oxford University Press","publication_identifier":{"issn":["0035-8711"]},"month":"01","type":"journal_article","acknowledgement":"Part of this work has been supported by the 7th Framework Programme for Research of the European Commission, under FETOpen grant number 255827 (CGL Computational Geometry Learning) and ERC advanced grant, URSAT (Understanding Random Systems via Algebraic Topology) number 320422.","volume":465,"date_created":"2018-12-11T11:49:44Z","page":"4281 - 4310","language":[{"iso":"eng"}],"arxiv":1,"department":[{"_id":"HeEd"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1608.04519"}],"oa":1,"day":"01","date_updated":"2025-06-04T08:10:31Z","title":"The topology of the cosmic web in terms of persistent Betti numbers"},{"fulldoi":"https://doi.org/10.1214/17-EJP38","date_published":"2017-02-06T00:00:00Z","isi":1,"oa_version":"Published Version","publication_status":"published","author":[{"orcid":"0000-0002-7327-856X","first_name":"Yuriy","full_name":"Nemish, Yuriy","id":"4D902E6A-F248-11E8-B48F-1D18A9856A87","last_name":"Nemish"}],"abstract":[{"text":"We consider products of independent square non-Hermitian random matrices. More precisely, let X1,…, Xn be independent N × N random matrices with independent entries (real or complex with independent real and imaginary parts) with zero mean and variance 1/N. Soshnikov-O’Rourke [19] and Götze-Tikhomirov [15] showed that the empirical spectral distribution of the product of n random matrices with iid entries converges to (equation found). We prove that if the entries of the matrices X1,…, Xn are independent (but not necessarily identically distributed) and satisfy uniform subexponential decay condition, then in the bulk the convergence of the ESD of X1,…, Xn to (0.1) holds up to the scale N–1/2+ε.","lang":"eng"}],"intvolume":"        22","quality_controlled":"1","doi":"10.1214/17-EJP38","year":"2017","_id":"1023","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ama":"Nemish Y. Local law for the product of independent non-Hermitian random matrices with independent entries. <i>Electronic Journal of Probability</i>. 2017;22. doi:<a href=\"https://doi.org/10.1214/17-EJP38\">10.1214/17-EJP38</a>","ista":"Nemish Y. 2017. Local law for the product of independent non-Hermitian random matrices with independent entries. Electronic Journal of Probability. 22, 22.","apa":"Nemish, Y. (2017). Local law for the product of independent non-Hermitian random matrices with independent entries. <i>Electronic Journal of Probability</i>. Institute of Mathematical Statistics. <a href=\"https://doi.org/10.1214/17-EJP38\">https://doi.org/10.1214/17-EJP38</a>","ieee":"Y. Nemish, “Local law for the product of independent non-Hermitian random matrices with independent entries,” <i>Electronic Journal of Probability</i>, vol. 22. Institute of Mathematical Statistics, 2017.","short":"Y. Nemish, Electronic Journal of Probability 22 (2017).","mla":"Nemish, Yuriy. “Local Law for the Product of Independent Non-Hermitian Random Matrices with Independent Entries.” <i>Electronic Journal of Probability</i>, vol. 22, 22, Institute of Mathematical Statistics, 2017, doi:<a href=\"https://doi.org/10.1214/17-EJP38\">10.1214/17-EJP38</a>.","chicago":"Nemish, Yuriy. “Local Law for the Product of Independent Non-Hermitian Random Matrices with Independent Entries.” <i>Electronic Journal of Probability</i>. Institute of Mathematical Statistics, 2017. <a href=\"https://doi.org/10.1214/17-EJP38\">https://doi.org/10.1214/17-EJP38</a>."},"article_processing_charge":"No","external_id":{"isi":["000396611900022"]},"publication":"Electronic Journal of Probability","publist_id":"6370","article_number":"22","ddc":["510"],"type":"journal_article","month":"02","date_created":"2018-12-11T11:49:44Z","pubrep_id":"802","volume":22,"department":[{"_id":"LaEr"}],"language":[{"iso":"eng"}],"file":[{"date_updated":"2018-12-12T10:15:29Z","access_level":"open_access","date_created":"2018-12-12T10:15:29Z","file_name":"IST-2017-802-v1+1_euclid.ejp.1487991681.pdf","creator":"system","content_type":"application/pdf","relation":"main_file","file_size":742275,"file_id":"5149"}],"file_date_updated":"2018-12-12T10:15:29Z","scopus_import":"1","has_accepted_license":"1","publisher":"Institute of Mathematical Statistics","publication_identifier":{"issn":["1083-6489"]},"date_updated":"2025-07-10T11:49:47Z","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"title":"Local law for the product of independent non-Hermitian random matrices with independent entries","oa":1,"day":"06"},{"doi":"10.1038/nature21502","quality_controlled":"1","fulldoi":"https://doi.org/10.1038/nature21502","date_published":"2017-03-02T00:00:00Z","oa_version":"None","isi":1,"intvolume":"       543","abstract":[{"text":"Many organ surfaces are covered by a protective epithelial-cell layer. It emerges that such layers are maintained by cell stretching that triggers cell division mediated by the force-sensitive ion-channel protein Piezo1. See Letter p.118","lang":"eng"}],"publication_status":"published","issue":"7643","author":[{"last_name":"Heisenberg","full_name":"Heisenberg, Carl-Philipp J","id":"39427864-F248-11E8-B48F-1D18A9856A87","first_name":"Carl-Philipp J","orcid":"0000-0002-0912-4566"}],"external_id":{"isi":["000395671500025"]},"article_processing_charge":"No","citation":{"ista":"Heisenberg C-PJ. 2017. Cell biology: Stretched divisions. Nature. 543(7643), 43–44.","apa":"Heisenberg, C.-P. J. (2017). Cell biology: Stretched divisions. <i>Nature</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/nature21502\">https://doi.org/10.1038/nature21502</a>","ieee":"C.-P. J. Heisenberg, “Cell biology: Stretched divisions,” <i>Nature</i>, vol. 543, no. 7643. Nature Publishing Group, pp. 43–44, 2017.","mla":"Heisenberg, Carl-Philipp J. “Cell Biology: Stretched Divisions.” <i>Nature</i>, vol. 543, no. 7643, Nature Publishing Group, 2017, pp. 43–44, doi:<a href=\"https://doi.org/10.1038/nature21502\">10.1038/nature21502</a>.","chicago":"Heisenberg, Carl-Philipp J. “Cell Biology: Stretched Divisions.” <i>Nature</i>. Nature Publishing Group, 2017. <a href=\"https://doi.org/10.1038/nature21502\">https://doi.org/10.1038/nature21502</a>.","short":"C.-P.J. Heisenberg, Nature 543 (2017) 43–44.","ama":"Heisenberg C-PJ. Cell biology: Stretched divisions. <i>Nature</i>. 2017;543(7643):43-44. doi:<a href=\"https://doi.org/10.1038/nature21502\">10.1038/nature21502</a>"},"publist_id":"6367","publication":"Nature","year":"2017","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","_id":"1025","scopus_import":"1","corr_author":"1","publication_identifier":{"issn":["0028-0836"]},"publisher":"Nature Publishing Group","volume":543,"page":"43 - 44","date_created":"2018-12-11T11:49:45Z","month":"03","type":"journal_article","language":[{"iso":"eng"}],"department":[{"_id":"CaHe"}],"day":"02","date_updated":"2025-07-10T11:49:49Z","title":"Cell biology: Stretched divisions"},{"publisher":"Elsevier","ec_funded":1,"publication_identifier":{"issn":["0958-1669"]},"corr_author":"1","scopus_import":"1","department":[{"_id":"HaJa"}],"language":[{"iso":"eng"}],"month":"12","type":"journal_article","page":"8 - 14","date_created":"2018-12-11T11:49:45Z","acknowledgement":"This work was supported by grants of the European Union Seventh Framework Programme (CIG-303564), the Human Frontier Science Program (RGY0084_2012), and the Austrian Science Fund FWF (W1232 MolecularDrugTargets).","article_type":"original","volume":48,"day":"01","title":"Optogenetic methods in drug screening: Technologies and applications","date_updated":"2026-04-16T09:57:03Z","quality_controlled":"1","doi":"10.1016/j.copbio.2017.02.006","author":[{"last_name":"Agus","full_name":"Agus, Viviana","first_name":"Viviana"},{"last_name":"Janovjak","id":"33BA6C30-F248-11E8-B48F-1D18A9856A87","full_name":"Janovjak, Harald L","first_name":"Harald L","orcid":"0000-0002-8023-9315"}],"publication_status":"published","intvolume":"        48","abstract":[{"lang":"eng","text":"The optogenetic revolution enabled spatially-precise and temporally-precise control over protein function, signaling pathway activation, and animal behavior with tremendous success in the dissection of signaling networks and neural circuits. Very recently, optogenetic methods have been paired with optical reporters in novel drug screening platforms. In these all-optical platforms, light remotely activated ion channels and kinases thereby obviating the use of electrophysiology or reagents. Consequences were remarkable operational simplicity, throughput, and cost-effectiveness that culminated in the identification of new drug candidates. These blueprints for all-optical assays also revealed potential pitfalls and inspire all-optical variants of other screens, such as those that aim at better understanding dynamic drug action or orphan protein function."}],"fulldoi":"https://doi.org/10.1016/j.copbio.2017.02.006","date_published":"2017-12-01T00:00:00Z","oa_version":"None","project":[{"_id":"255BFFFA-B435-11E9-9278-68D0E5697425","grant_number":"RGY0084/2012","name":"In situ real-time imaging of neurotransmitter signaling using designer optical sensors"},{"name":"Microbial Ion Channels for Synthetic Neurobiology","grant_number":"303564","_id":"25548C20-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"call_identifier":"FWF","_id":"255A6082-B435-11E9-9278-68D0E5697425","grant_number":"W1232-B24","name":"Molecular Drug Targets"}],"isi":1,"publication":"Current Opinion in Biotechnology","publist_id":"6365","citation":{"ama":"Agus V, Janovjak HL. Optogenetic methods in drug screening: Technologies and applications. <i>Current Opinion in Biotechnology</i>. 2017;48:8-14. doi:<a href=\"https://doi.org/10.1016/j.copbio.2017.02.006\">10.1016/j.copbio.2017.02.006</a>","ieee":"V. Agus and H. L. Janovjak, “Optogenetic methods in drug screening: Technologies and applications,” <i>Current Opinion in Biotechnology</i>, vol. 48. Elsevier, pp. 8–14, 2017.","ista":"Agus V, Janovjak HL. 2017. Optogenetic methods in drug screening: Technologies and applications. Current Opinion in Biotechnology. 48, 8–14.","apa":"Agus, V., &#38; Janovjak, H. L. (2017). Optogenetic methods in drug screening: Technologies and applications. <i>Current Opinion in Biotechnology</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.copbio.2017.02.006\">https://doi.org/10.1016/j.copbio.2017.02.006</a>","mla":"Agus, Viviana, and Harald L. Janovjak. “Optogenetic Methods in Drug Screening: Technologies and Applications.” <i>Current Opinion in Biotechnology</i>, vol. 48, Elsevier, 2017, pp. 8–14, doi:<a href=\"https://doi.org/10.1016/j.copbio.2017.02.006\">10.1016/j.copbio.2017.02.006</a>.","chicago":"Agus, Viviana, and Harald L Janovjak. “Optogenetic Methods in Drug Screening: Technologies and Applications.” <i>Current Opinion in Biotechnology</i>. Elsevier, 2017. <a href=\"https://doi.org/10.1016/j.copbio.2017.02.006\">https://doi.org/10.1016/j.copbio.2017.02.006</a>.","short":"V. Agus, H.L. Janovjak, Current Opinion in Biotechnology 48 (2017) 8–14."},"article_processing_charge":"No","external_id":{"isi":["000418313200003"]},"_id":"1026","status":"public","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","year":"2017"},{"doi":"10.11588/ip.2017.1.35227","fulldoi":"https://doi.org/10.11588/ip.2017.1.35227","oa_version":"Published Version","popular_science":"1","date_published":"2017-01-01T00:00:00Z","publication_status":"published","author":[{"first_name":"Márton","orcid":"0000-0001-8126-0426","last_name":"Villányi","id":"3FFCCD3A-F248-11E8-B48F-1D18A9856A87","full_name":"Villányi, Márton"}],"issue":"1","abstract":[{"text":"Auf der Suche nach einem Bibliothekssystem entschied sich die Forschungseinrichtung IST Austria im Jahr 2014 für das Open-Source-Produkt Koha. In einem ersten Schritt wurden zunächst Grundfunktionen aktiviert um im Anschluss diverse zusätzliche Tools zum Einsatz zu bringen. Die große Flexibilität des Systems erlaubt maßgeschneiderte Lösungen für unterschiedlichste Institutionen. Trotz Herausforderungen kann die Bibliothek auf eine erfolgreiche Implementierung zurückblicken.","lang":"ger"},{"text":"IST Austria was looking for a new library system until 2014 when the research institute decided\r\nto implement Koha. The library first activated basic functions of the open-source product and\r\nthen brought additional tools into operation. The high flexibility of the system allows customized\r\nsolutions for different institutions. Although the library faced some challenges, it can now look\r\nback on a successful implementation.","lang":"eng"}],"intvolume":"         3","citation":{"ama":"Villányi M. Ein freies Bibliothekssystem für wissenschaftliche Bibliotheken – Werkstattbericht der IST Austria Library. <i>Informationspraxis</i>. 2017;3(1). doi:<a href=\"https://doi.org/10.11588/ip.2017.1.35227\">10.11588/ip.2017.1.35227</a>","mla":"Villányi, Márton. “Ein Freies Bibliothekssystem Für Wissenschaftliche Bibliotheken – Werkstattbericht Der IST Austria Library.” <i>Informationspraxis</i>, vol. 3, no. 1, Verein Informationspraxis , 2017, doi:<a href=\"https://doi.org/10.11588/ip.2017.1.35227\">10.11588/ip.2017.1.35227</a>.","chicago":"Villányi, Márton. “Ein Freies Bibliothekssystem Für Wissenschaftliche Bibliotheken – Werkstattbericht Der IST Austria Library.” <i>Informationspraxis</i>. Verein Informationspraxis , 2017. <a href=\"https://doi.org/10.11588/ip.2017.1.35227\">https://doi.org/10.11588/ip.2017.1.35227</a>.","short":"M. Villányi, Informationspraxis 3 (2017).","apa":"Villányi, M. (2017). Ein freies Bibliothekssystem für wissenschaftliche Bibliotheken – Werkstattbericht der IST Austria Library. <i>Informationspraxis</i>. Verein Informationspraxis . <a href=\"https://doi.org/10.11588/ip.2017.1.35227\">https://doi.org/10.11588/ip.2017.1.35227</a>","ista":"Villányi M. 2017. Ein freies Bibliothekssystem für wissenschaftliche Bibliotheken – Werkstattbericht der IST Austria Library. Informationspraxis. 3(1).","ieee":"M. Villányi, “Ein freies Bibliothekssystem für wissenschaftliche Bibliotheken – Werkstattbericht der IST Austria Library,” <i>Informationspraxis</i>, vol. 3, no. 1. Verein Informationspraxis , 2017."},"article_processing_charge":"No","publication":"Informationspraxis","publist_id":"6360","year":"2017","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","_id":"1030","file_date_updated":"2018-12-12T10:08:20Z","corr_author":"1","has_accepted_license":"1","publisher":"Verein Informationspraxis ","publication_identifier":{"issn":["2297-3249"]},"ddc":["020"],"type":"journal_article","month":"01","pubrep_id":"799","volume":3,"article_type":"original","date_created":"2018-12-11T11:49:46Z","language":[{"iso":"eng"}],"department":[{"_id":"E-Lib"}],"file":[{"date_created":"2018-12-12T10:08:20Z","access_level":"open_access","date_updated":"2018-12-12T10:08:20Z","creator":"system","file_name":"IST-2017-799-v1+1_35227-112025-1-PB.pdf","relation":"main_file","content_type":"application/pdf","file_size":201163,"file_id":"4680"}],"oa":1,"day":"01","date_updated":"2024-10-09T20:57:18Z","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"title":"Ein freies Bibliothekssystem für wissenschaftliche Bibliotheken – Werkstattbericht der IST Austria Library"},{"file_date_updated":"2021-12-07T08:06:28Z","scopus_import":"1","corr_author":"1","has_accepted_license":"1","publisher":"Association for Computing Machinery","publication_identifier":{"eissn":["2475-1421"]},"ec_funded":1,"type":"journal_article","ddc":["000"],"month":"12","article_type":"original","acknowledgement":"The research was partly supported by Austrian Science Fund (FWF) Grant No P23499-N23, FWF NFN Grant No S11407-N23 (RiSE/SHiNE), and ERC Start grant (279307: Graph Games).\r\n","volume":2,"date_created":"2021-12-05T23:01:48Z","language":[{"iso":"eng"}],"arxiv":1,"department":[{"_id":"KrCh"}],"file":[{"content_type":"application/pdf","relation":"main_file","file_size":460188,"file_id":"10421","checksum":"faa3f7b3fe8aab84b50ed805c26a0ee5","date_updated":"2021-12-07T08:06:28Z","success":1,"access_level":"open_access","date_created":"2021-12-07T08:06:28Z","file_name":"2017_ACMProgLang_Chatterjee.pdf","creator":"cchlebak"}],"oa":1,"day":"27","related_material":{"record":[{"status":"public","id":"5455","relation":"earlier_version"}]},"date_updated":"2025-04-15T07:26:20Z","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"title":"Optimal Dyck reachability for data-dependence and Alias analysis","conference":{"end_date":"2018-01-13","name":"POPL: Programming Languages","start_date":"2018-01-07","location":"Los Angeles, CA, United States"},"doi":"10.1145/3158118","quality_controlled":"1","fulldoi":"https://doi.org/10.1145/3158118","date_published":"2017-12-27T00:00:00Z","project":[{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications"},{"call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"}],"oa_version":"Published Version","author":[{"last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","orcid":"0000-0002-4561-241X"},{"first_name":"Bhavya","last_name":"Choudhary","full_name":"Choudhary, Bhavya"},{"orcid":"0000-0002-8943-0722","first_name":"Andreas","id":"49704004-F248-11E8-B48F-1D18A9856A87","full_name":"Pavlogiannis, Andreas","last_name":"Pavlogiannis"}],"publication_status":"published","issue":"POPL","intvolume":"         2","abstract":[{"lang":"eng","text":"A fundamental algorithmic problem at the heart of static analysis is Dyck reachability. The input is a graph where the edges are labeled with different types of opening and closing parentheses, and the reachability information is computed via paths whose parentheses are properly matched. We present new results for Dyck reachability problems with applications to alias analysis and data-dependence analysis. Our main contributions, that include improved upper bounds as well as lower bounds that establish optimality guarantees, are as follows: First, we consider Dyck reachability on bidirected graphs, which is the standard way of performing field-sensitive points-to analysis. Given a bidirected graph with n nodes and m edges, we present: (i) an algorithm with worst-case running time O(m + n · α(n)), where α(n) is the inverse Ackermann function, improving the previously known O(n2) time bound; (ii) a matching lower bound that shows that our algorithm is optimal wrt to worst-case complexity; and (iii) an optimal average-case upper bound of O(m) time, improving the previously known O(m · logn) bound. Second, we consider the problem of context-sensitive data-dependence analysis, where the task is to obtain analysis summaries of library code in the presence of callbacks. Our algorithm preprocesses libraries in almost linear time, after which the contribution of the library in the complexity of the client analysis is only linear, and only wrt the number of call sites. Third, we prove that combinatorial algorithms for Dyck reachability on general graphs with truly sub-cubic bounds cannot be obtained without obtaining sub-cubic combinatorial algorithms for Boolean Matrix Multiplication, which is a long-standing open problem. Thus we establish that the existing combinatorial algorithms for Dyck reachability are (conditionally) optimal for general graphs. We also show that the same hardness holds for graphs of constant treewidth. Finally, we provide a prototype implementation of our algorithms for both alias analysis and data-dependence analysis. Our experimental evaluation demonstrates that the new algorithms significantly outperform all existing methods on the two problems, over real-world benchmarks."}],"citation":{"apa":"Chatterjee, K., Choudhary, B., &#38; Pavlogiannis, A. (2017). Optimal Dyck reachability for data-dependence and Alias analysis. <i>Proceedings of the ACM on Programming Languages</i>. Los Angeles, CA, United States: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3158118\">https://doi.org/10.1145/3158118</a>","ista":"Chatterjee K, Choudhary B, Pavlogiannis A. 2017. Optimal Dyck reachability for data-dependence and Alias analysis. Proceedings of the ACM on Programming Languages. 2(POPL), 30.","ieee":"K. Chatterjee, B. Choudhary, and A. Pavlogiannis, “Optimal Dyck reachability for data-dependence and Alias analysis,” <i>Proceedings of the ACM on Programming Languages</i>, vol. 2, no. POPL. Association for Computing Machinery, 2017.","mla":"Chatterjee, Krishnendu, et al. “Optimal Dyck Reachability for Data-Dependence and Alias Analysis.” <i>Proceedings of the ACM on Programming Languages</i>, vol. 2, no. POPL, 30, Association for Computing Machinery, 2017, doi:<a href=\"https://doi.org/10.1145/3158118\">10.1145/3158118</a>.","chicago":"Chatterjee, Krishnendu, Bhavya Choudhary, and Andreas Pavlogiannis. “Optimal Dyck Reachability for Data-Dependence and Alias Analysis.” <i>Proceedings of the ACM on Programming Languages</i>. Association for Computing Machinery, 2017. <a href=\"https://doi.org/10.1145/3158118\">https://doi.org/10.1145/3158118</a>.","short":"K. Chatterjee, B. Choudhary, A. Pavlogiannis, Proceedings of the ACM on Programming Languages 2 (2017).","ama":"Chatterjee K, Choudhary B, Pavlogiannis A. Optimal Dyck reachability for data-dependence and Alias analysis. <i>Proceedings of the ACM on Programming Languages</i>. 2017;2(POPL). doi:<a href=\"https://doi.org/10.1145/3158118\">10.1145/3158118</a>"},"external_id":{"arxiv":["1910.00241"]},"article_processing_charge":"No","publication":"Proceedings of the ACM on Programming Languages","article_number":"30","year":"2017","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","status":"public","_id":"10416"},{"day":"07","oa":1,"title":"A new proof rule for almost-sure termination","date_updated":"2026-06-18T08:40:04Z","publication_identifier":{"eissn":["2475-1421"]},"publisher":"Association for Computing Machinery","scopus_import":"1","corr_author":"1","language":[{"iso":"eng"}],"arxiv":1,"main_file_link":[{"url":"https://dl.acm.org/doi/10.1145/3158121","open_access":"1"}],"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"volume":2,"article_type":"original","acknowledgement":"McIver and Morgan are grateful to David Basin and the Information Security Group at ETH Zürich for hosting a six-month stay in Switzerland, during part of which this work began. And thanks particularly to Andreas Lochbihler, who shared with us the probabilistic termination problem that led to it. They acknowledge the support of ARC grant DP140101119. Part of this work was carried out during the Workshop on Probabilistic Programming Semantics\r\nat McGill University’s Bellairs Research Institute on Barbados organised by Alexandra Silva and\r\nPrakash Panangaden. Kaminski and Katoen are grateful to Sebastian Junges for spotting a flaw in §5.4.","date_created":"2021-12-05T23:01:49Z","ddc":["000"],"type":"journal_article","month":"12","article_number":"33","publication":"Proceedings of the ACM on Programming Languages","external_id":{"arxiv":["1711.03588"]},"article_processing_charge":"No","citation":{"ieee":"A. Mciver, C. Morgan, B. L. Kaminski, and J. P. Katoen, “A new proof rule for almost-sure termination,” <i>Proceedings of the ACM on Programming Languages</i>, vol. 2, no. POPL. Association for Computing Machinery, 2017.","ista":"Mciver A, Morgan C, Kaminski BL, Katoen JP. 2017. A new proof rule for almost-sure termination. Proceedings of the ACM on Programming Languages. 2(POPL), 33.","apa":"Mciver, A., Morgan, C., Kaminski, B. L., &#38; Katoen, J. P. (2017). A new proof rule for almost-sure termination. <i>Proceedings of the ACM on Programming Languages</i>. Los Angeles, CA, United States: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3158121\">https://doi.org/10.1145/3158121</a>","mla":"Mciver, Annabelle, et al. “A New Proof Rule for Almost-Sure Termination.” <i>Proceedings of the ACM on Programming Languages</i>, vol. 2, no. POPL, 33, Association for Computing Machinery, 2017, doi:<a href=\"https://doi.org/10.1145/3158121\">10.1145/3158121</a>.","chicago":"Mciver, Annabelle, Carroll Morgan, Benjamin Lucien Kaminski, and Joost P Katoen. “A New Proof Rule for Almost-Sure Termination.” <i>Proceedings of the ACM on Programming Languages</i>. Association for Computing Machinery, 2017. <a href=\"https://doi.org/10.1145/3158121\">https://doi.org/10.1145/3158121</a>.","short":"A. Mciver, C. Morgan, B.L. Kaminski, J.P. Katoen, Proceedings of the ACM on Programming Languages 2 (2017).","ama":"Mciver A, Morgan C, Kaminski BL, Katoen JP. A new proof rule for almost-sure termination. <i>Proceedings of the ACM on Programming Languages</i>. 2017;2(POPL). doi:<a href=\"https://doi.org/10.1145/3158121\">10.1145/3158121</a>"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","_id":"10418","year":"2017","doi":"10.1145/3158121","conference":{"name":"POPL: Programming Languages","start_date":"2018-01-07","location":"Los Angeles, CA, United States","end_date":"2018-01-13"},"quality_controlled":"1","abstract":[{"lang":"eng","text":"We present a new proof rule for proving almost-sure termination of probabilistic programs, including those that contain demonic non-determinism. An important question for a probabilistic program is whether the probability mass of all its diverging runs is zero, that is that it terminates \"almost surely\". Proving that can be hard, and this paper presents a new method for doing so. It applies directly to the program's source code, even if the program contains demonic choice. Like others, we use variant functions (a.k.a. \"super-martingales\") that are real-valued and decrease randomly on each loop iteration; but our key innovation is that the amount as well as the probability of the decrease are parametric. We prove the soundness of the new rule, indicate where its applicability goes beyond existing rules, and explain its connection to classical results on denumerable (non-demonic) Markov chains."}],"intvolume":"         2","issue":"POPL","publication_status":"published","author":[{"last_name":"Mciver","full_name":"Mciver, Annabelle","first_name":"Annabelle"},{"last_name":"Morgan","full_name":"Morgan, Carroll","first_name":"Carroll"},{"first_name":"Benjamin Lucien","full_name":"Kaminski, Benjamin Lucien","last_name":"Kaminski"},{"orcid":"0000-0002-6143-1926","first_name":"Joost P","id":"4524F760-F248-11E8-B48F-1D18A9856A87","full_name":"Katoen, Joost P","last_name":"Katoen"}],"fulldoi":"https://doi.org/10.1145/3158121","oa_version":"Published Version","date_published":"2017-12-07T00:00:00Z"},{"language":[{"iso":"eng"}],"department":[{"_id":"NiBa"}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1101/081042"}],"month":"04","type":"journal_article","volume":71,"page":"845 - 858","date_created":"2018-12-11T11:49:57Z","publisher":"Wiley","publication_identifier":{"issn":["0014-3820"]},"ec_funded":1,"scopus_import":"1","title":"Evolutionary rescue in randomly mating, selfing, and clonal populations","das_tickbox":"1","date_updated":"2026-06-22T14:05:53Z","day":"01","oa":1,"publication_status":"published","author":[{"orcid":"0000-0001-9435-2813","first_name":"Hildegard","id":"2DB8F68A-F248-11E8-B48F-1D18A9856A87","full_name":"Uecker, Hildegard","last_name":"Uecker"}],"issue":"4","intvolume":"        71","abstract":[{"lang":"eng","text":"Severe environmental change can drive a population extinct unless the population adapts in time to the new conditions (“evolutionary rescue”). How does biparental sexual reproduction influence the chances of population persistence compared to clonal reproduction or selfing? In this article, we set up a one‐locus two‐allele model for adaptation in diploid species, where rescue is contingent on the establishment of the mutant homozygote. Reproduction can occur by random mating, selfing, or clonally. Random mating generates and destroys the rescue mutant; selfing is efficient at generating it but at the same time depletes the heterozygote, which can lead to a low mutant frequency in the standing genetic variation. Due to these (and other) antagonistic effects, we find a nontrivial dependence of population survival on the rate of sex/selfing, which is strongly influenced by the dominance coefficient of the mutation before and after the environmental change. Importantly, since mating with the wild‐type breaks the mutant homozygote up, a slow decay of the wild‐type population size can impede rescue in randomly mating populations."}],"project":[{"call_identifier":"FP7","_id":"25B07788-B435-11E9-9278-68D0E5697425","grant_number":"250152","name":"Limits to selection in biology and in evolutionary computation"}],"fulldoi":"https://doi.org/10.1111/evo.13191","date_published":"2017-04-01T00:00:00Z","isi":1,"biorxivid":1,"oa_version":"Submitted Version","doi":"10.1111/evo.13191","quality_controlled":"1","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"1063","year":"2017","publication":"Evolution","publist_id":"6327","citation":{"ama":"Uecker H. Evolutionary rescue in randomly mating, selfing, and clonal populations. <i>Evolution</i>. 2017;71(4):845-858. doi:<a href=\"https://doi.org/10.1111/evo.13191\">10.1111/evo.13191</a>","chicago":"Uecker, Hildegard. “Evolutionary Rescue in Randomly Mating, Selfing, and Clonal Populations.” <i>Evolution</i>. Wiley, 2017. <a href=\"https://doi.org/10.1111/evo.13191\">https://doi.org/10.1111/evo.13191</a>.","mla":"Uecker, Hildegard. “Evolutionary Rescue in Randomly Mating, Selfing, and Clonal Populations.” <i>Evolution</i>, vol. 71, no. 4, Wiley, 2017, pp. 845–58, doi:<a href=\"https://doi.org/10.1111/evo.13191\">10.1111/evo.13191</a>.","short":"H. Uecker, Evolution 71 (2017) 845–858.","ista":"Uecker H. 2017. Evolutionary rescue in randomly mating, selfing, and clonal populations. Evolution. 71(4), 845–858.","ieee":"H. Uecker, “Evolutionary rescue in randomly mating, selfing, and clonal populations,” <i>Evolution</i>, vol. 71, no. 4. Wiley, pp. 845–858, 2017.","apa":"Uecker, H. (2017). Evolutionary rescue in randomly mating, selfing, and clonal populations. <i>Evolution</i>. Wiley. <a href=\"https://doi.org/10.1111/evo.13191\">https://doi.org/10.1111/evo.13191</a>"},"external_id":{"biorxivid":["10.1101/081042"],"isi":["000398545200003"]},"article_processing_charge":"No"},{"date_updated":"2025-07-10T11:49:53Z","title":"Pushdown reachability with constant treewidth","oa":1,"day":"01","type":"journal_article","ddc":["000"],"month":"06","volume":122,"pubrep_id":"991","page":"25 - 29","date_created":"2018-12-11T11:49:57Z","language":[{"iso":"eng"}],"department":[{"_id":"KrCh"},{"_id":"HeEd"}],"file":[{"content_type":"application/pdf","relation":"main_file","file_id":"4998","file_size":247657,"date_updated":"2019-10-15T07:44:51Z","access_level":"open_access","date_created":"2018-12-12T10:13:17Z","file_name":"IST-2018-991-v1+2_2018_Chatterjee_Pushdown_PREPRINT.pdf","creator":"system"}],"file_date_updated":"2019-10-15T07:44:51Z","scopus_import":"1","has_accepted_license":"1","publisher":"Elsevier","publication_identifier":{"issn":["0020-0190"]},"ec_funded":1,"year":"2017","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","_id":"1065","citation":{"ama":"Chatterjee K, Osang GF. Pushdown reachability with constant treewidth. <i>Information Processing Letters</i>. 2017;122:25-29. doi:<a href=\"https://doi.org/10.1016/j.ipl.2017.02.003\">10.1016/j.ipl.2017.02.003</a>","apa":"Chatterjee, K., &#38; Osang, G. F. (2017). Pushdown reachability with constant treewidth. <i>Information Processing Letters</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.ipl.2017.02.003\">https://doi.org/10.1016/j.ipl.2017.02.003</a>","ista":"Chatterjee K, Osang GF. 2017. Pushdown reachability with constant treewidth. Information Processing Letters. 122, 25–29.","ieee":"K. Chatterjee and G. F. Osang, “Pushdown reachability with constant treewidth,” <i>Information Processing Letters</i>, vol. 122. Elsevier, pp. 25–29, 2017.","mla":"Chatterjee, Krishnendu, and Georg F. Osang. “Pushdown Reachability with Constant Treewidth.” <i>Information Processing Letters</i>, vol. 122, Elsevier, 2017, pp. 25–29, doi:<a href=\"https://doi.org/10.1016/j.ipl.2017.02.003\">10.1016/j.ipl.2017.02.003</a>.","chicago":"Chatterjee, Krishnendu, and Georg F Osang. “Pushdown Reachability with Constant Treewidth.” <i>Information Processing Letters</i>. Elsevier, 2017. <a href=\"https://doi.org/10.1016/j.ipl.2017.02.003\">https://doi.org/10.1016/j.ipl.2017.02.003</a>.","short":"K. Chatterjee, G.F. Osang, Information Processing Letters 122 (2017) 25–29."},"external_id":{"isi":["000399506600005"]},"article_processing_charge":"No","publication":"Information Processing Letters","publist_id":"6323","fulldoi":"https://doi.org/10.1016/j.ipl.2017.02.003","isi":1,"project":[{"grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"name":"Game Theory","grant_number":"S11407","call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307"}],"oa_version":"Submitted Version","date_published":"2017-06-01T00:00:00Z","author":[{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","first_name":"Krishnendu"},{"id":"464B40D6-F248-11E8-B48F-1D18A9856A87","full_name":"Osang, Georg F","last_name":"Osang","orcid":"0000-0002-8882-5116","first_name":"Georg F"}],"publication_status":"published","abstract":[{"text":"We consider the problem of reachability in pushdown graphs. We study the problem for pushdown graphs with constant treewidth. Even for pushdown graphs with treewidth 1, for the reachability problem we establish the following: (i) the problem is PTIME-complete, and (ii) any subcubic algorithm for the problem would contradict the k-clique conjecture and imply faster combinatorial algorithms for cliques in graphs.","lang":"eng"}],"intvolume":"       122","doi":"10.1016/j.ipl.2017.02.003","quality_controlled":"1"},{"corr_author":"1","OA_place":"publisher","scopus_import":"1","ec_funded":1,"publisher":"Elsevier","date_created":"2018-12-11T11:49:58Z","page":"143 - 166","acknowledgement":"This research was funded in part by the European Research Council (ERC) under grant agreements 267989 (QUAREM), 279307 (Graph Games), by the Austrian Science Fund (FWF) projects S11402-N23 (RiSE), S11407-N23 (RiSE), P23499-N23, and Microsoft faculty fellows award.","article_type":"original","volume":254,"ddc":["000"],"type":"journal_article","month":"06","main_file_link":[{"url":"https://doi.org/10.1016/j.ic.2016.10.006","open_access":"1"}],"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"language":[{"iso":"eng"}],"oa":1,"related_material":{"record":[{"id":"5428","relation":"earlier_version","status":"public"}]},"day":"01","date_updated":"2026-06-18T08:47:01Z","title":"Quantitative fair simulation games","quality_controlled":"1","doi":"10.1016/j.ic.2016.10.006","fulldoi":"https://doi.org/10.1016/j.ic.2016.10.006","project":[{"grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"grant_number":"267989","name":"Quantitative Reactive Modeling","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"oa_version":"Published Version","isi":1,"date_published":"2017-06-01T00:00:00Z","abstract":[{"text":"Simulation is an attractive alternative to language inclusion for automata as it is an under-approximation of language inclusion, but usually has much lower complexity. Simulation has also been extended in two orthogonal directions, namely, (1) fair simulation, for simulation over specified set of infinite runs; and (2) quantitative simulation, for simulation between weighted automata. While fair trace inclusion is PSPACE-complete, fair simulation can be computed in polynomial time. For weighted automata, the (quantitative) language inclusion problem is undecidable in general, whereas the (quantitative) simulation reduces to quantitative games, which admit pseudo-polynomial time algorithms.\r\n\r\nIn this work, we study (quantitative) simulation for weighted automata with Büchi acceptance conditions, i.e., we generalize fair simulation from non-weighted automata to weighted automata. We show that imposing Büchi acceptance conditions on weighted automata changes many fundamental properties of the simulation games, yet they still admit pseudo-polynomial time algorithms.","lang":"eng"}],"intvolume":"       254","issue":"2","publication_status":"published","author":[{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","orcid":"0000-0002-4561-241X"},{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","orcid":"0000−0002−2985−7724","first_name":"Thomas A"},{"first_name":"Jan","full_name":"Otop, Jan","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","last_name":"Otop"},{"first_name":"Yaron","full_name":"Velner, Yaron","last_name":"Velner"}],"article_processing_charge":"No","external_id":{"isi":["000402025600002"]},"citation":{"ieee":"K. Chatterjee, T. A. Henzinger, J. Otop, and Y. Velner, “Quantitative fair simulation games,” <i>Information and Computation</i>, vol. 254, no. 2. Elsevier, pp. 143–166, 2017.","apa":"Chatterjee, K., Henzinger, T. A., Otop, J., &#38; Velner, Y. (2017). Quantitative fair simulation games. <i>Information and Computation</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.ic.2016.10.006\">https://doi.org/10.1016/j.ic.2016.10.006</a>","ista":"Chatterjee K, Henzinger TA, Otop J, Velner Y. 2017. Quantitative fair simulation games. Information and Computation. 254(2), 143–166.","mla":"Chatterjee, Krishnendu, et al. “Quantitative Fair Simulation Games.” <i>Information and Computation</i>, vol. 254, no. 2, Elsevier, 2017, pp. 143–66, doi:<a href=\"https://doi.org/10.1016/j.ic.2016.10.006\">10.1016/j.ic.2016.10.006</a>.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, Jan Otop, and Yaron Velner. “Quantitative Fair Simulation Games.” <i>Information and Computation</i>. Elsevier, 2017. <a href=\"https://doi.org/10.1016/j.ic.2016.10.006\">https://doi.org/10.1016/j.ic.2016.10.006</a>.","short":"K. Chatterjee, T.A. Henzinger, J. Otop, Y. Velner, Information and Computation 254 (2017) 143–166.","ama":"Chatterjee K, Henzinger TA, Otop J, Velner Y. Quantitative fair simulation games. <i>Information and Computation</i>. 2017;254(2):143-166. doi:<a href=\"https://doi.org/10.1016/j.ic.2016.10.006\">10.1016/j.ic.2016.10.006</a>"},"publist_id":"6322","publication":"Information and Computation","year":"2017","OA_type":"free access","_id":"1066","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public"},{"ddc":["572","597"],"month":"02","type":"journal_article","date_created":"2018-12-11T11:49:58Z","page":"354 - 366","volume":40,"pubrep_id":"869","department":[{"_id":"CaHe"}],"language":[{"iso":"eng"}],"file":[{"file_name":"IST-2017-869-v1+1_1-s2.0-S1534580717300370-main.pdf","creator":"system","date_updated":"2018-12-12T10:10:57Z","access_level":"open_access","date_created":"2018-12-12T10:10:57Z","file_size":6866187,"file_id":"4849","content_type":"application/pdf","relation":"main_file"}],"acknowledged_ssus":[{"_id":"PreCl"}],"corr_author":"1","scopus_import":"1","file_date_updated":"2018-12-12T10:10:57Z","has_accepted_license":"1","publisher":"Cell Press","ec_funded":1,"publication_identifier":{"issn":["1534-5807"]},"date_updated":"2025-07-10T11:49:55Z","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"title":"The physical basis of coordinated tissue spreading in zebrafish gastrulation","oa":1,"day":"27","fulldoi":"https://doi.org/10.1016/j.devcel.2017.01.010","isi":1,"project":[{"name":"Developing High-Throughput Bioassays for Human Cancers in Zebrafish","grant_number":"201439","call_identifier":"FP7","_id":"2524F500-B435-11E9-9278-68D0E5697425"}],"date_published":"2017-02-27T00:00:00Z","oa_version":"Published Version","publication_status":"published","issue":"4","author":[{"full_name":"Morita, Hitoshi","id":"4C6E54C6-F248-11E8-B48F-1D18A9856A87","last_name":"Morita","first_name":"Hitoshi"},{"full_name":"Grigolon, Silvia","last_name":"Grigolon","first_name":"Silvia"},{"last_name":"Bock","full_name":"Bock, Martin","first_name":"Martin"},{"first_name":"Gabriel","orcid":"0000-0003-4761-5996","last_name":"Krens","id":"2B819732-F248-11E8-B48F-1D18A9856A87","full_name":"Krens, Gabriel"},{"first_name":"Guillaume","last_name":"Salbreux","full_name":"Salbreux, Guillaume"},{"id":"39427864-F248-11E8-B48F-1D18A9856A87","full_name":"Heisenberg, Carl-Philipp J","last_name":"Heisenberg","orcid":"0000-0002-0912-4566","first_name":"Carl-Philipp J"}],"abstract":[{"lang":"eng","text":"Embryo morphogenesis relies on highly coordinated movements of different tissues. However, remarkably little is known about how tissues coordinate their movements to shape the embryo. In zebrafish embryogenesis, coordinated tissue movements first become apparent during “doming,” when the blastoderm begins to spread over the yolk sac, a process involving coordinated epithelial surface cell layer expansion and mesenchymal deep cell intercalations. Here, we find that active surface cell expansion represents the key process coordinating tissue movements during doming. By using a combination of theory and experiments, we show that epithelial surface cells not only trigger blastoderm expansion by reducing tissue surface tension, but also drive blastoderm thinning by inducing tissue contraction through radial deep cell intercalations. Thus, coordinated tissue expansion and thinning during doming relies on surface cells simultaneously controlling tissue surface tension and radial tissue contraction."}],"intvolume":"        40","quality_controlled":"1","doi":"10.1016/j.devcel.2017.01.010","year":"2017","_id":"1067","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"short":"H. Morita, S. Grigolon, M. Bock, G. Krens, G. Salbreux, C.-P.J. Heisenberg, Developmental Cell 40 (2017) 354–366.","mla":"Morita, Hitoshi, et al. “The Physical Basis of Coordinated Tissue Spreading in Zebrafish Gastrulation.” <i>Developmental Cell</i>, vol. 40, no. 4, Cell Press, 2017, pp. 354–66, doi:<a href=\"https://doi.org/10.1016/j.devcel.2017.01.010\">10.1016/j.devcel.2017.01.010</a>.","chicago":"Morita, Hitoshi, Silvia Grigolon, Martin Bock, Gabriel Krens, Guillaume Salbreux, and Carl-Philipp J Heisenberg. “The Physical Basis of Coordinated Tissue Spreading in Zebrafish Gastrulation.” <i>Developmental Cell</i>. Cell Press, 2017. <a href=\"https://doi.org/10.1016/j.devcel.2017.01.010\">https://doi.org/10.1016/j.devcel.2017.01.010</a>.","ista":"Morita H, Grigolon S, Bock M, Krens G, Salbreux G, Heisenberg C-PJ. 2017. The physical basis of coordinated tissue spreading in zebrafish gastrulation. Developmental Cell. 40(4), 354–366.","apa":"Morita, H., Grigolon, S., Bock, M., Krens, G., Salbreux, G., &#38; Heisenberg, C.-P. J. (2017). The physical basis of coordinated tissue spreading in zebrafish gastrulation. <i>Developmental Cell</i>. Cell Press. <a href=\"https://doi.org/10.1016/j.devcel.2017.01.010\">https://doi.org/10.1016/j.devcel.2017.01.010</a>","ieee":"H. Morita, S. Grigolon, M. Bock, G. Krens, G. Salbreux, and C.-P. J. Heisenberg, “The physical basis of coordinated tissue spreading in zebrafish gastrulation,” <i>Developmental Cell</i>, vol. 40, no. 4. Cell Press, pp. 354–366, 2017.","ama":"Morita H, Grigolon S, Bock M, Krens G, Salbreux G, Heisenberg C-PJ. The physical basis of coordinated tissue spreading in zebrafish gastrulation. <i>Developmental Cell</i>. 2017;40(4):354-366. doi:<a href=\"https://doi.org/10.1016/j.devcel.2017.01.010\">10.1016/j.devcel.2017.01.010</a>"},"article_processing_charge":"No","external_id":{"isi":["000395368300007"]},"publication":"Developmental Cell","publist_id":"6320"},{"year":"2017","status":"public","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"1072","citation":{"ama":"Bauer U, Edelsbrunner H. The Morse theory of Čech and delaunay complexes. <i>Transactions of the American Mathematical Society</i>. 2017;369(5):3741-3762. doi:<a href=\"https://doi.org/10.1090/tran/6991\">10.1090/tran/6991</a>","apa":"Bauer, U., &#38; Edelsbrunner, H. (2017). The Morse theory of Čech and delaunay complexes. <i>Transactions of the American Mathematical Society</i>. American Mathematical Society. <a href=\"https://doi.org/10.1090/tran/6991\">https://doi.org/10.1090/tran/6991</a>","ieee":"U. Bauer and H. Edelsbrunner, “The Morse theory of Čech and delaunay complexes,” <i>Transactions of the American Mathematical Society</i>, vol. 369, no. 5. American Mathematical Society, pp. 3741–3762, 2017.","ista":"Bauer U, Edelsbrunner H. 2017. The Morse theory of Čech and delaunay complexes. Transactions of the American Mathematical Society. 369(5), 3741–3762.","mla":"Bauer, Ulrich, and Herbert Edelsbrunner. “The Morse Theory of Čech and Delaunay Complexes.” <i>Transactions of the American Mathematical Society</i>, vol. 369, no. 5, American Mathematical Society, 2017, pp. 3741–62, doi:<a href=\"https://doi.org/10.1090/tran/6991\">10.1090/tran/6991</a>.","chicago":"Bauer, Ulrich, and Herbert Edelsbrunner. “The Morse Theory of Čech and Delaunay Complexes.” <i>Transactions of the American Mathematical Society</i>. American Mathematical Society, 2017. <a href=\"https://doi.org/10.1090/tran/6991\">https://doi.org/10.1090/tran/6991</a>.","short":"U. Bauer, H. Edelsbrunner, Transactions of the American Mathematical Society 369 (2017) 3741–3762."},"external_id":{"arxiv":["1312.1231"],"isi":["000398030400024"]},"article_processing_charge":"No","publication":"Transactions of the American Mathematical Society","publist_id":"6311","fulldoi":"https://doi.org/10.1090/tran/6991","project":[{"name":"Topological Complex Systems","grant_number":"318493","call_identifier":"FP7","_id":"255D761E-B435-11E9-9278-68D0E5697425"}],"oa_version":"Preprint","isi":1,"date_published":"2017-05-01T00:00:00Z","publication_status":"published","issue":"5","author":[{"first_name":"Ulrich","orcid":"0000-0002-9683-0724","last_name":"Bauer","full_name":"Bauer, Ulrich","id":"2ADD483A-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","first_name":"Herbert"}],"abstract":[{"text":"Given a finite set of points in Rn and a radius parameter, we study the Čech, Delaunay–Čech, Delaunay (or alpha), and Wrap complexes in the light of generalized discrete Morse theory. Establishing the Čech and Delaunay complexes as sublevel sets of generalized discrete Morse functions, we prove that the four complexes are simple-homotopy equivalent by a sequence of simplicial collapses, which are explicitly described by a single discrete gradient field.","lang":"eng"}],"intvolume":"       369","doi":"10.1090/tran/6991","quality_controlled":"1","date_updated":"2025-04-15T08:37:54Z","title":"The Morse theory of Čech and delaunay complexes","oa":1,"day":"01","month":"05","type":"journal_article","volume":369,"acknowledgement":"This research has been supported by the EU project Toposys(FP7-ICT-318493-STREP), by ESF under the ACAT Research Network Programme, by the Russian Government under mega project 11.G34.31.0053, and by the DFG Collaborative Research Center SFB/TRR 109 “Discretization in Geometry and Dynamics”.","article_type":"original","date_created":"2018-12-11T11:49:59Z","page":"3741 - 3762","arxiv":1,"language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1312.1231"}],"department":[{"_id":"HeEd"}],"scopus_import":"1","publisher":"American Mathematical Society","ec_funded":1},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","_id":"1073","year":"2017","publist_id":"6309","publication":"Discrete & Computational Geometry","external_id":{"arxiv":["1307.6444"],"isi":["000400072700008"]},"article_processing_charge":"No","citation":{"ama":"Čadek M, Krcál M, Vokřínek L. Algorithmic solvability of the lifting extension problem. <i>Discrete &#38; Computational Geometry</i>. 2017;54(4):915-965. doi:<a href=\"https://doi.org/10.1007/s00454-016-9855-6\">10.1007/s00454-016-9855-6</a>","short":"M. Čadek, M. Krcál, L. Vokřínek, Discrete &#38; Computational Geometry 54 (2017) 915–965.","chicago":"Čadek, Martin, Marek Krcál, and Lukáš Vokřínek. “Algorithmic Solvability of the Lifting Extension Problem.” <i>Discrete &#38; Computational Geometry</i>. Springer, 2017. <a href=\"https://doi.org/10.1007/s00454-016-9855-6\">https://doi.org/10.1007/s00454-016-9855-6</a>.","mla":"Čadek, Martin, et al. “Algorithmic Solvability of the Lifting Extension Problem.” <i>Discrete &#38; Computational Geometry</i>, vol. 54, no. 4, Springer, 2017, pp. 915–65, doi:<a href=\"https://doi.org/10.1007/s00454-016-9855-6\">10.1007/s00454-016-9855-6</a>.","ieee":"M. Čadek, M. Krcál, and L. Vokřínek, “Algorithmic solvability of the lifting extension problem,” <i>Discrete &#38; Computational Geometry</i>, vol. 54, no. 4. Springer, pp. 915–965, 2017.","apa":"Čadek, M., Krcál, M., &#38; Vokřínek, L. (2017). Algorithmic solvability of the lifting extension problem. <i>Discrete &#38; Computational Geometry</i>. Springer. <a href=\"https://doi.org/10.1007/s00454-016-9855-6\">https://doi.org/10.1007/s00454-016-9855-6</a>","ista":"Čadek M, Krcál M, Vokřínek L. 2017. Algorithmic solvability of the lifting extension problem. Discrete &#38; Computational Geometry. 54(4), 915–965."},"intvolume":"        54","abstract":[{"text":"Let X and Y be finite simplicial sets (e.g. finite simplicial complexes), both equipped with a free simplicial action of a finite group G. Assuming that Y is d-connected and dimX≤2d, for some d≥1, we provide an algorithm that computes the set of all equivariant homotopy classes of equivariant continuous maps |X|→|Y|; the existence of such a map can be decided even for dimX≤2d+1. This yields the first algorithm for deciding topological embeddability of a k-dimensional finite simplicial complex into Rn under the condition k≤23n−1. More generally, we present an algorithm that, given a lifting-extension problem satisfying an appropriate stability assumption, computes the set of all homotopy classes of solutions. This result is new even in the non-equivariant situation.","lang":"eng"}],"publication_status":"published","author":[{"first_name":"Martin","last_name":"Čadek","full_name":"Čadek, Martin"},{"id":"33E21118-F248-11E8-B48F-1D18A9856A87","full_name":"Krcál, Marek","last_name":"Krcál","first_name":"Marek"},{"first_name":"Lukáš","last_name":"Vokřínek","full_name":"Vokřínek, Lukáš"}],"issue":"4","fulldoi":"https://doi.org/10.1007/s00454-016-9855-6","oa_version":"Submitted Version","date_published":"2017-06-01T00:00:00Z","isi":1,"doi":"10.1007/s00454-016-9855-6","quality_controlled":"1","title":"Algorithmic solvability of the lifting extension problem","date_updated":"2025-06-04T08:11:10Z","day":"01","oa":1,"language":[{"iso":"eng"}],"arxiv":1,"main_file_link":[{"url":"https://arxiv.org/abs/1307.6444","open_access":"1"}],"department":[{"_id":"UlWa"}],"volume":54,"date_created":"2018-12-11T11:50:00Z","page":"915 - 965","type":"journal_article","month":"06","publication_identifier":{"issn":["01795376"]},"publisher":"Springer","scopus_import":"1"}]