[{"date_published":"2023-10-01T00:00:00Z","publication":"Journal of Combinatorial Theory. Series A","citation":{"ieee":"L. Fang, H. Huang, J. Pach, G. Tardos, and J. Zuo, “Successive vertex orderings of fully regular graphs,” Journal of Combinatorial Theory. Series A, vol. 199, no. 10. Elsevier, 2023.","apa":"Fang, L., Huang, H., Pach, J., Tardos, G., & Zuo, J. (2023). Successive vertex orderings of fully regular graphs. Journal of Combinatorial Theory. Series A. Elsevier. https://doi.org/10.1016/j.jcta.2023.105776","ista":"Fang L, Huang H, Pach J, Tardos G, Zuo J. 2023. Successive vertex orderings of fully regular graphs. Journal of Combinatorial Theory. Series A. 199(10), 105776.","ama":"Fang L, Huang H, Pach J, Tardos G, Zuo J. Successive vertex orderings of fully regular graphs. Journal of Combinatorial Theory Series A. 2023;199(10). doi:10.1016/j.jcta.2023.105776","chicago":"Fang, Lixing, Hao Huang, János Pach, Gábor Tardos, and Junchi Zuo. “Successive Vertex Orderings of Fully Regular Graphs.” Journal of Combinatorial Theory. Series A. Elsevier, 2023. https://doi.org/10.1016/j.jcta.2023.105776.","short":"L. Fang, H. Huang, J. Pach, G. Tardos, J. Zuo, Journal of Combinatorial Theory. Series A 199 (2023).","mla":"Fang, Lixing, et al. “Successive Vertex Orderings of Fully Regular Graphs.” Journal of Combinatorial Theory. Series A, vol. 199, no. 10, 105776, Elsevier, 2023, doi:10.1016/j.jcta.2023.105776."},"article_type":"original","day":"01","article_processing_charge":"Yes (in subscription journal)","has_accepted_license":"1","scopus_import":"1","file":[{"creator":"dernst","file_size":352555,"content_type":"application/pdf","file_name":"2023_JourCombinatiorialTheory_Fang.pdf","access_level":"open_access","date_updated":"2024-01-30T12:03:10Z","date_created":"2024-01-30T12:03:10Z","success":1,"checksum":"9eebc213b4182a66063a99083ff5bd04","file_id":"14902","relation":"main_file"}],"oa_version":"Published Version","_id":"13165","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["510"],"title":"Successive vertex orderings of fully regular graphs","status":"public","intvolume":" 199","abstract":[{"lang":"eng","text":"A graph G=(V, E) is called fully regular if for every independent set I c V, the number of vertices in V\\I that are not connected to any element of I depends only on the size of I. A linear ordering of the vertices of G is called successive if for every i, the first i vertices induce a connected subgraph of G. We give an explicit formula for the number of successive vertex orderings of a fully regular graph.\r\nAs an application of our results, we give alternative proofs of two theorems of Stanley and Gao & Peng, determining the number of linear edge orderings of complete graphs and complete bipartite graphs, respectively, with the property that the first i edges induce a connected subgraph.\r\nAs another application, we give a simple product formula for the number of linear orderings of the hyperedges of a complete 3-partite 3-uniform hypergraph such that, for every i, the first i hyperedges induce a connected subgraph. We found similar formulas for complete (non-partite) 3-uniform hypergraphs and in another closely related case, but we managed to verify them only when the number of vertices is small."}],"issue":"10","type":"journal_article","doi":"10.1016/j.jcta.2023.105776","language":[{"iso":"eng"}],"oa":1,"tmp":{"name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode","image":"/images/cc_by_nc_sa.png","short":"CC BY-NC-SA (4.0)"},"external_id":{"arxiv":["2206.13592"]},"quality_controlled":"1","month":"10","publication_identifier":{"eissn":["1096-0899"],"issn":["0097-3165"]},"author":[{"full_name":"Fang, Lixing","last_name":"Fang","first_name":"Lixing"},{"first_name":"Hao","last_name":"Huang","full_name":"Huang, Hao"},{"id":"E62E3130-B088-11EA-B919-BF823C25FEA4","last_name":"Pach","first_name":"János","full_name":"Pach, János"},{"first_name":"Gábor","last_name":"Tardos","full_name":"Tardos, Gábor"},{"full_name":"Zuo, Junchi","last_name":"Zuo","first_name":"Junchi"}],"date_updated":"2024-01-30T12:03:51Z","date_created":"2023-06-25T22:00:45Z","volume":199,"year":"2023","publication_status":"published","publisher":"Elsevier","department":[{"_id":"HeEd"}],"file_date_updated":"2024-01-30T12:03:10Z","license":"https://creativecommons.org/licenses/by-nc-sa/4.0/","article_number":"105776"},{"scopus_import":"1","day":"25","article_processing_charge":"No","article_type":"original","publication":"Theoretical Computer Science","citation":{"ieee":"I. Castellano, A. Giordano Bruno, and N. Zava, “Weakly weighted generalised quasi-metric spaces and semilattices,” Theoretical Computer Science, vol. 977. Elsevier, 2023.","apa":"Castellano, I., Giordano Bruno, A., & Zava, N. (2023). Weakly weighted generalised quasi-metric spaces and semilattices. Theoretical Computer Science. Elsevier. https://doi.org/10.1016/j.tcs.2023.114129","ista":"Castellano I, Giordano Bruno A, Zava N. 2023. Weakly weighted generalised quasi-metric spaces and semilattices. Theoretical Computer Science. 977, 114129.","ama":"Castellano I, Giordano Bruno A, Zava N. Weakly weighted generalised quasi-metric spaces and semilattices. Theoretical Computer Science. 2023;977. doi:10.1016/j.tcs.2023.114129","chicago":"Castellano, Ilaria, Anna Giordano Bruno, and Nicolò Zava. “Weakly Weighted Generalised Quasi-Metric Spaces and Semilattices.” Theoretical Computer Science. Elsevier, 2023. https://doi.org/10.1016/j.tcs.2023.114129.","short":"I. Castellano, A. Giordano Bruno, N. Zava, Theoretical Computer Science 977 (2023).","mla":"Castellano, Ilaria, et al. “Weakly Weighted Generalised Quasi-Metric Spaces and Semilattices.” Theoretical Computer Science, vol. 977, 114129, Elsevier, 2023, doi:10.1016/j.tcs.2023.114129."},"date_published":"2023-10-25T00:00:00Z","type":"journal_article","abstract":[{"text":"Motivated by recent applications to entropy theory in dynamical systems, we generalise notions introduced by Matthews and define weakly weighted and componentwise weakly weighted (generalised) quasi-metrics. We then systematise and extend to full generality the correspondences between these objects and other structures arising in theoretical computer science and dynamics. In particular, we study the correspondences with weak partial metrics and, if the underlying space is a semilattice, with invariant (generalised) quasi-metrics satisfying the descending path condition, and with strictly monotone semi(-co-)valuations.\r\nWe conclude discussing, for endomorphisms of generalised quasi-metric semilattices, a generalisation of both the known intrinsic semilattice entropy and the semigroup entropy.","lang":"eng"}],"title":"Weakly weighted generalised quasi-metric spaces and semilattices","status":"public","intvolume":" 977","_id":"14362","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Preprint","month":"10","publication_identifier":{"issn":["0304-3975"]},"quality_controlled":"1","isi":1,"oa":1,"external_id":{"arxiv":["2212.08424"],"isi":["001076934000001"]},"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2212.08424 "}],"language":[{"iso":"eng"}],"doi":"10.1016/j.tcs.2023.114129","article_number":"114129","publication_status":"published","department":[{"_id":"HeEd"}],"publisher":"Elsevier","year":"2023","date_created":"2023-09-24T22:01:11Z","date_updated":"2024-01-30T13:22:04Z","volume":977,"author":[{"last_name":"Castellano","first_name":"Ilaria","full_name":"Castellano, Ilaria"},{"first_name":"Anna","last_name":"Giordano Bruno","full_name":"Giordano Bruno, Anna"},{"full_name":"Zava, Nicolò","last_name":"Zava","first_name":"Nicolò","orcid":"0000-0001-8686-1888","id":"c8b3499c-7a77-11eb-b046-aa368cbbf2ad"}]},{"file_date_updated":"2023-07-03T09:41:05Z","ec_funded":1,"license":"https://creativecommons.org/licenses/by/4.0/","acknowledgement":"Open access funding provided by Austrian Science Fund (FWF). This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme, grant no. 788183, from the Wittgenstein Prize, Austrian Science Fund (FWF), Grant No. Z 342-N31, and from the DFG Collaborative Research Center TRR 109, ‘Discretization in Geometry and Dynamics’, Austrian Science Fund (FWF), Grant No. I 02979-N35. The authors of this paper thank anonymous reviewers for their constructive criticism and Monika Henzinger for detailed comments on an earlier version of this paper.","year":"2023","publication_status":"epub_ahead","department":[{"_id":"HeEd"}],"publisher":"Springer Nature","author":[{"full_name":"Biswas, Ranita","last_name":"Biswas","first_name":"Ranita","orcid":"0000-0002-5372-7890","id":"3C2B033E-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0001-6249-0832","id":"34D2A09C-F248-11E8-B48F-1D18A9856A87","last_name":"Cultrera Di Montesano","first_name":"Sebastiano","full_name":"Cultrera Di Montesano, Sebastiano"},{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833","first_name":"Herbert","last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert"},{"full_name":"Saghafian, Morteza","id":"f86f7148-b140-11ec-9577-95435b8df824","first_name":"Morteza","last_name":"Saghafian"}],"related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"15094"}]},"date_updated":"2024-03-20T09:36:56Z","date_created":"2023-07-02T22:00:44Z","month":"06","publication_identifier":{"eissn":["2367-1734"],"issn":["2367-1726"]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"quality_controlled":"1","project":[{"grant_number":"788183","_id":"266A2E9E-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Alpha Shape Theory Extended"},{"grant_number":"I4887","_id":"0aa4bc98-070f-11eb-9043-e6fff9c6a316","name":"Discretization in Geometry and Dynamics"},{"call_identifier":"FWF","name":"The Wittgenstein Prize","grant_number":"Z00342","_id":"268116B8-B435-11E9-9278-68D0E5697425"}],"doi":"10.1007/s41468-023-00126-9","language":[{"iso":"eng"}],"type":"journal_article","abstract":[{"lang":"eng","text":"We characterize critical points of 1-dimensional maps paired in persistent homology\r\ngeometrically and this way get elementary proofs of theorems about the symmetry\r\nof persistence diagrams and the variation of such maps. In particular, we identify\r\nbranching points and endpoints of networks as the sole source of asymmetry and\r\nrelate the cycle basis in persistent homology with a version of the stable marriage\r\nproblem. Our analysis provides the foundations of fast algorithms for maintaining a\r\ncollection of sorted lists together with its persistence diagram."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"13182","title":"Geometric characterization of the persistence of 1D maps","status":"public","ddc":["000"],"oa_version":"Published Version","file":[{"file_name":"2023_Journal of Applied and Computational Topology_Biswas.pdf","access_level":"open_access","file_size":487355,"content_type":"application/pdf","creator":"alisjak","relation":"main_file","file_id":"13185","date_created":"2023-07-03T09:41:05Z","date_updated":"2023-07-03T09:41:05Z","checksum":"697249d5d1c61dea4410b9f021b70fce","success":1}],"scopus_import":"1","day":"17","has_accepted_license":"1","article_processing_charge":"Yes (via OA deal)","publication":"Journal of Applied and Computational Topology","citation":{"chicago":"Biswas, Ranita, Sebastiano Cultrera di Montesano, Herbert Edelsbrunner, and Morteza Saghafian. “Geometric Characterization of the Persistence of 1D Maps.” Journal of Applied and Computational Topology. Springer Nature, 2023. https://doi.org/10.1007/s41468-023-00126-9.","mla":"Biswas, Ranita, et al. “Geometric Characterization of the Persistence of 1D Maps.” Journal of Applied and Computational Topology, Springer Nature, 2023, doi:10.1007/s41468-023-00126-9.","short":"R. Biswas, S. Cultrera di Montesano, H. Edelsbrunner, M. Saghafian, Journal of Applied and Computational Topology (2023).","ista":"Biswas R, Cultrera di Montesano S, Edelsbrunner H, Saghafian M. 2023. Geometric characterization of the persistence of 1D maps. Journal of Applied and Computational Topology.","ieee":"R. Biswas, S. Cultrera di Montesano, H. Edelsbrunner, and M. Saghafian, “Geometric characterization of the persistence of 1D maps,” Journal of Applied and Computational Topology. Springer Nature, 2023.","apa":"Biswas, R., Cultrera di Montesano, S., Edelsbrunner, H., & Saghafian, M. (2023). Geometric characterization of the persistence of 1D maps. Journal of Applied and Computational Topology. Springer Nature. https://doi.org/10.1007/s41468-023-00126-9","ama":"Biswas R, Cultrera di Montesano S, Edelsbrunner H, Saghafian M. Geometric characterization of the persistence of 1D maps. Journal of Applied and Computational Topology. 2023. doi:10.1007/s41468-023-00126-9"},"article_type":"original","date_published":"2023-06-17T00:00:00Z"},{"article_processing_charge":"No","has_accepted_license":"1","day":"24","date_published":"2023-08-24T00:00:00Z","page":"43","citation":{"chicago":"Stephenson, Elizabeth R. “Generalizing Medial Axes with Homology Switches.” Institute of Science and Technology Austria, 2023. https://doi.org/10.15479/at:ista:14226.","mla":"Stephenson, Elizabeth R. Generalizing Medial Axes with Homology Switches. Institute of Science and Technology Austria, 2023, doi:10.15479/at:ista:14226.","short":"E.R. Stephenson, Generalizing Medial Axes with Homology Switches, Institute of Science and Technology Austria, 2023.","ista":"Stephenson ER. 2023. Generalizing medial axes with homology switches. Institute of Science and Technology Austria.","ieee":"E. R. Stephenson, “Generalizing medial axes with homology switches,” Institute of Science and Technology Austria, 2023.","apa":"Stephenson, E. R. (2023). Generalizing medial axes with homology switches. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:14226","ama":"Stephenson ER. Generalizing medial axes with homology switches. 2023. doi:10.15479/at:ista:14226"},"abstract":[{"text":"We introduce the notion of a Faustian interchange in a 1-parameter family of smooth\r\nfunctions to generalize the medial axis to critical points of index larger than 0.\r\nWe construct and implement a general purpose algorithm for approximating such\r\ngeneralized medial axes.","lang":"eng"}],"alternative_title":["ISTA Master's Thesis"],"type":"dissertation","file":[{"creator":"cchlebak","content_type":"application/x-zip-compressed","file_size":15501411,"access_level":"closed","file_name":"documents-export-2023-08-24.zip","embargo_to":"open_access","checksum":"453caf851d75c3478c10ed09bd242a91","date_updated":"2024-02-26T23:30:03Z","date_created":"2023-08-24T13:02:49Z","file_id":"14227","relation":"source_file"},{"file_size":6854783,"content_type":"application/pdf","creator":"cchlebak","access_level":"open_access","file_name":"thesis_pdf_a.pdf","checksum":"7349d29963d6695e555e171748648d9a","date_created":"2023-08-24T13:03:42Z","date_updated":"2024-02-26T23:30:03Z","relation":"main_file","embargo":"2024-02-25","file_id":"14228"}],"oa_version":"Published Version","ddc":["500"],"status":"public","title":"Generalizing medial axes with homology switches","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","_id":"14226","publication_identifier":{"issn":["2791-4585"]},"month":"08","language":[{"iso":"eng"}],"supervisor":[{"last_name":"Edelsbrunner","first_name":"Herbert","orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert"}],"degree_awarded":"MS","doi":"10.15479/at:ista:14226","oa":1,"file_date_updated":"2024-02-26T23:30:03Z","date_updated":"2024-02-26T23:30:04Z","date_created":"2023-08-24T13:01:18Z","author":[{"full_name":"Stephenson, Elizabeth R","first_name":"Elizabeth R","last_name":"Stephenson","id":"2D04F932-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6862-208X"}],"publisher":"Institute of Science and Technology Austria","department":[{"_id":"GradSch"},{"_id":"HeEd"}],"publication_status":"published","year":"2023"},{"editor":[{"last_name":"Goaoc","first_name":"Xavier","full_name":"Goaoc, Xavier"},{"full_name":"Kerber, Michael","first_name":"Michael","last_name":"Kerber"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","department":[{"_id":"HeEd"}],"publication_status":"published","acknowledgement":"Partially supported by the DFG Collaborative Research Center TRR 109, “Discretization in Geometry and Dynamics” and the European Research Council (ERC), grant no. 788183, “Alpha Shape Theory Extended”. Erin Chambers: Supported in part by the National Science Foundation through grants DBI-1759807, CCF-1907612, and CCF-2106672. Mathijs Wintraecken: Supported by the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No. 754411. The Austrian science fund (FWF) M-3073 Acknowledgements We thank André Lieutier, David Letscher, Ellen Gasparovic, Kathryn Leonard, and Tao Ju for early discussions on this work. We also thank Lu Liu, Yajie Yan and Tao Ju for sharing code to generate the examples.","year":"2022","volume":224,"date_updated":"2023-02-21T09:50:52Z","date_created":"2022-06-01T14:18:04Z","author":[{"full_name":"Chambers, Erin","last_name":"Chambers","first_name":"Erin"},{"id":"35638A5C-AAC7-11E9-B0BF-5503E6697425","first_name":"Christopher D","last_name":"Fillmore","full_name":"Fillmore, Christopher D"},{"full_name":"Stephenson, Elizabeth R","first_name":"Elizabeth R","last_name":"Stephenson","id":"2D04F932-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6862-208X"},{"full_name":"Wintraecken, Mathijs","id":"307CFBC8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-7472-2220","first_name":"Mathijs","last_name":"Wintraecken"}],"ec_funded":1,"file_date_updated":"2022-06-07T07:58:30Z","project":[{"name":"Learning and triangulating manifolds via collapses","grant_number":"M03073","_id":"fc390959-9c52-11eb-aca3-afa58bd282b2"},{"call_identifier":"H2020","name":"Alpha Shape Theory Extended","_id":"266A2E9E-B435-11E9-9278-68D0E5697425","grant_number":"788183"},{"_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411","call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships"}],"quality_controlled":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"language":[{"iso":"eng"}],"doi":"10.4230/LIPIcs.SoCG.2022.66","conference":{"name":"SoCG: Symposium on Computational Geometry","end_date":"2022-06-10","location":"Berlin, Germany","start_date":"2022-06-07"},"publication_identifier":{"isbn":["978-3-95977-227-3"],"issn":["1868-8969"]},"month":"06","intvolume":" 224","status":"public","title":"A cautionary tale: Burning the medial axis is unstable","ddc":["510"],"_id":"11428","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","file":[{"creator":"dernst","content_type":"application/pdf","file_size":17580705,"file_name":"2022_LIPICs_Chambers.pdf","access_level":"open_access","date_updated":"2022-06-07T07:58:30Z","date_created":"2022-06-07T07:58:30Z","success":1,"checksum":"b25ce40fade4ebc0bcaae176db4f5f1f","file_id":"11437","relation":"main_file"}],"type":"conference","abstract":[{"lang":"eng","text":"The medial axis of a set consists of the points in the ambient space without a unique closest point on the original set. Since its introduction, the medial axis has been used extensively in many applications as a method of computing a topologically equivalent skeleton. Unfortunately, one limiting factor in the use of the medial axis of a smooth manifold is that it is not necessarily topologically stable under small perturbations of the manifold. To counter these instabilities various prunings of the medial axis have been proposed. Here, we examine one type of pruning, called burning. Because of the good experimental results, it was hoped that the burning method of simplifying the medial axis would be stable. In this work we show a simple example that dashes such hopes based on Bing’s house with two rooms, demonstrating an isotopy of a shape where the medial axis goes from collapsible to non-collapsible."}],"page":"66:1-66:9","citation":{"ista":"Chambers E, Fillmore CD, Stephenson ER, Wintraecken M. 2022. A cautionary tale: Burning the medial axis is unstable. 38th International Symposium on Computational Geometry. SoCG: Symposium on Computational GeometryLIPIcs vol. 224, 66:1-66:9.","ieee":"E. Chambers, C. D. Fillmore, E. R. Stephenson, and M. Wintraecken, “A cautionary tale: Burning the medial axis is unstable,” in 38th International Symposium on Computational Geometry, Berlin, Germany, 2022, vol. 224, p. 66:1-66:9.","apa":"Chambers, E., Fillmore, C. D., Stephenson, E. R., & Wintraecken, M. (2022). A cautionary tale: Burning the medial axis is unstable. In X. Goaoc & M. Kerber (Eds.), 38th International Symposium on Computational Geometry (Vol. 224, p. 66:1-66:9). Berlin, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2022.66","ama":"Chambers E, Fillmore CD, Stephenson ER, Wintraecken M. A cautionary tale: Burning the medial axis is unstable. In: Goaoc X, Kerber M, eds. 38th International Symposium on Computational Geometry. Vol 224. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022:66:1-66:9. doi:10.4230/LIPIcs.SoCG.2022.66","chicago":"Chambers, Erin, Christopher D Fillmore, Elizabeth R Stephenson, and Mathijs Wintraecken. “A Cautionary Tale: Burning the Medial Axis Is Unstable.” In 38th International Symposium on Computational Geometry, edited by Xavier Goaoc and Michael Kerber, 224:66:1-66:9. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. https://doi.org/10.4230/LIPIcs.SoCG.2022.66.","mla":"Chambers, Erin, et al. “A Cautionary Tale: Burning the Medial Axis Is Unstable.” 38th International Symposium on Computational Geometry, edited by Xavier Goaoc and Michael Kerber, vol. 224, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, p. 66:1-66:9, doi:10.4230/LIPIcs.SoCG.2022.66.","short":"E. Chambers, C.D. Fillmore, E.R. Stephenson, M. Wintraecken, in:, X. Goaoc, M. Kerber (Eds.), 38th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, p. 66:1-66:9."},"publication":"38th International Symposium on Computational Geometry","date_published":"2022-06-01T00:00:00Z","series_title":"LIPIcs","scopus_import":"1","has_accepted_license":"1","article_processing_charge":"No","day":"01"},{"citation":{"chicago":"Karimipour, Farid, and Sabine Storandt, eds. Web and Wireless Geographical Information Systems. 1st ed. Vol. 13238. Cham: Springer Nature, 2022. https://doi.org/10.1007/978-3-031-06245-2.","short":"F. Karimipour, S. Storandt, eds., Web and Wireless Geographical Information Systems, 1st ed., Springer Nature, Cham, 2022.","mla":"Karimipour, Farid, and Sabine Storandt, editors. Web and Wireless Geographical Information Systems. 1st ed., vol. 13238, Springer Nature, 2022, doi:10.1007/978-3-031-06245-2.","ieee":"F. Karimipour and S. Storandt, Eds., Web and Wireless Geographical Information Systems, 1st ed., vol. 13238. Cham: Springer Nature, 2022.","apa":"Karimipour, F., & Storandt, S. (Eds.). (2022). Web and Wireless Geographical Information Systems (1st ed., Vol. 13238). Cham: Springer Nature. https://doi.org/10.1007/978-3-031-06245-2","ista":"Karimipour F, Storandt S eds. 2022. Web and Wireless Geographical Information Systems 1st ed., Cham: Springer Nature, 153p.","ama":"Karimipour F, Storandt S, eds. Web and Wireless Geographical Information Systems. Vol 13238. 1st ed. Cham: Springer Nature; 2022. doi:10.1007/978-3-031-06245-2"},"quality_controlled":"1","page":"153","date_published":"2022-05-01T00:00:00Z","doi":"10.1007/978-3-031-06245-2","language":[{"iso":"eng"}],"month":"05","day":"01","publication_identifier":{"eissn":["1611-3349"],"isbn":["9783031062445"],"eisbn":["9783031062452"],"issn":["0302-9743"]},"article_processing_charge":"No","_id":"11429","year":"2022","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Web and Wireless Geographical Information Systems","publication_status":"published","status":"public","publisher":"Springer Nature","department":[{"_id":"HeEd"}],"intvolume":" 13238","editor":[{"full_name":"Karimipour, Farid","orcid":"0000-0001-6746-4174","id":"2A2BCDC4-CF62-11E9-BE5E-3B1EE6697425","last_name":"Karimipour","first_name":"Farid"},{"full_name":"Storandt, Sabine","last_name":"Storandt","first_name":"Sabine"}],"edition":"1","date_updated":"2022-06-02T05:56:22Z","date_created":"2022-06-02T05:40:53Z","oa_version":"None","volume":13238,"type":"book_editor","alternative_title":["LNCS"],"place":"Cham","abstract":[{"lang":"eng","text":"This book constitutes the refereed proceedings of the 18th International Symposium on Web and Wireless Geographical Information Systems, W2GIS 2022, held in Konstanz, Germany, in April 2022.\r\nThe 7 full papers presented together with 6 short papers in the volume were carefully reviewed and selected from 16 submissions. The papers cover topics that range from mobile GIS and Location-Based Services to Spatial Information Retrieval and Wireless Sensor Networks."}]},{"language":[{"iso":"eng"}],"doi":"10.1007/978-3-030-95519-9_1","quality_controlled":"1","project":[{"grant_number":"788183","_id":"266A2E9E-B435-11E9-9278-68D0E5697425","name":"Alpha Shape Theory Extended","call_identifier":"H2020"}],"main_file_link":[{"url":" https://doi.org/10.48550/arXiv.2102.11397","open_access":"1"}],"oa":1,"external_id":{"arxiv":["2102.11397"]},"month":"01","publication_identifier":{"isbn":["9783030955182"],"eisbn":["9783030955199"]},"date_updated":"2022-06-07T08:32:42Z","date_created":"2022-06-07T08:21:11Z","volume":30,"author":[{"first_name":"Bea","last_name":"Bleile","full_name":"Bleile, Bea"},{"first_name":"Adélie","last_name":"Garin","full_name":"Garin, Adélie"},{"orcid":"0000-0002-1780-2689","id":"4879BB4E-F248-11E8-B48F-1D18A9856A87","last_name":"Heiss","first_name":"Teresa","full_name":"Heiss, Teresa"},{"full_name":"Maggs, Kelly","first_name":"Kelly","last_name":"Maggs"},{"full_name":"Robins, Vanessa","last_name":"Robins","first_name":"Vanessa"}],"edition":"1","publication_status":"published","department":[{"_id":"HeEd"}],"editor":[{"last_name":"Gasparovic","first_name":"Ellen","full_name":"Gasparovic, Ellen"},{"full_name":"Robins, Vanessa","first_name":"Vanessa","last_name":"Robins"},{"last_name":"Turner","first_name":"Katharine","full_name":"Turner, Katharine"}],"publisher":"Springer Nature","acknowledgement":"This project started during the Women in Computational Topology workshop held in Canberra in July of 2019. All authors are very grateful for its organisation and the financial support for the workshop from the Mathematical Sciences Institute at ANU, the US National Science Foundation through the award CCF-1841455, the Australian Mathematical Sciences Institute and the Association for Women in Mathematics. AG is supported by the Swiss National Science Foundation grant CRSII5_177237. TH is supported by the European Research Council (ERC) Horizon 2020 project “Alpha Shape Theory Extended” No. 788183. KM is supported by the ERC Horizon 2020 research and innovation programme under the Marie Sklodowska-Curie grant agreement No. 859860. VR was supported by Australian Research Council Future Fellowship FT140100604 during the early stages of this project.","year":"2022","ec_funded":1,"place":"Cham","date_published":"2022-01-27T00:00:00Z","page":"1-26","publication":"Research in Computational Topology 2","citation":{"chicago":"Bleile, Bea, Adélie Garin, Teresa Heiss, Kelly Maggs, and Vanessa Robins. “The Persistent Homology of Dual Digital Image Constructions.” In Research in Computational Topology 2, edited by Ellen Gasparovic, Vanessa Robins, and Katharine Turner, 1st ed., 30:1–26. AWMS. Cham: Springer Nature, 2022. https://doi.org/10.1007/978-3-030-95519-9_1.","short":"B. Bleile, A. Garin, T. Heiss, K. Maggs, V. Robins, in:, E. Gasparovic, V. Robins, K. Turner (Eds.), Research in Computational Topology 2, 1st ed., Springer Nature, Cham, 2022, pp. 1–26.","mla":"Bleile, Bea, et al. “The Persistent Homology of Dual Digital Image Constructions.” Research in Computational Topology 2, edited by Ellen Gasparovic et al., 1st ed., vol. 30, Springer Nature, 2022, pp. 1–26, doi:10.1007/978-3-030-95519-9_1.","ieee":"B. Bleile, A. Garin, T. Heiss, K. Maggs, and V. Robins, “The persistent homology of dual digital image constructions,” in Research in Computational Topology 2, 1st ed., vol. 30, E. Gasparovic, V. Robins, and K. Turner, Eds. Cham: Springer Nature, 2022, pp. 1–26.","apa":"Bleile, B., Garin, A., Heiss, T., Maggs, K., & Robins, V. (2022). The persistent homology of dual digital image constructions. In E. Gasparovic, V. Robins, & K. Turner (Eds.), Research in Computational Topology 2 (1st ed., Vol. 30, pp. 1–26). Cham: Springer Nature. https://doi.org/10.1007/978-3-030-95519-9_1","ista":"Bleile B, Garin A, Heiss T, Maggs K, Robins V. 2022.The persistent homology of dual digital image constructions. In: Research in Computational Topology 2. Association for Women in Mathematics Series, vol. 30, 1–26.","ama":"Bleile B, Garin A, Heiss T, Maggs K, Robins V. The persistent homology of dual digital image constructions. In: Gasparovic E, Robins V, Turner K, eds. Research in Computational Topology 2. Vol 30. 1st ed. AWMS. Cham: Springer Nature; 2022:1-26. doi:10.1007/978-3-030-95519-9_1"},"day":"27","article_processing_charge":"No","series_title":"AWMS","scopus_import":"1","oa_version":"Preprint","title":"The persistent homology of dual digital image constructions","status":"public","intvolume":" 30","_id":"11440","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"To compute the persistent homology of a grayscale digital image one needs to build a simplicial or cubical complex from it. For cubical complexes, the two commonly used constructions (corresponding to direct and indirect digital adjacencies) can give different results for the same image. The two constructions are almost dual to each other, and we use this relationship to extend and modify the cubical complexes to become dual filtered cell complexes. We derive a general relationship between the persistent homology of two dual filtered cell complexes, and also establish how various modifications to a filtered complex change the persistence diagram. Applying these results to images, we derive a method to transform the persistence diagram computed using one type of cubical complex into a persistence diagram for the other construction. This means software for computing persistent homology from images can now be easily adapted to produce results for either of the two cubical complex constructions without additional low-level code implementation.","lang":"eng"}],"alternative_title":["Association for Women in Mathematics Series"],"type":"book_chapter"},{"publication_identifier":{"issn":["1051-1970"],"eissn":["1935-4053"]},"month":"05","quality_controlled":"1","doi":"10.1080/10511970.2021.1872750","language":[{"iso":"eng"}],"year":"2022","department":[{"_id":"HeEd"},{"_id":"GradSch"}],"publisher":"Taylor & Francis","publication_status":"published","author":[{"last_name":"Shipman","first_name":"Barbara A.","full_name":"Shipman, Barbara A."},{"orcid":"0000-0002-6862-208X","id":"2D04F932-F248-11E8-B48F-1D18A9856A87","last_name":"Stephenson","first_name":"Elizabeth R","full_name":"Stephenson, Elizabeth R"}],"volume":32,"date_created":"2023-01-16T10:07:21Z","date_updated":"2023-01-30T13:02:30Z","scopus_import":"1","keyword":["Education","General Mathematics"],"article_processing_charge":"No","day":"28","citation":{"mla":"Shipman, Barbara A., and Elizabeth R. Stephenson. “Tangible Topology through the Lens of Limits.” PRIMUS, vol. 32, no. 5, Taylor & Francis, 2022, pp. 593–609, doi:10.1080/10511970.2021.1872750.","short":"B.A. Shipman, E.R. Stephenson, PRIMUS 32 (2022) 593–609.","chicago":"Shipman, Barbara A., and Elizabeth R Stephenson. “Tangible Topology through the Lens of Limits.” PRIMUS. Taylor & Francis, 2022. https://doi.org/10.1080/10511970.2021.1872750.","ama":"Shipman BA, Stephenson ER. Tangible topology through the lens of limits. PRIMUS. 2022;32(5):593-609. doi:10.1080/10511970.2021.1872750","ista":"Shipman BA, Stephenson ER. 2022. Tangible topology through the lens of limits. PRIMUS. 32(5), 593–609.","ieee":"B. A. Shipman and E. R. Stephenson, “Tangible topology through the lens of limits,” PRIMUS, vol. 32, no. 5. Taylor & Francis, pp. 593–609, 2022.","apa":"Shipman, B. A., & Stephenson, E. R. (2022). Tangible topology through the lens of limits. PRIMUS. Taylor & Francis. https://doi.org/10.1080/10511970.2021.1872750"},"publication":"PRIMUS","page":"593-609","article_type":"original","date_published":"2022-05-28T00:00:00Z","type":"journal_article","issue":"5","abstract":[{"lang":"eng","text":"Point-set topology is among the most abstract branches of mathematics in that it lacks tangible notions of distance, length, magnitude, order, and size. There is no shape, no geometry, no algebra, and no direction. Everything we are used to visualizing is gone. In the teaching and learning of mathematics, this can present a conundrum. Yet, this very property makes point set topology perfect for teaching and learning abstract mathematical concepts. It clears our minds of preconceived intuitions and expectations and forces us to think in new and creative ways. In this paper, we present guided investigations into topology through questions and thinking strategies that open up fascinating problems. They are intended for faculty who already teach or are thinking about teaching a class in topology or abstract mathematical reasoning for undergraduates. They can be used to build simple to challenging projects in topology, proofs, honors programs, and research experiences."}],"_id":"12307","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 32","status":"public","title":"Tangible topology through the lens of limits","oa_version":"None"},{"type":"journal_article","issue":"2","abstract":[{"text":"A matching is compatible to two or more labeled point sets of size n with labels {1, . . . , n} if its straight-line drawing on each of these point sets is crossing-free. We study the maximum number of edges in a matching compatible to two or more labeled point sets in general position in the plane. We show that for any two labeled sets of n points in convex position there exists a compatible matching with ⌊√2n + 1 − 1⌋ edges. More generally, for any ℓ labeled point sets we construct compatible matchings of size Ω(n1/ℓ). As a corresponding upper bound, we use probabilistic arguments to show that for any ℓ given sets of n points there exists a labeling of each set such that the largest compatible matching has O(n2/(ℓ+1)) edges. Finally, we show that Θ(log n) copies of any set of n points are necessary and sufficient for the existence of labelings of these point sets such that any compatible matching consists only of a single edge.","lang":"eng"}],"intvolume":" 26","status":"public","ddc":["000"],"title":"On compatible matchings","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"11938","oa_version":"Published Version","file":[{"file_name":"2022_JourGraphAlgorithmsApplic_Aichholzer.pdf","access_level":"open_access","creator":"dernst","file_size":694538,"content_type":"application/pdf","file_id":"11940","relation":"main_file","date_updated":"2022-08-22T06:42:42Z","date_created":"2022-08-22T06:42:42Z","success":1,"checksum":"dc6e255e3558faff924fd9e370886c11"}],"scopus_import":"1","article_processing_charge":"No","has_accepted_license":"1","day":"01","page":"225-240","article_type":"original","citation":{"short":"O. Aichholzer, A.M. Arroyo Guevara, Z. Masárová, I. Parada, D. Perz, A. Pilz, J. Tkadlec, B. Vogtenhuber, Journal of Graph Algorithms and Applications 26 (2022) 225–240.","mla":"Aichholzer, Oswin, et al. “On Compatible Matchings.” Journal of Graph Algorithms and Applications, vol. 26, no. 2, Brown University, 2022, pp. 225–40, doi:10.7155/jgaa.00591.","chicago":"Aichholzer, Oswin, Alan M Arroyo Guevara, Zuzana Masárová, Irene Parada, Daniel Perz, Alexander Pilz, Josef Tkadlec, and Birgit Vogtenhuber. “On Compatible Matchings.” Journal of Graph Algorithms and Applications. Brown University, 2022. https://doi.org/10.7155/jgaa.00591.","ama":"Aichholzer O, Arroyo Guevara AM, Masárová Z, et al. On compatible matchings. Journal of Graph Algorithms and Applications. 2022;26(2):225-240. doi:10.7155/jgaa.00591","apa":"Aichholzer, O., Arroyo Guevara, A. M., Masárová, Z., Parada, I., Perz, D., Pilz, A., … Vogtenhuber, B. (2022). On compatible matchings. Journal of Graph Algorithms and Applications. Brown University. https://doi.org/10.7155/jgaa.00591","ieee":"O. Aichholzer et al., “On compatible matchings,” Journal of Graph Algorithms and Applications, vol. 26, no. 2. Brown University, pp. 225–240, 2022.","ista":"Aichholzer O, Arroyo Guevara AM, Masárová Z, Parada I, Perz D, Pilz A, Tkadlec J, Vogtenhuber B. 2022. On compatible matchings. Journal of Graph Algorithms and Applications. 26(2), 225–240."},"publication":"Journal of Graph Algorithms and Applications","date_published":"2022-06-01T00:00:00Z","ec_funded":1,"file_date_updated":"2022-08-22T06:42:42Z","publisher":"Brown University","department":[{"_id":"UlWa"},{"_id":"HeEd"},{"_id":"KrCh"}],"publication_status":"published","acknowledgement":"A.A. funded by the Marie Sklodowska-Curie grant agreement No 754411. Z.M. partially funded by Wittgenstein Prize, Austrian Science Fund (FWF), grant no. Z 342-N31. I.P., D.P., and B.V. partially supported by FWF within the collaborative DACH project Arrangements and Drawings as FWF project I 3340-N35. A.P. supported by a Schrödinger fellowship of the FWF: J-3847-N35. J.T. partially supported by ERC Start grant no. (279307: Graph Games), FWF grant no. P23499-N23 and S11407-N23 (RiSE).","year":"2022","volume":26,"date_created":"2022-08-21T22:01:56Z","date_updated":"2023-02-23T13:54:21Z","related_material":{"record":[{"id":"9296","relation":"earlier_version","status":"public"}]},"author":[{"last_name":"Aichholzer","first_name":"Oswin","full_name":"Aichholzer, Oswin"},{"orcid":"0000-0003-2401-8670","id":"3207FDC6-F248-11E8-B48F-1D18A9856A87","last_name":"Arroyo Guevara","first_name":"Alan M","full_name":"Arroyo Guevara, Alan M"},{"first_name":"Zuzana","last_name":"Masárová","id":"45CFE238-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6660-1322","full_name":"Masárová, Zuzana"},{"full_name":"Parada, Irene","first_name":"Irene","last_name":"Parada"},{"last_name":"Perz","first_name":"Daniel","full_name":"Perz, Daniel"},{"last_name":"Pilz","first_name":"Alexander","full_name":"Pilz, Alexander"},{"id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1097-9684","first_name":"Josef","last_name":"Tkadlec","full_name":"Tkadlec, Josef"},{"first_name":"Birgit","last_name":"Vogtenhuber","full_name":"Vogtenhuber, Birgit"}],"publication_identifier":{"issn":["1526-1719"]},"month":"06","project":[{"grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020"},{"name":"The Wittgenstein Prize","call_identifier":"FWF","grant_number":"Z00342","_id":"268116B8-B435-11E9-9278-68D0E5697425"},{"grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"},{"grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407","call_identifier":"FWF","name":"Game Theory"}],"quality_controlled":"1","oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"arxiv":["2101.03928"]},"language":[{"iso":"eng"}],"doi":"10.7155/jgaa.00591"},{"type":"journal_article","abstract":[{"text":"Isomanifolds are the generalization of isosurfaces to arbitrary dimension and codimension, i.e. manifolds defined as the zero set of some multivariate vector-valued smooth function f : Rd → Rd−n. A natural (and efficient) way to approximate an isomanifold is to consider its Piecewise-Linear (PL) approximation based on a triangulation T of the ambient space Rd. In this paper, we give conditions under which the PL-approximation of an isomanifold is topologically equivalent to the isomanifold. The conditions are easy to satisfy in the sense that they can always be met by taking a sufficiently\r\nfine triangulation T . This contrasts with previous results on the triangulation of manifolds where, in arbitrary dimensions, delicate perturbations are needed to guarantee topological correctness, which leads to strong limitations in practice. We further give a bound on the Fréchet distance between the original isomanifold and its PL-approximation. Finally we show analogous results for the PL-approximation of an isomanifold with boundary.","lang":"eng"}],"intvolume":" 22","ddc":["516"],"title":"The topological correctness of PL approximations of isomanifolds","status":"public","_id":"9649","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","oa_version":"Published Version","file":[{"relation":"main_file","file_id":"9650","date_created":"2021-07-14T06:44:36Z","date_updated":"2021-07-14T06:44:36Z","checksum":"f1d372ec3c08ec22e84f8e93e1126b8c","file_name":"Boissonnat-Wintraecken2021_Article_TheTopologicalCorrectnessOfPLA.pdf","access_level":"open_access","content_type":"application/pdf","file_size":1455699,"creator":"mwintrae"}],"scopus_import":"1","article_processing_charge":"Yes (via OA deal)","has_accepted_license":"1","day":"01","page":"967-1012","article_type":"original","citation":{"ama":"Boissonnat J-D, Wintraecken M. The topological correctness of PL approximations of isomanifolds. Foundations of Computational Mathematics . 2022;22:967-1012. doi:10.1007/s10208-021-09520-0","apa":"Boissonnat, J.-D., & Wintraecken, M. (2022). The topological correctness of PL approximations of isomanifolds. Foundations of Computational Mathematics . Springer Nature. https://doi.org/10.1007/s10208-021-09520-0","ieee":"J.-D. Boissonnat and M. Wintraecken, “The topological correctness of PL approximations of isomanifolds,” Foundations of Computational Mathematics , vol. 22. Springer Nature, pp. 967–1012, 2022.","ista":"Boissonnat J-D, Wintraecken M. 2022. The topological correctness of PL approximations of isomanifolds. Foundations of Computational Mathematics . 22, 967–1012.","short":"J.-D. Boissonnat, M. Wintraecken, Foundations of Computational Mathematics 22 (2022) 967–1012.","mla":"Boissonnat, Jean-Daniel, and Mathijs Wintraecken. “The Topological Correctness of PL Approximations of Isomanifolds.” Foundations of Computational Mathematics , vol. 22, Springer Nature, 2022, pp. 967–1012, doi:10.1007/s10208-021-09520-0.","chicago":"Boissonnat, Jean-Daniel, and Mathijs Wintraecken. “The Topological Correctness of PL Approximations of Isomanifolds.” Foundations of Computational Mathematics . Springer Nature, 2022. https://doi.org/10.1007/s10208-021-09520-0."},"publication":"Foundations of Computational Mathematics ","date_published":"2022-01-01T00:00:00Z","ec_funded":1,"file_date_updated":"2021-07-14T06:44:36Z","department":[{"_id":"HeEd"}],"publisher":"Springer Nature","publication_status":"published","acknowledgement":"First and foremost, we acknowledge Siargey Kachanovich for discussions. We thank Herbert Edelsbrunner and all members of his group, all former and current members of the Datashape team (formerly known as Geometrica), and André Lieutier for encouragement. We further thank the reviewers of Foundations of Computational Mathematics and the reviewers and program committee of the Symposium on Computational Geometry for their feedback, which improved the exposition.\r\nThis work was funded by the European Research Council under the European Union’s ERC Grant Agreement number 339025 GUDHI (Algorithmic Foundations of Geometric Understanding in Higher Dimensions). This work was also supported by the French government, through the 3IA Côte d’Azur Investments in the Future project managed by the National Research Agency (ANR) with the reference number ANR-19-P3IA-0002. Mathijs Wintraecken also received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement no. 754411.","year":"2022","volume":22,"date_created":"2021-07-14T06:44:53Z","date_updated":"2023-08-02T06:49:17Z","related_material":{"record":[{"status":"public","relation":"earlier_version","id":"7952"}]},"author":[{"last_name":"Boissonnat","first_name":"Jean-Daniel","full_name":"Boissonnat, Jean-Daniel"},{"full_name":"Wintraecken, Mathijs","id":"307CFBC8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-7472-2220","first_name":"Mathijs","last_name":"Wintraecken"}],"publication_identifier":{"eissn":["1615-3383"]},"month":"0","project":[{"call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","isi":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"isi":["000673039600001"]},"oa":1,"language":[{"iso":"eng"}],"doi":"10.1007/s10208-021-09520-0"}]