[{"alternative_title":["LNCS"],"project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","call_identifier":"FWF"},{"name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407","call_identifier":"FWF"},{"_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"}],"publisher":"Springer","ec_funded":1,"oa":1,"intvolume":"      8634","title":"Partial-observation stochastic reachability and parity games","publication_status":"published","_id":"1903","oa_version":"Preprint","abstract":[{"text":"We consider two-player zero-sum partial-observation stochastic games on graphs. Based on the information available to the players these games can be classified as follows: (a) general partial-observation (both players have partial view of the game); (b) one-sided partial-observation (one player has partial-observation and the other player has complete-observation); and (c) perfect-observation (both players have complete view of the game). The one-sided partial-observation games subsumes the important special case of one-player partial-observation stochastic games (or partial-observation Markov decision processes (POMDPs)). Based on the randomization available for the strategies, (a) the players may not be allowed to use randomization (pure strategies), or (b) they may choose a probability distribution over actions but the actual random choice is external and not visible to the player (actions invisible), or (c) they may use full randomization. We consider all these classes of games with reachability, and parity objectives that can express all ω-regular objectives. The analysis problems are classified into the qualitative analysis that asks for the existence of a strategy that ensures the objective with probability 1; and the quantitative analysis that asks for the existence of a strategy that ensures the objective with probability at least λ (0,1). In this talk we will cover a wide range of results: for perfect-observation games; for POMDPs; for one-sided partial-observation games; and for general partial-observation games.","lang":"eng"}],"year":"2014","main_file_link":[{"url":"https://doi.org/10.15479/AT:IST-2011-0007","open_access":"1"}],"pubrep_id":"141","OA_type":"green","conference":{"start_date":"2014-08-25","end_date":"2014-08-29","name":"MFCS: Mathematical Foundations of Computer Science","location":"Budapest, Hungary"},"article_processing_charge":"No","scopus_import":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.1007/978-3-662-44522-8_1","publist_id":"5192","volume":8634,"quality_controlled":"1","citation":{"mla":"Chatterjee, Krishnendu. <i>Partial-Observation Stochastic Reachability and Parity Games</i>. Vol. 8634, no. PART 1, Springer, 2014, pp. 1–4, doi:<a href=\"https://doi.org/10.1007/978-3-662-44522-8_1\">10.1007/978-3-662-44522-8_1</a>.","apa":"Chatterjee, K. (2014). Partial-observation stochastic reachability and parity games (Vol. 8634, pp. 1–4). Presented at the MFCS: Mathematical Foundations of Computer Science, Budapest, Hungary: Springer. <a href=\"https://doi.org/10.1007/978-3-662-44522-8_1\">https://doi.org/10.1007/978-3-662-44522-8_1</a>","ama":"Chatterjee K. Partial-observation stochastic reachability and parity games. In: Vol 8634. Springer; 2014:1-4. doi:<a href=\"https://doi.org/10.1007/978-3-662-44522-8_1\">10.1007/978-3-662-44522-8_1</a>","chicago":"Chatterjee, Krishnendu. “Partial-Observation Stochastic Reachability and Parity Games,” 8634:1–4. Springer, 2014. <a href=\"https://doi.org/10.1007/978-3-662-44522-8_1\">https://doi.org/10.1007/978-3-662-44522-8_1</a>.","ista":"Chatterjee K. 2014. Partial-observation stochastic reachability and parity games. MFCS: Mathematical Foundations of Computer Science, LNCS, vol. 8634, 1–4.","short":"K. Chatterjee, in:, Springer, 2014, pp. 1–4.","ieee":"K. Chatterjee, “Partial-observation stochastic reachability and parity games,” presented at the MFCS: Mathematical Foundations of Computer Science, Budapest, Hungary, 2014, vol. 8634, no. PART 1, pp. 1–4."},"page":"1 - 4","status":"public","date_published":"2014-01-01T00:00:00Z","month":"01","date_updated":"2026-07-07T14:01:25Z","department":[{"_id":"KrCh"}],"type":"conference","issue":"PART 1","corr_author":"1","related_material":{"record":[{"status":"public","id":"5381","relation":"earlier_version"},{"id":"2211","status":"public","relation":"later_version"}]},"OA_place":"repository","day":"01","date_created":"2018-12-11T11:54:38Z","language":[{"iso":"eng"}],"author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"}]},{"oa":1,"intvolume":"        15","title":"Partial-observation stochastic games: How to win when belief fails","publication_status":"published","_id":"2211","oa_version":"Preprint","abstract":[{"lang":"eng","text":"In two-player finite-state stochastic games of partial observation on graphs, in every state of the graph, the players simultaneously choose an action, and their joint actions determine a probability distribution over the successor states. The game is played for infinitely many rounds and thus the players construct an infinite path in the graph. We consider reachability objectives where the first player tries to ensure a target state to be visited almost-surely (i.e., with probability 1) or positively (i.e., with positive probability), no matter the strategy of the second player. We classify such games according to the information and to the power of randomization available to the players. On the basis of information, the game can be one-sided with either (a) player 1, or (b) player 2 having partial observation (and the other player has perfect observation), or two-sided with (c) both players having partial observation. On the basis of randomization, (a) the players may not be allowed to use randomization (pure strategies), or (b) they may choose a probability distribution over actions but the actual random choice is external and not visible to the player (actions invisible), or (c) they may use full randomization. Our main results for pure strategies are as follows: (1) For one-sided games with player 2 having perfect observation we show that (in contrast to full randomized strategies) belief-based (subset-construction based) strategies are not sufficient, and we present an exponential upper bound on memory both for almost-sure and positive winning strategies; we show that the problem of deciding the existence of almost-sure and positive winning strategies for player 1 is EXPTIME-complete and present symbolic algorithms that avoid the explicit exponential construction. (2) For one-sided games with player 1 having perfect observation we show that nonelementarymemory is both necessary and sufficient for both almost-sure and positive winning strategies. (3) We show that for the general (two-sided) case finite-memory strategies are sufficient for both positive and almost-sure winning, and at least nonelementary memory is required. We establish the equivalence of the almost-sure winning problems for pure strategies and for randomized strategies with actions invisible. Our equivalence result exhibit serious flaws in previous results of the literature: we show a nonelementary memory lower bound for almost-sure winning whereas an exponential upper bound was previously claimed."}],"year":"2014","das_tickbox":"1","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1107.2141"}],"arxiv":1,"external_id":{"arxiv":["1107.2141"],"isi":["000336005000006"]},"publisher":"ACM","article_number":"16","status":"public","publication":"ACM Transactions on Computational Logic","month":"04","date_published":"2014-04-01T00:00:00Z","date_updated":"2026-07-07T14:01:26Z","department":[{"_id":"KrCh"}],"issue":"2","type":"journal_article","related_material":{"record":[{"status":"public","id":"5381","relation":"earlier_version"},{"status":"public","id":"1903","relation":"earlier_version"},{"relation":"earlier_version","status":"public","id":"2955"}]},"date_created":"2018-12-11T11:56:21Z","day":"01","language":[{"iso":"eng"}],"author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu"},{"first_name":"Laurent","last_name":"Doyen","full_name":"Doyen, Laurent"}],"isi":1,"article_processing_charge":"No","scopus_import":"1","doi":"10.1145/2579821","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"4759","volume":15,"quality_controlled":"1","citation":{"chicago":"Chatterjee, Krishnendu, and Laurent Doyen. “Partial-Observation Stochastic Games: How to Win When Belief Fails.” <i>ACM Transactions on Computational Logic</i>. ACM, 2014. <a href=\"https://doi.org/10.1145/2579821\">https://doi.org/10.1145/2579821</a>.","apa":"Chatterjee, K., &#38; Doyen, L. (2014). Partial-observation stochastic games: How to win when belief fails. <i>ACM Transactions on Computational Logic</i>. ACM. <a href=\"https://doi.org/10.1145/2579821\">https://doi.org/10.1145/2579821</a>","ama":"Chatterjee K, Doyen L. Partial-observation stochastic games: How to win when belief fails. <i>ACM Transactions on Computational Logic</i>. 2014;15(2). doi:<a href=\"https://doi.org/10.1145/2579821\">10.1145/2579821</a>","mla":"Chatterjee, Krishnendu, and Laurent Doyen. “Partial-Observation Stochastic Games: How to Win When Belief Fails.” <i>ACM Transactions on Computational Logic</i>, vol. 15, no. 2, 16, ACM, 2014, doi:<a href=\"https://doi.org/10.1145/2579821\">10.1145/2579821</a>.","ieee":"K. Chatterjee and L. Doyen, “Partial-observation stochastic games: How to win when belief fails,” <i>ACM Transactions on Computational Logic</i>, vol. 15, no. 2. ACM, 2014.","short":"K. Chatterjee, L. Doyen, ACM Transactions on Computational Logic 15 (2014).","ista":"Chatterjee K, Doyen L. 2014. Partial-observation stochastic games: How to win when belief fails. ACM Transactions on Computational Logic. 15(2), 16."}},{"doi":"10.1007/978-3-662-44584-6_37","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","publist_id":"4992","volume":8704,"citation":{"chicago":"Chatterjee, Krishnendu. “Qualitative Concurrent Parity Games: Bounded Rationality.” In <i>Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>, edited by Paolo Baldan and Daniele Gorla, 8704:544–59. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2014. <a href=\"https://doi.org/10.1007/978-3-662-44584-6_37\">https://doi.org/10.1007/978-3-662-44584-6_37</a>.","apa":"Chatterjee, K. (2014). Qualitative concurrent parity games: Bounded rationality. In P. Baldan &#38; D. Gorla (Eds.), <i>Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i> (Vol. 8704, pp. 544–559). Rome, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.1007/978-3-662-44584-6_37\">https://doi.org/10.1007/978-3-662-44584-6_37</a>","ama":"Chatterjee K. Qualitative concurrent parity games: Bounded rationality. In: Baldan P, Gorla D, eds. <i>Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>. Vol 8704. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2014:544-559. doi:<a href=\"https://doi.org/10.1007/978-3-662-44584-6_37\">10.1007/978-3-662-44584-6_37</a>","mla":"Chatterjee, Krishnendu. “Qualitative Concurrent Parity Games: Bounded Rationality.” <i>Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>, edited by Paolo Baldan and Daniele Gorla, vol. 8704, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2014, pp. 544–59, doi:<a href=\"https://doi.org/10.1007/978-3-662-44584-6_37\">10.1007/978-3-662-44584-6_37</a>.","ieee":"K. Chatterjee, “Qualitative concurrent parity games: Bounded rationality,” in <i>Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)</i>, Rome, Italy, 2014, vol. 8704, pp. 544–559.","ista":"Chatterjee K. 2014. Qualitative concurrent parity games: Bounded rationality. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). CONCUR: Concurrency Theory, LNCS, vol. 8704, 544–559.","short":"K. Chatterjee, in:, P. Baldan, D. Gorla (Eds.), Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2014, pp. 544–559."},"quality_controlled":"1","scopus_import":"1","editor":[{"full_name":"Baldan, Paolo","first_name":"Paolo","last_name":"Baldan"},{"last_name":"Gorla","first_name":"Daniele","full_name":"Gorla, Daniele"}],"corr_author":"1","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"3354"}]},"language":[{"iso":"eng"}],"day":"01","date_created":"2018-12-11T11:55:27Z","author":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"}],"page":"544 - 559","status":"public","publication":"Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)","month":"09","date_published":"2014-09-01T00:00:00Z","date_updated":"2026-07-07T14:02:37Z","department":[{"_id":"KrCh"}],"type":"conference","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","alternative_title":["LNCS"],"project":[{"grant_number":"P 23499-N23","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S11407"},{"grant_number":"279307","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"abstract":[{"text":"We study two-player concurrent games on finite-state graphs played for an infinite number of rounds, where in each round, the two players (player 1 and player 2) choose their moves independently and simultaneously; the current state and the two moves determine the successor state. The objectives are ω-regular winning conditions specified as parity objectives. We consider the qualitative analysis problems: the computation of the almost-sure and limit-sure winning set of states, where player 1 can ensure to win with probability 1 and with probability arbitrarily close to 1, respectively. In general the almost-sure and limit-sure winning strategies require both infinite-memory as well as infinite-precision (to describe probabilities). While the qualitative analysis problem for concurrent parity games with infinite-memory, infinite-precision randomized strategies was studied before, we study the bounded-rationality problem for qualitative analysis of concurrent parity games, where the strategy set for player 1 is restricted to bounded-resource strategies. In terms of precision, strategies can be deterministic, uniform, finite-precision, or infinite-precision; and in terms of memory, strategies can be memoryless, finite-memory, or infinite-memory. We present a precise and complete characterization of the qualitative winning sets for all combinations of classes of strategies. In particular, we show that uniform memoryless strategies are as powerful as finite-precision infinite-memory strategies, and infinite-precision memoryless strategies are as powerful as infinite-precision finite-memory strategies. We show that the winning sets can be computed in (n2d+3) time, where n is the size of the game structure and 2d is the number of priorities (or colors), and our algorithms are symbolic. The membership problem of whether a state belongs to a winning set can be decided in NP ∩ coNP. Our symbolic algorithms are based on a characterization of the winning sets as μ-calculus formulas, however, our μ-calculus formulas are crucially different from the ones for concurrent parity games (without bounded rationality); and our memoryless witness strategy constructions are significantly different from the infinite-memory witness strategy constructions for concurrent parity games.","lang":"eng"}],"year":"2014","conference":{"end_date":"2014-09-05","name":"CONCUR: Concurrency Theory","location":"Rome, Italy","start_date":"2014-09-02"},"ec_funded":1,"intvolume":"      8704","title":"Qualitative concurrent parity games: Bounded rationality","_id":"2054","publication_status":"published","oa_version":"None"},{"isi":1,"article_processing_charge":"No","scopus_import":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","doi":"10.1007/s00453-013-9843-7","publist_id":"7282","quality_controlled":"1","citation":{"apa":"Chatterjee, K., Henzinger, M., Krinninger, S., &#38; Nanongkai, D. (2014). Polynomial-time algorithms for energy games with special weight structures. <i>Algorithmica</i>. Springer. <a href=\"https://doi.org/10.1007/s00453-013-9843-7\">https://doi.org/10.1007/s00453-013-9843-7</a>","ama":"Chatterjee K, Henzinger M, Krinninger S, Nanongkai D. Polynomial-time algorithms for energy games with special weight structures. <i>Algorithmica</i>. 2014;70(3):457-492. doi:<a href=\"https://doi.org/10.1007/s00453-013-9843-7\">10.1007/s00453-013-9843-7</a>","mla":"Chatterjee, Krishnendu, et al. “Polynomial-Time Algorithms for Energy Games with Special Weight Structures.” <i>Algorithmica</i>, vol. 70, no. 3, Springer, 2014, pp. 457–92, doi:<a href=\"https://doi.org/10.1007/s00453-013-9843-7\">10.1007/s00453-013-9843-7</a>.","chicago":"Chatterjee, Krishnendu, Monika Henzinger, Sebastian Krinninger, and Danupon Nanongkai. “Polynomial-Time Algorithms for Energy Games with Special Weight Structures.” <i>Algorithmica</i>. Springer, 2014. <a href=\"https://doi.org/10.1007/s00453-013-9843-7\">https://doi.org/10.1007/s00453-013-9843-7</a>.","ista":"Chatterjee K, Henzinger M, Krinninger S, Nanongkai D. 2014. Polynomial-time algorithms for energy games with special weight structures. Algorithmica. 70(3), 457–492.","short":"K. Chatterjee, M. Henzinger, S. Krinninger, D. Nanongkai, Algorithmica 70 (2014) 457–492.","ieee":"K. Chatterjee, M. Henzinger, S. Krinninger, and D. Nanongkai, “Polynomial-time algorithms for energy games with special weight structures,” <i>Algorithmica</i>, vol. 70, no. 3. Springer, pp. 457–492, 2014."},"volume":70,"status":"public","page":"457 - 492","date_published":"2014-11-01T00:00:00Z","month":"11","publication":"Algorithmica","date_updated":"2026-07-08T05:50:38Z","type":"journal_article","issue":"3","department":[{"_id":"KrCh"}],"article_type":"original","related_material":{"record":[{"id":"10905","status":"public","relation":"earlier_version"}]},"day":"01","language":[{"iso":"eng"}],"date_created":"2018-12-11T11:47:01Z","author":[{"first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger","first_name":"Monika H","full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530"},{"full_name":"Krinninger, Sebastian","last_name":"Krinninger","first_name":"Sebastian"},{"full_name":"Nanongkai, Danupon","last_name":"Nanongkai","first_name":"Danupon"}],"external_id":{"arxiv":["1604.08234"],"isi":["000340552300005"]},"project":[{"name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"P 23499-N23"},{"call_identifier":"FWF","grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425","name":"Game Theory"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","grant_number":"279307"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"publisher":"Springer","intvolume":"        70","ec_funded":1,"oa":1,"publication_status":"published","_id":"535","title":"Polynomial-time algorithms for energy games with special weight structures","oa_version":"Preprint","year":"2014","abstract":[{"text":"Energy games belong to a class of turn-based two-player infinite-duration games played on a weighted directed graph. It is one of the rare and intriguing combinatorial problems that lie in NP∩co-NP, but are not known to be in P. The existence of polynomial-time algorithms has been a major open problem for decades and apart from pseudopolynomial algorithms there is no algorithm that solves any non-trivial subclass in polynomial time. In this paper, we give several results based on the weight structures of the graph. First, we identify a notion of penalty and present a polynomial-time algorithm when the penalty is large. Our algorithm is the first polynomial-time algorithm on a large class of weighted graphs. It includes several worst-case instances on which previous algorithms, such as value iteration and random facet algorithms, require at least sub-exponential time. Our main technique is developing the first non-trivial approximation algorithm and showing how to convert it to an exact algorithm. Moreover, we show that in a practical case in verification where weights are clustered around a constant number of values, the energy game problem can be solved in polynomial time. We also show that the problem is still as hard as in general when the clique-width is bounded or the graph is strongly ergodic, suggesting that restricting the graph structure does not necessarily help.","lang":"eng"}],"main_file_link":[{"url":"https://arxiv.org/abs/1604.08234","open_access":"1"}],"arxiv":1},{"volume":8837,"quality_controlled":"1","citation":{"chicago":"Gupta, Ashutosh, Laura Kovács, Bernhard Kragl, and Andrei Voronkov. “Extensional Crisis and Proving Identity.” In <i>12th International Symposium on Automated Technology for Verification and Analysis</i>, 8837:185–200. Springer, 2014. <a href=\"https://doi.org/10.1007/978-3-319-11936-6_14\">https://doi.org/10.1007/978-3-319-11936-6_14</a>.","mla":"Gupta, Ashutosh, et al. “Extensional Crisis and Proving Identity.” <i>12th International Symposium on Automated Technology for Verification and Analysis</i>, vol. 8837, Springer, 2014, pp. 185–200, doi:<a href=\"https://doi.org/10.1007/978-3-319-11936-6_14\">10.1007/978-3-319-11936-6_14</a>.","apa":"Gupta, A., Kovács, L., Kragl, B., &#38; Voronkov, A. (2014). Extensional crisis and proving identity. In <i>12th International Symposium on Automated Technology for Verification and Analysis</i> (Vol. 8837, pp. 185–200). Sydney, Australia: Springer. <a href=\"https://doi.org/10.1007/978-3-319-11936-6_14\">https://doi.org/10.1007/978-3-319-11936-6_14</a>","ama":"Gupta A, Kovács L, Kragl B, Voronkov A. Extensional crisis and proving identity. In: <i>12th International Symposium on Automated Technology for Verification and Analysis</i>. Vol 8837. Springer; 2014:185-200. doi:<a href=\"https://doi.org/10.1007/978-3-319-11936-6_14\">10.1007/978-3-319-11936-6_14</a>","ieee":"A. Gupta, L. Kovács, B. Kragl, and A. Voronkov, “Extensional crisis and proving identity,” in <i>12th International Symposium on Automated Technology for Verification and Analysis</i>, Sydney, Australia, 2014, vol. 8837, pp. 185–200.","ista":"Gupta A, Kovács L, Kragl B, Voronkov A. 2014. Extensional crisis and proving identity. 12th International Symposium on Automated Technology for Verification and Analysis. ATVA: Automated Technology for Verification and Analysis, LNCS, vol. 8837, 185–200.","short":"A. Gupta, L. Kovács, B. Kragl, A. Voronkov, in:, 12th International Symposium on Automated Technology for Verification and Analysis, Springer, 2014, pp. 185–200."},"publist_id":"5226","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.1007/978-3-319-11936-6_14","scopus_import":"1","article_processing_charge":"No","file":[{"file_size":244294,"content_type":"application/pdf","file_id":"4801","date_updated":"2020-07-14T12:45:19Z","checksum":"af4bd3fc1f4c93075e4dc5cbf625fe7b","creator":"system","file_name":"IST-2016-641-v1+1_atva2014.pdf","access_level":"open_access","date_created":"2018-12-12T10:10:15Z","relation":"main_file"}],"author":[{"full_name":"Gupta, Ashutosh","id":"335E5684-F248-11E8-B48F-1D18A9856A87","last_name":"Gupta","first_name":"Ashutosh"},{"full_name":"Kovács, Laura","last_name":"Kovács","first_name":"Laura"},{"first_name":"Bernhard","id":"320FC952-F248-11E8-B48F-1D18A9856A87","last_name":"Kragl","orcid":"0000-0001-7745-9117","full_name":"Kragl, Bernhard"},{"full_name":"Voronkov, Andrei","first_name":"Andrei","last_name":"Voronkov"}],"file_date_updated":"2020-07-14T12:45:19Z","date_created":"2018-12-11T11:54:28Z","day":"01","language":[{"iso":"eng"}],"acknowledgement":"This research was supported in part by the Austrian National Research Network RiSE (S11410-N23).","has_accepted_license":"1","department":[{"_id":"ToHe"}],"type":"conference","date_updated":"2026-07-08T06:49:33Z","publication":"12th International Symposium on Automated Technology for Verification and Analysis","ddc":["000"],"date_published":"2014-01-01T00:00:00Z","month":"01","page":"185 - 200","status":"public","publisher":"Springer","project":[{"grant_number":"267989","call_identifier":"FP7","name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","grant_number":"S11402-N23","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","name":"Moderne Concurrency Paradigms"}],"alternative_title":["LNCS"],"conference":{"start_date":"2014-11-03","location":"Sydney, Australia","end_date":"2014-11-07","name":"ATVA: Automated Technology for Verification and Analysis"},"pubrep_id":"641","abstract":[{"lang":"eng","text":"Extensionality axioms are common when reasoning about data collections, such as arrays and functions in program analysis, or sets in mathematics. An extensionality axiom asserts that two collections are equal if they consist of the same elements at the same indices. Using extensionality is often required to show that two collections are equal. A typical example is the set theory theorem (∀x)(∀y)x∪y = y ∪x. Interestingly, while humans have no problem with proving such set identities using extensionality, they are very hard for superposition theorem provers because of the calculi they use. In this paper we show how addition of a new inference rule, called extensionality resolution, allows first-order theorem provers to easily solve problems no modern first-order theorem prover can solve. We illustrate this by running the VAMPIRE theorem prover with extensionality resolution on a number of set theory and array problems. Extensionality resolution helps VAMPIRE to solve problems from the TPTP library of first-order problems that were never solved before by any prover."}],"year":"2014","das_tickbox":"1","oa_version":"Submitted Version","title":"Extensional crisis and proving identity","publication_status":"published","_id":"1872","ec_funded":1,"oa":1,"intvolume":"      8837"},{"year":"2014","abstract":[{"lang":"eng","text":"Background: The brood of ants and other social insects is highly susceptible to pathogens, particularly those that penetrate the soft larval and pupal cuticle. We here test whether the presence of a pupal cocoon, which occurs in some ant species but not in others, affects the sanitary brood care and fungal infection patterns after exposure to the entomopathogenic fungus Metarhizium brunneum. We use a) a comparative approach analysing four species with either naked or cocooned pupae and b) a within-species analysis of a single ant species, in which both pupal types co-exist in the same colony. Results: We found that the presence of a cocoon did not compromise fungal pathogen detection by the ants and that species with cocooned pupae increased brood grooming after pathogen exposure. All tested ant species further removed brood from their nests, which was predominantly expressed towards larvae and naked pupae treated with the live fungal pathogen. In contrast, cocooned pupae exposed to live fungus were not removed at higher rates than cocooned pupae exposed to dead fungus or a sham control. Consistent with this, exposure to the live fungus caused high numbers of infections and fungal outgrowth in larvae and naked pupae, but not in cocooned pupae. Moreover, the ants consistently removed the brood prior to fungal outgrowth, ensuring a clean brood chamber. Conclusion: Our study suggests that the pupal cocoon has a protective effect against fungal infection, causing an adaptive change in sanitary behaviours by the ants. It further demonstrates that brood removal - originally described for honeybees as “hygienic behaviour” – is a widespread sanitary behaviour in ants, which likely has important implications on disease dynamics in social insect colonies."}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.5061/dryad.nc0gc"}],"related_material":{"record":[{"status":"public","id":"2284","relation":"used_in_publication"}]},"day":"08","date_created":"2021-07-30T08:24:11Z","author":[{"full_name":"Tragust, Simon","last_name":"Tragust","id":"35A7A418-F248-11E8-B48F-1D18A9856A87","first_name":"Simon"},{"first_name":"Line V","last_name":"Ugelvig","id":"3DC97C8E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-1832-8883","full_name":"Ugelvig, Line V"},{"first_name":"Michel","last_name":"Chapuisat","full_name":"Chapuisat, Michel"},{"last_name":"Heinze","first_name":"Jürgen","full_name":"Heinze, Jürgen"},{"first_name":"Sylvia","last_name":"Cremer","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2193-3868","full_name":"Cremer, Sylvia"}],"status":"public","date_published":"2014-10-08T00:00:00Z","month":"10","oa":1,"_id":"9753","date_updated":"2026-07-28T09:35:11Z","title":"Data from: Pupal cocoons affect sanitary brood care and limit fungal infections in ant colonies","type":"research_data_reference","oa_version":"Published Version","department":[{"_id":"SyCr"}],"user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","doi":"10.5061/dryad.nc0gc","publisher":"Dryad","citation":{"chicago":"Tragust, Simon, Line V Ugelvig, Michel Chapuisat, Jürgen Heinze, and Sylvia Cremer. “Data from: Pupal Cocoons Affect Sanitary Brood Care and Limit Fungal Infections in Ant Colonies.” Dryad, 2014. <a href=\"https://doi.org/10.5061/dryad.nc0gc\">https://doi.org/10.5061/dryad.nc0gc</a>.","mla":"Tragust, Simon, et al. <i>Data from: Pupal Cocoons Affect Sanitary Brood Care and Limit Fungal Infections in Ant Colonies</i>. Dryad, 2014, doi:<a href=\"https://doi.org/10.5061/dryad.nc0gc\">10.5061/dryad.nc0gc</a>.","ama":"Tragust S, Ugelvig LV, Chapuisat M, Heinze J, Cremer S. Data from: Pupal cocoons affect sanitary brood care and limit fungal infections in ant colonies. 2014. doi:<a href=\"https://doi.org/10.5061/dryad.nc0gc\">10.5061/dryad.nc0gc</a>","apa":"Tragust, S., Ugelvig, L. V., Chapuisat, M., Heinze, J., &#38; Cremer, S. (2014). Data from: Pupal cocoons affect sanitary brood care and limit fungal infections in ant colonies. Dryad. <a href=\"https://doi.org/10.5061/dryad.nc0gc\">https://doi.org/10.5061/dryad.nc0gc</a>","ieee":"S. Tragust, L. V. Ugelvig, M. Chapuisat, J. Heinze, and S. Cremer, “Data from: Pupal cocoons affect sanitary brood care and limit fungal infections in ant colonies.” Dryad, 2014.","short":"S. Tragust, L.V. Ugelvig, M. Chapuisat, J. Heinze, S. Cremer, (2014).","ista":"Tragust S, Ugelvig LV, Chapuisat M, Heinze J, Cremer S. 2014. Data from: Pupal cocoons affect sanitary brood care and limit fungal infections in ant colonies, Dryad, <a href=\"https://doi.org/10.5061/dryad.nc0gc\">10.5061/dryad.nc0gc</a>."},"article_processing_charge":"No"},{"publication":"Acta Informatica","month":"06","date_published":"2014-06-01T00:00:00Z","page":"129 - 163","status":"public","department":[{"_id":"KrCh"}],"type":"journal_article","issue":"3-4","date_updated":"2026-07-28T11:24:52Z","related_material":{"record":[{"id":"10904","status":"public","relation":"earlier_version"}]},"article_type":"original","acknowledgement":"Krishnendu Chatterjee is supported by Austrian Science Fund (FWF) Grant No P 23499-N23, FWF NFN Grant No S11407 (RiSE), ERC Starting Grant (279307: Graph Games) and Microsoft faculty fellowship. Mickael Randour is supported by F.R.S.-FNRS. fellowship. \r\nJean-François Raskin is supported by ERC Starting Grant (279499: inVEST).Thanks to D. Sbabo for useful pointers, V. Bruyère for comments on a preliminary draft, and A. Bohy for fruitful discussions about the Acacia+ tool. We are grateful to the anonymous reviewers for their insightful comments. ","author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu"},{"full_name":"Randour, Mickael","last_name":"Randour","first_name":"Mickael"},{"last_name":"Raskin","first_name":"Jean","full_name":"Raskin, Jean"}],"day":"01","language":[{"iso":"eng"}],"date_created":"2018-12-11T11:59:14Z","article_processing_charge":"No","isi":1,"scopus_import":"1","publist_id":"4176","doi":"10.1007/s00236-013-0182-6","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":51,"quality_controlled":"1","citation":{"ieee":"K. Chatterjee, M. Randour, and J. Raskin, “Strategy synthesis for multi-dimensional quantitative objectives,” <i>Acta Informatica</i>, vol. 51, no. 3–4. Springer, pp. 129–163, 2014.","short":"K. Chatterjee, M. Randour, J. Raskin, Acta Informatica 51 (2014) 129–163.","ista":"Chatterjee K, Randour M, Raskin J. 2014. Strategy synthesis for multi-dimensional quantitative objectives. Acta Informatica. 51(3–4), 129–163.","chicago":"Chatterjee, Krishnendu, Mickael Randour, and Jean Raskin. “Strategy Synthesis for Multi-Dimensional Quantitative Objectives.” <i>Acta Informatica</i>. Springer, 2014. <a href=\"https://doi.org/10.1007/s00236-013-0182-6\">https://doi.org/10.1007/s00236-013-0182-6</a>.","ama":"Chatterjee K, Randour M, Raskin J. Strategy synthesis for multi-dimensional quantitative objectives. <i>Acta Informatica</i>. 2014;51(3-4):129-163. doi:<a href=\"https://doi.org/10.1007/s00236-013-0182-6\">10.1007/s00236-013-0182-6</a>","apa":"Chatterjee, K., Randour, M., &#38; Raskin, J. (2014). Strategy synthesis for multi-dimensional quantitative objectives. <i>Acta Informatica</i>. Springer. <a href=\"https://doi.org/10.1007/s00236-013-0182-6\">https://doi.org/10.1007/s00236-013-0182-6</a>","mla":"Chatterjee, Krishnendu, et al. “Strategy Synthesis for Multi-Dimensional Quantitative Objectives.” <i>Acta Informatica</i>, vol. 51, no. 3–4, Springer, 2014, pp. 129–63, doi:<a href=\"https://doi.org/10.1007/s00236-013-0182-6\">10.1007/s00236-013-0182-6</a>."},"ec_funded":1,"oa":1,"intvolume":"        51","oa_version":"Preprint","title":"Strategy synthesis for multi-dimensional quantitative objectives","publication_status":"published","_id":"2716","main_file_link":[{"url":"http://arxiv.org/abs/1201.5073","open_access":"1"}],"abstract":[{"text":"Multi-dimensional mean-payoff and energy games provide the mathematical foundation for the quantitative study of reactive systems, and play a central role in the emerging quantitative theory of verification and synthesis. In this work, we study the strategy synthesis problem for games with such multi-dimensional objectives along with a parity condition, a canonical way to express ω ω -regular conditions. While in general, the winning strategies in such games may require infinite memory, for synthesis the most relevant problem is the construction of a finite-memory winning strategy (if one exists). Our main contributions are as follows. First, we show a tight exponential bound (matching upper and lower bounds) on the memory required for finite-memory winning strategies in both multi-dimensional mean-payoff and energy games along with parity objectives. This significantly improves the triple exponential upper bound for multi energy games (without parity) that could be derived from results in literature for games on vector addition systems with states. Second, we present an optimal symbolic and incremental algorithm to compute a finite-memory winning strategy (if one exists) in such games. Finally, we give a complete characterization of when finite memory of strategies can be traded off for randomness. In particular, we show that for one-dimension mean-payoff parity games, randomized memoryless strategies are as powerful as their pure finite-memory counterparts.","lang":"eng"}],"das_tickbox":"1","year":"2014","arxiv":1,"external_id":{"isi":["000335981500002"],"arxiv":["1201.5073"]},"project":[{"name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407","call_identifier":"FWF"},{"grant_number":"P 23499-N23","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"279307"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"publisher":"Springer"},{"citation":{"mla":"Konrad, Matthias. <i>Immune Defences in Ants: Effects of Social Immunisation and a Fungal Ectosymbiont in the Ant Lasius Neglectus</i>. Institute of Science and Technology Austria, 2014.","apa":"Konrad, M. (2014). <i>Immune defences in ants: Effects of social immunisation and a fungal ectosymbiont in the ant Lasius neglectus</i>. Institute of Science and Technology Austria.","ama":"Konrad M. Immune defences in ants: Effects of social immunisation and a fungal ectosymbiont in the ant Lasius neglectus. 2014.","chicago":"Konrad, Matthias. “Immune Defences in Ants: Effects of Social Immunisation and a Fungal Ectosymbiont in the Ant Lasius Neglectus.” Institute of Science and Technology Austria, 2014.","ista":"Konrad M. 2014. Immune defences in ants: Effects of social immunisation and a fungal ectosymbiont in the ant Lasius neglectus. Institute of Science and Technology Austria.","short":"M. Konrad, Immune Defences in Ants: Effects of Social Immunisation and a Fungal Ectosymbiont in the Ant Lasius Neglectus, Institute of Science and Technology Austria, 2014.","ieee":"M. Konrad, “Immune defences in ants: Effects of social immunisation and a fungal ectosymbiont in the ant Lasius neglectus,” Institute of Science and Technology Austria, 2014."},"supervisor":[{"orcid":"0000-0002-2193-3868","full_name":"Cremer, Sylvia M","first_name":"Sylvia M","last_name":"Cremer","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87"}],"publist_id":"5814","publisher":"Institute of Science and Technology Austria","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","alternative_title":["ISTA Thesis"],"article_processing_charge":"No","publication_identifier":{"issn":["2663-337X"]},"author":[{"full_name":"Konrad, Matthias","first_name":"Matthias","last_name":"Konrad","id":"46528076-F248-11E8-B48F-1D18A9856A87"}],"language":[{"iso":"eng"}],"date_created":"2018-12-11T11:51:46Z","day":"01","OA_place":"publisher","abstract":[{"lang":"eng","text":"In this thesis I studied various individual and social immune defences employed by the invasive garden ant Lasius neglectus mostly against entomopathogenic fungi.  The first two chapters of this thesis address the phenomenon of 'social immunisation'. Social immunisation, that is the immunological protection of group members due to social contact to a pathogen-exposed nestmate, has been described in various social insect species against different types of pathogens. However, in the case of entomopathogenic fungi it has, so far, only been demonstrated that social immunisation exists at all. Its underlying mechanisms r any other properties were, however, unknown. In the first chapter of this thesis I identified the mechanistic basis of social immunisation in L. neglectus against the entomopathogenous fungus Metarhizium. I could show that nestmates of a pathogen-exposed individual contract low-level infections due to social interactions. These low-level infections are, however, non-lethal and cause an active stimulation of the immune system, which protects the nestmates upon subsequent pathogen encounters. In the second chapter of this thesis I investigated the specificity and colony level effects of social immunisation. I demonstrated that the protection conferred by social immunisation is highly specific, protecting ants only against the same pathogen strain. In addition, depending on the respective context, social immunisation may even cause fitness costs. I further showed that social immunisation crucially affects sanitary behaviour and disease dynamics within ant groups. In the third chapter of this thesis I studied the effects of the ectosymbiotic fungus Laboulbenia formicarum on its host L. neglectus. Although Laboulbeniales are the largest order of insect-parasitic fungi, research concerning host fitness consequence is sparse. I showed that highly Laboulbenia-infected ants sustain fitness costs under resource limitation, however, gain fitness benefits when exposed to an entomopathogenus fungus. These effects are probably cause by a prophylactic upregulation of behavioural as well as physiological immune defences in highly infected ants."}],"doi_confirm":"1","corr_author":"1","year":"2014","department":[{"_id":"SyCr"},{"_id":"GradSch"}],"oa_version":"None","type":"dissertation","degree_awarded":"PhD","title":"Immune defences in ants: Effects of social immunisation and a fungal ectosymbiont in the ant Lasius neglectus","date_updated":"2026-07-29T10:01:24Z","_id":"1395","publication_status":"published","month":"02","date_published":"2014-02-01T00:00:00Z","page":"131","status":"public"},{"year":"2014","acknowledgement":"This work was funded by the DFG and the ERC.","doi_confirm":"1","corr_author":"1","abstract":[{"text":"The co-evolution of hosts and pathogens is characterized by continuous adaptations of both parties. Pathogens of social insects need to adapt towards disease defences at two levels: 1) individual immunity of each colony member consisting of behavioural defence strategies as well as humoral and cellular immune responses and 2) social immunity that is collectively performed by all group members comprising behavioural, physiological and organisational defence strategies.\r\n\r\nTo disentangle the selection pressure on pathogens by the collective versus individual level of disease defence in social insects, we performed an evolution experiment using the Argentine Ant, Linepithema humile, as a host and a mixture of the general insect pathogenic fungus Metarhizium spp. (6 strains) as a pathogen. We allowed pathogen evolution over 10 serial host passages to two different evolution host treatments: (1) only individual host immunity in a single host treatment, and (2) simultaneously acting individual and social immunity in a social host treatment, in which an exposed ant was accompanied by two untreated nestmates.\r\n\r\nBefore starting the pathogen evolution experiment, the 6 Metarhizium spp. strains were characterised concerning conidiospore size killing rates in singly and socially reared ants, their competitiveness under coinfecting conditions and their influence on ant behaviour. We analysed how the ancestral atrain mixture changed in conidiospere size, killing rate and strain composition dependent on host treatment (single or social hosts) during 10 passages and found that killing rate and conidiospere size of the pathogen increased under both evolution regimes, but different depending on host treatment.\r\n\r\nTesting the evolved strain mixtures that evolved under either the single or social host treatment under both single and social current rearing conditions in a full factorial design experiment revealed that the additional collective defences in insect societies add new selection pressure for their coevolving pathogens that compromise their ability to adapt to its host at the group level. To our knowledge, this is the first study directly measuring the influence of social immunity on pathogen evolution.","lang":"eng"}],"OA_place":"publisher","date_created":"2018-12-11T11:51:49Z","day":"01","language":[{"iso":"eng"}],"author":[{"full_name":"Stock, Miriam","id":"42462816-F248-11E8-B48F-1D18A9856A87","last_name":"Stock","first_name":"Miriam"}],"status":"public","page":"101","month":"04","date_published":"2014-04-01T00:00:00Z","_id":"1404","publication_status":"published","date_updated":"2026-07-29T10:05:33Z","degree_awarded":"PhD","title":"Evolution of a fungal pathogen towards individual versus social immunity in ants","type":"dissertation","oa_version":"None","department":[{"_id":"SyCr"},{"_id":"GradSch"}],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","publisher":"Institute of Science and Technology Austria","publist_id":"5803","supervisor":[{"first_name":"Sylvia M","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","last_name":"Cremer","orcid":"0000-0002-2193-3868","full_name":"Cremer, Sylvia M"}],"citation":{"short":"M. Stock, Evolution of a Fungal Pathogen towards Individual versus Social Immunity in Ants, Institute of Science and Technology Austria, 2014.","ista":"Stock M. 2014. Evolution of a fungal pathogen towards individual versus social immunity in ants. Institute of Science and Technology Austria.","ieee":"M. Stock, “Evolution of a fungal pathogen towards individual versus social immunity in ants,” Institute of Science and Technology Austria, 2014.","apa":"Stock, M. (2014). <i>Evolution of a fungal pathogen towards individual versus social immunity in ants</i>. Institute of Science and Technology Austria.","ama":"Stock M. Evolution of a fungal pathogen towards individual versus social immunity in ants. 2014.","mla":"Stock, Miriam. <i>Evolution of a Fungal Pathogen towards Individual versus Social Immunity in Ants</i>. Institute of Science and Technology Austria, 2014.","chicago":"Stock, Miriam. “Evolution of a Fungal Pathogen towards Individual versus Social Immunity in Ants.” Institute of Science and Technology Austria, 2014."},"publication_identifier":{"issn":["2663-337X"]},"alternative_title":["ISTA Thesis"],"article_processing_charge":"No"},{"date_published":"2014-12-01T00:00:00Z","month":"12","status":"public","page":"90","type":"dissertation","oa_version":"None","department":[{"_id":"JiFr"},{"_id":"GradSch"}],"publication_status":"published","_id":"1402","date_updated":"2026-07-29T10:06:44Z","title":"Molecular mechanisms of patterning and subcellular trafficking in Arabidopsis thaliana","degree_awarded":"PhD","OA_place":"publisher","year":"2014","doi_confirm":"1","corr_author":"1","abstract":[{"text":"Phosphatidylinositol (Ptdlns) is a structural phospholipid that can be phosphorylated into various lipid signaling molecules, designated polyphosphoinositides (PPIs). The reversible phosphorylation of PPIs on the 3, 4, or 5 position of inositol is performed by a set of organelle-specific kinases and phosphatases, and the characteristic head groups make these molecules ideal for regulating biological processes in time and space. In yeast and mammals, Ptdlns3P and Ptdlns(3,5)P2 play crucial roles in trafficking toward the lytic compartments, whereas the role in plants is not yet fully understood. Here we identified the role of a land plant-specific subgroup of PPI phosphatases, the suppressor of actin 2 (SAC2) to SAC5, during vauolar trafficking and morphogenesis in Arabidopsis thaliana. SAC2-SAC5 localize to the tonoplast along with Ptdlns3P, the presumable product of their activity. in SAC gain- and loss-of-function mutants, the levels of Ptdlns monophosphates and bisphosphates were changed, with opposite effects on the morphology of storage and lytic vacuoles, and the trafficking toward the vacuoles was defective. Moreover, multiple sac knockout mutants had an increased number of smaller storage and lytic vacuoles, whereas extralarge vacuoles were observed in the overexpression lines, correlating with various growth and developmental defects. The fragmented vacuolar phenotype of sac mutants could be mimicked by treating wild-type seedlings with Ptdlns(3,5)P2, corroborating that this PPI is important for vacuole morphology. Taken together, these results provide evidence that PPIs, together with their metabolic enzymes SAC2-SAC5, are crucial for vacuolar trafficking and for vacuolar morphology and function in plants.","lang":"eng"}],"author":[{"first_name":"Petra","id":"44E59624-F248-11E8-B48F-1D18A9856A87","last_name":"Marhavá","full_name":"Marhavá, Petra"}],"day":"01","date_created":"2018-12-11T11:51:49Z","language":[{"iso":"eng"}],"article_processing_charge":"No","alternative_title":["ISTA Thesis"],"publication_identifier":{"issn":["2663-337X"]},"publist_id":"5805","publisher":"Institute of Science and Technology Austria","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","citation":{"apa":"Marhavá, P. (2014). <i>Molecular mechanisms of patterning and subcellular trafficking in Arabidopsis thaliana</i>. Institute of Science and Technology Austria.","ama":"Marhavá P. Molecular mechanisms of patterning and subcellular trafficking in Arabidopsis thaliana. 2014.","mla":"Marhavá, Petra. <i>Molecular Mechanisms of Patterning and Subcellular Trafficking in Arabidopsis Thaliana</i>. Institute of Science and Technology Austria, 2014.","chicago":"Marhavá, Petra. “Molecular Mechanisms of Patterning and Subcellular Trafficking in Arabidopsis Thaliana.” Institute of Science and Technology Austria, 2014.","short":"P. Marhavá, Molecular Mechanisms of Patterning and Subcellular Trafficking in Arabidopsis Thaliana, Institute of Science and Technology Austria, 2014.","ista":"Marhavá P. 2014. Molecular mechanisms of patterning and subcellular trafficking in Arabidopsis thaliana. Institute of Science and Technology Austria.","ieee":"P. Marhavá, “Molecular mechanisms of patterning and subcellular trafficking in Arabidopsis thaliana,” Institute of Science and Technology Austria, 2014."},"supervisor":[{"full_name":"Friml, Jiří","orcid":"0000-0002-8302-7596","id":"4159519E-F248-11E8-B48F-1D18A9856A87","last_name":"Friml","first_name":"Jiří"}]},{"publist_id":"5804","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","citation":{"short":"M. Behrndt, Forces Driving Epithelial Spreading in Zebrafish Epiboly, Institute of Science and Technology Austria, 2014.","ista":"Behrndt M. 2014. Forces driving epithelial spreading in zebrafish epiboly. Institute of Science and Technology Austria.","ieee":"M. Behrndt, “Forces driving epithelial spreading in zebrafish epiboly,” Institute of Science and Technology Austria, 2014.","mla":"Behrndt, Martin. <i>Forces Driving Epithelial Spreading in Zebrafish Epiboly</i>. Institute of Science and Technology Austria, 2014.","apa":"Behrndt, M. (2014). <i>Forces driving epithelial spreading in zebrafish epiboly</i>. Institute of Science and Technology Austria.","ama":"Behrndt M. Forces driving epithelial spreading in zebrafish epiboly. 2014.","chicago":"Behrndt, Martin. “Forces Driving Epithelial Spreading in Zebrafish Epiboly.” Institute of Science and Technology Austria, 2014."},"article_processing_charge":"No","file":[{"file_id":"21421","content_type":"application/pdf","file_size":24842978,"creator":"cchlebak","checksum":"67df5501b1b5b313c3bf9a360d713693","date_updated":"2026-03-09T14:53:14Z","file_name":"2014 Behrnd final.pdf","access_level":"closed","date_created":"2026-03-09T14:53:14Z","relation":"main_file"}],"OA_place":"publisher","related_material":{"record":[{"status":"public","id":"2282","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","status":"public","id":"2950"},{"id":"3373","status":"public","relation":"part_of_dissertation"}]},"corr_author":"1","doi_confirm":"1","author":[{"first_name":"Martin","id":"3ECECA3A-F248-11E8-B48F-1D18A9856A87","last_name":"Behrndt","full_name":"Behrndt, Martin"}],"file_date_updated":"2026-03-09T14:53:14Z","language":[{"iso":"eng"}],"date_created":"2018-12-11T11:51:49Z","day":"01","acknowledged_ssus":[{"_id":"SSU"}],"ddc":["590"],"date_published":"2014-08-01T00:00:00Z","month":"08","page":"91","status":"public","department":[{"_id":"CaHe"},{"_id":"GradSch"}],"has_accepted_license":"1","type":"dissertation","degree_awarded":"PhD","date_updated":"2026-07-29T10:07:19Z","publisher":"Institute of Science and Technology Austria","supervisor":[{"first_name":"Carl-Philipp J","id":"39427864-F248-11E8-B48F-1D18A9856A87","last_name":"Heisenberg","orcid":"0000-0002-0912-4566","full_name":"Heisenberg, Carl-Philipp J"}],"alternative_title":["ISTA Thesis"],"publication_identifier":{"issn":["2663-337X"]},"abstract":[{"lang":"eng","text":"A variety of developmental and disease related processes depend on epithelial cell sheet spreading. In order to gain insight into the biophysical mechanism(s) underlying the tissue morphogenesis we studied the spreading of an epithelium during the early development of the zebrafish embryo. In zebrafish epiboly the enveloping cell layer (EVL), a simple squamous epithelium, spreads over the yolk cell to completely engulf it at the end of gastrulation. Previous studies have proposed that an actomyosin ring forming within the yolk syncytial layer (YSL) acts as purse string that through constriction along its circumference pulls on the margin of the EVL. Direct biophysical evidence for this hypothesis has however been missing. The aim of the thesis was to understand how the actomyosin ring may generate pulling forces onto the EVL and what cellular mechanism(s) may facilitate the spreading of the epithelium. Using laser ablation to measure cortical tension within the actomyosin ring we found an anisotropic tension distribution, which was highest along the circumference of the ring. However the low degree of anisotropy was incompatible with the actomyosin ring functioning as a purse string only. Additionally, we observed retrograde cortical flow from vegetal parts of the ring into the EVL margin. Interpreting the experimental data using a theoretical distribution that models  the tissues as active viscous gels led us to proposen that the actomyosin ring has a twofold contribution to EVL epiboly. It not only acts as a purse string through constriction along its circumference, but in addition constriction along the width of the ring generates pulling forces through friction-resisted cortical flow. Moreover, when rendering the purse string mechanism unproductive EVL epiboly proceeded normally indicating that the flow-friction mechanism is sufficient to drive the process. Aiming to understand what cellular mechanism(s) may facilitate the spreading of the epithelium we found that tension-oriented EVL cell divisions limit tissue anisotropy by releasing tension along the division axis and promote epithelial spreading. Notably, EVL cells undergo ectopic cell fusion in conditions in which oriented-cell division is impaired or the epithelium is mechanically challenged. Taken together our study of EVL epiboly suggests a novel mechanism of force generation for actomyosin rings through friction-resisted cortical flow and highlights the importance of tension-oriented cell divisions in epithelial morphogenesis."}],"year":"2014","oa_version":"None","title":"Forces driving epithelial spreading in zebrafish epiboly","_id":"1403","publication_status":"published"},{"publisher":"Springer","project":[{"grant_number":"318493","call_identifier":"FP7","name":"Topological Complex Systems","_id":"255D761E-B435-11E9-9278-68D0E5697425"}],"publication_identifier":{"issn":["0924-9907"]},"external_id":{"isi":["000339823000012"]},"year":"2014","abstract":[{"lang":"eng","text":"Motivated by applications in biology, we present an algorithm for estimating the length of tube-like shapes in 3-dimensional Euclidean space. In a first step, we combine the tube formula of Weyl with integral geometric methods to obtain an integral representation of the length, which we approximate using a variant of the Koksma-Hlawka Theorem. In a second step, we use tools from computational topology to decrease the dependence on small perturbations of the shape. We present computational experiments that shed light on the stability and the convergence rate of our algorithm."}],"pubrep_id":"549","publication_status":"published","_id":"2255","title":"Stable length estimates of tube-like shapes","oa_version":"Submitted Version","intvolume":"        50","ec_funded":1,"oa":1,"quality_controlled":"1","citation":{"ista":"Edelsbrunner H, Pausinger F. 2014. Stable length estimates of tube-like shapes. Journal of Mathematical Imaging and Vision. 50(1), 164–177.","short":"H. Edelsbrunner, F. Pausinger, Journal of Mathematical Imaging and Vision 50 (2014) 164–177.","ieee":"H. Edelsbrunner and F. Pausinger, “Stable length estimates of tube-like shapes,” <i>Journal of Mathematical Imaging and Vision</i>, vol. 50, no. 1. Springer, pp. 164–177, 2014.","ama":"Edelsbrunner H, Pausinger F. Stable length estimates of tube-like shapes. <i>Journal of Mathematical Imaging and Vision</i>. 2014;50(1):164-177. doi:<a href=\"https://doi.org/10.1007/s10851-013-0468-x\">10.1007/s10851-013-0468-x</a>","apa":"Edelsbrunner, H., &#38; Pausinger, F. (2014). Stable length estimates of tube-like shapes. <i>Journal of Mathematical Imaging and Vision</i>. Springer. <a href=\"https://doi.org/10.1007/s10851-013-0468-x\">https://doi.org/10.1007/s10851-013-0468-x</a>","mla":"Edelsbrunner, Herbert, and Florian Pausinger. “Stable Length Estimates of Tube-like Shapes.” <i>Journal of Mathematical Imaging and Vision</i>, vol. 50, no. 1, Springer, 2014, pp. 164–77, doi:<a href=\"https://doi.org/10.1007/s10851-013-0468-x\">10.1007/s10851-013-0468-x</a>.","chicago":"Edelsbrunner, Herbert, and Florian Pausinger. “Stable Length Estimates of Tube-like Shapes.” <i>Journal of Mathematical Imaging and Vision</i>. Springer, 2014. <a href=\"https://doi.org/10.1007/s10851-013-0468-x\">https://doi.org/10.1007/s10851-013-0468-x</a>."},"volume":50,"doi":"10.1007/s10851-013-0468-x","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","publist_id":"4691","scopus_import":"1","isi":1,"file":[{"file_size":3941391,"content_type":"application/pdf","file_id":"5204","date_updated":"2020-07-14T12:45:35Z","creator":"system","checksum":"2f93f3e63a38a85cd4404d7953913b14","file_name":"IST-2016-549-v1+1_2014-J-06-LengthEstimate.pdf","relation":"main_file","date_created":"2018-12-12T10:16:18Z","access_level":"open_access"}],"article_processing_charge":"No","language":[{"iso":"eng"}],"day":"01","date_created":"2018-12-11T11:56:36Z","file_date_updated":"2020-07-14T12:45:35Z","author":[{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","first_name":"Herbert","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833"},{"orcid":"0000-0002-8379-3768","full_name":"Pausinger, Florian","first_name":"Florian","id":"2A77D7A2-F248-11E8-B48F-1D18A9856A87","last_name":"Pausinger"}],"corr_author":"1","related_material":{"record":[{"id":"2843","status":"public","relation":"earlier_version"},{"relation":"dissertation_contains","status":"public","id":"1399"}]},"date_updated":"2026-07-29T10:08:33Z","issue":"1","type":"journal_article","department":[{"_id":"HeEd"}],"has_accepted_license":"1","status":"public","page":"164 - 177","month":"09","date_published":"2014-09-01T00:00:00Z","ddc":["000"],"publication":"Journal of Mathematical Imaging and Vision"},{"publisher":"ACM","oa_version":"Submitted Version","title":"Eliminating Tverberg points, I. An analogue of the Whitney trick","_id":"2159","publication_status":"published","oa":1,"conference":{"end_date":"2014-06-11","name":"SoCG: Symposium on Computational Geometry","location":"Kyoto, Japan","start_date":"2014-06-08"},"pubrep_id":"534","abstract":[{"lang":"eng","text":"Motivated by topological Tverberg-type problems, we consider multiple (double, triple, and higher multiplicity) selfintersection points of maps from finite simplicial complexes (compact polyhedra) into ℝd and study conditions under which such multiple points can be eliminated. The most classical case is that of embeddings (i.e., maps without double points) of a κ-dimensional complex K into ℝ2κ. For this problem, the work of van Kampen, Shapiro, and Wu provides an efficiently testable necessary condition for embeddability (namely, vanishing of the van Kampen ob-struction). For κ ≥ 3, the condition is also sufficient, and yields a polynomial-time algorithm for deciding embeddability: One starts with an arbitrary map f : K→ℝ2κ, which generically has finitely many double points; if k ≥ 3 and if the obstruction vanishes then one can successively remove these double points by local modifications of the map f. One of the main tools is the famous Whitney trick that permits eliminating pairs of double points of opposite intersection sign. We are interested in generalizing this approach to intersection points of higher multiplicity. We call a point y 2 ℝd an r-fold Tverberg point of a map f : Kκ →ℝd if y lies in the intersection f(σ1)∩. ∩f(σr) of the images of r pairwise disjoint simplices of K. The analogue of (non-)embeddability that we study is the problem Tverbergκ r→d: Given a κ-dimensional complex K, does it satisfy a Tverberg-type theorem with parameters r and d, i.e., does every map f : K κ → ℝd have an r-fold Tverberg point? Here, we show that for fixed r, κ and d of the form d = rm and k = (r-1)m, m ≥ 3, there is a polynomial-time algorithm for deciding this (based on the vanishing of a cohomological obstruction, as in the case of embeddings). Our main tool is an r-fold analogue of the Whitney trick: Given r pairwise disjoint simplices of K such that the intersection of their images contains two r-fold Tverberg points y+ and y- of opposite intersection sign, we can eliminate y+ and y- by a local isotopy of f. In a subsequent paper, we plan to develop this further and present a generalization of the classical Haeiger-Weber Theorem (which yields a necessary and sufficient condition for embeddability of κ-complexes into ℝd for a wider range of dimensions) to intersection points of higher multiplicity."}],"year":"2014","scopus_import":1,"file":[{"file_size":914396,"content_type":"application/pdf","file_id":"4735","date_updated":"2020-07-14T12:45:30Z","checksum":"2aae223fee8ffeaf57bbabd8d92b6a2c","creator":"system","file_name":"IST-2016-534-v1+1_Eliminating_Tverberg_points_I._An_analogue_of_the_Whitney_trick.pdf","access_level":"open_access","date_created":"2018-12-12T10:09:12Z","relation":"main_file"}],"quality_controlled":"1","citation":{"chicago":"Mabillard, Isaac, and Uli Wagner. “Eliminating Tverberg Points, I. An Analogue of the Whitney Trick.” In <i>Proceedings of the Annual Symposium on Computational Geometry</i>, 171–80. ACM, 2014. <a href=\"https://doi.org/10.1145/2582112.2582134\">https://doi.org/10.1145/2582112.2582134</a>.","mla":"Mabillard, Isaac, and Uli Wagner. “Eliminating Tverberg Points, I. An Analogue of the Whitney Trick.” <i>Proceedings of the Annual Symposium on Computational Geometry</i>, ACM, 2014, pp. 171–80, doi:<a href=\"https://doi.org/10.1145/2582112.2582134\">10.1145/2582112.2582134</a>.","ama":"Mabillard I, Wagner U. Eliminating Tverberg points, I. An analogue of the Whitney trick. In: <i>Proceedings of the Annual Symposium on Computational Geometry</i>. ACM; 2014:171-180. doi:<a href=\"https://doi.org/10.1145/2582112.2582134\">10.1145/2582112.2582134</a>","apa":"Mabillard, I., &#38; Wagner, U. (2014). Eliminating Tverberg points, I. An analogue of the Whitney trick. In <i>Proceedings of the Annual Symposium on Computational Geometry</i> (pp. 171–180). Kyoto, Japan: ACM. <a href=\"https://doi.org/10.1145/2582112.2582134\">https://doi.org/10.1145/2582112.2582134</a>","ieee":"I. Mabillard and U. Wagner, “Eliminating Tverberg points, I. An analogue of the Whitney trick,” in <i>Proceedings of the Annual Symposium on Computational Geometry</i>, Kyoto, Japan, 2014, pp. 171–180.","ista":"Mabillard I, Wagner U. 2014. Eliminating Tverberg points, I. An analogue of the Whitney trick. Proceedings of the Annual Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, 171–180.","short":"I. Mabillard, U. Wagner, in:, Proceedings of the Annual Symposium on Computational Geometry, ACM, 2014, pp. 171–180."},"publist_id":"4847","doi":"10.1145/2582112.2582134","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","has_accepted_license":"1","department":[{"_id":"UlWa"}],"type":"conference","date_updated":"2026-07-29T11:26:06Z","publication":"Proceedings of the Annual Symposium on Computational Geometry","month":"06","date_published":"2014-06-08T00:00:00Z","ddc":["510"],"page":"171 - 180","status":"public","author":[{"last_name":"Mabillard","id":"32BF9DAA-F248-11E8-B48F-1D18A9856A87","first_name":"Isaac","full_name":"Mabillard, Isaac"},{"id":"36690CA2-F248-11E8-B48F-1D18A9856A87","last_name":"Wagner","first_name":"Uli","full_name":"Wagner, Uli","orcid":"0000-0002-1494-0568"}],"file_date_updated":"2020-07-14T12:45:30Z","date_created":"2018-12-11T11:56:03Z","language":[{"iso":"eng"}],"day":"08","related_material":{"record":[{"status":"public","id":"1123","relation":"dissertation_contains"}]},"acknowledgement":"Swiss National Science Foundation (Project SNSF-PP00P2-138948)","corr_author":"1"},{"ddc":["570"],"month":"11","date_published":"2014-11-27T00:00:00Z","publication":"Ecology and Evolution","status":"public","page":"4589 - 4597","issue":"24","type":"journal_article","has_accepted_license":"1","department":[{"_id":"NiBa"}],"date_updated":"2026-07-29T11:27:43Z","related_material":{"record":[{"status":"public","id":"1125","relation":"dissertation_contains"}]},"corr_author":"1","author":[{"full_name":"Novak, Sebastian","orcid":"0000-0002-2519-824X","last_name":"Novak","id":"461468AE-F248-11E8-B48F-1D18A9856A87","first_name":"Sebastian"}],"language":[{"iso":"eng"}],"day":"27","date_created":"2018-12-11T11:55:16Z","file_date_updated":"2020-07-14T12:45:25Z","file":[{"date_updated":"2020-07-14T12:45:25Z","checksum":"9ab43db1b0fede7bfe560ed77e177b76","creator":"system","content_type":"application/pdf","file_size":118813,"file_id":"4946","date_created":"2018-12-12T10:12:28Z","access_level":"open_access","relation":"main_file","file_name":"IST-2016-462-v1+1_Novak-2014-Ecology_and_Evolution.pdf"}],"article_processing_charge":"No","isi":1,"scopus_import":"1","publist_id":"5049","doi":"10.1002/ece3.1289","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","quality_controlled":"1","citation":{"mla":"Novak, Sebastian. “Habitat Heterogeneities versus Spatial Type Frequency Variances as Driving Forces of Dispersal Evolution.” <i>Ecology and Evolution</i>, vol. 4, no. 24, Wiley-Blackwell, 2014, pp. 4589–97, doi:<a href=\"https://doi.org/10.1002/ece3.1289\">10.1002/ece3.1289</a>.","ama":"Novak S. Habitat heterogeneities versus spatial type frequency variances as driving forces of dispersal evolution. <i>Ecology and Evolution</i>. 2014;4(24):4589-4597. doi:<a href=\"https://doi.org/10.1002/ece3.1289\">10.1002/ece3.1289</a>","apa":"Novak, S. (2014). Habitat heterogeneities versus spatial type frequency variances as driving forces of dispersal evolution. <i>Ecology and Evolution</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1002/ece3.1289\">https://doi.org/10.1002/ece3.1289</a>","chicago":"Novak, Sebastian. “Habitat Heterogeneities versus Spatial Type Frequency Variances as Driving Forces of Dispersal Evolution.” <i>Ecology and Evolution</i>. Wiley-Blackwell, 2014. <a href=\"https://doi.org/10.1002/ece3.1289\">https://doi.org/10.1002/ece3.1289</a>.","short":"S. Novak, Ecology and Evolution 4 (2014) 4589–4597.","ista":"Novak S. 2014. Habitat heterogeneities versus spatial type frequency variances as driving forces of dispersal evolution. Ecology and Evolution. 4(24), 4589–4597.","ieee":"S. Novak, “Habitat heterogeneities versus spatial type frequency variances as driving forces of dispersal evolution,” <i>Ecology and Evolution</i>, vol. 4, no. 24. Wiley-Blackwell, pp. 4589–4597, 2014."},"volume":4,"intvolume":"         4","oa":1,"ec_funded":1,"oa_version":"Published Version","_id":"2023","publication_status":"published","title":"Habitat heterogeneities versus spatial type frequency variances as driving forces of dispersal evolution","pubrep_id":"462","year":"2014","abstract":[{"text":"Understanding the evolution of dispersal is essential for understanding and predicting the dynamics of natural populations. Two main factors are known to influence dispersal evolution: spatio-temporal variation in the environment and relatedness between individuals. However, the relation between these factors is still poorly understood, and they are usually treated separately. In this article, I present a theoretical framework that contains and connects effects of both environmental variation and relatedness, and reproduces and extends their known features. Spatial habitat variation selects for balanced dispersal strategies, whereby the population is kept at an ideal free distribution. Within this class of dispersal strategies, I explain how increased dispersal is promoted by perturbations to the dispersal type frequencies. An explicit formula shows the magnitude of the selective advantage of increased dispersal in terms of the spatial variability in the frequencies of the different dispersal strategies present. These variances are capable of capturing various sources of stochasticity and hence establish a common scale for their effects on the evolution of dispersal. The results furthermore indicate an alternative approach to identifying effects of relatedness on dispersal evolution.","lang":"eng"}],"external_id":{"isi":["000346736200003"]},"license":"https://creativecommons.org/licenses/by/4.0/","project":[{"call_identifier":"FP7","grant_number":"250152","_id":"25B07788-B435-11E9-9278-68D0E5697425","name":"Limits to selection in biology and in evolutionary computation"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"publisher":"Wiley-Blackwell"},{"article_processing_charge":"No","isi":1,"scopus_import":"1","publist_id":"5019","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.1098/rspb.2014.1679","volume":281,"quality_controlled":"1","citation":{"ieee":"M. Lagator, N. Colegrave, and P. Neve, “Selection history and epistatic interactions impact dynamics of adaptation to novel environmental stresses,” <i>Proceedings of the Royal Society of London Series B Biological Sciences</i>, vol. 281, no. 1794. Royal Society, 2014.","ista":"Lagator M, Colegrave N, Neve P. 2014. Selection history and epistatic interactions impact dynamics of adaptation to novel environmental stresses. Proceedings of the Royal Society of London Series B Biological Sciences. 281(1794), 20141679.","short":"M. Lagator, N. Colegrave, P. Neve, Proceedings of the Royal Society of London Series B Biological Sciences 281 (2014).","chicago":"Lagator, Mato, Nick Colegrave, and Paul Neve. “Selection History and Epistatic Interactions Impact Dynamics of Adaptation to Novel Environmental Stresses.” <i>Proceedings of the Royal Society of London Series B Biological Sciences</i>. Royal Society, 2014. <a href=\"https://doi.org/10.1098/rspb.2014.1679\">https://doi.org/10.1098/rspb.2014.1679</a>.","mla":"Lagator, Mato, et al. “Selection History and Epistatic Interactions Impact Dynamics of Adaptation to Novel Environmental Stresses.” <i>Proceedings of the Royal Society of London Series B Biological Sciences</i>, vol. 281, no. 1794, 20141679, Royal Society, 2014, doi:<a href=\"https://doi.org/10.1098/rspb.2014.1679\">10.1098/rspb.2014.1679</a>.","ama":"Lagator M, Colegrave N, Neve P. Selection history and epistatic interactions impact dynamics of adaptation to novel environmental stresses. <i>Proceedings of the Royal Society of London Series B Biological Sciences</i>. 2014;281(1794). doi:<a href=\"https://doi.org/10.1098/rspb.2014.1679\">10.1098/rspb.2014.1679</a>","apa":"Lagator, M., Colegrave, N., &#38; Neve, P. (2014). Selection history and epistatic interactions impact dynamics of adaptation to novel environmental stresses. <i>Proceedings of the Royal Society of London Series B Biological Sciences</i>. Royal Society. <a href=\"https://doi.org/10.1098/rspb.2014.1679\">https://doi.org/10.1098/rspb.2014.1679</a>"},"publication":"Proceedings of the Royal Society of London Series B Biological Sciences","month":"09","date_published":"2014-09-17T00:00:00Z","status":"public","department":[{"_id":"CaGu"}],"issue":"1794","type":"journal_article","date_updated":"2026-08-12T06:26:10Z","related_material":{"record":[{"relation":"research_data","id":"9741","status":"public"}]},"acknowledgement":"The project was supported by Leverhulme Trust.","author":[{"full_name":"Lagator, Mato","first_name":"Mato","last_name":"Lagator","id":"345D25EC-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Colegrave","first_name":"Nick","full_name":"Colegrave, Nick"},{"first_name":"Paul","last_name":"Neve","full_name":"Neve, Paul"}],"language":[{"iso":"eng"}],"day":"17","date_created":"2018-12-11T11:55:21Z","external_id":{"isi":["000341922700009"]},"publisher":"Royal Society","article_number":"20141679","oa":1,"intvolume":"       281","oa_version":"Submitted Version","title":"Selection history and epistatic interactions impact dynamics of adaptation to novel environmental stresses","publication_status":"published","_id":"2036","main_file_link":[{"url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC4211454/","open_access":"1"}],"abstract":[{"text":" In rapidly changing environments, selection history may impact the dynamics of adaptation. Mutations selected in one environment may result in pleiotropic fitness trade-offs in subsequent novel environments, slowing the rates of adaptation. Epistatic interactions between mutations selected in sequential stressful environments may slow or accelerate subsequent rates of adaptation, depending on the nature of that interaction. We explored the dynamics of adaptation during sequential exposure to herbicides with different modes of action in Chlamydomonas reinhardtii. Evolution of resistance to two of the herbicides was largely independent of selection history. For carbetamide, previous adaptation to other herbicide modes of action positively impacted the likelihood of adaptation to this herbicide. Furthermore, while adaptation to all individual herbicides was associated with pleiotropic fitness costs in stress-free environments, we observed that accumulation of resistance mechanisms was accompanied by a reduction in overall fitness costs. We suggest that antagonistic epistasis may be a driving mechanism that enables populations to more readily adapt in novel environments. These findings highlight the potential for sequences of xenobiotics to facilitate the rapid evolution of multiple-drug and -pesticide resistance, as well as the potential for epistatic interactions between adaptive mutations to facilitate evolutionary rescue in rapidly changing environments. ","lang":"eng"}],"year":"2014"},{"article_processing_charge":"No","citation":{"short":"M. Lagator, N. Colegrave, P. Neve, (2014).","ista":"Lagator M, Colegrave N, Neve P. 2014. Data from: Selection history and epistatic interactions impact dynamics of adaptation to novel environmental stresses, Dryad, <a href=\"https://doi.org/10.5061/dryad.85dn7\">10.5061/dryad.85dn7</a>.","ieee":"M. Lagator, N. Colegrave, and P. Neve, “Data from: Selection history and epistatic interactions impact dynamics of adaptation to novel environmental stresses.” Dryad, 2014.","apa":"Lagator, M., Colegrave, N., &#38; Neve, P. (2014). Data from: Selection history and epistatic interactions impact dynamics of adaptation to novel environmental stresses. Dryad. <a href=\"https://doi.org/10.5061/dryad.85dn7\">https://doi.org/10.5061/dryad.85dn7</a>","ama":"Lagator M, Colegrave N, Neve P. Data from: Selection history and epistatic interactions impact dynamics of adaptation to novel environmental stresses. 2014. doi:<a href=\"https://doi.org/10.5061/dryad.85dn7\">10.5061/dryad.85dn7</a>","mla":"Lagator, Mato, et al. <i>Data from: Selection History and Epistatic Interactions Impact Dynamics of Adaptation to Novel Environmental Stresses</i>. Dryad, 2014, doi:<a href=\"https://doi.org/10.5061/dryad.85dn7\">10.5061/dryad.85dn7</a>.","chicago":"Lagator, Mato, Nick Colegrave, and Paul Neve. “Data from: Selection History and Epistatic Interactions Impact Dynamics of Adaptation to Novel Environmental Stresses.” Dryad, 2014. <a href=\"https://doi.org/10.5061/dryad.85dn7\">https://doi.org/10.5061/dryad.85dn7</a>."},"publisher":"Dryad","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","doi":"10.5061/dryad.85dn7","type":"research_data_reference","department":[{"_id":"CaGu"}],"oa_version":"Published Version","_id":"9741","date_updated":"2026-08-12T06:26:09Z","title":"Data from: Selection history and epistatic interactions impact dynamics of adaptation to novel environmental stresses","date_published":"2014-08-21T00:00:00Z","month":"08","oa":1,"status":"public","author":[{"first_name":"Mato","last_name":"Lagator","id":"345D25EC-F248-11E8-B48F-1D18A9856A87","full_name":"Lagator, Mato"},{"last_name":"Colegrave","first_name":"Nick","full_name":"Colegrave, Nick"},{"last_name":"Neve","first_name":"Paul","full_name":"Neve, Paul"}],"date_created":"2021-07-28T08:48:06Z","day":"21","main_file_link":[{"open_access":"1","url":"https://doi.org/10.5061/dryad.85dn7"}],"related_material":{"record":[{"status":"public","id":"2036","relation":"used_in_publication"}]},"year":"2014","abstract":[{"text":"In rapidly changing environments, selection history may impact the dynamics of adaptation. Mutations selected in one environment may result in pleiotropic fitness trade-offs in subsequent novel environments, slowing the rates of adaptation. Epistatic interactions between mutations selected in sequential stressful environments may slow or accelerate subsequent rates of adaptation, depending on the nature of that interaction. We explored the dynamics of adaptation during sequential exposure to herbicides with different modes of action in Chlamydomonas reinhardtii. Evolution of resistance to two of the herbicides was largely independent of selection history. For carbetamide, previous adaptation to other herbicide modes of action positively impacted the likelihood of adaptation to this herbicide. Furthermore, while adaptation to all individual herbicides was associated with pleiotropic fitness costs in stress-free environments, we observed that accumulation of resistance mechanisms was accompanied by a reduction in overall fitness costs. We suggest that antagonistic epistasis may be a driving mechanism that enables populations to more readily adapt in novel environments. These findings highlight the potential for sequences of xenobiotics to facilitate the rapid evolution of multiple-drug and -pesticide resistance, as well as the potential for epistatic interactions between adaptive mutations to facilitate evolutionary rescue in rapidly changing environments.","lang":"eng"}]},{"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)","short":"CC BY (3.0)","image":"/images/cc_by.png"},"license":"https://creativecommons.org/licenses/by/3.0/","publication_identifier":{"issn":["0962-8436"]},"external_id":{"isi":["000332465300014"],"pmid":["24366138"]},"article_number":"20120528","publisher":"Royal Society","title":"Sharp wave/ripple network oscillations and learning-associated hippocampal maps","_id":"2251","publication_status":"published","oa_version":"Published Version","pmid":1,"oa":1,"intvolume":"       369","abstract":[{"text":"Sharp wave/ripple (SWR, 150–250 Hz) hippocampal events have long been postulated to be involved in memory consolidation. However, more recent work has investigated SWRs that occur during active waking behaviour: findings that suggest that SWRs may also play a role in cell assembly strengthening or spatial working memory. Do such theories of SWR function apply to animal learning? This review discusses how general theories linking SWRs to memory-related function may explain circuit mechanisms related to rodent spatial learning and to the associated stabilization of new cognitive maps.","lang":"eng"}],"year":"2014","das_tickbox":"1","pubrep_id":"527","scopus_import":"1","isi":1,"article_processing_charge":"No","file":[{"relation":"main_file","date_created":"2018-12-12T10:13:24Z","access_level":"open_access","file_name":"IST-2016-527-v1+1_20120528.full.pdf","creator":"system","checksum":"51beb33de71c9c19e0c205a20d206f9a","date_updated":"2020-07-14T12:45:34Z","file_id":"5006","file_size":771896,"content_type":"application/pdf"}],"volume":369,"citation":{"apa":"Csicsvari, J. L., &#38; Dupret, D. (2014). Sharp wave/ripple network oscillations and learning-associated hippocampal maps. <i>Philosophical Transactions of the Royal Society of London. Series B, Biological Sciences</i>. Royal Society. <a href=\"https://doi.org/10.1098/rstb.2012.0528\">https://doi.org/10.1098/rstb.2012.0528</a>","ama":"Csicsvari JL, Dupret D. Sharp wave/ripple network oscillations and learning-associated hippocampal maps. <i>Philosophical Transactions of the Royal Society of London Series B, Biological Sciences</i>. 2014;369(1635). doi:<a href=\"https://doi.org/10.1098/rstb.2012.0528\">10.1098/rstb.2012.0528</a>","mla":"Csicsvari, Jozsef L., and David Dupret. “Sharp Wave/Ripple Network Oscillations and Learning-Associated Hippocampal Maps.” <i>Philosophical Transactions of the Royal Society of London. Series B, Biological Sciences</i>, vol. 369, no. 1635, 20120528, Royal Society, 2014, doi:<a href=\"https://doi.org/10.1098/rstb.2012.0528\">10.1098/rstb.2012.0528</a>.","chicago":"Csicsvari, Jozsef L, and David Dupret. “Sharp Wave/Ripple Network Oscillations and Learning-Associated Hippocampal Maps.” <i>Philosophical Transactions of the Royal Society of London. Series B, Biological Sciences</i>. Royal Society, 2014. <a href=\"https://doi.org/10.1098/rstb.2012.0528\">https://doi.org/10.1098/rstb.2012.0528</a>.","short":"J.L. Csicsvari, D. Dupret, Philosophical Transactions of the Royal Society of London. Series B, Biological Sciences 369 (2014).","ista":"Csicsvari JL, Dupret D. 2014. Sharp wave/ripple network oscillations and learning-associated hippocampal maps. Philosophical Transactions of the Royal Society of London. Series B, Biological Sciences. 369(1635), 20120528.","ieee":"J. L. Csicsvari and D. Dupret, “Sharp wave/ripple network oscillations and learning-associated hippocampal maps,” <i>Philosophical Transactions of the Royal Society of London. Series B, Biological Sciences</i>, vol. 369, no. 1635. Royal Society, 2014."},"quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.1098/rstb.2012.0528","publist_id":"4697","date_updated":"2026-08-12T06:27:15Z","has_accepted_license":"1","department":[{"_id":"JoCs"}],"issue":"1635","type":"journal_article","status":"public","publication":"Philosophical Transactions of the Royal Society of London. Series B, Biological Sciences","ddc":["570"],"date_published":"2014-02-05T00:00:00Z","month":"02","file_date_updated":"2020-07-14T12:45:34Z","language":[{"iso":"eng"}],"day":"05","date_created":"2018-12-11T11:56:34Z","author":[{"orcid":"0000-0002-5193-4036","full_name":"Csicsvari, Jozsef L","first_name":"Jozsef L","last_name":"Csicsvari","id":"3FA14672-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Dupret, David","first_name":"David","last_name":"Dupret"}],"corr_author":"1"},{"scopus_import":"1","article_processing_charge":"No","file":[{"content_type":"application/pdf","file_size":269171,"file_id":"5172","date_updated":"2020-07-14T12:45:17Z","checksum":"ed0efc93c10f1341155f0316af617b82","creator":"system","file_name":"IST-2016-532-v1+1_J._Mathematical_Phys._2014_Seiringer.pdf","access_level":"open_access","date_created":"2018-12-12T10:15:49Z","relation":"main_file"}],"isi":1,"volume":55,"quality_controlled":"1","citation":{"chicago":"Seiringer, Robert. “Bose Gases, Bose-Einstein Condensation, and the Bogoliubov Approximation.” <i>Journal of Mathematical Physics</i>. AIP Publishing, 2014. <a href=\"https://doi.org/10.1063/1.4881536\">https://doi.org/10.1063/1.4881536</a>.","mla":"Seiringer, Robert. “Bose Gases, Bose-Einstein Condensation, and the Bogoliubov Approximation.” <i>Journal of Mathematical Physics</i>, vol. 55, no. 7, 1.4881536, AIP Publishing, 2014, doi:<a href=\"https://doi.org/10.1063/1.4881536\">10.1063/1.4881536</a>.","apa":"Seiringer, R. (2014). Bose gases, Bose-Einstein condensation, and the Bogoliubov approximation. <i>Journal of Mathematical Physics</i>. AIP Publishing. <a href=\"https://doi.org/10.1063/1.4881536\">https://doi.org/10.1063/1.4881536</a>","ama":"Seiringer R. Bose gases, Bose-Einstein condensation, and the Bogoliubov approximation. <i>Journal of Mathematical Physics</i>. 2014;55(7). doi:<a href=\"https://doi.org/10.1063/1.4881536\">10.1063/1.4881536</a>","ieee":"R. Seiringer, “Bose gases, Bose-Einstein condensation, and the Bogoliubov approximation,” <i>Journal of Mathematical Physics</i>, vol. 55, no. 7. AIP Publishing, 2014.","short":"R. Seiringer, Journal of Mathematical Physics 55 (2014).","ista":"Seiringer R. 2014. Bose gases, Bose-Einstein condensation, and the Bogoliubov approximation. Journal of Mathematical Physics. 55(7), 1.4881536."},"publist_id":"5285","doi":"10.1063/1.4881536","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"RoSe"}],"has_accepted_license":"1","type":"journal_article","issue":"7","date_updated":"2026-08-12T13:58:01Z","publication":"Journal of Mathematical Physics","ddc":["510","530"],"date_published":"2014-06-26T00:00:00Z","month":"06","status":"public","author":[{"first_name":"Robert","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","last_name":"Seiringer","orcid":"0000-0002-6781-0521","full_name":"Seiringer, Robert"}],"file_date_updated":"2020-07-14T12:45:17Z","language":[{"iso":"eng"}],"date_created":"2018-12-11T11:54:11Z","day":"26","corr_author":"1","project":[{"name":"NSERC Postdoctoral fellowship","_id":"26450934-B435-11E9-9278-68D0E5697425"}],"external_id":{"isi":["000341174600010"]},"article_number":"1.4881536","publisher":"AIP Publishing","oa_version":"Submitted Version","title":"Bose gases, Bose-Einstein condensation, and the Bogoliubov approximation","_id":"1821","publication_status":"published","oa":1,"intvolume":"        55","pubrep_id":"532","abstract":[{"lang":"eng","text":"We review recent progress towards a rigorous understanding of the Bogoliubov approximation for bosonic quantum many-body systems. We focus, in particular, on the excitation spectrum of a Bose gas in the mean-field (Hartree) limit. A list of open problems will be discussed at the end."}],"year":"2014"},{"year":"2014","language":[{"iso":"eng"}],"date_created":"2018-12-11T11:54:12Z","day":"01","author":[{"last_name":"Jakšić","first_name":"Vojkan","full_name":"Jakšić, Vojkan"},{"first_name":"Claude","last_name":"Pillet","full_name":"Pillet, Claude"},{"full_name":"Seiringer, Robert","orcid":"0000-0002-6781-0521","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","last_name":"Seiringer","first_name":"Robert"}],"status":"public","publication":"Journal of Mathematical Physics","date_published":"2014-07-01T00:00:00Z","intvolume":"        55","month":"07","title":"Introduction","publication_status":"published","_id":"1822","date_updated":"2026-08-12T13:58:20Z","oa_version":"None","department":[{"_id":"RoSe"}],"type":"journal_article","issue":"7","publisher":"AIP Publishing","doi":"10.1063/1.4884877","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"5284","volume":55,"article_number":"075101","quality_controlled":"1","citation":{"ista":"Jakšić V, Pillet C, Seiringer R. 2014. Introduction. Journal of Mathematical Physics. 55(7), 075101.","short":"V. Jakšić, C. Pillet, R. Seiringer, Journal of Mathematical Physics 55 (2014).","ieee":"V. Jakšić, C. Pillet, and R. Seiringer, “Introduction,” <i>Journal of Mathematical Physics</i>, vol. 55, no. 7. AIP Publishing, 2014.","mla":"Jakšić, Vojkan, et al. “Introduction.” <i>Journal of Mathematical Physics</i>, vol. 55, no. 7, 075101, AIP Publishing, 2014, doi:<a href=\"https://doi.org/10.1063/1.4884877\">10.1063/1.4884877</a>.","apa":"Jakšić, V., Pillet, C., &#38; Seiringer, R. (2014). Introduction. <i>Journal of Mathematical Physics</i>. AIP Publishing. <a href=\"https://doi.org/10.1063/1.4884877\">https://doi.org/10.1063/1.4884877</a>","ama":"Jakšić V, Pillet C, Seiringer R. Introduction. <i>Journal of Mathematical Physics</i>. 2014;55(7). doi:<a href=\"https://doi.org/10.1063/1.4884877\">10.1063/1.4884877</a>","chicago":"Jakšić, Vojkan, Claude Pillet, and Robert Seiringer. “Introduction.” <i>Journal of Mathematical Physics</i>. AIP Publishing, 2014. <a href=\"https://doi.org/10.1063/1.4884877\">https://doi.org/10.1063/1.4884877</a>."},"isi":1,"article_processing_charge":"No","external_id":{"isi":["000341174600001"]},"scopus_import":"1"},{"acknowledgement":"The work was supported by the VEGA Grant No. 1/0459/13 (R.K. and K.B.).","day":"04","date_created":"2018-12-11T11:54:35Z","language":[{"iso":"eng"}],"author":[{"full_name":"Kollár, Richard","first_name":"Richard","last_name":"Kollár"},{"first_name":"Katarína","last_name":"Bod'ová","id":"2BA24EA0-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-7214-0171","full_name":"Bod'ová, Katarína"},{"full_name":"Nosek, Jozef","first_name":"Jozef","last_name":"Nosek"},{"first_name":"Ľubomír","last_name":"Tomáška","full_name":"Tomáška, Ľubomír"}],"status":"public","publication":"Physical Review E","date_published":"2014-03-04T00:00:00Z","month":"03","date_updated":"2026-08-12T14:27:46Z","department":[{"_id":"NiBa"},{"_id":"GaTk"}],"issue":"3","type":"journal_article","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.1103/PhysRevE.89.032701","publist_id":"5198","volume":89,"citation":{"mla":"Kollár, Richard, et al. “Mathematical Model of Alternative Mechanism of Telomere Length Maintenance.” <i>Physical Review E</i>, vol. 89, no. 3, 032701, American Physical Society, 2014, doi:<a href=\"https://doi.org/10.1103/PhysRevE.89.032701\">10.1103/PhysRevE.89.032701</a>.","apa":"Kollár, R., Bodova, K., Nosek, J., &#38; Tomáška, Ľ. (2014). Mathematical model of alternative mechanism of telomere length maintenance. <i>Physical Review E</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevE.89.032701\">https://doi.org/10.1103/PhysRevE.89.032701</a>","ama":"Kollár R, Bodova K, Nosek J, Tomáška Ľ. Mathematical model of alternative mechanism of telomere length maintenance. <i>Physical Review E</i>. 2014;89(3). doi:<a href=\"https://doi.org/10.1103/PhysRevE.89.032701\">10.1103/PhysRevE.89.032701</a>","chicago":"Kollár, Richard, Katarina Bodova, Jozef Nosek, and Ľubomír Tomáška. “Mathematical Model of Alternative Mechanism of Telomere Length Maintenance.” <i>Physical Review E</i>. American Physical Society, 2014. <a href=\"https://doi.org/10.1103/PhysRevE.89.032701\">https://doi.org/10.1103/PhysRevE.89.032701</a>.","ista":"Kollár R, Bodova K, Nosek J, Tomáška Ľ. 2014. Mathematical model of alternative mechanism of telomere length maintenance. Physical Review E. 89(3), 032701.","short":"R. Kollár, K. Bodova, J. Nosek, Ľ. Tomáška, Physical Review E 89 (2014).","ieee":"R. Kollár, K. Bodova, J. Nosek, and Ľ. Tomáška, “Mathematical model of alternative mechanism of telomere length maintenance,” <i>Physical Review E</i>, vol. 89, no. 3. American Physical Society, 2014."},"isi":1,"article_processing_charge":"No","scopus_import":"1","abstract":[{"lang":"eng","text":"Biopolymer length regulation is a complex process that involves a large number of biological, chemical, and physical subprocesses acting simultaneously across multiple spatial and temporal scales. An illustrative example important for genomic stability is the length regulation of telomeres - nucleoprotein structures at the ends of linear chromosomes consisting of tandemly repeated DNA sequences and a specialized set of proteins. Maintenance of telomeres is often facilitated by the enzyme telomerase but, particularly in telomerase-free systems, the maintenance of chromosomal termini depends on alternative lengthening of telomeres (ALT) mechanisms mediated by recombination. Various linear and circular DNA structures were identified to participate in ALT, however, dynamics of the whole process is still poorly understood. We propose a chemical kinetics model of ALT with kinetic rates systematically derived from the biophysics of DNA diffusion and looping. The reaction system is reduced to a coagulation-fragmentation system by quasi-steady-state approximation. The detailed treatment of kinetic rates yields explicit formulas for expected size distributions of telomeres that demonstrate the key role played by the J factor, a quantitative measure of bending of polymers. The results are in agreement with experimental data and point out interesting phenomena: an appearance of very long telomeric circles if the total telomere density exceeds a critical value (excess mass) and a nonlinear response of the telomere size distributions to the amount of telomeric DNA in the system. The results can be of general importance for understanding dynamics of telomeres in telomerase-independent systems as this mode of telomere maintenance is similar to the situation in tumor cells lacking telomerase activity. Furthermore, due to its universality, the model may also serve as a prototype of an interaction between linear and circular DNA structures in various settings."}],"year":"2014","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1402.0430"}],"arxiv":1,"oa":1,"intvolume":"        89","title":"Mathematical model of alternative mechanism of telomere length maintenance","_id":"1896","publication_status":"published","oa_version":"Submitted Version","publisher":"American Physical Society","article_number":"032701","external_id":{"isi":["000332274100002"],"arxiv":["1402.0430"]}}]