[{"intvolume":"       161","publication":"Cell","page":"431 - 432","date_created":"2018-12-11T11:52:50Z","isi":1,"month":"04","corr_author":"1","title":"Gradients are shaping up","abstract":[{"lang":"eng","text":"In animal embryos, morphogen gradients determine tissue patterning and morphogenesis. Shyer et al. provide evidence that, during vertebrate gut formation, tissue folding generates graded activity of signals required for subsequent steps of gut growth and differentiation, thereby revealing an intriguing link between tissue morphogenesis and morphogen gradient formation."}],"external_id":{"isi":["000353553600003"]},"doi":"10.1016/j.cell.2015.04.009","oa_version":"None","language":[{"iso":"eng"}],"scopus_import":"1","date_updated":"2025-09-23T09:10:31Z","publication_status":"published","citation":{"ama":"Bollenbach MT, Heisenberg C-PJ. Gradients are shaping up. <i>Cell</i>. 2015;161(3):431-432. doi:<a href=\"https://doi.org/10.1016/j.cell.2015.04.009\">10.1016/j.cell.2015.04.009</a>","ista":"Bollenbach MT, Heisenberg C-PJ. 2015. Gradients are shaping up. Cell. 161(3), 431–432.","short":"M.T. Bollenbach, C.-P.J. Heisenberg, Cell 161 (2015) 431–432.","chicago":"Bollenbach, Mark Tobias, and Carl-Philipp J Heisenberg. “Gradients Are Shaping Up.” <i>Cell</i>. Cell Press, 2015. <a href=\"https://doi.org/10.1016/j.cell.2015.04.009\">https://doi.org/10.1016/j.cell.2015.04.009</a>.","ieee":"M. T. Bollenbach and C.-P. J. Heisenberg, “Gradients are shaping up,” <i>Cell</i>, vol. 161, no. 3. Cell Press, pp. 431–432, 2015.","apa":"Bollenbach, M. T., &#38; Heisenberg, C.-P. J. (2015). Gradients are shaping up. <i>Cell</i>. Cell Press. <a href=\"https://doi.org/10.1016/j.cell.2015.04.009\">https://doi.org/10.1016/j.cell.2015.04.009</a>","mla":"Bollenbach, Mark Tobias, and Carl-Philipp J. Heisenberg. “Gradients Are Shaping Up.” <i>Cell</i>, vol. 161, no. 3, Cell Press, 2015, pp. 431–32, doi:<a href=\"https://doi.org/10.1016/j.cell.2015.04.009\">10.1016/j.cell.2015.04.009</a>."},"type":"journal_article","quality_controlled":"1","issue":"3","status":"public","volume":161,"publist_id":"5590","department":[{"_id":"ToBo"},{"_id":"CaHe"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","day":"23","year":"2015","date_published":"2015-04-23T00:00:00Z","publisher":"Cell Press","article_processing_charge":"No","_id":"1581","author":[{"full_name":"Bollenbach, Mark Tobias","last_name":"Bollenbach","first_name":"Mark Tobias","id":"3E6DB97A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4398-476X"},{"last_name":"Heisenberg","full_name":"Heisenberg, Carl-Philipp J","orcid":"0000-0002-0912-4566","id":"39427864-F248-11E8-B48F-1D18A9856A87","first_name":"Carl-Philipp J"}]},{"intvolume":"        48","oa":1,"publication":"Computational Geometry: Theory and Applications","page":"120 - 133","date_created":"2018-12-11T11:52:51Z","ddc":["000"],"isi":1,"month":"02","title":"Weighted straight skeletons in the plane","abstract":[{"text":"We investigate weighted straight skeletons from a geometric, graph-theoretical, and combinatorial point of view. We start with a thorough definition and shed light on some ambiguity issues in the procedural definition. We investigate the geometry, combinatorics, and topology of faces and the roof model, and we discuss in which cases a weighted straight skeleton is connected. Finally, we show that the weighted straight skeleton of even a simple polygon may be non-planar and may contain cycles, and we discuss under which restrictions on the weights and/or the input polygon the weighted straight skeleton still behaves similar to its unweighted counterpart. In particular, we obtain a non-procedural description and a linear-time construction algorithm for the straight skeleton of strictly convex polygons with arbitrary weights.","lang":"eng"}],"external_id":{"isi":["000345056700007"]},"doi":"10.1016/j.comgeo.2014.08.006","oa_version":"Published Version","language":[{"iso":"eng"}],"scopus_import":"1","date_updated":"2025-09-29T11:06:26Z","publication_status":"published","citation":{"ama":"Biedl T, Held M, Huber S, Kaaser D, Palfrader P. Weighted straight skeletons in the plane. <i>Computational Geometry: Theory and Applications</i>. 2015;48(2):120-133. doi:<a href=\"https://doi.org/10.1016/j.comgeo.2014.08.006\">10.1016/j.comgeo.2014.08.006</a>","ista":"Biedl T, Held M, Huber S, Kaaser D, Palfrader P. 2015. Weighted straight skeletons in the plane. Computational Geometry: Theory and Applications. 48(2), 120–133.","apa":"Biedl, T., Held, M., Huber, S., Kaaser, D., &#38; Palfrader, P. (2015). Weighted straight skeletons in the plane. <i>Computational Geometry: Theory and Applications</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.comgeo.2014.08.006\">https://doi.org/10.1016/j.comgeo.2014.08.006</a>","ieee":"T. Biedl, M. Held, S. Huber, D. Kaaser, and P. Palfrader, “Weighted straight skeletons in the plane,” <i>Computational Geometry: Theory and Applications</i>, vol. 48, no. 2. Elsevier, pp. 120–133, 2015.","chicago":"Biedl, Therese, Martin Held, Stefan Huber, Dominik Kaaser, and Peter Palfrader. “Weighted Straight Skeletons in the Plane.” <i>Computational Geometry: Theory and Applications</i>. Elsevier, 2015. <a href=\"https://doi.org/10.1016/j.comgeo.2014.08.006\">https://doi.org/10.1016/j.comgeo.2014.08.006</a>.","short":"T. Biedl, M. Held, S. Huber, D. Kaaser, P. Palfrader, Computational Geometry: Theory and Applications 48 (2015) 120–133.","mla":"Biedl, Therese, et al. “Weighted Straight Skeletons in the Plane.” <i>Computational Geometry: Theory and Applications</i>, vol. 48, no. 2, Elsevier, 2015, pp. 120–33, doi:<a href=\"https://doi.org/10.1016/j.comgeo.2014.08.006\">10.1016/j.comgeo.2014.08.006</a>."},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"journal_article","quality_controlled":"1","has_accepted_license":"1","issue":"2","related_material":{"record":[{"id":"1584","status":"public","relation":"other"}]},"license":"https://creativecommons.org/licenses/by/4.0/","file":[{"relation":"main_file","file_id":"5215","creator":"system","file_name":"IST-2016-474-v1+1_1-s2.0-S0925772114000807-main.pdf","content_type":"application/pdf","checksum":"c1ef67f6ec925e12f73a96b8fe285ab4","file_size":505987,"date_created":"2018-12-12T10:16:28Z","date_updated":"2020-07-14T12:45:02Z","access_level":"open_access"}],"status":"public","file_date_updated":"2020-07-14T12:45:02Z","volume":48,"publist_id":"5589","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","department":[{"_id":"HeEd"}],"year":"2015","day":"01","pubrep_id":"474","date_published":"2015-02-01T00:00:00Z","publisher":"Elsevier","author":[{"first_name":"Therese","full_name":"Biedl, Therese","last_name":"Biedl"},{"last_name":"Held","full_name":"Held, Martin","first_name":"Martin"},{"orcid":"0000-0002-8871-5814","first_name":"Stefan","id":"4700A070-F248-11E8-B48F-1D18A9856A87","last_name":"Huber","full_name":"Huber, Stefan"},{"first_name":"Dominik","full_name":"Kaaser, Dominik","last_name":"Kaaser"},{"first_name":"Peter","full_name":"Palfrader, Peter","last_name":"Palfrader"}],"_id":"1582","article_processing_charge":"No"},{"_id":"1583","article_processing_charge":"No","author":[{"last_name":"Biedl","full_name":"Biedl, Therese","first_name":"Therese"},{"first_name":"Martin","last_name":"Held","full_name":"Held, Martin"},{"full_name":"Huber, Stefan","last_name":"Huber","first_name":"Stefan","id":"4700A070-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8871-5814"},{"first_name":"Dominik","last_name":"Kaaser","full_name":"Kaaser, Dominik"},{"full_name":"Palfrader, Peter","last_name":"Palfrader","first_name":"Peter"}],"publisher":"Elsevier","date_published":"2015-02-01T00:00:00Z","pubrep_id":"473","day":"01","year":"2015","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","department":[{"_id":"HeEd"}],"publist_id":"5588","file_date_updated":"2020-07-14T12:45:03Z","volume":115,"status":"public","file":[{"date_created":"2018-12-12T10:18:45Z","file_size":270137,"access_level":"open_access","date_updated":"2020-07-14T12:45:03Z","file_id":"5367","relation":"main_file","checksum":"2779a648610c9b5c86d0b51a62816d23","file_name":"IST-2016-473-v1+1_1-s2.0-S0020019014001987-main.pdf","content_type":"application/pdf","creator":"system"}],"issue":"2","has_accepted_license":"1","quality_controlled":"1","type":"journal_article","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"citation":{"mla":"Biedl, Therese, et al. “A Simple Algorithm for Computing Positively Weighted Straight Skeletons of Monotone Polygons.” <i>Information Processing Letters</i>, vol. 115, no. 2, Elsevier, 2015, pp. 243–47, doi:<a href=\"https://doi.org/10.1016/j.ipl.2014.09.021\">10.1016/j.ipl.2014.09.021</a>.","ista":"Biedl T, Held M, Huber S, Kaaser D, Palfrader P. 2015. A simple algorithm for computing positively weighted straight skeletons of monotone polygons. Information Processing Letters. 115(2), 243–247.","ama":"Biedl T, Held M, Huber S, Kaaser D, Palfrader P. A simple algorithm for computing positively weighted straight skeletons of monotone polygons. <i>Information Processing Letters</i>. 2015;115(2):243-247. doi:<a href=\"https://doi.org/10.1016/j.ipl.2014.09.021\">10.1016/j.ipl.2014.09.021</a>","ieee":"T. Biedl, M. Held, S. Huber, D. Kaaser, and P. Palfrader, “A simple algorithm for computing positively weighted straight skeletons of monotone polygons,” <i>Information Processing Letters</i>, vol. 115, no. 2. Elsevier, pp. 243–247, 2015.","apa":"Biedl, T., Held, M., Huber, S., Kaaser, D., &#38; Palfrader, P. (2015). A simple algorithm for computing positively weighted straight skeletons of monotone polygons. <i>Information Processing Letters</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.ipl.2014.09.021\">https://doi.org/10.1016/j.ipl.2014.09.021</a>","chicago":"Biedl, Therese, Martin Held, Stefan Huber, Dominik Kaaser, and Peter Palfrader. “A Simple Algorithm for Computing Positively Weighted Straight Skeletons of Monotone Polygons.” <i>Information Processing Letters</i>. Elsevier, 2015. <a href=\"https://doi.org/10.1016/j.ipl.2014.09.021\">https://doi.org/10.1016/j.ipl.2014.09.021</a>.","short":"T. Biedl, M. Held, S. Huber, D. Kaaser, P. Palfrader, Information Processing Letters 115 (2015) 243–247."},"publication_status":"published","date_updated":"2025-09-22T14:35:14Z","scopus_import":"1","language":[{"iso":"eng"}],"oa_version":"Published Version","doi":"10.1016/j.ipl.2014.09.021","external_id":{"isi":["000346225300034"]},"title":"A simple algorithm for computing positively weighted straight skeletons of monotone polygons","abstract":[{"lang":"eng","text":"We study the characteristics of straight skeletons of monotone polygonal chains and use them to devise an algorithm for computing positively weighted straight skeletons of monotone polygons. Our algorithm runs in O(nlogn) time and O(n) space, where n denotes the number of vertices of the polygon."}],"month":"02","ddc":["000"],"isi":1,"date_created":"2018-12-11T11:52:51Z","publication":"Information Processing Letters","page":"243 - 247","oa":1,"intvolume":"       115"},{"citation":{"mla":"Biedl, Therese, et al. “Reprint of: Weighted Straight Skeletons in the Plane.” <i>Computational Geometry: Theory and Applications</i>, vol. 48, no. 5, Elsevier, 2015, pp. 429–42, doi:<a href=\"https://doi.org/10.1016/j.comgeo.2015.01.004\">10.1016/j.comgeo.2015.01.004</a>.","ista":"Biedl T, Held M, Huber S, Kaaser D, Palfrader P. 2015. Reprint of: Weighted straight skeletons in the plane. Computational Geometry: Theory and Applications. 48(5), 429–442.","ama":"Biedl T, Held M, Huber S, Kaaser D, Palfrader P. Reprint of: Weighted straight skeletons in the plane. <i>Computational Geometry: Theory and Applications</i>. 2015;48(5):429-442. doi:<a href=\"https://doi.org/10.1016/j.comgeo.2015.01.004\">10.1016/j.comgeo.2015.01.004</a>","chicago":"Biedl, Therese, Martin Held, Stefan Huber, Dominik Kaaser, and Peter Palfrader. “Reprint of: Weighted Straight Skeletons in the Plane.” <i>Computational Geometry: Theory and Applications</i>. Elsevier, 2015. <a href=\"https://doi.org/10.1016/j.comgeo.2015.01.004\">https://doi.org/10.1016/j.comgeo.2015.01.004</a>.","short":"T. Biedl, M. Held, S. Huber, D. Kaaser, P. Palfrader, Computational Geometry: Theory and Applications 48 (2015) 429–442.","ieee":"T. Biedl, M. Held, S. Huber, D. Kaaser, and P. Palfrader, “Reprint of: Weighted straight skeletons in the plane,” <i>Computational Geometry: Theory and Applications</i>, vol. 48, no. 5. Elsevier, pp. 429–442, 2015.","apa":"Biedl, T., Held, M., Huber, S., Kaaser, D., &#38; Palfrader, P. (2015). Reprint of: Weighted straight skeletons in the plane. <i>Computational Geometry: Theory and Applications</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.comgeo.2015.01.004\">https://doi.org/10.1016/j.comgeo.2015.01.004</a>"},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"quality_controlled":"1","type":"journal_article","has_accepted_license":"1","issue":"5","related_material":{"record":[{"relation":"other","status":"public","id":"1582"}]},"status":"public","file":[{"creator":"system","file_name":"IST-2016-475-v1+1_1-s2.0-S092577211500005X-main.pdf","checksum":"5b33719a86f7f4c8e5dc62c1b6893f49","content_type":"application/pdf","relation":"main_file","file_id":"5292","date_updated":"2020-07-14T12:45:03Z","access_level":"open_access","file_size":508379,"date_created":"2018-12-12T10:17:36Z"}],"volume":48,"file_date_updated":"2020-07-14T12:45:03Z","publist_id":"5587","department":[{"_id":"HeEd"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_published":"2015-07-01T00:00:00Z","pubrep_id":"475","day":"01","year":"2015","publisher":"Elsevier","article_processing_charge":"No","_id":"1584","author":[{"first_name":"Therese","full_name":"Biedl, Therese","last_name":"Biedl"},{"first_name":"Martin","last_name":"Held","full_name":"Held, Martin"},{"full_name":"Huber, Stefan","last_name":"Huber","id":"4700A070-F248-11E8-B48F-1D18A9856A87","first_name":"Stefan","orcid":"0000-0002-8871-5814"},{"last_name":"Kaaser","full_name":"Kaaser, Dominik","first_name":"Dominik"},{"full_name":"Palfrader, Peter","last_name":"Palfrader","first_name":"Peter"}],"intvolume":"        48","oa":1,"date_created":"2018-12-11T11:52:51Z","publication":"Computational Geometry: Theory and Applications","page":"429 - 442","month":"07","isi":1,"ddc":["000"],"title":"Reprint of: Weighted straight skeletons in the plane","abstract":[{"lang":"eng","text":"We investigate weighted straight skeletons from a geometric, graph-theoretical, and combinatorial point of view. We start with a thorough definition and shed light on some ambiguity issues in the procedural definition. We investigate the geometry, combinatorics, and topology of faces and the roof model, and we discuss in which cases a weighted straight skeleton is connected. Finally, we show that the weighted straight skeleton of even a simple polygon may be non-planar and may contain cycles, and we discuss under which restrictions on the weights and/or the input polygon the weighted straight skeleton still behaves similar to its unweighted counterpart. In particular, we obtain a non-procedural description and a linear-time construction algorithm for the straight skeleton of strictly convex polygons with arbitrary weights."}],"external_id":{"isi":["000351967400008"]},"doi":"10.1016/j.comgeo.2015.01.004","language":[{"iso":"eng"}],"oa_version":"Published Version","scopus_import":"1","publication_status":"published","date_updated":"2025-09-29T11:06:25Z"},{"date_created":"2018-12-11T11:52:52Z","publication":"IEEE Transactions on Information Theory","page":"3413 - 3426","month":"06","isi":1,"intvolume":"        61","language":[{"iso":"eng"}],"oa_version":"None","scopus_import":"1","date_updated":"2025-09-23T07:57:31Z","publication_status":"published","title":"Asymptotic mutual information statistics of MIMO channels and CLT of sample covariance matrices","abstract":[{"text":"In this paper, we consider the fluctuation of mutual information statistics of a multiple input multiple output channel communication systems without assuming that the entries of the channel matrix have zero pseudovariance. To this end, we also establish a central limit theorem of the linear spectral statistics for sample covariance matrices under general moment conditions by removing the restrictions imposed on the second moment and fourth moment on the matrix entries in Bai and Silverstein (2004).","lang":"eng"}],"external_id":{"isi":["000354943600029"]},"doi":"10.1109/TIT.2015.2421894","issue":"6","citation":{"ieee":"Z. Bao, G. Pan, and W. Zhou, “Asymptotic mutual information statistics of MIMO channels and CLT of sample covariance matrices,” <i>IEEE Transactions on Information Theory</i>, vol. 61, no. 6. IEEE, pp. 3413–3426, 2015.","apa":"Bao, Z., Pan, G., &#38; Zhou, W. (2015). Asymptotic mutual information statistics of MIMO channels and CLT of sample covariance matrices. <i>IEEE Transactions on Information Theory</i>. IEEE. <a href=\"https://doi.org/10.1109/TIT.2015.2421894\">https://doi.org/10.1109/TIT.2015.2421894</a>","chicago":"Bao, Zhigang, Guangming Pan, and Wang Zhou. “Asymptotic Mutual Information Statistics of MIMO Channels and CLT of Sample Covariance Matrices.” <i>IEEE Transactions on Information Theory</i>. IEEE, 2015. <a href=\"https://doi.org/10.1109/TIT.2015.2421894\">https://doi.org/10.1109/TIT.2015.2421894</a>.","short":"Z. Bao, G. Pan, W. Zhou, IEEE Transactions on Information Theory 61 (2015) 3413–3426.","ista":"Bao Z, Pan G, Zhou W. 2015. Asymptotic mutual information statistics of MIMO channels and CLT of sample covariance matrices. IEEE Transactions on Information Theory. 61(6), 3413–3426.","ama":"Bao Z, Pan G, Zhou W. Asymptotic mutual information statistics of MIMO channels and CLT of sample covariance matrices. <i>IEEE Transactions on Information Theory</i>. 2015;61(6):3413-3426. doi:<a href=\"https://doi.org/10.1109/TIT.2015.2421894\">10.1109/TIT.2015.2421894</a>","mla":"Bao, Zhigang, et al. “Asymptotic Mutual Information Statistics of MIMO Channels and CLT of Sample Covariance Matrices.” <i>IEEE Transactions on Information Theory</i>, vol. 61, no. 6, IEEE, 2015, pp. 3413–26, doi:<a href=\"https://doi.org/10.1109/TIT.2015.2421894\">10.1109/TIT.2015.2421894</a>."},"quality_controlled":"1","type":"journal_article","department":[{"_id":"LaEr"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_published":"2015-06-01T00:00:00Z","day":"01","year":"2015","publisher":"IEEE","article_processing_charge":"No","_id":"1585","author":[{"full_name":"Bao, Zhigang","last_name":"Bao","id":"442E6A6C-F248-11E8-B48F-1D18A9856A87","first_name":"Zhigang","orcid":"0000-0003-3036-1475"},{"first_name":"Guangming","last_name":"Pan","full_name":"Pan, Guangming"},{"full_name":"Zhou, Wang","last_name":"Zhou","first_name":"Wang"}],"status":"public","volume":61,"acknowledgement":"G. Pan was supported by MOE Tier 2 under Grant 2014-T2-2-060 and in part by Tier 1 under Grant RG25/14 through the Nanyang Technological University, Singapore. W. Zhou was supported by the National University of Singapore, Singapore, under Grant R-155-000-131-112.\r\n","publist_id":"5586"},{"citation":{"ieee":"A. Angermayr, A. Gorchs, and K. Hellingwerf, “Metabolic engineering of cyanobacteria for the synthesis of commodity products,” <i>Trends in Biotechnology</i>, vol. 33, no. 6. Elsevier, pp. 352–361, 2015.","apa":"Angermayr, A., Gorchs, A., &#38; Hellingwerf, K. (2015). Metabolic engineering of cyanobacteria for the synthesis of commodity products. <i>Trends in Biotechnology</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.tibtech.2015.03.009\">https://doi.org/10.1016/j.tibtech.2015.03.009</a>","chicago":"Angermayr, Andreas, Aleix Gorchs, and Klaas Hellingwerf. “Metabolic Engineering of Cyanobacteria for the Synthesis of Commodity Products.” <i>Trends in Biotechnology</i>. Elsevier, 2015. <a href=\"https://doi.org/10.1016/j.tibtech.2015.03.009\">https://doi.org/10.1016/j.tibtech.2015.03.009</a>.","short":"A. Angermayr, A. Gorchs, K. Hellingwerf, Trends in Biotechnology 33 (2015) 352–361.","ista":"Angermayr A, Gorchs A, Hellingwerf K. 2015. Metabolic engineering of cyanobacteria for the synthesis of commodity products. Trends in Biotechnology. 33(6), 352–361.","ama":"Angermayr A, Gorchs A, Hellingwerf K. Metabolic engineering of cyanobacteria for the synthesis of commodity products. <i>Trends in Biotechnology</i>. 2015;33(6):352-361. doi:<a href=\"https://doi.org/10.1016/j.tibtech.2015.03.009\">10.1016/j.tibtech.2015.03.009</a>","mla":"Angermayr, Andreas, et al. “Metabolic Engineering of Cyanobacteria for the Synthesis of Commodity Products.” <i>Trends in Biotechnology</i>, vol. 33, no. 6, Elsevier, 2015, pp. 352–61, doi:<a href=\"https://doi.org/10.1016/j.tibtech.2015.03.009\">10.1016/j.tibtech.2015.03.009</a>."},"type":"journal_article","quality_controlled":"1","issue":"6","volume":33,"status":"public","publist_id":"5585","day":"01","year":"2015","date_published":"2015-06-01T00:00:00Z","department":[{"_id":"ToBo"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","_id":"1586","author":[{"id":"4677C796-F248-11E8-B48F-1D18A9856A87","first_name":"Andreas","orcid":"0000-0001-8619-2223","full_name":"Angermayr, Andreas","last_name":"Angermayr"},{"full_name":"Gorchs, Aleix","last_name":"Gorchs","first_name":"Aleix"},{"last_name":"Hellingwerf","full_name":"Hellingwerf, Klaas","first_name":"Klaas"}],"article_processing_charge":"No","publisher":"Elsevier","intvolume":"        33","publication":"Trends in Biotechnology","page":"352 - 361","date_created":"2018-12-11T11:52:52Z","isi":1,"month":"06","external_id":{"isi":["000355709700007"]},"abstract":[{"text":"Through metabolic engineering cyanobacteria can be employed in biotechnology. Combining the capacity for oxygenic photosynthesis and carbon fixation with an engineered metabolic pathway allows carbon-based product formation from CO2, light, and water directly. Such cyanobacterial 'cell factories' are constructed to produce biofuels, bioplastics, and commodity chemicals. Efforts of metabolic engineers and synthetic biologists allow the modification of the intermediary metabolism at various branching points, expanding the product range. The new biosynthesis routes 'tap' the metabolism ever more efficiently, particularly through the engineering of driving forces and utilization of cofactors generated during the light reactions of photosynthesis, resulting in higher product titers. High rates of carbon rechanneling ultimately allow an almost-complete allocation of fixed carbon to product above biomass.","lang":"eng"}],"title":"Metabolic engineering of cyanobacteria for the synthesis of commodity products","doi":"10.1016/j.tibtech.2015.03.009","oa_version":"None","language":[{"iso":"eng"}],"publication_status":"published","date_updated":"2025-09-23T09:33:34Z","scopus_import":"1"},{"oa":1,"intvolume":"        92","isi":1,"month":"12","publication":"Physical Review A - Atomic, Molecular, and Optical Physics","date_created":"2018-12-11T11:52:53Z","doi":"10.1103/PhysRevA.92.062506","title":"Quantum interference shifts in laser spectroscopy with elliptical polarization","abstract":[{"lang":"eng","text":"We investigate the quantum interference shifts between energetically close states, where the state structure is observed by laser spectroscopy. We report a compact and analytical expression that models the quantum interference induced shift for any admixture of circular polarization of the incident laser and angle of observation. An experimental scenario free of quantum interference can thus be predicted with this formula. Although this study is exemplified here for muonic deuterium, it can be applied to any other laser spectroscopy measurement of ns-n′p frequencies of a nonrelativistic atomic system, via an ns→n′p→n′′s scheme."}],"external_id":{"isi":["000367373900002"],"arxiv":["1511.03585"]},"scopus_import":"1","publication_status":"published","date_updated":"2025-09-23T10:30:45Z","oa_version":"Preprint","language":[{"iso":"eng"}],"type":"journal_article","quality_controlled":"1","project":[{"grant_number":"291734","name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"citation":{"ista":"Amaro P, Fratini F, Safari L, Antognini A, Indelicato P, Pohl R, Santos J. 2015. Quantum interference shifts in laser spectroscopy with elliptical polarization. Physical Review A - Atomic, Molecular, and Optical Physics. 92(6), 062506.","ama":"Amaro P, Fratini F, Safari L, et al. Quantum interference shifts in laser spectroscopy with elliptical polarization. <i>Physical Review A - Atomic, Molecular, and Optical Physics</i>. 2015;92(6). doi:<a href=\"https://doi.org/10.1103/PhysRevA.92.062506\">10.1103/PhysRevA.92.062506</a>","ieee":"P. Amaro <i>et al.</i>, “Quantum interference shifts in laser spectroscopy with elliptical polarization,” <i>Physical Review A - Atomic, Molecular, and Optical Physics</i>, vol. 92, no. 6. American Physical Society, 2015.","apa":"Amaro, P., Fratini, F., Safari, L., Antognini, A., Indelicato, P., Pohl, R., &#38; Santos, J. (2015). Quantum interference shifts in laser spectroscopy with elliptical polarization. <i>Physical Review A - Atomic, Molecular, and Optical Physics</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevA.92.062506\">https://doi.org/10.1103/PhysRevA.92.062506</a>","short":"P. Amaro, F. Fratini, L. Safari, A. Antognini, P. Indelicato, R. Pohl, J. Santos, Physical Review A - Atomic, Molecular, and Optical Physics 92 (2015).","chicago":"Amaro, Pedro, Filippo Fratini, Laleh Safari, Aldo Antognini, Paul Indelicato, Randolf Pohl, and José Santos. “Quantum Interference Shifts in Laser Spectroscopy with Elliptical Polarization.” <i>Physical Review A - Atomic, Molecular, and Optical Physics</i>. American Physical Society, 2015. <a href=\"https://doi.org/10.1103/PhysRevA.92.062506\">https://doi.org/10.1103/PhysRevA.92.062506</a>.","mla":"Amaro, Pedro, et al. “Quantum Interference Shifts in Laser Spectroscopy with Elliptical Polarization.” <i>Physical Review A - Atomic, Molecular, and Optical Physics</i>, vol. 92, no. 6, 062506, American Physical Society, 2015, doi:<a href=\"https://doi.org/10.1103/PhysRevA.92.062506\">10.1103/PhysRevA.92.062506</a>."},"article_type":"original","issue":"6","main_file_link":[{"url":"https://arxiv.org/abs/1511.03585","open_access":"1"}],"article_number":"062506","arxiv":1,"publist_id":"5584","status":"public","ec_funded":1,"volume":92,"publisher":"American Physical Society","author":[{"last_name":"Amaro","full_name":"Amaro, Pedro","first_name":"Pedro"},{"full_name":"Fratini, Filippo","last_name":"Fratini","first_name":"Filippo"},{"full_name":"Safari, Laleh","last_name":"Safari","first_name":"Laleh","id":"3C325E5E-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Aldo","full_name":"Antognini, Aldo","last_name":"Antognini"},{"first_name":"Paul","last_name":"Indelicato","full_name":"Indelicato, Paul"},{"last_name":"Pohl","full_name":"Pohl, Randolf","first_name":"Randolf"},{"first_name":"José","last_name":"Santos","full_name":"Santos, José"}],"_id":"1587","article_processing_charge":"No","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","department":[{"_id":"MiLe"}],"year":"2015","day":"31","date_published":"2015-12-31T00:00:00Z"},{"publication":"Physical Review E","date_created":"2018-12-11T11:52:53Z","corr_author":"1","isi":1,"month":"11","intvolume":"        92","oa_version":"None","language":[{"iso":"eng"}],"date_updated":"2025-09-23T10:37:52Z","publication_status":"published","scopus_import":"1","external_id":{"isi":["000365520500010"]},"title":"Ring-bursting behavior en route to turbulence in narrow-gap Taylor-Couette flows","abstract":[{"text":"We investigate the Taylor-Couette system where the radius ratio is close to unity. Systematically increasing the Reynolds number, we observe a number of previously known transitions, such as one from the classical Taylor vortex flow (TVF) to wavy vortex flow (WVF) and the transition to fully developed turbulence. Prior to the onset of turbulence, we observe intermittent bursting patterns of localized turbulent patches, confirming the experimentally observed pattern of very short wavelength bursts (VSWBs). A striking finding is that, for a Reynolds number larger than that for the onset of VSWBs, a new type of intermittently bursting behavior emerges: patterns of azimuthally closed rings of various orders. We call them ring-bursting patterns, which surround the cylinder completely but remain localized and separated in the axial direction through nonturbulent wavy structures. We employ a number of quantitative measures including the cross-flow energy to characterize the ring-bursting patterns and to distinguish them from the background flow. These patterns are interesting because they do not occur in the wide-gap Taylor-Couette flow systems. The narrow-gap regime is less studied but certainly deserves further attention to gain deeper insights into complex flow dynamics in fluids.","lang":"eng"}],"doi":"10.1103/PhysRevE.92.053018","issue":"5","article_number":"053018","citation":{"mla":"Altmeyer, Sebastian, et al. “Ring-Bursting Behavior En Route to Turbulence in Narrow-Gap Taylor-Couette Flows.” <i>Physical Review E</i>, vol. 92, no. 5, 053018, American Physical Society, 2015, doi:<a href=\"https://doi.org/10.1103/PhysRevE.92.053018\">10.1103/PhysRevE.92.053018</a>.","apa":"Altmeyer, S., Do, Y., &#38; Lai, Y. (2015). Ring-bursting behavior en route to turbulence in narrow-gap Taylor-Couette flows. <i>Physical Review E</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevE.92.053018\">https://doi.org/10.1103/PhysRevE.92.053018</a>","ieee":"S. Altmeyer, Y. Do, and Y. Lai, “Ring-bursting behavior en route to turbulence in narrow-gap Taylor-Couette flows,” <i>Physical Review E</i>, vol. 92, no. 5. American Physical Society, 2015.","chicago":"Altmeyer, Sebastian, Younghae Do, and Ying Lai. “Ring-Bursting Behavior En Route to Turbulence in Narrow-Gap Taylor-Couette Flows.” <i>Physical Review E</i>. American Physical Society, 2015. <a href=\"https://doi.org/10.1103/PhysRevE.92.053018\">https://doi.org/10.1103/PhysRevE.92.053018</a>.","short":"S. Altmeyer, Y. Do, Y. Lai, Physical Review E 92 (2015).","ista":"Altmeyer S, Do Y, Lai Y. 2015. Ring-bursting behavior en route to turbulence in narrow-gap Taylor-Couette flows. Physical Review E. 92(5), 053018.","ama":"Altmeyer S, Do Y, Lai Y. Ring-bursting behavior en route to turbulence in narrow-gap Taylor-Couette flows. <i>Physical Review E</i>. 2015;92(5). doi:<a href=\"https://doi.org/10.1103/PhysRevE.92.053018\">10.1103/PhysRevE.92.053018</a>"},"type":"journal_article","quality_controlled":"1","day":"24","year":"2015","date_published":"2015-11-24T00:00:00Z","department":[{"_id":"BjHo"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","_id":"1588","author":[{"last_name":"Altmeyer","full_name":"Altmeyer, Sebastian","orcid":"0000-0001-5964-0203","id":"2EE67FDC-F248-11E8-B48F-1D18A9856A87","first_name":"Sebastian"},{"first_name":"Younghae","full_name":"Do, Younghae","last_name":"Do"},{"full_name":"Lai, Ying","last_name":"Lai","first_name":"Ying"}],"article_processing_charge":"No","publisher":"American Physical Society","volume":92,"status":"public","publist_id":"5583"},{"status":"public","file":[{"date_updated":"2020-07-14T12:45:03Z","access_level":"open_access","file_size":2771236,"date_created":"2018-12-12T10:13:49Z","creator":"system","checksum":"927e151674347661ce36eae2818dafdc","file_name":"IST-2016-472-v1+1_srep18589.pdf","content_type":"application/pdf","relation":"main_file","file_id":"5036"}],"volume":5,"file_date_updated":"2020-07-14T12:45:03Z","publist_id":"5582","department":[{"_id":"BjHo"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_published":"2015-12-21T00:00:00Z","pubrep_id":"472","year":"2015","day":"21","publisher":"Nature Publishing Group","author":[{"full_name":"Altmeyer, Sebastian","last_name":"Altmeyer","first_name":"Sebastian","id":"2EE67FDC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5964-0203"},{"last_name":"Do","full_name":"Do, Younghae","first_name":"Younghae"},{"last_name":"Lai","full_name":"Lai, Ying","first_name":"Ying"}],"_id":"1589","article_processing_charge":"No","citation":{"ama":"Altmeyer S, Do Y, Lai Y. Magnetic field induced flow pattern reversal in a ferrofluidic Taylor-Couette system. <i>Scientific Reports</i>. 2015;5. doi:<a href=\"https://doi.org/10.1038/srep18589\">10.1038/srep18589</a>","ista":"Altmeyer S, Do Y, Lai Y. 2015. Magnetic field induced flow pattern reversal in a ferrofluidic Taylor-Couette system. Scientific Reports. 5, 18589.","chicago":"Altmeyer, Sebastian, Younghae Do, and Ying Lai. “Magnetic Field Induced Flow Pattern Reversal in a Ferrofluidic Taylor-Couette System.” <i>Scientific Reports</i>. Nature Publishing Group, 2015. <a href=\"https://doi.org/10.1038/srep18589\">https://doi.org/10.1038/srep18589</a>.","short":"S. Altmeyer, Y. Do, Y. Lai, Scientific Reports 5 (2015).","apa":"Altmeyer, S., Do, Y., &#38; Lai, Y. (2015). Magnetic field induced flow pattern reversal in a ferrofluidic Taylor-Couette system. <i>Scientific Reports</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/srep18589\">https://doi.org/10.1038/srep18589</a>","ieee":"S. Altmeyer, Y. Do, and Y. Lai, “Magnetic field induced flow pattern reversal in a ferrofluidic Taylor-Couette system,” <i>Scientific Reports</i>, vol. 5. Nature Publishing Group, 2015.","mla":"Altmeyer, Sebastian, et al. “Magnetic Field Induced Flow Pattern Reversal in a Ferrofluidic Taylor-Couette System.” <i>Scientific Reports</i>, vol. 5, 18589, Nature Publishing Group, 2015, doi:<a href=\"https://doi.org/10.1038/srep18589\">10.1038/srep18589</a>."},"article_type":"original","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"quality_controlled":"1","type":"journal_article","has_accepted_license":"1","article_number":"18589","abstract":[{"lang":"eng","text":"We investigate the dynamics of ferrofluidic wavy vortex flows in the counter-rotating Taylor-Couette system, with a focus on wavy flows with a mixture of the dominant azimuthal modes. Without external magnetic field flows are stable and pro-grade with respect to the rotation of the inner cylinder. More complex behaviors can arise when an axial or a transverse magnetic field is applied. Depending on the direction and strength of the field, multi-stable wavy states and bifurcations can occur. We uncover the phenomenon of flow pattern reversal as the strength of the magnetic field is increased through a critical value. In between the regimes of pro-grade and retrograde flow rotations, standing waves with zero angular velocities can emerge. A striking finding is that, under a transverse magnetic field, a second reversal in the flow pattern direction can occur, where the flow pattern evolves into pro-grade rotation again from a retrograde state. Flow reversal is relevant to intriguing phenomena in nature such as geomagnetic reversal. Our results suggest that, in ferrofluids, flow pattern reversal can be induced by varying a magnetic field in a controlled manner, which can be realized in laboratory experiments with potential applications in the development of modern fluid devices."}],"title":"Magnetic field induced flow pattern reversal in a ferrofluidic Taylor-Couette system","external_id":{"isi":["000367075500002"]},"doi":"10.1038/srep18589","language":[{"iso":"eng"}],"oa_version":"Published Version","scopus_import":"1","publication_status":"published","date_updated":"2025-09-23T09:32:24Z","intvolume":"         5","oa":1,"date_created":"2018-12-11T11:52:53Z","publication":"Scientific Reports","month":"12","ddc":["530","540"],"isi":1},{"publication_identifier":{"eisbn":["978-3-319-27261-0"],"isbn":["978-3-319-27260-3"]},"main_file_link":[{"url":"http://arxiv.org/abs/1508.01076","open_access":"1"}],"citation":{"ista":"Aichholzer O, Biedl T, Hackl T, Held M, Huber S, Palfrader P, Vogtenhuber B. 2015.Representing directed trees as straight skeletons. In: Graph Drawing and Network Visualization. LNCS, vol. 9411, 335–347.","ama":"Aichholzer O, Biedl T, Hackl T, et al. Representing directed trees as straight skeletons. In: <i>Graph Drawing and Network Visualization</i>. Vol 9411. Springer Nature; 2015:335-347. doi:<a href=\"https://doi.org/10.1007/978-3-319-27261-0_28\">10.1007/978-3-319-27261-0_28</a>","apa":"Aichholzer, O., Biedl, T., Hackl, T., Held, M., Huber, S., Palfrader, P., &#38; Vogtenhuber, B. (2015). Representing directed trees as straight skeletons. In <i>Graph Drawing and Network Visualization</i> (Vol. 9411, pp. 335–347). Los Angeles, CA, United States: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-319-27261-0_28\">https://doi.org/10.1007/978-3-319-27261-0_28</a>","ieee":"O. Aichholzer <i>et al.</i>, “Representing directed trees as straight skeletons,” in <i>Graph Drawing and Network Visualization</i>, vol. 9411, Springer Nature, 2015, pp. 335–347.","short":"O. Aichholzer, T. Biedl, T. Hackl, M. Held, S. Huber, P. Palfrader, B. Vogtenhuber, in:, Graph Drawing and Network Visualization, Springer Nature, 2015, pp. 335–347.","chicago":"Aichholzer, Oswin, Therese Biedl, Thomas Hackl, Martin Held, Stefan Huber, Peter Palfrader, and Birgit Vogtenhuber. “Representing Directed Trees as Straight Skeletons.” In <i>Graph Drawing and Network Visualization</i>, 9411:335–47. Springer Nature, 2015. <a href=\"https://doi.org/10.1007/978-3-319-27261-0_28\">https://doi.org/10.1007/978-3-319-27261-0_28</a>.","mla":"Aichholzer, Oswin, et al. “Representing Directed Trees as Straight Skeletons.” <i>Graph Drawing and Network Visualization</i>, vol. 9411, Springer Nature, 2015, pp. 335–47, doi:<a href=\"https://doi.org/10.1007/978-3-319-27261-0_28\">10.1007/978-3-319-27261-0_28</a>."},"quality_controlled":"1","type":"book_chapter","date_published":"2015-11-27T00:00:00Z","day":"27","year":"2015","department":[{"_id":"HeEd"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","author":[{"first_name":"Oswin","last_name":"Aichholzer","full_name":"Aichholzer, Oswin"},{"full_name":"Biedl, Therese","last_name":"Biedl","first_name":"Therese"},{"first_name":"Thomas","full_name":"Hackl, Thomas","last_name":"Hackl"},{"first_name":"Martin","last_name":"Held","full_name":"Held, Martin"},{"orcid":"0000-0002-8871-5814","first_name":"Stefan","id":"4700A070-F248-11E8-B48F-1D18A9856A87","last_name":"Huber","full_name":"Huber, Stefan"},{"last_name":"Palfrader","full_name":"Palfrader, Peter","first_name":"Peter"},{"full_name":"Vogtenhuber, Birgit","last_name":"Vogtenhuber","first_name":"Birgit"}],"_id":"1590","article_processing_charge":"No","alternative_title":["LNCS"],"publisher":"Springer Nature","volume":9411,"status":"public","publist_id":"5581","conference":{"name":"GD: Graph Drawing and Network Visualization","start_date":"2015-09-24","end_date":"2015-09-26","location":"Los Angeles, CA, United States"},"arxiv":1,"date_created":"2018-12-11T11:52:54Z","publication":"Graph Drawing and Network Visualization","page":"335 - 347","month":"11","isi":1,"intvolume":"      9411","oa":1,"language":[{"iso":"eng"}],"oa_version":"Preprint","date_updated":"2025-09-23T10:35:07Z","publication_status":"published","scopus_import":"1","external_id":{"arxiv":["1508.01076"],"isi":["000373628600028"]},"title":"Representing directed trees as straight skeletons","abstract":[{"lang":"eng","text":"The straight skeleton of a polygon is the geometric graph obtained by tracing the vertices during a mitered offsetting process. It is known that the straight skeleton of a simple polygon is a tree, and one can naturally derive directions on the edges of the tree from the propagation of the shrinking process. In this paper, we ask the reverse question: Given a tree with directed edges, can it be the straight skeleton of a polygon? And if so, can we find a suitable simple polygon? We answer these questions for all directed trees where the order of edges around each node is fixed."}],"doi":"10.1007/978-3-319-27261-0_28"},{"doi":"10.3389/fpls.2015.00218","abstract":[{"lang":"eng","text":"Plants are sessile organisms that are permanently restricted to their site of germination. To compensate for their lack of mobility, plants evolved unique mechanisms enabling them to rapidly react to ever changing environmental conditions and flexibly adapt their postembryonic developmental program. A prominent demonstration of this developmental plasticity is their ability to bend organs in order to reach the position most optimal for growth and utilization of light, nutrients, and other resources. Shortly after germination, dicotyledonous seedlings form a bended structure, the so-called apical hook, to protect the delicate shoot meristem and cotyledons from damage when penetrating through the soil. Upon perception of a light stimulus, the apical hook rapidly opens and the photomorphogenic developmental program is activated. After germination, plant organs are able to align their growth with the light source and adopt the most favorable orientation through bending, in a process named phototropism. On the other hand, when roots and shoots are diverted from their upright orientation, they immediately detect a change in the gravity vector and bend to maintain a vertical growth direction. Noteworthy, despite the diversity of external stimuli perceived by different plant organs, all plant tropic movements share a common mechanistic basis: differential cell growth. In our review, we will discuss the molecular principles underlying various tropic responses with the focus on mechanisms mediating the perception of external signals, transduction cascades and downstream responses that regulate differential cell growth and consequently, organ bending. In particular, we highlight common and specific features of regulatory pathways in control of the bending of organs and a role for the plant hormone auxin as a key regulatory component."}],"title":"Strategies of seedlings to overcome their sessile nature: Auxin in mobility control","external_id":{"isi":["000353577800001"]},"scopus_import":"1","publication_status":"published","date_updated":"2025-09-23T10:49:06Z","language":[{"iso":"eng"}],"oa_version":"Published Version","oa":1,"intvolume":"         6","month":"04","isi":1,"ddc":["570"],"corr_author":"1","date_created":"2018-12-11T11:52:55Z","publication":"Frontiers in Plant Science","publist_id":"5578","ec_funded":1,"status":"public","file":[{"file_size":965690,"date_created":"2018-12-12T10:15:23Z","access_level":"open_access","date_updated":"2020-07-14T12:45:03Z","file_id":"5142","relation":"main_file","content_type":"application/pdf","checksum":"c454d642e18dfa86820b97a86cd6d3cc","file_name":"IST-2016-471-v1+1_fpls-06-00218.pdf","creator":"system"}],"file_date_updated":"2020-07-14T12:45:03Z","volume":6,"publisher":"Frontiers Research Foundation","_id":"1593","article_processing_charge":"No","author":[{"first_name":"Petra","last_name":"Žádníková","full_name":"Žádníková, Petra"},{"full_name":"Smet, Dajo","last_name":"Smet","first_name":"Dajo"},{"id":"40A4B9E6-F248-11E8-B48F-1D18A9856A87","first_name":"Qiang","last_name":"Zhu","full_name":"Zhu, Qiang"},{"last_name":"Van Der Straeten","full_name":"Van Der Straeten, Dominique","first_name":"Dominique"},{"last_name":"Benková","full_name":"Benková, Eva","orcid":"0000-0002-8510-9739","first_name":"Eva","id":"38F4F166-F248-11E8-B48F-1D18A9856A87"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","department":[{"_id":"EvBe"}],"date_published":"2015-04-14T00:00:00Z","pubrep_id":"471","year":"2015","day":"14","project":[{"grant_number":"207362","_id":"253FCA6A-B435-11E9-9278-68D0E5697425","name":"Hormonal cross-talk in plant organogenesis","call_identifier":"FP7"}],"quality_controlled":"1","type":"journal_article","citation":{"ista":"Žádníková P, Smet D, Zhu Q, Van Der Straeten D, Benková E. 2015. Strategies of seedlings to overcome their sessile nature: Auxin in mobility control. Frontiers in Plant Science. 6(4).","ama":"Žádníková P, Smet D, Zhu Q, Van Der Straeten D, Benková E. Strategies of seedlings to overcome their sessile nature: Auxin in mobility control. <i>Frontiers in Plant Science</i>. 2015;6(4). doi:<a href=\"https://doi.org/10.3389/fpls.2015.00218\">10.3389/fpls.2015.00218</a>","ieee":"P. Žádníková, D. Smet, Q. Zhu, D. Van Der Straeten, and E. Benková, “Strategies of seedlings to overcome their sessile nature: Auxin in mobility control,” <i>Frontiers in Plant Science</i>, vol. 6, no. 4. Frontiers Research Foundation, 2015.","apa":"Žádníková, P., Smet, D., Zhu, Q., Van Der Straeten, D., &#38; Benková, E. (2015). Strategies of seedlings to overcome their sessile nature: Auxin in mobility control. <i>Frontiers in Plant Science</i>. Frontiers Research Foundation. <a href=\"https://doi.org/10.3389/fpls.2015.00218\">https://doi.org/10.3389/fpls.2015.00218</a>","short":"P. Žádníková, D. Smet, Q. Zhu, D. Van Der Straeten, E. Benková, Frontiers in Plant Science 6 (2015).","chicago":"Žádníková, Petra, Dajo Smet, Qiang Zhu, Dominique Van Der Straeten, and Eva Benková. “Strategies of Seedlings to Overcome Their Sessile Nature: Auxin in Mobility Control.” <i>Frontiers in Plant Science</i>. Frontiers Research Foundation, 2015. <a href=\"https://doi.org/10.3389/fpls.2015.00218\">https://doi.org/10.3389/fpls.2015.00218</a>.","mla":"Žádníková, Petra, et al. “Strategies of Seedlings to Overcome Their Sessile Nature: Auxin in Mobility Control.” <i>Frontiers in Plant Science</i>, vol. 6, no. 4, Frontiers Research Foundation, 2015, doi:<a href=\"https://doi.org/10.3389/fpls.2015.00218\">10.3389/fpls.2015.00218</a>."},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"issue":"4","has_accepted_license":"1"},{"citation":{"ama":"Forejt V, Krčál J, Kretinsky J. Controller synthesis for MDPs and frequency LTL\\GU. In: Vol 9450. Springer; 2015:162-177. doi:<a href=\"https://doi.org/10.1007/978-3-662-48899-7_12\">10.1007/978-3-662-48899-7_12</a>","ista":"Forejt V, Krčál J, Kretinsky J. 2015. Controller synthesis for MDPs and frequency LTL\\GU. LPAR: Logic for Programming, Artificial Intelligence, and Reasoning, LNCS, vol. 9450, 162–177.","chicago":"Forejt, Vojtěch, Jan Krčál, and Jan Kretinsky. “Controller Synthesis for MDPs and Frequency LTL\\GU,” 9450:162–77. Springer, 2015. <a href=\"https://doi.org/10.1007/978-3-662-48899-7_12\">https://doi.org/10.1007/978-3-662-48899-7_12</a>.","short":"V. Forejt, J. Krčál, J. Kretinsky, in:, Springer, 2015, pp. 162–177.","apa":"Forejt, V., Krčál, J., &#38; Kretinsky, J. (2015). Controller synthesis for MDPs and frequency LTL\\GU (Vol. 9450, pp. 162–177). Presented at the LPAR: Logic for Programming, Artificial Intelligence, and Reasoning, Suva, Fiji: Springer. <a href=\"https://doi.org/10.1007/978-3-662-48899-7_12\">https://doi.org/10.1007/978-3-662-48899-7_12</a>","ieee":"V. Forejt, J. Krčál, and J. Kretinsky, “Controller synthesis for MDPs and frequency LTL\\GU,” presented at the LPAR: Logic for Programming, Artificial Intelligence, and Reasoning, Suva, Fiji, 2015, vol. 9450, pp. 162–177.","mla":"Forejt, Vojtěch, et al. <i>Controller Synthesis for MDPs and Frequency LTL\\GU</i>. Vol. 9450, Springer, 2015, pp. 162–77, doi:<a href=\"https://doi.org/10.1007/978-3-662-48899-7_12\">10.1007/978-3-662-48899-7_12</a>."},"project":[{"call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425","name":"International IST Postdoc Fellowship Programme","grant_number":"291734"},{"grant_number":"S 11407_N23","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering"},{"grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"}],"quality_controlled":"1","type":"conference","date_published":"2015-11-22T00:00:00Z","day":"22","year":"2015","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"article_processing_charge":"No","_id":"1594","author":[{"full_name":"Forejt, Vojtěch","last_name":"Forejt","first_name":"Vojtěch"},{"first_name":"Jan","full_name":"Krčál, Jan","last_name":"Krčál"},{"last_name":"Kretinsky","full_name":"Kretinsky, Jan","orcid":"0000-0002-8122-2881","id":"44CEF464-F248-11E8-B48F-1D18A9856A87","first_name":"Jan"}],"alternative_title":["LNCS"],"publisher":"Springer","volume":9450,"status":"public","ec_funded":1,"publist_id":"5577","acknowledgement":"This work is partly supported by the German Research Council (DFG) as part of the Transregional Collaborative Research Center AVACS (SFB/TR 14), by the Czech Science Foundation under grant agreement P202/12/G061, by the EU 7th Framework Programme under grant agreement no. 295261 (MEALS) and 318490 (SENSATION), by the CDZ project 1023 (CAP), by the CAS/SAFEA International Partnership Program for Creative Research Teams, by the EPSRC grant EP/M023656/1, by the People Programme (Marie Curie Actions) of the European Union’s Seventh Framework Programme (FP7/2007–2013) REA Grant No 291734, by the Austrian Science Fund (FWF) S11407-N23 (RiSE/SHiNE), and by the ERC Start Grant (279307: Graph Games).\r\n","conference":{"end_date":"2015-11-28","location":"Suva, Fiji","name":"LPAR: Logic for Programming, Artificial Intelligence, and Reasoning","start_date":"2015-11-24"},"date_created":"2018-12-11T11:52:55Z","page":"162 - 177","month":"11","isi":1,"intvolume":"      9450","language":[{"iso":"eng"}],"oa_version":"None","publication_status":"published","date_updated":"2025-09-23T08:21:59Z","scopus_import":"1","external_id":{"isi":["000375574900012"]},"abstract":[{"text":"Quantitative extensions of temporal logics have recently attracted significant attention. In this work, we study frequency LTL (fLTL), an extension of LTL which allows to speak about frequencies of events along an execution. Such an extension is particularly useful for probabilistic systems that often cannot fulfil strict qualitative guarantees on the behaviour. It has been recently shown that controller synthesis for Markov decision processes and fLTL is decidable when all the bounds on frequencies are 1. As a step towards a complete quantitative solution, we show that the problem is decidable for the fragment fLTL\\GU, where U does not occur in the scope of G (but still F can). Our solution is based on a novel translation of such quantitative formulae into equivalent deterministic automata.","lang":"eng"}],"title":"Controller synthesis for MDPs and frequency LTL\\GU","doi":"10.1007/978-3-662-48899-7_12"},{"intvolume":"      9411","oa":1,"date_created":"2018-12-11T11:52:55Z","page":"99 - 110","month":"11","isi":1,"ddc":["510"],"title":"Hanani-Tutte for radial planarity","abstract":[{"lang":"eng","text":"A drawing of a graph G is radial if the vertices of G are placed on concentric circles C1, . . . , Ck with common center c, and edges are drawn radially: every edge intersects every circle centered at c at most once. G is radial planar if it has a radial embedding, that is, a crossing- free radial drawing. If the vertices of G are ordered or partitioned into ordered levels (as they are for leveled graphs), we require that the assignment of vertices to circles corresponds to the given ordering or leveling. We show that a graph G is radial planar if G has a radial drawing in which every two edges cross an even number of times; the radial embedding has the same leveling as the radial drawing. In other words, we establish the weak variant of the Hanani-Tutte theorem for radial planarity. This generalizes a result by Pach and Tóth."}],"external_id":{"isi":["000373628600009"]},"doi":"10.1007/978-3-319-27261-0_9","language":[{"iso":"eng"}],"oa_version":"Submitted Version","scopus_import":"1","date_updated":"2025-09-23T09:13:43Z","publication_status":"published","citation":{"apa":"Fulek, R., Pelsmajer, M., &#38; Schaefer, M. (2015). Hanani-Tutte for radial planarity (Vol. 9411, pp. 99–110). Presented at the GD: Graph Drawing and Network Visualization, Los Angeles, CA, USA: Springer. <a href=\"https://doi.org/10.1007/978-3-319-27261-0_9\">https://doi.org/10.1007/978-3-319-27261-0_9</a>","ieee":"R. Fulek, M. Pelsmajer, and M. Schaefer, “Hanani-Tutte for radial planarity,” presented at the GD: Graph Drawing and Network Visualization, Los Angeles, CA, USA, 2015, vol. 9411, pp. 99–110.","short":"R. Fulek, M. Pelsmajer, M. Schaefer, in:, Springer, 2015, pp. 99–110.","chicago":"Fulek, Radoslav, Michael Pelsmajer, and Marcus Schaefer. “Hanani-Tutte for Radial Planarity,” 9411:99–110. Springer, 2015. <a href=\"https://doi.org/10.1007/978-3-319-27261-0_9\">https://doi.org/10.1007/978-3-319-27261-0_9</a>.","ista":"Fulek R, Pelsmajer M, Schaefer M. 2015. Hanani-Tutte for radial planarity. GD: Graph Drawing and Network Visualization, LNCS, vol. 9411, 99–110.","ama":"Fulek R, Pelsmajer M, Schaefer M. Hanani-Tutte for radial planarity. In: Vol 9411. Springer; 2015:99-110. doi:<a href=\"https://doi.org/10.1007/978-3-319-27261-0_9\">10.1007/978-3-319-27261-0_9</a>","mla":"Fulek, Radoslav, et al. <i>Hanani-Tutte for Radial Planarity</i>. Vol. 9411, Springer, 2015, pp. 99–110, doi:<a href=\"https://doi.org/10.1007/978-3-319-27261-0_9\">10.1007/978-3-319-27261-0_9</a>."},"project":[{"grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7"}],"quality_controlled":"1","type":"conference","has_accepted_license":"1","related_material":{"record":[{"status":"public","relation":"later_version","id":"1113"},{"status":"public","relation":"later_version","id":"1164"}]},"ec_funded":1,"status":"public","file":[{"access_level":"open_access","date_updated":"2020-07-14T12:45:03Z","file_size":330135,"date_created":"2018-12-12T10:08:36Z","content_type":"application/pdf","file_name":"IST-2016-594-v1+1_HTCylinder_GD_Revision.pdf","checksum":"685f91bd077a951ba067d42cce75409e","creator":"system","file_id":"4697","relation":"main_file"}],"file_date_updated":"2020-07-14T12:45:03Z","volume":9411,"acknowledgement":"The research leading to these results has received funding from the People Programme (Marie Curie Actions) of the European Union’s Seventh Framework Programme (FP7/2007-2013) under REA grant agreement no [291734].","conference":{"start_date":"2015-09-24","name":"GD: Graph Drawing and Network Visualization","end_date":"2015-09-26","location":"Los Angeles, CA, USA"},"publist_id":"5576","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","department":[{"_id":"UlWa"}],"date_published":"2015-11-27T00:00:00Z","pubrep_id":"594","day":"27","year":"2015","alternative_title":["LNCS"],"publisher":"Springer","author":[{"id":"39F3FFE4-F248-11E8-B48F-1D18A9856A87","first_name":"Radoslav","orcid":"0000-0001-8485-1774","full_name":"Fulek, Radoslav","last_name":"Fulek"},{"full_name":"Pelsmajer, Michael","last_name":"Pelsmajer","first_name":"Michael"},{"first_name":"Marcus","last_name":"Schaefer","full_name":"Schaefer, Marcus"}],"_id":"1595","article_processing_charge":"No"},{"_id":"1596","article_processing_charge":"No","author":[{"first_name":"Radoslav","id":"39F3FFE4-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8485-1774","full_name":"Fulek, Radoslav","last_name":"Fulek"},{"full_name":"Radoičić, Radoš","last_name":"Radoičić","first_name":"Radoš"}],"publisher":"Springer Nature","alternative_title":["LNCS"],"day":"27","year":"2015","pubrep_id":"595","date_published":"2015-11-27T00:00:00Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","department":[{"_id":"UlWa"}],"publist_id":"5575","conference":{"location":"Los Angeles, CA, United States","end_date":"2015-09-26","name":"GD: Graph Drawing and Network Visualization","start_date":"2015-09-24"},"file_date_updated":"2020-07-14T12:45:04Z","volume":9411,"file":[{"file_id":"5258","relation":"main_file","file_name":"IST-2016-595-v1+1_VerticalVisibilityGDRevision.pdf","content_type":"application/pdf","checksum":"eec04f86c5921d04f025d5791db9b965","creator":"system","date_created":"2018-12-12T10:17:06Z","file_size":312992,"access_level":"open_access","date_updated":"2020-07-14T12:45:04Z"}],"status":"public","ec_funded":1,"publication_identifier":{"isbn":["978-3-319-27260-3"]},"has_accepted_license":"1","type":"book_chapter","quality_controlled":"1","project":[{"name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"291734"}],"citation":{"ista":"Fulek R, Radoičić R. 2015.Vertical visibility among parallel polygons in three dimensions. In: Graph Drawing and Network Visualization. LNCS, vol. 9411, 373–379.","ama":"Fulek R, Radoičić R. Vertical visibility among parallel polygons in three dimensions. In: <i>Graph Drawing and Network Visualization</i>. Vol 9411. Springer Nature; 2015:373-379. doi:<a href=\"https://doi.org/10.1007/978-3-319-27261-0_31\">10.1007/978-3-319-27261-0_31</a>","short":"R. Fulek, R. Radoičić, in:, Graph Drawing and Network Visualization, Springer Nature, 2015, pp. 373–379.","chicago":"Fulek, Radoslav, and Radoš Radoičić. “Vertical Visibility among Parallel Polygons in Three Dimensions.” In <i>Graph Drawing and Network Visualization</i>, 9411:373–79. Springer Nature, 2015. <a href=\"https://doi.org/10.1007/978-3-319-27261-0_31\">https://doi.org/10.1007/978-3-319-27261-0_31</a>.","apa":"Fulek, R., &#38; Radoičić, R. (2015). Vertical visibility among parallel polygons in three dimensions. In <i>Graph Drawing and Network Visualization</i> (Vol. 9411, pp. 373–379). Los Angeles, CA, United States: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-319-27261-0_31\">https://doi.org/10.1007/978-3-319-27261-0_31</a>","ieee":"R. Fulek and R. Radoičić, “Vertical visibility among parallel polygons in three dimensions,” in <i>Graph Drawing and Network Visualization</i>, vol. 9411, Springer Nature, 2015, pp. 373–379.","mla":"Fulek, Radoslav, and Radoš Radoičić. “Vertical Visibility among Parallel Polygons in Three Dimensions.” <i>Graph Drawing and Network Visualization</i>, vol. 9411, Springer Nature, 2015, pp. 373–79, doi:<a href=\"https://doi.org/10.1007/978-3-319-27261-0_31\">10.1007/978-3-319-27261-0_31</a>."},"date_updated":"2025-09-29T11:05:28Z","publication_status":"published","scopus_import":"1","oa_version":"Submitted Version","language":[{"iso":"eng"}],"doi":"10.1007/978-3-319-27261-0_31","external_id":{"isi":["000373628600031"]},"title":"Vertical visibility among parallel polygons in three dimensions","abstract":[{"text":"Let C={C1,...,Cn} denote a collection of translates of a regular convex k-gon in the plane with the stacking order. The collection C forms a visibility clique if for everyi &lt; j the intersection Ci and (Ci ∩ Cj)\\⋃i&lt;l&lt;jCl =∅.elements that are stacked between them, i.e., We show that if C forms a visibility clique its size is bounded from above by O(k4) thereby improving the upper bound of 22k from the aforementioned paper. We also obtain an upper bound of 22(k/2)+2 on the size of a visibility clique for homothetes of a convex (not necessarily regular) k-gon.","lang":"eng"}],"corr_author":"1","isi":1,"ddc":["510"],"month":"11","page":"373 - 379","publication":"Graph Drawing and Network Visualization","date_created":"2018-12-11T11:52:56Z","oa":1,"intvolume":"      9411"},{"intvolume":"       573","oa":1,"date_created":"2018-12-11T11:52:56Z","page":"71 - 89","publication":"Theoretical Computer Science","month":"03","isi":1,"title":"Average case analysis of the classical algorithm for Markov decision processes with Büchi objectives","abstract":[{"lang":"eng","text":"We consider Markov decision processes (MDPs) with specifications given as Büchi (liveness) objectives, and examine the problem of computing the set of almost-sure winning vertices such that the objective can be ensured with probability 1 from these vertices. We study for the first time the average-case complexity of the classical algorithm for computing the set of almost-sure winning vertices for MDPs with Büchi objectives. Our contributions are as follows: First, we show that for MDPs with constant out-degree the expected number of iterations is at most logarithmic and the average-case running time is linear (as compared to the worst-case linear number of iterations and quadratic time complexity). Second, for the average-case analysis over all MDPs we show that the expected number of iterations is constant and the average-case running time is linear (again as compared to the worst-case linear number of iterations and quadratic time complexity). Finally we also show that when all MDPs are equally likely, the probability that the classical algorithm requires more than a constant number of iterations is exponentially small."}],"external_id":{"arxiv":["1202.4175"],"isi":["000350835500007"]},"doi":"10.1016/j.tcs.2015.01.050","language":[{"iso":"eng"}],"oa_version":"Preprint","scopus_import":"1","publication_status":"published","date_updated":"2025-09-23T08:00:31Z","citation":{"ama":"Chatterjee K, Joglekar M, Shah N. Average case analysis of the classical algorithm for Markov decision processes with Büchi objectives. <i>Theoretical Computer Science</i>. 2015;573(3):71-89. doi:<a href=\"https://doi.org/10.1016/j.tcs.2015.01.050\">10.1016/j.tcs.2015.01.050</a>","ista":"Chatterjee K, Joglekar M, Shah N. 2015. Average case analysis of the classical algorithm for Markov decision processes with Büchi objectives. Theoretical Computer Science. 573(3), 71–89.","apa":"Chatterjee, K., Joglekar, M., &#38; Shah, N. (2015). Average case analysis of the classical algorithm for Markov decision processes with Büchi objectives. <i>Theoretical Computer Science</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.tcs.2015.01.050\">https://doi.org/10.1016/j.tcs.2015.01.050</a>","ieee":"K. Chatterjee, M. Joglekar, and N. Shah, “Average case analysis of the classical algorithm for Markov decision processes with Büchi objectives,” <i>Theoretical Computer Science</i>, vol. 573, no. 3. Elsevier, pp. 71–89, 2015.","short":"K. Chatterjee, M. Joglekar, N. Shah, Theoretical Computer Science 573 (2015) 71–89.","chicago":"Chatterjee, Krishnendu, Manas Joglekar, and Nisarg Shah. “Average Case Analysis of the Classical Algorithm for Markov Decision Processes with Büchi Objectives.” <i>Theoretical Computer Science</i>. Elsevier, 2015. <a href=\"https://doi.org/10.1016/j.tcs.2015.01.050\">https://doi.org/10.1016/j.tcs.2015.01.050</a>.","mla":"Chatterjee, Krishnendu, et al. “Average Case Analysis of the Classical Algorithm for Markov Decision Processes with Büchi Objectives.” <i>Theoretical Computer Science</i>, vol. 573, no. 3, Elsevier, 2015, pp. 71–89, doi:<a href=\"https://doi.org/10.1016/j.tcs.2015.01.050\">10.1016/j.tcs.2015.01.050</a>."},"project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","grant_number":"P 23499-N23"},{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","name":"Game Theory","call_identifier":"FWF","grant_number":"S11407"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","grant_number":"279307"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"quality_controlled":"1","type":"journal_article","issue":"3","main_file_link":[{"url":"http://arxiv.org/abs/1202.4175","open_access":"1"}],"related_material":{"record":[{"relation":"earlier_version","status":"public","id":"2715"}]},"status":"public","ec_funded":1,"volume":573,"arxiv":1,"acknowledgement":"The research was supported by FWF Grant No. P 23499-N23, FWF NFN Grant No. S11407-N23 (RiSE), ERC Start Grant (279307: Graph Games), and the Microsoft Faculty Fellows Award. Nisarg Shah is also supported by NSF Grant CCF-1215883.\r\n","publist_id":"5571","department":[{"_id":"KrCh"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_published":"2015-03-30T00:00:00Z","day":"30","year":"2015","publisher":"Elsevier","author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"},{"first_name":"Manas","last_name":"Joglekar","full_name":"Joglekar, Manas"},{"first_name":"Nisarg","full_name":"Shah, Nisarg","last_name":"Shah"}],"_id":"1598","article_processing_charge":"No"},{"scopus_import":"1","date_updated":"2025-09-23T13:50:55Z","publication_status":"published","language":[{"iso":"eng"}],"oa_version":"Submitted Version","doi":"10.1007/978-3-319-21690-4_31","title":"The Hanoi omega-automata format","abstract":[{"lang":"eng","text":"We propose a flexible exchange format for ω-automata, as typically used in formal verification, and implement support for it in a range of established tools. Our aim is to simplify the interaction of tools, helping the research community to build upon other people’s work. A key feature of the format is the use of very generic acceptance conditions, specified by Boolean combinations of acceptance primitives, rather than being limited to common cases such as Büchi, Streett, or Rabin. Such flexibility in the choice of acceptance conditions can be exploited in applications, for example in probabilistic model checking, and furthermore encourages the development of acceptance-agnostic tools for automata manipulations. The format allows acceptance conditions that are either state-based or transition-based, and also supports alternating automata."}],"external_id":{"isi":["000364182900031"]},"month":"07","ddc":["000"],"isi":1,"date_created":"2018-12-11T11:52:57Z","page":"479 - 486","oa":1,"intvolume":"      9206","alternative_title":["LNCS"],"publisher":"Springer","_id":"1601","author":[{"first_name":"Tomáš","last_name":"Babiak","full_name":"Babiak, Tomáš"},{"full_name":"Blahoudek, František","last_name":"Blahoudek","first_name":"František"},{"last_name":"Duret Lutz","full_name":"Duret Lutz, Alexandre","first_name":"Alexandre"},{"first_name":"Joachim","full_name":"Klein, Joachim","last_name":"Klein"},{"first_name":"Jan","id":"44CEF464-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8122-2881","full_name":"Kretinsky, Jan","last_name":"Kretinsky"},{"first_name":"Daniel","full_name":"Mueller, Daniel","last_name":"Mueller"},{"first_name":"David","last_name":"Parker","full_name":"Parker, David"},{"last_name":"Strejček","full_name":"Strejček, Jan","first_name":"Jan"}],"article_processing_charge":"No","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"date_published":"2015-07-16T00:00:00Z","day":"16","year":"2015","conference":{"name":"CAV: Computer Aided Verification","start_date":"2015-07-18","location":"San Francisco, CA, United States","end_date":"2015-07-24"},"publist_id":"5566","status":"public","ec_funded":1,"file":[{"date_created":"2020-05-15T08:38:12Z","file_size":1651779,"date_updated":"2020-07-14T12:45:04Z","access_level":"open_access","relation":"main_file","file_id":"7850","creator":"dernst","content_type":"application/pdf","checksum":"5885236fa88a439baba9ac6f3e801e93","file_name":"2015_CAV_Babiak.pdf"}],"file_date_updated":"2020-07-14T12:45:04Z","volume":9206,"has_accepted_license":"1","project":[{"grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","call_identifier":"FP7"},{"grant_number":"Z211","name":"Formal methods for the design and analysis of complex systems","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"grant_number":"291734","call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF","grant_number":"S 11407_N23"}],"quality_controlled":"1","type":"conference","citation":{"apa":"Babiak, T., Blahoudek, F., Duret Lutz, A., Klein, J., Kretinsky, J., Mueller, D., … Strejček, J. (2015). The Hanoi omega-automata format (Vol. 9206, pp. 479–486). Presented at the CAV: Computer Aided Verification, San Francisco, CA, United States: Springer. <a href=\"https://doi.org/10.1007/978-3-319-21690-4_31\">https://doi.org/10.1007/978-3-319-21690-4_31</a>","ieee":"T. Babiak <i>et al.</i>, “The Hanoi omega-automata format,” presented at the CAV: Computer Aided Verification, San Francisco, CA, United States, 2015, vol. 9206, pp. 479–486.","short":"T. Babiak, F. Blahoudek, A. Duret Lutz, J. Klein, J. Kretinsky, D. Mueller, D. Parker, J. Strejček, in:, Springer, 2015, pp. 479–486.","chicago":"Babiak, Tomáš, František Blahoudek, Alexandre Duret Lutz, Joachim Klein, Jan Kretinsky, Daniel Mueller, David Parker, and Jan Strejček. “The Hanoi Omega-Automata Format,” 9206:479–86. Springer, 2015. <a href=\"https://doi.org/10.1007/978-3-319-21690-4_31\">https://doi.org/10.1007/978-3-319-21690-4_31</a>.","ista":"Babiak T, Blahoudek F, Duret Lutz A, Klein J, Kretinsky J, Mueller D, Parker D, Strejček J. 2015. The Hanoi omega-automata format. CAV: Computer Aided Verification, LNCS, vol. 9206, 479–486.","ama":"Babiak T, Blahoudek F, Duret Lutz A, et al. The Hanoi omega-automata format. In: Vol 9206. Springer; 2015:479-486. doi:<a href=\"https://doi.org/10.1007/978-3-319-21690-4_31\">10.1007/978-3-319-21690-4_31</a>","mla":"Babiak, Tomáš, et al. <i>The Hanoi Omega-Automata Format</i>. Vol. 9206, Springer, 2015, pp. 479–86, doi:<a href=\"https://doi.org/10.1007/978-3-319-21690-4_31\">10.1007/978-3-319-21690-4_31</a>."}},{"oa":1,"intvolume":"      9206","isi":1,"month":"07","corr_author":"1","page":"158 - 177","date_created":"2018-12-11T11:52:58Z","doi":"10.1007/978-3-319-21690-4_10","title":"Counterexample explanation by learning small strategies in Markov decision processes","abstract":[{"text":"For deterministic systems, a counterexample to a property can simply be an error trace, whereas counterexamples in probabilistic systems are necessarily more complex. For instance, a set of erroneous traces with a sufficient cumulative probability mass can be used. Since these are too large objects to understand and manipulate, compact representations such as subchains have been considered. In the case of probabilistic systems with non-determinism, the situation is even more complex. While a subchain for a given strategy (or scheduler, resolving non-determinism) is a straightforward choice, we take a different approach. Instead, we focus on the strategy itself, and extract the most important decisions it makes, and present its succinct representation.\r\nThe key tools we employ to achieve this are (1) introducing a concept of importance of a state w.r.t. the strategy, and (2) learning using decision trees. There are three main consequent advantages of our approach. Firstly, it exploits the quantitative information on states, stressing the more important decisions. Secondly, it leads to a greater variability and degree of freedom in representing the strategies. Thirdly, the representation uses a self-explanatory data structure. In summary, our approach produces more succinct and more explainable strategies, as opposed to e.g. binary decision diagrams. Finally, our experimental results show that we can extract several rules describing the strategy even for very large systems that do not fit in memory, and based on the rules explain the erroneous behaviour.","lang":"eng"}],"external_id":{"isi":["000364182900010"],"arxiv":["1502.02834"]},"scopus_import":"1","publication_status":"published","date_updated":"2025-09-23T08:23:16Z","oa_version":"Preprint","language":[{"iso":"eng"}],"type":"conference","quality_controlled":"1","project":[{"grant_number":"P 23499-N23","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"},{"call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"Formal methods for the design and analysis of complex systems","grant_number":"Z211"},{"call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307"},{"name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"267989"},{"_id":"25681D80-B435-11E9-9278-68D0E5697425","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7","grant_number":"291734"}],"citation":{"mla":"Brázdil, Tomáš, et al. <i>Counterexample Explanation by Learning Small Strategies in Markov Decision Processes</i>. Vol. 9206, Springer, 2015, pp. 158–77, doi:<a href=\"https://doi.org/10.1007/978-3-319-21690-4_10\">10.1007/978-3-319-21690-4_10</a>.","short":"T. Brázdil, K. Chatterjee, M. Chmelik, A. Fellner, J. Kretinsky, in:, Springer, 2015, pp. 158–177.","chicago":"Brázdil, Tomáš, Krishnendu Chatterjee, Martin Chmelik, Andreas Fellner, and Jan Kretinsky. “Counterexample Explanation by Learning Small Strategies in Markov Decision Processes,” 9206:158–77. Springer, 2015. <a href=\"https://doi.org/10.1007/978-3-319-21690-4_10\">https://doi.org/10.1007/978-3-319-21690-4_10</a>.","apa":"Brázdil, T., Chatterjee, K., Chmelik, M., Fellner, A., &#38; Kretinsky, J. (2015). Counterexample explanation by learning small strategies in Markov decision processes (Vol. 9206, pp. 158–177). Presented at the CAV: Computer Aided Verification, San Francisco, CA, United States: Springer. <a href=\"https://doi.org/10.1007/978-3-319-21690-4_10\">https://doi.org/10.1007/978-3-319-21690-4_10</a>","ieee":"T. Brázdil, K. Chatterjee, M. Chmelik, A. Fellner, and J. Kretinsky, “Counterexample explanation by learning small strategies in Markov decision processes,” presented at the CAV: Computer Aided Verification, San Francisco, CA, United States, 2015, vol. 9206, pp. 158–177.","ista":"Brázdil T, Chatterjee K, Chmelik M, Fellner A, Kretinsky J. 2015. Counterexample explanation by learning small strategies in Markov decision processes. CAV: Computer Aided Verification, LNCS, vol. 9206, 158–177.","ama":"Brázdil T, Chatterjee K, Chmelik M, Fellner A, Kretinsky J. Counterexample explanation by learning small strategies in Markov decision processes. In: Vol 9206. Springer; 2015:158-177. doi:<a href=\"https://doi.org/10.1007/978-3-319-21690-4_10\">10.1007/978-3-319-21690-4_10</a>"},"main_file_link":[{"url":"http://arxiv.org/abs/1502.02834","open_access":"1"}],"related_material":{"record":[{"id":"5549","status":"public","relation":"research_paper"}]},"publication_identifier":{"eisbn":["978-3-319-21690-4"]},"conference":{"end_date":"2015-07-24","location":"San Francisco, CA, United States","start_date":"2015-07-18","name":"CAV: Computer Aided Verification"},"arxiv":1,"acknowledgement":"This research was funded in part by Austrian Science Fund (FWF) Grant No P 23499-N23, FWF NFN Grant No S11407-N23 (RiSE) and Z211-N23 (Wittgenstein Award), European Research Council (ERC) Grant No 279307 (Graph Games), ERC Grant No 267989 (QUAREM), the Czech Science Foundation Grant No P202/12/G061, and People Programme (Marie Curie Actions) of the European Union’s Seventh Framework Programme (FP7/2007–2013) REA Grant No 291734.","publist_id":"5564","status":"public","ec_funded":1,"volume":9206,"publisher":"Springer","alternative_title":["LNCS"],"article_processing_charge":"No","_id":"1603","author":[{"full_name":"Brázdil, Tomáš","last_name":"Brázdil","first_name":"Tomáš"},{"full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"first_name":"Martin","id":"3624234E-F248-11E8-B48F-1D18A9856A87","last_name":"Chmelik","full_name":"Chmelik, Martin"},{"last_name":"Fellner","full_name":"Fellner, Andreas","id":"42BABFB4-F248-11E8-B48F-1D18A9856A87","first_name":"Andreas"},{"last_name":"Kretinsky","full_name":"Kretinsky, Jan","orcid":"0000-0002-8122-2881","id":"44CEF464-F248-11E8-B48F-1D18A9856A87","first_name":"Jan"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"year":"2015","day":"16","date_published":"2015-07-16T00:00:00Z"},{"scopus_import":1,"publication_status":"published","date_updated":"2025-04-15T06:26:03Z","language":[{"iso":"eng"}],"oa_version":"Submitted Version","doi":"10.1007/978-3-319-26287-1_2","title":"Abstraction-based parameter synthesis for multiaffine systems","abstract":[{"lang":"eng","text":"Multiaffine hybrid automata (MHA) represent a powerful formalism to model complex dynamical systems. This formalism is particularly suited for the representation of biological systems which often exhibit highly non-linear behavior. In this paper, we consider the problem of parameter identification for MHA. We present an abstraction of MHA based on linear hybrid automata, which can be analyzed by the SpaceEx model checker. This abstraction enables a precise handling of time-dependent properties. We demonstrate the potential of our approach on a model of a genetic regulatory network and a myocyte model."}],"month":"11","ddc":["000"],"corr_author":"1","date_created":"2018-12-11T11:52:59Z","page":"19 - 35","oa":1,"intvolume":"      9434","alternative_title":["LNCS"],"publisher":"Springer","_id":"1605","author":[{"full_name":"Bogomolov, Sergiy","last_name":"Bogomolov","first_name":"Sergiy","id":"369D9A44-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0686-0365"},{"id":"3A2F4DCE-F248-11E8-B48F-1D18A9856A87","first_name":"Christian","orcid":"0000-0003-3658-1065","full_name":"Schilling, Christian","last_name":"Schilling"},{"last_name":"Bartocci","full_name":"Bartocci, Ezio","first_name":"Ezio"},{"full_name":"Batt, Grégory","last_name":"Batt","first_name":"Grégory"},{"id":"3BDE25AA-F248-11E8-B48F-1D18A9856A87","first_name":"Hui","orcid":"0000-0002-3066-6941","full_name":"Kong, Hui","last_name":"Kong"},{"first_name":"Radu","last_name":"Grosu","full_name":"Grosu, Radu"}],"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"ToHe"}],"date_published":"2015-11-28T00:00:00Z","year":"2015","day":"28","conference":{"start_date":"2015-11-17","name":"HVC: Haifa Verification Conference","location":"Haifa, Israel","end_date":"2015-11-19"},"acknowledgement":"This work was partly supported by the European Research Council (ERC) under grant 267989 (QUAREM), by the Austrian Science Fund (FWF) under grants S11402-N23, S11405-N23 and S11412-N23 (RiSE/SHiNE) and Z211-N23 (Wittgenstein Award), and by the German Research Foundation (DFG) as part of the Transregional Collaborative Research Center “Automatic Verification and Analysis of Complex Systems” (SFB/TR 14 AVACS, http://www.avacs.org/).","publist_id":"5561","ec_funded":1,"status":"public","file":[{"access_level":"open_access","date_updated":"2020-07-14T12:45:05Z","file_size":1053207,"date_created":"2020-05-15T08:43:19Z","content_type":"application/pdf","file_name":"2015_LNCS_Bogomolov.pdf","checksum":"3aab260f3f34641d622030ba22645b3e","creator":"dernst","file_id":"7851","relation":"main_file"}],"file_date_updated":"2020-07-14T12:45:05Z","volume":9434,"has_accepted_license":"1","quality_controlled":"1","project":[{"grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","call_identifier":"FP7"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"Formal methods for the design and analysis of complex systems","call_identifier":"FWF","grant_number":"Z211"},{"name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S 11407_N23"}],"type":"conference","citation":{"mla":"Bogomolov, Sergiy, et al. <i>Abstraction-Based Parameter Synthesis for Multiaffine Systems</i>. Vol. 9434, Springer, 2015, pp. 19–35, doi:<a href=\"https://doi.org/10.1007/978-3-319-26287-1_2\">10.1007/978-3-319-26287-1_2</a>.","ieee":"S. Bogomolov, C. Schilling, E. Bartocci, G. Batt, H. Kong, and R. Grosu, “Abstraction-based parameter synthesis for multiaffine systems,” presented at the HVC: Haifa Verification Conference, Haifa, Israel, 2015, vol. 9434, pp. 19–35.","apa":"Bogomolov, S., Schilling, C., Bartocci, E., Batt, G., Kong, H., &#38; Grosu, R. (2015). Abstraction-based parameter synthesis for multiaffine systems (Vol. 9434, pp. 19–35). Presented at the HVC: Haifa Verification Conference, Haifa, Israel: Springer. <a href=\"https://doi.org/10.1007/978-3-319-26287-1_2\">https://doi.org/10.1007/978-3-319-26287-1_2</a>","chicago":"Bogomolov, Sergiy, Christian Schilling, Ezio Bartocci, Grégory Batt, Hui Kong, and Radu Grosu. “Abstraction-Based Parameter Synthesis for Multiaffine Systems,” 9434:19–35. Springer, 2015. <a href=\"https://doi.org/10.1007/978-3-319-26287-1_2\">https://doi.org/10.1007/978-3-319-26287-1_2</a>.","short":"S. Bogomolov, C. Schilling, E. Bartocci, G. Batt, H. Kong, R. Grosu, in:, Springer, 2015, pp. 19–35.","ista":"Bogomolov S, Schilling C, Bartocci E, Batt G, Kong H, Grosu R. 2015. Abstraction-based parameter synthesis for multiaffine systems. HVC: Haifa Verification Conference, LNCS, vol. 9434, 19–35.","ama":"Bogomolov S, Schilling C, Bartocci E, Batt G, Kong H, Grosu R. Abstraction-based parameter synthesis for multiaffine systems. In: Vol 9434. Springer; 2015:19-35. doi:<a href=\"https://doi.org/10.1007/978-3-319-26287-1_2\">10.1007/978-3-319-26287-1_2</a>"}},{"publication_identifier":{"isbn":["978-3-319-23819-7"]},"project":[{"call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","grant_number":"267989"},{"grant_number":"Z211","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"Formal methods for the design and analysis of complex systems"},{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF"}],"quality_controlled":"1","type":"conference","citation":{"ista":"Nguyen L, Schilling C, Bogomolov S, Johnson T. 2015. Runtime verification for hybrid analysis tools. 6th International Conference. RV: Runtime Verification, LNCS, vol. 9333, 281–286.","ama":"Nguyen L, Schilling C, Bogomolov S, Johnson T. Runtime verification for hybrid analysis tools. In: <i>6th International Conference</i>. Vol 9333. Springer Nature; 2015:281-286. doi:<a href=\"https://doi.org/10.1007/978-3-319-23820-3_19\">10.1007/978-3-319-23820-3_19</a>","short":"L. Nguyen, C. Schilling, S. Bogomolov, T. Johnson, in:, 6th International Conference, Springer Nature, 2015, pp. 281–286.","chicago":"Nguyen, Luan, Christian Schilling, Sergiy Bogomolov, and Taylor Johnson. “Runtime Verification for Hybrid Analysis Tools.” In <i>6th International Conference</i>, 9333:281–86. Springer Nature, 2015. <a href=\"https://doi.org/10.1007/978-3-319-23820-3_19\">https://doi.org/10.1007/978-3-319-23820-3_19</a>.","ieee":"L. Nguyen, C. Schilling, S. Bogomolov, and T. Johnson, “Runtime verification for hybrid analysis tools,” in <i>6th International Conference</i>, Vienna, Austria, 2015, vol. 9333, pp. 281–286.","apa":"Nguyen, L., Schilling, C., Bogomolov, S., &#38; Johnson, T. (2015). Runtime verification for hybrid analysis tools. In <i>6th International Conference</i> (Vol. 9333, pp. 281–286). Vienna, Austria: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-319-23820-3_19\">https://doi.org/10.1007/978-3-319-23820-3_19</a>","mla":"Nguyen, Luan, et al. “Runtime Verification for Hybrid Analysis Tools.” <i>6th International Conference</i>, vol. 9333, Springer Nature, 2015, pp. 281–86, doi:<a href=\"https://doi.org/10.1007/978-3-319-23820-3_19\">10.1007/978-3-319-23820-3_19</a>."},"article_processing_charge":"No","_id":"1606","author":[{"first_name":"Luan","full_name":"Nguyen, Luan","last_name":"Nguyen"},{"full_name":"Schilling, Christian","last_name":"Schilling","first_name":"Christian"},{"last_name":"Bogomolov","full_name":"Bogomolov, Sergiy","orcid":"0000-0002-0686-0365","first_name":"Sergiy","id":"369D9A44-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Taylor","last_name":"Johnson","full_name":"Johnson, Taylor"}],"alternative_title":["LNCS"],"publisher":"Springer Nature","date_published":"2015-11-15T00:00:00Z","year":"2015","day":"15","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","department":[{"_id":"ToHe"}],"publist_id":"5562","conference":{"start_date":"2015-09-22","name":"RV: Runtime Verification","location":"Vienna, Austria","end_date":"2015-09-25"},"volume":9333,"status":"public","ec_funded":1,"month":"11","isi":1,"date_created":"2018-12-11T11:52:59Z","publication":"6th International Conference","page":"281 - 286","intvolume":"      9333","date_updated":"2025-09-23T10:41:02Z","publication_status":"published","scopus_import":"1","language":[{"iso":"eng"}],"oa_version":"None","doi":"10.1007/978-3-319-23820-3_19","external_id":{"isi":["000370624400019"]},"title":"Runtime verification for hybrid analysis tools","abstract":[{"text":"In this paper, we present the first steps toward a runtime verification framework for monitoring hybrid and cyber-physical systems (CPS) development tools based on randomized differential testing. The development tools include hybrid systems reachability analysis tools, model-based development environments like Simulink/Stateflow (SLSF), etc. First, hybrid automaton models are randomly generated. Next, these hybrid automaton models are translated to a number of different tools (currently, SpaceEx, dReach, Flow*, HyCreate, and the MathWorks’ Simulink/Stateflow) using the HyST source transformation and translation tool. Then, the hybrid automaton models are executed in the different tools and their outputs are parsed. The final step is the differential comparison: the outputs of the different tools are compared. If the results do not agree (in the sense that an analysis or verification result from one tool does not match that of another tool, ignoring timeouts, etc.), a candidate bug is flagged and the model is saved for future analysis by the user. The process then repeats and the monitoring continues until the user terminates the process. We present preliminary results that have been useful in identifying a few bugs in the analysis methods of different development tools, and in an earlier version of HyST.","lang":"eng"}]},{"publication":"42nd International Colloquium","page":"108 - 120","date_created":"2018-12-11T11:53:00Z","isi":1,"month":"06","corr_author":"1","intvolume":"      9135","oa":1,"oa_version":"Preprint","language":[{"iso":"eng"}],"scopus_import":"1","publication_status":"published","date_updated":"2025-09-23T13:48:35Z","abstract":[{"lang":"eng","text":"The synthesis problem asks for the automatic construction of a system from its specification. In the traditional setting, the system is “constructed from scratch” rather than composed from reusable components. However, this is rare in practice, and almost every non-trivial software system relies heavily on the use of libraries of reusable components. Recently, Lustig and Vardi introduced dataflow and controlflow synthesis from libraries of reusable components. They proved that dataflow synthesis is undecidable, while controlflow synthesis is decidable. The problem of controlflow synthesis from libraries of probabilistic components was considered by Nain, Lustig and Vardi, and was shown to be decidable for qualitative analysis (that asks that the specification be satisfied with probability 1). Our main contribution for controlflow synthesis from probabilistic components is to establish better complexity bounds for the qualitative analysis problem, and to show that the more general quantitative problem is undecidable. For the qualitative analysis, we show that the problem (i) is EXPTIME-complete when the specification is given as a deterministic parity word automaton, improving the previously known 2EXPTIME upper bound; and (ii) belongs to UP ∩ coUP and is parity-games hard, when the specification is given directly as a parity condition on the components, improving the previously known EXPTIME upper bound."}],"title":"The complexity of synthesis from probabilistic components","external_id":{"arxiv":["1502.04844"],"isi":["000364317900009"]},"doi":"10.1007/978-3-662-47666-6_9","publication_identifier":{"isbn":["978-3-662-47665-9"]},"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1502.04844"}],"citation":{"ieee":"K. Chatterjee, L. Doyen, and M. Vardi, “The complexity of synthesis from probabilistic components,” in <i>42nd International Colloquium</i>, Kyoto, Japan, 2015, vol. 9135, pp. 108–120.","apa":"Chatterjee, K., Doyen, L., &#38; Vardi, M. (2015). The complexity of synthesis from probabilistic components. In <i>42nd International Colloquium</i> (Vol. 9135, pp. 108–120). Kyoto, Japan: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-662-47666-6_9\">https://doi.org/10.1007/978-3-662-47666-6_9</a>","short":"K. Chatterjee, L. Doyen, M. Vardi, in:, 42nd International Colloquium, Springer Nature, 2015, pp. 108–120.","chicago":"Chatterjee, Krishnendu, Laurent Doyen, and Moshe Vardi. “The Complexity of Synthesis from Probabilistic Components.” In <i>42nd International Colloquium</i>, 9135:108–20. Springer Nature, 2015. <a href=\"https://doi.org/10.1007/978-3-662-47666-6_9\">https://doi.org/10.1007/978-3-662-47666-6_9</a>.","ista":"Chatterjee K, Doyen L, Vardi M. 2015. The complexity of synthesis from probabilistic components. 42nd International Colloquium. ICALP: Automata, Languages and Programming, LNCS, vol. 9135, 108–120.","ama":"Chatterjee K, Doyen L, Vardi M. The complexity of synthesis from probabilistic components. In: <i>42nd International Colloquium</i>. Vol 9135. Springer Nature; 2015:108-120. doi:<a href=\"https://doi.org/10.1007/978-3-662-47666-6_9\">10.1007/978-3-662-47666-6_9</a>","mla":"Chatterjee, Krishnendu, et al. “The Complexity of Synthesis from Probabilistic Components.” <i>42nd International Colloquium</i>, vol. 9135, Springer Nature, 2015, pp. 108–20, doi:<a href=\"https://doi.org/10.1007/978-3-662-47666-6_9\">10.1007/978-3-662-47666-6_9</a>."},"type":"conference","project":[{"grant_number":"P 23499-N23","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407"},{"grant_number":"279307","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications"}],"quality_controlled":"1","department":[{"_id":"KrCh"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","year":"2015","day":"20","date_published":"2015-06-20T00:00:00Z","publisher":"Springer Nature","alternative_title":["LNCS"],"_id":"1609","author":[{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Laurent","full_name":"Doyen, Laurent","last_name":"Doyen"},{"last_name":"Vardi","full_name":"Vardi, Moshe","first_name":"Moshe"}],"article_processing_charge":"No","ec_funded":1,"status":"public","volume":9135,"arxiv":1,"conference":{"name":"ICALP: Automata, Languages and Programming","start_date":"2015-07-06","location":"Kyoto, Japan","end_date":"2015-07-10"},"acknowledgement":"This research was supported by Austrian Science Fund (FWF) Grant No P23499- N23, FWF NFN Grant No S11407-N23 (SHiNE), ERC Start grant (279307: Graph Games), EU FP7 Project Cassting, NSF grants CNS 1049862 and CCF-1139011, by NSF Expeditions in Computing project “ExCAPE: Expeditions in Computer Augmented Program Engineering”, by BSF grant 9800096, and by gift from Intel.","publist_id":"5557"}]