[{"type":"conference","alternative_title":["LIPIcs"],"abstract":[{"text":"Graph games provide the foundation for modeling and synthesis of reactive processes. Such games are played over graphs where the vertices are controlled by two adversarial players. We consider graph games where the objective of the first player is the conjunction of a qualitative objective (specified as a parity condition) and a quantitative objective (specified as a meanpayoff condition). There are two variants of the problem, namely, the threshold problem where the quantitative goal is to ensure that the mean-payoff value is above a threshold, and the value problem where the quantitative goal is to ensure the optimal mean-payoff value; in both cases ensuring the qualitative parity objective. The previous best-known algorithms for game graphs with n vertices, m edges, parity objectives with d priorities, and maximal absolute reward value W for mean-payoff objectives, are as follows: O(nd+1 . m . w) for the threshold problem, and O(nd+2 · m · W) for the value problem. Our main contributions are faster algorithms, and the running times of our algorithms are as follows: O(nd-1 · m ·W) for the threshold problem, and O(nd · m · W · log(n · W)) for the value problem. For mean-payoff parity objectives with two priorities, our algorithms match the best-known bounds of the algorithms for mean-payoff games (without conjunction with parity objectives). Our results are relevant in synthesis of reactive systems with both functional requirement (given as a qualitative objective) and performance requirement (given as a quantitative objective).","lang":"eng"}],"_id":"552","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","ddc":["004"],"title":"Faster algorithms for mean-payoff parity games","intvolume":" 83","pubrep_id":"923","oa_version":"Published Version","file":[{"access_level":"open_access","file_name":"IST-2018-923-v1+1_LIPIcs-MFCS-2017-39.pdf","file_size":610339,"content_type":"application/pdf","creator":"system","relation":"main_file","file_id":"5248","checksum":"c67f4866ddbfd555afef1f63ae9a8fc7","date_created":"2018-12-12T10:16:57Z","date_updated":"2020-07-14T12:47:00Z"}],"scopus_import":"1","day":"01","has_accepted_license":"1","article_processing_charge":"No","publication":"Leibniz International Proceedings in Informatics","citation":{"chicago":"Chatterjee, Krishnendu, Monika H Henzinger, and Alexander Svozil. “Faster Algorithms for Mean-Payoff Parity Games.” In Leibniz International Proceedings in Informatics, Vol. 83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. https://doi.org/10.4230/LIPIcs.MFCS.2017.39.","mla":"Chatterjee, Krishnendu, et al. “Faster Algorithms for Mean-Payoff Parity Games.” Leibniz International Proceedings in Informatics, vol. 83, 39, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPIcs.MFCS.2017.39.","short":"K. Chatterjee, M.H. Henzinger, A. Svozil, in:, Leibniz International Proceedings in Informatics, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.","ista":"Chatterjee K, Henzinger MH, Svozil A. 2017. Faster algorithms for mean-payoff parity games. Leibniz International Proceedings in Informatics. MFCS: Mathematical Foundations of Computer Science (SG), LIPIcs, vol. 83, 39.","apa":"Chatterjee, K., Henzinger, M. H., & Svozil, A. (2017). Faster algorithms for mean-payoff parity games. In Leibniz International Proceedings in Informatics (Vol. 83). Aalborg, Denmark: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2017.39","ieee":"K. Chatterjee, M. H. Henzinger, and A. Svozil, “Faster algorithms for mean-payoff parity games,” in Leibniz International Proceedings in Informatics, Aalborg, Denmark, 2017, vol. 83.","ama":"Chatterjee K, Henzinger MH, Svozil A. Faster algorithms for mean-payoff parity games. In: Leibniz International Proceedings in Informatics. Vol 83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:10.4230/LIPIcs.MFCS.2017.39"},"date_published":"2017-11-01T00:00:00Z","article_number":"39","file_date_updated":"2020-07-14T12:47:00Z","ec_funded":1,"publist_id":"7262","license":"https://creativecommons.org/licenses/by/3.0/","year":"2017","publication_status":"published","department":[{"_id":"KrCh"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","author":[{"first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger","first_name":"Monika H"},{"full_name":"Svozil, Alexander","last_name":"Svozil","first_name":"Alexander"}],"date_created":"2018-12-11T11:47:08Z","date_updated":"2023-02-14T10:06:46Z","volume":83,"month":"11","publication_identifier":{"isbn":["978-395977046-0"]},"oa":1,"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"},"quality_controlled":"1","project":[{"grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Game Theory"},{"name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425"}],"conference":{"start_date":"2017-08-21","location":"Aalborg, Denmark","end_date":"2017-08-25","name":"MFCS: Mathematical Foundations of Computer Science (SG)"},"doi":"10.4230/LIPIcs.MFCS.2017.39","language":[{"iso":"eng"}]},{"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"553","status":"public","title":"Strategy complexity of concurrent safety games","ddc":["004"],"intvolume":" 83","pubrep_id":"922","oa_version":"Published Version","file":[{"content_type":"application/pdf","file_size":549967,"creator":"system","file_name":"IST-2018-922-v1+1_LIPIcs-MFCS-2017-55.pdf","access_level":"open_access","date_created":"2018-12-12T10:09:29Z","date_updated":"2020-07-14T12:47:00Z","checksum":"7101facb56ade363205c695d72dbd173","relation":"main_file","file_id":"4753"}],"type":"conference","alternative_title":["LIPIcs"],"abstract":[{"lang":"eng","text":"We consider two player, zero-sum, finite-state concurrent reachability games, played for an infinite number of rounds, where in every round, each player simultaneously and independently of the other players chooses an action, whereafter the successor state is determined by a probability distribution given by the current state and the chosen actions. Player 1 wins iff a designated goal state is eventually visited. We are interested in the complexity of stationary strategies measured by their patience, which is defined as the inverse of the smallest non-zero probability employed. Our main results are as follows: We show that: (i) the optimal bound on the patience of optimal and -optimal strategies, for both players is doubly exponential; and (ii) even in games with a single non-absorbing state exponential (in the number of actions) patience is necessary. "}],"publication":"Leibniz International Proceedings in Informatics","citation":{"ama":"Chatterjee K, Hansen K, Ibsen-Jensen R. Strategy complexity of concurrent safety games. In: Leibniz International Proceedings in Informatics. Vol 83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:10.4230/LIPIcs.MFCS.2017.55","ista":"Chatterjee K, Hansen K, Ibsen-Jensen R. 2017. Strategy complexity of concurrent safety games. Leibniz International Proceedings in Informatics. MFCS: Mathematical Foundations of Computer Science (SG), LIPIcs, vol. 83, 55.","ieee":"K. Chatterjee, K. Hansen, and R. Ibsen-Jensen, “Strategy complexity of concurrent safety games,” in Leibniz International Proceedings in Informatics, Aalborg, Denmark, 2017, vol. 83.","apa":"Chatterjee, K., Hansen, K., & Ibsen-Jensen, R. (2017). Strategy complexity of concurrent safety games. In Leibniz International Proceedings in Informatics (Vol. 83). Aalborg, Denmark: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2017.55","mla":"Chatterjee, Krishnendu, et al. “Strategy Complexity of Concurrent Safety Games.” Leibniz International Proceedings in Informatics, vol. 83, 55, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPIcs.MFCS.2017.55.","short":"K. Chatterjee, K. Hansen, R. Ibsen-Jensen, in:, Leibniz International Proceedings in Informatics, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.","chicago":"Chatterjee, Krishnendu, Kristofer Hansen, and Rasmus Ibsen-Jensen. “Strategy Complexity of Concurrent Safety Games.” In Leibniz International Proceedings in Informatics, Vol. 83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. https://doi.org/10.4230/LIPIcs.MFCS.2017.55."},"date_published":"2017-11-01T00:00:00Z","scopus_import":1,"day":"01","has_accepted_license":"1","year":"2017","publication_status":"published","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","department":[{"_id":"KrCh"}],"author":[{"first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"full_name":"Hansen, Kristofer","first_name":"Kristofer","last_name":"Hansen"},{"full_name":"Ibsen-Jensen, Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4783-0389","first_name":"Rasmus","last_name":"Ibsen-Jensen"}],"date_updated":"2021-01-12T08:02:35Z","date_created":"2018-12-11T11:47:08Z","volume":83,"article_number":"55","file_date_updated":"2020-07-14T12:47:00Z","publist_id":"7261","oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1506.02434"}],"quality_controlled":"1","conference":{"name":"MFCS: Mathematical Foundations of Computer Science (SG)","end_date":"2017-08-25","start_date":"2017-08-21","location":"Aalborg, Denmark"},"doi":"10.4230/LIPIcs.MFCS.2017.55","language":[{"iso":"eng"}],"month":"11","publication_identifier":{"isbn":["978-395977046-0"]}},{"day":"01","scopus_import":1,"date_published":"2017-11-01T00:00:00Z","publication":"Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences","citation":{"ama":"Gerencser M, Jentzen A, Salimova D. On stochastic differential equations with arbitrarily slow convergence rates for strong approximation in two space dimensions. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences. 2017;473(2207). doi:10.1098/rspa.2017.0104","apa":"Gerencser, M., Jentzen, A., & Salimova, D. (2017). On stochastic differential equations with arbitrarily slow convergence rates for strong approximation in two space dimensions. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences. Royal Society of London. https://doi.org/10.1098/rspa.2017.0104","ieee":"M. Gerencser, A. Jentzen, and D. Salimova, “On stochastic differential equations with arbitrarily slow convergence rates for strong approximation in two space dimensions,” Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, vol. 473, no. 2207. Royal Society of London, 2017.","ista":"Gerencser M, Jentzen A, Salimova D. 2017. On stochastic differential equations with arbitrarily slow convergence rates for strong approximation in two space dimensions. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences. 473(2207), 0104.","short":"M. Gerencser, A. Jentzen, D. Salimova, Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences 473 (2017).","mla":"Gerencser, Mate, et al. “On Stochastic Differential Equations with Arbitrarily Slow Convergence Rates for Strong Approximation in Two Space Dimensions.” Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, vol. 473, no. 2207, 0104, Royal Society of London, 2017, doi:10.1098/rspa.2017.0104.","chicago":"Gerencser, Mate, Arnulf Jentzen, and Diyora Salimova. “On Stochastic Differential Equations with Arbitrarily Slow Convergence Rates for Strong Approximation in Two Space Dimensions.” Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences. Royal Society of London, 2017. https://doi.org/10.1098/rspa.2017.0104."},"abstract":[{"lang":"eng","text":"In a recent article (Jentzen et al. 2016 Commun. Math. Sci. 14, 1477–1500 (doi:10.4310/CMS.2016.v14. n6.a1)), it has been established that, for every arbitrarily slow convergence speed and every natural number d ? {4, 5, . . .}, there exist d-dimensional stochastic differential equations with infinitely often differentiable and globally bounded coefficients such that no approximation method based on finitely many observations of the driving Brownian motion can converge in absolute mean to the solution faster than the given speed of convergence. In this paper, we strengthen the above result by proving that this slow convergence phenomenon also arises in two (d = 2) and three (d = 3) space dimensions."}],"issue":"2207","type":"journal_article","oa_version":"Submitted Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"560","status":"public","title":"On stochastic differential equations with arbitrarily slow convergence rates for strong approximation in two space dimensions","intvolume":" 473","month":"11","publication_identifier":{"issn":["13645021"]},"doi":"10.1098/rspa.2017.0104","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://arxiv.org/abs/1702.03229","open_access":"1"}],"oa":1,"quality_controlled":"1","project":[{"_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7"}],"ec_funded":1,"publist_id":"7256","article_number":"0104","author":[{"full_name":"Gerencser, Mate","first_name":"Mate","last_name":"Gerencser","id":"44ECEDF2-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Arnulf","last_name":"Jentzen","full_name":"Jentzen, Arnulf"},{"last_name":"Salimova","first_name":"Diyora","full_name":"Salimova, Diyora"}],"date_updated":"2021-01-12T08:03:04Z","date_created":"2018-12-11T11:47:11Z","volume":473,"year":"2017","publication_status":"published","department":[{"_id":"JaMa"}],"publisher":"Royal Society of London"},{"type":"book","alternative_title":["Courant Lecture Notes"],"abstract":[{"lang":"eng","text":"This book is a concise and self-contained introduction of recent techniques to prove local spectral universality for large random matrices. Random matrix theory is a fast expanding research area, and this book mainly focuses on the methods that the authors participated in developing over the past few years. Many other interesting topics are not included, and neither are several new developments within the framework of these methods. The authors have chosen instead to present key concepts that they believe are the core of these methods and should be relevant for future applications. They keep technicalities to a minimum to make the book accessible to graduate students. With this in mind, they include in this book the basic notions and tools for high-dimensional analysis, such as large deviation, entropy, Dirichlet form, and the logarithmic Sobolev inequality.\r\n"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"567","status":"public","title":"A Dynamical Approach to Random Matrix Theory","intvolume":" 28","oa_version":"None","series_title":"Courant Lecture Notes","day":"01","article_processing_charge":"No","citation":{"ama":"Erdös L, Yau H. A Dynamical Approach to Random Matrix Theory. Vol 28. American Mathematical Society; 2017. doi:10.1090/cln/028","apa":"Erdös, L., & Yau, H. (2017). A Dynamical Approach to Random Matrix Theory (Vol. 28). American Mathematical Society. https://doi.org/10.1090/cln/028","ieee":"L. Erdös and H. Yau, A Dynamical Approach to Random Matrix Theory, vol. 28. American Mathematical Society, 2017.","ista":"Erdös L, Yau H. 2017. A Dynamical Approach to Random Matrix Theory, American Mathematical Society, 226p.","short":"L. Erdös, H. Yau, A Dynamical Approach to Random Matrix Theory, American Mathematical Society, 2017.","mla":"Erdös, László, and Horng Yau. A Dynamical Approach to Random Matrix Theory. Vol. 28, American Mathematical Society, 2017, doi:10.1090/cln/028.","chicago":"Erdös, László, and Horng Yau. A Dynamical Approach to Random Matrix Theory. Vol. 28. Courant Lecture Notes. American Mathematical Society, 2017. https://doi.org/10.1090/cln/028."},"page":"226","date_published":"2017-01-01T00:00:00Z","publist_id":"7247","ec_funded":1,"year":"2017","publication_status":"published","publisher":"American Mathematical Society","department":[{"_id":"LaEr"}],"author":[{"full_name":"Erdös, László","last_name":"Erdös","first_name":"László","orcid":"0000-0001-5366-9603","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Horng","last_name":"Yau","full_name":"Yau, Horng"}],"date_updated":"2022-05-24T06:57:28Z","date_created":"2018-12-11T11:47:13Z","volume":28,"month":"01","publication_identifier":{"eisbn":["978-1-4704-4194-4"],"isbn":["9-781-4704-3648-3"]},"quality_controlled":"1","project":[{"name":"Random matrices, universality and disordered quantum systems","call_identifier":"FP7","grant_number":"338804","_id":"258DCDE6-B435-11E9-9278-68D0E5697425"}],"doi":"10.1090/cln/028","language":[{"iso":"eng"}]},{"scopus_import":1,"day":"01","citation":{"chicago":"Franek, Peter, and Marek Krcál. “Persistence of Zero Sets.” Homology, Homotopy and Applications. International Press, 2017. https://doi.org/10.4310/HHA.2017.v19.n2.a16.","mla":"Franek, Peter, and Marek Krcál. “Persistence of Zero Sets.” Homology, Homotopy and Applications, vol. 19, no. 2, International Press, 2017, pp. 313–42, doi:10.4310/HHA.2017.v19.n2.a16.","short":"P. Franek, M. Krcál, Homology, Homotopy and Applications 19 (2017) 313–342.","ista":"Franek P, Krcál M. 2017. Persistence of zero sets. Homology, Homotopy and Applications. 19(2), 313–342.","ieee":"P. Franek and M. Krcál, “Persistence of zero sets,” Homology, Homotopy and Applications, vol. 19, no. 2. International Press, pp. 313–342, 2017.","apa":"Franek, P., & Krcál, M. (2017). Persistence of zero sets. Homology, Homotopy and Applications. International Press. https://doi.org/10.4310/HHA.2017.v19.n2.a16","ama":"Franek P, Krcál M. Persistence of zero sets. Homology, Homotopy and Applications. 2017;19(2):313-342. doi:10.4310/HHA.2017.v19.n2.a16"},"publication":"Homology, Homotopy and Applications","page":"313 - 342","date_published":"2017-01-01T00:00:00Z","type":"journal_article","issue":"2","abstract":[{"text":"We study robust properties of zero sets of continuous maps f: X → ℝn. Formally, we analyze the family Z< r(f) := (g-1(0): ||g - f|| < r) of all zero sets of all continuous maps g closer to f than r in the max-norm. All of these sets are outside A := (x: |f(x)| ≥ r) and we claim that Z< r(f) is fully determined by A and an element of a certain cohomotopy group which (by a recent result) is computable whenever the dimension of X is at most 2n - 3. By considering all r > 0 simultaneously, the pointed cohomotopy groups form a persistence module-a structure leading to persistence diagrams as in the case of persistent homology or well groups. Eventually, we get a descriptor of persistent robust properties of zero sets that has better descriptive power (Theorem A) and better computability status (Theorem B) than the established well diagrams. Moreover, if we endow every point of each zero set with gradients of the perturbation, the robust description of the zero sets by elements of cohomotopy groups is in some sense the best possible (Theorem C).","lang":"eng"}],"_id":"568","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","intvolume":" 19","status":"public","title":"Persistence of zero sets","oa_version":"Submitted Version","publication_identifier":{"issn":["15320073"]},"month":"01","oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1507.04310"}],"project":[{"name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7","grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425"},{"name":"Atomic-Resolution Structures of Mitochondrial Respiratory Chain Supercomplexes (H2020)","call_identifier":"H2020","_id":"2590DB08-B435-11E9-9278-68D0E5697425","grant_number":"701309"}],"quality_controlled":"1","doi":"10.4310/HHA.2017.v19.n2.a16","language":[{"iso":"eng"}],"publist_id":"7246","ec_funded":1,"year":"2017","publisher":"International Press","department":[{"_id":"UlWa"},{"_id":"HeEd"}],"publication_status":"published","author":[{"full_name":"Franek, Peter","id":"473294AE-F248-11E8-B48F-1D18A9856A87","first_name":"Peter","last_name":"Franek"},{"first_name":"Marek","last_name":"Krcál","id":"33E21118-F248-11E8-B48F-1D18A9856A87","full_name":"Krcál, Marek"}],"volume":19,"date_created":"2018-12-11T11:47:14Z","date_updated":"2021-01-12T08:03:12Z"},{"publication_identifier":{"issn":["2050084X"]},"month":"11","project":[{"call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425"},{"name":"Selective Barriers to Horizontal Gene Transfer","call_identifier":"H2020","grant_number":"648440","_id":"2578D616-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"language":[{"iso":"eng"}],"doi":"10.7554/eLife.28921","article_number":"e28921","publist_id":"7244","ec_funded":1,"file_date_updated":"2020-07-14T12:47:10Z","department":[{"_id":"CaGu"},{"_id":"JoBo"},{"_id":"NiBa"}],"publisher":"eLife Sciences Publications","publication_status":"published","year":"2017","volume":6,"date_updated":"2021-01-12T08:03:15Z","date_created":"2018-12-11T11:47:14Z","author":[{"id":"345D25EC-F248-11E8-B48F-1D18A9856A87","first_name":"Mato","last_name":"Lagator","full_name":"Lagator, Mato"},{"first_name":"Srdjan","last_name":"Sarikas","id":"35F0286E-F248-11E8-B48F-1D18A9856A87","full_name":"Sarikas, Srdjan"},{"last_name":"Acar","first_name":"Hande","orcid":"0000-0003-1986-9753","id":"2DDF136A-F248-11E8-B48F-1D18A9856A87","full_name":"Acar, Hande"},{"id":"2C6FA9CC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4624-4612","first_name":"Jonathan P","last_name":"Bollback","full_name":"Bollback, Jonathan P"},{"full_name":"Guet, Calin C","last_name":"Guet","first_name":"Calin C","orcid":"0000-0001-6220-2052","id":"47F8433E-F248-11E8-B48F-1D18A9856A87"}],"scopus_import":1,"has_accepted_license":"1","day":"13","citation":{"ista":"Lagator M, Sarikas S, Acar H, Bollback JP, Guet CC. 2017. Regulatory network structure determines patterns of intermolecular epistasis. eLife. 6, e28921.","apa":"Lagator, M., Sarikas, S., Acar, H., Bollback, J. P., & Guet, C. C. (2017). Regulatory network structure determines patterns of intermolecular epistasis. ELife. eLife Sciences Publications. https://doi.org/10.7554/eLife.28921","ieee":"M. Lagator, S. Sarikas, H. Acar, J. P. Bollback, and C. C. Guet, “Regulatory network structure determines patterns of intermolecular epistasis,” eLife, vol. 6. eLife Sciences Publications, 2017.","ama":"Lagator M, Sarikas S, Acar H, Bollback JP, Guet CC. Regulatory network structure determines patterns of intermolecular epistasis. eLife. 2017;6. doi:10.7554/eLife.28921","chicago":"Lagator, Mato, Srdjan Sarikas, Hande Acar, Jonathan P Bollback, and Calin C Guet. “Regulatory Network Structure Determines Patterns of Intermolecular Epistasis.” ELife. eLife Sciences Publications, 2017. https://doi.org/10.7554/eLife.28921.","mla":"Lagator, Mato, et al. “Regulatory Network Structure Determines Patterns of Intermolecular Epistasis.” ELife, vol. 6, e28921, eLife Sciences Publications, 2017, doi:10.7554/eLife.28921.","short":"M. Lagator, S. Sarikas, H. Acar, J.P. Bollback, C.C. Guet, ELife 6 (2017)."},"publication":"eLife","date_published":"2017-11-13T00:00:00Z","type":"journal_article","abstract":[{"lang":"eng","text":"Most phenotypes are determined by molecular systems composed of specifically interacting molecules. However, unlike for individual components, little is known about the distributions of mutational effects of molecular systems as a whole. We ask how the distribution of mutational effects of a transcriptional regulatory system differs from the distributions of its components, by first independently, and then simultaneously, mutating a transcription factor and the associated promoter it represses. We find that the system distribution exhibits increased phenotypic variation compared to individual component distributions - an effect arising from intermolecular epistasis between the transcription factor and its DNA-binding site. In large part, this epistasis can be qualitatively attributed to the structure of the transcriptional regulatory system and could therefore be a common feature in prokaryotes. Counter-intuitively, intermolecular epistasis can alleviate the constraints of individual components, thereby increasing phenotypic variation that selection could act on and facilitating adaptive evolution. "}],"intvolume":" 6","title":"Regulatory network structure determines patterns of intermolecular epistasis","status":"public","ddc":["576"],"_id":"570","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","file":[{"content_type":"application/pdf","file_size":8453470,"creator":"system","access_level":"open_access","file_name":"IST-2017-918-v1+1_elife-28921-figures-v3.pdf","checksum":"273ab17f33305e4eaafd911ff88e7c5b","date_updated":"2020-07-14T12:47:10Z","date_created":"2018-12-12T10:14:42Z","relation":"main_file","file_id":"5096"},{"date_created":"2018-12-12T10:14:43Z","date_updated":"2020-07-14T12:47:10Z","checksum":"b433f90576c7be597cd43367946f8e7f","file_id":"5097","relation":"main_file","creator":"system","content_type":"application/pdf","file_size":1953221,"file_name":"IST-2017-918-v1+2_elife-28921-v3.pdf","access_level":"open_access"}],"pubrep_id":"918"},{"doi":"10.7554/eLife.30867","language":[{"iso":"eng"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"quality_controlled":"1","publication_identifier":{"issn":["2050084X"]},"month":"11","author":[{"full_name":"Spira, Felix","first_name":"Felix","last_name":"Spira"},{"full_name":"Cuylen Haering, Sara","last_name":"Cuylen Haering","first_name":"Sara"},{"full_name":"Mehta, Shalin","last_name":"Mehta","first_name":"Shalin"},{"full_name":"Samwer, Matthias","last_name":"Samwer","first_name":"Matthias"},{"full_name":"Reversat, Anne","first_name":"Anne","last_name":"Reversat","id":"35B76592-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-0666-8928"},{"last_name":"Verma","first_name":"Amitabh","full_name":"Verma, Amitabh"},{"full_name":"Oldenbourg, Rudolf","first_name":"Rudolf","last_name":"Oldenbourg"},{"full_name":"Sixt, Michael K","last_name":"Sixt","first_name":"Michael K","orcid":"0000-0002-6620-9179","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Daniel","last_name":"Gerlich","full_name":"Gerlich, Daniel"}],"volume":6,"date_updated":"2023-02-23T12:30:29Z","date_created":"2018-12-11T11:47:14Z","year":"2017","department":[{"_id":"MiSi"}],"publisher":"eLife Sciences Publications","publication_status":"published","publist_id":"7245","file_date_updated":"2020-07-14T12:47:10Z","article_number":"e30867","date_published":"2017-11-06T00:00:00Z","citation":{"ista":"Spira F, Cuylen Haering S, Mehta S, Samwer M, Reversat A, Verma A, Oldenbourg R, Sixt MK, Gerlich D. 2017. Cytokinesis in vertebrate cells initiates by contraction of an equatorial actomyosin network composed of randomly oriented filaments. eLife. 6, e30867.","ieee":"F. Spira et al., “Cytokinesis in vertebrate cells initiates by contraction of an equatorial actomyosin network composed of randomly oriented filaments,” eLife, vol. 6. eLife Sciences Publications, 2017.","apa":"Spira, F., Cuylen Haering, S., Mehta, S., Samwer, M., Reversat, A., Verma, A., … Gerlich, D. (2017). Cytokinesis in vertebrate cells initiates by contraction of an equatorial actomyosin network composed of randomly oriented filaments. ELife. eLife Sciences Publications. https://doi.org/10.7554/eLife.30867","ama":"Spira F, Cuylen Haering S, Mehta S, et al. Cytokinesis in vertebrate cells initiates by contraction of an equatorial actomyosin network composed of randomly oriented filaments. eLife. 2017;6. doi:10.7554/eLife.30867","chicago":"Spira, Felix, Sara Cuylen Haering, Shalin Mehta, Matthias Samwer, Anne Reversat, Amitabh Verma, Rudolf Oldenbourg, Michael K Sixt, and Daniel Gerlich. “Cytokinesis in Vertebrate Cells Initiates by Contraction of an Equatorial Actomyosin Network Composed of Randomly Oriented Filaments.” ELife. eLife Sciences Publications, 2017. https://doi.org/10.7554/eLife.30867.","mla":"Spira, Felix, et al. “Cytokinesis in Vertebrate Cells Initiates by Contraction of an Equatorial Actomyosin Network Composed of Randomly Oriented Filaments.” ELife, vol. 6, e30867, eLife Sciences Publications, 2017, doi:10.7554/eLife.30867.","short":"F. Spira, S. Cuylen Haering, S. Mehta, M. Samwer, A. Reversat, A. Verma, R. Oldenbourg, M.K. Sixt, D. Gerlich, ELife 6 (2017)."},"publication":"eLife","has_accepted_license":"1","day":"06","scopus_import":1,"pubrep_id":"919","file":[{"checksum":"ba09c1451153d39e4f4b7cee013e314c","date_created":"2018-12-12T10:10:40Z","date_updated":"2020-07-14T12:47:10Z","relation":"main_file","file_id":"4829","file_size":9666973,"content_type":"application/pdf","creator":"system","access_level":"open_access","file_name":"IST-2017-919-v1+1_elife-30867-figures-v1.pdf"},{"access_level":"open_access","file_name":"IST-2017-919-v1+2_elife-30867-v1.pdf","file_size":5951246,"content_type":"application/pdf","creator":"system","relation":"main_file","file_id":"4830","checksum":"01eb51f1d6ad679947415a51c988e137","date_updated":"2020-07-14T12:47:10Z","date_created":"2018-12-12T10:10:41Z"}],"oa_version":"Published Version","_id":"569","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 6","title":"Cytokinesis in vertebrate cells initiates by contraction of an equatorial actomyosin network composed of randomly oriented filaments","ddc":["570"],"status":"public","abstract":[{"lang":"eng","text":"The actomyosin ring generates force to ingress the cytokinetic cleavage furrow in animal cells, yet its filament organization and the mechanism of contractility is not well understood. We quantified actin filament order in human cells using fluorescence polarization microscopy and found that cleavage furrow ingression initiates by contraction of an equatorial actin network with randomly oriented filaments. The network subsequently gradually reoriented actin filaments along the cell equator. This strictly depended on myosin II activity, suggesting local network reorganization by mechanical forces. Cortical laser microsurgery revealed that during cytokinesis progression, mechanical tension increased substantially along the direction of the cell equator, while the network contracted laterally along the pole-to-pole axis without a detectable increase in tension. Our data suggest that an asymmetric increase in cortical tension promotes filament reorientation along the cytokinetic cleavage furrow, which might have implications for diverse other biological processes involving actomyosin rings."}],"type":"journal_article"},{"department":[{"_id":"MiSi"}],"publisher":"Cell Press","publication_status":"published","year":"2017","volume":171,"date_created":"2018-12-11T11:47:15Z","date_updated":"2021-01-12T08:03:15Z","author":[{"full_name":"Gärtner, Florian R","id":"397A88EE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6120-3723","first_name":"Florian R","last_name":"Gärtner"},{"last_name":"Ahmad","first_name":"Zerkah","full_name":"Ahmad, Zerkah"},{"first_name":"Gerhild","last_name":"Rosenberger","full_name":"Rosenberger, Gerhild"},{"full_name":"Fan, Shuxia","first_name":"Shuxia","last_name":"Fan"},{"first_name":"Leo","last_name":"Nicolai","full_name":"Nicolai, Leo"},{"first_name":"Benjamin","last_name":"Busch","full_name":"Busch, Benjamin"},{"first_name":"Gökce","last_name":"Yavuz","full_name":"Yavuz, Gökce"},{"last_name":"Luckner","first_name":"Manja","full_name":"Luckner, Manja"},{"first_name":"Hellen","last_name":"Ishikawa Ankerhold","full_name":"Ishikawa Ankerhold, Hellen"},{"last_name":"Hennel","first_name":"Roman","full_name":"Hennel, Roman"},{"full_name":"Benechet, Alexandre","last_name":"Benechet","first_name":"Alexandre"},{"full_name":"Lorenz, Michael","last_name":"Lorenz","first_name":"Michael"},{"last_name":"Chandraratne","first_name":"Sue","full_name":"Chandraratne, Sue"},{"first_name":"Irene","last_name":"Schubert","full_name":"Schubert, Irene"},{"last_name":"Helmer","first_name":"Sebastian","full_name":"Helmer, Sebastian"},{"last_name":"Striednig","first_name":"Bianca","full_name":"Striednig, Bianca"},{"first_name":"Konstantin","last_name":"Stark","full_name":"Stark, Konstantin"},{"full_name":"Janko, Marek","last_name":"Janko","first_name":"Marek"},{"last_name":"Böttcher","first_name":"Ralph","full_name":"Böttcher, Ralph"},{"full_name":"Verschoor, Admar","last_name":"Verschoor","first_name":"Admar"},{"last_name":"Leon","first_name":"Catherine","full_name":"Leon, Catherine"},{"last_name":"Gachet","first_name":"Christian","full_name":"Gachet, Christian"},{"last_name":"Gudermann","first_name":"Thomas","full_name":"Gudermann, Thomas"},{"full_name":"Mederos Y Schnitzler, Michael","last_name":"Mederos Y Schnitzler","first_name":"Michael"},{"last_name":"Pincus","first_name":"Zachary","full_name":"Pincus, Zachary"},{"full_name":"Iannacone, Matteo","last_name":"Iannacone","first_name":"Matteo"},{"full_name":"Haas, Rainer","first_name":"Rainer","last_name":"Haas"},{"last_name":"Wanner","first_name":"Gerhard","full_name":"Wanner, Gerhard"},{"full_name":"Lauber, Kirsten","first_name":"Kirsten","last_name":"Lauber"},{"orcid":"0000-0002-6620-9179","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","last_name":"Sixt","first_name":"Michael K","full_name":"Sixt, Michael K"},{"first_name":"Steffen","last_name":"Massberg","full_name":"Massberg, Steffen"}],"publist_id":"7243","ec_funded":1,"project":[{"_id":"260AA4E2-B435-11E9-9278-68D0E5697425","grant_number":"747687","call_identifier":"H2020","name":"Mechanical Adaptation of Lamellipodial Actin Networks in Migrating Cells"}],"quality_controlled":"1","language":[{"iso":"eng"}],"doi":"10.1016/j.cell.2017.11.001","publication_identifier":{"issn":["00928674"]},"month":"11","intvolume":" 171","status":"public","title":"Migrating platelets are mechano scavengers that collect and bundle bacteria","_id":"571","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"None","type":"journal_article","issue":"6","abstract":[{"lang":"eng","text":"Blood platelets are critical for hemostasis and thrombosis and play diverse roles during immune responses. Despite these versatile tasks in mammalian biology, their skills on a cellular level are deemed limited, mainly consisting in rolling, adhesion, and aggregate formation. Here, we identify an unappreciated asset of platelets and show that adherent platelets use adhesion receptors to mechanically probe the adhesive substrate in their local microenvironment. When actomyosin-dependent traction forces overcome substrate resistance, platelets migrate and pile up the adhesive substrate together with any bound particulate material. They use this ability to act as cellular scavengers, scanning the vascular surface for potential invaders and collecting deposited bacteria. Microbe collection by migrating platelets boosts the activity of professional phagocytes, exacerbating inflammatory tissue injury in sepsis. This assigns platelets a central role in innate immune responses and identifies them as potential targets to dampen inflammatory tissue damage in clinical scenarios of severe systemic infection. In addition to their role in thrombosis and hemostasis, platelets can also migrate to sites of infection to help trap bacteria and clear the vascular surface."}],"page":"1368 - 1382","citation":{"ama":"Gärtner FR, Ahmad Z, Rosenberger G, et al. Migrating platelets are mechano scavengers that collect and bundle bacteria. Cell Press. 2017;171(6):1368-1382. doi:10.1016/j.cell.2017.11.001","ista":"Gärtner FR, Ahmad Z, Rosenberger G, Fan S, Nicolai L, Busch B, Yavuz G, Luckner M, Ishikawa Ankerhold H, Hennel R, Benechet A, Lorenz M, Chandraratne S, Schubert I, Helmer S, Striednig B, Stark K, Janko M, Böttcher R, Verschoor A, Leon C, Gachet C, Gudermann T, Mederos Y Schnitzler M, Pincus Z, Iannacone M, Haas R, Wanner G, Lauber K, Sixt MK, Massberg S. 2017. Migrating platelets are mechano scavengers that collect and bundle bacteria. Cell Press. 171(6), 1368–1382.","ieee":"F. R. Gärtner et al., “Migrating platelets are mechano scavengers that collect and bundle bacteria,” Cell Press, vol. 171, no. 6. Cell Press, pp. 1368–1382, 2017.","apa":"Gärtner, F. R., Ahmad, Z., Rosenberger, G., Fan, S., Nicolai, L., Busch, B., … Massberg, S. (2017). Migrating platelets are mechano scavengers that collect and bundle bacteria. Cell Press. Cell Press. https://doi.org/10.1016/j.cell.2017.11.001","mla":"Gärtner, Florian R., et al. “Migrating Platelets Are Mechano Scavengers That Collect and Bundle Bacteria.” Cell Press, vol. 171, no. 6, Cell Press, 2017, pp. 1368–82, doi:10.1016/j.cell.2017.11.001.","short":"F.R. Gärtner, Z. Ahmad, G. Rosenberger, S. Fan, L. Nicolai, B. Busch, G. Yavuz, M. Luckner, H. Ishikawa Ankerhold, R. Hennel, A. Benechet, M. Lorenz, S. Chandraratne, I. Schubert, S. Helmer, B. Striednig, K. Stark, M. Janko, R. Böttcher, A. Verschoor, C. Leon, C. Gachet, T. Gudermann, M. Mederos Y Schnitzler, Z. Pincus, M. Iannacone, R. Haas, G. Wanner, K. Lauber, M.K. Sixt, S. Massberg, Cell Press 171 (2017) 1368–1382.","chicago":"Gärtner, Florian R, Zerkah Ahmad, Gerhild Rosenberger, Shuxia Fan, Leo Nicolai, Benjamin Busch, Gökce Yavuz, et al. “Migrating Platelets Are Mechano Scavengers That Collect and Bundle Bacteria.” Cell Press. Cell Press, 2017. https://doi.org/10.1016/j.cell.2017.11.001."},"publication":"Cell Press","date_published":"2017-11-30T00:00:00Z","scopus_import":1,"day":"30"},{"article_number":"2587","publist_id":"7242","file_date_updated":"2020-07-14T12:47:10Z","department":[{"_id":"JiFr"}],"publisher":"MDPI","publication_status":"published","year":"2017","volume":18,"date_updated":"2021-01-12T08:03:16Z","date_created":"2018-12-11T11:47:15Z","author":[{"full_name":"Olatunji, Damilola","first_name":"Damilola","last_name":"Olatunji"},{"last_name":"Geelen","first_name":"Danny","full_name":"Geelen, Danny"},{"full_name":"Verstraeten, Inge","id":"362BF7FE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-7241-2328","first_name":"Inge","last_name":"Verstraeten"}],"month":"12","quality_controlled":"1","oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"language":[{"iso":"eng"}],"doi":"10.3390/ijms18122587","type":"journal_article","issue":"12","abstract":[{"text":"In this review, we summarize the different biosynthesis-related pathways that contribute to the regulation of endogenous auxin in plants. We demonstrate that all known genes involved in auxin biosynthesis also have a role in root formation, from the initiation of a root meristem during embryogenesis to the generation of a functional root system with a primary root, secondary lateral root branches and adventitious roots. Furthermore, the versatile adaptation of root development in response to environmental challenges is mediated by both local and distant control of auxin biosynthesis. In conclusion, auxin homeostasis mediated by spatial and temporal regulation of auxin biosynthesis plays a central role in determining root architecture.","lang":"eng"}],"intvolume":" 18","title":"Control of endogenous auxin levels in plant root development","status":"public","ddc":["580"],"_id":"572","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","file":[{"creator":"system","content_type":"application/pdf","file_size":920962,"access_level":"open_access","file_name":"IST-2017-917-v1+1_ijms-18-02587.pdf","checksum":"82d51f11e493f7eec02976d9a9a9805e","date_updated":"2020-07-14T12:47:10Z","date_created":"2018-12-12T10:08:55Z","file_id":"4718","relation":"main_file"}],"pubrep_id":"917","scopus_import":"1","has_accepted_license":"1","article_processing_charge":"No","day":"01","citation":{"short":"D. Olatunji, D. Geelen, I. Verstraeten, International Journal of Molecular Sciences 18 (2017).","mla":"Olatunji, Damilola, et al. “Control of Endogenous Auxin Levels in Plant Root Development.” International Journal of Molecular Sciences, vol. 18, no. 12, 2587, MDPI, 2017, doi:10.3390/ijms18122587.","chicago":"Olatunji, Damilola, Danny Geelen, and Inge Verstraeten. “Control of Endogenous Auxin Levels in Plant Root Development.” International Journal of Molecular Sciences. MDPI, 2017. https://doi.org/10.3390/ijms18122587.","ama":"Olatunji D, Geelen D, Verstraeten I. Control of endogenous auxin levels in plant root development. International Journal of Molecular Sciences. 2017;18(12). doi:10.3390/ijms18122587","apa":"Olatunji, D., Geelen, D., & Verstraeten, I. (2017). Control of endogenous auxin levels in plant root development. International Journal of Molecular Sciences. MDPI. https://doi.org/10.3390/ijms18122587","ieee":"D. Olatunji, D. Geelen, and I. Verstraeten, “Control of endogenous auxin levels in plant root development,” International Journal of Molecular Sciences, vol. 18, no. 12. MDPI, 2017.","ista":"Olatunji D, Geelen D, Verstraeten I. 2017. Control of endogenous auxin levels in plant root development. International Journal of Molecular Sciences. 18(12), 2587."},"publication":"International Journal of Molecular Sciences","date_published":"2017-12-01T00:00:00Z"},{"author":[{"orcid":"0000-0002-5372-7890","id":"3C2B033E-F248-11E8-B48F-1D18A9856A87","last_name":"Biswas","first_name":"Ranita","full_name":"Biswas, Ranita"},{"first_name":"Partha","last_name":"Bhowmick","full_name":"Bhowmick, Partha"}],"volume":10256,"date_created":"2019-01-08T20:42:56Z","date_updated":"2022-01-28T07:48:24Z","year":"2017","publisher":"Springer Nature","department":[{"_id":"HeEd"}],"publication_status":"published","extern":"1","place":"Cham","doi":"10.1007/978-3-319-59108-7_8","conference":{"name":"IWCIA: International Workshop on Combinatorial Image Analysis","end_date":"2017-06-21","start_date":"2017-06-19","location":"Plovdiv, Bulgaria"},"language":[{"iso":"eng"}],"quality_controlled":"1","publication_identifier":{"isbn":["978-3-319-59107-0","978-3-319-59108-7"],"issn":["0302-9743","1611-3349"]},"month":"05","oa_version":"None","_id":"5803","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","intvolume":" 10256","status":"public","title":"Construction of persistent Voronoi diagram on 3D digital plane","abstract":[{"lang":"eng","text":"Different distance metrics produce Voronoi diagrams with different properties. It is a well-known that on the (real) 2D plane or even on any 3D plane, a Voronoi diagram (VD) based on the Euclidean distance metric produces convex Voronoi regions. In this paper, we first show that this metric produces a persistent VD on the 2D digital plane, as it comprises digitally convex Voronoi regions and hence correctly approximates the corresponding VD on the 2D real plane. Next, we show that on a 3D digital plane D, the Euclidean metric spanning over its voxel set does not guarantee a digital VD which is persistent with the real-space VD. As a solution, we introduce a novel concept of functional-plane-convexity, which is ensured by the Euclidean metric spanning over the pedal set of D. Necessary proofs and some visual result have been provided to adjudge the merit and usefulness of the proposed concept."}],"type":"book_chapter","alternative_title":["LNCS"],"date_published":"2017-05-17T00:00:00Z","citation":{"ama":"Biswas R, Bhowmick P. Construction of persistent Voronoi diagram on 3D digital plane. In: Combinatorial Image Analysis. Vol 10256. Cham: Springer Nature; 2017:93-104. doi:10.1007/978-3-319-59108-7_8","ieee":"R. Biswas and P. Bhowmick, “Construction of persistent Voronoi diagram on 3D digital plane,” in Combinatorial image analysis, vol. 10256, Cham: Springer Nature, 2017, pp. 93–104.","apa":"Biswas, R., & Bhowmick, P. (2017). Construction of persistent Voronoi diagram on 3D digital plane. In Combinatorial image analysis (Vol. 10256, pp. 93–104). Cham: Springer Nature. https://doi.org/10.1007/978-3-319-59108-7_8","ista":"Biswas R, Bhowmick P. 2017.Construction of persistent Voronoi diagram on 3D digital plane. In: Combinatorial image analysis. LNCS, vol. 10256, 93–104.","short":"R. Biswas, P. Bhowmick, in:, Combinatorial Image Analysis, Springer Nature, Cham, 2017, pp. 93–104.","mla":"Biswas, Ranita, and Partha Bhowmick. “Construction of Persistent Voronoi Diagram on 3D Digital Plane.” Combinatorial Image Analysis, vol. 10256, Springer Nature, 2017, pp. 93–104, doi:10.1007/978-3-319-59108-7_8.","chicago":"Biswas, Ranita, and Partha Bhowmick. “Construction of Persistent Voronoi Diagram on 3D Digital Plane.” In Combinatorial Image Analysis, 10256:93–104. Cham: Springer Nature, 2017. https://doi.org/10.1007/978-3-319-59108-7_8."},"publication":"Combinatorial image analysis","page":"93-104","article_processing_charge":"No","day":"17"}]