[{"has_accepted_license":"1","title":"Cytokinins influence root gravitropism via differential regulation of auxin transporter expression and localization in Arabidopsis","publication_status":"published","publication":"New Phytologist","abstract":[{"text":"Redirection of intercellular auxin fluxes via relocalization of the PIN-FORMED 3 (PIN3) and PIN7 auxin efflux carriers has been suggested to be necessary for the root gravitropic response. Cytokinins have also been proposed to play a role in controlling root gravitropism, but conclusive evidence is lacking. We present a detailed study of the dynamics of root bending early after gravistimulation, which revealed a delayed gravitropic response in transgenic lines with depleted endogenous cytokinins (Pro35S:AtCKX) and cytokinin signaling mutants. Pro35S:AtCKX lines, as well as a cytokinin receptor mutant ahk3, showed aberrations in the auxin response distribution in columella cells consistent with defects in the auxin transport machinery. Using in vivo real-time imaging of PIN3-GFP and PIN7-GFP in AtCKX3 overexpression and ahk3 backgrounds, we observed wild-type-like relocalization of PIN proteins in the columella early after gravistimulation, with gravity-induced relocalization of PIN7 faster than that of PIN3. Nonetheless, the cellular distribution of PIN3 and PIN7 and expression of PIN7 and the auxin influx carrier AUX1 was affected in AtCKX overexpression lines. Based on the retained cytokinin sensitivity in pin3 pin4 pin7 mutant, we propose the AUX1-mediated auxin transport rather than columella-located PIN proteins as a target of endogenous cytokinins in the control of root gravitropism.","lang":"eng"}],"intvolume":"       212","quality_controlled":"1","day":"01","page":"497 - 509","isi":1,"citation":{"apa":"Pernisová, M., Prat, T., Grones, P., Haruštiaková, D., Matonohova, M., Spíchal, L., … Hejátko, J. (2016). Cytokinins influence root gravitropism via differential regulation of auxin transporter expression and localization in Arabidopsis. <i>New Phytologist</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1111/nph.14049\">https://doi.org/10.1111/nph.14049</a>","ama":"Pernisová M, Prat T, Grones P, et al. Cytokinins influence root gravitropism via differential regulation of auxin transporter expression and localization in Arabidopsis. <i>New Phytologist</i>. 2016;212(2):497-509. doi:<a href=\"https://doi.org/10.1111/nph.14049\">10.1111/nph.14049</a>","chicago":"Pernisová, Markéta, Tomas Prat, Peter Grones, Danka Haruštiaková, Martina Matonohova, Lukáš Spíchal, Tomasz Nodzyński, Jiří Friml, and Jan Hejátko. “Cytokinins Influence Root Gravitropism via Differential Regulation of Auxin Transporter Expression and Localization in Arabidopsis.” <i>New Phytologist</i>. Wiley-Blackwell, 2016. <a href=\"https://doi.org/10.1111/nph.14049\">https://doi.org/10.1111/nph.14049</a>.","ista":"Pernisová M, Prat T, Grones P, Haruštiaková D, Matonohova M, Spíchal L, Nodzyński T, Friml J, Hejátko J. 2016. Cytokinins influence root gravitropism via differential regulation of auxin transporter expression and localization in Arabidopsis. New Phytologist. 212(2), 497–509.","short":"M. Pernisová, T. Prat, P. Grones, D. Haruštiaková, M. Matonohova, L. Spíchal, T. Nodzyński, J. Friml, J. Hejátko, New Phytologist 212 (2016) 497–509.","ieee":"M. Pernisová <i>et al.</i>, “Cytokinins influence root gravitropism via differential regulation of auxin transporter expression and localization in Arabidopsis,” <i>New Phytologist</i>, vol. 212, no. 2. Wiley-Blackwell, pp. 497–509, 2016.","mla":"Pernisová, Markéta, et al. “Cytokinins Influence Root Gravitropism via Differential Regulation of Auxin Transporter Expression and Localization in Arabidopsis.” <i>New Phytologist</i>, vol. 212, no. 2, Wiley-Blackwell, 2016, pp. 497–509, doi:<a href=\"https://doi.org/10.1111/nph.14049\">10.1111/nph.14049</a>."},"article_processing_charge":"No","author":[{"full_name":"Pernisová, Markéta","last_name":"Pernisová","first_name":"Markéta"},{"full_name":"Prat, Tomas","first_name":"Tomas","id":"3DA3BFEE-F248-11E8-B48F-1D18A9856A87","last_name":"Prat"},{"id":"399876EC-F248-11E8-B48F-1D18A9856A87","first_name":"Peter","last_name":"Grones","full_name":"Grones, Peter"},{"last_name":"Haruštiaková","first_name":"Danka","full_name":"Haruštiaková, Danka"},{"first_name":"Martina","last_name":"Matonohova","full_name":"Matonohova, Martina"},{"full_name":"Spíchal, Lukáš","last_name":"Spíchal","first_name":"Lukáš"},{"first_name":"Tomasz","last_name":"Nodzyński","full_name":"Nodzyński, Tomasz"},{"id":"4159519E-F248-11E8-B48F-1D18A9856A87","first_name":"Jirí","last_name":"Friml","full_name":"Friml, Jirí","orcid":"0000-0002-8302-7596"},{"full_name":"Hejátko, Jan","last_name":"Hejátko","first_name":"Jan"}],"language":[{"iso":"eng"}],"acknowledgement":"Funded by Ministry of Education, Youth and Sports Czech Republic. Grant Numbers: CEITEC 2020, LQ1601, LO1204, LH14104 and The European Research Council. Grant Number: ERC-2011-StG-20101109-PSDP and The Czech Science Foundation. Grant Numbers: GAP501/11/1150, GA13-40637S, GP14-30004P","oa":1,"publist_id":"5839","volume":212,"month":"10","scopus_import":"1","_id":"1372","file":[{"file_name":"IST-2018-1006-v1+1_Pernisova_NewPhytol_2016_peer_review.pdf","file_size":972763,"file_id":"5108","creator":"system","access_level":"open_access","date_updated":"2020-07-14T12:44:47Z","checksum":"27fd841ceaf0403559d7048ef51500f9","date_created":"2018-12-12T10:14:53Z","content_type":"application/pdf","relation":"main_file"}],"file_date_updated":"2020-07-14T12:44:47Z","oa_version":"Submitted Version","doi":"10.1111/nph.14049","date_updated":"2025-09-22T07:36:11Z","external_id":{"isi":["000383595700023"]},"department":[{"_id":"JiFr"}],"status":"public","date_published":"2016-10-01T00:00:00Z","pubrep_id":"1006","date_created":"2018-12-11T11:51:38Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","type":"journal_article","publisher":"Wiley-Blackwell","year":"2016","ddc":["581"],"issue":"2"},{"month":"07","scopus_import":"1","volume":17,"language":[{"iso":"eng"}],"author":[{"last_name":"Martin","first_name":"Olivier","full_name":"Martin, Olivier"},{"orcid":"0000-0001-7896-7762","full_name":"Zagórski, Marcin P","last_name":"Zagórski","id":"343DA0DC-F248-11E8-B48F-1D18A9856A87","first_name":"Marcin P"}],"article_processing_charge":"No","citation":{"ama":"Martin O, Zagórski MP. Network architectures and operating principles. Reply to comments on &#38;quot;Drivers of structural features in gene regulatory networks: From biophysical constraints to biological function&#38;quot; <i>Physics of Life Reviews</i>. 2016;17:168-171. doi:<a href=\"https://doi.org/10.1016/j.plrev.2016.06.006\">10.1016/j.plrev.2016.06.006</a>","apa":"Martin, O., &#38; Zagórski, M. P. (2016). Network architectures and operating principles. Reply to comments on &#38;quot;Drivers of structural features in gene regulatory networks: From biophysical constraints to biological function&#38;quot; <i>Physics of Life Reviews</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.plrev.2016.06.006\">https://doi.org/10.1016/j.plrev.2016.06.006</a>","ista":"Martin O, Zagórski MP. 2016. Network architectures and operating principles. Reply to comments on &#38;quot;Drivers of structural features in gene regulatory networks: From biophysical constraints to biological function&#38;quot; Physics of Life Reviews. 17, 168–171.","chicago":"Martin, Olivier, and Marcin P Zagórski. “Network Architectures and Operating Principles. Reply to Comments on &#38;quot;Drivers of Structural Features in Gene Regulatory Networks: From Biophysical Constraints to Biological Function&#38;quot;” <i>Physics of Life Reviews</i>. Elsevier, 2016. <a href=\"https://doi.org/10.1016/j.plrev.2016.06.006\">https://doi.org/10.1016/j.plrev.2016.06.006</a>.","short":"O. Martin, M.P. Zagórski, Physics of Life Reviews 17 (2016) 168–171.","mla":"Martin, Olivier, and Marcin P. Zagórski. “Network Architectures and Operating Principles. Reply to Comments on &#38;quot;Drivers of Structural Features in Gene Regulatory Networks: From Biophysical Constraints to Biological Function&#38;quot;” <i>Physics of Life Reviews</i>, vol. 17, Elsevier, 2016, pp. 168–71, doi:<a href=\"https://doi.org/10.1016/j.plrev.2016.06.006\">10.1016/j.plrev.2016.06.006</a>.","ieee":"O. Martin and M. P. Zagórski, “Network architectures and operating principles. Reply to comments on &#38;quot;Drivers of structural features in gene regulatory networks: From biophysical constraints to biological function&#38;quot;,” <i>Physics of Life Reviews</i>, vol. 17. Elsevier, pp. 168–171, 2016."},"isi":1,"page":"168 - 171","publist_id":"5838","oa":1,"day":"01","quality_controlled":"1","main_file_link":[{"url":"https://hal.archives-ouvertes.fr/hal-01531698","open_access":"1"}],"intvolume":"        17","publication":"Physics of Life Reviews","corr_author":"1","title":"Network architectures and operating principles. Reply to comments on &quot;Drivers of structural features in gene regulatory networks: From biophysical constraints to biological function&quot;","publication_status":"published","publisher":"Elsevier","type":"journal_article","year":"2016","date_published":"2016-07-01T00:00:00Z","status":"public","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_created":"2018-12-11T11:51:39Z","external_id":{"isi":["000381544100034"]},"date_updated":"2025-09-22T07:35:28Z","department":[{"_id":"AnKi"}],"oa_version":"Preprint","_id":"1373","doi":"10.1016/j.plrev.2016.06.006"},{"doi":"10.4230/LIPIcs.SoCG.2016.35","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"alternative_title":["LIPIcs"],"file":[{"relation":"main_file","content_type":"application/pdf","date_created":"2018-12-12T10:08:38Z","checksum":"cee65b0e722d50f9d1cc70c90ec1d59b","date_updated":"2020-07-14T12:44:47Z","access_level":"open_access","creator":"system","file_id":"4699","file_name":"IST-2016-623-v1+1_LIPIcs-SoCG-2016-35.pdf","file_size":536923}],"_id":"1378","file_date_updated":"2020-07-14T12:44:47Z","oa_version":"Published Version","department":[{"_id":"UlWa"}],"related_material":{"record":[{"status":"public","id":"742","relation":"later_version"}]},"date_updated":"2025-06-03T11:41:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-11T11:51:41Z","status":"public","date_published":"2016-06-01T00:00:00Z","pubrep_id":"623","conference":{"end_date":"2016-06-17","location":"Medford, MA, USA","name":"SoCG: Symposium on Computational Geometry","start_date":"2016-06-14"},"year":"2016","ddc":["510"],"type":"conference","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","has_accepted_license":"1","publication_status":"published","title":"On expansion and topological overlap","abstract":[{"lang":"eng","text":"We give a detailed and easily accessible proof of Gromov's Topological Overlap Theorem. Let X be a finite simplicial complex or, more generally, a finite polyhedral cell complex of dimension d. Informally, the theorem states that if X has sufficiently strong higher-dimensional expansion properties (which generalize edge expansion of graphs and are defined in terms of cellular cochains of X) then X has the following topological overlap property: for every continuous map X → ℝd there exists a point p ∈ ℝd whose preimage intersects a positive fraction μ &gt; 0 of the d-cells of X. More generally, the conclusion holds if ℝd is replaced by any d-dimensional piecewise-linear (PL) manifold M, with a constant μ that depends only on d and on the expansion properties of X, but not on M."}],"intvolume":"        51","quality_controlled":"1","day":"01","oa":1,"publist_id":"5833","page":"35.1 - 35.10","citation":{"mla":"Dotterrer, Dominic, et al. <i>On Expansion and Topological Overlap</i>. Vol. 51, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016, p. 35.1-35.10, doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2016.35\">10.4230/LIPIcs.SoCG.2016.35</a>.","ieee":"D. Dotterrer, T. Kaufman, and U. Wagner, “On expansion and topological overlap,” presented at the SoCG: Symposium on Computational Geometry, Medford, MA, USA, 2016, vol. 51, p. 35.1-35.10.","short":"D. Dotterrer, T. Kaufman, U. Wagner, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016, p. 35.1-35.10.","apa":"Dotterrer, D., Kaufman, T., &#38; Wagner, U. (2016). On expansion and topological overlap (Vol. 51, p. 35.1-35.10). Presented at the SoCG: Symposium on Computational Geometry, Medford, MA, USA: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2016.35\">https://doi.org/10.4230/LIPIcs.SoCG.2016.35</a>","ama":"Dotterrer D, Kaufman T, Wagner U. On expansion and topological overlap. In: Vol 51. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2016:35.1-35.10. doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2016.35\">10.4230/LIPIcs.SoCG.2016.35</a>","chicago":"Dotterrer, Dominic, Tali Kaufman, and Uli Wagner. “On Expansion and Topological Overlap,” 51:35.1-35.10. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2016.35\">https://doi.org/10.4230/LIPIcs.SoCG.2016.35</a>.","ista":"Dotterrer D, Kaufman T, Wagner U. 2016. On expansion and topological overlap. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 51, 35.1-35.10."},"article_processing_charge":"No","author":[{"full_name":"Dotterrer, Dominic","first_name":"Dominic","last_name":"Dotterrer"},{"full_name":"Kaufman, Tali","last_name":"Kaufman","first_name":"Tali"},{"id":"36690CA2-F248-11E8-B48F-1D18A9856A87","first_name":"Uli","last_name":"Wagner","full_name":"Wagner, Uli","orcid":"0000-0002-1494-0568"}],"project":[{"grant_number":"PP00P2_138948","_id":"25FA3206-B435-11E9-9278-68D0E5697425","name":"Embeddings in Higher Dimensions: Algorithms and Combinatorics"}],"language":[{"iso":"eng"}],"volume":51,"scopus_import":"1","month":"06"},{"date_published":"2016-06-01T00:00:00Z","pubrep_id":"622","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-11T11:51:41Z","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","type":"conference","ddc":["510"],"year":"2016","conference":{"end_date":"2016-06-17","location":"Medford, MA, USA","name":"SoCG: Symposium on Computational Geometry","start_date":"2016-06-14"},"oa_version":"Published Version","file_date_updated":"2020-07-14T12:44:47Z","_id":"1379","file":[{"creator":"system","file_name":"IST-2016-622-v1+1_LIPIcs-SoCG-2016-24.pdf","file_size":574770,"file_id":"4930","checksum":"f04248a61c24297cfabd30c5f8e0deb9","access_level":"open_access","date_updated":"2020-07-14T12:44:47Z","date_created":"2018-12-12T10:12:12Z","content_type":"application/pdf","relation":"main_file"}],"alternative_title":["LIPIcs"],"tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"doi":"10.4230/LIPIcs.SoCG.2016.24","related_material":{"record":[{"id":"534","relation":"later_version","status":"public"}]},"date_updated":"2025-09-18T09:45:01Z","department":[{"_id":"UlWa"}],"language":[{"iso":"eng"}],"author":[{"full_name":"Burton, Benjamin","last_name":"Burton","first_name":"Benjamin"},{"full_name":"De Mesmay, Arnaud N","last_name":"De Mesmay","id":"3DB2F25C-F248-11E8-B48F-1D18A9856A87","first_name":"Arnaud N"},{"first_name":"Uli","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","last_name":"Wagner","full_name":"Wagner, Uli","orcid":"0000-0002-1494-0568"}],"article_processing_charge":"No","citation":{"short":"B. Burton, A.N. de Mesmay, U. Wagner, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016, p. 24.1-24.15.","ama":"Burton B, de Mesmay AN, Wagner U. Finding non-orientable surfaces in 3-manifolds. In: Vol 51. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2016:24.1-24.15. doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2016.24\">10.4230/LIPIcs.SoCG.2016.24</a>","apa":"Burton, B., de Mesmay, A. N., &#38; Wagner, U. (2016). Finding non-orientable surfaces in 3-manifolds (Vol. 51, p. 24.1-24.15). Presented at the SoCG: Symposium on Computational Geometry, Medford, MA, USA: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2016.24\">https://doi.org/10.4230/LIPIcs.SoCG.2016.24</a>","ista":"Burton B, de Mesmay AN, Wagner U. 2016. Finding non-orientable surfaces in 3-manifolds. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 51, 24.1-24.15.","chicago":"Burton, Benjamin, Arnaud N de Mesmay, and Uli Wagner. “Finding Non-Orientable Surfaces in 3-Manifolds,” 51:24.1-24.15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2016.24\">https://doi.org/10.4230/LIPIcs.SoCG.2016.24</a>.","ieee":"B. Burton, A. N. de Mesmay, and U. Wagner, “Finding non-orientable surfaces in 3-manifolds,” presented at the SoCG: Symposium on Computational Geometry, Medford, MA, USA, 2016, vol. 51, p. 24.1-24.15.","mla":"Burton, Benjamin, et al. <i>Finding Non-Orientable Surfaces in 3-Manifolds</i>. Vol. 51, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016, p. 24.1-24.15, doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2016.24\">10.4230/LIPIcs.SoCG.2016.24</a>."},"page":"24.1 - 24.15","publist_id":"5832","oa":1,"scopus_import":"1","month":"06","volume":51,"intvolume":"        51","abstract":[{"lang":"eng","text":"We investigate the complexity of finding an embedded non-orientable surface of Euler genus g in a triangulated 3-manifold. This problem occurs both as a natural question in low-dimensional topology, and as a first non-trivial instance of embeddability of complexes into 3-manifolds. We prove that the problem is NP-hard, thus adding to the relatively few hardness results that are currently known in 3-manifold topology. In addition, we show that the problem lies in NP when the Euler genus g is odd, and we give an explicit algorithm in this case."}],"publication_status":"published","title":"Finding non-orientable surfaces in 3-manifolds","has_accepted_license":"1","day":"01","quality_controlled":"1"},{"oa_version":"Preprint","article_number":"23","_id":"1380","doi":"10.1145/2857050","external_id":{"isi":["000382753300004"],"arxiv":["1303.2981"]},"date_updated":"2025-09-22T07:33:47Z","department":[{"_id":"KrCh"}],"status":"public","date_published":"2016-06-01T00:00:00Z","date_created":"2018-12-11T11:51:41Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","type":"journal_article","publisher":"ACM","issue":"3","year":"2016","publication":"Journal of the ACM","abstract":[{"lang":"eng","text":"We consider higher-dimensional versions of Kannan and Lipton's Orbit Problem - determining whether a target vector space V may be reached from a starting point x under repeated applications of a linear transformation A. Answering two questions posed by Kannan and Lipton in the 1980s, we show that when V has dimension one, this problem is solvable in polynomial time, and when V has dimension two or three, the problem is in NPRP."}],"intvolume":"        63","publication_status":"published","title":"On the complexity of the orbit problem","day":"01","quality_controlled":"1","main_file_link":[{"url":"http://arxiv.org/abs/1303.2981","open_access":"1"}],"author":[{"full_name":"Chonev, Ventsislav K","first_name":"Ventsislav K","id":"36CBE2E6-F248-11E8-B48F-1D18A9856A87","last_name":"Chonev"},{"full_name":"Ouaknine, Joël","first_name":"Joël","last_name":"Ouaknine"},{"first_name":"James","last_name":"Worrell","full_name":"Worrell, James"}],"language":[{"iso":"eng"}],"article_processing_charge":"No","citation":{"mla":"Chonev, Ventsislav K., et al. “On the Complexity of the Orbit Problem.” <i>Journal of the ACM</i>, vol. 63, no. 3, 23, ACM, 2016, doi:<a href=\"https://doi.org/10.1145/2857050\">10.1145/2857050</a>.","ieee":"V. K. Chonev, J. Ouaknine, and J. Worrell, “On the complexity of the orbit problem,” <i>Journal of the ACM</i>, vol. 63, no. 3. ACM, 2016.","short":"V.K. Chonev, J. Ouaknine, J. Worrell, Journal of the ACM 63 (2016).","ista":"Chonev VK, Ouaknine J, Worrell J. 2016. On the complexity of the orbit problem. Journal of the ACM. 63(3), 23.","chicago":"Chonev, Ventsislav K, Joël Ouaknine, and James Worrell. “On the Complexity of the Orbit Problem.” <i>Journal of the ACM</i>. ACM, 2016. <a href=\"https://doi.org/10.1145/2857050\">https://doi.org/10.1145/2857050</a>.","apa":"Chonev, V. K., Ouaknine, J., &#38; Worrell, J. (2016). On the complexity of the orbit problem. <i>Journal of the ACM</i>. ACM. <a href=\"https://doi.org/10.1145/2857050\">https://doi.org/10.1145/2857050</a>","ama":"Chonev VK, Ouaknine J, Worrell J. On the complexity of the orbit problem. <i>Journal of the ACM</i>. 2016;63(3). doi:<a href=\"https://doi.org/10.1145/2857050\">10.1145/2857050</a>"},"isi":1,"oa":1,"publist_id":"5831","arxiv":1,"volume":63,"scopus_import":"1","month":"06"},{"oa":1,"publist_id":"5830","page":"51.1 - 51.12","article_processing_charge":"No","citation":{"short":"I. Mabillard, U. Wagner, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016, p. 51.1-51.12.","ama":"Mabillard I, Wagner U. Eliminating higher-multiplicity intersections, II. The deleted product criterion in the r-metastable range. In: Vol 51. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2016:51.1-51.12. doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2016.51\">10.4230/LIPIcs.SoCG.2016.51</a>","apa":"Mabillard, I., &#38; Wagner, U. (2016). Eliminating higher-multiplicity intersections, II. The deleted product criterion in the r-metastable range (Vol. 51, p. 51.1-51.12). Presented at the SoCG: Symposium on Computational Geometry, Medford, MA, USA: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2016.51\">https://doi.org/10.4230/LIPIcs.SoCG.2016.51</a>","ista":"Mabillard I, Wagner U. 2016. Eliminating higher-multiplicity intersections, II. The deleted product criterion in the r-metastable range. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 51, 51.1-51.12.","chicago":"Mabillard, Isaac, and Uli Wagner. “Eliminating Higher-Multiplicity Intersections, II. The Deleted Product Criterion in the r-Metastable Range,” 51:51.1-51.12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2016.51\">https://doi.org/10.4230/LIPIcs.SoCG.2016.51</a>.","mla":"Mabillard, Isaac, and Uli Wagner. <i>Eliminating Higher-Multiplicity Intersections, II. The Deleted Product Criterion in the r-Metastable Range</i>. Vol. 51, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016, p. 51.1-51.12, doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2016.51\">10.4230/LIPIcs.SoCG.2016.51</a>.","ieee":"I. Mabillard and U. Wagner, “Eliminating higher-multiplicity intersections, II. The deleted product criterion in the r-metastable range,” presented at the SoCG: Symposium on Computational Geometry, Medford, MA, USA, 2016, vol. 51, p. 51.1-51.12."},"author":[{"first_name":"Isaac","id":"32BF9DAA-F248-11E8-B48F-1D18A9856A87","last_name":"Mabillard","full_name":"Mabillard, Isaac"},{"last_name":"Wagner","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","first_name":"Uli","orcid":"0000-0002-1494-0568","full_name":"Wagner, Uli"}],"project":[{"grant_number":"PP00P2_138948","name":"Embeddings in Higher Dimensions: Algorithms and Combinatorics","_id":"25FA3206-B435-11E9-9278-68D0E5697425"}],"language":[{"iso":"eng"}],"volume":51,"month":"06","scopus_import":"1","has_accepted_license":"1","corr_author":"1","title":"Eliminating higher-multiplicity intersections, II. The deleted product criterion in the r-metastable range","publication_status":"published","intvolume":"        51","abstract":[{"text":"Motivated by Tverberg-type problems in topological combinatorics and by classical results about embeddings (maps without double points), we study the question whether a finite simplicial complex K can be mapped into double-struck Rd without higher-multiplicity intersections. We focus on conditions for the existence of almost r-embeddings, i.e., maps f : K → double-struck Rd such that f(σ1) ∩ ⋯ ∩ f(σr) = ∅ whenever σ1, ..., σr are pairwise disjoint simplices of K. Generalizing the classical Haefliger-Weber embeddability criterion, we show that a well-known necessary deleted product condition for the existence of almost r-embeddings is sufficient in a suitable r-metastable range of dimensions: If rd ≥ (r + 1) dim K + 3, then there exists an almost r-embedding K → double-struck Rd if and only if there exists an equivariant map (K)Δ r → Sr Sd(r-1)-1, where (K)Δ r is the deleted r-fold product of K, the target Sd(r-1)-1 is the sphere of dimension d(r - 1) - 1, and Sr is the symmetric group. This significantly extends one of the main results of our previous paper (which treated the special case where d = rk and dim K = (r - 1)k for some k ≥ 3), and settles an open question raised there.","lang":"eng"}],"quality_controlled":"1","day":"01","date_created":"2018-12-11T11:51:41Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","pubrep_id":"621","date_published":"2016-06-01T00:00:00Z","conference":{"location":"Medford, MA, USA","end_date":"2016-06-17","name":"SoCG: Symposium on Computational Geometry","start_date":"2016-06-14"},"year":"2016","ddc":["510"],"type":"conference","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"doi":"10.4230/LIPIcs.SoCG.2016.51","alternative_title":["LIPIcs"],"file":[{"date_updated":"2020-07-14T12:44:47Z","access_level":"open_access","checksum":"92c0c3735fe908f8ded6e484005cb3b1","file_id":"4791","file_size":622969,"file_name":"IST-2016-621-v1+1_LIPIcs-SoCG-2016-51.pdf","creator":"system","relation":"main_file","content_type":"application/pdf","date_created":"2018-12-12T10:10:06Z"}],"_id":"1381","file_date_updated":"2020-07-14T12:44:47Z","oa_version":"Published Version","department":[{"_id":"UlWa"}],"date_updated":"2025-06-03T11:41:20Z"},{"oa_version":"None","_id":"1382","doi":"10.1093/aob/mcw043","external_id":{"isi":["000379733800004"]},"related_material":{"record":[{"status":"public","relation":"popular_science","id":"5550"}]},"date_updated":"2025-09-22T07:32:44Z","department":[{"_id":"NiBa"}],"status":"public","date_published":"2016-06-01T00:00:00Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_created":"2018-12-11T11:51:42Z","type":"journal_article","publisher":"Oxford University Press","issue":"7","year":"2016","publication":"Annals of Botany","abstract":[{"lang":"eng","text":"Background and aims Angiosperms display remarkable diversity in flower colour, implying that transitions between pigmentation phenotypes must have been common. Despite progress in understanding transitions between anthocyanin (blue, purple, pink or red) and unpigmented (white) flowers, little is known about the evolutionary patterns of flower-colour transitions in lineages with both yellow and anthocyanin-pigmented flowers. This study investigates the relative rates of evolutionary transitions between different combinations of yellow- and anthocyanin-pigmentation phenotypes in the tribe Antirrhineae. Methods We surveyed taxonomic literature for data on anthocyanin and yellow floral pigmentation for 369 species across the tribe. We then reconstructed the phylogeny of 169 taxa and used phylogenetic comparative methods to estimate transition rates among pigmentation phenotypes across the phylogeny. Key Results In contrast to previous studies we found a bias towards transitions involving a gain in pigmentation, although transitions to phenotypes with both anthocyanin and yellow taxa are nevertheless extremely rare. Despite the dominance of yellow and anthocyanin-pigmented taxa, transitions between these phenotypes are constrained to move through a white intermediate stage, whereas transitions to double-pigmentation are very rare. The most abundant transitions are between anthocyanin-pigmented and unpigmented flowers, and similarly the most abundant polymorphic taxa were those with anthocyanin-pigmented and unpigmented flowers. Conclusions Our findings show that pigment evolution is limited by the presence of other floral pigments. This interaction between anthocyanin and yellow pigments constrains the breadth of potential floral diversity observed in nature. In particular, they suggest that selection has repeatedly acted to promote the spread of single-pigmented phenotypes across the Antirrhineae phylogeny. Furthermore, the correlation between transition rates and polymorphism suggests that the forces causing and maintaining variance in the short term reflect evolutionary processes on longer time scales."}],"intvolume":"       117","corr_author":"1","publication_status":"published","title":"Repeated gains in yellow and anthocyanin pigmentation in flower colour transitions in the Antirrhineae","day":"01","quality_controlled":"1","author":[{"full_name":"Ellis, Thomas","orcid":"0000-0002-8511-0254","id":"3153D6D4-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas","last_name":"Ellis"},{"last_name":"Field","id":"419049E2-F248-11E8-B48F-1D18A9856A87","first_name":"David","orcid":"0000-0002-4014-8478","full_name":"Field, David"}],"language":[{"iso":"eng"}],"page":"1133 - 1140","citation":{"mla":"Ellis, Thomas, and David Field. “Repeated Gains in Yellow and Anthocyanin Pigmentation in Flower Colour Transitions in the Antirrhineae.” <i>Annals of Botany</i>, vol. 117, no. 7, Oxford University Press, 2016, pp. 1133–40, doi:<a href=\"https://doi.org/10.1093/aob/mcw043\">10.1093/aob/mcw043</a>.","ieee":"T. Ellis and D. Field, “Repeated gains in yellow and anthocyanin pigmentation in flower colour transitions in the Antirrhineae,” <i>Annals of Botany</i>, vol. 117, no. 7. Oxford University Press, pp. 1133–1140, 2016.","ama":"Ellis T, Field D. Repeated gains in yellow and anthocyanin pigmentation in flower colour transitions in the Antirrhineae. <i>Annals of Botany</i>. 2016;117(7):1133-1140. doi:<a href=\"https://doi.org/10.1093/aob/mcw043\">10.1093/aob/mcw043</a>","apa":"Ellis, T., &#38; Field, D. (2016). Repeated gains in yellow and anthocyanin pigmentation in flower colour transitions in the Antirrhineae. <i>Annals of Botany</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/aob/mcw043\">https://doi.org/10.1093/aob/mcw043</a>","ista":"Ellis T, Field D. 2016. Repeated gains in yellow and anthocyanin pigmentation in flower colour transitions in the Antirrhineae. Annals of Botany. 117(7), 1133–1140.","chicago":"Ellis, Thomas, and David Field. “Repeated Gains in Yellow and Anthocyanin Pigmentation in Flower Colour Transitions in the Antirrhineae.” <i>Annals of Botany</i>. Oxford University Press, 2016. <a href=\"https://doi.org/10.1093/aob/mcw043\">https://doi.org/10.1093/aob/mcw043</a>.","short":"T. Ellis, D. Field, Annals of Botany 117 (2016) 1133–1140."},"isi":1,"article_processing_charge":"No","publist_id":"5828","acknowledgement":"We thank Melinda Pickup, Spencer Barrett, Nick Barton and four anonymous reviewers for helpful discussions on previous versions  of  this  manuscript.  We  also  thank  Jana  Porsche  for her efforts in tracking down the more obscure references.","volume":117,"scopus_import":"1","month":"06"},{"publication":"LICS '16","abstract":[{"lang":"eng","text":"The continuous evolution of a wide variety of systems, including continous-time Markov chains and linear hybrid automata, can be\r\ndescribed in terms of linear differential equations. In this paper we study the decision problem of whether the solution x(t) of a system of linear differential equations dx/dt = Ax reaches a target halfspace infinitely often. This recurrent reachability problem can\r\nequivalently be formulated as the following Infinite Zeros Problem: does a real-valued function f:R≥0 --&gt; R satisfying a given linear\r\ndifferential equation have infinitely many zeros? Our main decidability result is that if the differential equation has order at most 7, then the Infinite Zeros Problem is decidable. On the other hand, we show that a decision procedure for the Infinite Zeros Problem at order 9 (and above) would entail a major breakthrough in Diophantine Approximation, specifically an algorithm for computing the Lagrange constants of arbitrary real algebraic numbers to arbitrary precision."}],"title":"On recurrent reachability for continuous linear dynamical systems","publication_status":"published","ec_funded":1,"day":"05","quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1507.03632"}],"author":[{"full_name":"Chonev, Ventsislav K","first_name":"Ventsislav K","id":"36CBE2E6-F248-11E8-B48F-1D18A9856A87","last_name":"Chonev"},{"first_name":"Joël","last_name":"Ouaknine","full_name":"Ouaknine, Joël"},{"last_name":"Worrell","first_name":"James","full_name":"Worrell, James"}],"project":[{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307"},{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","call_identifier":"FP7","grant_number":"267989"}],"language":[{"iso":"eng"}],"page":"515 - 524","isi":1,"citation":{"short":"V.K. Chonev, J. Ouaknine, J. Worrell, in:, LICS ’16, IEEE, 2016, pp. 515–524.","chicago":"Chonev, Ventsislav K, Joël Ouaknine, and James Worrell. “On Recurrent Reachability for Continuous Linear Dynamical Systems.” In <i>LICS ’16</i>, 515–24. IEEE, 2016. <a href=\"https://doi.org/10.1145/2933575.2934548\">https://doi.org/10.1145/2933575.2934548</a>.","ista":"Chonev VK, Ouaknine J, Worrell J. 2016. On recurrent reachability for continuous linear dynamical systems. LICS ’16. LICS: Logic in Computer Science, 515–524.","ama":"Chonev VK, Ouaknine J, Worrell J. On recurrent reachability for continuous linear dynamical systems. In: <i>LICS ’16</i>. IEEE; 2016:515-524. doi:<a href=\"https://doi.org/10.1145/2933575.2934548\">10.1145/2933575.2934548</a>","apa":"Chonev, V. K., Ouaknine, J., &#38; Worrell, J. (2016). On recurrent reachability for continuous linear dynamical systems. In <i>LICS ’16</i> (pp. 515–524). New York, NY, USA: IEEE. <a href=\"https://doi.org/10.1145/2933575.2934548\">https://doi.org/10.1145/2933575.2934548</a>","ieee":"V. K. Chonev, J. Ouaknine, and J. Worrell, “On recurrent reachability for continuous linear dynamical systems,” in <i>LICS ’16</i>, New York, NY, USA, 2016, pp. 515–524.","mla":"Chonev, Ventsislav K., et al. “On Recurrent Reachability for Continuous Linear Dynamical Systems.” <i>LICS ’16</i>, IEEE, 2016, pp. 515–24, doi:<a href=\"https://doi.org/10.1145/2933575.2934548\">10.1145/2933575.2934548</a>."},"article_processing_charge":"No","oa":1,"publist_id":"5820","arxiv":1,"scopus_import":"1","month":"07","oa_version":"Preprint","_id":"1389","doi":"10.1145/2933575.2934548","external_id":{"isi":["000387609200052"],"arxiv":["1507.03632"]},"date_updated":"2025-09-22T07:31:08Z","department":[{"_id":"KrCh"}],"status":"public","date_published":"2016-07-05T00:00:00Z","date_created":"2018-12-11T11:51:44Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","type":"conference","publisher":"IEEE","conference":{"name":"LICS: Logic in Computer Science","start_date":"2018-07-05","location":"New York, NY, USA","end_date":"2018-07-08"},"year":"2016"},{"alternative_title":["LNCS"],"_id":"1390","oa_version":"None","doi":"10.1007/978-3-319-41540-6_21","date_updated":"2025-09-22T07:30:07Z","external_id":{"isi":["000387731400021"]},"department":[{"_id":"ToHe"}],"status":"public","date_published":"2016-07-13T00:00:00Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_created":"2018-12-11T11:51:45Z","type":"conference","publisher":"Springer","year":"2016","conference":{"end_date":"2016-07-23","location":"Toronto, Canada","name":"CAV: Computer Aided Verification","start_date":"2016-07-17"},"publication_status":"published","corr_author":"1","title":"QLOSE: Program repair with quantitative objectives","abstract":[{"lang":"eng","text":"The goal of automatic program repair is to identify a set of syntactic changes that can turn a program that is incorrect with respect\r\nto a given specification into a correct one. Existing program repair techniques typically aim to find any program that meets the given specification. Such “best-effort” strategies can end up generating a program that is quite different from the original one. Novel techniques have been proposed to compute syntactically minimal program fixes, but the smallest syntactic fix to a program can still significantly alter the original program’s behaviour. We propose a new approach to program repair based on program distances, which can quantify changes not only to the program syntax but also to the program semantics. We call this the quantitative program repair problem where the “optimal” repair is derived using multiple distances. We implement a solution to the quantitative repair\r\nproblem in a prototype tool called Qlose\r\n(Quantitatively close), using the program synthesizer Sketch. We evaluate the effectiveness of different distances in obtaining desirable repairs by evaluating\r\nQlose on programs taken from educational tools such as CodeHunt and edX."}],"intvolume":"      9780","ec_funded":1,"quality_controlled":"1","day":"13","page":"383 - 401","isi":1,"citation":{"ista":"D’Antoni L, Samanta R, Singh R. 2016. QLOSE: Program repair with quantitative objectives. CAV: Computer Aided Verification, LNCS, vol. 9780, 383–401.","chicago":"D’Antoni, Loris, Roopsha Samanta, and Rishabh Singh. “QLOSE: Program Repair with Quantitative Objectives,” 9780:383–401. Springer, 2016. <a href=\"https://doi.org/10.1007/978-3-319-41540-6_21\">https://doi.org/10.1007/978-3-319-41540-6_21</a>.","ama":"D’Antoni L, Samanta R, Singh R. QLOSE: Program repair with quantitative objectives. In: Vol 9780. Springer; 2016:383-401. doi:<a href=\"https://doi.org/10.1007/978-3-319-41540-6_21\">10.1007/978-3-319-41540-6_21</a>","apa":"D’Antoni, L., Samanta, R., &#38; Singh, R. (2016). QLOSE: Program repair with quantitative objectives (Vol. 9780, pp. 383–401). Presented at the CAV: Computer Aided Verification, Toronto, Canada: Springer. <a href=\"https://doi.org/10.1007/978-3-319-41540-6_21\">https://doi.org/10.1007/978-3-319-41540-6_21</a>","short":"L. D’Antoni, R. Samanta, R. Singh, in:, Springer, 2016, pp. 383–401.","mla":"D’Antoni, Loris, et al. <i>QLOSE: Program Repair with Quantitative Objectives</i>. Vol. 9780, Springer, 2016, pp. 383–401, doi:<a href=\"https://doi.org/10.1007/978-3-319-41540-6_21\">10.1007/978-3-319-41540-6_21</a>.","ieee":"L. D’Antoni, R. Samanta, and R. Singh, “QLOSE: Program repair with quantitative objectives,” presented at the CAV: Computer Aided Verification, Toronto, Canada, 2016, vol. 9780, pp. 383–401."},"article_processing_charge":"No","author":[{"full_name":"D'Antoni, Loris","first_name":"Loris","last_name":"D'Antoni"},{"full_name":"Samanta, Roopsha","id":"3D2AAC08-F248-11E8-B48F-1D18A9856A87","first_name":"Roopsha","last_name":"Samanta"},{"first_name":"Rishabh","last_name":"Singh","full_name":"Singh, Rishabh"}],"project":[{"grant_number":"267989","name":"Quantitative Reactive Modeling","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Formal methods for the design and analysis of complex systems","grant_number":"Z211"}],"language":[{"iso":"eng"}],"publist_id":"5819","volume":9780,"month":"07","scopus_import":"1"},{"department":[{"_id":"ToHe"}],"external_id":{"arxiv":["1603.06850"],"isi":["000387731400013"]},"date_updated":"2026-04-15T10:02:12Z","related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"1155"}]},"doi":"10.1007/978-3-319-41540-6_13","oa_version":"Preprint","alternative_title":["LNCS"],"_id":"1391","conference":{"location":"Toronto, Canada","end_date":"2016-07-23","start_date":"2016-07-17","name":"CAV: Computer Aided Verification"},"year":"2016","type":"conference","publisher":"Springer","date_created":"2018-12-11T11:51:45Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","status":"public","date_published":"2016-07-13T00:00:00Z","main_file_link":[{"url":"http://arxiv.org/abs/1603.06850","open_access":"1"}],"day":"13","quality_controlled":"1","ec_funded":1,"intvolume":"      9780","abstract":[{"lang":"eng","text":"We present an extension to the quantifier-free theory of integer arrays which allows us to express counting. The properties expressible in Array Folds Logic (AFL) include statements such as &quot;the first array cell contains the array length,&quot; and &quot;the array contains equally many minimal and maximal elements.&quot; These properties cannot be expressed in quantified fragments of the theory of arrays, nor in the theory of concatenation. Using reduction to counter machines, we show that the satisfiability problem of AFL is PSPACE-complete, and with a natural restriction the complexity decreases to NP. We also show that adding either universal quantifiers or concatenation leads to undecidability.\r\nAFL contains terms that fold a function over an array. We demonstrate that folding, a well-known concept from functional languages, allows us to concisely summarize loops that count over arrays, which occurs frequently in real-life programs. We provide a tool that can discharge proof obligations in AFL, and we demonstrate on practical examples that our decision procedure can solve a broad range of problems in symbolic testing and program verification."}],"corr_author":"1","title":"Array folds logic","publication_status":"published","volume":9780,"scopus_import":"1","month":"07","oa":1,"publist_id":"5818","arxiv":1,"author":[{"last_name":"Daca","id":"49351290-F248-11E8-B48F-1D18A9856A87","first_name":"Przemyslaw","full_name":"Daca, Przemyslaw"},{"full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger"},{"id":"2C311BF8-F248-11E8-B48F-1D18A9856A87","first_name":"Andrey","last_name":"Kupriyanov","full_name":"Kupriyanov, Andrey"}],"project":[{"grant_number":"267989","call_identifier":"FP7","name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Rigorous Systems Engineering"},{"name":"Formal methods for the design and analysis of complex systems","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211"}],"language":[{"iso":"eng"}],"page":"230 - 248","article_processing_charge":"No","citation":{"ama":"Daca P, Henzinger TA, Kupriyanov A. Array folds logic. In: Vol 9780. Springer; 2016:230-248. doi:<a href=\"https://doi.org/10.1007/978-3-319-41540-6_13\">10.1007/978-3-319-41540-6_13</a>","apa":"Daca, P., Henzinger, T. A., &#38; Kupriyanov, A. (2016). Array folds logic (Vol. 9780, pp. 230–248). Presented at the CAV: Computer Aided Verification, Toronto, Canada: Springer. <a href=\"https://doi.org/10.1007/978-3-319-41540-6_13\">https://doi.org/10.1007/978-3-319-41540-6_13</a>","ista":"Daca P, Henzinger TA, Kupriyanov A. 2016. Array folds logic. CAV: Computer Aided Verification, LNCS, vol. 9780, 230–248.","chicago":"Daca, Przemyslaw, Thomas A Henzinger, and Andrey Kupriyanov. “Array Folds Logic,” 9780:230–48. Springer, 2016. <a href=\"https://doi.org/10.1007/978-3-319-41540-6_13\">https://doi.org/10.1007/978-3-319-41540-6_13</a>.","short":"P. Daca, T.A. Henzinger, A. Kupriyanov, in:, Springer, 2016, pp. 230–248.","ieee":"P. Daca, T. A. Henzinger, and A. Kupriyanov, “Array folds logic,” presented at the CAV: Computer Aided Verification, Toronto, Canada, 2016, vol. 9780, pp. 230–248.","mla":"Daca, Przemyslaw, et al. <i>Array Folds Logic</i>. Vol. 9780, Springer, 2016, pp. 230–48, doi:<a href=\"https://doi.org/10.1007/978-3-319-41540-6_13\">10.1007/978-3-319-41540-6_13</a>."},"isi":1},{"day":"27","quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1601.03243"}],"intvolume":"        13","abstract":[{"text":"The solution space of genome-scale models of cellular metabolism provides a map between physically\r\nviable flux configurations and cellular metabolic phenotypes described, at the most basic level, by the\r\ncorresponding growth rates. By sampling the solution space of E. coliʼs metabolic network, we show\r\nthat empirical growth rate distributions recently obtained in experiments at single-cell resolution can\r\nbe explained in terms of a trade-off between the higher fitness of fast-growing phenotypes and the\r\nhigher entropy of slow-growing ones. Based on this, we propose a minimal model for the evolution of\r\na large bacterial population that captures this trade-off. The scaling relationships observed in\r\nexperiments encode, in such frameworks, for the same distance from the maximum achievable growth\r\nrate, the same degree of growth rate maximization, and/or the same rate of phenotypic change. Being\r\ngrounded on genome-scale metabolic network reconstructions, these results allow for multiple\r\nimplications and extensions in spite of the underlying conceptual simplicity.","lang":"eng"}],"publication":"Physical Biology","title":"Growth against entropy in bacterial metabolism: the phenotypic trade-off behind empirical growth rate distributions in E. coli","publication_status":"published","ec_funded":1,"month":"05","scopus_import":"1","volume":13,"language":[{"iso":"eng"}],"project":[{"grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme"}],"author":[{"id":"3FF5848A-F248-11E8-B48F-1D18A9856A87","first_name":"Daniele","last_name":"De Martino","full_name":"De Martino, Daniele","orcid":"0000-0002-5214-4706"},{"last_name":"Capuani","first_name":"Fabrizio","full_name":"Capuani, Fabrizio"},{"last_name":"De Martino","first_name":"Andrea","full_name":"De Martino, Andrea"}],"article_processing_charge":"No","isi":1,"citation":{"chicago":"De Martino, Daniele, Fabrizio Capuani, and Andrea De Martino. “Growth against Entropy in Bacterial Metabolism: The Phenotypic Trade-off behind Empirical Growth Rate Distributions in E. Coli.” <i>Physical Biology</i>. IOP Publishing, 2016. <a href=\"https://doi.org/10.1088/1478-3975/13/3/036005\">https://doi.org/10.1088/1478-3975/13/3/036005</a>.","ista":"De Martino D, Capuani F, De Martino A. 2016. Growth against entropy in bacterial metabolism: the phenotypic trade-off behind empirical growth rate distributions in E. coli. Physical Biology. 13(3), 036005.","apa":"De Martino, D., Capuani, F., &#38; De Martino, A. (2016). Growth against entropy in bacterial metabolism: the phenotypic trade-off behind empirical growth rate distributions in E. coli. <i>Physical Biology</i>. IOP Publishing. <a href=\"https://doi.org/10.1088/1478-3975/13/3/036005\">https://doi.org/10.1088/1478-3975/13/3/036005</a>","ama":"De Martino D, Capuani F, De Martino A. Growth against entropy in bacterial metabolism: the phenotypic trade-off behind empirical growth rate distributions in E. coli. <i>Physical Biology</i>. 2016;13(3). doi:<a href=\"https://doi.org/10.1088/1478-3975/13/3/036005\">10.1088/1478-3975/13/3/036005</a>","short":"D. De Martino, F. Capuani, A. De Martino, Physical Biology 13 (2016).","mla":"De Martino, Daniele, et al. “Growth against Entropy in Bacterial Metabolism: The Phenotypic Trade-off behind Empirical Growth Rate Distributions in E. Coli.” <i>Physical Biology</i>, vol. 13, no. 3, 036005, IOP Publishing, 2016, doi:<a href=\"https://doi.org/10.1088/1478-3975/13/3/036005\">10.1088/1478-3975/13/3/036005</a>.","ieee":"D. De Martino, F. Capuani, and A. De Martino, “Growth against entropy in bacterial metabolism: the phenotypic trade-off behind empirical growth rate distributions in E. coli,” <i>Physical Biology</i>, vol. 13, no. 3. IOP Publishing, 2016."},"publist_id":"5815","oa":1,"acknowledgement":"The research leading to these results has received funding from the from the Marie\r\nCurie Action ITN NETADIS, grant agreement no. 290038.","arxiv":1,"external_id":{"arxiv":["1601.03243"],"isi":["000380148200014"]},"date_updated":"2025-09-18T14:31:33Z","department":[{"_id":"GaTk"}],"oa_version":"Preprint","article_number":"036005","_id":"1394","doi":"10.1088/1478-3975/13/3/036005","publisher":"IOP Publishing","type":"journal_article","issue":"3","year":"2016","date_published":"2016-05-27T00:00:00Z","status":"public","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_created":"2018-12-11T11:51:46Z"},{"department":[{"_id":"UlWa"},{"_id":"HeEd"}],"external_id":{"isi":["000377722100005"]},"date_updated":"2025-09-18T14:30:52Z","related_material":{"record":[{"relation":"earlier_version","id":"1510","status":"public"}]},"tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"doi":"10.1007/s00454-016-9794-2","file_date_updated":"2020-07-14T12:44:53Z","oa_version":"Published Version","file":[{"content_type":"application/pdf","date_created":"2018-12-12T10:10:55Z","relation":"main_file","file_id":"4846","file_name":"IST-2016-614-v1+1_s00454-016-9794-2.pdf","file_size":905303,"creator":"system","date_updated":"2020-07-14T12:44:53Z","access_level":"open_access","checksum":"e0da023abf6b72abd8c6a8c76740d53c"}],"_id":"1408","ddc":["510"],"issue":"1","year":"2016","type":"journal_article","publisher":"Springer","date_created":"2018-12-11T11:51:51Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","status":"public","date_published":"2016-07-01T00:00:00Z","pubrep_id":"614","day":"01","quality_controlled":"1","ec_funded":1,"publication":"Discrete & Computational Geometry","abstract":[{"text":"The concept of well group in a special but important case captures homological properties of the zero set of a continuous map (Formula presented.) on a compact space K that are invariant with respect to perturbations of f. The perturbations are arbitrary continuous maps within (Formula presented.) distance r from f for a given (Formula presented.). The main drawback of the approach is that the computability of well groups was shown only when (Formula presented.) or (Formula presented.). Our contribution to the theory of well groups is twofold: on the one hand we improve on the computability issue, but on the other hand we present a range of examples where the well groups are incomplete invariants, that is, fail to capture certain important robust properties of the zero set. For the first part, we identify a computable subgroup of the well group that is obtained by cap product with the pullback of the orientation of (Formula presented.) by f. In other words, well groups can be algorithmically approximated from below. When f is smooth and (Formula presented.), our approximation of the (Formula presented.)th well group is exact. For the second part, we find examples of maps (Formula presented.) with all well groups isomorphic but whose perturbations have different zero sets. We discuss on a possible replacement of the well groups of vector valued maps by an invariant of a better descriptive power and computability status.","lang":"eng"}],"intvolume":"        56","has_accepted_license":"1","corr_author":"1","title":"On computability and triviality of well groups","publication_status":"published","volume":56,"month":"07","scopus_import":"1","oa":1,"publist_id":"5799","acknowledgement":"Open access funding provided by Institute of Science and Technology (IST Austria). ","author":[{"orcid":"0000-0001-8878-8397","full_name":"Franek, Peter","last_name":"Franek","first_name":"Peter","id":"473294AE-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Krcál","first_name":"Marek","id":"33E21118-F248-11E8-B48F-1D18A9856A87","full_name":"Krcál, Marek"}],"language":[{"iso":"eng"}],"project":[{"grant_number":"M01980","_id":"25F8B9BC-B435-11E9-9278-68D0E5697425","name":"Robust Invariants of Nonlinear Systems","call_identifier":"FWF"},{"grant_number":"291734","call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425"},{"_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854","name":"IST Austria Open Access Fund"}],"page":"126 - 164","article_processing_charge":"Yes (via OA deal)","isi":1,"citation":{"ieee":"P. Franek and M. Krcál, “On computability and triviality of well groups,” <i>Discrete &#38; Computational Geometry</i>, vol. 56, no. 1. Springer, pp. 126–164, 2016.","mla":"Franek, Peter, and Marek Krcál. “On Computability and Triviality of Well Groups.” <i>Discrete &#38; Computational Geometry</i>, vol. 56, no. 1, Springer, 2016, pp. 126–64, doi:<a href=\"https://doi.org/10.1007/s00454-016-9794-2\">10.1007/s00454-016-9794-2</a>.","ista":"Franek P, Krcál M. 2016. On computability and triviality of well groups. Discrete &#38; Computational Geometry. 56(1), 126–164.","chicago":"Franek, Peter, and Marek Krcál. “On Computability and Triviality of Well Groups.” <i>Discrete &#38; Computational Geometry</i>. Springer, 2016. <a href=\"https://doi.org/10.1007/s00454-016-9794-2\">https://doi.org/10.1007/s00454-016-9794-2</a>.","apa":"Franek, P., &#38; Krcál, M. (2016). On computability and triviality of well groups. <i>Discrete &#38; Computational Geometry</i>. Springer. <a href=\"https://doi.org/10.1007/s00454-016-9794-2\">https://doi.org/10.1007/s00454-016-9794-2</a>","ama":"Franek P, Krcál M. On computability and triviality of well groups. <i>Discrete &#38; Computational Geometry</i>. 2016;56(1):126-164. doi:<a href=\"https://doi.org/10.1007/s00454-016-9794-2\">10.1007/s00454-016-9794-2</a>","short":"P. Franek, M. Krcál, Discrete &#38; Computational Geometry 56 (2016) 126–164."}},{"year":"2016","issue":"11","ddc":["576"],"publisher":"Wiley-Blackwell","type":"journal_article","date_created":"2018-12-11T11:51:51Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","pubrep_id":"772","date_published":"2016-06-08T00:00:00Z","status":"public","department":[{"_id":"NiBa"}],"date_updated":"2025-09-18T14:30:06Z","external_id":{"isi":["000378941100001"]},"doi":"10.1111/mec.13685","_id":"1409","file":[{"date_created":"2018-12-12T10:10:12Z","content_type":"application/pdf","relation":"main_file","creator":"system","file_name":"IST-2017-772-v1+1_AbbotEtAl2016-3.pdf","file_size":226137,"file_id":"4797","checksum":"ede7d0b8a471754f71f17e2b20f3135b","access_level":"open_access","date_updated":"2020-07-14T12:44:53Z"}],"oa_version":"Submitted Version","file_date_updated":"2020-07-14T12:44:53Z","scopus_import":"1","month":"06","volume":25,"publist_id":"5798","oa":1,"isi":1,"citation":{"mla":"Abbott, Richard, et al. “Genomics of Hybridization and Its Evolutionary Consequences.” <i>Molecular Ecology</i>, vol. 25, no. 11, Wiley-Blackwell, 2016, pp. 2325–32, doi:<a href=\"https://doi.org/10.1111/mec.13685\">10.1111/mec.13685</a>.","ieee":"R. Abbott, N. H. Barton, and J. Good, “Genomics of hybridization and its evolutionary consequences,” <i>Molecular Ecology</i>, vol. 25, no. 11. Wiley-Blackwell, pp. 2325–2332, 2016.","apa":"Abbott, R., Barton, N. H., &#38; Good, J. (2016). Genomics of hybridization and its evolutionary consequences. <i>Molecular Ecology</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1111/mec.13685\">https://doi.org/10.1111/mec.13685</a>","ama":"Abbott R, Barton NH, Good J. Genomics of hybridization and its evolutionary consequences. <i>Molecular Ecology</i>. 2016;25(11):2325-2332. doi:<a href=\"https://doi.org/10.1111/mec.13685\">10.1111/mec.13685</a>","ista":"Abbott R, Barton NH, Good J. 2016. Genomics of hybridization and its evolutionary consequences. Molecular Ecology. 25(11), 2325–2332.","chicago":"Abbott, Richard, Nicholas H Barton, and Jeffrey Good. “Genomics of Hybridization and Its Evolutionary Consequences.” <i>Molecular Ecology</i>. Wiley-Blackwell, 2016. <a href=\"https://doi.org/10.1111/mec.13685\">https://doi.org/10.1111/mec.13685</a>.","short":"R. Abbott, N.H. Barton, J. Good, Molecular Ecology 25 (2016) 2325–2332."},"article_processing_charge":"No","page":"2325 - 2332","language":[{"iso":"eng"}],"author":[{"last_name":"Abbott","first_name":"Richard","full_name":"Abbott, Richard"},{"full_name":"Barton, Nicholas H","orcid":"0000-0002-8548-5240","first_name":"Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","last_name":"Barton"},{"first_name":"Jeffrey","last_name":"Good","full_name":"Good, Jeffrey"}],"quality_controlled":"1","day":"08","publication_status":"published","title":"Genomics of hybridization and its evolutionary consequences","has_accepted_license":"1","intvolume":"        25","publication":"Molecular Ecology"},{"pubrep_id":"1005","date_published":"2016-09-01T00:00:00Z","status":"public","date_created":"2018-12-11T11:51:51Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publisher":"Elsevier","type":"journal_article","pmid":1,"ddc":["581"],"year":"2016","oa_version":"Submitted Version","file_date_updated":"2020-07-14T12:44:53Z","file":[{"file_size":4338545,"file_name":"2016_PlantScience_Ugalde.pdf","file_id":"6331","creator":"dernst","access_level":"open_access","date_updated":"2020-07-14T12:44:53Z","checksum":"ca08de036e6ddc81e6f760e0ccdebd3f","date_created":"2019-04-17T07:41:57Z","content_type":"application/pdf","relation":"main_file"}],"_id":"1410","doi":"10.1016/j.plantsci.2016.05.014","external_id":{"pmid":["27457979"],"isi":["000381545000002"]},"date_updated":"2025-09-18T14:29:16Z","department":[{"_id":"JiFr"}],"language":[{"iso":"eng"}],"author":[{"last_name":"Ugalde","first_name":"José","full_name":"Ugalde, José"},{"full_name":"Rodríguez Furlán, Cecilia","last_name":"Rodríguez Furlán","first_name":"Cecilia"},{"first_name":"Riet","last_name":"De Rycke","full_name":"De Rycke, Riet"},{"last_name":"Norambuena","first_name":"Lorena","full_name":"Norambuena, Lorena"},{"first_name":"Jirí","id":"4159519E-F248-11E8-B48F-1D18A9856A87","last_name":"Friml","full_name":"Friml, Jirí","orcid":"0000-0002-8302-7596"},{"first_name":"Gabriel","last_name":"León","full_name":"León, Gabriel"},{"full_name":"Tejos, Ricardo","last_name":"Tejos","first_name":"Ricardo"}],"article_processing_charge":"No","citation":{"ieee":"J. Ugalde <i>et al.</i>, “Phosphatidylinositol 4-phosphate 5-kinases 1 and 2 are involved in the regulation of vacuole morphology during Arabidopsis thaliana pollen development,” <i>Plant Science</i>, vol. 250. Elsevier, pp. 10–19, 2016.","mla":"Ugalde, José, et al. “Phosphatidylinositol 4-Phosphate 5-Kinases 1 and 2 Are Involved in the Regulation of Vacuole Morphology during Arabidopsis Thaliana Pollen Development.” <i>Plant Science</i>, vol. 250, Elsevier, 2016, pp. 10–19, doi:<a href=\"https://doi.org/10.1016/j.plantsci.2016.05.014\">10.1016/j.plantsci.2016.05.014</a>.","short":"J. Ugalde, C. Rodríguez Furlán, R. De Rycke, L. Norambuena, J. Friml, G. León, R. Tejos, Plant Science 250 (2016) 10–19.","ama":"Ugalde J, Rodríguez Furlán C, De Rycke R, et al. Phosphatidylinositol 4-phosphate 5-kinases 1 and 2 are involved in the regulation of vacuole morphology during Arabidopsis thaliana pollen development. <i>Plant Science</i>. 2016;250:10-19. doi:<a href=\"https://doi.org/10.1016/j.plantsci.2016.05.014\">10.1016/j.plantsci.2016.05.014</a>","apa":"Ugalde, J., Rodríguez Furlán, C., De Rycke, R., Norambuena, L., Friml, J., León, G., &#38; Tejos, R. (2016). Phosphatidylinositol 4-phosphate 5-kinases 1 and 2 are involved in the regulation of vacuole morphology during Arabidopsis thaliana pollen development. <i>Plant Science</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.plantsci.2016.05.014\">https://doi.org/10.1016/j.plantsci.2016.05.014</a>","chicago":"Ugalde, José, Cecilia Rodríguez Furlán, Riet De Rycke, Lorena Norambuena, Jiří Friml, Gabriel León, and Ricardo Tejos. “Phosphatidylinositol 4-Phosphate 5-Kinases 1 and 2 Are Involved in the Regulation of Vacuole Morphology during Arabidopsis Thaliana Pollen Development.” <i>Plant Science</i>. Elsevier, 2016. <a href=\"https://doi.org/10.1016/j.plantsci.2016.05.014\">https://doi.org/10.1016/j.plantsci.2016.05.014</a>.","ista":"Ugalde J, Rodríguez Furlán C, De Rycke R, Norambuena L, Friml J, León G, Tejos R. 2016. Phosphatidylinositol 4-phosphate 5-kinases 1 and 2 are involved in the regulation of vacuole morphology during Arabidopsis thaliana pollen development. Plant Science. 250, 10–19."},"isi":1,"page":"10 - 19","publist_id":"5797","oa":1,"acknowledgement":"the Odysseus Program of the Research Foundation-Flanders [G091608] to JF.","scopus_import":"1","month":"09","volume":250,"abstract":[{"text":"The pollen grains arise after meiosis of pollen mother cells within the anthers. A series of complex structural changes follows, generating mature pollen grains capable of performing the double fertilization of the female megasporophyte. Several signaling molecules, including hormones and lipids, have been involved in the regulation and appropriate control of pollen development. Phosphatidylinositol 4-phophate 5-kinases (PIP5K), which catalyze the biosynthesis of the phosphoinositide PtdIns(4,5)P2, are important for tip polar growth of root hairs and pollen tubes, embryo development, vegetative plant growth, and responses to the environment. Here, we report a role of PIP5Ks during microgametogenesis. PIP5K1 and PIP5K2 are expressed during early stages of pollen development and their transcriptional activity respond to auxin in pollen grains. Early male gametophytic lethality to certain grade was observed in both pip5k1-/- and pip5k2-/- single mutants. The number of pip5k mutant alleles is directly related to the frequency of aborted pollen grains suggesting the two genes are involved in the same function. Indeed PIP5K1 and PIP5K2 are functionally redundant since homozygous double mutants did not render viable pollen grains. The loss of function of PIP5K1 and PIP5K2results in defects in vacuole morphology in pollen at the later stages and epidermal root cells. Our results show that PIP5K1, PIP5K2 and phosphoinositide signaling are important cues for early developmental stages and vacuole formation during microgametogenesis.","lang":"eng"}],"intvolume":"       250","publication":"Plant Science","publication_status":"published","title":"Phosphatidylinositol 4-phosphate 5-kinases 1 and 2 are involved in the regulation of vacuole morphology during Arabidopsis thaliana pollen development","has_accepted_license":"1","day":"01","quality_controlled":"1"},{"volume":212,"scopus_import":"1","month":"05","page":"37 - 79","article_processing_charge":"No","citation":{"ieee":"J. Matoušek, E. Sedgwick, M. Tancer, and U. Wagner, “Untangling two systems of noncrossing curves,” <i>Israel Journal of Mathematics</i>, vol. 212, no. 1. Springer, pp. 37–79, 2016.","mla":"Matoušek, Jiří, et al. “Untangling Two Systems of Noncrossing Curves.” <i>Israel Journal of Mathematics</i>, vol. 212, no. 1, Springer, 2016, pp. 37–79, doi:<a href=\"https://doi.org/10.1007/s11856-016-1294-9\">10.1007/s11856-016-1294-9</a>.","apa":"Matoušek, J., Sedgwick, E., Tancer, M., &#38; Wagner, U. (2016). Untangling two systems of noncrossing curves. <i>Israel Journal of Mathematics</i>. Springer. <a href=\"https://doi.org/10.1007/s11856-016-1294-9\">https://doi.org/10.1007/s11856-016-1294-9</a>","ama":"Matoušek J, Sedgwick E, Tancer M, Wagner U. Untangling two systems of noncrossing curves. <i>Israel Journal of Mathematics</i>. 2016;212(1):37-79. doi:<a href=\"https://doi.org/10.1007/s11856-016-1294-9\">10.1007/s11856-016-1294-9</a>","chicago":"Matoušek, Jiří, Eric Sedgwick, Martin Tancer, and Uli Wagner. “Untangling Two Systems of Noncrossing Curves.” <i>Israel Journal of Mathematics</i>. Springer, 2016. <a href=\"https://doi.org/10.1007/s11856-016-1294-9\">https://doi.org/10.1007/s11856-016-1294-9</a>.","ista":"Matoušek J, Sedgwick E, Tancer M, Wagner U. 2016. Untangling two systems of noncrossing curves. Israel Journal of Mathematics. 212(1), 37–79.","short":"J. Matoušek, E. Sedgwick, M. Tancer, U. Wagner, Israel Journal of Mathematics 212 (2016) 37–79."},"isi":1,"author":[{"full_name":"Matoušek, Jiří","last_name":"Matoušek","first_name":"Jiří"},{"first_name":"Eric","last_name":"Sedgwick","full_name":"Sedgwick, Eric"},{"orcid":"0000-0002-1191-6714","full_name":"Tancer, Martin","last_name":"Tancer","first_name":"Martin","id":"38AC689C-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Wagner, Uli","orcid":"0000-0002-1494-0568","first_name":"Uli","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","last_name":"Wagner"}],"language":[{"iso":"eng"}],"project":[{"name":"Embeddings in Higher Dimensions: Algorithms and Combinatorics","_id":"25FA3206-B435-11E9-9278-68D0E5697425","grant_number":"PP00P2_138948"}],"arxiv":1,"acknowledgement":"Supported by the ERC Adv anced Grant No. 267165. ","oa":1,"publist_id":"5796","quality_controlled":"1","day":"01","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1302.6475"}],"publication_status":"published","title":"Untangling two systems of noncrossing curves","publication":"Israel Journal of Mathematics","abstract":[{"text":"We consider two systems (α1, …, αm) and (β1, …,βn) of simple curves drawn on a compact two-dimensional surface M with boundary. Each αi and each βj is either an arc meeting the boundary of M at its two endpoints, or a closed curve. The αi are pairwise disjoint except for possibly sharing endpoints, and similarly for the βj. We want to “untangle” the βj from the ai by a self-homeomorphism of M; more precisely, we seek a homeomorphism φ:M→M fixing the boundary of M pointwise such that the total number of crossings of the ai with the φ(βj) is as small as possible. This problem is motivated by an application in the algorithmic theory of embeddings and 3-manifolds. We prove that if M is planar, i.e., a sphere with h ≥ 0 boundary components (“holes”), then O(mn) crossings can be achieved (independently of h), which is asymptotically tight, as an easy lower bound shows. In general, for an arbitrary (orientable or nonorientable) surface M with h holes and of (orientable or nonorientable) genus g ≥ 0, we obtain an O((m + n)4) upper bound, again independent of h and g. The proofs rely, among other things, on a result concerning simultaneous planar drawings of graphs by Erten and Kobourov.","lang":"eng"}],"intvolume":"       212","type":"journal_article","publisher":"Springer","year":"2016","issue":"1","status":"public","date_published":"2016-05-01T00:00:00Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_created":"2018-12-11T11:51:52Z","date_updated":"2025-09-18T14:27:54Z","related_material":{"record":[{"status":"public","id":"2244","relation":"earlier_version"}]},"external_id":{"arxiv":["1302.6475"],"isi":["000377265600002"]},"department":[{"_id":"UlWa"}],"_id":"1411","oa_version":"Preprint","doi":"10.1007/s11856-016-1294-9"},{"scopus_import":"1","month":"05","volume":35,"isi":1,"article_processing_charge":"No","citation":{"ieee":"R. Goldade, C. Batty, and C. Wojtan, “A practical method for high-resolution embedded liquid surfaces,” <i>Computer Graphics Forum</i>, vol. 35, no. 2. Wiley-Blackwell, pp. 233–242, 2016.","mla":"Goldade, Ryan, et al. “A Practical Method for High-Resolution Embedded Liquid Surfaces.” <i>Computer Graphics Forum</i>, vol. 35, no. 2, Wiley-Blackwell, 2016, pp. 233–42, doi:<a href=\"https://doi.org/10.1111/cgf.12826\">10.1111/cgf.12826</a>.","short":"R. Goldade, C. Batty, C. Wojtan, Computer Graphics Forum 35 (2016) 233–242.","apa":"Goldade, R., Batty, C., &#38; Wojtan, C. (2016). A practical method for high-resolution embedded liquid surfaces. <i>Computer Graphics Forum</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1111/cgf.12826\">https://doi.org/10.1111/cgf.12826</a>","ama":"Goldade R, Batty C, Wojtan C. A practical method for high-resolution embedded liquid surfaces. <i>Computer Graphics Forum</i>. 2016;35(2):233-242. doi:<a href=\"https://doi.org/10.1111/cgf.12826\">10.1111/cgf.12826</a>","ista":"Goldade R, Batty C, Wojtan C. 2016. A practical method for high-resolution embedded liquid surfaces. Computer Graphics Forum. 35(2), 233–242.","chicago":"Goldade, Ryan, Christopher Batty, and Chris Wojtan. “A Practical Method for High-Resolution Embedded Liquid Surfaces.” <i>Computer Graphics Forum</i>. Wiley-Blackwell, 2016. <a href=\"https://doi.org/10.1111/cgf.12826\">https://doi.org/10.1111/cgf.12826</a>."},"page":"233 - 242","language":[{"iso":"eng"}],"project":[{"call_identifier":"H2020","name":"Big Splash: Efficient Simulation of Natural Phenomena at Extremely Large Scales","_id":"2533E772-B435-11E9-9278-68D0E5697425","grant_number":"638176"}],"author":[{"first_name":"Ryan","last_name":"Goldade","full_name":"Goldade, Ryan"},{"full_name":"Batty, Christopher","first_name":"Christopher","last_name":"Batty"},{"full_name":"Wojtan, Christopher J","orcid":"0000-0001-6646-5546","first_name":"Christopher J","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","last_name":"Wojtan"}],"acknowledgement":"This research was supported by NSERC (RGPIN-04360-2014) and IST Austria. ","publist_id":"5795","oa":1,"quality_controlled":"1","day":"27","title":"A practical method for high-resolution embedded liquid surfaces","publication_status":"published","has_accepted_license":"1","abstract":[{"text":"Combining high-resolution level set surface tracking with lower resolution physics is an inexpensive method for achieving highly detailed liquid animations. Unfortunately, the inherent resolution mismatch introduces several types of disturbing visual artifacts. We identify the primary sources of these artifacts and present simple, efficient, and practical solutions to address them. First, we propose an unconditionally stable filtering method that selectively removes sub-grid surface artifacts not seen by the fluid physics, while preserving fine detail in dynamic splashing regions. It provides comparable results to recent error-correction techniques at lower cost, without substepping, and with better scaling behavior. Second, we show how a modified narrow-band scheme can ensure accurate free surface boundary conditions in the presence of large resolution mismatches. Our scheme preserves the efficiency of the narrow-band methodology, while eliminating objectionable stairstep artifacts observed in prior work. Third, we demonstrate that the use of linear interpolation of velocity during advection of the high-resolution level set surface is responsible for visible grid-aligned kinks; we therefore advocate higher-order velocity interpolation, and show that it dramatically reduces this artifact. While these three contributions are orthogonal, our results demonstrate that taken together they efficiently address the dominant sources of visual artifacts arising with high-resolution embedded liquid surfaces; the proposed approach offers improved visual quality, a straightforward implementation, and substantially greater scalability than competing methods.","lang":"eng"}],"intvolume":"        35","publication":"Computer Graphics Forum","ec_funded":1,"publisher":"Wiley-Blackwell","type":"journal_article","year":"2016","issue":"2","ddc":["000"],"pubrep_id":"612","date_published":"2016-05-27T00:00:00Z","status":"public","date_created":"2018-12-11T11:51:52Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_updated":"2025-09-18T14:26:23Z","external_id":{"isi":["000377222200022"]},"department":[{"_id":"ChWo"}],"file":[{"content_type":"application/pdf","date_created":"2018-12-12T10:13:18Z","relation":"main_file","file_id":"5000","file_size":15873858,"file_name":"IST-2016-612-v1+2_Wojtan_APracticalMethod_PostPrint_2016.pdf","creator":"system","date_updated":"2020-07-14T12:44:53Z","access_level":"open_access","checksum":"8e61387ee2e3bd0e776fbe301629bfd9"}],"_id":"1412","oa_version":"Submitted Version","file_date_updated":"2020-07-14T12:44:53Z","doi":"10.1111/cgf.12826"},{"external_id":{"isi":["000377222200008"]},"date_updated":"2025-09-18T14:25:33Z","department":[{"_id":"ChWo"}],"oa_version":"None","_id":"1413","doi":"10.1111/cgf.12812","publisher":"Wiley-Blackwell","type":"journal_article","issue":"2","year":"2016","date_published":"2016-05-01T00:00:00Z","status":"public","date_created":"2018-12-11T11:51:53Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","day":"01","quality_controlled":"1","abstract":[{"text":"This paper generalizes the well-known Diffusion Curves Images (DCI), which are composed of a set of Bezier curves with colors specified on either side. These colors are diffused as Laplace functions over the image domain, which results in smooth color gradients interrupted by the Bezier curves. Our new formulation allows for more color control away from the boundary, providing a similar expressive power as recent Bilaplace image models without introducing associated issues and computational costs. The new model is based on a special Laplace function blending and a new edge blur formulation. We demonstrate that given some user-defined boundary curves over an input raster image, fitting colors and edge blur from the image to the new model and subsequent editing and animation is equally convenient as with DCIs. Numerous examples and comparisons to DCIs are presented.","lang":"eng"}],"intvolume":"        35","publication":"Computer Graphics Forum","publication_status":"published","title":"Generalized diffusion curves: An improved vector representation for smooth-shaded images","corr_author":"1","month":"05","scopus_import":"1","volume":35,"language":[{"iso":"eng"}],"project":[{"grant_number":"P 24352-N23","call_identifier":"FWF","name":"Deep Pictures: Creating Visual and Haptic Vector Images","_id":"25357BD2-B435-11E9-9278-68D0E5697425"}],"author":[{"full_name":"Jeschke, Stefan","id":"44D6411A-F248-11E8-B48F-1D18A9856A87","first_name":"Stefan","last_name":"Jeschke"}],"citation":{"ieee":"S. Jeschke, “Generalized diffusion curves: An improved vector representation for smooth-shaded images,” <i>Computer Graphics Forum</i>, vol. 35, no. 2. Wiley-Blackwell, pp. 71–79, 2016.","mla":"Jeschke, Stefan. “Generalized Diffusion Curves: An Improved Vector Representation for Smooth-Shaded Images.” <i>Computer Graphics Forum</i>, vol. 35, no. 2, Wiley-Blackwell, 2016, pp. 71–79, doi:<a href=\"https://doi.org/10.1111/cgf.12812\">10.1111/cgf.12812</a>.","chicago":"Jeschke, Stefan. “Generalized Diffusion Curves: An Improved Vector Representation for Smooth-Shaded Images.” <i>Computer Graphics Forum</i>. Wiley-Blackwell, 2016. <a href=\"https://doi.org/10.1111/cgf.12812\">https://doi.org/10.1111/cgf.12812</a>.","ista":"Jeschke S. 2016. Generalized diffusion curves: An improved vector representation for smooth-shaded images. Computer Graphics Forum. 35(2), 71–79.","ama":"Jeschke S. Generalized diffusion curves: An improved vector representation for smooth-shaded images. <i>Computer Graphics Forum</i>. 2016;35(2):71-79. doi:<a href=\"https://doi.org/10.1111/cgf.12812\">10.1111/cgf.12812</a>","apa":"Jeschke, S. (2016). Generalized diffusion curves: An improved vector representation for smooth-shaded images. <i>Computer Graphics Forum</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1111/cgf.12812\">https://doi.org/10.1111/cgf.12812</a>","short":"S. Jeschke, Computer Graphics Forum 35 (2016) 71–79."},"article_processing_charge":"No","isi":1,"page":"71 - 79","publist_id":"5794"},{"scopus_import":"1","month":"05","volume":35,"language":[{"iso":"eng"}],"author":[{"first_name":"Eder","id":"3FB91342-F248-11E8-B48F-1D18A9856A87","last_name":"Miguel Villalba","full_name":"Miguel Villalba, Eder","orcid":"0000-0001-5665-0430"},{"last_name":"Miraut","first_name":"David","full_name":"Miraut, David"},{"first_name":"Miguel","last_name":"Otaduy","full_name":"Otaduy, Miguel"}],"isi":1,"article_processing_charge":"No","citation":{"ieee":"E. Miguel Villalba, D. Miraut, and M. Otaduy, “Modeling and estimation of energy-based hyperelastic objects,” <i>Computer Graphics Forum</i>, vol. 35, no. 2. Wiley-Blackwell, pp. 385–396, 2016.","mla":"Miguel Villalba, Eder, et al. “Modeling and Estimation of Energy-Based Hyperelastic Objects.” <i>Computer Graphics Forum</i>, vol. 35, no. 2, Wiley-Blackwell, 2016, pp. 385–96, doi:<a href=\"https://doi.org/10.1111/cgf.12840\">10.1111/cgf.12840</a>.","apa":"Miguel Villalba, E., Miraut, D., &#38; Otaduy, M. (2016). Modeling and estimation of energy-based hyperelastic objects. <i>Computer Graphics Forum</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1111/cgf.12840\">https://doi.org/10.1111/cgf.12840</a>","ama":"Miguel Villalba E, Miraut D, Otaduy M. Modeling and estimation of energy-based hyperelastic objects. <i>Computer Graphics Forum</i>. 2016;35(2):385-396. doi:<a href=\"https://doi.org/10.1111/cgf.12840\">10.1111/cgf.12840</a>","ista":"Miguel Villalba E, Miraut D, Otaduy M. 2016. Modeling and estimation of energy-based hyperelastic objects. Computer Graphics Forum. 35(2), 385–396.","chicago":"Miguel Villalba, Eder, David Miraut, and Miguel Otaduy. “Modeling and Estimation of Energy-Based Hyperelastic Objects.” <i>Computer Graphics Forum</i>. Wiley-Blackwell, 2016. <a href=\"https://doi.org/10.1111/cgf.12840\">https://doi.org/10.1111/cgf.12840</a>.","short":"E. Miguel Villalba, D. Miraut, M. Otaduy, Computer Graphics Forum 35 (2016) 385–396."},"page":"385 - 396","publist_id":"5792","acknowledgement":"This work was funded in part by grants from the Spanish Ministry of Economy (TIN2012-35840), the European Research Council (ERC Starting Grant no. 280135 Animetrics), and the EU FP7 (project no. 601165 WEARHAP).","day":"01","quality_controlled":"1","abstract":[{"lang":"eng","text":"In this paper, we present a method to model hyperelasticity that is well suited for representing the nonlinearity of real-world objects, as well as for estimating it from deformation examples. Previous approaches suffer several limitations, such as lack of integrability of elastic forces, failure to enforce energy convexity, lack of robustness of parameter estimation, or difficulty to model cross-modal effects. Our method avoids these problems by relying on a general energy-based definition of elastic properties. The accuracy of the resulting elastic model is maximized by defining an additive model of separable energy terms, which allow progressive parameter estimation. In addition, our method supports efficient modeling of extreme nonlinearities thanks to energy-limiting constraints. We combine our energy-based model with an optimization method to estimate model parameters from force-deformation examples, and we show successful modeling of diverse deformable objects, including cloth, human finger skin, and internal human anatomy in a medical imaging application."}],"intvolume":"        35","publication":"Computer Graphics Forum","title":"Modeling and estimation of energy-based hyperelastic objects","publication_status":"published","publisher":"Wiley-Blackwell","type":"journal_article","issue":"2","year":"2016","date_published":"2016-05-01T00:00:00Z","status":"public","date_created":"2018-12-11T11:51:53Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","external_id":{"isi":["000377222200036"]},"date_updated":"2025-09-18T14:24:28Z","department":[{"_id":"BeBi"}],"oa_version":"None","_id":"1414","doi":"10.1111/cgf.12840"},{"pubrep_id":"611","date_published":"2016-05-01T00:00:00Z","status":"public","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_created":"2018-12-11T11:51:53Z","publisher":"Wiley-Blackwell","type":"journal_article","issue":"2","ddc":["000"],"year":"2016","oa_version":"Submitted Version","file_date_updated":"2020-07-14T12:44:53Z","_id":"1415","file":[{"access_level":"open_access","date_updated":"2020-07-14T12:44:53Z","checksum":"984afbe510ed48019025dff1dcc7baad","file_name":"IST-2016-611-v1+3_CW_nbflip_postprint_2016.pdf","file_size":5938324,"file_id":"4940","creator":"system","relation":"main_file","date_created":"2018-12-12T10:12:22Z","content_type":"application/pdf"}],"doi":"10.1111/cgf.12825","external_id":{"isi":["000377222200021"]},"date_updated":"2025-09-18T14:25:04Z","department":[{"_id":"ChWo"}],"language":[{"iso":"eng"}],"author":[{"full_name":"Ferstl, Florian","last_name":"Ferstl","first_name":"Florian"},{"full_name":"Ando, Ryoichi","last_name":"Ando","first_name":"Ryoichi"},{"orcid":"0000-0001-6646-5546","full_name":"Wojtan, Christopher J","last_name":"Wojtan","first_name":"Christopher J","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Rüdiger","last_name":"Westermann","full_name":"Westermann, Rüdiger"},{"first_name":"Nils","last_name":"Thuerey","full_name":"Thuerey, Nils"}],"isi":1,"citation":{"ista":"Ferstl F, Ando R, Wojtan C, Westermann R, Thuerey N. 2016. Narrow band FLIP for liquid simulations. Computer Graphics Forum. 35(2), 225–232.","chicago":"Ferstl, Florian, Ryoichi Ando, Chris Wojtan, Rüdiger Westermann, and Nils Thuerey. “Narrow Band FLIP for Liquid Simulations.” <i>Computer Graphics Forum</i>. Wiley-Blackwell, 2016. <a href=\"https://doi.org/10.1111/cgf.12825\">https://doi.org/10.1111/cgf.12825</a>.","ama":"Ferstl F, Ando R, Wojtan C, Westermann R, Thuerey N. Narrow band FLIP for liquid simulations. <i>Computer Graphics Forum</i>. 2016;35(2):225-232. doi:<a href=\"https://doi.org/10.1111/cgf.12825\">10.1111/cgf.12825</a>","apa":"Ferstl, F., Ando, R., Wojtan, C., Westermann, R., &#38; Thuerey, N. (2016). Narrow band FLIP for liquid simulations. <i>Computer Graphics Forum</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1111/cgf.12825\">https://doi.org/10.1111/cgf.12825</a>","short":"F. Ferstl, R. Ando, C. Wojtan, R. Westermann, N. Thuerey, Computer Graphics Forum 35 (2016) 225–232.","ieee":"F. Ferstl, R. Ando, C. Wojtan, R. Westermann, and N. Thuerey, “Narrow band FLIP for liquid simulations,” <i>Computer Graphics Forum</i>, vol. 35, no. 2. Wiley-Blackwell, pp. 225–232, 2016.","mla":"Ferstl, Florian, et al. “Narrow Band FLIP for Liquid Simulations.” <i>Computer Graphics Forum</i>, vol. 35, no. 2, Wiley-Blackwell, 2016, pp. 225–32, doi:<a href=\"https://doi.org/10.1111/cgf.12825\">10.1111/cgf.12825</a>."},"article_processing_charge":"No","page":"225 - 232","publist_id":"5793","oa":1,"scopus_import":"1","month":"05","volume":35,"abstract":[{"text":"The Fluid Implicit Particle method (FLIP) for liquid simulations uses particles to reduce numerical dissipation and provide important visual cues for events like complex splashes and small-scale features near the liquid surface. Unfortunately, FLIP simulations can be computationally expensive, because they require a dense sampling of particles to fill the entire liquid volume. Furthermore, the vast majority of these FLIP particles contribute nothing to the fluid's visual appearance, especially for larger volumes of liquid. We present a method that only uses FLIP particles within a narrow band of the liquid surface, while efficiently representing the remaining inner volume on a regular grid. We show that a naïve realization of this idea introduces unstable and uncontrollable energy fluctuations, and we propose a novel coupling scheme between FLIP particles and regular grid which overcomes this problem. Our method drastically reduces the particle count and simulation times while yielding results that are nearly indistinguishable from regular FLIP simulations. Our approach is easy to integrate into any existing FLIP implementation.","lang":"eng"}],"intvolume":"        35","publication":"Computer Graphics Forum","publication_status":"published","title":"Narrow band FLIP for liquid simulations","has_accepted_license":"1","day":"01","quality_controlled":"1"},{"status":"public","date_published":"2016-05-15T00:00:00Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_created":"2018-12-11T11:51:54Z","type":"journal_article","publisher":"American Physical Society","issue":"19","year":"2016","oa_version":"Preprint","article_number":"195145","_id":"1416","doi":"10.1103/PhysRevB.93.195145","external_id":{"arxiv":["1603.09358"],"isi":["000376636900002"]},"date_updated":"2025-09-18T14:23:55Z","department":[{"_id":"MiLe"}],"author":[{"full_name":"Van Loon, Erik","first_name":"Erik","last_name":"Van Loon"},{"last_name":"Katsnelson","first_name":"Mikhail","full_name":"Katsnelson, Mikhail"},{"first_name":"Lauriane","last_name":"Chomaz","full_name":"Chomaz, Lauriane"},{"first_name":"Mikhail","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","last_name":"Lemeshko","full_name":"Lemeshko, Mikhail","orcid":"0000-0002-6990-7802"}],"language":[{"iso":"eng"}],"citation":{"ista":"Van Loon E, Katsnelson M, Chomaz L, Lemeshko M. 2016. Interaction-driven Lifshitz transition with dipolar fermions in optical lattices. Physical Review B - Condensed Matter and Materials Physics. 93(19), 195145.","chicago":"Van Loon, Erik, Mikhail Katsnelson, Lauriane Chomaz, and Mikhail Lemeshko. “Interaction-Driven Lifshitz Transition with Dipolar Fermions in Optical Lattices.” <i>Physical Review B - Condensed Matter and Materials Physics</i>. American Physical Society, 2016. <a href=\"https://doi.org/10.1103/PhysRevB.93.195145\">https://doi.org/10.1103/PhysRevB.93.195145</a>.","apa":"Van Loon, E., Katsnelson, M., Chomaz, L., &#38; Lemeshko, M. (2016). Interaction-driven Lifshitz transition with dipolar fermions in optical lattices. <i>Physical Review B - Condensed Matter and Materials Physics</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevB.93.195145\">https://doi.org/10.1103/PhysRevB.93.195145</a>","ama":"Van Loon E, Katsnelson M, Chomaz L, Lemeshko M. Interaction-driven Lifshitz transition with dipolar fermions in optical lattices. <i>Physical Review B - Condensed Matter and Materials Physics</i>. 2016;93(19). doi:<a href=\"https://doi.org/10.1103/PhysRevB.93.195145\">10.1103/PhysRevB.93.195145</a>","short":"E. Van Loon, M. Katsnelson, L. Chomaz, M. Lemeshko, Physical Review B - Condensed Matter and Materials Physics 93 (2016).","mla":"Van Loon, Erik, et al. “Interaction-Driven Lifshitz Transition with Dipolar Fermions in Optical Lattices.” <i>Physical Review B - Condensed Matter and Materials Physics</i>, vol. 93, no. 19, 195145, American Physical Society, 2016, doi:<a href=\"https://doi.org/10.1103/PhysRevB.93.195145\">10.1103/PhysRevB.93.195145</a>.","ieee":"E. Van Loon, M. Katsnelson, L. Chomaz, and M. Lemeshko, “Interaction-driven Lifshitz transition with dipolar fermions in optical lattices,” <i>Physical Review B - Condensed Matter and Materials Physics</i>, vol. 93, no. 19. American Physical Society, 2016."},"isi":1,"article_processing_charge":"No","oa":1,"publist_id":"5791","arxiv":1,"volume":93,"scopus_import":"1","month":"05","publication":"Physical Review B - Condensed Matter and Materials Physics","abstract":[{"text":"Anisotropic dipole-dipole interactions between ultracold dipolar fermions break the symmetry of the Fermi surface and thereby deform it. Here we demonstrate that such a Fermi surface deformation induces a topological phase transition - the so-called Lifshitz transition - in the regime accessible to present-day experiments. We describe the impact of the Lifshitz transition on observable quantities such as the Fermi surface topology, the density-density correlation function, and the excitation spectrum of the system. The Lifshitz transition in ultracold atoms can be controlled by tuning the dipole orientation and, in contrast to the transition studied in crystalline solids, is completely interaction driven.","lang":"eng"}],"intvolume":"        93","publication_status":"published","title":"Interaction-driven Lifshitz transition with dipolar fermions in optical lattices","corr_author":"1","day":"15","quality_controlled":"1","main_file_link":[{"url":"http://arxiv.org/abs/1603.09358","open_access":"1"}]}]