[{"external_id":{"isi":["000846967100001"]},"isi":1,"year":"2023","project":[{"call_identifier":"H2020","grant_number":"788183","name":"Alpha Shape Theory Extended","_id":"266A2E9E-B435-11E9-9278-68D0E5697425"},{"_id":"268116B8-B435-11E9-9278-68D0E5697425","grant_number":"Z00342","name":"The Wittgenstein Prize","call_identifier":"FWF"},{"_id":"2561EBF4-B435-11E9-9278-68D0E5697425","grant_number":"I02979-N35","name":"Persistence and stability of geometric complexes","call_identifier":"FWF"}],"publication":"Algorithmica","status":"public","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.","date_published":"2023-01-01T00:00:00Z","ec_funded":1,"publisher":"Springer Nature","doi":"10.1007/s00453-022-01027-6","article_processing_charge":"Yes (via OA deal)","type":"journal_article","date_updated":"2023-06-27T12:53:43Z","_id":"12086","ddc":["510"],"page":"277-295","quality_controlled":"1","month":"01","file":[{"file_id":"12322","date_created":"2023-01-20T10:02:48Z","file_size":911017,"creator":"dernst","date_updated":"2023-01-20T10:02:48Z","relation":"main_file","checksum":"71685ca5121f4c837f40c3f8eb50c915","file_name":"2023_Algorithmica_Edelsbrunner.pdf","success":1,"content_type":"application/pdf","access_level":"open_access"}],"department":[{"_id":"HeEd"}],"language":[{"iso":"eng"}],"oa":1,"user_id":"2EBD1598-F248-11E8-B48F-1D18A9856A87","citation":{"ama":"Edelsbrunner H, Osang GF. A simple algorithm for higher-order Delaunay mosaics and alpha shapes. <i>Algorithmica</i>. 2023;85:277-295. doi:<a href=\"https://doi.org/10.1007/s00453-022-01027-6\">10.1007/s00453-022-01027-6</a>","short":"H. Edelsbrunner, G.F. Osang, Algorithmica 85 (2023) 277–295.","ieee":"H. Edelsbrunner and G. F. Osang, “A simple algorithm for higher-order Delaunay mosaics and alpha shapes,” <i>Algorithmica</i>, vol. 85. Springer Nature, pp. 277–295, 2023.","ista":"Edelsbrunner H, Osang GF. 2023. A simple algorithm for higher-order Delaunay mosaics and alpha shapes. Algorithmica. 85, 277–295.","chicago":"Edelsbrunner, Herbert, and Georg F Osang. “A Simple Algorithm for Higher-Order Delaunay Mosaics and Alpha Shapes.” <i>Algorithmica</i>. Springer Nature, 2023. <a href=\"https://doi.org/10.1007/s00453-022-01027-6\">https://doi.org/10.1007/s00453-022-01027-6</a>.","mla":"Edelsbrunner, Herbert, and Georg F. Osang. “A Simple Algorithm for Higher-Order Delaunay Mosaics and Alpha Shapes.” <i>Algorithmica</i>, vol. 85, Springer Nature, 2023, pp. 277–95, doi:<a href=\"https://doi.org/10.1007/s00453-022-01027-6\">10.1007/s00453-022-01027-6</a>.","apa":"Edelsbrunner, H., &#38; Osang, G. F. (2023). A simple algorithm for higher-order Delaunay mosaics and alpha shapes. <i>Algorithmica</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00453-022-01027-6\">https://doi.org/10.1007/s00453-022-01027-6</a>"},"title":"A simple algorithm for higher-order Delaunay mosaics and alpha shapes","oa_version":"Published Version","author":[{"first_name":"Herbert","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert"},{"first_name":"Georg F","last_name":"Osang","id":"464B40D6-F248-11E8-B48F-1D18A9856A87","full_name":"Osang, Georg F"}],"scopus_import":"1","day":"01","article_type":"original","date_created":"2022-09-11T22:01:57Z","volume":85,"intvolume":"        85","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","image":"/images/cc_by.png","short":"CC BY (4.0)"},"abstract":[{"text":"We present a simple algorithm for computing higher-order Delaunay mosaics that works in Euclidean spaces of any finite dimensions. The algorithm selects the vertices of the order-k mosaic from incrementally constructed lower-order mosaics and uses an algorithm for weighted first-order Delaunay mosaics as a black-box to construct the order-k mosaic from its vertices. Beyond this black-box, the algorithm uses only combinatorial operations, thus facilitating easy implementation. We extend this algorithm to compute higher-order α-shapes and provide open-source implementations. We present experimental results for properties of higher-order Delaunay mosaics of random point sets.","lang":"eng"}],"has_accepted_license":"1","publication_status":"published","publication_identifier":{"issn":["0178-4617"],"eissn":["1432-0541"]},"file_date_updated":"2023-01-20T10:02:48Z"},{"status":"public","publication":"Discrete and Computational Geometry","acknowledgement":"We thank the anonymous reviewers for many helpful comments and suggestions, which led to substantial improvements of the paper. The first two authors were supported by the Austrian Science Fund (FWF) grant number P 29984-N35 and W1230. The first author was partly supported by an Austrian Marshall Plan Scholarship, and by the Brummer & Partners MathDataLab. A conference version of this paper was presented at the 37th International Symposium on Computational Geometry (SoCG 2021). Open access funding provided by the Royal Institute of Technology.","date_published":"2023-09-01T00:00:00Z","year":"2023","isi":1,"related_material":{"record":[{"relation":"earlier_version","status":"public","id":"9605"}]},"external_id":{"isi":["000936496800001"],"arxiv":["2103.07823"]},"page":"376-405","ddc":["000"],"quality_controlled":"1","article_processing_charge":"Yes (via OA deal)","doi":"10.1007/s00454-022-00476-8","publisher":"Springer Nature","_id":"12709","date_updated":"2023-10-04T12:03:40Z","type":"journal_article","oa":1,"language":[{"iso":"eng"}],"citation":{"ama":"Corbet R, Kerber M, Lesnick M, Osang GF. Computing the multicover bifiltration. <i>Discrete and Computational Geometry</i>. 2023;70:376-405. doi:<a href=\"https://doi.org/10.1007/s00454-022-00476-8\">10.1007/s00454-022-00476-8</a>","ieee":"R. Corbet, M. Kerber, M. Lesnick, and G. F. Osang, “Computing the multicover bifiltration,” <i>Discrete and Computational Geometry</i>, vol. 70. Springer Nature, pp. 376–405, 2023.","short":"R. Corbet, M. Kerber, M. Lesnick, G.F. Osang, Discrete and Computational Geometry 70 (2023) 376–405.","ista":"Corbet R, Kerber M, Lesnick M, Osang GF. 2023. Computing the multicover bifiltration. Discrete and Computational Geometry. 70, 376–405.","chicago":"Corbet, René, Michael Kerber, Michael Lesnick, and Georg F Osang. “Computing the Multicover Bifiltration.” <i>Discrete and Computational Geometry</i>. Springer Nature, 2023. <a href=\"https://doi.org/10.1007/s00454-022-00476-8\">https://doi.org/10.1007/s00454-022-00476-8</a>.","apa":"Corbet, R., Kerber, M., Lesnick, M., &#38; Osang, G. F. (2023). Computing the multicover bifiltration. <i>Discrete and Computational Geometry</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00454-022-00476-8\">https://doi.org/10.1007/s00454-022-00476-8</a>","mla":"Corbet, René, et al. “Computing the Multicover Bifiltration.” <i>Discrete and Computational Geometry</i>, vol. 70, Springer Nature, 2023, pp. 376–405, doi:<a href=\"https://doi.org/10.1007/s00454-022-00476-8\">10.1007/s00454-022-00476-8</a>."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"09","arxiv":1,"department":[{"_id":"HeEd"}],"file":[{"date_created":"2023-03-07T14:40:14Z","file_size":1359323,"date_updated":"2023-03-07T14:40:14Z","creator":"cchlebak","file_id":"12715","file_name":"2023_DisCompGeo_Corbet.pdf","success":1,"content_type":"application/pdf","access_level":"open_access","relation":"main_file","checksum":"71ce7e59f7ee4620acc704fecca620c2"}],"has_accepted_license":"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","image":"/images/cc_by.png","short":"CC BY (4.0)"},"abstract":[{"text":"Given a finite set A ⊂ ℝ^d, let Cov_{r,k} denote the set of all points within distance r to at least k points of A. Allowing r and k to vary, we obtain a 2-parameter family of spaces that grow larger when r increases or k decreases, called the multicover bifiltration. Motivated by the problem of computing the homology of this bifiltration, we introduce two closely related combinatorial bifiltrations, one polyhedral and the other simplicial, which are both topologically equivalent to the multicover bifiltration and far smaller than a Čech-based model considered in prior work of Sheehy. Our polyhedral construction is a bifiltration of the rhomboid tiling of Edelsbrunner and Osang, and can be efficiently computed using a variant of an algorithm given by these authors as well. Using an implementation for dimension 2 and 3, we provide experimental results. Our simplicial construction is useful for understanding the polyhedral construction and proving its correctness.","lang":"eng"}],"intvolume":"        70","file_date_updated":"2023-03-07T14:40:14Z","publication_status":"published","publication_identifier":{"eissn":["1432-0444"],"issn":["0179-5376"]},"scopus_import":"1","day":"01","author":[{"full_name":"Corbet, René","last_name":"Corbet","first_name":"René"},{"orcid":"0000-0002-8030-9299","first_name":"Michael","full_name":"Kerber, Michael","id":"36E4574A-F248-11E8-B48F-1D18A9856A87","last_name":"Kerber"},{"first_name":"Michael","full_name":"Lesnick, Michael","last_name":"Lesnick"},{"orcid":"0000-0002-8882-5116","first_name":"Georg F","id":"464B40D6-F248-11E8-B48F-1D18A9856A87","full_name":"Osang, Georg F","last_name":"Osang"}],"oa_version":"Published Version","title":"Computing the multicover bifiltration","volume":70,"date_created":"2023-03-05T23:01:06Z","article_type":"original"},{"month":"02","supervisor":[{"first_name":"Herbert","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"}],"file":[{"file_id":"9063","date_created":"2021-02-02T14:09:25Z","file_size":13446994,"date_updated":"2021-02-03T10:37:28Z","creator":"patrickd","relation":"source_file","checksum":"bcf27986147cab0533b6abadd74e7629","file_name":"thesis_source.zip","content_type":"application/zip","access_level":"closed"},{"checksum":"9cc8af266579a464385bbe2aff6af606","relation":"main_file","access_level":"open_access","content_type":"application/pdf","success":1,"file_name":"thesis_pdfA2b.pdf","file_id":"9064","creator":"patrickd","date_updated":"2021-02-02T14:09:18Z","date_created":"2021-02-02T14:09:18Z","file_size":5210329}],"department":[{"_id":"HeEd"},{"_id":"GradSch"}],"language":[{"iso":"eng"}],"oa":1,"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"short":"G.F. Osang, Multi-Cover Persistence and Delaunay Mosaics, Institute of Science and Technology Austria, 2021.","ieee":"G. F. Osang, “Multi-cover persistence and Delaunay mosaics,” Institute of Science and Technology Austria, Klosterneuburg, 2021.","ama":"Osang GF. Multi-cover persistence and Delaunay mosaics. 2021. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:9056\">10.15479/AT:ISTA:9056</a>","mla":"Osang, Georg F. <i>Multi-Cover Persistence and Delaunay Mosaics</i>. Institute of Science and Technology Austria, 2021, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:9056\">10.15479/AT:ISTA:9056</a>.","apa":"Osang, G. F. (2021). <i>Multi-cover persistence and Delaunay mosaics</i>. Institute of Science and Technology Austria, Klosterneuburg. <a href=\"https://doi.org/10.15479/AT:ISTA:9056\">https://doi.org/10.15479/AT:ISTA:9056</a>","chicago":"Osang, Georg F. “Multi-Cover Persistence and Delaunay Mosaics.” Institute of Science and Technology Austria, 2021. <a href=\"https://doi.org/10.15479/AT:ISTA:9056\">https://doi.org/10.15479/AT:ISTA:9056</a>.","ista":"Osang GF. 2021. Multi-cover persistence and Delaunay mosaics. Klosterneuburg: Institute of Science and Technology Austria."},"place":"Klosterneuburg","title":"Multi-cover persistence and Delaunay mosaics","oa_version":"Published Version","author":[{"full_name":"Osang, Georg F","id":"464B40D6-F248-11E8-B48F-1D18A9856A87","last_name":"Osang","orcid":"0000-0002-8882-5116","first_name":"Georg F"}],"day":"01","date_created":"2021-02-02T14:11:06Z","abstract":[{"text":"In this thesis we study persistence of multi-covers of Euclidean balls and the geometric structures underlying their computation, in particular Delaunay mosaics and Voronoi tessellations. The k-fold cover for some discrete input point set consists of the space where at least k balls of radius r around the input points overlap. Persistence is a notion that captures, in some sense, the topology of the shape underlying the input. While persistence is usually computed for the union of balls, the k-fold cover is of interest as it captures local density,\r\nand thus might approximate the shape of the input better if the input data is noisy. To compute persistence of these k-fold covers, we need a discretization that is provided by higher-order Delaunay mosaics. We present and implement a simple and efficient algorithm for the computation of higher-order Delaunay mosaics, and use it to give experimental results for their combinatorial properties. The algorithm makes use of a new geometric structure, the rhomboid tiling. It contains the higher-order Delaunay mosaics as slices, and by introducing a filtration\r\nfunction on the tiling, we also obtain higher-order α-shapes as slices. These allow us to compute persistence of the multi-covers for varying radius r; the computation for varying k is less straight-foward and involves the rhomboid tiling directly. We apply our algorithms to experimental sphere packings to shed light on their structural properties. Finally, inspired by periodic structures in packings and materials, we propose and implement an algorithm for periodic Delaunay triangulations to be integrated into the Computational Geometry Algorithms Library (CGAL), and discuss the implications on persistence for periodic data sets.","lang":"eng"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)"},"has_accepted_license":"1","publication_status":"published","publication_identifier":{"issn":["2663-337X"]},"file_date_updated":"2021-02-03T10:37:28Z","related_material":{"record":[{"id":"187","status":"public","relation":"part_of_dissertation"},{"id":"8703","relation":"part_of_dissertation","status":"public"}]},"year":"2021","status":"public","degree_awarded":"PhD","date_published":"2021-02-01T00:00:00Z","publisher":"Institute of Science and Technology Austria","doi":"10.15479/AT:ISTA:9056","alternative_title":["ISTA Thesis"],"article_processing_charge":"No","type":"dissertation","date_updated":"2023-09-07T13:29:01Z","_id":"9056","ddc":["006","514","516"],"page":"134"},{"file":[{"file_id":"10394","creator":"cchlebak","date_updated":"2021-12-01T10:56:53Z","file_size":677704,"date_created":"2021-12-01T10:56:53Z","checksum":"59b4e1e827e494209bcb4aae22e1d347","relation":"main_file","content_type":"application/pdf","access_level":"open_access","file_name":"2021_DisCompGeo_Edelsbrunner_Osang.pdf","success":1}],"department":[{"_id":"HeEd"}],"month":"03","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","citation":{"apa":"Edelsbrunner, H., &#38; Osang, G. F. (2021). The multi-cover persistence of Euclidean balls. <i>Discrete and Computational Geometry</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00454-021-00281-9\">https://doi.org/10.1007/s00454-021-00281-9</a>","mla":"Edelsbrunner, Herbert, and Georg F. Osang. “The Multi-Cover Persistence of Euclidean Balls.” <i>Discrete and Computational Geometry</i>, vol. 65, Springer Nature, 2021, pp. 1296–1313, doi:<a href=\"https://doi.org/10.1007/s00454-021-00281-9\">10.1007/s00454-021-00281-9</a>.","chicago":"Edelsbrunner, Herbert, and Georg F Osang. “The Multi-Cover Persistence of Euclidean Balls.” <i>Discrete and Computational Geometry</i>. Springer Nature, 2021. <a href=\"https://doi.org/10.1007/s00454-021-00281-9\">https://doi.org/10.1007/s00454-021-00281-9</a>.","ista":"Edelsbrunner H, Osang GF. 2021. The multi-cover persistence of Euclidean balls. Discrete and Computational Geometry. 65, 1296–1313.","ieee":"H. Edelsbrunner and G. F. Osang, “The multi-cover persistence of Euclidean balls,” <i>Discrete and Computational Geometry</i>, vol. 65. Springer Nature, pp. 1296–1313, 2021.","short":"H. Edelsbrunner, G.F. Osang, Discrete and Computational Geometry 65 (2021) 1296–1313.","ama":"Edelsbrunner H, Osang GF. The multi-cover persistence of Euclidean balls. <i>Discrete and Computational Geometry</i>. 2021;65:1296–1313. doi:<a href=\"https://doi.org/10.1007/s00454-021-00281-9\">10.1007/s00454-021-00281-9</a>"},"language":[{"iso":"eng"}],"oa":1,"date_created":"2021-04-11T22:01:15Z","article_type":"original","volume":65,"oa_version":"Published Version","title":"The multi-cover persistence of Euclidean balls","day":"31","scopus_import":"1","author":[{"first_name":"Herbert","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert"},{"id":"464B40D6-F248-11E8-B48F-1D18A9856A87","full_name":"Osang, Georg F","last_name":"Osang","first_name":"Georg F"}],"file_date_updated":"2021-12-01T10:56:53Z","publication_status":"published","publication_identifier":{"eissn":["1432-0444"],"issn":["0179-5376"]},"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","image":"/images/cc_by.png","short":"CC BY (4.0)"},"intvolume":"        65","abstract":[{"lang":"eng","text":"Given a locally finite X⊆Rd and a radius r≥0, the k-fold cover of X and r consists of all points in Rd that have k or more points of X within distance r. We consider two filtrations—one in scale obtained by fixing k and increasing r, and the other in depth obtained by fixing r and decreasing k—and we compute the persistence diagrams of both. While standard methods suffice for the filtration in scale, we need novel geometric and topological concepts for the filtration in depth. In particular, we introduce a rhomboid tiling in Rd+1 whose horizontal integer slices are the order-k Delaunay mosaics of X, and construct a zigzag module of Delaunay mosaics that is isomorphic to the persistence module of the multi-covers."}],"has_accepted_license":"1","related_material":{"record":[{"status":"public","relation":"earlier_version","id":"187"}]},"external_id":{"isi":["000635460400001"]},"isi":1,"year":"2021","date_published":"2021-03-31T00:00:00Z","acknowledgement":"This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (Grant Agreement No. 78818 Alpha), and by the DFG Collaborative Research Center TRR 109, ‘Discretization in Geometry and Dynamics’, through Grant No. I02979-N35 of the Austrian Science Fund (FWF)\r\nOpen Access funding provided by the Institute of Science and Technology (IST Austria).","ec_funded":1,"publication":"Discrete and Computational Geometry","status":"public","project":[{"call_identifier":"H2020","name":"Alpha Shape Theory Extended","grant_number":"788183","_id":"266A2E9E-B435-11E9-9278-68D0E5697425"},{"_id":"2561EBF4-B435-11E9-9278-68D0E5697425","name":"Persistence and stability of geometric complexes","grant_number":"I02979-N35","call_identifier":"FWF"}],"type":"journal_article","_id":"9317","date_updated":"2023-08-07T14:35:44Z","publisher":"Springer Nature","article_processing_charge":"Yes (via OA deal)","doi":"10.1007/s00454-021-00281-9","quality_controlled":"1","ddc":["516"],"page":"1296–1313"},{"year":"2021","status":"public","publication":"Journal of Geometry","date_published":"2021-04-01T00:00:00Z","doi":"10.1007/s00022-021-00577-4","article_processing_charge":"Yes (via OA deal)","publisher":"Springer Nature","date_updated":"2022-05-12T11:41:45Z","_id":"9465","type":"journal_article","ddc":["510"],"quality_controlled":"1","month":"04","department":[{"_id":"HeEd"}],"article_number":"15","file":[{"checksum":"e52a832f1def52a2b23d21bcc09e646f","relation":"main_file","access_level":"open_access","content_type":"application/pdf","success":1,"file_name":"2021_Geometry_Edelsbrunner.pdf","file_id":"9544","date_updated":"2021-06-11T13:16:26Z","creator":"kschuh","file_size":694706,"date_created":"2021-06-11T13:16:26Z"}],"oa":1,"language":[{"iso":"eng"}],"issue":"1","citation":{"ama":"Edelsbrunner H, Nikitenko A, Osang GF. A step in the Delaunay mosaic of order k. <i>Journal of Geometry</i>. 2021;112(1). doi:<a href=\"https://doi.org/10.1007/s00022-021-00577-4\">10.1007/s00022-021-00577-4</a>","short":"H. Edelsbrunner, A. Nikitenko, G.F. Osang, Journal of Geometry 112 (2021).","ieee":"H. Edelsbrunner, A. Nikitenko, and G. F. Osang, “A step in the Delaunay mosaic of order k,” <i>Journal of Geometry</i>, vol. 112, no. 1. Springer Nature, 2021.","chicago":"Edelsbrunner, Herbert, Anton Nikitenko, and Georg F Osang. “A Step in the Delaunay Mosaic of Order K.” <i>Journal of Geometry</i>. Springer Nature, 2021. <a href=\"https://doi.org/10.1007/s00022-021-00577-4\">https://doi.org/10.1007/s00022-021-00577-4</a>.","ista":"Edelsbrunner H, Nikitenko A, Osang GF. 2021. A step in the Delaunay mosaic of order k. Journal of Geometry. 112(1), 15.","mla":"Edelsbrunner, Herbert, et al. “A Step in the Delaunay Mosaic of Order K.” <i>Journal of Geometry</i>, vol. 112, no. 1, 15, Springer Nature, 2021, doi:<a href=\"https://doi.org/10.1007/s00022-021-00577-4\">10.1007/s00022-021-00577-4</a>.","apa":"Edelsbrunner, H., Nikitenko, A., &#38; Osang, G. F. (2021). A step in the Delaunay mosaic of order k. <i>Journal of Geometry</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00022-021-00577-4\">https://doi.org/10.1007/s00022-021-00577-4</a>"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833","first_name":"Herbert"},{"last_name":"Nikitenko","id":"3E4FF1BA-F248-11E8-B48F-1D18A9856A87","full_name":"Nikitenko, Anton","first_name":"Anton"},{"id":"464B40D6-F248-11E8-B48F-1D18A9856A87","full_name":"Osang, Georg F","last_name":"Osang","first_name":"Georg F"}],"day":"01","scopus_import":"1","title":"A step in the Delaunay mosaic of order k","oa_version":"Published Version","volume":112,"article_type":"original","date_created":"2021-06-06T22:01:29Z","has_accepted_license":"1","intvolume":"       112","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","image":"/images/cc_by.png","short":"CC BY (4.0)"},"abstract":[{"text":"Given a locally finite set 𝑋⊆ℝ𝑑 and an integer 𝑘≥0, we consider the function 𝐰𝑘:Del𝑘(𝑋)→ℝ on the dual of the order-k Voronoi tessellation, whose sublevel sets generalize the notion of alpha shapes from order-1 to order-k (Edelsbrunner et al. in IEEE Trans Inf Theory IT-29:551–559, 1983; Krasnoshchekov and Polishchuk in Inf Process Lett 114:76–83, 2014). While this function is not necessarily generalized discrete Morse, in the sense of Forman (Adv Math 134:90–145, 1998) and Freij (Discrete Math 309:3821–3829, 2009), we prove that it satisfies similar properties so that its increments can be meaningfully classified into critical and non-critical steps. This result extends to the case of weighted points and sheds light on k-fold covers with balls in Euclidean space.","lang":"eng"}],"publication_identifier":{"issn":["00472468"],"eissn":["14208997"]},"publication_status":"published","file_date_updated":"2021-06-11T13:16:26Z"},{"has_accepted_license":"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","image":"/images/cc_by.png","short":"CC BY (4.0)"},"abstract":[{"lang":"eng","text":"Given a finite set A ⊂ ℝ^d, let Cov_{r,k} denote the set of all points within distance r to at least k points of A. Allowing r and k to vary, we obtain a 2-parameter family of spaces that grow larger when r increases or k decreases, called the multicover bifiltration. Motivated by the problem of computing the homology of this bifiltration, we introduce two closely related combinatorial bifiltrations, one polyhedral and the other simplicial, which are both topologically equivalent to the multicover bifiltration and far smaller than a Čech-based model considered in prior work of Sheehy. Our polyhedral construction is a bifiltration of the rhomboid tiling of Edelsbrunner and Osang, and can be efficiently computed using a variant of an algorithm given by these authors as well. Using an implementation for dimension 2 and 3, we provide experimental results. Our simplicial construction is useful for understanding the polyhedral construction and proving its correctness. "}],"intvolume":"       189","file_date_updated":"2021-06-28T12:40:47Z","publication_identifier":{"issn":["18688969"],"isbn":["9783959771849"]},"publication_status":"published","day":"02","scopus_import":"1","author":[{"last_name":"Corbet","full_name":"Corbet, René","first_name":"René"},{"full_name":"Kerber, Michael","last_name":"Kerber","first_name":"Michael"},{"first_name":"Michael","last_name":"Lesnick","full_name":"Lesnick, Michael"},{"first_name":"Georg F","orcid":"0000-0002-8882-5116","last_name":"Osang","full_name":"Osang, Georg F","id":"464B40D6-F248-11E8-B48F-1D18A9856A87"}],"oa_version":"Published Version","title":"Computing the multicover bifiltration","volume":189,"date_created":"2021-06-27T22:01:49Z","oa":1,"language":[{"iso":"eng"}],"citation":{"chicago":"Corbet, René, Michael Kerber, Michael Lesnick, and Georg F Osang. “Computing the Multicover Bifiltration.” In <i>Leibniz International Proceedings in Informatics</i>, Vol. 189. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2021.27\">https://doi.org/10.4230/LIPIcs.SoCG.2021.27</a>.","ista":"Corbet R, Kerber M, Lesnick M, Osang GF. 2021. Computing the multicover bifiltration. Leibniz International Proceedings in Informatics. SoCG: International Symposium on Computational Geometry, LIPIcs, vol. 189, 27.","apa":"Corbet, R., Kerber, M., Lesnick, M., &#38; Osang, G. F. (2021). Computing the multicover bifiltration. In <i>Leibniz International Proceedings in Informatics</i> (Vol. 189). Online: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2021.27\">https://doi.org/10.4230/LIPIcs.SoCG.2021.27</a>","mla":"Corbet, René, et al. “Computing the Multicover Bifiltration.” <i>Leibniz International Proceedings in Informatics</i>, vol. 189, 27, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021, doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2021.27\">10.4230/LIPIcs.SoCG.2021.27</a>.","ama":"Corbet R, Kerber M, Lesnick M, Osang GF. Computing the multicover bifiltration. In: <i>Leibniz International Proceedings in Informatics</i>. Vol 189. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2021. doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2021.27\">10.4230/LIPIcs.SoCG.2021.27</a>","ieee":"R. Corbet, M. Kerber, M. Lesnick, and G. F. Osang, “Computing the multicover bifiltration,” in <i>Leibniz International Proceedings in Informatics</i>, Online, 2021, vol. 189.","short":"R. Corbet, M. Kerber, M. Lesnick, G.F. Osang, in:, Leibniz International Proceedings in Informatics, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021."},"user_id":"D865714E-FA4E-11E9-B85B-F5C5E5697425","arxiv":1,"month":"06","department":[{"_id":"HeEd"}],"file":[{"file_size":"1367983","date_created":"2021-06-28T12:40:47Z","creator":"cziletti","date_updated":"2021-06-28T12:40:47Z","file_id":"9610","success":1,"file_name":"2021_LIPIcs_Corbet.pdf","access_level":"open_access","content_type":"application/pdf","relation":"main_file","checksum":"0de217501e7ba8b267d58deed0d51761"}],"article_number":"27","ddc":["516"],"quality_controlled":"1","alternative_title":["LIPIcs"],"article_processing_charge":"No","doi":"10.4230/LIPIcs.SoCG.2021.27","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","_id":"9605","date_updated":"2023-10-04T12:03:39Z","type":"conference","publication":"Leibniz International Proceedings in Informatics","status":"public","acknowledgement":"The authors want to thank the reviewers for many helpful comments and suggestions.","date_published":"2021-06-02T00:00:00Z","conference":{"name":"SoCG: International Symposium on Computational Geometry","start_date":"2021-06-07","end_date":"2021-06-11","location":"Online"},"year":"2021","related_material":{"record":[{"id":"12709","status":"public","relation":"later_version"}],"link":[{"url":"https://arxiv.org/abs/2103.07823","relation":"extended_version"}]},"external_id":{"arxiv":["2103.07823"]}},{"quality_controlled":"1","page":"9107-9115","ddc":["540"],"_id":"10204","date_updated":"2023-10-03T09:24:27Z","type":"journal_article","article_processing_charge":"No","doi":"10.1039/d1sm00774b","publisher":"Royal Society of Chemistry ","ec_funded":1,"pmid":1,"date_published":"2021-10-20T00:00:00Z","acknowledgement":"MS acknowledges the support by Australian Research Council funding through the ARC Training Centre for M3D Innovation (IC180100008). MS thanks M. Hanifpour and N. Francois for their input and valuable discussions. 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 and from the Wittgenstein Prize, Austrian Science Fund (FWF), grant no. Z 342-N31.","status":"public","publication":"Soft Matter","project":[{"_id":"266A2E9E-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"788183","name":"Alpha Shape Theory Extended"},{"_id":"268116B8-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"Z00342","name":"The Wittgenstein Prize"}],"isi":1,"year":"2021","external_id":{"isi":["000700090000001"],"pmid":["34569592"]},"file_date_updated":"2023-10-03T09:21:42Z","publication_status":"published","publication_identifier":{"eissn":["1744-6848"],"issn":["1744-683X"]},"has_accepted_license":"1","intvolume":"        17","abstract":[{"text":"Two common representations of close packings of identical spheres consisting of hexagonal layers, called Barlow stackings, appear abundantly in minerals and metals. These motifs, however, occupy an identical portion of space and bear identical first-order topological signatures as measured by persistent homology. Here we present a novel method based on k-fold covers that unambiguously distinguishes between these patterns. Moreover, our approach provides topological evidence that the FCC motif is the more stable of the two in the context of evolving experimental sphere packings during the transition from disordered to an ordered state. We conclude that our approach can be generalised to distinguish between various Barlow stackings manifested in minerals and metals.","lang":"eng"}],"volume":17,"date_created":"2021-10-31T23:01:30Z","article_type":"original","day":"20","scopus_import":"1","author":[{"orcid":"0000-0002-8882-5116","first_name":"Georg F","id":"464B40D6-F248-11E8-B48F-1D18A9856A87","full_name":"Osang, Georg F","last_name":"Osang"},{"last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert","first_name":"Herbert","orcid":"0000-0002-9823-6833"},{"full_name":"Saadatfar, Mohammad","last_name":"Saadatfar","first_name":"Mohammad"}],"title":"Topological signatures and stability of hexagonal close packing and Barlow stackings","oa_version":"Submitted Version","citation":{"ama":"Osang GF, Edelsbrunner H, Saadatfar M. Topological signatures and stability of hexagonal close packing and Barlow stackings. <i>Soft Matter</i>. 2021;17(40):9107-9115. doi:<a href=\"https://doi.org/10.1039/d1sm00774b\">10.1039/d1sm00774b</a>","ieee":"G. F. Osang, H. Edelsbrunner, and M. Saadatfar, “Topological signatures and stability of hexagonal close packing and Barlow stackings,” <i>Soft Matter</i>, vol. 17, no. 40. Royal Society of Chemistry , pp. 9107–9115, 2021.","short":"G.F. Osang, H. Edelsbrunner, M. Saadatfar, Soft Matter 17 (2021) 9107–9115.","chicago":"Osang, Georg F, Herbert Edelsbrunner, and Mohammad Saadatfar. “Topological Signatures and Stability of Hexagonal Close Packing and Barlow Stackings.” <i>Soft Matter</i>. Royal Society of Chemistry , 2021. <a href=\"https://doi.org/10.1039/d1sm00774b\">https://doi.org/10.1039/d1sm00774b</a>.","ista":"Osang GF, Edelsbrunner H, Saadatfar M. 2021. Topological signatures and stability of hexagonal close packing and Barlow stackings. Soft Matter. 17(40), 9107–9115.","apa":"Osang, G. F., Edelsbrunner, H., &#38; Saadatfar, M. (2021). Topological signatures and stability of hexagonal close packing and Barlow stackings. <i>Soft Matter</i>. Royal Society of Chemistry . <a href=\"https://doi.org/10.1039/d1sm00774b\">https://doi.org/10.1039/d1sm00774b</a>","mla":"Osang, Georg F., et al. “Topological Signatures and Stability of Hexagonal Close Packing and Barlow Stackings.” <i>Soft Matter</i>, vol. 17, no. 40, Royal Society of Chemistry , 2021, pp. 9107–15, doi:<a href=\"https://doi.org/10.1039/d1sm00774b\">10.1039/d1sm00774b</a>."},"issue":"40","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"language":[{"iso":"eng"}],"department":[{"_id":"HeEd"}],"file":[{"file_id":"14385","date_updated":"2023-10-03T09:21:42Z","creator":"dernst","date_created":"2023-10-03T09:21:42Z","file_size":4678788,"checksum":"b4da0c420530295e61b153960f6cb350","relation":"main_file","access_level":"open_access","content_type":"application/pdf","success":1,"file_name":"2021_SoftMatter_acceptedversion_Osang.pdf"}],"month":"10"},{"status":"public","publication":"59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing, Tutorial Abstracts","acknowledgement":"We would like to thank Abby Schantz, Abe Ittycheriah, Aliaksei Severyn, Allan Heydon, Aly\r\nGrealish, Andrey Vlasov, Arkaitz Zubiaga, Ashwin Kakarla, Chen Sun, Clayton Williams, Cong\r\nYu, Cordelia Schmid, Da-Cheng Juan, Dan Finnie, Dani Valevski, Daniel Rocha, David Price, David Sklar, Devi Krishna, Elena Kochkina, Enrique Alfonseca, Franc¸oise Beaufays, Isabelle Augenstein, Jialu Liu, John Cantwell, John Palowitch, Jordan Boyd-Graber, Lei Shi, Luis Valente, Maria Voitovich, Mehmet Aktuna, Mogan Brown, Mor Naaman, Natalia P, Nidhi Hebbar, Pete Aykroyd, Rahul Sukthankar, Richa Dixit, Steve Pucci, Tania Bedrax-Weiss, Tobias Kaufmann, Tom Boulos, Tu Tsao, Vladimir Chtchetkine, Yair Kurzion, Yifan Xu and Zach Hynes.","date_published":"2021-08-01T00:00:00Z","conference":{"name":"ACL: Association for Computational Linguistics ; IJCNLP: International Joint Conference on Natural Language Processing","start_date":"2021-08-01","end_date":"2021-08-06","location":"Bangkok, Thailand"},"year":"2021","page":"29-30","ddc":["000"],"main_file_link":[{"open_access":"1","url":"https://aclanthology.org/2021.acl-tutorials.6/"}],"quality_controlled":"1","doi":"10.18653/v1/2021.acl-tutorials.6","article_processing_charge":"No","publisher":"Association for Computational Linguistics","date_updated":"2022-01-26T14:26:36Z","_id":"10367","type":"conference","oa":1,"language":[{"iso":"eng"}],"citation":{"ista":"Ilharco C, Shirazi A, Gopalan A, Nagrani A, Bratanič B, Bregler C, Liu C, Ferreira F, Barcik G, Ilharco G, Osang GF, Bulian J, Frank J, Smaira L, Cao Q, Marino R, Patel R, Leung T, Imbrasaite V. 2021. Recognizing multimodal entailment. 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing, Tutorial Abstracts. ACL: Association for Computational Linguistics ; IJCNLP: International Joint Conference on Natural Language Processing, 29–30.","chicago":"Ilharco, Cesar, Afsaneh Shirazi, Arjun Gopalan, Arsha Nagrani, Blaž Bratanič, Chris Bregler, Christina Liu, et al. “Recognizing Multimodal Entailment.” In <i>59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing, Tutorial Abstracts</i>, 29–30. Association for Computational Linguistics, 2021. <a href=\"https://doi.org/10.18653/v1/2021.acl-tutorials.6\">https://doi.org/10.18653/v1/2021.acl-tutorials.6</a>.","apa":"Ilharco, C., Shirazi, A., Gopalan, A., Nagrani, A., Bratanič, B., Bregler, C., … Imbrasaite, V. (2021). Recognizing multimodal entailment. In <i>59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing, Tutorial Abstracts</i> (pp. 29–30). Bangkok, Thailand: Association for Computational Linguistics. <a href=\"https://doi.org/10.18653/v1/2021.acl-tutorials.6\">https://doi.org/10.18653/v1/2021.acl-tutorials.6</a>","mla":"Ilharco, Cesar, et al. “Recognizing Multimodal Entailment.” <i>59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing, Tutorial Abstracts</i>, Association for Computational Linguistics, 2021, pp. 29–30, doi:<a href=\"https://doi.org/10.18653/v1/2021.acl-tutorials.6\">10.18653/v1/2021.acl-tutorials.6</a>.","ama":"Ilharco C, Shirazi A, Gopalan A, et al. Recognizing multimodal entailment. In: <i>59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing, Tutorial Abstracts</i>. Association for Computational Linguistics; 2021:29-30. doi:<a href=\"https://doi.org/10.18653/v1/2021.acl-tutorials.6\">10.18653/v1/2021.acl-tutorials.6</a>","ieee":"C. Ilharco <i>et al.</i>, “Recognizing multimodal entailment,” in <i>59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing, Tutorial Abstracts</i>, Bangkok, Thailand, 2021, pp. 29–30.","short":"C. Ilharco, A. Shirazi, A. Gopalan, A. Nagrani, B. Bratanič, C. Bregler, C. Liu, F. Ferreira, G. Barcik, G. Ilharco, G.F. Osang, J. Bulian, J. Frank, L. Smaira, Q. Cao, R. Marino, R. Patel, T. Leung, V. Imbrasaite, in:, 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing, Tutorial Abstracts, Association for Computational Linguistics, 2021, pp. 29–30."},"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","month":"08","department":[{"_id":"HeEd"}],"file":[{"file_id":"10368","date_created":"2021-11-29T08:41:00Z","file_size":1227703,"creator":"cchlebak","date_updated":"2021-11-29T08:41:00Z","relation":"main_file","checksum":"b14052a025a6ecf675bdfe51db98c0d7","success":1,"file_name":"2021_ACL_Ilharco.pdf","access_level":"open_access","content_type":"application/pdf"}],"has_accepted_license":"1","abstract":[{"text":"How information is created, shared and consumed has changed rapidly in recent decades, in part thanks to new social platforms and technologies on the web. With ever-larger amounts of unstructured and limited labels, organizing and reconciling information from different sources and modalities is a central challenge in machine learning. This cutting-edge tutorial aims to introduce the multimodal entailment task, which can be useful for detecting semantic alignments when a single modality alone does not suffice for a whole content understanding. Starting with a brief overview of natural language processing, computer vision, structured data and neural graph learning, we lay the foundations for the multimodal sections to follow. We then discuss recent multimodal learning literature covering visual, audio and language streams, and explore case studies focusing on tasks which require fine-grained understanding of visual and linguistic semantics question answering, veracity and hatred classification. Finally, we introduce a new dataset for recognizing multimodal entailment, exploring it in a hands-on collaborative section. Overall, this tutorial gives an overview of multimodal learning, introduces a multimodal entailment dataset, and encourages future research in the topic.","lang":"eng"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)"},"publication_status":"published","publication_identifier":{"isbn":["9-781-9540-8557-2"]},"file_date_updated":"2021-11-29T08:41:00Z","author":[{"last_name":"Ilharco","full_name":"Ilharco, Cesar","first_name":"Cesar"},{"first_name":"Afsaneh","last_name":"Shirazi","full_name":"Shirazi, Afsaneh"},{"last_name":"Gopalan","full_name":"Gopalan, Arjun","first_name":"Arjun"},{"full_name":"Nagrani, Arsha","last_name":"Nagrani","first_name":"Arsha"},{"full_name":"Bratanič, Blaž","last_name":"Bratanič","first_name":"Blaž"},{"last_name":"Bregler","full_name":"Bregler, Chris","first_name":"Chris"},{"last_name":"Liu","full_name":"Liu, Christina","first_name":"Christina"},{"first_name":"Felipe","full_name":"Ferreira, Felipe","last_name":"Ferreira"},{"last_name":"Barcik","full_name":"Barcik, Gabriek","first_name":"Gabriek"},{"first_name":"Gabriel","last_name":"Ilharco","full_name":"Ilharco, Gabriel"},{"last_name":"Osang","id":"464B40D6-F248-11E8-B48F-1D18A9856A87","full_name":"Osang, Georg F","first_name":"Georg F"},{"first_name":"Jannis","full_name":"Bulian, Jannis","last_name":"Bulian"},{"first_name":"Jared","last_name":"Frank","full_name":"Frank, Jared"},{"full_name":"Smaira, Lucas","last_name":"Smaira","first_name":"Lucas"},{"first_name":"Qin","full_name":"Cao, Qin","last_name":"Cao"},{"full_name":"Marino, Ricardo","last_name":"Marino","first_name":"Ricardo"},{"first_name":"Roma","full_name":"Patel, Roma","last_name":"Patel"},{"last_name":"Leung","full_name":"Leung, Thomas","first_name":"Thomas"},{"first_name":"Vaiva","full_name":"Imbrasaite, Vaiva","last_name":"Imbrasaite"}],"day":"01","scopus_import":"1","title":"Recognizing multimodal entailment","oa_version":"Published Version","date_created":"2021-11-28T23:01:30Z"},{"abstract":[{"lang":"eng","text":"Even though Delaunay originally introduced his famous triangulations in the case of infinite point sets with translational periodicity, a software that computes such triangulations in the general case is not yet available, to the best of our knowledge. Combining and generalizing previous work, we present a practical algorithm for computing such triangulations. The algorithm has been implemented and experiments show that its performance is as good as the one of the CGAL package, which is restricted to cubic periodicity. "}],"license":"https://creativecommons.org/licenses/by/3.0/","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)","image":"/images/cc_by.png","short":"CC BY (3.0)"},"intvolume":"       173","has_accepted_license":"1","file_date_updated":"2020-10-27T14:31:52Z","publication_identifier":{"issn":["18688969"],"isbn":["9783959771627"]},"publication_status":"published","title":"Generalizing CGAL periodic Delaunay triangulations","oa_version":"Published Version","scopus_import":"1","day":"26","author":[{"id":"464B40D6-F248-11E8-B48F-1D18A9856A87","full_name":"Osang, Georg F","last_name":"Osang","orcid":"0000-0002-8882-5116","first_name":"Georg F"},{"full_name":"Rouxel-Labbé, Mael","last_name":"Rouxel-Labbé","first_name":"Mael"},{"last_name":"Teillaud","full_name":"Teillaud, Monique","first_name":"Monique"}],"date_created":"2020-10-25T23:01:18Z","volume":173,"language":[{"iso":"eng"}],"oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Osang, Georg F., et al. “Generalizing CGAL Periodic Delaunay Triangulations.” <i>28th Annual European Symposium on Algorithms</i>, vol. 173, 75, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:<a href=\"https://doi.org/10.4230/LIPIcs.ESA.2020.75\">10.4230/LIPIcs.ESA.2020.75</a>.","apa":"Osang, G. F., Rouxel-Labbé, M., &#38; Teillaud, M. (2020). Generalizing CGAL periodic Delaunay triangulations. In <i>28th Annual European Symposium on Algorithms</i> (Vol. 173). Virtual, Online; Pisa, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.ESA.2020.75\">https://doi.org/10.4230/LIPIcs.ESA.2020.75</a>","ista":"Osang GF, Rouxel-Labbé M, Teillaud M. 2020. Generalizing CGAL periodic Delaunay triangulations. 28th Annual European Symposium on Algorithms. ESA: Annual European Symposium on Algorithms, LIPIcs, vol. 173, 75.","chicago":"Osang, Georg F, Mael Rouxel-Labbé, and Monique Teillaud. “Generalizing CGAL Periodic Delaunay Triangulations.” In <i>28th Annual European Symposium on Algorithms</i>, Vol. 173. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. <a href=\"https://doi.org/10.4230/LIPIcs.ESA.2020.75\">https://doi.org/10.4230/LIPIcs.ESA.2020.75</a>.","short":"G.F. Osang, M. Rouxel-Labbé, M. Teillaud, in:, 28th Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.","ieee":"G. F. Osang, M. Rouxel-Labbé, and M. Teillaud, “Generalizing CGAL periodic Delaunay triangulations,” in <i>28th Annual European Symposium on Algorithms</i>, Virtual, Online; Pisa, Italy, 2020, vol. 173.","ama":"Osang GF, Rouxel-Labbé M, Teillaud M. Generalizing CGAL periodic Delaunay triangulations. In: <i>28th Annual European Symposium on Algorithms</i>. Vol 173. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:<a href=\"https://doi.org/10.4230/LIPIcs.ESA.2020.75\">10.4230/LIPIcs.ESA.2020.75</a>"},"month":"08","article_number":"75","file":[{"success":1,"file_name":"2020_LIPIcs_Osang.pdf","access_level":"open_access","content_type":"application/pdf","relation":"main_file","checksum":"fe0f7c49a99ed870c671b911e10d5496","file_size":733291,"date_created":"2020-10-27T14:31:52Z","date_updated":"2020-10-27T14:31:52Z","creator":"cziletti","file_id":"8712"}],"department":[{"_id":"HeEd"}],"ddc":["000"],"quality_controlled":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","article_processing_charge":"No","alternative_title":["LIPIcs"],"doi":"10.4230/LIPIcs.ESA.2020.75","type":"conference","_id":"8703","date_updated":"2023-09-07T13:29:00Z","publication":"28th Annual European Symposium on Algorithms","status":"public","project":[{"_id":"266A2E9E-B435-11E9-9278-68D0E5697425","name":"Alpha Shape Theory Extended","grant_number":"788183","call_identifier":"H2020"}],"conference":{"name":"ESA: Annual European Symposium on Algorithms","start_date":"2020-09-07","end_date":"2020-09-09","location":"Virtual, Online; Pisa, Italy"},"date_published":"2020-08-26T00:00:00Z","ec_funded":1,"related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"9056"}]},"year":"2020"},{"date_published":"2019-11-28T00:00:00Z","conference":{"name":"ITSC: Intelligent Transportation Systems Conference","end_date":"2019-10-30","start_date":"2019-10-27","location":"Auckland, New Zealand"},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"ama":"Osang GF, Cook J, Fabrikant A, Gruteser M. LiveTraVeL: Real-time matching of transit vehicle trajectories to transit routes at scale. In: <i>2019 IEEE Intelligent Transportation Systems Conference</i>. IEEE; 2019. doi:<a href=\"https://doi.org/10.1109/ITSC.2019.8917514\">10.1109/ITSC.2019.8917514</a>","short":"G.F. Osang, J. Cook, A. Fabrikant, M. Gruteser, in:, 2019 IEEE Intelligent Transportation Systems Conference, IEEE, 2019.","ieee":"G. F. Osang, J. Cook, A. Fabrikant, and M. Gruteser, “LiveTraVeL: Real-time matching of transit vehicle trajectories to transit routes at scale,” in <i>2019 IEEE Intelligent Transportation Systems Conference</i>, Auckland, New Zealand, 2019.","ista":"Osang GF, Cook J, Fabrikant A, Gruteser M. 2019. LiveTraVeL: Real-time matching of transit vehicle trajectories to transit routes at scale. 2019 IEEE Intelligent Transportation Systems Conference. ITSC: Intelligent Transportation Systems Conference, 8917514.","chicago":"Osang, Georg F, James Cook, Alex Fabrikant, and Marco Gruteser. “LiveTraVeL: Real-Time Matching of Transit Vehicle Trajectories to Transit Routes at Scale.” In <i>2019 IEEE Intelligent Transportation Systems Conference</i>. IEEE, 2019. <a href=\"https://doi.org/10.1109/ITSC.2019.8917514\">https://doi.org/10.1109/ITSC.2019.8917514</a>.","mla":"Osang, Georg F., et al. “LiveTraVeL: Real-Time Matching of Transit Vehicle Trajectories to Transit Routes at Scale.” <i>2019 IEEE Intelligent Transportation Systems Conference</i>, 8917514, IEEE, 2019, doi:<a href=\"https://doi.org/10.1109/ITSC.2019.8917514\">10.1109/ITSC.2019.8917514</a>.","apa":"Osang, G. F., Cook, J., Fabrikant, A., &#38; Gruteser, M. (2019). LiveTraVeL: Real-time matching of transit vehicle trajectories to transit routes at scale. In <i>2019 IEEE Intelligent Transportation Systems Conference</i>. Auckland, New Zealand: IEEE. <a href=\"https://doi.org/10.1109/ITSC.2019.8917514\">https://doi.org/10.1109/ITSC.2019.8917514</a>"},"language":[{"iso":"eng"}],"publication":"2019 IEEE Intelligent Transportation Systems Conference","status":"public","article_number":"8917514","department":[{"_id":"HeEd"}],"external_id":{"isi":["000521238102050"]},"month":"11","isi":1,"year":"2019","publication_status":"published","publication_identifier":{"isbn":["9781538670248"]},"quality_controlled":"1","abstract":[{"text":"We present LiveTraVeL (Live Transit Vehicle Labeling), a real-time system to label a stream of noisy observations of transit vehicle trajectories with the transit routes they are serving (e.g., northbound bus #5). In order to scale efficiently to large transit networks, our system first retrieves a small set of candidate routes from a geometrically indexed data structure, then applies a fine-grained scoring step to choose the best match. Given that real-time data remains unavailable for the majority of the world’s transit agencies, these inferences can help feed a real-time map of a transit system’s trips, infer transit trip delays in real time, or measure and correct noisy transit tracking data. This system can run on vehicle observations from a variety of sources that don’t attach route information to vehicle observations, such as public imagery streams or user-contributed transit vehicle sightings.We abstract away the specifics of the sensing system and demonstrate the effectiveness of our system on a \"semisynthetic\" dataset of all New York City buses, where we simulate sensed trajectories by starting with fully labeled vehicle trajectories reported via the GTFS-Realtime protocol, removing the transit route IDs, and perturbing locations with synthetic noise. Using just the geometric shapes of the trajectories, we demonstrate that our system converges on the correct route ID within a few minutes, even after a vehicle switches from serving one trip to the next.","lang":"eng"}],"type":"conference","date_created":"2019-12-29T23:00:47Z","date_updated":"2023-09-06T14:50:28Z","_id":"7216","title":"LiveTraVeL: Real-time matching of transit vehicle trajectories to transit routes at scale","oa_version":"None","publisher":"IEEE","author":[{"id":"464B40D6-F248-11E8-B48F-1D18A9856A87","full_name":"Osang, Georg F","last_name":"Osang","orcid":"0000-0002-8882-5116","first_name":"Georg F"},{"full_name":"Cook, James","last_name":"Cook","first_name":"James"},{"first_name":"Alex","full_name":"Fabrikant, Alex","last_name":"Fabrikant"},{"full_name":"Gruteser, Marco","last_name":"Gruteser","first_name":"Marco"}],"doi":"10.1109/ITSC.2019.8917514","scopus_import":"1","day":"28","article_processing_charge":"No"},{"month":"06","article_number":"34","file":[{"file_id":"5738","date_updated":"2020-07-14T12:45:19Z","creator":"dernst","date_created":"2018-12-18T09:27:22Z","file_size":528018,"checksum":"d8c0533ad0018eb4ed1077475eb8fc18","relation":"main_file","content_type":"application/pdf","access_level":"open_access","file_name":"2018_LIPIcs_Edelsbrunner_Osang.pdf"}],"department":[{"_id":"HeEd"}],"language":[{"iso":"eng"}],"oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ama":"Edelsbrunner H, Osang GF. The multi-cover persistence of Euclidean balls. In: Vol 99. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018. doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2018.34\">10.4230/LIPIcs.SoCG.2018.34</a>","short":"H. Edelsbrunner, G.F. Osang, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.","ieee":"H. Edelsbrunner and G. F. Osang, “The multi-cover persistence of Euclidean balls,” presented at the SoCG: Symposium on Computational Geometry, Budapest, Hungary, 2018, vol. 99.","ista":"Edelsbrunner H, Osang GF. 2018. The multi-cover persistence of Euclidean balls. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 99, 34.","chicago":"Edelsbrunner, Herbert, and Georg F Osang. “The Multi-Cover Persistence of Euclidean Balls,” Vol. 99. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2018.34\">https://doi.org/10.4230/LIPIcs.SoCG.2018.34</a>.","mla":"Edelsbrunner, Herbert, and Georg F. Osang. <i>The Multi-Cover Persistence of Euclidean Balls</i>. Vol. 99, 34, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2018.34\">10.4230/LIPIcs.SoCG.2018.34</a>.","apa":"Edelsbrunner, H., &#38; Osang, G. F. (2018). The multi-cover persistence of Euclidean balls (Vol. 99). Presented at the SoCG: Symposium on Computational Geometry, Budapest, Hungary: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2018.34\">https://doi.org/10.4230/LIPIcs.SoCG.2018.34</a>"},"title":"The multi-cover persistence of Euclidean balls","oa_version":"Published Version","author":[{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","first_name":"Herbert","orcid":"0000-0002-9823-6833"},{"orcid":"0000-0002-8882-5116","first_name":"Georg F","last_name":"Osang","full_name":"Osang, Georg F","id":"464B40D6-F248-11E8-B48F-1D18A9856A87"}],"scopus_import":1,"day":"11","date_created":"2018-12-11T11:45:05Z","volume":99,"intvolume":"        99","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","image":"/images/cc_by.png","short":"CC BY (4.0)"},"abstract":[{"text":"Given a locally finite X ⊆ ℝd and a radius r ≥ 0, the k-fold cover of X and r consists of all points in ℝd that have k or more points of X within distance r. We consider two filtrations - one in scale obtained by fixing k and increasing r, and the other in depth obtained by fixing r and decreasing k - and we compute the persistence diagrams of both. While standard methods suffice for the filtration in scale, we need novel geometric and topological concepts for the filtration in depth. In particular, we introduce a rhomboid tiling in ℝd+1 whose horizontal integer slices are the order-k Delaunay mosaics of X, and construct a zigzag module from Delaunay mosaics that is isomorphic to the persistence module of the multi-covers. ","lang":"eng"}],"has_accepted_license":"1","publication_status":"published","file_date_updated":"2020-07-14T12:45:19Z","related_material":{"record":[{"relation":"later_version","status":"public","id":"9317"},{"id":"9056","status":"public","relation":"dissertation_contains"}]},"year":"2018","publist_id":"7732","project":[{"name":"Persistence and stability of geometric complexes","grant_number":"I02979-N35","call_identifier":"FWF","_id":"2561EBF4-B435-11E9-9278-68D0E5697425"}],"status":"public","conference":{"name":"SoCG: Symposium on Computational Geometry","end_date":"2018-06-14","start_date":"2018-06-11","location":"Budapest, Hungary"},"acknowledgement":"This work is partially supported by the DFG Collaborative Research Center TRR 109, ‘Discretization in Geometry and Dynamics’, through grant no. I02979-N35 of the Austrian Science Fund (FWF).","date_published":"2018-06-11T00:00:00Z","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","doi":"10.4230/LIPIcs.SoCG.2018.34","alternative_title":["LIPIcs"],"type":"conference","date_updated":"2023-09-07T13:29:00Z","_id":"187","ddc":["516"],"quality_controlled":"1"},{"publist_id":"7723","isi":1,"year":"2018","external_id":{"isi":["000516620100005"]},"ec_funded":1,"date_published":"2018-06-01T00:00:00Z","acknowledgement":"Leonid Reyzin was supported in part by IST Austria and by US NSF grants 1012910, 1012798, and 1422965; this research was performed while he was visiting IST Austria.","conference":{"location":"Incheon, Republic of Korea","start_date":"2018-06-04","end_date":"2018-06-08","name":"ASIACCS: Asia Conference on Computer and Communications Security "},"project":[{"grant_number":"616160","name":"Discrete Optimization in Computer Vision: Theory and Practice","call_identifier":"FP7","_id":"25FBA906-B435-11E9-9278-68D0E5697425"},{"_id":"258AA5B2-B435-11E9-9278-68D0E5697425","name":"Teaching Old Crypto New Tricks","grant_number":"682815","call_identifier":"H2020"}],"status":"public","publication":"Proceedings of the 2018 on Asia Conference on Computer and Communication Security","date_updated":"2023-09-13T09:13:12Z","_id":"193","type":"conference","doi":"10.1145/3196494.3196534","article_processing_charge":"No","publisher":"ACM","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2016/783"}],"quality_controlled":"1","page":"51 - 65","department":[{"_id":"KrPi"},{"_id":"HeEd"},{"_id":"VlKo"}],"month":"06","citation":{"ama":"Alwen JF, Gazi P, Kamath Hosdurg C, et al. On the memory hardness of data independent password hashing functions. In: <i>Proceedings of the 2018 on Asia Conference on Computer and Communication Security</i>. ACM; 2018:51-65. doi:<a href=\"https://doi.org/10.1145/3196494.3196534\">10.1145/3196494.3196534</a>","ieee":"J. F. Alwen <i>et al.</i>, “On the memory hardness of data independent password hashing functions,” in <i>Proceedings of the 2018 on Asia Conference on Computer and Communication Security</i>, Incheon, Republic of Korea, 2018, pp. 51–65.","short":"J.F. Alwen, P. Gazi, C. Kamath Hosdurg, K. Klein, G.F. Osang, K.Z. Pietrzak, L. Reyzin, M. Rolinek, M. Rybar, in:, Proceedings of the 2018 on Asia Conference on Computer and Communication Security, ACM, 2018, pp. 51–65.","chicago":"Alwen, Joel F, Peter Gazi, Chethan Kamath Hosdurg, Karen Klein, Georg F Osang, Krzysztof Z Pietrzak, Lenoid Reyzin, Michal Rolinek, and Michal Rybar. “On the Memory Hardness of Data Independent Password Hashing Functions.” In <i>Proceedings of the 2018 on Asia Conference on Computer and Communication Security</i>, 51–65. ACM, 2018. <a href=\"https://doi.org/10.1145/3196494.3196534\">https://doi.org/10.1145/3196494.3196534</a>.","ista":"Alwen JF, Gazi P, Kamath Hosdurg C, Klein K, Osang GF, Pietrzak KZ, Reyzin L, Rolinek M, Rybar M. 2018. On the memory hardness of data independent password hashing functions. Proceedings of the 2018 on Asia Conference on Computer and Communication Security. ASIACCS: Asia Conference on Computer and Communications Security , 51–65.","apa":"Alwen, J. F., Gazi, P., Kamath Hosdurg, C., Klein, K., Osang, G. F., Pietrzak, K. Z., … Rybar, M. (2018). On the memory hardness of data independent password hashing functions. In <i>Proceedings of the 2018 on Asia Conference on Computer and Communication Security</i> (pp. 51–65). Incheon, Republic of Korea: ACM. <a href=\"https://doi.org/10.1145/3196494.3196534\">https://doi.org/10.1145/3196494.3196534</a>","mla":"Alwen, Joel F., et al. “On the Memory Hardness of Data Independent Password Hashing Functions.” <i>Proceedings of the 2018 on Asia Conference on Computer and Communication Security</i>, ACM, 2018, pp. 51–65, doi:<a href=\"https://doi.org/10.1145/3196494.3196534\">10.1145/3196494.3196534</a>."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","oa":1,"language":[{"iso":"eng"}],"date_created":"2018-12-11T11:45:07Z","author":[{"full_name":"Alwen, Joel F","id":"2A8DFA8C-F248-11E8-B48F-1D18A9856A87","last_name":"Alwen","first_name":"Joel F"},{"first_name":"Peter","last_name":"Gazi","full_name":"Gazi, Peter"},{"first_name":"Chethan","full_name":"Kamath Hosdurg, Chethan","id":"4BD3F30E-F248-11E8-B48F-1D18A9856A87","last_name":"Kamath Hosdurg"},{"full_name":"Klein, Karen","id":"3E83A2F8-F248-11E8-B48F-1D18A9856A87","last_name":"Klein","first_name":"Karen"},{"first_name":"Georg F","orcid":"0000-0002-8882-5116","last_name":"Osang","id":"464B40D6-F248-11E8-B48F-1D18A9856A87","full_name":"Osang, Georg F"},{"last_name":"Pietrzak","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","full_name":"Pietrzak, Krzysztof Z","orcid":"0000-0002-9139-1654","first_name":"Krzysztof Z"},{"first_name":"Lenoid","last_name":"Reyzin","full_name":"Reyzin, Lenoid"},{"full_name":"Rolinek, Michal","id":"3CB3BC06-F248-11E8-B48F-1D18A9856A87","last_name":"Rolinek","first_name":"Michal"},{"id":"2B3E3DE8-F248-11E8-B48F-1D18A9856A87","full_name":"Rybar, Michal","last_name":"Rybar","first_name":"Michal"}],"scopus_import":"1","day":"01","oa_version":"Submitted Version","title":"On the memory hardness of data independent password hashing functions","publication_status":"published","abstract":[{"lang":"eng","text":"We show attacks on five data-independent memory-hard functions (iMHF) that were submitted to the password hashing competition (PHC). Informally, an MHF is a function which cannot be evaluated on dedicated hardware, like ASICs, at significantly lower hardware and/or energy cost than evaluating a single instance on a standard single-core architecture. Data-independent means the memory access pattern of the function is independent of the input; this makes iMHFs harder to construct than data-dependent ones, but the latter can be attacked by various side-channel attacks. Following [Alwen-Blocki'16], we capture the evaluation of an iMHF as a directed acyclic graph (DAG). The cumulative parallel pebbling complexity of this DAG is a measure for the hardware cost of evaluating the iMHF on an ASIC. Ideally, one would like the complexity of a DAG underlying an iMHF to be as close to quadratic in the number of nodes of the graph as possible. Instead, we show that (the DAGs underlying) the following iMHFs are far from this bound: Rig.v2, TwoCats and Gambit each having an exponent no more than 1.75. Moreover, we show that the complexity of the iMHF modes of the PHC finalists Pomelo and Lyra2 have exponents at most 1.83 and 1.67 respectively. To show this we investigate a combinatorial property of each underlying DAG (called its depth-robustness. By establishing upper bounds on this property we are then able to apply the general technique of [Alwen-Block'16] for analyzing the hardware costs of an iMHF."}]},{"intvolume":"       122","abstract":[{"lang":"eng","text":"We consider the problem of reachability in pushdown graphs. We study the problem for pushdown graphs with constant treewidth. Even for pushdown graphs with treewidth 1, for the reachability problem we establish the following: (i) the problem is PTIME-complete, and (ii) any subcubic algorithm for the problem would contradict the k-clique conjecture and imply faster combinatorial algorithms for cliques in graphs."}],"has_accepted_license":"1","publication_status":"published","publication_identifier":{"issn":["00200190"]},"file_date_updated":"2019-10-15T07:44:51Z","title":"Pushdown reachability with constant treewidth","oa_version":"Submitted Version","author":[{"first_name":"Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0002-8882-5116","first_name":"Georg F","last_name":"Osang","id":"464B40D6-F248-11E8-B48F-1D18A9856A87","full_name":"Osang, Georg F"}],"scopus_import":"1","day":"01","date_created":"2018-12-11T11:49:57Z","volume":122,"pubrep_id":"991","language":[{"iso":"eng"}],"oa":1,"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"ama":"Chatterjee K, Osang GF. Pushdown reachability with constant treewidth. <i>Information Processing Letters</i>. 2017;122:25-29. doi:<a href=\"https://doi.org/10.1016/j.ipl.2017.02.003\">10.1016/j.ipl.2017.02.003</a>","short":"K. Chatterjee, G.F. Osang, Information Processing Letters 122 (2017) 25–29.","ieee":"K. Chatterjee and G. F. Osang, “Pushdown reachability with constant treewidth,” <i>Information Processing Letters</i>, vol. 122. Elsevier, pp. 25–29, 2017.","chicago":"Chatterjee, Krishnendu, and Georg F Osang. “Pushdown Reachability with Constant Treewidth.” <i>Information Processing Letters</i>. Elsevier, 2017. <a href=\"https://doi.org/10.1016/j.ipl.2017.02.003\">https://doi.org/10.1016/j.ipl.2017.02.003</a>.","ista":"Chatterjee K, Osang GF. 2017. Pushdown reachability with constant treewidth. Information Processing Letters. 122, 25–29.","mla":"Chatterjee, Krishnendu, and Georg F. Osang. “Pushdown Reachability with Constant Treewidth.” <i>Information Processing Letters</i>, vol. 122, Elsevier, 2017, pp. 25–29, doi:<a href=\"https://doi.org/10.1016/j.ipl.2017.02.003\">10.1016/j.ipl.2017.02.003</a>.","apa":"Chatterjee, K., &#38; Osang, G. F. (2017). Pushdown reachability with constant treewidth. <i>Information Processing Letters</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.ipl.2017.02.003\">https://doi.org/10.1016/j.ipl.2017.02.003</a>"},"month":"06","file":[{"relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_name":"IST-2018-991-v1+2_2018_Chatterjee_Pushdown_PREPRINT.pdf","file_id":"4998","date_updated":"2019-10-15T07:44:51Z","creator":"system","file_size":247657,"date_created":"2018-12-12T10:13:17Z"}],"department":[{"_id":"KrCh"},{"_id":"HeEd"}],"ddc":["000"],"page":"25 - 29","quality_controlled":"1","publisher":"Elsevier","doi":"10.1016/j.ipl.2017.02.003","article_processing_charge":"No","type":"journal_article","date_updated":"2023-09-20T12:08:18Z","_id":"1065","project":[{"grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","grant_number":"S11407","name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307"}],"status":"public","publication":"Information Processing Letters","date_published":"2017-06-01T00:00:00Z","ec_funded":1,"external_id":{"isi":["000399506600005"]},"year":"2017","isi":1,"publist_id":"6323"}]