[{"status":"public","type":"conference","conference":{"name":"SoCG: Symposium on Computational Geometry","start_date":"2018-06-11","location":"Budapest, Hungary","end_date":"2018-06-14"},"_id":"186","department":[{"_id":"UlWa"}],"date_updated":"2023-08-14T12:43:51Z","month":"06","intvolume":" 99","scopus_import":"1","alternative_title":["LIPIcs"],"main_file_link":[{"url":"https://arxiv.org/abs/1803.05085","open_access":"1"}],"oa_version":"Submitted Version","abstract":[{"text":"A drawing of a graph on a surface is independently even if every pair of nonadjacent edges in the drawing crosses an even number of times. The ℤ2-genus of a graph G is the minimum g such that G has an independently even drawing on the orientable surface of genus g. An unpublished result by Robertson and Seymour implies that for every t, every graph of sufficiently large genus contains as a minor a projective t × t grid or one of the following so-called t-Kuratowski graphs: K3, t, or t copies of K5 or K3,3 sharing at most 2 common vertices. We show that the ℤ2-genus of graphs in these families is unbounded in t; in fact, equal to their genus. Together, this implies that the genus of a graph is bounded from above by a function of its ℤ2-genus, solving a problem posed by Schaefer and Štefankovič, and giving an approximate version of the Hanani-Tutte theorem on orientable surfaces.","lang":"eng"}],"related_material":{"record":[{"relation":"later_version","id":"11593","status":"public"}]},"volume":99,"language":[{"iso":"eng"}],"publication_status":"published","project":[{"grant_number":"M02281","name":"Eliminating intersections in drawings of graphs","_id":"261FA626-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"title":"The ℤ2-Genus of Kuratowski minors","publist_id":"7734","author":[{"orcid":"0000-0001-8485-1774","full_name":"Fulek, Radoslav","last_name":"Fulek","id":"39F3FFE4-F248-11E8-B48F-1D18A9856A87","first_name":"Radoslav"},{"first_name":"Jan","last_name":"Kynčl","full_name":"Kynčl, Jan"}],"external_id":{"arxiv":["1803.05085"]},"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Fulek, Radoslav, and Jan Kynčl. The ℤ2-Genus of Kuratowski Minors. Vol. 99, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, p. 40.1-40.14, doi:10.4230/LIPIcs.SoCG.2018.40.","ama":"Fulek R, Kynčl J. The ℤ2-Genus of Kuratowski minors. In: Vol 99. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018:40.1-40.14. doi:10.4230/LIPIcs.SoCG.2018.40","apa":"Fulek, R., & Kynčl, J. (2018). The ℤ2-Genus of Kuratowski minors (Vol. 99, p. 40.1-40.14). Presented at the SoCG: Symposium on Computational Geometry, Budapest, Hungary: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2018.40","short":"R. Fulek, J. Kynčl, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, p. 40.1-40.14.","ieee":"R. Fulek and J. Kynčl, “The ℤ2-Genus of Kuratowski minors,” presented at the SoCG: Symposium on Computational Geometry, Budapest, Hungary, 2018, vol. 99, p. 40.1-40.14.","chicago":"Fulek, Radoslav, and Jan Kynčl. “The ℤ2-Genus of Kuratowski Minors,” 99:40.1-40.14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. https://doi.org/10.4230/LIPIcs.SoCG.2018.40.","ista":"Fulek R, Kynčl J. 2018. The ℤ2-Genus of Kuratowski minors. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 99, 40.1-40.14."},"quality_controlled":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","oa":1,"date_published":"2018-06-11T00:00:00Z","doi":"10.4230/LIPIcs.SoCG.2018.40","date_created":"2018-12-11T11:45:05Z","page":"40.1 - 40.14","day":"11","year":"2018"},{"date_updated":"2023-08-24T14:39:32Z","department":[{"_id":"UlWa"}],"_id":"433","conference":{"name":"GD 2017: Graph Drawing and Network Visualization","start_date":"201-09-25","location":"Boston, MA, United States","end_date":"2017-09-27"},"type":"conference","status":"public","publication_status":"published","language":[{"iso":"eng"}],"volume":10692,"related_material":{"record":[{"id":"5857","status":"public","relation":"later_version"}]},"abstract":[{"text":"A thrackle is a graph drawn in the plane so that every pair of its edges meet exactly once: either at a common end vertex or in a proper crossing. We prove that any thrackle of n vertices has at most 1.3984n edges. Quasi-thrackles are defined similarly, except that every pair of edges that do not share a vertex are allowed to cross an odd number of times. It is also shown that the maximum number of edges of a quasi-thrackle on n vertices is 3/2(n-1), and that this bound is best possible for infinitely many values of n.","lang":"eng"}],"oa_version":"Submitted Version","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1708.08037"}],"scopus_import":1,"alternative_title":["LNCS"],"intvolume":" 10692","month":"01","citation":{"ista":"Fulek R, Pach J. 2018. Thrackles: An improved upper bound. GD 2017: Graph Drawing and Network Visualization, LNCS, vol. 10692, 160–166.","chicago":"Fulek, Radoslav, and János Pach. “Thrackles: An Improved Upper Bound,” 10692:160–66. Springer, 2018. https://doi.org/10.1007/978-3-319-73915-1_14.","apa":"Fulek, R., & Pach, J. (2018). Thrackles: An improved upper bound (Vol. 10692, pp. 160–166). Presented at the GD 2017: Graph Drawing and Network Visualization, Boston, MA, United States: Springer. https://doi.org/10.1007/978-3-319-73915-1_14","ama":"Fulek R, Pach J. Thrackles: An improved upper bound. In: Vol 10692. Springer; 2018:160-166. doi:10.1007/978-3-319-73915-1_14","ieee":"R. Fulek and J. Pach, “Thrackles: An improved upper bound,” presented at the GD 2017: Graph Drawing and Network Visualization, Boston, MA, United States, 2018, vol. 10692, pp. 160–166.","short":"R. Fulek, J. Pach, in:, Springer, 2018, pp. 160–166.","mla":"Fulek, Radoslav, and János Pach. Thrackles: An Improved Upper Bound. Vol. 10692, Springer, 2018, pp. 160–66, doi:10.1007/978-3-319-73915-1_14."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"arxiv":["1708.08037"]},"author":[{"orcid":"0000-0001-8485-1774","full_name":"Fulek, Radoslav","last_name":"Fulek","id":"39F3FFE4-F248-11E8-B48F-1D18A9856A87","first_name":"Radoslav"},{"first_name":"János","last_name":"Pach","full_name":"Pach, János"}],"publist_id":"7390","title":"Thrackles: An improved upper bound","year":"2018","day":"21","page":"160 - 166","date_created":"2018-12-11T11:46:27Z","date_published":"2018-01-21T00:00:00Z","doi":"10.1007/978-3-319-73915-1_14","oa":1,"quality_controlled":"1","publisher":"Springer"},{"oa_version":"Published Version","abstract":[{"text":"Both classical and recent studies suggest that chromosomal inversion polymorphisms are important in adaptation and speciation. However, biases in discovery and reporting of inversions make it difficult to assess their prevalence and biological importance. Here, we use an approach based on linkage disequilibrium among markers genotyped for samples collected across a transect between contrasting habitats to detect chromosomal rearrangements de novo. We report 17 polymorphic rearrangements in a single locality for the coastal marine snail, Littorina saxatilis. Patterns of diversity in the field and of recombination in controlled crosses provide strong evidence that at least the majority of these rearrangements are inversions. Most show clinal changes in frequency between habitats, suggestive of divergent selection, but only one appears to be fixed for different arrangements in the two habitats. Consistent with widespread evidence for balancing selection on inversion polymorphisms, we argue that a combination of heterosis and divergent selection can explain the observed patterns and should be considered in other systems spanning environmental gradients.","lang":"eng"}],"month":"10","publisher":"Dryad","oa":1,"main_file_link":[{"open_access":"1","url":"https://doi.org/10.5061/dryad.72cg113"}],"day":"09","year":"2018","related_material":{"record":[{"status":"public","id":"6095","relation":"used_in_publication"}]},"doi":"10.5061/dryad.72cg113","date_published":"2018-10-09T00:00:00Z","date_created":"2021-08-09T12:46:39Z","_id":"9837","status":"public","type":"research_data_reference","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","citation":{"chicago":"Faria, Rui, Pragya Chaube, Hernán E. Morales, Tomas Larsson, Alan R. Lemmon, Emily M. Lemmon, Marina Rafajlović, et al. “Data from: Multiple Chromosomal Rearrangements in a Hybrid Zone between Littorina Saxatilis Ecotypes.” Dryad, 2018. https://doi.org/10.5061/dryad.72cg113.","ista":"Faria R, Chaube P, Morales HE, Larsson T, Lemmon AR, Lemmon EM, Rafajlović M, Panova M, Ravinet M, Johannesson K, Westram AM, Butlin RK. 2018. Data from: Multiple chromosomal rearrangements in a hybrid zone between Littorina saxatilis ecotypes, Dryad, 10.5061/dryad.72cg113.","mla":"Faria, Rui, et al. Data from: Multiple Chromosomal Rearrangements in a Hybrid Zone between Littorina Saxatilis Ecotypes. Dryad, 2018, doi:10.5061/dryad.72cg113.","ama":"Faria R, Chaube P, Morales HE, et al. Data from: Multiple chromosomal rearrangements in a hybrid zone between Littorina saxatilis ecotypes. 2018. doi:10.5061/dryad.72cg113","apa":"Faria, R., Chaube, P., Morales, H. E., Larsson, T., Lemmon, A. R., Lemmon, E. M., … Butlin, R. K. (2018). Data from: Multiple chromosomal rearrangements in a hybrid zone between Littorina saxatilis ecotypes. Dryad. https://doi.org/10.5061/dryad.72cg113","short":"R. Faria, P. Chaube, H.E. Morales, T. Larsson, A.R. Lemmon, E.M. Lemmon, M. Rafajlović, M. Panova, M. Ravinet, K. Johannesson, A.M. Westram, R.K. Butlin, (2018).","ieee":"R. Faria et al., “Data from: Multiple chromosomal rearrangements in a hybrid zone between Littorina saxatilis ecotypes.” Dryad, 2018."},"date_updated":"2023-08-24T14:50:26Z","department":[{"_id":"NiBa"}],"title":"Data from: Multiple chromosomal rearrangements in a hybrid zone between Littorina saxatilis ecotypes","author":[{"first_name":"Rui","last_name":"Faria","full_name":"Faria, Rui"},{"first_name":"Pragya","last_name":"Chaube","full_name":"Chaube, Pragya"},{"first_name":"Hernán E.","full_name":"Morales, Hernán E.","last_name":"Morales"},{"full_name":"Larsson, Tomas","last_name":"Larsson","first_name":"Tomas"},{"last_name":"Lemmon","full_name":"Lemmon, Alan R.","first_name":"Alan R."},{"first_name":"Emily M.","last_name":"Lemmon","full_name":"Lemmon, Emily M."},{"first_name":"Marina","last_name":"Rafajlović","full_name":"Rafajlović, Marina"},{"first_name":"Marina","full_name":"Panova, Marina","last_name":"Panova"},{"first_name":"Mark","last_name":"Ravinet","full_name":"Ravinet, Mark"},{"full_name":"Johannesson, Kerstin","last_name":"Johannesson","first_name":"Kerstin"},{"first_name":"Anja M","id":"3C147470-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-1050-4969","full_name":"Westram, Anja M","last_name":"Westram"},{"first_name":"Roger K.","full_name":"Butlin, Roger K.","last_name":"Butlin"}],"article_processing_charge":"No"},{"oa":1,"scopus_import":1,"alternative_title":["IST Austria Technical Report"],"publisher":"IST Austria","month":"11","abstract":[{"lang":"eng","text":"We consider the problem of expected cost analysis over nondeterministic probabilistic programs, which aims at automated methods for analyzing the resource-usage of such programs. Previous approaches for this problem could only handle nonnegative bounded costs. However, in many scenarios, such as queuing networks or analysis of cryptocurrency protocols, both positive and negative costs are necessary and the costs are unbounded as well.\r\n\r\nIn this work, we present a sound and efficient approach to obtain polynomial bounds on the expected accumulated cost of nondeterministic probabilistic programs. Our approach can handle (a) general positive and negative costs with bounded updates in variables; and (b) nonnegative costs with general updates to variables. We show that several natural examples which could not be handled by previous approaches are captured in our framework.\r\n\r\nMoreover, our approach leads to an efficient polynomial-time algorithm, while no previous approach for cost analysis of probabilistic programs could guarantee polynomial runtime. Finally, we show the effectiveness of our approach by presenting experimental results on a variety of programs, motivated by real-world applications, for which we efficiently synthesize tight resource-usage bounds."}],"oa_version":"Published Version","page":"27","date_created":"2018-12-12T11:39:26Z","date_published":"2018-11-11T00:00:00Z","related_material":{"record":[{"relation":"later_version","status":"public","id":"6175"}]},"publication_status":"published","year":"2018","publication_identifier":{"issn":["2664-1690"]},"has_accepted_license":"1","language":[{"iso":"eng"}],"day":"11","file":[{"checksum":"ba3adafd36fe200385ccda583063b9eb","file_id":"5493","content_type":"application/pdf","access_level":"open_access","relation":"main_file","date_created":"2018-12-12T11:53:32Z","file_name":"IST-2018-1066-v1+1_techreport.pdf","date_updated":"2020-07-14T12:47:00Z","file_size":4202966,"creator":"system"},{"checksum":"6cf3a19164bb8e5048a9c8c84dfd9fa3","file_id":"6402","content_type":"text/plain","access_level":"closed","relation":"main_file","date_created":"2019-05-10T13:22:12Z","file_name":"authors-names.txt","date_updated":"2020-07-14T12:47:00Z","file_size":322,"creator":"dernst"}],"type":"technical_report","pubrep_id":"1066","status":"public","_id":"5457","author":[{"last_name":"Anonymous","full_name":"Anonymous, 1","first_name":"1"},{"first_name":"2","last_name":"Anonymous","full_name":"Anonymous, 2"},{"first_name":"3","last_name":"Anonymous","full_name":"Anonymous, 3"},{"first_name":"4","last_name":"Anonymous","full_name":"Anonymous, 4"},{"full_name":"Anonymous, 5","last_name":"Anonymous","first_name":"5"},{"last_name":"Anonymous","full_name":"Anonymous, 6","first_name":"6"}],"file_date_updated":"2020-07-14T12:47:00Z","title":"Cost analysis of nondeterministic probabilistic programs","citation":{"ista":"Anonymous 1, Anonymous 2, Anonymous 3, Anonymous 4, Anonymous 5, Anonymous 6. 2018. Cost analysis of nondeterministic probabilistic programs, IST Austria, 27p.","chicago":"Anonymous, 1, 2 Anonymous, 3 Anonymous, 4 Anonymous, 5 Anonymous, and 6 Anonymous. Cost Analysis of Nondeterministic Probabilistic Programs. IST Austria, 2018.","apa":"Anonymous, 1, Anonymous, 2, Anonymous, 3, Anonymous, 4, Anonymous, 5, & Anonymous, 6. (2018). Cost analysis of nondeterministic probabilistic programs. IST Austria.","ama":"Anonymous 1, Anonymous 2, Anonymous 3, Anonymous 4, Anonymous 5, Anonymous 6. Cost Analysis of Nondeterministic Probabilistic Programs. IST Austria; 2018.","ieee":"1 Anonymous, 2 Anonymous, 3 Anonymous, 4 Anonymous, 5 Anonymous, and 6 Anonymous, Cost analysis of nondeterministic probabilistic programs. IST Austria, 2018.","short":"1 Anonymous, 2 Anonymous, 3 Anonymous, 4 Anonymous, 5 Anonymous, 6 Anonymous, Cost Analysis of Nondeterministic Probabilistic Programs, IST Austria, 2018.","mla":"Anonymous, 1, et al. Cost Analysis of Nondeterministic Probabilistic Programs. IST Austria, 2018."},"date_updated":"2023-08-25T08:07:48Z","ddc":["000"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"month":"03","place":"Cham","intvolume":" 16","scopus_import":"1","main_file_link":[{"url":"https://arxiv.org/abs/1502.01072","open_access":"1"}],"oa_version":"Preprint","abstract":[{"lang":"eng","text":"We prove that every congruence distributive variety has directed Jónsson terms, and every congruence modular variety has directed Gumm terms. The directed terms we construct witness every case of absorption witnessed by the original Jónsson or Gumm terms. This result is equivalent to a pair of claims about absorption for admissible preorders in congruence distributive and congruence modular varieties, respectively. For finite algebras, these absorption theorems have already seen significant applications, but until now, it was not clear if the theorems hold for general algebras as well. Our method also yields a novel proof of a result by P. Lipparini about the existence of a chain of terms (which we call Pixley terms) in varieties that are at the same time congruence distributive and k-permutable for some k."}],"volume":16,"language":[{"iso":"eng"}],"publication_identifier":{"eisbn":["9783319747729"],"eissn":["2211-2766"],"isbn":["9783319747712"],"issn":["2211-2758"]},"publication_status":"published","status":"public","type":"book_chapter","_id":"10864","series_title":"OCTR","department":[{"_id":"VlKo"}],"date_updated":"2023-09-05T15:37:18Z","publisher":"Springer Nature","quality_controlled":"1","oa":1,"acknowledgement":"The second author was supported by National Science Center grant DEC-2011-/01/B/ST6/01006.","date_published":"2018-03-21T00:00:00Z","doi":"10.1007/978-3-319-74772-9_7","date_created":"2022-03-18T10:30:32Z","page":"203-220","day":"21","publication":"Don Pigozzi on Abstract Algebraic Logic, Universal Algebra, and Computer Science","year":"2018","title":"Absorption and directed Jónsson terms","editor":[{"last_name":"Czelakowski","full_name":"Czelakowski, J","first_name":"J"}],"author":[{"first_name":"Alexandr","id":"3B32BAA8-F248-11E8-B48F-1D18A9856A87","full_name":"Kazda, Alexandr","last_name":"Kazda"},{"last_name":"Kozik","full_name":"Kozik, Marcin","first_name":"Marcin"},{"full_name":"McKenzie, Ralph","last_name":"McKenzie","first_name":"Ralph"},{"last_name":"Moore","full_name":"Moore, Matthew","first_name":"Matthew"}],"article_processing_charge":"No","external_id":{"arxiv":["1502.01072"]},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"short":"A. Kazda, M. Kozik, R. McKenzie, M. Moore, in:, J. Czelakowski (Ed.), Don Pigozzi on Abstract Algebraic Logic, Universal Algebra, and Computer Science, Springer Nature, Cham, 2018, pp. 203–220.","ieee":"A. Kazda, M. Kozik, R. McKenzie, and M. Moore, “Absorption and directed Jónsson terms,” in Don Pigozzi on Abstract Algebraic Logic, Universal Algebra, and Computer Science, vol. 16, J. Czelakowski, Ed. Cham: Springer Nature, 2018, pp. 203–220.","apa":"Kazda, A., Kozik, M., McKenzie, R., & Moore, M. (2018). Absorption and directed Jónsson terms. In J. Czelakowski (Ed.), Don Pigozzi on Abstract Algebraic Logic, Universal Algebra, and Computer Science (Vol. 16, pp. 203–220). Cham: Springer Nature. https://doi.org/10.1007/978-3-319-74772-9_7","ama":"Kazda A, Kozik M, McKenzie R, Moore M. Absorption and directed Jónsson terms. In: Czelakowski J, ed. Don Pigozzi on Abstract Algebraic Logic, Universal Algebra, and Computer Science. Vol 16. OCTR. Cham: Springer Nature; 2018:203-220. doi:10.1007/978-3-319-74772-9_7","mla":"Kazda, Alexandr, et al. “Absorption and Directed Jónsson Terms.” Don Pigozzi on Abstract Algebraic Logic, Universal Algebra, and Computer Science, edited by J Czelakowski, vol. 16, Springer Nature, 2018, pp. 203–20, doi:10.1007/978-3-319-74772-9_7.","ista":"Kazda A, Kozik M, McKenzie R, Moore M. 2018.Absorption and directed Jónsson terms. In: Don Pigozzi on Abstract Algebraic Logic, Universal Algebra, and Computer Science. vol. 16, 203–220.","chicago":"Kazda, Alexandr, Marcin Kozik, Ralph McKenzie, and Matthew Moore. “Absorption and Directed Jónsson Terms.” In Don Pigozzi on Abstract Algebraic Logic, Universal Algebra, and Computer Science, edited by J Czelakowski, 16:203–20. OCTR. Cham: Springer Nature, 2018. https://doi.org/10.1007/978-3-319-74772-9_7."}},{"acknowledgement":"Partially supported by the project EMBEDS II (CZ: 7AMB17FR029, FR: 38087RM) of Czech-French collaboration.","oa":1,"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1","year":"2018","has_accepted_license":"1","day":"11","page":"41:1 - 41:16","date_created":"2018-12-11T11:45:04Z","doi":"10.4230/LIPIcs.SoCG.2018.41","date_published":"2018-06-11T00:00:00Z","citation":{"ista":"Goaoc X, Paták P, Patakova Z, Tancer M, Wagner U. 2018. Shellability is NP-complete. SoCG: Symposium on Computational Geometry, Leibniz International Proceedings in Information, LIPIcs, vol. 99, 41:1-41:16.","chicago":"Goaoc, Xavier, Pavel Paták, Zuzana Patakova, Martin Tancer, and Uli Wagner. “Shellability Is NP-Complete,” 99:41:1-41:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. https://doi.org/10.4230/LIPIcs.SoCG.2018.41.","ieee":"X. Goaoc, P. Paták, Z. Patakova, M. Tancer, and U. Wagner, “Shellability is NP-complete,” presented at the SoCG: Symposium on Computational Geometry, Budapest, Hungary, 2018, vol. 99, p. 41:1-41:16.","short":"X. Goaoc, P. Paták, Z. Patakova, M. Tancer, U. Wagner, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, p. 41:1-41:16.","apa":"Goaoc, X., Paták, P., Patakova, Z., Tancer, M., & Wagner, U. (2018). Shellability is NP-complete (Vol. 99, p. 41:1-41:16). Presented at the SoCG: Symposium on Computational Geometry, Budapest, Hungary: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2018.41","ama":"Goaoc X, Paták P, Patakova Z, Tancer M, Wagner U. Shellability is NP-complete. In: Vol 99. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018:41:1-41:16. doi:10.4230/LIPIcs.SoCG.2018.41","mla":"Goaoc, Xavier, et al. Shellability Is NP-Complete. Vol. 99, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, p. 41:1-41:16, doi:10.4230/LIPIcs.SoCG.2018.41."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"7736","author":[{"last_name":"Goaoc","full_name":"Goaoc, Xavier","first_name":"Xavier"},{"full_name":"Paták, Pavel","last_name":"Paták","first_name":"Pavel"},{"id":"48B57058-F248-11E8-B48F-1D18A9856A87","first_name":"Zuzana","last_name":"Patakova","orcid":"0000-0002-3975-1683","full_name":"Patakova, Zuzana"},{"last_name":"Tancer","orcid":"0000-0002-1191-6714","full_name":"Tancer, Martin","id":"38AC689C-F248-11E8-B48F-1D18A9856A87","first_name":"Martin"},{"orcid":"0000-0002-1494-0568","full_name":"Wagner, Uli","last_name":"Wagner","first_name":"Uli","id":"36690CA2-F248-11E8-B48F-1D18A9856A87"}],"title":"Shellability is NP-complete","abstract":[{"text":"We prove that for every d ≥ 2, deciding if a pure, d-dimensional, simplicial complex is shellable is NP-hard, hence NP-complete. This resolves a question raised, e.g., by Danaraj and Klee in 1978. Our reduction also yields that for every d ≥ 2 and k ≥ 0, deciding if a pure, d-dimensional, simplicial complex is k-decomposable is NP-hard. For d ≥ 3, both problems remain NP-hard when restricted to contractible pure d-dimensional complexes.","lang":"eng"}],"oa_version":"Published Version","scopus_import":1,"alternative_title":["Leibniz International Proceedings in Information, LIPIcs"],"intvolume":" 99","month":"06","publication_status":"published","language":[{"iso":"eng"}],"file":[{"checksum":"d12bdd60f04a57307867704b5f930afd","file_id":"5725","content_type":"application/pdf","access_level":"open_access","relation":"main_file","date_created":"2018-12-17T16:35:02Z","file_name":"2018_LIPIcs_Goaoc.pdf","date_updated":"2020-07-14T12:45:18Z","file_size":718414,"creator":"dernst"}],"license":"https://creativecommons.org/licenses/by/4.0/","related_material":{"record":[{"id":"7108","status":"public","relation":"later_version"}]},"volume":99,"_id":"184","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"conference":{"location":"Budapest, Hungary","end_date":"2018-06-14","start_date":"2018-06-11","name":"SoCG: Symposium on Computational Geometry"},"type":"conference","status":"public","date_updated":"2023-09-06T11:10:57Z","ddc":["516","000"],"department":[{"_id":"UlWa"}],"file_date_updated":"2020-07-14T12:45:18Z"},{"citation":{"chicago":"Huszár, Kristóf, Jonathan Spreer, and Uli Wagner. “On the Treewidth of Triangulated 3-Manifolds,” Vol. 99. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. https://doi.org/10.4230/LIPIcs.SoCG.2018.46.","ista":"Huszár K, Spreer J, Wagner U. 2018. On the treewidth of triangulated 3-manifolds. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 99, 46.","mla":"Huszár, Kristóf, et al. On the Treewidth of Triangulated 3-Manifolds. Vol. 99, 46, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, doi:10.4230/LIPIcs.SoCG.2018.46.","apa":"Huszár, K., Spreer, J., & Wagner, U. (2018). On the treewidth of triangulated 3-manifolds (Vol. 99). Presented at the SoCG: Symposium on Computational Geometry, Budapest, Hungary: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2018.46","ama":"Huszár K, Spreer J, Wagner U. On the treewidth of triangulated 3-manifolds. In: Vol 99. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018. doi:10.4230/LIPIcs.SoCG.2018.46","ieee":"K. Huszár, J. Spreer, and U. Wagner, “On the treewidth of triangulated 3-manifolds,” presented at the SoCG: Symposium on Computational Geometry, Budapest, Hungary, 2018, vol. 99.","short":"K. Huszár, J. Spreer, U. Wagner, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"id":"33C26278-F248-11E8-B48F-1D18A9856A87","first_name":"Kristóf","full_name":"Huszár, Kristóf","orcid":"0000-0002-5445-5057","last_name":"Huszár"},{"full_name":"Spreer, Jonathan","last_name":"Spreer","first_name":"Jonathan"},{"first_name":"Uli","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1494-0568","full_name":"Wagner, Uli","last_name":"Wagner"}],"publist_id":"7614","external_id":{"arxiv":["1712.00434"]},"article_processing_charge":"No","title":"On the treewidth of triangulated 3-manifolds","article_number":"46","has_accepted_license":"1","year":"2018","day":"01","date_published":"2018-06-01T00:00:00Z","doi":"10.4230/LIPIcs.SoCG.2018.46","date_created":"2018-12-11T11:45:37Z","acknowledgement":"Research of the second author was supported by the Einstein Foundation (project “Einstein Visiting Fellow Santos”) and by the Simons Foundation (“Simons Visiting Professors” program).","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1","oa":1,"date_updated":"2023-09-06T11:13:41Z","ddc":["516","000"],"file_date_updated":"2020-07-14T12:45:51Z","department":[{"_id":"UlWa"}],"_id":"285","type":"conference","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"conference":{"name":"SoCG: Symposium on Computational Geometry","start_date":"2018-06-11","location":"Budapest, Hungary","end_date":"2018-06-14"},"status":"public","publication_identifier":{"issn":["18688969"]},"publication_status":"published","file":[{"file_name":"2018_LIPIcs_Huszar.pdf","date_created":"2018-12-17T15:32:38Z","file_size":642522,"date_updated":"2020-07-14T12:45:51Z","creator":"dernst","checksum":"530d084116778135d5bffaa317479cac","file_id":"5713","content_type":"application/pdf","relation":"main_file","access_level":"open_access"}],"language":[{"iso":"eng"}],"related_material":{"record":[{"id":"7093","status":"public","relation":"later_version"}]},"volume":99,"abstract":[{"lang":"eng","text":"In graph theory, as well as in 3-manifold topology, there exist several width-type parameters to describe how "simple" or "thin" a given graph or 3-manifold is. These parameters, such as pathwidth or treewidth for graphs, or the concept of thin position for 3-manifolds, play an important role when studying algorithmic problems; in particular, there is a variety of problems in computational 3-manifold topology - some of them known to be computationally hard in general - that become solvable in polynomial time as soon as the dual graph of the input triangulation has bounded treewidth. In view of these algorithmic results, it is natural to ask whether every 3-manifold admits a triangulation of bounded treewidth. We show that this is not the case, i.e., that there exists an infinite family of closed 3-manifolds not admitting triangulations of bounded pathwidth or treewidth (the latter implies the former, but we present two separate proofs). We derive these results from work of Agol and of Scharlemann and Thompson, by exhibiting explicit connections between the topology of a 3-manifold M on the one hand and width-type parameters of the dual graphs of triangulations of M on the other hand, answering a question that had been raised repeatedly by researchers in computational 3-manifold topology. In particular, we show that if a closed, orientable, irreducible, non-Haken 3-manifold M has a triangulation of treewidth (resp. pathwidth) k then the Heegaard genus of M is at most 48(k+1) (resp. 4(3k+1))."}],"oa_version":"Submitted Version","alternative_title":["LIPIcs"],"scopus_import":1,"month":"06","intvolume":" 99"},{"abstract":[{"lang":"eng","text":"This dataset contains a GitHub repository containing all the data, analysis, Nextflow workflows and Jupyter notebooks to replicate the manuscript titled \"Fast and accurate large multiple sequence alignments with a root-to-leaf regressive method\".\r\nIt also contains the Multiple Sequence Alignments (MSAs) generated and well as the main figures and tables from the manuscript.\r\nThe repository is also available at GitHub (https://github.com/cbcrg/dpa-analysis) release `v1.2`.\r\nFor details on how to use the regressive alignment algorithm, see the T-Coffee software suite (https://github.com/cbcrg/tcoffee)."}],"oa_version":"Published Version","publisher":"Zenodo","oa":1,"main_file_link":[{"open_access":"1","url":"https://doi.org/10.5281/zenodo.3271452"}],"month":"12","year":"2018","day":"07","doi":"10.5281/ZENODO.2025846","related_material":{"record":[{"status":"public","id":"7181","relation":"used_in_publication"}]},"date_published":"2018-12-07T00:00:00Z","date_created":"2023-05-23T16:08:20Z","_id":"13059","type":"research_data_reference","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"status":"public","date_updated":"2023-09-06T14:32:51Z","citation":{"chicago":"Garriga, Edgar, Paolo di Tommaso, Cedrik Magis, Ionas Erb, Leila Mansouri, Athanasios Baltzis, Hafid Laayouni, Fyodor Kondrashov, Evan Floden, and Cedric Notredame. “Fast and Accurate Large Multiple Sequence Alignments with a Root-to-Leaf Regressive Method.” Zenodo, 2018. https://doi.org/10.5281/ZENODO.2025846.","ista":"Garriga E, di Tommaso P, Magis C, Erb I, Mansouri L, Baltzis A, Laayouni H, Kondrashov F, Floden E, Notredame C. 2018. Fast and accurate large multiple sequence alignments with a root-to-leaf regressive method, Zenodo, 10.5281/ZENODO.2025846.","mla":"Garriga, Edgar, et al. Fast and Accurate Large Multiple Sequence Alignments with a Root-to-Leaf Regressive Method. Zenodo, 2018, doi:10.5281/ZENODO.2025846.","ama":"Garriga E, di Tommaso P, Magis C, et al. Fast and accurate large multiple sequence alignments with a root-to-leaf regressive method. 2018. doi:10.5281/ZENODO.2025846","apa":"Garriga, E., di Tommaso, P., Magis, C., Erb, I., Mansouri, L., Baltzis, A., … Notredame, C. (2018). Fast and accurate large multiple sequence alignments with a root-to-leaf regressive method. Zenodo. https://doi.org/10.5281/ZENODO.2025846","short":"E. Garriga, P. di Tommaso, C. Magis, I. Erb, L. Mansouri, A. Baltzis, H. Laayouni, F. Kondrashov, E. Floden, C. Notredame, (2018).","ieee":"E. Garriga et al., “Fast and accurate large multiple sequence alignments with a root-to-leaf regressive method.” Zenodo, 2018."},"ddc":["570"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Garriga, Edgar","last_name":"Garriga","first_name":"Edgar"},{"first_name":"Paolo","last_name":"di Tommaso","full_name":"di Tommaso, Paolo"},{"full_name":"Magis, Cedrik","last_name":"Magis","first_name":"Cedrik"},{"full_name":"Erb, Ionas","last_name":"Erb","first_name":"Ionas"},{"full_name":"Mansouri, Leila","last_name":"Mansouri","first_name":"Leila"},{"full_name":"Baltzis, Athanasios","last_name":"Baltzis","first_name":"Athanasios"},{"first_name":"Hafid","full_name":"Laayouni, Hafid","last_name":"Laayouni"},{"id":"44FDEF62-F248-11E8-B48F-1D18A9856A87","first_name":"Fyodor","last_name":"Kondrashov","orcid":"0000-0001-8243-4694","full_name":"Kondrashov, Fyodor"},{"first_name":"Evan","last_name":"Floden","full_name":"Floden, Evan"},{"last_name":"Notredame","full_name":"Notredame, Cedric","first_name":"Cedric"}],"article_processing_charge":"No","title":"Fast and accurate large multiple sequence alignments with a root-to-leaf regressive method","department":[{"_id":"FyKo"}]},{"degree_awarded":"PhD","publication_status":"published","publication_identifier":{"issn":["2663-337X"]},"language":[{"iso":"eng"}],"file":[{"file_name":"2018_Thesis_Watzinger.pdf","date_created":"2019-04-09T07:13:28Z","file_size":85539748,"date_updated":"2020-07-14T12:46:35Z","creator":"dernst","file_id":"6249","checksum":"b653b5216251f938ddbeafd1de88667c","content_type":"application/pdf","relation":"main_file","access_level":"open_access"},{"creator":"dernst","date_updated":"2020-07-14T12:46:35Z","file_size":21830697,"date_created":"2019-04-09T07:13:27Z","file_name":"2018_Thesis_Watzinger_source.zip","access_level":"closed","relation":"source_file","content_type":"application/zip","checksum":"39bcf8de7ac5b1bb516b11ce2f966785","file_id":"6250"}],"alternative_title":["ISTA Thesis"],"month":"07","abstract":[{"lang":"eng","text":"Nowadays, quantum computation is receiving more and more attention as an alternative to the classical way of computing. For realizing a quantum computer, different devices are investigated as potential quantum bits. In this thesis, the focus is on Ge hut wires, which turned out to be promising candidates for implementing hole spin quantum bits. The advantages of Ge as a material system are the low hyperfine interaction for holes and the strong spin orbit coupling, as well as the compatibility with the highly developed CMOS processes in industry. In addition, Ge can also be isotopically purified which is expected to boost the spin coherence times. The strong spin orbit interaction for holes in Ge on the one hand enables the full electrical control of the quantum bit and on the other hand should allow short spin manipulation times. Starting with a bare Si wafer, this work covers the entire process reaching from growth over the fabrication and characterization of hut wire devices up to the demonstration of hole spin resonance. From experiments with single quantum dots, a large g-factor anisotropy between the in-plane and the out-of-plane direction was found. A comparison to a theoretical model unveiled the heavy-hole character of the lowest energy states. The second part of the thesis addresses double quantum dot devices, which were realized by adding two gate electrodes to a hut wire. In such devices, Pauli spin blockade was observed, which can serve as a read-out mechanism for spin quantum bits. Applying oscillating electric fields in spin blockade allowed the demonstration of continuous spin rotations and the extraction of a lower bound for the spin dephasing time. Despite the strong spin orbit coupling in Ge, the obtained value for the dephasing time is comparable to what has been recently reported for holes in Si. All in all, the presented results point out the high potential of Ge hut wires as a platform for long-lived, fast and fully electrically tunable hole spin quantum bits."}],"oa_version":"Published Version","file_date_updated":"2020-07-14T12:46:35Z","department":[{"_id":"GeKa"}],"date_updated":"2023-09-07T12:27:43Z","supervisor":[{"first_name":"Georgios","id":"38DB5788-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8342-202X","full_name":"Katsaros, Georgios","last_name":"Katsaros"}],"ddc":["530"],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"dissertation","pubrep_id":"1033","status":"public","_id":"49","page":"77","date_created":"2018-12-11T11:44:21Z","doi":"10.15479/AT:ISTA:th_1033","date_published":"2018-07-30T00:00:00Z","year":"2018","has_accepted_license":"1","day":"30","oa":1,"publisher":"Institute of Science and Technology Austria","article_processing_charge":"No","author":[{"id":"35DF8E50-F248-11E8-B48F-1D18A9856A87","first_name":"Hannes","last_name":"Watzinger","full_name":"Watzinger, Hannes"}],"publist_id":"8005","title":"Ge hut wires - from growth to hole spin resonance","citation":{"ista":"Watzinger H. 2018. Ge hut wires - from growth to hole spin resonance. Institute of Science and Technology Austria.","chicago":"Watzinger, Hannes. “Ge Hut Wires - from Growth to Hole Spin Resonance.” Institute of Science and Technology Austria, 2018. https://doi.org/10.15479/AT:ISTA:th_1033.","apa":"Watzinger, H. (2018). Ge hut wires - from growth to hole spin resonance. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:th_1033","ama":"Watzinger H. Ge hut wires - from growth to hole spin resonance. 2018. doi:10.15479/AT:ISTA:th_1033","short":"H. Watzinger, Ge Hut Wires - from Growth to Hole Spin Resonance, Institute of Science and Technology Austria, 2018.","ieee":"H. Watzinger, “Ge hut wires - from growth to hole spin resonance,” Institute of Science and Technology Austria, 2018.","mla":"Watzinger, Hannes. Ge Hut Wires - from Growth to Hole Spin Resonance. Institute of Science and Technology Austria, 2018, doi:10.15479/AT:ISTA:th_1033."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1"},{"has_accepted_license":"1","year":"2018","day":"11","page":"171","date_published":"2018-06-11T00:00:00Z","doi":"10.15479/AT:ISTA:th_1026","date_created":"2018-12-11T11:45:10Z","publisher":"Institute of Science and Technology Austria","oa":1,"citation":{"apa":"Iglesias Ham, M. (2018). Multiple covers with balls. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:th_1026","ama":"Iglesias Ham M. Multiple covers with balls. 2018. doi:10.15479/AT:ISTA:th_1026","ieee":"M. Iglesias Ham, “Multiple covers with balls,” Institute of Science and Technology Austria, 2018.","short":"M. Iglesias Ham, Multiple Covers with Balls, Institute of Science and Technology Austria, 2018.","mla":"Iglesias Ham, Mabel. Multiple Covers with Balls. Institute of Science and Technology Austria, 2018, doi:10.15479/AT:ISTA:th_1026.","ista":"Iglesias Ham M. 2018. Multiple covers with balls. Institute of Science and Technology Austria.","chicago":"Iglesias Ham, Mabel. “Multiple Covers with Balls.” Institute of Science and Technology Austria, 2018. https://doi.org/10.15479/AT:ISTA:th_1026."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","author":[{"last_name":"Iglesias Ham","full_name":"Iglesias Ham, Mabel","id":"41B58C0C-F248-11E8-B48F-1D18A9856A87","first_name":"Mabel"}],"publist_id":"7712","article_processing_charge":"No","title":"Multiple covers with balls","publication_identifier":{"issn":["2663-337X"]},"publication_status":"published","degree_awarded":"PhD","file":[{"creator":"kschuh","file_size":11827713,"date_updated":"2020-07-14T12:45:24Z","file_name":"IST-2018-1025-v2+5_ist-thesis-iglesias-11June2018(1).zip","date_created":"2019-02-05T07:43:31Z","relation":"source_file","access_level":"closed","content_type":"application/zip","checksum":"dd699303623e96d1478a6ae07210dd05","file_id":"5918"},{"date_created":"2019-02-05T07:43:45Z","file_name":"IST-2018-1025-v2+4_ThesisIglesiasFinal11June2018.pdf","date_updated":"2020-07-14T12:45:24Z","file_size":4783846,"creator":"kschuh","checksum":"ba163849a190d2b41d66fef0e4983294","file_id":"5919","content_type":"application/pdf","access_level":"open_access","relation":"main_file"}],"language":[{"iso":"eng"}],"abstract":[{"text":"We describe arrangements of three-dimensional spheres from a geometrical and topological point of view. Real data (fitting this setup) often consist of soft spheres which show certain degree of deformation while strongly packing against each other. In this context, we answer the following questions: If we model a soft packing of spheres by hard spheres that are allowed to overlap, can we measure the volume in the overlapped areas? Can we be more specific about the overlap volume, i.e. quantify how much volume is there covered exactly twice, three times, or k times? What would be a good optimization criteria that rule the arrangement of soft spheres while making a good use of the available space? Fixing a particular criterion, what would be the optimal sphere configuration? The first result of this thesis are short formulas for the computation of volumes covered by at least k of the balls. The formulas exploit information contained in the order-k Voronoi diagrams and its closely related Level-k complex. The used complexes lead to a natural generalization into poset diagrams, a theoretical formalism that contains the order-k and degree-k diagrams as special cases. In parallel, we define different criteria to determine what could be considered an optimal arrangement from a geometrical point of view. Fixing a criterion, we find optimal soft packing configurations in 2D and 3D where the ball centers lie on a lattice. As a last step, we use tools from computational topology on real physical data, to show the potentials of higher-order diagrams in the description of melting crystals. The results of the experiments leaves us with an open window to apply the theories developed in this thesis in real applications.","lang":"eng"}],"oa_version":"Published Version","alternative_title":["ISTA Thesis"],"month":"06","supervisor":[{"last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"}],"date_updated":"2023-09-07T12:25:32Z","ddc":["514","516"],"department":[{"_id":"HeEd"}],"file_date_updated":"2020-07-14T12:45:24Z","_id":"201","type":"dissertation","status":"public","pubrep_id":"1026"}]