[{"date_published":"2014-01-30T00:00:00Z","publisher":"Springer Nature","quality_controlled":"1","volume":8318,"page":"262-281","department":[{"_id":"KrCh"}],"project":[{"call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"name":"Game Theory","call_identifier":"FWF","grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"}],"abstract":[{"lang":"eng","text":"We revisit the parameterized model checking problem for token-passing systems and specifications in indexed CTL  ∗ \\X. Emerson and Namjoshi (1995, 2003) have shown that parameterized model checking of indexed CTL  ∗ \\X in uni-directional token rings can be reduced to checking rings up to some cutoff size. Clarke et al. (2004) have shown a similar result for general topologies and indexed LTL \\X, provided processes cannot choose the directions for sending or receiving the token.\r\nWe unify and substantially extend these results by systematically exploring fragments of indexed CTL  ∗ \\X with respect to general topologies. For each fragment we establish whether a cutoff exists, and for some concrete topologies, such as rings, cliques and stars, we infer small cutoffs. Finally, we show that the problem becomes undecidable, and thus no cutoffs exist, if processes are allowed to choose the directions in which they send or from which they receive the token."}],"external_id":{"arxiv":["1311.4425"]},"publication_status":"published","doi":"10.1007/978-3-642-54013-4_15","_id":"10884","ec_funded":1,"year":"2014","acknowledgement":"This work was supported by the Austrian Science Fund through grant P23499-N23\r\nand through the RiSE network (S11403, S11405, S11406, S11407-N23); ERC Starting Grant (279307: Graph Games); Vienna Science and Technology Fund (WWTF)\r\ngrants PROSEED, ICT12-059, and VRG11-005.","date_created":"2022-03-18T13:01:22Z","citation":{"apa":"Aminof, B., Jacobs, S., Khalimov, A., &#38; Rubin, S. (2014). Parameterized model checking of token-passing systems. In <i>Verification, Model Checking, and Abstract Interpretation</i> (Vol. 8318, pp. 262–281). San Diego, CA, United States: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-642-54013-4_15\">https://doi.org/10.1007/978-3-642-54013-4_15</a>","mla":"Aminof, Benjamin, et al. “Parameterized Model Checking of Token-Passing Systems.” <i>Verification, Model Checking, and Abstract Interpretation</i>, vol. 8318, Springer Nature, 2014, pp. 262–81, doi:<a href=\"https://doi.org/10.1007/978-3-642-54013-4_15\">10.1007/978-3-642-54013-4_15</a>.","chicago":"Aminof, Benjamin, Swen Jacobs, Ayrat Khalimov, and Sasha Rubin. “Parameterized Model Checking of Token-Passing Systems.” In <i>Verification, Model Checking, and Abstract Interpretation</i>, 8318:262–81. Springer Nature, 2014. <a href=\"https://doi.org/10.1007/978-3-642-54013-4_15\">https://doi.org/10.1007/978-3-642-54013-4_15</a>.","ista":"Aminof B, Jacobs S, Khalimov A, Rubin S. 2014. Parameterized model checking of token-passing systems. Verification, Model Checking, and Abstract Interpretation. VMCAI: Verifcation, Model Checking, and Abstract Interpretation, LNCS, vol. 8318, 262–281.","short":"B. Aminof, S. Jacobs, A. Khalimov, S. Rubin, in:, Verification, Model Checking, and Abstract Interpretation, Springer Nature, 2014, pp. 262–281.","ieee":"B. Aminof, S. Jacobs, A. Khalimov, and S. Rubin, “Parameterized model checking of token-passing systems,” in <i>Verification, Model Checking, and Abstract Interpretation</i>, San Diego, CA, United States, 2014, vol. 8318, pp. 262–281.","ama":"Aminof B, Jacobs S, Khalimov A, Rubin S. Parameterized model checking of token-passing systems. In: <i>Verification, Model Checking, and Abstract Interpretation</i>. Vol 8318. Springer Nature; 2014:262-281. doi:<a href=\"https://doi.org/10.1007/978-3-642-54013-4_15\">10.1007/978-3-642-54013-4_15</a>"},"status":"public","type":"conference","alternative_title":["LNCS"],"publication_identifier":{"issn":["0302-9743"],"isbn":["9783642540127"],"eissn":["1611-3349"],"eisbn":["9783642540134"]},"month":"01","conference":{"name":"VMCAI: Verifcation, Model Checking, and Abstract Interpretation","start_date":"2014-01-19","location":"San Diego, CA, United States","end_date":"2014-01-21"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"30","main_file_link":[{"url":" https://doi.org/10.48550/arXiv.1311.4425","open_access":"1"}],"oa_version":"Preprint","arxiv":1,"author":[{"last_name":"Aminof","id":"4A55BD00-F248-11E8-B48F-1D18A9856A87","first_name":"Benjamin","full_name":"Aminof, Benjamin"},{"first_name":"Swen","full_name":"Jacobs, Swen","last_name":"Jacobs"},{"full_name":"Khalimov, Ayrat","first_name":"Ayrat","last_name":"Khalimov"},{"id":"2EC51194-F248-11E8-B48F-1D18A9856A87","last_name":"Rubin","first_name":"Sasha","full_name":"Rubin, Sasha"}],"publication":"Verification, Model Checking, and Abstract Interpretation","language":[{"iso":"eng"}],"scopus_import":"1","intvolume":"      8318","article_processing_charge":"No","date_updated":"2022-05-17T08:36:01Z","oa":1,"title":"Parameterized model checking of token-passing systems"},{"citation":{"apa":"Chatterjee, K., Doyen, L., Filiot, E., &#38; Raskin, J.-F. (2014). Doomsday equilibria for omega-regular games. In <i>VMCAI 2014: Verification, Model Checking, and Abstract Interpretation</i> (Vol. 8318, pp. 78–97). San Diego, CA, United States: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-642-54013-4_5\">https://doi.org/10.1007/978-3-642-54013-4_5</a>","ista":"Chatterjee K, Doyen L, Filiot E, Raskin J-F. 2014. Doomsday equilibria for omega-regular games. VMCAI 2014: Verification, Model Checking, and Abstract Interpretation. VMCAI: Verifcation, Model Checking, and Abstract Interpretation, LNCS, vol. 8318, 78–97.","chicago":"Chatterjee, Krishnendu, Laurent Doyen, Emmanuel Filiot, and Jean-François Raskin. “Doomsday Equilibria for Omega-Regular Games.” In <i>VMCAI 2014: Verification, Model Checking, and Abstract Interpretation</i>, 8318:78–97. Springer Nature, 2014. <a href=\"https://doi.org/10.1007/978-3-642-54013-4_5\">https://doi.org/10.1007/978-3-642-54013-4_5</a>.","mla":"Chatterjee, Krishnendu, et al. “Doomsday Equilibria for Omega-Regular Games.” <i>VMCAI 2014: Verification, Model Checking, and Abstract Interpretation</i>, vol. 8318, Springer Nature, 2014, pp. 78–97, doi:<a href=\"https://doi.org/10.1007/978-3-642-54013-4_5\">10.1007/978-3-642-54013-4_5</a>.","short":"K. Chatterjee, L. Doyen, E. Filiot, J.-F. Raskin, in:, VMCAI 2014: Verification, Model Checking, and Abstract Interpretation, Springer Nature, 2014, pp. 78–97.","ieee":"K. Chatterjee, L. Doyen, E. Filiot, and J.-F. Raskin, “Doomsday equilibria for omega-regular games,” in <i>VMCAI 2014: Verification, Model Checking, and Abstract Interpretation</i>, San Diego, CA, United States, 2014, vol. 8318, pp. 78–97.","ama":"Chatterjee K, Doyen L, Filiot E, Raskin J-F. Doomsday equilibria for omega-regular games. In: <i>VMCAI 2014: Verification, Model Checking, and Abstract Interpretation</i>. Vol 8318. Springer Nature; 2014:78-97. doi:<a href=\"https://doi.org/10.1007/978-3-642-54013-4_5\">10.1007/978-3-642-54013-4_5</a>"},"date_created":"2022-03-18T13:03:15Z","acknowledgement":" Supported by Austrian Science Fund (FWF) Grant No P23499-N23, FWF NFN Grant No\r\nS11407-N23 (RiSE), ERC Start grant (279307: Graph Games), and Microsoft faculty fellows award.","year":"2014","ec_funded":1,"related_material":{"record":[{"status":"public","id":"681","relation":"later_version"}]},"_id":"10885","doi":"10.1007/978-3-642-54013-4_5","publication_status":"published","external_id":{"arxiv":["1311.3238"]},"abstract":[{"text":"Two-player games on graphs provide the theoretical framework for many important problems such as reactive synthesis. While the traditional study of two-player zero-sum games has been extended to multi-player games with several notions of equilibria, they are decidable only for perfect-information games, whereas several applications require imperfect-information games.\r\nIn this paper we propose a new notion of equilibria, called doomsday equilibria, which is a strategy profile such that all players satisfy their own objective, and if any coalition of players deviates and violates even one of the players objective, then the objective of every player is violated.\r\nWe present algorithms and complexity results for deciding the existence of doomsday equilibria for various classes of ω-regular objectives, both for imperfect-information games, and for perfect-information games.We provide optimal complexity bounds for imperfect-information games, and in most cases for perfect-information games.","lang":"eng"}],"project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF"},{"grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425","name":"Game Theory","call_identifier":"FWF"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"department":[{"_id":"KrCh"}],"page":"78-97","quality_controlled":"1","volume":8318,"publisher":"Springer Nature","date_published":"2014-01-30T00:00:00Z","title":"Doomsday equilibria for omega-regular games","date_updated":"2023-02-23T12:52:24Z","article_processing_charge":"No","scopus_import":"1","intvolume":"      8318","language":[{"iso":"eng"}],"publication":"VMCAI 2014: Verification, Model Checking, and Abstract Interpretation","author":[{"first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee"},{"last_name":"Doyen","full_name":"Doyen, Laurent","first_name":"Laurent"},{"full_name":"Filiot, Emmanuel","first_name":"Emmanuel","last_name":"Filiot"},{"full_name":"Raskin, Jean-François","first_name":"Jean-François","last_name":"Raskin"}],"arxiv":1,"oa_version":"Preprint","day":"30","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","conference":{"end_date":"2014-01-21","location":"San Diego, CA, United States","start_date":"2014-01-19","name":"VMCAI: Verifcation, Model Checking, and Abstract Interpretation"},"month":"01","publication_identifier":{"issn":["0302-9743"],"eissn":["1611-3349"],"eisbn":["9783642540134"],"isbn":["9783642540127"]},"alternative_title":["LNCS"],"type":"conference","status":"public"},{"doi":"10.1007/978-3-319-04099-8_16","publication":"Topological Methods in Data Analysis and Visualization III ","language":[{"iso":"eng"}],"_id":"10886","scopus_import":"1","date_created":"2022-03-18T13:05:39Z","title":"Visualization of two-dimensional symmetric positive definite tensor fields using the heat kernel signature","citation":{"apa":"Zobel, V., Reininghaus, J., &#38; Hotz, I. (2014). Visualization of two-dimensional symmetric positive definite tensor fields using the heat kernel signature. In <i>Topological Methods in Data Analysis and Visualization III </i> (pp. 249–262). Springer. <a href=\"https://doi.org/10.1007/978-3-319-04099-8_16\">https://doi.org/10.1007/978-3-319-04099-8_16</a>","mla":"Zobel, Valentin, et al. “Visualization of Two-Dimensional Symmetric Positive Definite Tensor Fields Using the Heat Kernel Signature.” <i>Topological Methods in Data Analysis and Visualization III </i>, Springer, 2014, pp. 249–62, doi:<a href=\"https://doi.org/10.1007/978-3-319-04099-8_16\">10.1007/978-3-319-04099-8_16</a>.","chicago":"Zobel, Valentin, Jan Reininghaus, and Ingrid Hotz. “Visualization of Two-Dimensional Symmetric Positive Definite Tensor Fields Using the Heat Kernel Signature.” In <i>Topological Methods in Data Analysis and Visualization III </i>, 249–62. Springer, 2014. <a href=\"https://doi.org/10.1007/978-3-319-04099-8_16\">https://doi.org/10.1007/978-3-319-04099-8_16</a>.","ista":"Zobel V, Reininghaus J, Hotz I. 2014. Visualization of two-dimensional symmetric positive definite tensor fields using the heat kernel signature. Topological Methods in Data Analysis and Visualization III . , Mathematics and Visualization, , 249–262.","short":"V. Zobel, J. Reininghaus, I. Hotz, in:, Topological Methods in Data Analysis and Visualization III , Springer, 2014, pp. 249–262.","ieee":"V. Zobel, J. Reininghaus, and I. Hotz, “Visualization of two-dimensional symmetric positive definite tensor fields using the heat kernel signature,” in <i>Topological Methods in Data Analysis and Visualization III </i>, 2014, pp. 249–262.","ama":"Zobel V, Reininghaus J, Hotz I. Visualization of two-dimensional symmetric positive definite tensor fields using the heat kernel signature. In: <i>Topological Methods in Data Analysis and Visualization III </i>. Springer; 2014:249-262. doi:<a href=\"https://doi.org/10.1007/978-3-319-04099-8_16\">10.1007/978-3-319-04099-8_16</a>"},"article_processing_charge":"No","year":"2014","acknowledgement":"This research is partially supported by the TOPOSYS project FP7-ICT-318493-STREP.","date_updated":"2023-09-05T14:13:16Z","quality_controlled":"1","department":[{"_id":"HeEd"}],"page":"249-262","date_published":"2014-03-19T00:00:00Z","status":"public","type":"conference","alternative_title":["Mathematics and Visualization"],"publisher":"Springer","abstract":[{"lang":"eng","text":"We propose a method for visualizing two-dimensional symmetric positive definite tensor fields using the Heat Kernel Signature (HKS). The HKS is derived from the heat kernel and was originally introduced as an isometry invariant shape signature. Each positive definite tensor field defines a Riemannian manifold by considering the tensor field as a Riemannian metric. On this Riemmanian manifold we can apply the definition of the HKS. The resulting scalar quantity is used for the visualization of tensor fields. The HKS is closely related to the Gaussian curvature of the Riemannian manifold and the time parameter of the heat kernel allows a multiscale analysis in a natural way. In this way, the HKS represents field related scale space properties, enabling a level of detail analysis of tensor fields. This makes the HKS an interesting new scalar quantity for tensor fields, which differs significantly from usual tensor invariants like the trace or the determinant. A method for visualization and a numerical realization of the HKS for tensor fields is proposed in this chapter. To validate the approach we apply it to some illustrating simple examples as isolated critical points and to a medical diffusion tensor data set."}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","day":"19","oa_version":"None","publication_identifier":{"isbn":["9783319040981"],"eisbn":["9783319040998"],"eissn":["2197-666X"],"issn":["1612-3786"]},"month":"03","publication_status":"published","author":[{"last_name":"Zobel","full_name":"Zobel, Valentin","first_name":"Valentin"},{"full_name":"Reininghaus, Jan","first_name":"Jan","id":"4505473A-F248-11E8-B48F-1D18A9856A87","last_name":"Reininghaus"},{"full_name":"Hotz, Ingrid","first_name":"Ingrid","last_name":"Hotz"}]},{"publication":"25th International Symposium, ISAAC 2014","language":[{"iso":"eng"}],"scopus_import":"1","intvolume":"      8889","title":"Planar matchings for weighted straight skeletons","date_updated":"2023-02-23T12:20:55Z","article_processing_charge":"No","alternative_title":["LNCS"],"status":"public","type":"conference","oa_version":"None","day":"08","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","conference":{"end_date":"2014-12-17","location":"Jeonju, Korea","start_date":"2014-12-15","name":"ISAAC: International Symposium on Algorithms and Computation"},"month":"11","publication_identifier":{"eissn":["1611-3349"],"eisbn":["9783319130750"],"isbn":["9783319130743"],"issn":["0302-9743"]},"author":[{"last_name":"Biedl","first_name":"Therese","full_name":"Biedl, Therese"},{"orcid":"0000-0002-8871-5814","last_name":"Huber","id":"4700A070-F248-11E8-B48F-1D18A9856A87","first_name":"Stefan","full_name":"Huber, Stefan"},{"first_name":"Peter","full_name":"Palfrader, Peter","last_name":"Palfrader"}],"doi":"10.1007/978-3-319-13075-0_10","_id":"10892","related_material":{"record":[{"relation":"later_version","id":"481","status":"public"}]},"date_created":"2022-03-21T07:09:03Z","citation":{"apa":"Biedl, T., Huber, S., &#38; Palfrader, P. (2014). Planar matchings for weighted straight skeletons. In <i>25th International Symposium, ISAAC 2014</i> (Vol. 8889, pp. 117–127). Jeonju, Korea: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-319-13075-0_10\">https://doi.org/10.1007/978-3-319-13075-0_10</a>","ista":"Biedl T, Huber S, Palfrader P. 2014. Planar matchings for weighted straight skeletons. 25th International Symposium, ISAAC 2014. ISAAC: International Symposium on Algorithms and Computation, LNCS, vol. 8889, 117–127.","mla":"Biedl, Therese, et al. “Planar Matchings for Weighted Straight Skeletons.” <i>25th International Symposium, ISAAC 2014</i>, vol. 8889, Springer Nature, 2014, pp. 117–27, doi:<a href=\"https://doi.org/10.1007/978-3-319-13075-0_10\">10.1007/978-3-319-13075-0_10</a>.","chicago":"Biedl, Therese, Stefan Huber, and Peter Palfrader. “Planar Matchings for Weighted Straight Skeletons.” In <i>25th International Symposium, ISAAC 2014</i>, 8889:117–27. Springer Nature, 2014. <a href=\"https://doi.org/10.1007/978-3-319-13075-0_10\">https://doi.org/10.1007/978-3-319-13075-0_10</a>.","ieee":"T. Biedl, S. Huber, and P. Palfrader, “Planar matchings for weighted straight skeletons,” in <i>25th International Symposium, ISAAC 2014</i>, Jeonju, Korea, 2014, vol. 8889, pp. 117–127.","ama":"Biedl T, Huber S, Palfrader P. Planar matchings for weighted straight skeletons. In: <i>25th International Symposium, ISAAC 2014</i>. Vol 8889. Springer Nature; 2014:117-127. doi:<a href=\"https://doi.org/10.1007/978-3-319-13075-0_10\">10.1007/978-3-319-13075-0_10</a>","short":"T. Biedl, S. Huber, P. Palfrader, in:, 25th International Symposium, ISAAC 2014, Springer Nature, 2014, pp. 117–127."},"acknowledgement":"T. Biedl was supported by NSERC and the Ross and Muriel Cheriton Fellowship. P. Palfrader was supported by Austrian Science Fund (FWF): P25816-N15.","year":"2014","page":"117-127","department":[{"_id":"HeEd"}],"quality_controlled":"1","volume":8889,"publisher":"Springer Nature","date_published":"2014-11-08T00:00:00Z","abstract":[{"text":"In this paper, we introduce planar matchings on directed pseudo-line arrangements, which yield a planar set of pseudo-line segments such that only matching-partners are adjacent. By translating the planar matching problem into a corresponding stable roommates problem we show that such matchings always exist.\r\nUsing our new framework, we establish, for the first time, a complete, rigorous definition of weighted straight skeletons, which are based on a so-called wavefront propagation process. We present a generalized and unified approach to treat structural changes in the wavefront that focuses on the restoration of weak planarity by finding planar matchings.","lang":"eng"}],"publication_status":"published"},{"doi":"10.1007/978-3-319-04099-8_4","_id":"10893","ec_funded":1,"citation":{"ista":"Kasten J, Reininghaus J, Reich W, Scheuermann G. 2014.Toward the extraction of saddle periodic orbits. In: Topological Methods in Data Analysis and Visualization III . vol. 1, 55–69.","chicago":"Kasten, Jens, Jan Reininghaus, Wieland Reich, and Gerik Scheuermann. “Toward the Extraction of Saddle Periodic Orbits.” In <i>Topological Methods in Data Analysis and Visualization III </i>, edited by Peer-Timo Bremer, Ingrid Hotz, Valerio Pascucci, and Ronald Peikert, 1:55–69. Mathematics and Visualization. Cham: Springer, 2014. <a href=\"https://doi.org/10.1007/978-3-319-04099-8_4\">https://doi.org/10.1007/978-3-319-04099-8_4</a>.","mla":"Kasten, Jens, et al. “Toward the Extraction of Saddle Periodic Orbits.” <i>Topological Methods in Data Analysis and Visualization III </i>, edited by Peer-Timo Bremer et al., vol. 1, Springer, 2014, pp. 55–69, doi:<a href=\"https://doi.org/10.1007/978-3-319-04099-8_4\">10.1007/978-3-319-04099-8_4</a>.","ieee":"J. Kasten, J. Reininghaus, W. Reich, and G. Scheuermann, “Toward the extraction of saddle periodic orbits,” in <i>Topological Methods in Data Analysis and Visualization III </i>, vol. 1, P.-T. Bremer, I. Hotz, V. Pascucci, and R. Peikert, Eds. Cham: Springer, 2014, pp. 55–69.","ama":"Kasten J, Reininghaus J, Reich W, Scheuermann G. Toward the extraction of saddle periodic orbits. In: Bremer P-T, Hotz I, Pascucci V, Peikert R, eds. <i>Topological Methods in Data Analysis and Visualization III </i>. Vol 1. Mathematics and Visualization. Cham: Springer; 2014:55-69. doi:<a href=\"https://doi.org/10.1007/978-3-319-04099-8_4\">10.1007/978-3-319-04099-8_4</a>","short":"J. Kasten, J. Reininghaus, W. Reich, G. Scheuermann, in:, P.-T. Bremer, I. Hotz, V. Pascucci, R. Peikert (Eds.), Topological Methods in Data Analysis and Visualization III , Springer, Cham, 2014, pp. 55–69.","apa":"Kasten, J., Reininghaus, J., Reich, W., &#38; Scheuermann, G. (2014). Toward the extraction of saddle periodic orbits. In P.-T. Bremer, I. Hotz, V. Pascucci, &#38; R. Peikert (Eds.), <i>Topological Methods in Data Analysis and Visualization III </i> (Vol. 1, pp. 55–69). Cham: Springer. <a href=\"https://doi.org/10.1007/978-3-319-04099-8_4\">https://doi.org/10.1007/978-3-319-04099-8_4</a>"},"date_created":"2022-03-21T07:11:23Z","year":"2014","acknowledgement":"First, we thank the reviewers of this paper for their ideas and critical comments. In addition, we thank Ronny Peikert and Filip Sadlo for a fruitful discussions. This research is supported by the European Commission under the TOPOSYS project FP7-ICT-318493-STREP, the European Social Fund (ESF App. No. 100098251), and the European Science Foundation under the ACAT Research Network Program.","quality_controlled":"1","volume":1,"page":"55-69","department":[{"_id":"HeEd"}],"date_published":"2014-03-19T00:00:00Z","publisher":"Springer","project":[{"grant_number":"318493","_id":"255D761E-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Topological Complex Systems"}],"abstract":[{"text":"Saddle periodic orbits are an essential and stable part of the topological skeleton of a 3D vector field. Nevertheless, there is currently no efficient algorithm to robustly extract these features. In this chapter, we present a novel technique to extract saddle periodic orbits. Exploiting the analytic properties of such an orbit, we propose a scalar measure based on the finite-time Lyapunov exponent (FTLE) that indicates its presence. Using persistent homology, we can then extract the robust cycles of this field. These cycles thereby represent the saddle periodic orbits of the given vector field. We discuss the different existing FTLE approximation schemes regarding their applicability to this specific problem and propose an adapted version of FTLE called Normalized Velocity Separation. Finally, we evaluate our method using simple analytic vector field data.","lang":"eng"}],"series_title":"Mathematics and Visualization","publication_status":"published","place":"Cham","publication":"Topological Methods in Data Analysis and Visualization III ","language":[{"iso":"eng"}],"scopus_import":"1","intvolume":"         1","editor":[{"last_name":"Bremer","full_name":"Bremer, Peer-Timo","first_name":"Peer-Timo"},{"first_name":"Ingrid","full_name":"Hotz, Ingrid","last_name":"Hotz"},{"full_name":"Pascucci, Valerio","first_name":"Valerio","last_name":"Pascucci"},{"full_name":"Peikert, Ronald","first_name":"Ronald","last_name":"Peikert"}],"title":"Toward the extraction of saddle periodic orbits","article_processing_charge":"No","date_updated":"2022-06-21T12:01:47Z","type":"book_chapter","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"None","day":"19","month":"03","publication_identifier":{"issn":["1612-3786"],"eissn":["2197-666X"],"eisbn":["9783319040998"],"isbn":["9783319040981"]},"author":[{"full_name":"Kasten, Jens","first_name":"Jens","last_name":"Kasten"},{"full_name":"Reininghaus, Jan","first_name":"Jan","id":"4505473A-F248-11E8-B48F-1D18A9856A87","last_name":"Reininghaus"},{"last_name":"Reich","full_name":"Reich, Wieland","first_name":"Wieland"},{"last_name":"Scheuermann","full_name":"Scheuermann, Gerik","first_name":"Gerik"}]},{"status":"public","type":"conference","day":"01","oa_version":"None","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","conference":{"start_date":"2014-08-05","name":"ICMS: International Congress on Mathematical Software","end_date":"2014-08-09","location":"Seoul, South Korea"},"month":"09","publication_identifier":{"eisbn":["9783662441992"],"eissn":["1611-3349"],"isbn":["9783662441985"],"issn":["0302-9743"]},"author":[{"full_name":"Bauer, Ulrich","first_name":"Ulrich","id":"2ADD483A-F248-11E8-B48F-1D18A9856A87","last_name":"Bauer","orcid":"0000-0002-9683-0724"},{"last_name":"Kerber","first_name":"Michael","full_name":"Kerber, Michael"},{"full_name":"Reininghaus, Jan","first_name":"Jan","last_name":"Reininghaus","id":"4505473A-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Wagner, Hubert","first_name":"Hubert","last_name":"Wagner"}],"publication":"ICMS 2014: International Congress on Mathematical Software","language":[{"iso":"eng"}],"scopus_import":"1","intvolume":"      8592","title":"PHAT – Persistent Homology Algorithms Toolbox","date_updated":"2023-09-20T09:42:40Z","article_processing_charge":"No","page":"137-143","department":[{"_id":"HeEd"}],"quality_controlled":"1","volume":8592,"publisher":"Springer Berlin Heidelberg","date_published":"2014-09-01T00:00:00Z","abstract":[{"text":"PHAT is a C++ library for the computation of persistent homology by matrix reduction. We aim for a simple generic design that decouples algorithms from data structures without sacrificing efficiency or user-friendliness. This makes PHAT a versatile platform for experimenting with algorithmic ideas and comparing them to state of the art implementations.","lang":"eng"}],"series_title":"LNCS","publication_status":"published","place":"Berlin, Heidelberg","doi":"10.1007/978-3-662-44199-2_24","_id":"10894","related_material":{"record":[{"status":"public","relation":"later_version","id":"1433"}]},"date_created":"2022-03-21T07:12:16Z","citation":{"apa":"Bauer, U., Kerber, M., Reininghaus, J., &#38; Wagner, H. (2014). PHAT – Persistent Homology Algorithms Toolbox. In <i>ICMS 2014: International Congress on Mathematical Software</i> (Vol. 8592, pp. 137–143). Berlin, Heidelberg: Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/978-3-662-44199-2_24\">https://doi.org/10.1007/978-3-662-44199-2_24</a>","chicago":"Bauer, Ulrich, Michael Kerber, Jan Reininghaus, and Hubert Wagner. “PHAT – Persistent Homology Algorithms Toolbox.” In <i>ICMS 2014: International Congress on Mathematical Software</i>, 8592:137–43. LNCS. Berlin, Heidelberg: Springer Berlin Heidelberg, 2014. <a href=\"https://doi.org/10.1007/978-3-662-44199-2_24\">https://doi.org/10.1007/978-3-662-44199-2_24</a>.","ista":"Bauer U, Kerber M, Reininghaus J, Wagner H. 2014. PHAT – Persistent Homology Algorithms Toolbox. ICMS 2014: International Congress on Mathematical Software. ICMS: International Congress on Mathematical SoftwareLNCS vol. 8592, 137–143.","mla":"Bauer, Ulrich, et al. “PHAT – Persistent Homology Algorithms Toolbox.” <i>ICMS 2014: International Congress on Mathematical Software</i>, vol. 8592, Springer Berlin Heidelberg, 2014, pp. 137–43, doi:<a href=\"https://doi.org/10.1007/978-3-662-44199-2_24\">10.1007/978-3-662-44199-2_24</a>.","ama":"Bauer U, Kerber M, Reininghaus J, Wagner H. PHAT – Persistent Homology Algorithms Toolbox. In: <i>ICMS 2014: International Congress on Mathematical Software</i>. Vol 8592. LNCS. Berlin, Heidelberg: Springer Berlin Heidelberg; 2014:137-143. doi:<a href=\"https://doi.org/10.1007/978-3-662-44199-2_24\">10.1007/978-3-662-44199-2_24</a>","ieee":"U. Bauer, M. Kerber, J. Reininghaus, and H. Wagner, “PHAT – Persistent Homology Algorithms Toolbox,” in <i>ICMS 2014: International Congress on Mathematical Software</i>, Seoul, South Korea, 2014, vol. 8592, pp. 137–143.","short":"U. Bauer, M. Kerber, J. Reininghaus, H. Wagner, in:, ICMS 2014: International Congress on Mathematical Software, Springer Berlin Heidelberg, Berlin, Heidelberg, 2014, pp. 137–143."},"year":"2014"},{"related_material":{"record":[{"status":"public","id":"838","relation":"dissertation_contains"}]},"ec_funded":1,"year":"2014","citation":{"apa":"Gazi, P., Pietrzak, K. Z., &#38; Rybar, M. (2014). The exact PRF-security of NMAC and HMAC. In J. Garay &#38; R. Gennaro (Eds.) (Vol. 8616, pp. 113–130). Presented at the CRYPTO: International Cryptology Conference, Santa Barbara, USA: Springer. <a href=\"https://doi.org/10.1007/978-3-662-44371-2_7\">https://doi.org/10.1007/978-3-662-44371-2_7</a>","short":"P. Gazi, K.Z. Pietrzak, M. Rybar, in:, J. Garay, R. Gennaro (Eds.), Springer, 2014, pp. 113–130.","ama":"Gazi P, Pietrzak KZ, Rybar M. The exact PRF-security of NMAC and HMAC. In: Garay J, Gennaro R, eds. Vol 8616. Springer; 2014:113-130. doi:<a href=\"https://doi.org/10.1007/978-3-662-44371-2_7\">10.1007/978-3-662-44371-2_7</a>","ieee":"P. Gazi, K. Z. Pietrzak, and M. Rybar, “The exact PRF-security of NMAC and HMAC,” presented at the CRYPTO: International Cryptology Conference, Santa Barbara, USA, 2014, vol. 8616, no. 1, pp. 113–130.","chicago":"Gazi, Peter, Krzysztof Z Pietrzak, and Michal Rybar. “The Exact PRF-Security of NMAC and HMAC.” edited by Juan Garay and Rosario Gennaro, 8616:113–30. Springer, 2014. <a href=\"https://doi.org/10.1007/978-3-662-44371-2_7\">https://doi.org/10.1007/978-3-662-44371-2_7</a>.","ista":"Gazi P, Pietrzak KZ, Rybar M. 2014. The exact PRF-security of NMAC and HMAC. CRYPTO: International Cryptology Conference, LNCS, vol. 8616, 113–130.","mla":"Gazi, Peter, et al. <i>The Exact PRF-Security of NMAC and HMAC</i>. Edited by Juan Garay and Rosario Gennaro, vol. 8616, no. 1, Springer, 2014, pp. 113–30, doi:<a href=\"https://doi.org/10.1007/978-3-662-44371-2_7\">10.1007/978-3-662-44371-2_7</a>."},"publist_id":"4955","date_created":"2018-12-11T11:55:36Z","doi":"10.1007/978-3-662-44371-2_7","_id":"2082","file_date_updated":"2020-07-14T12:45:28Z","ddc":["000","004"],"abstract":[{"lang":"eng","text":"NMAC is a mode of operation which turns a fixed input-length keyed hash function f into a variable input-length function. A practical single-key variant of NMAC called HMAC is a very popular and widely deployed message authentication code (MAC). Security proofs and attacks for NMAC can typically be lifted to HMAC. NMAC was introduced by Bellare, Canetti and Krawczyk [Crypto'96], who proved it to be a secure pseudorandom function (PRF), and thus also a MAC, assuming that (1) f is a PRF and (2) the function we get when cascading f is weakly collision-resistant. Unfortunately, HMAC is typically instantiated with cryptographic hash functions like MD5 or SHA-1 for which (2) has been found to be wrong. To restore the provable guarantees for NMAC, Bellare [Crypto'06] showed its security based solely on the assumption that f is a PRF, albeit via a non-uniform reduction. - Our first contribution is a simpler and uniform proof for this fact: If f is an ε-secure PRF (against q queries) and a δ-non-adaptively secure PRF (against q queries), then NMAC f is an (ε+ℓqδ)-secure PRF against q queries of length at most ℓ blocks each. - We then show that this ε+ℓqδ bound is basically tight. For the most interesting case where ℓqδ ≥ ε we prove this by constructing an f for which an attack with advantage ℓqδ exists. This also violates the bound O(ℓε) on the PRF-security of NMAC recently claimed by Koblitz and Menezes. - Finally, we analyze the PRF-security of a modification of NMAC called NI [An and Bellare, Crypto'99] that differs mainly by using a compression function with an additional keying input. This avoids the constant rekeying on multi-block messages in NMAC and allows for a security proof starting by the standard switch from a PRF to a random function, followed by an information-theoretic analysis. We carry out such an analysis, obtaining a tight ℓq2/2 c bound for this step, improving over the trivial bound of ℓ2q2/2c. The proof borrows combinatorial techniques originally developed for proving the security of CBC-MAC [Bellare et al., Crypto'05]."}],"publication_status":"published","date_published":"2014-01-01T00:00:00Z","publisher":"Springer","volume":8616,"quality_controlled":"1","department":[{"_id":"KrPi"}],"page":"113 - 130","project":[{"name":"Provable Security for Physical Cryptography","call_identifier":"FP7","grant_number":"259668","_id":"258C570E-B435-11E9-9278-68D0E5697425"}],"editor":[{"full_name":"Garay, Juan","first_name":"Juan","last_name":"Garay"},{"full_name":"Gennaro, Rosario","first_name":"Rosario","last_name":"Gennaro"}],"intvolume":"      8616","has_accepted_license":"1","issue":"1","oa":1,"date_updated":"2023-09-07T12:02:27Z","pubrep_id":"682","title":"The exact PRF-security of NMAC and HMAC","language":[{"iso":"eng"}],"month":"01","conference":{"name":"CRYPTO: International Cryptology Conference","start_date":"2014-08-17","location":"Santa Barbara, USA","end_date":"2014-08-21"},"file":[{"relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_size":492310,"creator":"system","date_created":"2018-12-12T10:13:17Z","date_updated":"2020-07-14T12:45:28Z","checksum":"dab6ab36a5f6af94f2b597e6404ed11d","file_name":"IST-2016-682-v1+1_578.pdf","file_id":"4999"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","oa_version":"Submitted Version","day":"01","author":[{"full_name":"Gazi, Peter","first_name":"Peter","id":"3E0BFE38-F248-11E8-B48F-1D18A9856A87","last_name":"Gazi"},{"id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","last_name":"Pietrzak","orcid":"0000-0002-9139-1654","full_name":"Pietrzak, Krzysztof Z","first_name":"Krzysztof Z"},{"last_name":"Rybar","id":"2B3E3DE8-F248-11E8-B48F-1D18A9856A87","first_name":"Michal","full_name":"Rybar, Michal"}],"status":"public","type":"conference","alternative_title":["LNCS"]},{"publist_id":"4954","date_created":"2018-12-11T11:55:36Z","citation":{"apa":"Lagator, M., Morgan, A., Neve, P., &#38; Colegrave, N. (2014). Role of sex and migration in adaptation to sink environments. <i>Evolution</i>. Wiley. <a href=\"https://doi.org/10.1111/evo.12440\">https://doi.org/10.1111/evo.12440</a>","ista":"Lagator M, Morgan A, Neve P, Colegrave N. 2014. Role of sex and migration in adaptation to sink environments. Evolution. 68(8), 2296–2305.","chicago":"Lagator, Mato, Andrew Morgan, Paul Neve, and Nick Colegrave. “Role of Sex and Migration in Adaptation to Sink Environments.” <i>Evolution</i>. Wiley, 2014. <a href=\"https://doi.org/10.1111/evo.12440\">https://doi.org/10.1111/evo.12440</a>.","mla":"Lagator, Mato, et al. “Role of Sex and Migration in Adaptation to Sink Environments.” <i>Evolution</i>, vol. 68, no. 8, Wiley, 2014, pp. 2296–305, doi:<a href=\"https://doi.org/10.1111/evo.12440\">10.1111/evo.12440</a>.","short":"M. Lagator, A. Morgan, P. Neve, N. Colegrave, Evolution 68 (2014) 2296–2305.","ieee":"M. Lagator, A. Morgan, P. Neve, and N. Colegrave, “Role of sex and migration in adaptation to sink environments,” <i>Evolution</i>, vol. 68, no. 8. Wiley, pp. 2296–2305, 2014.","ama":"Lagator M, Morgan A, Neve P, Colegrave N. Role of sex and migration in adaptation to sink environments. <i>Evolution</i>. 2014;68(8):2296-2305. doi:<a href=\"https://doi.org/10.1111/evo.12440\">10.1111/evo.12440</a>"},"year":"2014","acknowledgement":"The authors are grateful to the Leverhulme Trust (F/00 215/AW) for funding this work.","related_material":{"record":[{"status":"public","relation":"research_data","id":"9747"}]},"_id":"2083","article_type":"original","file_date_updated":"2020-07-14T12:45:28Z","doi":"10.1111/evo.12440","publication_status":"published","abstract":[{"text":"Understanding the effects of sex and migration on adaptation to novel environments remains a key problem in evolutionary biology. Using a single-cell alga Chlamydomonas reinhardtii, we investigated how sex and migration affected rates of evolutionary rescue in a sink environment, and subsequent changes in fitness following evolutionary rescue. We show that sex and migration affect both the rate of evolutionary rescue and subsequent adaptation. However, their combined effects change as the populations adapt to a sink habitat. Both sex and migration independently increased rates of evolutionary rescue, but the effect of sex on subsequent fitness improvements, following initial rescue, changed with migration, as sex was beneficial in the absence of migration but constraining adaptation when combined with migration. These results suggest that sex and migration are beneficial during the initial stages of adaptation, but can become detrimental as the population adapts to its environment.","lang":"eng"}],"ddc":["570"],"quality_controlled":"1","volume":68,"department":[{"_id":"CaGu"}],"page":"2296 - 2305","date_published":"2014-04-25T00:00:00Z","publisher":"Wiley","title":"Role of sex and migration in adaptation to sink environments","issue":"8","article_processing_charge":"No","date_updated":"2023-02-23T14:06:51Z","oa":1,"intvolume":"        68","has_accepted_license":"1","scopus_import":1,"language":[{"iso":"eng"}],"publication":"Evolution","author":[{"full_name":"Lagator, Mato","first_name":"Mato","id":"345D25EC-F248-11E8-B48F-1D18A9856A87","last_name":"Lagator"},{"last_name":"Morgan","full_name":"Morgan, Andrew","first_name":"Andrew"},{"full_name":"Neve, Paul","first_name":"Paul","last_name":"Neve"},{"full_name":"Colegrave, Nick","first_name":"Nick","last_name":"Colegrave"}],"file":[{"creator":"dernst","access_level":"open_access","file_size":467254,"relation":"main_file","content_type":"application/pdf","checksum":"8d459b07e4a11bb5fde92d969184fe48","file_name":"2014_Evolution_Lagator.pdf","file_id":"7845","date_created":"2020-05-14T16:40:31Z","date_updated":"2020-07-14T12:45:28Z"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"25","oa_version":"Published Version","month":"04","status":"public","type":"journal_article"},{"quality_controlled":"1","volume":33,"department":[{"_id":"HaJa"}],"page":"1713 - 1726","date_published":"2014-07-01T00:00:00Z","publisher":"Wiley-Blackwell","abstract":[{"lang":"eng","text":"Receptor tyrosine kinases (RTKs) are a large family of cell surface receptors that sense growth factors and hormones and regulate a variety of cell behaviours in health and disease. Contactless activation of RTKs with spatial and temporal precision is currently not feasible. Here, we generated RTKs that are insensitive to endogenous ligands but can be selectively activated by low-intensity blue light. We screened light-oxygen-voltage (LOV)-sensing domains for their ability to activate RTKs by light-activated dimerization. Incorporation of LOV domains found in aureochrome photoreceptors of stramenopiles resulted in robust activation of the fibroblast growth factor receptor 1 (FGFR1), epidermal growth factor receptor (EGFR) and rearranged during transfection (RET). In human cancer and endothelial cells, light induced cellular signalling with spatial and temporal precision. Furthermore, light faithfully mimicked complex mitogenic and morphogenic cell behaviour induced by growth factors. RTKs under optical control (Opto-RTKs) provide a powerful optogenetic approach to actuate cellular signals and manipulate cell behaviour."}],"publication_status":"published","doi":"10.15252/embj.201387695","_id":"2084","related_material":{"record":[{"status":"public","id":"418","relation":"dissertation_contains"}]},"publist_id":"4953","date_created":"2018-12-11T11:55:37Z","citation":{"ieee":"M. Grusch <i>et al.</i>, “Spatio-temporally precise activation of engineered receptor tyrosine kinases by light,” <i>EMBO Journal</i>, vol. 33, no. 15. Wiley-Blackwell, pp. 1713–1726, 2014.","ama":"Grusch M, Schelch K, Riedler R, et al. Spatio-temporally precise activation of engineered receptor tyrosine kinases by light. <i>EMBO Journal</i>. 2014;33(15):1713-1726. doi:<a href=\"https://doi.org/10.15252/embj.201387695\">10.15252/embj.201387695</a>","short":"M. Grusch, K. Schelch, R. Riedler, E. Gschaider-Reichhart, C. Differ, W. Berger, Á. Inglés Prieto, H.L. Janovjak, EMBO Journal 33 (2014) 1713–1726.","ista":"Grusch M, Schelch K, Riedler R, Gschaider-Reichhart E, Differ C, Berger W, Inglés Prieto Á, Janovjak HL. 2014. Spatio-temporally precise activation of engineered receptor tyrosine kinases by light. EMBO Journal. 33(15), 1713–1726.","chicago":"Grusch, Michael, Karin Schelch, Robert Riedler, Eva Gschaider-Reichhart, Christopher Differ, Walter Berger, Álvaro Inglés Prieto, and Harald L Janovjak. “Spatio-Temporally Precise Activation of Engineered Receptor Tyrosine Kinases by Light.” <i>EMBO Journal</i>. Wiley-Blackwell, 2014. <a href=\"https://doi.org/10.15252/embj.201387695\">https://doi.org/10.15252/embj.201387695</a>.","mla":"Grusch, Michael, et al. “Spatio-Temporally Precise Activation of Engineered Receptor Tyrosine Kinases by Light.” <i>EMBO Journal</i>, vol. 33, no. 15, Wiley-Blackwell, 2014, pp. 1713–26, doi:<a href=\"https://doi.org/10.15252/embj.201387695\">10.15252/embj.201387695</a>.","apa":"Grusch, M., Schelch, K., Riedler, R., Gschaider-Reichhart, E., Differ, C., Berger, W., … Janovjak, H. L. (2014). Spatio-temporally precise activation of engineered receptor tyrosine kinases by light. <i>EMBO Journal</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.15252/embj.201387695\">https://doi.org/10.15252/embj.201387695</a>"},"year":"2014","acknowledgement":"European Union Seventh Framework Programme; Human Frontier Science Program; Oesterreichische Nationalbank Anniversary Fund 14211; Austrian Research Promotion Agency; FemTech","type":"journal_article","status":"public","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","main_file_link":[{"open_access":"1","url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC4194103/"}],"day":"01","oa_version":"Submitted Version","month":"07","author":[{"first_name":"Michael","full_name":"Grusch, Michael","last_name":"Grusch"},{"last_name":"Schelch","first_name":"Karin","full_name":"Schelch, Karin"},{"full_name":"Riedler, Robert","first_name":"Robert","last_name":"Riedler"},{"full_name":"Gschaider-Reichhart, Eva","first_name":"Eva","id":"3FEE232A-F248-11E8-B48F-1D18A9856A87","last_name":"Gschaider-Reichhart","orcid":"0000-0002-7218-7738"},{"last_name":"Differ","first_name":"Christopher","full_name":"Differ, Christopher"},{"last_name":"Berger","first_name":"Walter","full_name":"Berger, Walter"},{"orcid":"0000-0002-5409-8571","last_name":"Inglés Prieto","id":"2A9DB292-F248-11E8-B48F-1D18A9856A87","first_name":"Álvaro","full_name":"Inglés Prieto, Álvaro"},{"first_name":"Harald L","full_name":"Janovjak, Harald L","orcid":"0000-0002-8023-9315","last_name":"Janovjak","id":"33BA6C30-F248-11E8-B48F-1D18A9856A87"}],"publication":"EMBO Journal","language":[{"iso":"eng"}],"scopus_import":1,"intvolume":"        33","title":"Spatio-temporally precise activation of engineered receptor tyrosine kinases by light","issue":"15","date_updated":"2023-09-07T12:49:09Z","oa":1},{"doi":"10.1371/journal.pone.0103989","_id":"2086","file_date_updated":"2020-07-14T12:45:28Z","related_material":{"record":[{"status":"public","relation":"research_data","id":"9888"}]},"article_number":"e103989","publist_id":"4949","date_created":"2018-12-11T11:55:37Z","citation":{"mla":"Wolf, Stephan, et al. “So near and yet so Far: Harmonic Radar Reveals Reduced Homing Ability of Nosema Infected Honeybees.” <i>PLoS One</i>, vol. 9, no. 8, e103989, Public Library of Science, 2014, doi:<a href=\"https://doi.org/10.1371/journal.pone.0103989\">10.1371/journal.pone.0103989</a>.","chicago":"Wolf, Stephan, Dino Mcmahon, Ka Lim, Christopher Pull, Suzanne Clark, Robert Paxton, and Juliet Osborne. “So near and yet so Far: Harmonic Radar Reveals Reduced Homing Ability of Nosema Infected Honeybees.” <i>PLoS One</i>. Public Library of Science, 2014. <a href=\"https://doi.org/10.1371/journal.pone.0103989\">https://doi.org/10.1371/journal.pone.0103989</a>.","ista":"Wolf S, Mcmahon D, Lim K, Pull C, Clark S, Paxton R, Osborne J. 2014. So near and yet so far: Harmonic radar reveals reduced homing ability of Nosema infected honeybees. PLoS One. 9(8), e103989.","short":"S. Wolf, D. Mcmahon, K. Lim, C. Pull, S. Clark, R. Paxton, J. Osborne, PLoS One 9 (2014).","ama":"Wolf S, Mcmahon D, Lim K, et al. So near and yet so far: Harmonic radar reveals reduced homing ability of Nosema infected honeybees. <i>PLoS One</i>. 2014;9(8). doi:<a href=\"https://doi.org/10.1371/journal.pone.0103989\">10.1371/journal.pone.0103989</a>","ieee":"S. Wolf <i>et al.</i>, “So near and yet so far: Harmonic radar reveals reduced homing ability of Nosema infected honeybees,” <i>PLoS One</i>, vol. 9, no. 8. Public Library of Science, 2014.","apa":"Wolf, S., Mcmahon, D., Lim, K., Pull, C., Clark, S., Paxton, R., &#38; Osborne, J. (2014). So near and yet so far: Harmonic radar reveals reduced homing ability of Nosema infected honeybees. <i>PLoS One</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pone.0103989\">https://doi.org/10.1371/journal.pone.0103989</a>"},"year":"2014","acknowledgement":"This study was funded jointly by a grant from BBSRC, Defra, NERC, the Scottish Government and the Wellcome Trust, under the Insect Pollinators Initiative (grant numbers BB/I00097/1 and BB/I000100/1). Rothamsted Research is a national institute of bioscience strategically funded by the UK Biotechnology and Biological Sciences Research Council (BBSRC).","quality_controlled":"1","volume":9,"department":[{"_id":"SyCr"}],"license":"https://creativecommons.org/licenses/by/4.0/","date_published":"2014-08-06T00:00:00Z","publisher":"Public Library of Science","abstract":[{"lang":"eng","text":"Pathogens may gain a fitness advantage through manipulation of the behaviour of their hosts. Likewise, host behavioural changes can be a defence mechanism, counteracting the impact of pathogens on host fitness. We apply harmonic radar technology to characterize the impact of an emerging pathogen - Nosema ceranae (Microsporidia) - on honeybee (Apis mellifera) flight and orientation performance in the field. Honeybees are the most important commercial pollinators. Emerging diseases have been proposed to play a prominent role in colony decline, partly through sub-lethal behavioural manipulation of their hosts. We found that homing success was significantly reduced in diseased (65.8%) versus healthy foragers (92.5%). Although lost bees had significantly reduced continuous flight times and prolonged resting times, other flight characteristics and navigational abilities showed no significant difference between infected and non-infected bees. Our results suggest that infected bees express normal flight characteristics but are constrained in their homing ability, potentially compromising the colony by reducing its resource inputs, but also counteracting the intra-colony spread of infection. We provide the first high-resolution analysis of sub-lethal effects of an emerging disease on insect flight behaviour. The potential causes and the implications for both host and parasite are discussed."}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"ddc":["570"],"publication_status":"published","publication":"PLoS One","language":[{"iso":"eng"}],"intvolume":"         9","scopus_import":1,"has_accepted_license":"1","title":"So near and yet so far: Harmonic radar reveals reduced homing ability of Nosema infected honeybees","issue":"8","oa":1,"pubrep_id":"437","date_updated":"2023-02-23T14:11:56Z","type":"journal_article","status":"public","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","file":[{"date_updated":"2020-07-14T12:45:28Z","date_created":"2018-12-12T10:13:55Z","checksum":"2fc62c6739eada4bddf026afbae669db","file_id":"5042","file_name":"IST-2016-437-v1+1_journal.pone.0103989.pdf","access_level":"open_access","relation":"main_file","file_size":1013386,"content_type":"application/pdf","creator":"system"}],"day":"06","oa_version":"Published Version","month":"08","author":[{"full_name":"Wolf, Stephan","first_name":"Stephan","last_name":"Wolf"},{"first_name":"Dino","full_name":"Mcmahon, Dino","last_name":"Mcmahon"},{"full_name":"Lim, Ka","first_name":"Ka","last_name":"Lim"},{"last_name":"Pull","id":"3C7F4840-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-1122-3982","full_name":"Pull, Christopher","first_name":"Christopher"},{"full_name":"Clark, Suzanne","first_name":"Suzanne","last_name":"Clark"},{"last_name":"Paxton","first_name":"Robert","full_name":"Paxton, Robert"},{"last_name":"Osborne","first_name":"Juliet","full_name":"Osborne, Juliet"}]},{"status":"public","type":"journal_article","author":[{"first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Henzinger, Monika H","first_name":"Monika H","last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530"}],"month":"05","main_file_link":[{"open_access":"1","url":"https://eprints.cs.univie.ac.at/3933/"}],"day":"01","oa_version":"Submitted Version","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","language":[{"iso":"eng"}],"publication":"Journal of the ACM","oa":1,"date_updated":"2025-06-02T08:53:48Z","article_processing_charge":"No","issue":"3","title":"Efficient and dynamic algorithms for alternating Büchi games and maximal end-component decomposition","intvolume":"        61","scopus_import":"1","project":[{"call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003","_id":"25892FC0-B435-11E9-9278-68D0E5697425"},{"name":"Game Theory","call_identifier":"FWF","grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"publisher":"ACM","date_published":"2014-05-01T00:00:00Z","department":[{"_id":"KrCh"}],"volume":61,"quality_controlled":"1","publication_status":"published","abstract":[{"lang":"eng","text":"The computation of the winning set for Büchi objectives in alternating games on graphs is a central problem in computer-aided verification with a large number of applications. The long-standing best known upper bound for solving the problem is Õ(n ⋅ m), where n is the number of vertices and m is the number of edges in the graph. We are the first to break the Õ(n ⋅ m) boundary by presenting a new technique that reduces the running time to O(n2). This bound also leads to O(n2)-time algorithms for computing the set of almost-sure winning vertices for Büchi objectives (1) in alternating games with probabilistic transitions (improving an earlier bound of Õ(n ⋅ m)), (2) in concurrent graph games with constant actions (improving an earlier bound of O(n3)), and (3) in Markov decision processes (improving for m&gt;n4/3 an earlier bound of O(m ⋅ √m)). We then show how to maintain the winning set for Büchi objectives in alternating games under a sequence of edge insertions or a sequence of edge deletions in O(n) amortized time per operation. Our algorithms are the first dynamic algorithms for this problem. We then consider another core graph theoretic problem in verification of probabilistic systems, namely computing the maximal end-component decomposition of a graph. We present two improved static algorithms for the maximal end-component decomposition problem. Our first algorithm is an O(m ⋅ √m)-time algorithm, and our second algorithm is an O(n2)-time algorithm which is obtained using the same technique as for alternating Büchi games. Thus, we obtain an O(min &amp;lcu;m ⋅ √m,n2})-time algorithm improving the long-standing O(n ⋅ m) time bound. Finally, we show how to maintain the maximal end-component decomposition of a graph under a sequence of edge insertions or a sequence of edge deletions in O(n) amortized time per edge deletion, and O(m) worst-case time per edge insertion. Again, our algorithms are the first dynamic algorithms for this problem."}],"_id":"2141","doi":"10.1145/2597631","year":"2014","date_created":"2018-12-11T11:55:57Z","publist_id":"4883","citation":{"apa":"Chatterjee, K., &#38; Henzinger, M. H. (2014). Efficient and dynamic algorithms for alternating Büchi games and maximal end-component decomposition. <i>Journal of the ACM</i>. ACM. <a href=\"https://doi.org/10.1145/2597631\">https://doi.org/10.1145/2597631</a>","chicago":"Chatterjee, Krishnendu, and Monika H Henzinger. “Efficient and Dynamic Algorithms for Alternating Büchi Games and Maximal End-Component Decomposition.” <i>Journal of the ACM</i>. ACM, 2014. <a href=\"https://doi.org/10.1145/2597631\">https://doi.org/10.1145/2597631</a>.","mla":"Chatterjee, Krishnendu, and Monika H. Henzinger. “Efficient and Dynamic Algorithms for Alternating Büchi Games and Maximal End-Component Decomposition.” <i>Journal of the ACM</i>, vol. 61, no. 3, a15, ACM, 2014, doi:<a href=\"https://doi.org/10.1145/2597631\">10.1145/2597631</a>.","ista":"Chatterjee K, Henzinger MH. 2014. Efficient and dynamic algorithms for alternating Büchi games and maximal end-component decomposition. Journal of the ACM. 61(3), a15.","short":"K. Chatterjee, M.H. Henzinger, Journal of the ACM 61 (2014).","ieee":"K. Chatterjee and M. H. Henzinger, “Efficient and dynamic algorithms for alternating Büchi games and maximal end-component decomposition,” <i>Journal of the ACM</i>, vol. 61, no. 3. ACM, 2014.","ama":"Chatterjee K, Henzinger MH. Efficient and dynamic algorithms for alternating Büchi games and maximal end-component decomposition. <i>Journal of the ACM</i>. 2014;61(3). doi:<a href=\"https://doi.org/10.1145/2597631\">10.1145/2597631</a>"},"ec_funded":1,"article_number":"a15","related_material":{"record":[{"id":"3165","relation":"earlier_version","status":"public"}]}},{"year":"2014","oa":1,"date_updated":"2021-01-12T06:55:38Z","citation":{"apa":"Bauer, U., &#38; Lesnick, M. (2014). Induced matchings of barcodes and the algebraic stability of persistence. In <i>Proceedings of the Annual Symposium on Computational Geometry</i> (pp. 355–364). Kyoto, Japan: ACM. <a href=\"https://doi.org/10.1145/2582112.2582168\">https://doi.org/10.1145/2582112.2582168</a>","mla":"Bauer, Ulrich, and Michael Lesnick. “Induced Matchings of Barcodes and the Algebraic Stability of Persistence.” <i>Proceedings of the Annual Symposium on Computational Geometry</i>, ACM, 2014, pp. 355–64, doi:<a href=\"https://doi.org/10.1145/2582112.2582168\">10.1145/2582112.2582168</a>.","ista":"Bauer U, Lesnick M. 2014. Induced matchings of barcodes and the algebraic stability of persistence. Proceedings of the Annual Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, 355–364.","chicago":"Bauer, Ulrich, and Michael Lesnick. “Induced Matchings of Barcodes and the Algebraic Stability of Persistence.” In <i>Proceedings of the Annual Symposium on Computational Geometry</i>, 355–64. ACM, 2014. <a href=\"https://doi.org/10.1145/2582112.2582168\">https://doi.org/10.1145/2582112.2582168</a>.","short":"U. Bauer, M. Lesnick, in:, Proceedings of the Annual Symposium on Computational Geometry, ACM, 2014, pp. 355–364.","ama":"Bauer U, Lesnick M. Induced matchings of barcodes and the algebraic stability of persistence. In: <i>Proceedings of the Annual Symposium on Computational Geometry</i>. ACM; 2014:355-364. doi:<a href=\"https://doi.org/10.1145/2582112.2582168\">10.1145/2582112.2582168</a>","ieee":"U. Bauer and M. Lesnick, “Induced matchings of barcodes and the algebraic stability of persistence,” in <i>Proceedings of the Annual Symposium on Computational Geometry</i>, Kyoto, Japan, 2014, pp. 355–364."},"date_created":"2018-12-11T11:56:01Z","publist_id":"4853","title":"Induced matchings of barcodes and the algebraic stability of persistence","scopus_import":1,"ec_funded":1,"_id":"2153","language":[{"iso":"eng"}],"publication":"Proceedings of the Annual Symposium on Computational Geometry","doi":"10.1145/2582112.2582168","author":[{"last_name":"Bauer","id":"2ADD483A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9683-0724","full_name":"Bauer, Ulrich","first_name":"Ulrich"},{"full_name":"Lesnick, Michael","first_name":"Michael","last_name":"Lesnick"}],"publication_status":"published","month":"06","conference":{"name":"SoCG: Symposium on Computational Geometry","start_date":"2014-06-08","location":"Kyoto, Japan","end_date":"2014-06-11"},"abstract":[{"lang":"eng","text":"We define a simple, explicit map sending a morphism f : M → N of pointwise finite dimensional persistence modules to a matching between the barcodes of M and N. Our main result is that, in a precise sense, the quality of this matching is tightly controlled by the lengths of the longest intervals in the barcodes of ker f and coker f . As an immediate corollary, we obtain a new proof of the algebraic stability theorem for persistence barcodes [5, 9], a fundamental result in the theory of persistent homology. In contrast to previous proofs, ours shows explicitly how a δ-interleaving morphism between two persistence modules induces a δ-matching between the barcodes of the two modules. Our main result also specializes to a structure theorem for submodules and quotients of persistence modules. Copyright is held by the owner/author(s)."}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","day":"01","oa_version":"Submitted Version","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1311.3681"}],"project":[{"grant_number":"318493","_id":"255D761E-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Topological Complex Systems"}],"type":"conference","status":"public","date_published":"2014-06-01T00:00:00Z","publisher":"ACM","quality_controlled":"1","department":[{"_id":"HeEd"}],"page":"355 - 364"},{"author":[{"last_name":"Matoušek","full_name":"Matoušek, Jiří","first_name":"Jiří"},{"id":"36690CA2-F248-11E8-B48F-1D18A9856A87","last_name":"Wagner","orcid":"0000-0002-1494-0568","first_name":"Uli","full_name":"Wagner, Uli"}],"month":"07","oa_version":"Submitted Version","day":"01","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1102.3515"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","type":"journal_article","status":"public","oa":1,"date_updated":"2021-01-12T06:55:38Z","issue":"1","title":"On Gromov's method of selecting heavily covered points","scopus_import":1,"intvolume":"        52","language":[{"iso":"eng"}],"publication":"Discrete & Computational Geometry","publication_status":"published","abstract":[{"text":"A result of Boros and Füredi (d = 2) and of Bárány (arbitrary d) asserts that for every d there exists cd &gt; 0 such that for every n-point set P ⊂ ℝd, some point of ℝd is covered by at least (Formula presented.) of the d-simplices spanned by the points of P. The largest possible value of cd has been the subject of ongoing research. Recently Gromov improved the existing lower bounds considerably by introducing a new, topological proof method. We provide an exposition of the combinatorial component of Gromov's approach, in terms accessible to combinatorialists and discrete geometers, and we investigate the limits of his method. In particular, we give tighter bounds on the cofilling profiles for the (n - 1)-simplex. These bounds yield a minor improvement over Gromov's lower bounds on cd for large d, but they also show that the room for further improvement through the cofilling profiles alone is quite small. We also prove a slightly better lower bound for c3 by an approach using an additional structure besides the cofilling profiles. We formulate a combinatorial extremal problem whose solution might perhaps lead to a tight lower bound for cd.","lang":"eng"}],"project":[{"name":"Embeddings in Higher Dimensions: Algorithms and Combinatorics","grant_number":"PP00P2_138948","_id":"25FA3206-B435-11E9-9278-68D0E5697425"}],"publisher":"Springer","date_published":"2014-07-01T00:00:00Z","department":[{"_id":"UlWa"}],"page":"1 - 33","quality_controlled":"1","volume":52,"acknowledgement":"Swiss National Science Foundation (SNF 200021-125309, 200020-138230, 200020-12507)","year":"2014","date_created":"2018-12-11T11:56:01Z","citation":{"mla":"Matoušek, Jiří, and Uli Wagner. “On Gromov’s Method of Selecting Heavily Covered Points.” <i>Discrete &#38; Computational Geometry</i>, vol. 52, no. 1, Springer, 2014, pp. 1–33, doi:<a href=\"https://doi.org/10.1007/s00454-014-9584-7\">10.1007/s00454-014-9584-7</a>.","ista":"Matoušek J, Wagner U. 2014. On Gromov’s method of selecting heavily covered points. Discrete &#38; Computational Geometry. 52(1), 1–33.","chicago":"Matoušek, Jiří, and Uli Wagner. “On Gromov’s Method of Selecting Heavily Covered Points.” <i>Discrete &#38; Computational Geometry</i>. Springer, 2014. <a href=\"https://doi.org/10.1007/s00454-014-9584-7\">https://doi.org/10.1007/s00454-014-9584-7</a>.","ama":"Matoušek J, Wagner U. On Gromov’s method of selecting heavily covered points. <i>Discrete &#38; Computational Geometry</i>. 2014;52(1):1-33. doi:<a href=\"https://doi.org/10.1007/s00454-014-9584-7\">10.1007/s00454-014-9584-7</a>","ieee":"J. Matoušek and U. Wagner, “On Gromov’s method of selecting heavily covered points,” <i>Discrete &#38; Computational Geometry</i>, vol. 52, no. 1. Springer, pp. 1–33, 2014.","short":"J. Matoušek, U. Wagner, Discrete &#38; Computational Geometry 52 (2014) 1–33.","apa":"Matoušek, J., &#38; Wagner, U. (2014). On Gromov’s method of selecting heavily covered points. <i>Discrete &#38; Computational Geometry</i>. Springer. <a href=\"https://doi.org/10.1007/s00454-014-9584-7\">https://doi.org/10.1007/s00454-014-9584-7</a>"},"publist_id":"4852","_id":"2154","doi":"10.1007/s00454-014-9584-7"},{"publication_status":"published","abstract":[{"text":"Given a finite set of points in Rn and a positive radius, we study the Čech, Delaunay-Čech, alpha, and wrap complexes as instances of a generalized discrete Morse theory. We prove that the latter three complexes are simple-homotopy equivalent. Our results have applications in topological data analysis and in the reconstruction of shapes from sampled data. Copyright is held by the owner/author(s).","lang":"eng"}],"project":[{"call_identifier":"FP7","name":"Topological Complex Systems","grant_number":"318493","_id":"255D761E-B435-11E9-9278-68D0E5697425"}],"date_published":"2014-06-01T00:00:00Z","publisher":"ACM","quality_controlled":"1","department":[{"_id":"HeEd"}],"page":"484 - 490","year":"2014","acknowledgement":"This research is partially supported by ESF under the ACAT Research Network Programme, and by the Russian Government under mega project 11.G34.31.0053","publist_id":"4851","citation":{"ama":"Bauer U, Edelsbrunner H. The morse theory of Čech and Delaunay filtrations. In: <i>Proceedings of the Annual Symposium on Computational Geometry</i>. ACM; 2014:484-490. doi:<a href=\"https://doi.org/10.1145/2582112.2582167\">10.1145/2582112.2582167</a>","ieee":"U. Bauer and H. Edelsbrunner, “The morse theory of Čech and Delaunay filtrations,” in <i>Proceedings of the Annual Symposium on Computational Geometry</i>, Kyoto, Japan, 2014, pp. 484–490.","short":"U. Bauer, H. Edelsbrunner, in:, Proceedings of the Annual Symposium on Computational Geometry, ACM, 2014, pp. 484–490.","chicago":"Bauer, Ulrich, and Herbert Edelsbrunner. “The Morse Theory of Čech and Delaunay Filtrations.” In <i>Proceedings of the Annual Symposium on Computational Geometry</i>, 484–90. ACM, 2014. <a href=\"https://doi.org/10.1145/2582112.2582167\">https://doi.org/10.1145/2582112.2582167</a>.","mla":"Bauer, Ulrich, and Herbert Edelsbrunner. “The Morse Theory of Čech and Delaunay Filtrations.” <i>Proceedings of the Annual Symposium on Computational Geometry</i>, ACM, 2014, pp. 484–90, doi:<a href=\"https://doi.org/10.1145/2582112.2582167\">10.1145/2582112.2582167</a>.","ista":"Bauer U, Edelsbrunner H. 2014. The morse theory of Čech and Delaunay filtrations. Proceedings of the Annual Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, 484–490.","apa":"Bauer, U., &#38; Edelsbrunner, H. (2014). The morse theory of Čech and Delaunay filtrations. In <i>Proceedings of the Annual Symposium on Computational Geometry</i> (pp. 484–490). Kyoto, Japan: ACM. <a href=\"https://doi.org/10.1145/2582112.2582167\">https://doi.org/10.1145/2582112.2582167</a>"},"date_created":"2018-12-11T11:56:01Z","ec_funded":1,"_id":"2155","doi":"10.1145/2582112.2582167","author":[{"last_name":"Bauer","id":"2ADD483A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9683-0724","full_name":"Bauer, Ulrich","first_name":"Ulrich"},{"first_name":"Herbert","full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833"}],"month":"06","conference":{"start_date":"2014-06-08","name":"SoCG: Symposium on Computational Geometry","end_date":"2014-06-11","location":"Kyoto, Japan"},"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","oa_version":"Submitted Version","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1312.1231"}],"day":"01","status":"public","type":"conference","date_updated":"2021-01-12T06:55:38Z","oa":1,"title":"The morse theory of Čech and Delaunay filtrations","scopus_import":1,"language":[{"iso":"eng"}],"publication":"Proceedings of the Annual Symposium on Computational Geometry"},{"language":[{"iso":"eng"}],"publication":"Proceedings of the Annual Symposium on Computational Geometry","title":"Measuring distance between Reeb graphs","date_updated":"2021-01-12T06:55:39Z","oa":1,"scopus_import":1,"type":"conference","status":"public","author":[{"id":"2ADD483A-F248-11E8-B48F-1D18A9856A87","last_name":"Bauer","orcid":"0000-0002-9683-0724","full_name":"Bauer, Ulrich","first_name":"Ulrich"},{"last_name":"Ge","first_name":"Xiaoyin","full_name":"Ge, Xiaoyin"},{"full_name":"Wang, Yusu","first_name":"Yusu","last_name":"Wang"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","day":"01","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1307.2839"}],"oa_version":"Submitted Version","month":"06","conference":{"end_date":"2014-06-11","location":"Kyoto, Japan","start_date":"2014-06-08","name":"SoCG: Symposium on Computational Geometry"},"_id":"2156","doi":"10.1145/2582112.2582169","citation":{"mla":"Bauer, Ulrich, et al. “Measuring Distance between Reeb Graphs.” <i>Proceedings of the Annual Symposium on Computational Geometry</i>, ACM, 2014, pp. 464–73, doi:<a href=\"https://doi.org/10.1145/2582112.2582169\">10.1145/2582112.2582169</a>.","chicago":"Bauer, Ulrich, Xiaoyin Ge, and Yusu Wang. “Measuring Distance between Reeb Graphs.” In <i>Proceedings of the Annual Symposium on Computational Geometry</i>, 464–73. ACM, 2014. <a href=\"https://doi.org/10.1145/2582112.2582169\">https://doi.org/10.1145/2582112.2582169</a>.","ista":"Bauer U, Ge X, Wang Y. 2014. Measuring distance between Reeb graphs. Proceedings of the Annual Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, 464–473.","ama":"Bauer U, Ge X, Wang Y. Measuring distance between Reeb graphs. In: <i>Proceedings of the Annual Symposium on Computational Geometry</i>. ACM; 2014:464-473. doi:<a href=\"https://doi.org/10.1145/2582112.2582169\">10.1145/2582112.2582169</a>","ieee":"U. Bauer, X. Ge, and Y. Wang, “Measuring distance between Reeb graphs,” in <i>Proceedings of the Annual Symposium on Computational Geometry</i>, Kyoto, Japan, 2014, pp. 464–473.","short":"U. Bauer, X. Ge, Y. Wang, in:, Proceedings of the Annual Symposium on Computational Geometry, ACM, 2014, pp. 464–473.","apa":"Bauer, U., Ge, X., &#38; Wang, Y. (2014). Measuring distance between Reeb graphs. In <i>Proceedings of the Annual Symposium on Computational Geometry</i> (pp. 464–473). Kyoto, Japan: ACM. <a href=\"https://doi.org/10.1145/2582112.2582169\">https://doi.org/10.1145/2582112.2582169</a>"},"publist_id":"4850","date_created":"2018-12-11T11:56:02Z","year":"2014","acknowledgement":"National Science Foundation under grants CCF-1319406, CCF-1116258.","ec_funded":1,"project":[{"call_identifier":"FP7","name":"Topological Complex Systems","grant_number":"318493","_id":"255D761E-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","department":[{"_id":"HeEd"}],"page":"464 - 473","date_published":"2014-06-01T00:00:00Z","publisher":"ACM","publication_status":"published","abstract":[{"text":"We propose a metric for Reeb graphs, called the functional distortion distance. Under this distance, the Reeb graph is stable against small changes of input functions. At the same time, it remains discriminative at differentiating input functions. In particular, the main result is that the functional distortion distance between two Reeb graphs is bounded from below by the bottleneck distance between both the ordinary and extended persistence diagrams for appropriate dimensions. As an application of our results, we analyze a natural simplification scheme for Reeb graphs, and show that persistent features in Reeb graph remains persistent under simplification. Understanding the stability of important features of the Reeb graph under simplification is an interesting problem on its own right, and critical to the practical usage of Reeb graphs. Copyright is held by the owner/author(s).","lang":"eng"}]},{"page":"78 - 84","department":[{"_id":"UlWa"}],"quality_controlled":"1","publisher":"ACM","status":"public","date_published":"2014-06-01T00:00:00Z","type":"conference","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1402.0815"}],"oa_version":"Submitted Version","day":"01","abstract":[{"text":"We show that the following algorithmic problem is decidable: given a 2-dimensional simplicial complex, can it be embedded (topologically, or equivalently, piecewise linearly) in ℝ3? By a known reduction, it suffices to decide the embeddability of a given triangulated 3-manifold X into the 3-sphere S3. The main step, which allows us to simplify X and recurse, is in proving that if X can be embedded in S3, then there is also an embedding in which X has a short meridian, i.e., an essential curve in the boundary of X bounding a disk in S3 nX with length bounded by a computable function of the number of tetrahedra of X.","lang":"eng"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","conference":{"start_date":"2014-06-08","name":"SoCG: Symposium on Computational Geometry","end_date":"2014-06-11","location":"Kyoto, Japan"},"month":"06","publication_status":"published","author":[{"full_name":"Matoušek, Jiří","first_name":"Jiří","last_name":"Matoušek"},{"last_name":"Sedgwick","first_name":"Eric","full_name":"Sedgwick, Eric"},{"first_name":"Martin","full_name":"Tancer, Martin","last_name":"Tancer","id":"38AC689C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1191-6714"},{"last_name":"Wagner","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1494-0568","full_name":"Wagner, Uli","first_name":"Uli"}],"doi":"10.1145/2582112.2582137","publication":"Proceedings of the Annual Symposium on Computational Geometry","language":[{"iso":"eng"}],"_id":"2157","related_material":{"record":[{"status":"public","relation":"later_version","id":"425"}]},"scopus_import":1,"title":"Embeddability in the 3 sphere is decidable","publist_id":"4849","date_created":"2018-12-11T11:56:02Z","citation":{"apa":"Matoušek, J., Sedgwick, E., Tancer, M., &#38; Wagner, U. (2014). Embeddability in the 3 sphere is decidable. In <i>Proceedings of the Annual Symposium on Computational Geometry</i> (pp. 78–84). Kyoto, Japan: ACM. <a href=\"https://doi.org/10.1145/2582112.2582137\">https://doi.org/10.1145/2582112.2582137</a>","short":"J. Matoušek, E. Sedgwick, M. Tancer, U. Wagner, in:, Proceedings of the Annual Symposium on Computational Geometry, ACM, 2014, pp. 78–84.","ama":"Matoušek J, Sedgwick E, Tancer M, Wagner U. Embeddability in the 3 sphere is decidable. In: <i>Proceedings of the Annual Symposium on Computational Geometry</i>. ACM; 2014:78-84. doi:<a href=\"https://doi.org/10.1145/2582112.2582137\">10.1145/2582112.2582137</a>","ieee":"J. Matoušek, E. Sedgwick, M. Tancer, and U. Wagner, “Embeddability in the 3 sphere is decidable,” in <i>Proceedings of the Annual Symposium on Computational Geometry</i>, Kyoto, Japan, 2014, pp. 78–84.","ista":"Matoušek J, Sedgwick E, Tancer M, Wagner U. 2014. Embeddability in the 3 sphere is decidable. Proceedings of the Annual Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, 78–84.","mla":"Matoušek, Jiří, et al. “Embeddability in the 3 Sphere Is Decidable.” <i>Proceedings of the Annual Symposium on Computational Geometry</i>, ACM, 2014, pp. 78–84, doi:<a href=\"https://doi.org/10.1145/2582112.2582137\">10.1145/2582112.2582137</a>.","chicago":"Matoušek, Jiří, Eric Sedgwick, Martin Tancer, and Uli Wagner. “Embeddability in the 3 Sphere Is Decidable.” In <i>Proceedings of the Annual Symposium on Computational Geometry</i>, 78–84. ACM, 2014. <a href=\"https://doi.org/10.1145/2582112.2582137\">https://doi.org/10.1145/2582112.2582137</a>."},"oa":1,"date_updated":"2023-09-11T13:38:49Z","acknowledgement":"ERC Advanced Grant No. 267165; Grant GRADR Eurogiga GIG/11/E023  (SNSF-PP00P2-138948); Swiss National Science Foundation  (SNSF-200020-138230).","year":"2014"},{"pmid":1,"status":"public","type":"journal_article","author":[{"first_name":"Ritankar","full_name":"Majumdar, Ritankar","last_name":"Majumdar"},{"orcid":"0000-0002-6620-9179","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","last_name":"Sixt","full_name":"Sixt, Michael K","first_name":"Michael K"},{"full_name":"Parent, Carole","first_name":"Carole","last_name":"Parent"}],"main_file_link":[{"open_access":"1","url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC4177954/"}],"day":"01","oa_version":"Submitted Version","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","month":"10","language":[{"iso":"eng"}],"publication":"Current Opinion in Cell Biology","title":"New paradigms in the establishment and maintenance of gradients during directed cell migration","oa":1,"date_updated":"2021-01-12T06:55:40Z","issue":"1","intvolume":"        30","scopus_import":1,"page":"33 - 40","department":[{"_id":"MiSi"}],"volume":30,"quality_controlled":"1","publisher":"Elsevier","date_published":"2014-10-01T00:00:00Z","publication_status":"published","external_id":{"pmid":["24959970"]},"abstract":[{"lang":"eng","text":"Directional guidance of migrating cells is relatively well explored in the reductionist setting of cell culture experiments. Here spatial gradients of chemical cues as well as gradients of mechanical substrate characteristics prove sufficient to attract single cells as well as their collectives. How such gradients present and act in the context of an organism is far less clear. Here we review recent advances in understanding how guidance cues emerge and operate in the physiological context."}],"_id":"2158","doi":"10.1016/j.ceb.2014.05.010","publist_id":"4848","date_created":"2018-12-11T11:56:03Z","citation":{"apa":"Majumdar, R., Sixt, M. K., &#38; Parent, C. (2014). New paradigms in the establishment and maintenance of gradients during directed cell migration. <i>Current Opinion in Cell Biology</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.ceb.2014.05.010\">https://doi.org/10.1016/j.ceb.2014.05.010</a>","mla":"Majumdar, Ritankar, et al. “New Paradigms in the Establishment and Maintenance of Gradients during Directed Cell Migration.” <i>Current Opinion in Cell Biology</i>, vol. 30, no. 1, Elsevier, 2014, pp. 33–40, doi:<a href=\"https://doi.org/10.1016/j.ceb.2014.05.010\">10.1016/j.ceb.2014.05.010</a>.","ista":"Majumdar R, Sixt MK, Parent C. 2014. New paradigms in the establishment and maintenance of gradients during directed cell migration. Current Opinion in Cell Biology. 30(1), 33–40.","chicago":"Majumdar, Ritankar, Michael K Sixt, and Carole Parent. “New Paradigms in the Establishment and Maintenance of Gradients during Directed Cell Migration.” <i>Current Opinion in Cell Biology</i>. Elsevier, 2014. <a href=\"https://doi.org/10.1016/j.ceb.2014.05.010\">https://doi.org/10.1016/j.ceb.2014.05.010</a>.","ieee":"R. Majumdar, M. K. Sixt, and C. Parent, “New paradigms in the establishment and maintenance of gradients during directed cell migration,” <i>Current Opinion in Cell Biology</i>, vol. 30, no. 1. Elsevier, pp. 33–40, 2014.","ama":"Majumdar R, Sixt MK, Parent C. New paradigms in the establishment and maintenance of gradients during directed cell migration. <i>Current Opinion in Cell Biology</i>. 2014;30(1):33-40. doi:<a href=\"https://doi.org/10.1016/j.ceb.2014.05.010\">10.1016/j.ceb.2014.05.010</a>","short":"R. Majumdar, M.K. Sixt, C. Parent, Current Opinion in Cell Biology 30 (2014) 33–40."},"acknowledgement":"This effort was supported by the Intramural Research Program of the Center for Cancer Research, NCI, National Institutes of Health and the European Research Council (ERC).","year":"2014"},{"author":[{"last_name":"Mabillard","id":"32BF9DAA-F248-11E8-B48F-1D18A9856A87","full_name":"Mabillard, Isaac","first_name":"Isaac"},{"orcid":"0000-0002-1494-0568","last_name":"Wagner","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","full_name":"Wagner, Uli","first_name":"Uli"}],"conference":{"name":"SoCG: Symposium on Computational Geometry","start_date":"2014-06-08","location":"Kyoto, Japan","end_date":"2014-06-11"},"month":"06","day":"08","oa_version":"Submitted Version","file":[{"date_created":"2018-12-12T10:09:12Z","date_updated":"2020-07-14T12:45:30Z","checksum":"2aae223fee8ffeaf57bbabd8d92b6a2c","file_id":"4735","file_name":"IST-2016-534-v1+1_Eliminating_Tverberg_points_I._An_analogue_of_the_Whitney_trick.pdf","access_level":"open_access","file_size":914396,"relation":"main_file","content_type":"application/pdf","creator":"system"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","status":"public","type":"conference","date_updated":"2023-09-07T11:56:27Z","pubrep_id":"534","oa":1,"title":"Eliminating Tverberg points, I. An analogue of the Whitney trick","scopus_import":1,"has_accepted_license":"1","language":[{"iso":"eng"}],"publication":"Proceedings of the Annual Symposium on Computational Geometry","publication_status":"published","ddc":["510"],"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."}],"publisher":"ACM","date_published":"2014-06-08T00:00:00Z","page":"171 - 180","department":[{"_id":"UlWa"}],"quality_controlled":"1","acknowledgement":"Swiss National Science Foundation (Project SNSF-PP00P2-138948)","year":"2014","date_created":"2018-12-11T11:56:03Z","citation":{"short":"I. Mabillard, U. Wagner, in:, Proceedings of the Annual Symposium on Computational Geometry, ACM, 2014, pp. 171–180.","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.","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>","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>.","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.","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>"},"publist_id":"4847","related_material":{"record":[{"id":"1123","relation":"dissertation_contains","status":"public"}]},"file_date_updated":"2020-07-14T12:45:30Z","_id":"2159","doi":"10.1145/2582112.2582134"},{"language":[{"iso":"eng"}],"_id":"2160","intvolume":"        32","scopus_import":"1","citation":{"apa":"Pentina, A., &#38; Lampert, C. (2014). A PAC-Bayesian bound for Lifelong Learning (Vol. 32, pp. 991–999). Presented at the ICML: International Conference on Machine Learning, Beijing, China: ML Research Press.","short":"A. Pentina, C. Lampert, in:, ML Research Press, 2014, pp. 991–999.","ama":"Pentina A, Lampert C. A PAC-Bayesian bound for Lifelong Learning. In: Vol 32. ML Research Press; 2014:991-999.","ieee":"A. Pentina and C. Lampert, “A PAC-Bayesian bound for Lifelong Learning,” presented at the ICML: International Conference on Machine Learning, Beijing, China, 2014, vol. 32, pp. 991–999.","mla":"Pentina, Anastasia, and Christoph Lampert. <i>A PAC-Bayesian Bound for Lifelong Learning</i>. Vol. 32, ML Research Press, 2014, pp. 991–99.","ista":"Pentina A, Lampert C. 2014. A PAC-Bayesian bound for Lifelong Learning. ICML: International Conference on Machine Learning vol. 32, 991–999.","chicago":"Pentina, Anastasia, and Christoph Lampert. “A PAC-Bayesian Bound for Lifelong Learning,” 32:991–99. ML Research Press, 2014."},"date_created":"2018-12-11T11:56:03Z","title":"A PAC-Bayesian bound for Lifelong Learning","publist_id":"4844","article_processing_charge":"No","year":"2014","date_updated":"2023-10-17T11:54:24Z","oa":1,"volume":32,"quality_controlled":"1","page":"991 - 999","department":[{"_id":"ChLa"}],"date_published":"2014-05-10T00:00:00Z","status":"public","type":"conference","publisher":"ML Research Press","abstract":[{"lang":"eng","text":"Transfer learning has received a lot of attention in the machine learning community over the last years, and several effective algorithms have been developed. However, relatively little is known about their theoretical properties, especially in the setting of lifelong learning, where the goal is to transfer information to tasks for which no data have been observed so far. In this work we study lifelong learning from a theoretical perspective. Our main result is a PAC-Bayesian generalization bound that offers a unified view on existing paradigms for transfer learning, such as the transfer of parameters or the transfer of low-dimensional representations. We also use the bound to derive two principled lifelong learning algorithms, and we show that these yield results comparable with existing methods."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","main_file_link":[{"open_access":"1","url":"https://dl.acm.org/citation.cfm?id=3045003"}],"oa_version":"Submitted Version","day":"10","month":"05","conference":{"location":"Beijing, China","end_date":"2014-06-26","name":"ICML: International Conference on Machine Learning","start_date":"2014-06-21"},"author":[{"last_name":"Pentina","id":"42E87FC6-F248-11E8-B48F-1D18A9856A87","full_name":"Pentina, Anastasia","first_name":"Anastasia"},{"orcid":"0000-0001-8622-7887","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","last_name":"Lampert","first_name":"Christoph","full_name":"Lampert, Christoph"}],"publication_status":"published"},{"project":[{"call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734"},{"call_identifier":"FP7","name":"Social Vaccination in Ant Colonies: from Individual Mechanisms to Society Effects","_id":"25DC711C-B435-11E9-9278-68D0E5697425","grant_number":"243071"},{"name":"Host-Parasite Coevolution","grant_number":"CR-118/3-1","_id":"25DAF0B2-B435-11E9-9278-68D0E5697425"}],"publisher":"Springer","date_published":"2014-07-23T00:00:00Z","page":"1701 - 1710","department":[{"_id":"SyCr"}],"volume":68,"quality_controlled":"1","publication_status":"published","abstract":[{"text":"Repeated pathogen exposure is a common threat in colonies of social insects, posing selection pressures on colony members to respond with improved disease-defense performance. We here tested whether experience gained by repeated tending of low-level fungus-exposed (Metarhizium robertsii) larvae may alter the performance of sanitary brood care in the clonal ant, Platythyrea punctata. We trained ants individually over nine consecutive trials to either sham-treated or fungus-exposed larvae. We then compared the larval grooming behavior of naive and trained ants and measured how effectively they removed infectious fungal conidiospores from the fungus-exposed larvae. We found that the ants changed the duration of larval grooming in response to both, larval treatment and their level of experience: (1) sham-treated larvae received longer grooming than the fungus-exposed larvae and (2) trained ants performed less self-grooming but longer larval grooming than naive ants, which was true for both, ants trained to fungus-exposed and also to sham-treated larvae. Ants that groomed the fungus-exposed larvae for longer periods removed a higher number of fungal conidiospores from the surface of the fungus-exposed larvae. As experienced ants performed longer larval grooming, they were more effective in fungal removal, thus making them better caretakers under pathogen attack of the colony. By studying this clonal ant, we can thus conclude that even in the absence of genetic variation between colony members, differences in experience levels of brood care may affect performance of sanitary brood care in social insects.","lang":"eng"}],"_id":"2161","article_type":"original","doi":"10.1007/s00265-014-1778-8","acknowledgement":"We thank Katrin Kellner for colony establishment and characterization, Mike Bidochka for the fungal strain, Meghan Vyleta for fungal strain characterization, Martina Klatt and Simon Tragust for help in the laboratory, Dimitri Missoh for developing the software BioLogic, and Mark Brown and Raphaël Jeanson for discussion and help with data analysis. The study was funded by the European Research Council (ERC Starting Grant to SC; Marie Curie IEF to LVU) and the German Research Foundation DFG (to SC and to JH), and CW received funding by the doctoral school Diversité du Vivant (Cotutelle project to CD and SC).\r\n","year":"2014","citation":{"mla":"Westhus, Claudia, et al. “Increased Grooming after Repeated Brood Care Provides Sanitary Benefits in a Clonal Ant.” <i>Behavioral Ecology and Sociobiology</i>, vol. 68, no. 10, Springer, 2014, pp. 1701–10, doi:<a href=\"https://doi.org/10.1007/s00265-014-1778-8\">10.1007/s00265-014-1778-8</a>.","chicago":"Westhus, Claudia, Line V Ugelvig, Edouard Tourdot, Jürgen Heinze, Claudie Doums, and Sylvia Cremer. “Increased Grooming after Repeated Brood Care Provides Sanitary Benefits in a Clonal Ant.” <i>Behavioral Ecology and Sociobiology</i>. Springer, 2014. <a href=\"https://doi.org/10.1007/s00265-014-1778-8\">https://doi.org/10.1007/s00265-014-1778-8</a>.","ista":"Westhus C, Ugelvig LV, Tourdot E, Heinze J, Doums C, Cremer S. 2014. Increased grooming after repeated brood care provides sanitary benefits in a clonal ant. Behavioral Ecology and Sociobiology. 68(10), 1701–1710.","short":"C. Westhus, L.V. Ugelvig, E. Tourdot, J. Heinze, C. Doums, S. Cremer, Behavioral Ecology and Sociobiology 68 (2014) 1701–1710.","ama":"Westhus C, Ugelvig LV, Tourdot E, Heinze J, Doums C, Cremer S. Increased grooming after repeated brood care provides sanitary benefits in a clonal ant. <i>Behavioral Ecology and Sociobiology</i>. 2014;68(10):1701-1710. doi:<a href=\"https://doi.org/10.1007/s00265-014-1778-8\">10.1007/s00265-014-1778-8</a>","ieee":"C. Westhus, L. V. Ugelvig, E. Tourdot, J. Heinze, C. Doums, and S. Cremer, “Increased grooming after repeated brood care provides sanitary benefits in a clonal ant,” <i>Behavioral Ecology and Sociobiology</i>, vol. 68, no. 10. Springer, pp. 1701–1710, 2014.","apa":"Westhus, C., Ugelvig, L. V., Tourdot, E., Heinze, J., Doums, C., &#38; Cremer, S. (2014). Increased grooming after repeated brood care provides sanitary benefits in a clonal ant. <i>Behavioral Ecology and Sociobiology</i>. Springer. <a href=\"https://doi.org/10.1007/s00265-014-1778-8\">https://doi.org/10.1007/s00265-014-1778-8</a>"},"publist_id":"4823","date_created":"2018-12-11T11:56:03Z","ec_funded":1,"related_material":{"record":[{"id":"9742","relation":"research_data","status":"public"}]},"type":"journal_article","status":"public","author":[{"last_name":"Westhus","id":"ca9c6ca9-e8aa-11ec-a586-b9471ede0494","first_name":"Claudia","full_name":"Westhus, Claudia"},{"full_name":"Ugelvig, Line V","first_name":"Line V","orcid":"0000-0003-1832-8883","last_name":"Ugelvig","id":"3DC97C8E-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Tourdot","first_name":"Edouard","full_name":"Tourdot, Edouard"},{"last_name":"Heinze","full_name":"Heinze, Jürgen","first_name":"Jürgen"},{"full_name":"Doums, Claudie","first_name":"Claudie","last_name":"Doums"},{"first_name":"Sylvia","full_name":"Cremer, Sylvia","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","last_name":"Cremer","orcid":"0000-0002-2193-3868"}],"month":"07","publication_identifier":{"issn":["0340-5443"]},"day":"23","oa_version":"None","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"publication":"Behavioral Ecology and Sociobiology","date_updated":"2023-02-23T14:06:46Z","issue":"10","article_processing_charge":"No","title":"Increased grooming after repeated brood care provides sanitary benefits in a clonal ant","intvolume":"        68","scopus_import":"1"}]