[{"date_published":"2015-11-27T00:00:00Z","main_file_link":[{"url":"http://arxiv.org/abs/1508.01076","open_access":"1"}],"author":[{"full_name":"Aichholzer, Oswin","first_name":"Oswin","last_name":"Aichholzer"},{"last_name":"Biedl","full_name":"Biedl, Therese","first_name":"Therese"},{"last_name":"Hackl","first_name":"Thomas","full_name":"Hackl, Thomas"},{"first_name":"Martin","full_name":"Held, Martin","last_name":"Held"},{"last_name":"Huber","id":"4700A070-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8871-5814","full_name":"Huber, Stefan","first_name":"Stefan"},{"full_name":"Palfrader, Peter","first_name":"Peter","last_name":"Palfrader"},{"full_name":"Vogtenhuber, Birgit","first_name":"Birgit","last_name":"Vogtenhuber"}],"scopus_import":"1","date_updated":"2025-09-23T10:35:07Z","title":"Representing directed trees as straight skeletons","day":"27","publication_status":"published","oa_version":"Preprint","doi":"10.1007/978-3-319-27261-0_28","language":[{"iso":"eng"}],"arxiv":1,"publist_id":"5581","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."}],"type":"book_chapter","intvolume":"      9411","status":"public","isi":1,"month":"11","article_processing_charge":"No","quality_controlled":"1","department":[{"_id":"HeEd"}],"page":"335 - 347","publisher":"Springer Nature","oa":1,"volume":9411,"citation":{"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.","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>","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.","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>","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.","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>.","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>."},"date_created":"2018-12-11T11:52:54Z","alternative_title":["LNCS"],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publication_identifier":{"eisbn":["978-3-319-27261-0"],"isbn":["978-3-319-27260-3"]},"year":"2015","external_id":{"isi":["000373628600028"],"arxiv":["1508.01076"]},"conference":{"end_date":"2015-09-26","name":"GD: Graph Drawing and Network Visualization","location":"Los Angeles, CA, United States","start_date":"2015-09-24"},"publication":"Graph Drawing and Network Visualization","_id":"1590"},{"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."}],"type":"journal_article","isi":1,"month":"04","status":"public","intvolume":"         6","doi":"10.3389/fpls.2015.00218","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"oa_version":"Published Version","publication_status":"published","publist_id":"5578","language":[{"iso":"eng"}],"title":"Strategies of seedlings to overcome their sessile nature: Auxin in mobility control","date_updated":"2025-09-23T10:49:06Z","day":"14","author":[{"full_name":"Žádníková, Petra","first_name":"Petra","last_name":"Žádníková"},{"full_name":"Smet, Dajo","first_name":"Dajo","last_name":"Smet"},{"id":"40A4B9E6-F248-11E8-B48F-1D18A9856A87","last_name":"Zhu","full_name":"Zhu, Qiang","first_name":"Qiang"},{"full_name":"Van Der Straeten, Dominique","first_name":"Dominique","last_name":"Van Der Straeten"},{"orcid":"0000-0002-8510-9739","first_name":"Eva","full_name":"Benková, Eva","id":"38F4F166-F248-11E8-B48F-1D18A9856A87","last_name":"Benková"}],"date_published":"2015-04-14T00:00:00Z","file_date_updated":"2020-07-14T12:45:03Z","scopus_import":"1","has_accepted_license":"1","ec_funded":1,"pubrep_id":"471","_id":"1593","publication":"Frontiers in Plant Science","corr_author":"1","ddc":["570"],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_created":"2018-12-11T11:52:55Z","external_id":{"isi":["000353577800001"]},"year":"2015","file":[{"creator":"system","file_id":"5142","access_level":"open_access","content_type":"application/pdf","relation":"main_file","checksum":"c454d642e18dfa86820b97a86cd6d3cc","date_created":"2018-12-12T10:15:23Z","date_updated":"2020-07-14T12:45:03Z","file_size":965690,"file_name":"IST-2016-471-v1+1_fpls-06-00218.pdf"}],"department":[{"_id":"EvBe"}],"publisher":"Frontiers Research Foundation","quality_controlled":"1","article_processing_charge":"No","issue":"4","project":[{"name":"Hormonal cross-talk in plant organogenesis","grant_number":"207362","call_identifier":"FP7","_id":"253FCA6A-B435-11E9-9278-68D0E5697425"}],"citation":{"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>.","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>.","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>","short":"P. Žádníková, D. Smet, Q. Zhu, D. Van Der Straeten, E. Benková, Frontiers in Plant Science 6 (2015).","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>"},"volume":6,"oa":1},{"isi":1,"month":"11","status":"public","intvolume":"      9450","type":"conference","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"}],"publist_id":"5577","language":[{"iso":"eng"}],"doi":"10.1007/978-3-662-48899-7_12","oa_version":"None","publication_status":"published","day":"22","date_updated":"2025-09-23T08:21:59Z","title":"Controller synthesis for MDPs and frequency LTL\\GU","scopus_import":"1","ec_funded":1,"author":[{"last_name":"Forejt","full_name":"Forejt, Vojtěch","first_name":"Vojtěch"},{"last_name":"Krčál","full_name":"Krčál, Jan","first_name":"Jan"},{"id":"44CEF464-F248-11E8-B48F-1D18A9856A87","last_name":"Kretinsky","orcid":"0000-0002-8122-2881","full_name":"Kretinsky, Jan","first_name":"Jan"}],"date_published":"2015-11-22T00:00:00Z","_id":"1594","conference":{"start_date":"2015-11-24","name":"LPAR: Logic for Programming, Artificial Intelligence, and Reasoning","location":"Suva, Fiji","end_date":"2015-11-28"},"external_id":{"isi":["000375574900012"]},"year":"2015","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","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","alternative_title":["LNCS"],"date_created":"2018-12-11T11:52:55Z","project":[{"_id":"25681D80-B435-11E9-9278-68D0E5697425","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7","grant_number":"291734"},{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FP7","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425"}],"citation":{"short":"V. Forejt, J. Krčál, J. Kretinsky, in:, Springer, 2015, pp. 162–177.","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>","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.","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>.","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>.","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."},"volume":9450,"department":[{"_id":"ToHe"},{"_id":"KrCh"}],"page":"162 - 177","publisher":"Springer","quality_controlled":"1","article_processing_charge":"No"},{"quality_controlled":"1","article_processing_charge":"No","page":"99 - 110","publisher":"Springer","file":[{"file_name":"IST-2016-594-v1+1_HTCylinder_GD_Revision.pdf","date_updated":"2020-07-14T12:45:03Z","file_size":330135,"checksum":"685f91bd077a951ba067d42cce75409e","date_created":"2018-12-12T10:08:36Z","relation":"main_file","creator":"system","content_type":"application/pdf","access_level":"open_access","file_id":"4697"}],"department":[{"_id":"UlWa"}],"citation":{"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.","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>","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>","short":"R. Fulek, M. Pelsmajer, M. Schaefer, in:, Springer, 2015, pp. 99–110.","ista":"Fulek R, Pelsmajer M, Schaefer M. 2015. Hanani-Tutte for radial planarity. GD: Graph Drawing and Network Visualization, LNCS, vol. 9411, 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>.","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>."},"oa":1,"volume":9411,"project":[{"call_identifier":"FP7","grant_number":"291734","name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425"}],"date_created":"2018-12-11T11:52:55Z","alternative_title":["LNCS"],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","year":"2015","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].","external_id":{"isi":["000373628600009"]},"conference":{"end_date":"2015-09-26","location":"Los Angeles, CA, USA","name":"GD: Graph Drawing and Network Visualization","start_date":"2015-09-24"},"ddc":["510"],"_id":"1595","date_published":"2015-11-27T00:00:00Z","file_date_updated":"2020-07-14T12:45:03Z","author":[{"last_name":"Fulek","id":"39F3FFE4-F248-11E8-B48F-1D18A9856A87","full_name":"Fulek, Radoslav","first_name":"Radoslav","orcid":"0000-0001-8485-1774"},{"last_name":"Pelsmajer","full_name":"Pelsmajer, Michael","first_name":"Michael"},{"last_name":"Schaefer","full_name":"Schaefer, Marcus","first_name":"Marcus"}],"has_accepted_license":"1","ec_funded":1,"pubrep_id":"594","scopus_import":"1","date_updated":"2025-09-23T09:13:43Z","title":"Hanani-Tutte for radial planarity","day":"27","publication_status":"published","doi":"10.1007/978-3-319-27261-0_9","oa_version":"Submitted Version","language":[{"iso":"eng"}],"publist_id":"5576","related_material":{"record":[{"status":"public","relation":"later_version","id":"1113"},{"id":"1164","relation":"later_version","status":"public"}]},"type":"conference","abstract":[{"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.","lang":"eng"}],"intvolume":"      9411","month":"11","isi":1,"status":"public"},{"department":[{"_id":"UlWa"}],"publisher":"Springer Nature","file":[{"creator":"system","content_type":"application/pdf","access_level":"open_access","file_id":"5258","relation":"main_file","date_updated":"2020-07-14T12:45:04Z","file_size":312992,"checksum":"eec04f86c5921d04f025d5791db9b965","date_created":"2018-12-12T10:17:06Z","file_name":"IST-2016-595-v1+1_VerticalVisibilityGDRevision.pdf"}],"page":"373 - 379","quality_controlled":"1","article_processing_charge":"No","project":[{"_id":"25681D80-B435-11E9-9278-68D0E5697425","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7","grant_number":"291734"}],"citation":{"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.","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.","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>","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>.","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>.","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."},"volume":9411,"oa":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publication_identifier":{"isbn":["978-3-319-27260-3"]},"date_created":"2018-12-11T11:52:56Z","alternative_title":["LNCS"],"external_id":{"isi":["000373628600031"]},"year":"2015","publication":"Graph Drawing and Network Visualization","corr_author":"1","conference":{"name":"GD: Graph Drawing and Network Visualization","end_date":"2015-09-26","location":"Los Angeles, CA, United States","start_date":"2015-09-24"},"ddc":["510"],"_id":"1596","author":[{"first_name":"Radoslav","full_name":"Fulek, Radoslav","orcid":"0000-0001-8485-1774","id":"39F3FFE4-F248-11E8-B48F-1D18A9856A87","last_name":"Fulek"},{"last_name":"Radoičić","first_name":"Radoš","full_name":"Radoičić, Radoš"}],"date_published":"2015-11-27T00:00:00Z","file_date_updated":"2020-07-14T12:45:04Z","scopus_import":"1","ec_funded":1,"has_accepted_license":"1","pubrep_id":"595","date_updated":"2025-09-29T11:05:28Z","title":"Vertical visibility among parallel polygons in three dimensions","day":"27","doi":"10.1007/978-3-319-27261-0_31","oa_version":"Submitted Version","publication_status":"published","publist_id":"5575","language":[{"iso":"eng"}],"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"}],"type":"book_chapter","isi":1,"month":"11","status":"public","intvolume":"      9411"},{"citation":{"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>.","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.","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>","short":"K. Chatterjee, M. Joglekar, N. Shah, Theoretical Computer Science 573 (2015) 71–89.","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.","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>"},"volume":573,"oa":1,"issue":"3","project":[{"name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"name":"Game Theory","grant_number":"S11407","call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"grant_number":"279307","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"quality_controlled":"1","article_processing_charge":"No","publisher":"Elsevier","department":[{"_id":"KrCh"}],"page":"71 - 89","year":"2015","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","external_id":{"arxiv":["1202.4175"],"isi":["000350835500007"]},"date_created":"2018-12-11T11:52:56Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publication":"Theoretical Computer Science","_id":"1598","ec_funded":1,"scopus_import":"1","date_published":"2015-03-30T00:00:00Z","author":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee"},{"last_name":"Joglekar","full_name":"Joglekar, Manas","first_name":"Manas"},{"first_name":"Nisarg","full_name":"Shah, Nisarg","last_name":"Shah"}],"main_file_link":[{"url":"http://arxiv.org/abs/1202.4175","open_access":"1"}],"day":"30","date_updated":"2025-09-23T08:00:31Z","title":"Average case analysis of the classical algorithm for Markov decision processes with Büchi objectives","arxiv":1,"language":[{"iso":"eng"}],"publist_id":"5571","publication_status":"published","doi":"10.1016/j.tcs.2015.01.050","oa_version":"Preprint","intvolume":"       573","month":"03","isi":1,"status":"public","type":"journal_article","abstract":[{"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.","lang":"eng"}],"related_material":{"record":[{"status":"public","relation":"earlier_version","id":"2715"}]}},{"ddc":["000"],"conference":{"name":"CAV: Computer Aided Verification","location":"San Francisco, CA, United States","end_date":"2015-07-24","start_date":"2015-07-18"},"_id":"1601","oa":1,"volume":9206,"citation":{"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.","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>.","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>.","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.","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>"},"project":[{"grant_number":"267989","call_identifier":"FP7","name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"Formal methods for the design and analysis of complex systems","grant_number":"Z211","call_identifier":"FWF"},{"call_identifier":"FP7","grant_number":"291734","name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","call_identifier":"FWF","name":"Rigorous Systems Engineering"}],"article_processing_charge":"No","quality_controlled":"1","file":[{"relation":"main_file","file_id":"7850","access_level":"open_access","content_type":"application/pdf","creator":"dernst","file_name":"2015_CAV_Babiak.pdf","date_created":"2020-05-15T08:38:12Z","checksum":"5885236fa88a439baba9ac6f3e801e93","file_size":1651779,"date_updated":"2020-07-14T12:45:04Z"}],"publisher":"Springer","page":"479 - 486","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"year":"2015","external_id":{"isi":["000364182900031"]},"date_created":"2018-12-11T11:52:57Z","alternative_title":["LNCS"],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","language":[{"iso":"eng"}],"publist_id":"5566","publication_status":"published","oa_version":"Submitted Version","doi":"10.1007/978-3-319-21690-4_31","intvolume":"      9206","status":"public","isi":1,"month":"07","type":"conference","abstract":[{"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.","lang":"eng"}],"ec_funded":1,"has_accepted_license":"1","scopus_import":"1","file_date_updated":"2020-07-14T12:45:04Z","date_published":"2015-07-16T00:00:00Z","author":[{"last_name":"Babiak","first_name":"Tomáš","full_name":"Babiak, Tomáš"},{"full_name":"Blahoudek, František","first_name":"František","last_name":"Blahoudek"},{"first_name":"Alexandre","full_name":"Duret Lutz, Alexandre","last_name":"Duret Lutz"},{"last_name":"Klein","full_name":"Klein, Joachim","first_name":"Joachim"},{"first_name":"Jan","full_name":"Kretinsky, Jan","orcid":"0000-0002-8122-2881","last_name":"Kretinsky","id":"44CEF464-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Mueller","full_name":"Mueller, Daniel","first_name":"Daniel"},{"first_name":"David","full_name":"Parker, David","last_name":"Parker"},{"full_name":"Strejček, Jan","first_name":"Jan","last_name":"Strejček"}],"day":"16","date_updated":"2025-09-23T13:50:55Z","title":"The Hanoi omega-automata format"},{"arxiv":1,"language":[{"iso":"eng"}],"publist_id":"5564","publication_status":"published","doi":"10.1007/978-3-319-21690-4_10","oa_version":"Preprint","intvolume":"      9206","month":"07","isi":1,"status":"public","type":"conference","related_material":{"record":[{"status":"public","relation":"research_paper","id":"5549"}]},"abstract":[{"lang":"eng","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."}],"ec_funded":1,"scopus_import":"1","date_published":"2015-07-16T00:00:00Z","author":[{"full_name":"Brázdil, Tomáš","first_name":"Tomáš","last_name":"Brázdil"},{"orcid":"0000-0002-4561-241X","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee"},{"full_name":"Chmelik, Martin","first_name":"Martin","last_name":"Chmelik","id":"3624234E-F248-11E8-B48F-1D18A9856A87"},{"id":"42BABFB4-F248-11E8-B48F-1D18A9856A87","last_name":"Fellner","full_name":"Fellner, Andreas","first_name":"Andreas"},{"first_name":"Jan","full_name":"Kretinsky, Jan","orcid":"0000-0002-8122-2881","last_name":"Kretinsky","id":"44CEF464-F248-11E8-B48F-1D18A9856A87"}],"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1502.02834"}],"day":"16","date_updated":"2025-09-23T08:23:16Z","title":"Counterexample explanation by learning small strategies in Markov decision processes","conference":{"start_date":"2015-07-18","name":"CAV: Computer Aided Verification","location":"San Francisco, CA, United States","end_date":"2015-07-24"},"corr_author":"1","_id":"1603","citation":{"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.","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>","short":"T. Brázdil, K. Chatterjee, M. Chmelik, A. Fellner, J. Kretinsky, in:, Springer, 2015, 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.","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>.","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>."},"oa":1,"volume":9206,"project":[{"name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","call_identifier":"FWF","name":"Formal methods for the design and analysis of complex systems"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications"},{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","call_identifier":"FP7","grant_number":"267989"},{"_id":"25681D80-B435-11E9-9278-68D0E5697425","name":"International IST Postdoc Fellowship Programme","grant_number":"291734","call_identifier":"FP7"}],"quality_controlled":"1","article_processing_charge":"No","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"publisher":"Springer","page":"158 - 177","year":"2015","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.","external_id":{"arxiv":["1502.02834"],"isi":["000364182900010"]},"date_created":"2018-12-11T11:52:58Z","alternative_title":["LNCS"],"publication_identifier":{"eisbn":["978-3-319-21690-4"]},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345"},{"day":"28","title":"Abstraction-based parameter synthesis for multiaffine systems","date_updated":"2025-04-15T06:26:03Z","ec_funded":1,"has_accepted_license":"1","scopus_import":1,"date_published":"2015-11-28T00:00:00Z","file_date_updated":"2020-07-14T12:45:05Z","author":[{"orcid":"0000-0002-0686-0365","full_name":"Bogomolov, Sergiy","first_name":"Sergiy","id":"369D9A44-F248-11E8-B48F-1D18A9856A87","last_name":"Bogomolov"},{"id":"3A2F4DCE-F248-11E8-B48F-1D18A9856A87","last_name":"Schilling","first_name":"Christian","full_name":"Schilling, Christian","orcid":"0000-0003-3658-1065"},{"last_name":"Bartocci","first_name":"Ezio","full_name":"Bartocci, Ezio"},{"full_name":"Batt, Grégory","first_name":"Grégory","last_name":"Batt"},{"orcid":"0000-0002-3066-6941","first_name":"Hui","full_name":"Kong, Hui","last_name":"Kong","id":"3BDE25AA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Grosu, Radu","first_name":"Radu","last_name":"Grosu"}],"intvolume":"      9434","month":"11","status":"public","abstract":[{"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.","lang":"eng"}],"type":"conference","language":[{"iso":"eng"}],"publist_id":"5561","publication_status":"published","doi":"10.1007/978-3-319-26287-1_2","oa_version":"Submitted Version","year":"2015","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/).","date_created":"2018-12-11T11:52:59Z","alternative_title":["LNCS"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"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.","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>.","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>","short":"S. Bogomolov, C. Schilling, E. Bartocci, G. Batt, H. Kong, R. Grosu, in:, Springer, 2015, pp. 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>"},"volume":9434,"oa":1,"project":[{"name":"Quantitative Reactive Modeling","grant_number":"267989","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"grant_number":"Z211","call_identifier":"FWF","name":"Formal methods for the design and analysis of complex systems","_id":"25F42A32-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","article_processing_charge":"No","department":[{"_id":"ToHe"}],"publisher":"Springer","file":[{"creator":"dernst","file_id":"7851","content_type":"application/pdf","access_level":"open_access","relation":"main_file","date_created":"2020-05-15T08:43:19Z","checksum":"3aab260f3f34641d622030ba22645b3e","date_updated":"2020-07-14T12:45:05Z","file_size":1053207,"file_name":"2015_LNCS_Bogomolov.pdf"}],"page":"19 - 35","_id":"1605","ddc":["000"],"corr_author":"1","conference":{"name":"HVC: Haifa Verification Conference","end_date":"2015-11-19","location":"Haifa, Israel","start_date":"2015-11-17"}},{"author":[{"full_name":"Nguyen, Luan","first_name":"Luan","last_name":"Nguyen"},{"last_name":"Schilling","first_name":"Christian","full_name":"Schilling, Christian"},{"last_name":"Bogomolov","id":"369D9A44-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0686-0365","first_name":"Sergiy","full_name":"Bogomolov, Sergiy"},{"last_name":"Johnson","first_name":"Taylor","full_name":"Johnson, Taylor"}],"date_published":"2015-11-15T00:00:00Z","scopus_import":"1","ec_funded":1,"title":"Runtime verification for hybrid analysis tools","date_updated":"2025-09-23T10:41:02Z","day":"15","doi":"10.1007/978-3-319-23820-3_19","oa_version":"None","publication_status":"published","publist_id":"5562","language":[{"iso":"eng"}],"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"}],"type":"conference","isi":1,"month":"11","status":"public","intvolume":"      9333","publisher":"Springer Nature","page":"281 - 286","department":[{"_id":"ToHe"}],"quality_controlled":"1","article_processing_charge":"No","project":[{"grant_number":"267989","call_identifier":"FP7","name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","call_identifier":"FWF","name":"Formal methods for the design and analysis of complex systems"},{"call_identifier":"FWF","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425"}],"citation":{"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>","short":"L. Nguyen, C. Schilling, S. Bogomolov, T. Johnson, in:, 6th International Conference, Springer Nature, 2015, pp. 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>","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.","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>.","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>."},"volume":9333,"publication_identifier":{"isbn":["978-3-319-23819-7"]},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","alternative_title":["LNCS"],"date_created":"2018-12-11T11:52:59Z","external_id":{"isi":["000370624400019"]},"year":"2015","publication":"6th International Conference","conference":{"start_date":"2015-09-22","end_date":"2015-09-25","location":"Vienna, Austria","name":"RV: Runtime Verification"},"_id":"1606"},{"publisher":"Springer Nature","department":[{"_id":"KrCh"}],"page":"108 - 120","article_processing_charge":"No","quality_controlled":"1","project":[{"call_identifier":"FWF","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"name":"Game Theory","call_identifier":"FWF","grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","call_identifier":"FP7"}],"oa":1,"volume":9135,"citation":{"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>","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.","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>","short":"K. Chatterjee, L. Doyen, M. Vardi, in:, 42nd International Colloquium, Springer Nature, 2015, pp. 108–120.","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.","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>.","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>."},"publication_identifier":{"isbn":["978-3-662-47665-9"]},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","alternative_title":["LNCS"],"date_created":"2018-12-11T11:53:00Z","external_id":{"arxiv":["1502.04844"],"isi":["000364317900009"]},"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.","year":"2015","conference":{"end_date":"2015-07-10","name":"ICALP: Automata, Languages and Programming","location":"Kyoto, Japan","start_date":"2015-07-06"},"corr_author":"1","publication":"42nd International Colloquium","_id":"1609","main_file_link":[{"url":"http://arxiv.org/abs/1502.04844","open_access":"1"}],"author":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Doyen","full_name":"Doyen, Laurent","first_name":"Laurent"},{"last_name":"Vardi","full_name":"Vardi, Moshe","first_name":"Moshe"}],"date_published":"2015-06-20T00:00:00Z","scopus_import":"1","ec_funded":1,"date_updated":"2025-09-23T13:48:35Z","title":"The complexity of synthesis from probabilistic components","day":"20","oa_version":"Preprint","doi":"10.1007/978-3-662-47666-6_9","publication_status":"published","publist_id":"5557","language":[{"iso":"eng"}],"arxiv":1,"abstract":[{"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.","lang":"eng"}],"type":"conference","status":"public","isi":1,"month":"06","intvolume":"      9135"},{"language":[{"iso":"eng"}],"publist_id":"5555","publication_status":"published","oa_version":"Submitted Version","doi":"10.1002/pro.2721","intvolume":"        24","status":"public","isi":1,"month":"09","type":"journal_article","abstract":[{"text":"Biosensors for signaling molecules allow the study of physiological processes by bringing together the fields of protein engineering, fluorescence imaging, and cell biology. Construction of genetically encoded biosensors generally relies on the availability of a binding &quot;core&quot; that is both specific and stable, which can then be combined with fluorescent molecules to create a sensor. However, binding proteins with the desired properties are often not available in nature and substantial improvement to sensors can be required, particularly with regard to their durability. Ancestral protein reconstruction is a powerful protein-engineering tool able to generate highly stable and functional proteins. In this work, we sought to establish the utility of ancestral protein reconstruction to biosensor development, beginning with the construction of an l-arginine biosensor. l-arginine, as the immediate precursor to nitric oxide, is an important molecule in many physiological contexts including brain function. Using a combination of ancestral reconstruction and circular permutation, we constructed a Förster resonance energy transfer (FRET) biosensor for l-arginine (cpFLIPR). cpFLIPR displays high sensitivity and specificity, with a Kd of ∼14 μM and a maximal dynamic range of 35%. Importantly, cpFLIPR was highly robust, enabling accurate l-arginine measurement at physiological temperatures. We established that cpFLIPR is compatible with two-photon excitation fluorescence microscopy and report l-arginine concentrations in brain tissue.","lang":"eng"}],"scopus_import":"1","date_published":"2015-09-01T00:00:00Z","main_file_link":[{"open_access":"1","url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4570536/"}],"author":[{"last_name":"Whitfield","full_name":"Whitfield, Jason","first_name":"Jason"},{"first_name":"William","full_name":"Zhang, William","last_name":"Zhang"},{"last_name":"Herde","first_name":"Michel","full_name":"Herde, Michel"},{"last_name":"Clifton","full_name":"Clifton, Ben","first_name":"Ben"},{"first_name":"Johanna","full_name":"Radziejewski, Johanna","last_name":"Radziejewski"},{"last_name":"Janovjak","id":"33BA6C30-F248-11E8-B48F-1D18A9856A87","first_name":"Harald L","full_name":"Janovjak, Harald L","orcid":"0000-0002-8023-9315"},{"last_name":"Henneberger","first_name":"Christian","full_name":"Henneberger, Christian"},{"last_name":"Jackson","first_name":"Colin","full_name":"Jackson, Colin"}],"day":"01","date_updated":"2025-09-23T08:21:28Z","title":"Construction of a robust and sensitive arginine biosensor through ancestral protein reconstruction","publication":"Protein Science","_id":"1611","volume":24,"oa":1,"citation":{"ista":"Whitfield J, Zhang W, Herde M, Clifton B, Radziejewski J, Janovjak HL, Henneberger C, Jackson C. 2015. Construction of a robust and sensitive arginine biosensor through ancestral protein reconstruction. Protein Science. 24(9), 1412–1422.","mla":"Whitfield, Jason, et al. “Construction of a Robust and Sensitive Arginine Biosensor through Ancestral Protein Reconstruction.” <i>Protein Science</i>, vol. 24, no. 9, Wiley, 2015, pp. 1412–22, doi:<a href=\"https://doi.org/10.1002/pro.2721\">10.1002/pro.2721</a>.","chicago":"Whitfield, Jason, William Zhang, Michel Herde, Ben Clifton, Johanna Radziejewski, Harald L Janovjak, Christian Henneberger, and Colin Jackson. “Construction of a Robust and Sensitive Arginine Biosensor through Ancestral Protein Reconstruction.” <i>Protein Science</i>. Wiley, 2015. <a href=\"https://doi.org/10.1002/pro.2721\">https://doi.org/10.1002/pro.2721</a>.","ieee":"J. Whitfield <i>et al.</i>, “Construction of a robust and sensitive arginine biosensor through ancestral protein reconstruction,” <i>Protein Science</i>, vol. 24, no. 9. Wiley, pp. 1412–1422, 2015.","apa":"Whitfield, J., Zhang, W., Herde, M., Clifton, B., Radziejewski, J., Janovjak, H. L., … Jackson, C. (2015). Construction of a robust and sensitive arginine biosensor through ancestral protein reconstruction. <i>Protein Science</i>. Wiley. <a href=\"https://doi.org/10.1002/pro.2721\">https://doi.org/10.1002/pro.2721</a>","ama":"Whitfield J, Zhang W, Herde M, et al. Construction of a robust and sensitive arginine biosensor through ancestral protein reconstruction. <i>Protein Science</i>. 2015;24(9):1412-1422. doi:<a href=\"https://doi.org/10.1002/pro.2721\">10.1002/pro.2721</a>","short":"J. Whitfield, W. Zhang, M. Herde, B. Clifton, J. Radziejewski, H.L. Janovjak, C. Henneberger, C. Jackson, Protein Science 24 (2015) 1412–1422."},"project":[{"grant_number":"RGY0084/2012","name":"In situ real-time imaging of neurotransmitter signaling using designer optical sensors","_id":"255BFFFA-B435-11E9-9278-68D0E5697425"}],"issue":"9","article_processing_charge":"No","quality_controlled":"1","department":[{"_id":"HaJa"}],"publisher":"Wiley","page":"1412 - 1422","year":"2015","external_id":{"pmid":["26061224"],"isi":["000360380400008"]},"pmid":1,"date_created":"2018-12-11T11:53:01Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345"},{"citation":{"ama":"Strüber M, Jonas PM, Bartos M. Strength and duration of perisomatic GABAergic inhibition depend on distance between synaptically connected cells. <i>PNAS</i>. 2015;112(4):1220-1225. doi:<a href=\"https://doi.org/10.1073/pnas.1412996112\">10.1073/pnas.1412996112</a>","short":"M. Strüber, P.M. Jonas, M. Bartos, PNAS 112 (2015) 1220–1225.","ieee":"M. Strüber, P. M. Jonas, and M. Bartos, “Strength and duration of perisomatic GABAergic inhibition depend on distance between synaptically connected cells,” <i>PNAS</i>, vol. 112, no. 4. National Academy of Sciences, pp. 1220–1225, 2015.","apa":"Strüber, M., Jonas, P. M., &#38; Bartos, M. (2015). Strength and duration of perisomatic GABAergic inhibition depend on distance between synaptically connected cells. <i>PNAS</i>. National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.1412996112\">https://doi.org/10.1073/pnas.1412996112</a>","mla":"Strüber, Michael, et al. “Strength and Duration of Perisomatic GABAergic Inhibition Depend on Distance between Synaptically Connected Cells.” <i>PNAS</i>, vol. 112, no. 4, National Academy of Sciences, 2015, pp. 1220–25, doi:<a href=\"https://doi.org/10.1073/pnas.1412996112\">10.1073/pnas.1412996112</a>.","chicago":"Strüber, Michael, Peter M Jonas, and Marlene Bartos. “Strength and Duration of Perisomatic GABAergic Inhibition Depend on Distance between Synaptically Connected Cells.” <i>PNAS</i>. National Academy of Sciences, 2015. <a href=\"https://doi.org/10.1073/pnas.1412996112\">https://doi.org/10.1073/pnas.1412996112</a>.","ista":"Strüber M, Jonas PM, Bartos M. 2015. Strength and duration of perisomatic GABAergic inhibition depend on distance between synaptically connected cells. PNAS. 112(4), 1220–1225."},"oa":1,"volume":112,"issue":"4","project":[{"name":"Mechanisms of transmitter release at GABAergic synapses","grant_number":"P24909-B24","call_identifier":"FWF","_id":"25C26B1E-B435-11E9-9278-68D0E5697425"},{"_id":"25C0F108-B435-11E9-9278-68D0E5697425","name":"Nanophysiology of fast-spiking, parvalbumin-expressing GABAergic interneurons","grant_number":"268548","call_identifier":"FP7"}],"quality_controlled":"1","article_processing_charge":"No","department":[{"_id":"PeJo"}],"page":"1220 - 1225","publisher":"National Academy of Sciences","file":[{"creator":"dernst","access_level":"open_access","content_type":"application/pdf","file_id":"5838","relation":"main_file","file_size":1280860,"date_updated":"2020-07-14T12:45:07Z","checksum":"6703309a1f58493cf5a704211fb6ebed","date_created":"2019-01-17T07:52:40Z","file_name":"2015_PNAS_Strueber.pdf"}],"year":"2015","pmid":1,"external_id":{"isi":["000348417000066"],"pmid":["25583495"]},"date_created":"2018-12-11T11:53:02Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","ddc":["570"],"publication":"PNAS","_id":"1614","has_accepted_license":"1","ec_funded":1,"scopus_import":"1","date_published":"2015-01-27T00:00:00Z","file_date_updated":"2020-07-14T12:45:07Z","author":[{"first_name":"Michael","full_name":"Strüber, Michael","last_name":"Strüber"},{"orcid":"0000-0001-5001-4804","full_name":"Jonas, Peter M","first_name":"Peter M","last_name":"Jonas","id":"353C1B58-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Bartos, Marlene","first_name":"Marlene","last_name":"Bartos"}],"day":"27","title":"Strength and duration of perisomatic GABAergic inhibition depend on distance between synaptically connected cells","date_updated":"2025-09-23T10:49:39Z","language":[{"iso":"eng"}],"publist_id":"5552","publication_status":"published","doi":"10.1073/pnas.1412996112","oa_version":"Published Version","intvolume":"       112","isi":1,"month":"01","status":"public","type":"journal_article","abstract":[{"text":"GABAergic perisoma-inhibiting fast-spiking interneurons (PIIs) effectively control the activity of large neuron populations by their wide axonal arborizations. It is generally assumed that the output of one PII to its target cells is strong and rapid. Here, we show that, unexpectedly, both strength and time course of PII-mediated perisomatic inhibition change with distance between synaptically connected partners in the rodent hippocampus. Synaptic signals become weaker due to lower contact numbers and decay more slowly with distance, very likely resulting from changes in GABAA receptor subunit composition. When distance-dependent synaptic inhibition is introduced to a rhythmically active neuronal network model, randomly driven principal cell assemblies are strongly synchronized by the PIIs, leading to higher precision in principal cell spike times than in a network with uniform synaptic inhibition. ","lang":"eng"}]},{"day":"20","date_updated":"2025-09-23T09:48:31Z","title":"Perturbed hippocampal synaptic inhibition and γ-oscillations in a neuroligin-4 knockout mouse model of autism","scopus_import":"1","pubrep_id":"470","has_accepted_license":"1","author":[{"full_name":"Hammer, Matthieu","first_name":"Matthieu","last_name":"Hammer"},{"last_name":"Krueger Burg","full_name":"Krueger Burg, Dilja","first_name":"Dilja"},{"first_name":"Liam","full_name":"Tuffy, Liam","last_name":"Tuffy"},{"first_name":"Benjamin","full_name":"Cooper, Benjamin","last_name":"Cooper"},{"last_name":"Taschenberger","full_name":"Taschenberger, Holger","first_name":"Holger"},{"id":"3A578F32-F248-11E8-B48F-1D18A9856A87","last_name":"Goswami","full_name":"Goswami, Sarit","first_name":"Sarit"},{"first_name":"Hannelore","full_name":"Ehrenreich, Hannelore","last_name":"Ehrenreich"},{"last_name":"Jonas","id":"353C1B58-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5001-4804","full_name":"Jonas, Peter M","first_name":"Peter M"},{"first_name":"Frederique","full_name":"Varoqueaux, Frederique","last_name":"Varoqueaux"},{"last_name":"Rhee","full_name":"Rhee, Jeong","first_name":"Jeong"},{"last_name":"Brose","full_name":"Brose, Nils","first_name":"Nils"}],"file_date_updated":"2020-07-14T12:45:07Z","date_published":"2015-10-20T00:00:00Z","status":"public","isi":1,"month":"10","intvolume":"        13","abstract":[{"text":"Loss-of-function mutations in the synaptic adhesion protein Neuroligin-4 are among the most common genetic abnormalities associated with autism spectrum disorders, but little is known about the function of Neuroligin-4 and the consequences of its loss. We assessed synaptic and network characteristics in Neuroligin-4 knockout mice, focusing on the hippocampus as a model brain region with a critical role in cognition and memory, and found that Neuroligin-4 deletion causes subtle defects of the protein composition and function of GABAergic synapses in the hippocampal CA3 region. Interestingly, these subtle synaptic changes are accompanied by pronounced perturbations of γ-oscillatory network activity, which has been implicated in cognitive function and is altered in multiple psychiatric and neurodevelopmental disorders. Our data provide important insights into the mechanisms by which Neuroligin-4-dependent GABAergic synapses may contribute to autism phenotypes and indicate new strategies for therapeutic approaches.","lang":"eng"}],"type":"journal_article","publist_id":"5551","language":[{"iso":"eng"}],"oa_version":"Published Version","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"doi":"10.1016/j.celrep.2015.09.011","publication_status":"published","external_id":{"isi":["000363780000008"]},"acknowledgement":"This work was supported by the Max Planck Society (N.B. and H.E.), the European Commission (EU-AIMS FP7-115300, N.B. and H.E.; Marie Curie IRG, D.K.-B.), the German Research Foundation (CNMPB, N.B., H.E., and F.V.), the Alexander von Humboldt-Foundation (D.K.-B.), and the Austrian Fond zur Förderung der Wissenschaftlichen Forschung (P 24909-B24, P.J.). M.H. was a student of the doctoral program Molecular Physiology of the Brain. Dr. J.-M. Fritschy generously provided the GABAARγ2 antibody. We thank F. Benseler, I. Thanhäuser, D. Schwerdtfeger, A. Ronnenberg, and D. Winkler for valuable advice and excellent technical support. We are grateful to the staff at the animal facility of the Max Planck Institute of Experimental Medicine for mouse husbandry.","year":"2015","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_created":"2018-12-11T11:53:02Z","issue":"3","oa":1,"volume":13,"citation":{"short":"M. Hammer, D. Krueger Burg, L. Tuffy, B. Cooper, H. Taschenberger, S. Goswami, H. Ehrenreich, P.M. Jonas, F. Varoqueaux, J. Rhee, N. Brose, Cell Reports 13 (2015) 516–523.","ama":"Hammer M, Krueger Burg D, Tuffy L, et al. Perturbed hippocampal synaptic inhibition and γ-oscillations in a neuroligin-4 knockout mouse model of autism. <i>Cell Reports</i>. 2015;13(3):516-523. doi:<a href=\"https://doi.org/10.1016/j.celrep.2015.09.011\">10.1016/j.celrep.2015.09.011</a>","apa":"Hammer, M., Krueger Burg, D., Tuffy, L., Cooper, B., Taschenberger, H., Goswami, S., … Brose, N. (2015). Perturbed hippocampal synaptic inhibition and γ-oscillations in a neuroligin-4 knockout mouse model of autism. <i>Cell Reports</i>. Cell Press. <a href=\"https://doi.org/10.1016/j.celrep.2015.09.011\">https://doi.org/10.1016/j.celrep.2015.09.011</a>","ieee":"M. Hammer <i>et al.</i>, “Perturbed hippocampal synaptic inhibition and γ-oscillations in a neuroligin-4 knockout mouse model of autism,” <i>Cell Reports</i>, vol. 13, no. 3. Cell Press, pp. 516–523, 2015.","chicago":"Hammer, Matthieu, Dilja Krueger Burg, Liam Tuffy, Benjamin Cooper, Holger Taschenberger, Sarit Goswami, Hannelore Ehrenreich, et al. “Perturbed Hippocampal Synaptic Inhibition and γ-Oscillations in a Neuroligin-4 Knockout Mouse Model of Autism.” <i>Cell Reports</i>. Cell Press, 2015. <a href=\"https://doi.org/10.1016/j.celrep.2015.09.011\">https://doi.org/10.1016/j.celrep.2015.09.011</a>.","mla":"Hammer, Matthieu, et al. “Perturbed Hippocampal Synaptic Inhibition and γ-Oscillations in a Neuroligin-4 Knockout Mouse Model of Autism.” <i>Cell Reports</i>, vol. 13, no. 3, Cell Press, 2015, pp. 516–23, doi:<a href=\"https://doi.org/10.1016/j.celrep.2015.09.011\">10.1016/j.celrep.2015.09.011</a>.","ista":"Hammer M, Krueger Burg D, Tuffy L, Cooper B, Taschenberger H, Goswami S, Ehrenreich H, Jonas PM, Varoqueaux F, Rhee J, Brose N. 2015. Perturbed hippocampal synaptic inhibition and γ-oscillations in a neuroligin-4 knockout mouse model of autism. Cell Reports. 13(3), 516–523."},"publisher":"Cell Press","department":[{"_id":"PeJo"}],"page":"516 - 523","file":[{"checksum":"44d30fbb543774b076b4938bd36af9d7","date_created":"2018-12-12T10:13:23Z","file_size":2314406,"date_updated":"2020-07-14T12:45:07Z","file_name":"IST-2016-470-v1+1_1-s2.0-S2211124715010220-main.pdf","creator":"system","file_id":"5005","content_type":"application/pdf","access_level":"open_access","relation":"main_file"}],"article_processing_charge":"No","quality_controlled":"1","_id":"1615","ddc":["570"],"publication":"Cell Reports"},{"publication_status":"published","oa_version":"Submitted Version","doi":"10.1021/acs.biochem.5b00560","language":[{"iso":"eng"}],"publist_id":"5548","abstract":[{"text":"CCL19 and CCL21 are chemokines involved in the trafficking of immune cells, particularly within the lymphatic system, through activation of CCR7. Concurrent expression of PSGL-1 and CCR7 in naive T-cells enhances recruitment of these cells to secondary lymphoid organs by CCL19 and CCL21. Here the solution structure of CCL19 is reported. It contains a canonical chemokine domain. Chemical shift mapping shows the N-termini of PSGL-1 and CCR7 have overlapping binding sites for CCL19 and binding is competitive. Implications for the mechanism of PSGL-1's enhancement of resting T-cell recruitment are discussed.","lang":"eng"}],"type":"journal_article","intvolume":"        54","status":"public","month":"06","isi":1,"date_published":"2015-06-26T00:00:00Z","main_file_link":[{"open_access":"1","url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4809050/"}],"author":[{"last_name":"Veldkamp","first_name":"Christopher","full_name":"Veldkamp, Christopher"},{"id":"3EB04B78-F248-11E8-B48F-1D18A9856A87","last_name":"Kiermaier","full_name":"Kiermaier, Eva","first_name":"Eva","orcid":"0000-0001-6165-5738"},{"last_name":"Gabel Eissens","first_name":"Skylar","full_name":"Gabel Eissens, Skylar"},{"last_name":"Gillitzer","first_name":"Miranda","full_name":"Gillitzer, Miranda"},{"first_name":"David","full_name":"Lippner, David","last_name":"Lippner"},{"last_name":"Disilvio","full_name":"Disilvio, Frank","first_name":"Frank"},{"last_name":"Mueller","first_name":"Casey","full_name":"Mueller, Casey"},{"last_name":"Wantuch","first_name":"Paeton","full_name":"Wantuch, Paeton"},{"first_name":"Gary","full_name":"Chaffee, Gary","last_name":"Chaffee"},{"last_name":"Famiglietti","first_name":"Michael","full_name":"Famiglietti, Michael"},{"last_name":"Zgoba","first_name":"Danielle","full_name":"Zgoba, Danielle"},{"full_name":"Bailey, Asha","first_name":"Asha","last_name":"Bailey"},{"last_name":"Bah","first_name":"Yaya","full_name":"Bah, Yaya"},{"last_name":"Engebretson","first_name":"Samantha","full_name":"Engebretson, Samantha"},{"last_name":"Graupner","first_name":"David","full_name":"Graupner, David"},{"last_name":"Lackner","first_name":"Emily","full_name":"Lackner, Emily"},{"full_name":"Larosa, Vincent","first_name":"Vincent","last_name":"Larosa"},{"last_name":"Medeiros","full_name":"Medeiros, Tysha","first_name":"Tysha"},{"first_name":"Michael","full_name":"Olson, Michael","last_name":"Olson"},{"full_name":"Phillips, Andrew","first_name":"Andrew","last_name":"Phillips"},{"first_name":"Harley","full_name":"Pyles, Harley","last_name":"Pyles"},{"first_name":"Amanda","full_name":"Richard, Amanda","last_name":"Richard"},{"full_name":"Schoeller, Scott","first_name":"Scott","last_name":"Schoeller"},{"last_name":"Touzeau","full_name":"Touzeau, Boris","first_name":"Boris"},{"last_name":"Williams","first_name":"Larry","full_name":"Williams, Larry"},{"orcid":"0000-0002-6620-9179","first_name":"Michael K","full_name":"Sixt, Michael K","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","last_name":"Sixt"},{"first_name":"Francis","full_name":"Peterson, Francis","last_name":"Peterson"}],"ec_funded":1,"scopus_import":"1","title":"Solution structure of CCL19 and identification of overlapping CCR7 and PSGL-1 binding sites","date_updated":"2025-09-23T10:47:25Z","day":"26","publication":"Biochemistry","_id":"1618","article_processing_charge":"No","quality_controlled":"1","publisher":"American Chemical Society","page":"4163 - 4166","department":[{"_id":"MiSi"}],"volume":54,"oa":1,"citation":{"ista":"Veldkamp C, Kiermaier E, Gabel Eissens S, Gillitzer M, Lippner D, Disilvio F, Mueller C, Wantuch P, Chaffee G, Famiglietti M, Zgoba D, Bailey A, Bah Y, Engebretson S, Graupner D, Lackner E, Larosa V, Medeiros T, Olson M, Phillips A, Pyles H, Richard A, Schoeller S, Touzeau B, Williams L, Sixt MK, Peterson F. 2015. Solution structure of CCL19 and identification of overlapping CCR7 and PSGL-1 binding sites. Biochemistry. 54(27), 4163–4166.","mla":"Veldkamp, Christopher, et al. “Solution Structure of CCL19 and Identification of Overlapping CCR7 and PSGL-1 Binding Sites.” <i>Biochemistry</i>, vol. 54, no. 27, American Chemical Society, 2015, pp. 4163–66, doi:<a href=\"https://doi.org/10.1021/acs.biochem.5b00560\">10.1021/acs.biochem.5b00560</a>.","chicago":"Veldkamp, Christopher, Eva Kiermaier, Skylar Gabel Eissens, Miranda Gillitzer, David Lippner, Frank Disilvio, Casey Mueller, et al. “Solution Structure of CCL19 and Identification of Overlapping CCR7 and PSGL-1 Binding Sites.” <i>Biochemistry</i>. American Chemical Society, 2015. <a href=\"https://doi.org/10.1021/acs.biochem.5b00560\">https://doi.org/10.1021/acs.biochem.5b00560</a>.","ieee":"C. Veldkamp <i>et al.</i>, “Solution structure of CCL19 and identification of overlapping CCR7 and PSGL-1 binding sites,” <i>Biochemistry</i>, vol. 54, no. 27. American Chemical Society, pp. 4163–4166, 2015.","apa":"Veldkamp, C., Kiermaier, E., Gabel Eissens, S., Gillitzer, M., Lippner, D., Disilvio, F., … Peterson, F. (2015). Solution structure of CCL19 and identification of overlapping CCR7 and PSGL-1 binding sites. <i>Biochemistry</i>. American Chemical Society. <a href=\"https://doi.org/10.1021/acs.biochem.5b00560\">https://doi.org/10.1021/acs.biochem.5b00560</a>","short":"C. Veldkamp, E. Kiermaier, S. Gabel Eissens, M. Gillitzer, D. Lippner, F. Disilvio, C. Mueller, P. Wantuch, G. Chaffee, M. Famiglietti, D. Zgoba, A. Bailey, Y. Bah, S. Engebretson, D. Graupner, E. Lackner, V. Larosa, T. Medeiros, M. Olson, A. Phillips, H. Pyles, A. Richard, S. Schoeller, B. Touzeau, L. Williams, M.K. Sixt, F. Peterson, Biochemistry 54 (2015) 4163–4166.","ama":"Veldkamp C, Kiermaier E, Gabel Eissens S, et al. Solution structure of CCL19 and identification of overlapping CCR7 and PSGL-1 binding sites. <i>Biochemistry</i>. 2015;54(27):4163-4166. doi:<a href=\"https://doi.org/10.1021/acs.biochem.5b00560\">10.1021/acs.biochem.5b00560</a>"},"project":[{"_id":"25A603A2-B435-11E9-9278-68D0E5697425","grant_number":"281556","call_identifier":"FP7","name":"Cytoskeletal force generation and force transduction of migrating leukocytes"}],"issue":"27","date_created":"2018-12-11T11:53:03Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","year":"2015","external_id":{"isi":["000358105100001"],"pmid":["26115234"]},"pmid":1},{"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"doi":"10.1186/s13068-015-0380-2","oa_version":"Published Version","publication_status":"published","publist_id":"5537","language":[{"iso":"eng"}],"abstract":[{"text":"Background\r\nPhotosynthetic cyanobacteria are attractive for a range of biotechnological applications including biofuel production. However, due to slow growth, screening of mutant libraries using microtiter plates is not feasible.\r\nResults\r\nWe present a method for high-throughput, single-cell analysis and sorting of genetically engineered l-lactate-producing strains of Synechocystis sp. PCC6803. A microfluidic device is used to encapsulate single cells in picoliter droplets, assay the droplets for l-lactate production, and sort strains with high productivity. We demonstrate the separation of low- and high-producing reference strains, as well as enrichment of a more productive l-lactate-synthesizing population after UV-induced mutagenesis. The droplet platform also revealed population heterogeneity in photosynthetic growth and lactate production, as well as the presence of metabolically stalled cells.\r\nConclusions\r\nThe workflow will facilitate metabolic engineering and directed evolution studies and will be useful in studies of cyanobacteria biochemistry and physiology.\r\n","lang":"eng"}],"type":"journal_article","isi":1,"month":"11","status":"public","intvolume":"         8","author":[{"last_name":"Hammar","full_name":"Hammar, Petter","first_name":"Petter"},{"orcid":"0000-0001-8619-2223","full_name":"Angermayr, Andreas","first_name":"Andreas","last_name":"Angermayr","id":"4677C796-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Sjostrom","first_name":"Staffan","full_name":"Sjostrom, Staffan"},{"full_name":"Van Der Meer, Josefin","first_name":"Josefin","last_name":"Van Der Meer"},{"last_name":"Hellingwerf","full_name":"Hellingwerf, Klaas","first_name":"Klaas"},{"full_name":"Hudson, Elton","first_name":"Elton","last_name":"Hudson"},{"full_name":"Joensson, Hakaan","first_name":"Hakaan","last_name":"Joensson"}],"date_published":"2015-11-25T00:00:00Z","file_date_updated":"2020-07-14T12:45:07Z","scopus_import":"1","has_accepted_license":"1","pubrep_id":"467","date_updated":"2025-09-23T10:45:43Z","title":"Single-cell screening of photosynthetic growth and lactate production by cyanobacteria","day":"25","publication":"Biotechnology for Biofuels","ddc":["570"],"_id":"1623","article_number":"193","publisher":"BioMed Central","file":[{"checksum":"172b0b6f4eb2e5c22b7cec1d57dc0107","date_created":"2018-12-12T10:10:11Z","file_size":2914089,"date_updated":"2020-07-14T12:45:07Z","file_name":"IST-2016-467-v1+1_s13068-015-0380-2.pdf","file_id":"4796","content_type":"application/pdf","access_level":"open_access","creator":"system","relation":"main_file"}],"department":[{"_id":"ToBo"}],"quality_controlled":"1","article_processing_charge":"No","issue":"1","citation":{"ieee":"P. Hammar <i>et al.</i>, “Single-cell screening of photosynthetic growth and lactate production by cyanobacteria,” <i>Biotechnology for Biofuels</i>, vol. 8, no. 1. BioMed Central, 2015.","apa":"Hammar, P., Angermayr, A., Sjostrom, S., Van Der Meer, J., Hellingwerf, K., Hudson, E., &#38; Joensson, H. (2015). Single-cell screening of photosynthetic growth and lactate production by cyanobacteria. <i>Biotechnology for Biofuels</i>. BioMed Central. <a href=\"https://doi.org/10.1186/s13068-015-0380-2\">https://doi.org/10.1186/s13068-015-0380-2</a>","ama":"Hammar P, Angermayr A, Sjostrom S, et al. Single-cell screening of photosynthetic growth and lactate production by cyanobacteria. <i>Biotechnology for Biofuels</i>. 2015;8(1). doi:<a href=\"https://doi.org/10.1186/s13068-015-0380-2\">10.1186/s13068-015-0380-2</a>","short":"P. Hammar, A. Angermayr, S. Sjostrom, J. Van Der Meer, K. Hellingwerf, E. Hudson, H. Joensson, Biotechnology for Biofuels 8 (2015).","ista":"Hammar P, Angermayr A, Sjostrom S, Van Der Meer J, Hellingwerf K, Hudson E, Joensson H. 2015. Single-cell screening of photosynthetic growth and lactate production by cyanobacteria. Biotechnology for Biofuels. 8(1), 193.","chicago":"Hammar, Petter, Andreas Angermayr, Staffan Sjostrom, Josefin Van Der Meer, Klaas Hellingwerf, Elton Hudson, and Hakaan Joensson. “Single-Cell Screening of Photosynthetic Growth and Lactate Production by Cyanobacteria.” <i>Biotechnology for Biofuels</i>. BioMed Central, 2015. <a href=\"https://doi.org/10.1186/s13068-015-0380-2\">https://doi.org/10.1186/s13068-015-0380-2</a>.","mla":"Hammar, Petter, et al. “Single-Cell Screening of Photosynthetic Growth and Lactate Production by Cyanobacteria.” <i>Biotechnology for Biofuels</i>, vol. 8, no. 1, 193, BioMed Central, 2015, doi:<a href=\"https://doi.org/10.1186/s13068-015-0380-2\">10.1186/s13068-015-0380-2</a>."},"oa":1,"volume":8,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_created":"2018-12-11T11:53:05Z","external_id":{"isi":["000365784000009"]},"year":"2015"},{"ddc":["000"],"publication":"Scientific Reports","corr_author":"1","article_number":"17147","_id":"1624","citation":{"apa":"Pavlogiannis, A., Chatterjee, K., Adlam, B., &#38; Nowak, M. (2015). Cellular cooperation with shift updating and repulsion. <i>Scientific Reports</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/srep17147\">https://doi.org/10.1038/srep17147</a>","ieee":"A. Pavlogiannis, K. Chatterjee, B. Adlam, and M. Nowak, “Cellular cooperation with shift updating and repulsion,” <i>Scientific Reports</i>, vol. 5. Nature Publishing Group, 2015.","short":"A. Pavlogiannis, K. Chatterjee, B. Adlam, M. Nowak, Scientific Reports 5 (2015).","ama":"Pavlogiannis A, Chatterjee K, Adlam B, Nowak M. Cellular cooperation with shift updating and repulsion. <i>Scientific Reports</i>. 2015;5. doi:<a href=\"https://doi.org/10.1038/srep17147\">10.1038/srep17147</a>","ista":"Pavlogiannis A, Chatterjee K, Adlam B, Nowak M. 2015. Cellular cooperation with shift updating and repulsion. Scientific Reports. 5, 17147.","chicago":"Pavlogiannis, Andreas, Krishnendu Chatterjee, Ben Adlam, and Martin Nowak. “Cellular Cooperation with Shift Updating and Repulsion.” <i>Scientific Reports</i>. Nature Publishing Group, 2015. <a href=\"https://doi.org/10.1038/srep17147\">https://doi.org/10.1038/srep17147</a>.","mla":"Pavlogiannis, Andreas, et al. “Cellular Cooperation with Shift Updating and Repulsion.” <i>Scientific Reports</i>, vol. 5, 17147, Nature Publishing Group, 2015, doi:<a href=\"https://doi.org/10.1038/srep17147\">10.1038/srep17147</a>."},"volume":5,"oa":1,"project":[{"name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","grant_number":"279307"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","article_processing_charge":"No","department":[{"_id":"KrCh"}],"file":[{"checksum":"38e06d8310d2087cae5f6d4d4bfe082b","date_created":"2018-12-12T10:12:29Z","date_updated":"2020-07-14T12:45:07Z","file_size":1021931,"file_name":"IST-2016-466-v1+1_srep17147.pdf","creator":"system","file_id":"4947","access_level":"open_access","content_type":"application/pdf","relation":"main_file"}],"publisher":"Nature Publishing Group","year":"2015","acknowledgement":"The research was supported by the Austrian Science Fund (FWF) Grant No P23499-N23, FWF NFN Grant No S11407-N23 (RiSE/SHiNE), ERC Start grant (279307: Graph Games), and Microsoft Faculty Fellows award. Support from the John Templeton foundation is gratefully acknowledged.","external_id":{"isi":["000365299500001"]},"date_created":"2018-12-11T11:53:06Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","language":[{"iso":"eng"}],"publist_id":"5536","publication_status":"published","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"doi":"10.1038/srep17147","oa_version":"Published Version","intvolume":"         5","isi":1,"month":"11","status":"public","type":"journal_article","abstract":[{"lang":"eng","text":"Population structure can facilitate evolution of cooperation. In a structured population, cooperators can form clusters which resist exploitation by defectors. Recently, it was observed that a shift update rule is an extremely strong amplifier of cooperation in a one dimensional spatial model. For the shift update rule, an individual is chosen for reproduction proportional to fecundity; the offspring is placed next to the parent; a random individual dies. Subsequently, the population is rearranged (shifted) until all individual cells are again evenly spaced out. For large population size and a one dimensional population structure, the shift update rule favors cooperation for any benefit-to-cost ratio greater than one. But every attempt to generalize shift updating to higher dimensions while maintaining its strong effect has failed. The reason is that in two dimensions the clusters are fragmented by the movements caused by rearranging the cells. Here we introduce the natural phenomenon of a repulsive force between cells of different types. After a birth and death event, the cells are being rearranged minimizing the overall energy expenditure. If the repulsive force is sufficiently high, shift becomes a strong promoter of cooperation in two dimensions."}],"has_accepted_license":"1","ec_funded":1,"pubrep_id":"466","scopus_import":"1","date_published":"2015-11-25T00:00:00Z","file_date_updated":"2020-07-14T12:45:07Z","author":[{"last_name":"Pavlogiannis","id":"49704004-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8943-0722","full_name":"Pavlogiannis, Andreas","first_name":"Andreas"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu"},{"first_name":"Ben","full_name":"Adlam, Ben","last_name":"Adlam"},{"first_name":"Martin","full_name":"Nowak, Martin","last_name":"Nowak"}],"day":"25","date_updated":"2025-09-23T08:13:52Z","title":"Cellular cooperation with shift updating and repulsion"},{"date_created":"2018-12-11T11:53:06Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","year":"2015","external_id":{"isi":["000358786600010"]},"quality_controlled":"1","article_processing_charge":"No","publisher":"ACM","department":[{"_id":"BeBi"}],"citation":{"ieee":"A. Bermano, T. Beeler, Y. Kozlov, D. Bradley, B. Bickel, and M. Gross, “Detailed spatio-temporal reconstruction of eyelids,” presented at the SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques, Los Angeles, CA, United States, 2015, vol. 34, no. 4.","apa":"Bermano, A., Beeler, T., Kozlov, Y., Bradley, D., Bickel, B., &#38; Gross, M. (2015). Detailed spatio-temporal reconstruction of eyelids (Vol. 34). Presented at the SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques, Los Angeles, CA, United States: ACM. <a href=\"https://doi.org/10.1145/2766924\">https://doi.org/10.1145/2766924</a>","ama":"Bermano A, Beeler T, Kozlov Y, Bradley D, Bickel B, Gross M. Detailed spatio-temporal reconstruction of eyelids. In: Vol 34. ACM; 2015. doi:<a href=\"https://doi.org/10.1145/2766924\">10.1145/2766924</a>","short":"A. Bermano, T. Beeler, Y. Kozlov, D. Bradley, B. Bickel, M. Gross, in:, ACM, 2015.","ista":"Bermano A, Beeler T, Kozlov Y, Bradley D, Bickel B, Gross M. 2015. Detailed spatio-temporal reconstruction of eyelids. SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques vol. 34, 44.","mla":"Bermano, Amit, et al. <i>Detailed Spatio-Temporal Reconstruction of Eyelids</i>. Vol. 34, no. 4, 44, ACM, 2015, doi:<a href=\"https://doi.org/10.1145/2766924\">10.1145/2766924</a>.","chicago":"Bermano, Amit, Thabo Beeler, Yeara Kozlov, Derek Bradley, Bernd Bickel, and Markus Gross. “Detailed Spatio-Temporal Reconstruction of Eyelids,” Vol. 34. ACM, 2015. <a href=\"https://doi.org/10.1145/2766924\">https://doi.org/10.1145/2766924</a>."},"volume":34,"issue":"4","_id":"1625","article_number":"44","conference":{"location":"Los Angeles, CA, United States","end_date":"2015-08-13","name":"SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques","start_date":"2015-08-09"},"title":"Detailed spatio-temporal reconstruction of eyelids","date_updated":"2025-09-23T08:25:37Z","day":"27","date_published":"2015-07-27T00:00:00Z","author":[{"first_name":"Amit","full_name":"Bermano, Amit","last_name":"Bermano"},{"full_name":"Beeler, Thabo","first_name":"Thabo","last_name":"Beeler"},{"last_name":"Kozlov","first_name":"Yeara","full_name":"Kozlov, Yeara"},{"first_name":"Derek","full_name":"Bradley, Derek","last_name":"Bradley"},{"last_name":"Bickel","id":"49876194-F248-11E8-B48F-1D18A9856A87","first_name":"Bernd","full_name":"Bickel, Bernd","orcid":"0000-0001-6511-9385"},{"full_name":"Gross, Markus","first_name":"Markus","last_name":"Gross"}],"scopus_import":"1","type":"conference","abstract":[{"lang":"eng","text":"In recent years we have seen numerous improvements on 3D scanning and tracking of human faces, greatly advancing the creation of digital doubles for film and video games. However, despite the high-resolution quality of the reconstruction approaches available, current methods are unable to capture one of the most important regions of the face - the eye region. In this work we present the first method for detailed spatio-temporal reconstruction of eyelids. Tracking and reconstructing eyelids is extremely challenging, as this region exhibits very complex and unique skin deformation where skin is folded under while opening the eye. Furthermore, eyelids are often only partially visible and obstructed due to selfocclusion and eyelashes. Our approach is to combine a geometric deformation model with image data, leveraging multi-view stereo, optical flow, contour tracking and wrinkle detection from local skin appearance. Our deformation model serves as a prior that enables reconstruction of eyelids even under strong self-occlusions caused by rolling and folding skin as the eye opens and closes. The output is a person-specific, time-varying eyelid reconstruction with anatomically plausible deformations. Our high-resolution detailed eyelids couple naturally with current facial performance capture approaches. As a result, our method can largely increase the fidelity of facial capture and the creation of digital doubles."}],"intvolume":"        34","isi":1,"month":"07","status":"public","publication_status":"published","doi":"10.1145/2766924","oa_version":"None","language":[{"iso":"eng"}],"publist_id":"5535"},{"scopus_import":"1","author":[{"last_name":"Martin","first_name":"Tobias","full_name":"Martin, Tobias"},{"first_name":"Nobuyuki","full_name":"Umetani, Nobuyuki","last_name":"Umetani"},{"first_name":"Bernd","full_name":"Bickel, Bernd","orcid":"0000-0001-6511-9385","last_name":"Bickel","id":"49876194-F248-11E8-B48F-1D18A9856A87"}],"date_published":"2015-07-27T00:00:00Z","day":"27","date_updated":"2025-09-23T09:42:49Z","title":"OmniAD: Data-driven omni-directional aerodynamics","publist_id":"5532","language":[{"iso":"eng"}],"oa_version":"None","doi":"10.1145/2766919","publication_status":"published","status":"public","month":"07","isi":1,"intvolume":"        34","abstract":[{"lang":"eng","text":"This paper introduces &quot;OmniAD,&quot; a novel data-driven pipeline to model and acquire the aerodynamics of three-dimensional rigid objects. Traditionally, aerodynamics are examined through elaborate wind tunnel experiments or expensive fluid dynamics computations, and are only measured for a small number of discrete wind directions. OmniAD allows the evaluation of aerodynamic forces, such as drag and lift, for any incoming wind direction using a novel representation based on spherical harmonics. Our datadriven technique acquires the aerodynamic properties of an object simply by capturing its falling motion using a single camera. Once model parameters are estimated, OmniAD enables realistic realtime simulation of rigid bodies, such as the tumbling and gliding of leaves, without simulating the surrounding air. In addition, we propose an intuitive user interface based on OmniAD to interactively design three-dimensional kites that actually fly. Various nontraditional kites were designed to demonstrate the physical validity of our model."}],"type":"conference","issue":"4","volume":34,"citation":{"short":"T. Martin, N. Umetani, B. Bickel, in:, ACM, 2015.","ama":"Martin T, Umetani N, Bickel B. OmniAD: Data-driven omni-directional aerodynamics. In: Vol 34. ACM; 2015. doi:<a href=\"https://doi.org/10.1145/2766919\">10.1145/2766919</a>","apa":"Martin, T., Umetani, N., &#38; Bickel, B. (2015). OmniAD: Data-driven omni-directional aerodynamics (Vol. 34). Presented at the SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques, Los Angeles, CA, United States: ACM. <a href=\"https://doi.org/10.1145/2766919\">https://doi.org/10.1145/2766919</a>","ieee":"T. Martin, N. Umetani, and B. Bickel, “OmniAD: Data-driven omni-directional aerodynamics,” presented at the SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques, Los Angeles, CA, United States, 2015, vol. 34, no. 4.","chicago":"Martin, Tobias, Nobuyuki Umetani, and Bernd Bickel. “OmniAD: Data-Driven Omni-Directional Aerodynamics,” Vol. 34. ACM, 2015. <a href=\"https://doi.org/10.1145/2766919\">https://doi.org/10.1145/2766919</a>.","mla":"Martin, Tobias, et al. <i>OmniAD: Data-Driven Omni-Directional Aerodynamics</i>. Vol. 34, no. 4, 113, ACM, 2015, doi:<a href=\"https://doi.org/10.1145/2766919\">10.1145/2766919</a>.","ista":"Martin T, Umetani N, Bickel B. 2015. OmniAD: Data-driven omni-directional aerodynamics. SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques, ACM Transactions on Graphics, vol. 34, 113."},"publisher":"ACM","department":[{"_id":"BeBi"}],"article_processing_charge":"No","quality_controlled":"1","external_id":{"isi":["000358786600079"]},"year":"2015","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_created":"2018-12-11T11:53:06Z","alternative_title":["ACM Transactions on Graphics"],"conference":{"name":"SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques","location":"Los Angeles, CA, United States","end_date":"2015-08-13","start_date":"2015-08-09"},"article_number":"113","_id":"1626"},{"scopus_import":"1","date_published":"2015-07-27T00:00:00Z","author":[{"first_name":"Jesús","full_name":"Pérez, Jesús","last_name":"Pérez"},{"first_name":"Bernhard","full_name":"Thomaszewski, Bernhard","last_name":"Thomaszewski"},{"last_name":"Coros","first_name":"Stelian","full_name":"Coros, Stelian"},{"id":"49876194-F248-11E8-B48F-1D18A9856A87","last_name":"Bickel","orcid":"0000-0001-6511-9385","first_name":"Bernd","full_name":"Bickel, Bernd"},{"first_name":"José","full_name":"Canabal, José","last_name":"Canabal"},{"full_name":"Sumner, Robert","first_name":"Robert","last_name":"Sumner"},{"last_name":"Otaduy","first_name":"Miguel","full_name":"Otaduy, Miguel"}],"day":"27","date_updated":"2025-09-23T08:24:55Z","title":"Design and fabrication of flexible rod meshes","language":[{"iso":"eng"}],"publist_id":"5530","publication_status":"published","oa_version":"None","doi":"10.1145/2766998","intvolume":"        34","status":"public","isi":1,"month":"07","type":"conference","abstract":[{"text":"We present a computational tool for fabrication-oriented design of flexible rod meshes. Given a deformable surface and a set of deformed poses as input, our method automatically computes a printable rod mesh that, once manufactured, closely matches the input poses under the same boundary conditions. The core of our method is formed by an optimization scheme that adjusts the cross-sectional profiles of the rods and their rest centerline in order to best approximate the target deformations. This approach allows us to locally control the bending and stretching resistance of the surface with a single material, yielding high design flexibility and low fabrication cost.","lang":"eng"}],"volume":34,"citation":{"short":"J. Pérez, B. Thomaszewski, S. Coros, B. Bickel, J. Canabal, R. Sumner, M. Otaduy, in:, ACM, 2015.","ama":"Pérez J, Thomaszewski B, Coros S, et al. Design and fabrication of flexible rod meshes. In: Vol 34. ACM; 2015. doi:<a href=\"https://doi.org/10.1145/2766998\">10.1145/2766998</a>","ieee":"J. Pérez <i>et al.</i>, “Design and fabrication of flexible rod meshes,” presented at the SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques, Los Angeles, CA, United States, 2015, vol. 34, no. 4.","apa":"Pérez, J., Thomaszewski, B., Coros, S., Bickel, B., Canabal, J., Sumner, R., &#38; Otaduy, M. (2015). Design and fabrication of flexible rod meshes (Vol. 34). Presented at the SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques, Los Angeles, CA, United States: ACM. <a href=\"https://doi.org/10.1145/2766998\">https://doi.org/10.1145/2766998</a>","mla":"Pérez, Jesús, et al. <i>Design and Fabrication of Flexible Rod Meshes</i>. Vol. 34, no. 4, 138, ACM, 2015, doi:<a href=\"https://doi.org/10.1145/2766998\">10.1145/2766998</a>.","chicago":"Pérez, Jesús, Bernhard Thomaszewski, Stelian Coros, Bernd Bickel, José Canabal, Robert Sumner, and Miguel Otaduy. “Design and Fabrication of Flexible Rod Meshes,” Vol. 34. ACM, 2015. <a href=\"https://doi.org/10.1145/2766998\">https://doi.org/10.1145/2766998</a>.","ista":"Pérez J, Thomaszewski B, Coros S, Bickel B, Canabal J, Sumner R, Otaduy M. 2015. Design and fabrication of flexible rod meshes. SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques vol. 34, 138."},"issue":"4","article_processing_charge":"No","quality_controlled":"1","publisher":"ACM","department":[{"_id":"BeBi"}],"acknowledgement":"This work was supported in part by grants from the Spanish Ministry of Economy (TIN2012-35840), and the European Research Council (ERC Starting Grant no. 280135 Animetrics).","year":"2015","external_id":{"isi":["000358786600104"]},"date_created":"2018-12-11T11:53:07Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","conference":{"start_date":"2015-08-09","name":"SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques","location":"Los Angeles, CA, United States","end_date":"2015-08-13"},"article_number":"138","_id":"1627"}]