[{"file":[{"creator":"kschuh","file_size":2665013,"content_type":"application/pdf","file_name":"Elsevier_2019_Edelsbrunner.pdf","access_level":"open_access","date_updated":"2020-07-14T12:47:34Z","date_created":"2019-07-08T15:24:26Z","checksum":"7c99be505dc7533257d42eb1830cef04","file_id":"6624","relation":"main_file"}],"oa_version":"Published Version","intvolume":" 73","status":"public","ddc":["000"],"title":"Holes and dependences in an ordered complex","_id":"6608","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","abstract":[{"lang":"eng","text":"We use the canonical bases produced by the tri-partition algorithm in (Edelsbrunner and Ölsböck, 2018) to open and close holes in a polyhedral complex, K. In a concrete application, we consider the Delaunay mosaic of a finite set, we let K be an Alpha complex, and we use the persistence diagram of the distance function to guide the hole opening and closing operations. The dependences between the holes define a partial order on the cells in K that characterizes what can and what cannot be constructed using the operations. The relations in this partial order reveal structural information about the underlying filtration of complexes beyond what is expressed by the persistence diagram."}],"type":"journal_article","date_published":"2019-08-01T00:00:00Z","page":"1-15","citation":{"apa":"Edelsbrunner, H., & Ölsböck, K. (2019). Holes and dependences in an ordered complex. Computer Aided Geometric Design. Elsevier. https://doi.org/10.1016/j.cagd.2019.06.003","ieee":"H. Edelsbrunner and K. Ölsböck, “Holes and dependences in an ordered complex,” Computer Aided Geometric Design, vol. 73. Elsevier, pp. 1–15, 2019.","ista":"Edelsbrunner H, Ölsböck K. 2019. Holes and dependences in an ordered complex. Computer Aided Geometric Design. 73, 1–15.","ama":"Edelsbrunner H, Ölsböck K. Holes and dependences in an ordered complex. Computer Aided Geometric Design. 2019;73:1-15. doi:10.1016/j.cagd.2019.06.003","chicago":"Edelsbrunner, Herbert, and Katharina Ölsböck. “Holes and Dependences in an Ordered Complex.” Computer Aided Geometric Design. Elsevier, 2019. https://doi.org/10.1016/j.cagd.2019.06.003.","short":"H. Edelsbrunner, K. Ölsböck, Computer Aided Geometric Design 73 (2019) 1–15.","mla":"Edelsbrunner, Herbert, and Katharina Ölsböck. “Holes and Dependences in an Ordered Complex.” Computer Aided Geometric Design, vol. 73, Elsevier, 2019, pp. 1–15, doi:10.1016/j.cagd.2019.06.003."},"publication":"Computer Aided Geometric Design","has_accepted_license":"1","article_processing_charge":"No","day":"01","scopus_import":"1","volume":73,"date_updated":"2023-09-07T13:15:29Z","date_created":"2019-07-07T21:59:20Z","related_material":{"record":[{"id":"7460","relation":"dissertation_contains","status":"public"}]},"author":[{"full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","first_name":"Herbert","orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Ölsböck, Katharina","first_name":"Katharina","last_name":"Ölsböck","id":"4D4AA390-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4672-8297"}],"publisher":"Elsevier","department":[{"_id":"HeEd"}],"publication_status":"published","year":"2019","license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","ec_funded":1,"file_date_updated":"2020-07-14T12:47:34Z","language":[{"iso":"eng"}],"doi":"10.1016/j.cagd.2019.06.003","project":[{"call_identifier":"H2020","name":"Alpha Shape Theory Extended","_id":"266A2E9E-B435-11E9-9278-68D0E5697425","grant_number":"788183"},{"name":"Persistence and stability of geometric complexes","call_identifier":"FWF","_id":"2561EBF4-B435-11E9-9278-68D0E5697425","grant_number":"I02979-N35"}],"isi":1,"quality_controlled":"1","external_id":{"isi":["000485207800001"]},"tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)","image":"/images/cc_by_nc_nd.png"},"oa":1,"month":"08"},{"date_published":"2019-06-01T00:00:00Z","page":"1103-1114","publication":"Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing - STOC 2019","citation":{"mla":"Choudhuri, Arka Rai, et al. “Finding a Nash Equilibrium Is No Easier than Breaking Fiat-Shamir.” Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing - STOC 2019, ACM Press, 2019, pp. 1103–14, doi:10.1145/3313276.3316400.","short":"A.R. Choudhuri, P. Hubáček, C. Kamath Hosdurg, K.Z. Pietrzak, A. Rosen, G.N. Rothblum, in:, Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing - STOC 2019, ACM Press, 2019, pp. 1103–1114.","chicago":"Choudhuri, Arka Rai, Pavel Hubáček, Chethan Kamath Hosdurg, Krzysztof Z Pietrzak, Alon Rosen, and Guy N. Rothblum. “Finding a Nash Equilibrium Is No Easier than Breaking Fiat-Shamir.” In Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing - STOC 2019, 1103–14. ACM Press, 2019. https://doi.org/10.1145/3313276.3316400.","ama":"Choudhuri AR, Hubáček P, Kamath Hosdurg C, Pietrzak KZ, Rosen A, Rothblum GN. Finding a Nash equilibrium is no easier than breaking Fiat-Shamir. In: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing - STOC 2019. ACM Press; 2019:1103-1114. doi:10.1145/3313276.3316400","ista":"Choudhuri AR, Hubáček P, Kamath Hosdurg C, Pietrzak KZ, Rosen A, Rothblum GN. 2019. Finding a Nash equilibrium is no easier than breaking Fiat-Shamir. Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing - STOC 2019. STOC: Symposium on Theory of Computing, 1103–1114.","ieee":"A. R. Choudhuri, P. Hubáček, C. Kamath Hosdurg, K. Z. Pietrzak, A. Rosen, and G. N. Rothblum, “Finding a Nash equilibrium is no easier than breaking Fiat-Shamir,” in Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing - STOC 2019, Phoenix, AZ, United States, 2019, pp. 1103–1114.","apa":"Choudhuri, A. R., Hubáček, P., Kamath Hosdurg, C., Pietrzak, K. Z., Rosen, A., & Rothblum, G. N. (2019). Finding a Nash equilibrium is no easier than breaking Fiat-Shamir. In Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing - STOC 2019 (pp. 1103–1114). Phoenix, AZ, United States: ACM Press. https://doi.org/10.1145/3313276.3316400"},"day":"01","article_processing_charge":"No","scopus_import":"1","oa_version":"Preprint","status":"public","title":"Finding a Nash equilibrium is no easier than breaking Fiat-Shamir","_id":"6677","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","abstract":[{"lang":"eng","text":"The Fiat-Shamir heuristic transforms a public-coin interactive proof into a non-interactive argument, by replacing the verifier with a cryptographic hash function that is applied to the protocol’s transcript. Constructing hash functions for which this transformation is sound is a central and long-standing open question in cryptography.\r\n\r\nWe show that solving the END−OF−METERED−LINE problem is no easier than breaking the soundness of the Fiat-Shamir transformation when applied to the sumcheck protocol. In particular, if the transformed protocol is sound, then any hard problem in #P gives rise to a hard distribution in the class CLS, which is contained in PPAD. Our result opens up the possibility of sampling moderately-sized games for which it is hard to find a Nash equilibrium, by reducing the inversion of appropriately chosen one-way functions to #SAT.\r\n\r\nOur main technical contribution is a stateful incrementally verifiable procedure that, given a SAT instance over n variables, counts the number of satisfying assignments. This is accomplished via an exponential sequence of small steps, each computable in time poly(n). Incremental verifiability means that each intermediate state includes a sumcheck-based proof of its correctness, and the proof can be updated and verified in time poly(n)."}],"type":"conference","language":[{"iso":"eng"}],"conference":{"start_date":"2019-06-23","location":"Phoenix, AZ, United States","end_date":"2019-06-26","name":"STOC: Symposium on Theory of Computing"},"doi":"10.1145/3313276.3316400","quality_controlled":"1","isi":1,"project":[{"call_identifier":"H2020","name":"Teaching Old Crypto New Tricks","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","grant_number":"682815"}],"oa":1,"main_file_link":[{"url":"https://eprint.iacr.org/2019/549","open_access":"1"}],"external_id":{"isi":["000523199100100"]},"month":"06","publication_identifier":{"isbn":["9781450367059"]},"date_updated":"2023-09-07T13:15:55Z","date_created":"2019-07-24T09:20:53Z","author":[{"full_name":"Choudhuri, Arka Rai","first_name":"Arka Rai","last_name":"Choudhuri"},{"full_name":"Hubáček, Pavel","first_name":"Pavel","last_name":"Hubáček"},{"id":"4BD3F30E-F248-11E8-B48F-1D18A9856A87","last_name":"Kamath Hosdurg","first_name":"Chethan","full_name":"Kamath Hosdurg, Chethan"},{"last_name":"Pietrzak","first_name":"Krzysztof Z","orcid":"0000-0002-9139-1654","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","full_name":"Pietrzak, Krzysztof Z"},{"full_name":"Rosen, Alon","last_name":"Rosen","first_name":"Alon"},{"full_name":"Rothblum, Guy N.","first_name":"Guy N.","last_name":"Rothblum"}],"related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"7896"}]},"publication_status":"published","publisher":"ACM Press","department":[{"_id":"KrPi"}],"year":"2019","ec_funded":1},{"issue":"4","abstract":[{"text":"Given a triangulation of a point set in the plane, a flip deletes an edge e whose removal leaves a convex quadrilateral, and replaces e by the opposite diagonal of the quadrilateral. It is well known that any triangulation of a point set can be reconfigured to any other triangulation by some sequence of flips. We explore this question in the setting where each edge of a triangulation has a label, and a flip transfers the label of the removed edge to the new edge. It is not true that every labelled triangulation of a point set can be reconfigured to every other labelled triangulation via a sequence of flips, but we characterize when this is possible. There is an obvious necessary condition: for each label l, if edge e has label l in the first triangulation and edge f has label l in the second triangulation, then there must be some sequence of flips that moves label l from e to f, ignoring all other labels. Bose, Lubiw, Pathak and Verdonschot formulated the Orbit Conjecture, which states that this necessary condition is also sufficient, i.e. that all labels can be simultaneously mapped to their destination if and only if each label individually can be mapped to its destination. We prove this conjecture. Furthermore, we give a polynomial-time algorithm (with 𝑂(𝑛8) being a crude bound on the run-time) to find a sequence of flips to reconfigure one labelled triangulation to another, if such a sequence exists, and we prove an upper bound of 𝑂(𝑛7) on the length of the flip sequence. Our proof uses the topological result that the sets of pairwise non-crossing edges on a planar point set form a simplicial complex that is homeomorphic to a high-dimensional ball (this follows from a result of Orden and Santos; we give a different proof based on a shelling argument). The dual cell complex of this simplicial ball, called the flip complex, has the usual flip graph as its 1-skeleton. We use properties of the 2-skeleton of the flip complex to prove the Orbit Conjecture.","lang":"eng"}],"type":"journal_article","oa_version":"Published Version","file":[{"creator":"dernst","file_size":556276,"content_type":"application/pdf","access_level":"open_access","file_name":"2018_DiscreteGeometry_Lubiw.pdf","checksum":"e1bff88f1d77001b53b78c485ce048d7","date_created":"2019-02-14T11:57:22Z","date_updated":"2020-07-14T12:47:14Z","file_id":"5988","relation":"main_file"}],"intvolume":" 61","title":"A proof of the orbit conjecture for flipping edge-labelled triangulations","status":"public","ddc":["000"],"_id":"5986","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","article_processing_charge":"Yes (via OA deal)","has_accepted_license":"1","day":"01","scopus_import":"1","date_published":"2019-06-01T00:00:00Z","page":"880-898","article_type":"original","citation":{"apa":"Lubiw, A., Masárová, Z., & Wagner, U. (2019). A proof of the orbit conjecture for flipping edge-labelled triangulations. Discrete & Computational Geometry. Springer Nature. https://doi.org/10.1007/s00454-018-0035-8","ieee":"A. Lubiw, Z. Masárová, and U. Wagner, “A proof of the orbit conjecture for flipping edge-labelled triangulations,” Discrete & Computational Geometry, vol. 61, no. 4. Springer Nature, pp. 880–898, 2019.","ista":"Lubiw A, Masárová Z, Wagner U. 2019. A proof of the orbit conjecture for flipping edge-labelled triangulations. Discrete & Computational Geometry. 61(4), 880–898.","ama":"Lubiw A, Masárová Z, Wagner U. A proof of the orbit conjecture for flipping edge-labelled triangulations. Discrete & Computational Geometry. 2019;61(4):880-898. doi:10.1007/s00454-018-0035-8","chicago":"Lubiw, Anna, Zuzana Masárová, and Uli Wagner. “A Proof of the Orbit Conjecture for Flipping Edge-Labelled Triangulations.” Discrete & Computational Geometry. Springer Nature, 2019. https://doi.org/10.1007/s00454-018-0035-8.","short":"A. Lubiw, Z. Masárová, U. Wagner, Discrete & Computational Geometry 61 (2019) 880–898.","mla":"Lubiw, Anna, et al. “A Proof of the Orbit Conjecture for Flipping Edge-Labelled Triangulations.” Discrete & Computational Geometry, vol. 61, no. 4, Springer Nature, 2019, pp. 880–98, doi:10.1007/s00454-018-0035-8."},"publication":"Discrete & Computational Geometry","license":"https://creativecommons.org/licenses/by/4.0/","file_date_updated":"2020-07-14T12:47:14Z","volume":61,"date_updated":"2023-09-07T13:17:36Z","date_created":"2019-02-14T11:54:08Z","related_material":{"record":[{"status":"public","relation":"earlier_version","id":"683"},{"relation":"dissertation_contains","status":"public","id":"7944"}]},"author":[{"full_name":"Lubiw, Anna","last_name":"Lubiw","first_name":"Anna"},{"last_name":"Masárová","first_name":"Zuzana","orcid":"0000-0002-6660-1322","id":"45CFE238-F248-11E8-B48F-1D18A9856A87","full_name":"Masárová, Zuzana"},{"last_name":"Wagner","first_name":"Uli","orcid":"0000-0002-1494-0568","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","full_name":"Wagner, Uli"}],"publisher":"Springer Nature","department":[{"_id":"UlWa"}],"publication_status":"published","year":"2019","publication_identifier":{"issn":["0179-5376"],"eissn":["1432-0444"]},"month":"06","language":[{"iso":"eng"}],"doi":"10.1007/s00454-018-0035-8","project":[{"name":"IST Austria Open Access Fund","_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854"}],"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":["000466130000009"],"arxiv":["1710.02741"]},"oa":1},{"doi":"10.1080/00268976.2019.1567852","language":[{"iso":"eng"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"external_id":{"isi":["000474641400008"]},"isi":1,"quality_controlled":"1","project":[{"call_identifier":"FWF","name":"Quantum rotations in the presence of a many-body environment","grant_number":"P29902","_id":"26031614-B435-11E9-9278-68D0E5697425"},{"grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7"}],"month":"01","publication_identifier":{"issn":["00268976"]},"author":[{"full_name":"Li, Xiang","id":"4B7E523C-F248-11E8-B48F-1D18A9856A87","first_name":"Xiang","last_name":"Li"},{"full_name":"Bighin, Giacomo","first_name":"Giacomo","last_name":"Bighin","id":"4CA96FD4-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8823-9777"},{"last_name":"Yakaboylu","first_name":"Enderalp","orcid":"0000-0001-5973-0874","id":"38CB71F6-F248-11E8-B48F-1D18A9856A87","full_name":"Yakaboylu, Enderalp"},{"id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6990-7802","first_name":"Mikhail","last_name":"Lemeshko","full_name":"Lemeshko, Mikhail"}],"related_material":{"record":[{"id":"8958","relation":"dissertation_contains","status":"public"}]},"date_updated":"2023-09-07T13:16:42Z","date_created":"2019-01-27T22:59:10Z","year":"2019","publication_status":"published","department":[{"_id":"MiLe"}],"publisher":"Taylor and Francis","file_date_updated":"2020-07-14T12:47:13Z","ec_funded":1,"date_published":"2019-01-18T00:00:00Z","publication":"Molecular Physics","citation":{"short":"X. Li, G. Bighin, E. Yakaboylu, M. Lemeshko, Molecular Physics (2019).","mla":"Li, Xiang, et al. “Variational Approaches to Quantum Impurities: From the Fröhlich Polaron to the Angulon.” Molecular Physics, Taylor and Francis, 2019, doi:10.1080/00268976.2019.1567852.","chicago":"Li, Xiang, Giacomo Bighin, Enderalp Yakaboylu, and Mikhail Lemeshko. “Variational Approaches to Quantum Impurities: From the Fröhlich Polaron to the Angulon.” Molecular Physics. Taylor and Francis, 2019. https://doi.org/10.1080/00268976.2019.1567852.","ama":"Li X, Bighin G, Yakaboylu E, Lemeshko M. Variational approaches to quantum impurities: from the Fröhlich polaron to the angulon. Molecular Physics. 2019. doi:10.1080/00268976.2019.1567852","ieee":"X. Li, G. Bighin, E. Yakaboylu, and M. Lemeshko, “Variational approaches to quantum impurities: from the Fröhlich polaron to the angulon,” Molecular Physics. Taylor and Francis, 2019.","apa":"Li, X., Bighin, G., Yakaboylu, E., & Lemeshko, M. (2019). Variational approaches to quantum impurities: from the Fröhlich polaron to the angulon. Molecular Physics. Taylor and Francis. https://doi.org/10.1080/00268976.2019.1567852","ista":"Li X, Bighin G, Yakaboylu E, Lemeshko M. 2019. Variational approaches to quantum impurities: from the Fröhlich polaron to the angulon. Molecular Physics."},"day":"18","article_processing_charge":"No","has_accepted_license":"1","scopus_import":"1","file":[{"date_created":"2019-01-29T08:32:57Z","date_updated":"2020-07-14T12:47:13Z","checksum":"178964744b636a6f036372f4f090a657","file_id":"5896","relation":"main_file","creator":"dernst","content_type":"application/pdf","file_size":1309966,"file_name":"2019_MolecularPhysics_Li.pdf","access_level":"open_access"}],"oa_version":"Published Version","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","_id":"5886","status":"public","title":"Variational approaches to quantum impurities: from the Fröhlich polaron to the angulon","ddc":["530"],"abstract":[{"lang":"eng","text":"Problems involving quantum impurities, in which one or a few particles are interacting with a macroscopic environment, represent a pervasive paradigm, spanning across atomic, molecular, and condensed-matter physics. In this paper we introduce new variational approaches to quantum impurities and apply them to the Fröhlich polaron–a quasiparticle formed out of an electron (or other point-like impurity) in a polar medium, and to the angulon–a quasiparticle formed out of a rotating molecule in a bosonic bath. We benchmark these approaches against established theories, evaluating their accuracy as a function of the impurity-bath coupling."}],"type":"journal_article"},{"scopus_import":"1","keyword":["computational 3-manifold topology","fixed-parameter tractability","layered triangulations","structural graph theory","treewidth","cutwidth","Heegaard genus"],"article_processing_charge":"No","has_accepted_license":"1","day":"01","citation":{"ista":"Huszár K, Spreer J. 2019. 3-manifold triangulations with small treewidth. 35th International Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 129, 44:1-44:20.","apa":"Huszár, K., & Spreer, J. (2019). 3-manifold triangulations with small treewidth. In 35th International Symposium on Computational Geometry (Vol. 129, p. 44:1-44:20). Portland, Oregon, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2019.44","ieee":"K. Huszár and J. Spreer, “3-manifold triangulations with small treewidth,” in 35th International Symposium on Computational Geometry, Portland, Oregon, United States, 2019, vol. 129, p. 44:1-44:20.","ama":"Huszár K, Spreer J. 3-manifold triangulations with small treewidth. In: 35th International Symposium on Computational Geometry. Vol 129. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019:44:1-44:20. doi:10.4230/LIPIcs.SoCG.2019.44","chicago":"Huszár, Kristóf, and Jonathan Spreer. “3-Manifold Triangulations with Small Treewidth.” In 35th International Symposium on Computational Geometry, 129:44:1-44:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. https://doi.org/10.4230/LIPIcs.SoCG.2019.44.","mla":"Huszár, Kristóf, and Jonathan Spreer. “3-Manifold Triangulations with Small Treewidth.” 35th International Symposium on Computational Geometry, vol. 129, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 44:1-44:20, doi:10.4230/LIPIcs.SoCG.2019.44.","short":"K. Huszár, J. Spreer, in:, 35th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 44:1-44:20."},"publication":"35th International Symposium on Computational Geometry","page":"44:1-44:20","date_published":"2019-06-01T00:00:00Z","type":"conference","alternative_title":["LIPIcs"],"abstract":[{"lang":"eng","text":"Motivated by fixed-parameter tractable (FPT) problems in computational topology, we consider the treewidth tw(M) of a compact, connected 3-manifold M, defined to be the minimum treewidth of the face pairing graph of any triangulation T of M. In this setting the relationship between the topology of a 3-manifold and its treewidth is of particular interest. First, as a corollary of work of Jaco and Rubinstein, we prove that for any closed, orientable 3-manifold M the treewidth tw(M) is at most 4g(M)-2, where g(M) denotes Heegaard genus of M. In combination with our earlier work with Wagner, this yields that for non-Haken manifolds the Heegaard genus and the treewidth are within a constant factor. Second, we characterize all 3-manifolds of treewidth one: These are precisely the lens spaces and a single other Seifert fibered space. Furthermore, we show that all remaining orientable Seifert fibered spaces over the 2-sphere or a non-orientable surface have treewidth two. In particular, for every spherical 3-manifold we exhibit a triangulation of treewidth at most two. Our results further validate the parameter of treewidth (and other related parameters such as cutwidth or congestion) to be useful for topological computing, and also shed more light on the scope of existing FPT-algorithms in the field."}],"_id":"6556","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 129","title":"3-manifold triangulations with small treewidth","status":"public","ddc":["516"],"oa_version":"Published Version","file":[{"access_level":"open_access","file_name":"2019_LIPIcs-Huszar.pdf","creator":"kschuh","content_type":"application/pdf","file_size":905885,"file_id":"6557","relation":"main_file","checksum":"29d18c435368468aa85823dabb157e43","date_created":"2019-06-12T06:45:33Z","date_updated":"2020-07-14T12:47:33Z"}],"publication_identifier":{"isbn":["978-3-95977-104-7"],"issn":["1868-8969"]},"month":"06","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":["1812.05528"]},"oa":1,"quality_controlled":"1","doi":"10.4230/LIPIcs.SoCG.2019.44","conference":{"start_date":"2019-06-18","location":"Portland, Oregon, United States","end_date":"2019-06-21","name":"SoCG: Symposium on Computational Geometry"},"language":[{"iso":"eng"}],"file_date_updated":"2020-07-14T12:47:33Z","year":"2019","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","department":[{"_id":"UlWa"}],"publication_status":"published","related_material":{"record":[{"status":"public","relation":"part_of_dissertation","id":"8032"}]},"author":[{"full_name":"Huszár, Kristóf","last_name":"Huszár","first_name":"Kristóf","orcid":"0000-0002-5445-5057","id":"33C26278-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Spreer, Jonathan","last_name":"Spreer","first_name":"Jonathan"}],"volume":129,"date_created":"2019-06-11T20:09:57Z","date_updated":"2023-09-07T13:18:26Z"}]