--- _id: '14341' abstract: - lang: eng text: Flows through pipes and channels are, in practice, almost always turbulent, and the multiscale eddying motion is responsible for a major part of the encountered friction losses and pumping costs1. Conversely, for pulsatile flows, in particular for aortic blood flow, turbulence levels remain low despite relatively large peak velocities. For aortic blood flow, high turbulence levels are intolerable as they would damage the shear-sensitive endothelial cell layer2,3,4,5. Here we show that turbulence in ordinary pipe flow is diminished if the flow is driven in a pulsatile mode that incorporates all the key features of the cardiac waveform. At Reynolds numbers comparable to those of aortic blood flow, turbulence is largely inhibited, whereas at much higher speeds, the turbulent drag is reduced by more than 25%. This specific operation mode is more efficient when compared with steady driving, which is the present situation for virtually all fluid transport processes ranging from heating circuits to water, gas and oil pipelines. acknowledged_ssus: - _id: M-Shop - _id: ScienComp acknowledgement: We acknowledge the assistance of the Miba machine shop and the team of the ISTA-HPC cluster. We thank M. Quadrio for the discussions. The work was supported by the Simons Foundation (grant no. 662960) and by the Austrian Science Fund (grant no. I4188-N30), within Deutsche Forschungsgemeinschaft research unit FOR 2688. article_processing_charge: No article_type: original author: - first_name: Davide full_name: Scarselli, Davide id: 40315C30-F248-11E8-B48F-1D18A9856A87 last_name: Scarselli orcid: 0000-0001-5227-4271 - first_name: Jose M full_name: Lopez Alonso, Jose M id: 40770848-F248-11E8-B48F-1D18A9856A87 last_name: Lopez Alonso orcid: 0000-0002-0384-2022 - first_name: Atul full_name: Varshney, Atul id: 2A2006B2-F248-11E8-B48F-1D18A9856A87 last_name: Varshney orcid: 0000-0002-3072-5999 - first_name: Björn full_name: Hof, Björn id: 3A374330-F248-11E8-B48F-1D18A9856A87 last_name: Hof orcid: 0000-0003-2057-2754 citation: ama: Scarselli D, Lopez Alonso JM, Varshney A, Hof B. Turbulence suppression by cardiac-cycle-inspired driving of pipe flow. Nature. 2023;621(7977):71-74. doi:10.1038/s41586-023-06399-5 apa: Scarselli, D., Lopez Alonso, J. M., Varshney, A., & Hof, B. (2023). Turbulence suppression by cardiac-cycle-inspired driving of pipe flow. Nature. Springer Nature. https://doi.org/10.1038/s41586-023-06399-5 chicago: Scarselli, Davide, Jose M Lopez Alonso, Atul Varshney, and Björn Hof. “Turbulence Suppression by Cardiac-Cycle-Inspired Driving of Pipe Flow.” Nature. Springer Nature, 2023. https://doi.org/10.1038/s41586-023-06399-5. ieee: D. Scarselli, J. M. Lopez Alonso, A. Varshney, and B. Hof, “Turbulence suppression by cardiac-cycle-inspired driving of pipe flow,” Nature, vol. 621, no. 7977. Springer Nature, pp. 71–74, 2023. ista: Scarselli D, Lopez Alonso JM, Varshney A, Hof B. 2023. Turbulence suppression by cardiac-cycle-inspired driving of pipe flow. Nature. 621(7977), 71–74. mla: Scarselli, Davide, et al. “Turbulence Suppression by Cardiac-Cycle-Inspired Driving of Pipe Flow.” Nature, vol. 621, no. 7977, Springer Nature, 2023, pp. 71–74, doi:10.1038/s41586-023-06399-5. short: D. Scarselli, J.M. Lopez Alonso, A. Varshney, B. Hof, Nature 621 (2023) 71–74. date_created: 2023-09-17T22:01:09Z date_published: 2023-09-07T00:00:00Z date_updated: 2023-09-20T12:10:22Z day: '07' department: - _id: BjHo doi: 10.1038/s41586-023-06399-5 external_id: pmid: - '37673988' intvolume: ' 621' issue: '7977' language: - iso: eng month: '09' oa_version: None page: 71-74 pmid: 1 project: - _id: 238598C6-32DE-11EA-91FC-C7463DDC885E grant_number: '662960' name: 'Revisiting the Turbulence Problem Using Statistical Mechanics: Experimental Studies on Transitional and Turbulent Flows' - _id: 238B8092-32DE-11EA-91FC-C7463DDC885E call_identifier: FWF grant_number: I04188 name: Instabilities in pulsating pipe flow of Newtonian and complex fluids publication: Nature publication_identifier: eissn: - 1476-4687 issn: - 0028-0836 publication_status: published publisher: Springer Nature quality_controlled: '1' related_material: link: - description: News on ISTA website relation: press_release url: https://www.ista.ac.at/en/news/pumping-like-the-heart/ scopus_import: '1' status: public title: Turbulence suppression by cardiac-cycle-inspired driving of pipe flow type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 621 year: '2023' ... --- _id: '14368' abstract: - lang: eng text: "Purpose: \r\nBiallelic variants in TARS2, encoding the mitochondrial threonyl-tRNA-synthetase, have been reported in a small group of individuals displaying a neurodevelopmental phenotype but with limited neuroradiological data and insufficient evidence for causality of the variants.\r\nMethods:\r\nExome or genome sequencing was carried out in 15 families. Clinical and neuroradiological evaluation was performed for all affected individuals, including review of 10 previously reported individuals. The pathogenicity of TARS2 variants was evaluated using in vitro assays and a zebrafish model.\r\nResults:\r\nWe report 18 new individuals harboring biallelic TARS2 variants. Phenotypically, these individuals show developmental delay/intellectual disability, regression, cerebellar and cerebral atrophy, basal ganglia signal alterations, hypotonia, cerebellar signs, and increased blood lactate. In vitro studies showed that variants within the TARS2301-381 region had decreased binding to Rag GTPases, likely impairing mTORC1 activity. The zebrafish model recapitulated key features of the human phenotype and unraveled dysregulation of downstream targets of mTORC1 signaling. Functional testing of the variants confirmed the pathogenicity in a zebrafish model.\r\nConclusion:\r\nWe define the clinico-radiological spectrum of TARS2-related mitochondrial disease, unveil the likely involvement of the mTORC1 signaling pathway as a distinct molecular mechanism, and establish a TARS2 zebrafish model as an important tool to study variant pathogenicity." article_number: '100938' article_processing_charge: No article_type: original author: - first_name: Andrea full_name: Accogli, Andrea last_name: Accogli - first_name: Sheng-Jia full_name: Lin, Sheng-Jia last_name: Lin - first_name: Mariasavina full_name: Severino, Mariasavina last_name: Severino - first_name: Sung-Hoon full_name: Kim, Sung-Hoon last_name: Kim - first_name: Kevin full_name: Huang, Kevin id: 3b3d2888-1ff6-11ee-9fa6-8f209ca91fe3 last_name: Huang orcid: 0000-0002-2512-7812 - first_name: Clarissa full_name: Rocca, Clarissa last_name: Rocca - first_name: Megan full_name: Landsverk, Megan last_name: Landsverk - first_name: Maha S. full_name: Zaki, Maha S. last_name: Zaki - first_name: Almundher full_name: Al-Maawali, Almundher last_name: Al-Maawali - first_name: Varunvenkat M. full_name: Srinivasan, Varunvenkat M. last_name: Srinivasan - first_name: Khalid full_name: Al-Thihli, Khalid last_name: Al-Thihli - first_name: G. Bradly full_name: Schaefer, G. Bradly last_name: Schaefer - first_name: Monica full_name: Davis, Monica last_name: Davis - first_name: Davide full_name: Tonduti, Davide last_name: Tonduti - first_name: Chiara full_name: Doneda, Chiara last_name: Doneda - first_name: Lara M. full_name: Marten, Lara M. last_name: Marten - first_name: Chris full_name: Mühlhausen, Chris last_name: Mühlhausen - first_name: Maria full_name: Gomez, Maria last_name: Gomez - first_name: Eleonora full_name: Lamantea, Eleonora last_name: Lamantea - first_name: Rafael full_name: Mena, Rafael last_name: Mena - first_name: Mathilde full_name: Nizon, Mathilde last_name: Nizon - first_name: Vincent full_name: Procaccio, Vincent last_name: Procaccio - first_name: Amber full_name: Begtrup, Amber last_name: Begtrup - first_name: Aida full_name: Telegrafi, Aida last_name: Telegrafi - first_name: Hong full_name: Cui, Hong last_name: Cui - first_name: Heidi L. full_name: Schulz, Heidi L. last_name: Schulz - first_name: Julia full_name: Mohr, Julia last_name: Mohr - first_name: Saskia full_name: Biskup, Saskia last_name: Biskup - first_name: Mariana Amina full_name: Loos, Mariana Amina last_name: Loos - first_name: Hilda Verónica full_name: Aráoz, Hilda Verónica last_name: Aráoz - first_name: Vincenzo full_name: Salpietro, Vincenzo last_name: Salpietro - first_name: Laura Davis full_name: Keppen, Laura Davis last_name: Keppen - first_name: Manali full_name: Chitre, Manali last_name: Chitre - first_name: Cassidy full_name: Petree, Cassidy last_name: Petree - first_name: Lucy full_name: Raymond, Lucy last_name: Raymond - first_name: Julie full_name: Vogt, Julie last_name: Vogt - first_name: Lindsey B. full_name: Sawyer, Lindsey B. last_name: Sawyer - first_name: Alice A. full_name: Basinger, Alice A. last_name: Basinger - first_name: Signe Vandal full_name: Pedersen, Signe Vandal last_name: Pedersen - first_name: Toni S. full_name: Pearson, Toni S. last_name: Pearson - first_name: Dorothy K. full_name: Grange, Dorothy K. last_name: Grange - first_name: Lokesh full_name: Lingappa, Lokesh last_name: Lingappa - first_name: Paige full_name: McDunnah, Paige last_name: McDunnah - first_name: Rita full_name: Horvath, Rita last_name: Horvath - first_name: Benjamin full_name: Cognè, Benjamin last_name: Cognè - first_name: Bertrand full_name: Isidor, Bertrand last_name: Isidor - first_name: Andreas full_name: Hahn, Andreas last_name: Hahn - first_name: Karen W. full_name: Gripp, Karen W. last_name: Gripp - first_name: Seyed Mehdi full_name: Jafarnejad, Seyed Mehdi last_name: Jafarnejad - first_name: Elsebet full_name: Østergaard, Elsebet last_name: Østergaard - first_name: Carlos E. full_name: Prada, Carlos E. last_name: Prada - first_name: Daniele full_name: Ghezzi, Daniele last_name: Ghezzi - first_name: Vykuntaraju K. full_name: Gowda, Vykuntaraju K. last_name: Gowda - first_name: Robert W. full_name: Taylor, Robert W. last_name: Taylor - first_name: Nahum full_name: Sonenberg, Nahum last_name: Sonenberg - first_name: Henry full_name: Houlden, Henry last_name: Houlden - first_name: Marie full_name: Sissler, Marie last_name: Sissler - first_name: Gaurav K. full_name: Varshney, Gaurav K. last_name: Varshney - first_name: Reza full_name: Maroofian, Reza last_name: Maroofian citation: ama: Accogli A, Lin S-J, Severino M, et al. Clinical, neuroradiological, and molecular characterization of mitochondrial threonyl-tRNA-synthetase (TARS2)-related disorder. Genetics in Medicine. 2023;25(11). doi:10.1016/j.gim.2023.100938 apa: Accogli, A., Lin, S.-J., Severino, M., Kim, S.-H., Huang, K., Rocca, C., … Maroofian, R. (2023). Clinical, neuroradiological, and molecular characterization of mitochondrial threonyl-tRNA-synthetase (TARS2)-related disorder. Genetics in Medicine. Elsevier. https://doi.org/10.1016/j.gim.2023.100938 chicago: Accogli, Andrea, Sheng-Jia Lin, Mariasavina Severino, Sung-Hoon Kim, Kevin Huang, Clarissa Rocca, Megan Landsverk, et al. “Clinical, Neuroradiological, and Molecular Characterization of Mitochondrial Threonyl-TRNA-Synthetase (TARS2)-Related Disorder.” Genetics in Medicine. Elsevier, 2023. https://doi.org/10.1016/j.gim.2023.100938. ieee: A. Accogli et al., “Clinical, neuroradiological, and molecular characterization of mitochondrial threonyl-tRNA-synthetase (TARS2)-related disorder,” Genetics in Medicine, vol. 25, no. 11. Elsevier, 2023. ista: Accogli A, Lin S-J, Severino M, Kim S-H, Huang K, Rocca C, Landsverk M, Zaki MS, Al-Maawali A, Srinivasan VM, Al-Thihli K, Schaefer GB, Davis M, Tonduti D, Doneda C, Marten LM, Mühlhausen C, Gomez M, Lamantea E, Mena R, Nizon M, Procaccio V, Begtrup A, Telegrafi A, Cui H, Schulz HL, Mohr J, Biskup S, Loos MA, Aráoz HV, Salpietro V, Keppen LD, Chitre M, Petree C, Raymond L, Vogt J, Sawyer LB, Basinger AA, Pedersen SV, Pearson TS, Grange DK, Lingappa L, McDunnah P, Horvath R, Cognè B, Isidor B, Hahn A, Gripp KW, Jafarnejad SM, Østergaard E, Prada CE, Ghezzi D, Gowda VK, Taylor RW, Sonenberg N, Houlden H, Sissler M, Varshney GK, Maroofian R. 2023. Clinical, neuroradiological, and molecular characterization of mitochondrial threonyl-tRNA-synthetase (TARS2)-related disorder. Genetics in Medicine. 25(11), 100938. mla: Accogli, Andrea, et al. “Clinical, Neuroradiological, and Molecular Characterization of Mitochondrial Threonyl-TRNA-Synthetase (TARS2)-Related Disorder.” Genetics in Medicine, vol. 25, no. 11, 100938, Elsevier, 2023, doi:10.1016/j.gim.2023.100938. short: A. Accogli, S.-J. Lin, M. Severino, S.-H. Kim, K. Huang, C. Rocca, M. Landsverk, M.S. Zaki, A. Al-Maawali, V.M. Srinivasan, K. Al-Thihli, G.B. Schaefer, M. Davis, D. Tonduti, C. Doneda, L.M. Marten, C. Mühlhausen, M. Gomez, E. Lamantea, R. Mena, M. Nizon, V. Procaccio, A. Begtrup, A. Telegrafi, H. Cui, H.L. Schulz, J. Mohr, S. Biskup, M.A. Loos, H.V. Aráoz, V. Salpietro, L.D. Keppen, M. Chitre, C. Petree, L. Raymond, J. Vogt, L.B. Sawyer, A.A. Basinger, S.V. Pedersen, T.S. Pearson, D.K. Grange, L. Lingappa, P. McDunnah, R. Horvath, B. Cognè, B. Isidor, A. Hahn, K.W. Gripp, S.M. Jafarnejad, E. Østergaard, C.E. Prada, D. Ghezzi, V.K. Gowda, R.W. Taylor, N. Sonenberg, H. Houlden, M. Sissler, G.K. Varshney, R. Maroofian, Genetics in Medicine 25 (2023). date_created: 2023-09-25T08:44:29Z date_published: 2023-11-01T00:00:00Z date_updated: 2023-09-25T08:50:10Z day: '01' ddc: - '570' doi: 10.1016/j.gim.2023.100938 extern: '1' file: - access_level: open_access checksum: 440f0cd8a2ffcbe03c015c1746728387 content_type: application/pdf creator: dernst date_created: 2023-09-25T08:48:54Z date_updated: 2023-09-25T08:48:54Z file_id: '14369' file_name: 2023_GeneticsMedicine_Accogli.pdf file_size: 4105513 relation: main_file success: 1 file_date_updated: 2023-09-25T08:48:54Z has_accepted_license: '1' intvolume: ' 25' issue: '11' keyword: - Genetics (clinical) language: - iso: eng license: https://creativecommons.org/licenses/by/4.0/ month: '11' oa: 1 oa_version: Published Version publication: Genetics in Medicine publication_identifier: issn: - 1098-3600 publication_status: published publisher: Elsevier quality_controlled: '1' scopus_import: '1' status: public title: Clinical, neuroradiological, and molecular characterization of mitochondrial threonyl-tRNA-synthetase (TARS2)-related disorder tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 25 year: '2023' ... --- _id: '13120' abstract: - lang: eng text: 'We formalized general (i.e., type-0) grammars using the Lean 3 proof assistant. We defined basic notions of rewrite rules and of words derived by a grammar, and used grammars to show closure of the class of type-0 languages under four operations: union, reversal, concatenation, and the Kleene star. The literature mostly focuses on Turing machine arguments, which are possibly more difficult to formalize. For the Kleene star, we could not follow the literature and came up with our own grammar-based construction.' acknowledgement: "Jasmin Blanchette: This research has received funding from the Netherlands Organization\r\nfor Scientific Research (NWO) under the Vidi program (project No. 016.Vidi.189.037, Lean Forward).\r\n__\r\nWe thank Vladimir Kolmogorov for making this collaboration possible. We\r\nthank Václav Končický for discussing ideas about the Kleene star construction. We thank Patrick Johnson, Floris van Doorn, and Damiano Testa for their small yet very valuable contributions to our code. We thank Eric Wieser for simplifying one of our proofs. We thank Mark Summerfield for suggesting textual improvements. We thank the anonymous reviewers for very helpful comments. Finally, we thank the Lean community for helping us with various technical issues and answering many questions. " alternative_title: - LIPIcs article_number: '15' article_processing_charge: No author: - first_name: Martin full_name: Dvorak, Martin id: 40ED02A8-C8B4-11E9-A9C0-453BE6697425 last_name: Dvorak orcid: 0000-0001-5293-214X - first_name: Jasmin full_name: Blanchette, Jasmin last_name: Blanchette citation: ama: 'Dvorak M, Blanchette J. Closure properties of general grammars - formally verified. In: 14th International Conference on Interactive Theorem Proving. Vol 268. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2023. doi:10.4230/LIPIcs.ITP.2023.15' apa: 'Dvorak, M., & Blanchette, J. (2023). Closure properties of general grammars - formally verified. In 14th International Conference on Interactive Theorem Proving (Vol. 268). Bialystok, Poland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ITP.2023.15' chicago: Dvorak, Martin, and Jasmin Blanchette. “Closure Properties of General Grammars - Formally Verified.” In 14th International Conference on Interactive Theorem Proving, Vol. 268. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. https://doi.org/10.4230/LIPIcs.ITP.2023.15. ieee: M. Dvorak and J. Blanchette, “Closure properties of general grammars - formally verified,” in 14th International Conference on Interactive Theorem Proving, Bialystok, Poland, 2023, vol. 268. ista: 'Dvorak M, Blanchette J. 2023. Closure properties of general grammars - formally verified. 14th International Conference on Interactive Theorem Proving. ITP: International Conference on Interactive Theorem Proving, LIPIcs, vol. 268, 15.' mla: Dvorak, Martin, and Jasmin Blanchette. “Closure Properties of General Grammars - Formally Verified.” 14th International Conference on Interactive Theorem Proving, vol. 268, 15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023, doi:10.4230/LIPIcs.ITP.2023.15. short: M. Dvorak, J. Blanchette, in:, 14th International Conference on Interactive Theorem Proving, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. conference: end_date: 2023-08-04 location: Bialystok, Poland name: 'ITP: International Conference on Interactive Theorem Proving' start_date: 2023-07-31 date_created: 2023-06-05T07:29:05Z date_published: 2023-07-27T00:00:00Z date_updated: 2023-09-25T11:04:29Z day: '27' ddc: - '000' department: - _id: GradSch - _id: VlKo doi: 10.4230/LIPIcs.ITP.2023.15 external_id: arxiv: - '2302.06420' file: - access_level: open_access checksum: 773a0197f05b67feaa6cb1e17ec3642d content_type: application/pdf creator: dernst date_created: 2023-08-07T11:55:43Z date_updated: 2023-08-07T11:55:43Z file_id: '13982' file_name: 2023_LIPIcS_Dvorak.pdf file_size: 715976 relation: main_file success: 1 file_date_updated: 2023-08-07T11:55:43Z has_accepted_license: '1' intvolume: ' 268' language: - iso: eng month: '07' oa: 1 oa_version: Published Version publication: 14th International Conference on Interactive Theorem Proving publication_identifier: eissn: - 1868-8969 isbn: - '9783959772846' publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik quality_controlled: '1' related_material: link: - relation: software url: https://github.com/madvorak/grammars/tree/publish scopus_import: '1' status: public title: Closure properties of general grammars - formally verified tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 268 year: '2023' ... --- _id: '13969' abstract: - lang: eng text: "Bundling crossings is a strategy which can enhance the readability\r\nof graph drawings. In this paper we consider good drawings, i.e., we require that\r\nany two edges have at most one common point which can be a common vertex or a\r\ncrossing. Our main result is that there is a polynomial-time algorithm to compute an\r\n8-approximation of the bundled crossing number of a good drawing with no toothed\r\nhole. In general the number of toothed holes has to be added to the 8-approximation.\r\nIn the special case of circular drawings the approximation factor is 8, this improves\r\nupon the 10-approximation of Fink et al. [14]. Our approach also works with the same\r\napproximation factor for families of pseudosegments, i.e., curves intersecting at most\r\nonce. We also show how to compute a 9/2-approximation when the intersection graph of\r\nthe pseudosegments is bipartite and has no toothed hole." acknowledgement: This work was initiated during the Workshop on Geometric Graphs in November 2019 in Strobl, Austria. We would like to thank Oswin Aichholzer, Fabian Klute, Man-Kwun Chiu, Martin Balko, Pavel Valtr for their avid discussions during the workshop. The first author has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Sk lodowska-Curie grant agreement No 754411. The second author has been supported by the German Research Foundation DFG Project FE 340/12-1. An extended abstract of this paper has been published in the proceedings of WALCOM 2022 in the Springer LNCS series, vol. 13174, pages 383–395. article_processing_charge: Yes article_type: original author: - first_name: Alan M full_name: Arroyo Guevara, Alan M id: 3207FDC6-F248-11E8-B48F-1D18A9856A87 last_name: Arroyo Guevara orcid: 0000-0003-2401-8670 - first_name: Stefan full_name: Felsner, Stefan last_name: Felsner citation: ama: Arroyo Guevara AM, Felsner S. Approximating the bundled crossing number. Journal of Graph Algorithms and Applications. 2023;27(6):433-457. doi:10.7155/jgaa.00629 apa: Arroyo Guevara, A. M., & Felsner, S. (2023). Approximating the bundled crossing number. Journal of Graph Algorithms and Applications. Brown University. https://doi.org/10.7155/jgaa.00629 chicago: Arroyo Guevara, Alan M, and Stefan Felsner. “Approximating the Bundled Crossing Number.” Journal of Graph Algorithms and Applications. Brown University, 2023. https://doi.org/10.7155/jgaa.00629. ieee: A. M. Arroyo Guevara and S. Felsner, “Approximating the bundled crossing number,” Journal of Graph Algorithms and Applications, vol. 27, no. 6. Brown University, pp. 433–457, 2023. ista: Arroyo Guevara AM, Felsner S. 2023. Approximating the bundled crossing number. Journal of Graph Algorithms and Applications. 27(6), 433–457. mla: Arroyo Guevara, Alan M., and Stefan Felsner. “Approximating the Bundled Crossing Number.” Journal of Graph Algorithms and Applications, vol. 27, no. 6, Brown University, 2023, pp. 433–57, doi:10.7155/jgaa.00629. short: A.M. Arroyo Guevara, S. Felsner, Journal of Graph Algorithms and Applications 27 (2023) 433–457. date_created: 2023-08-06T22:01:11Z date_published: 2023-07-01T00:00:00Z date_updated: 2023-09-25T10:56:10Z day: '01' ddc: - '510' department: - _id: UlWa doi: 10.7155/jgaa.00629 ec_funded: 1 external_id: arxiv: - '2109.14892' file: - access_level: open_access checksum: 9c30d2b8e324cc1c904f2aeec92013a3 content_type: application/pdf creator: dernst date_created: 2023-08-07T08:00:48Z date_updated: 2023-08-07T08:00:48Z file_id: '13979' file_name: 2023_JourGraphAlgorithms_Arroyo.pdf file_size: 865774 relation: main_file success: 1 file_date_updated: 2023-08-07T08:00:48Z has_accepted_license: '1' intvolume: ' 27' issue: '6' language: - iso: eng month: '07' oa: 1 oa_version: Published Version page: 433-457 project: - _id: 260C2330-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '754411' name: ISTplus - Postdoctoral Fellowships publication: Journal of Graph Algorithms and Applications publication_identifier: issn: - 1526-1719 publication_status: published publisher: Brown University quality_controlled: '1' related_material: record: - id: '11185' relation: earlier_version status: public scopus_import: '1' status: public title: Approximating the bundled crossing number tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 27 year: '2023' ... --- _id: '14344' abstract: - lang: eng text: We study the Hamilton cycle problem with input a random graph G ~ G(n,p) in two different settings. In the first one, G is given to us in the form of randomly ordered adjacency lists while in the second one, we are given the adjacency matrix of G. In each of the two settings we derive a deterministic algorithm that w.h.p. either finds a Hamilton cycle or returns a certificate that such a cycle does not exist for p = p(n) ≥ 0. The running times of our algorithms are O(n) and respectively, each being best possible in its own setting. article_processing_charge: No author: - first_name: Michael full_name: Anastos, Michael id: 0b2a4358-bb35-11ec-b7b9-e3279b593dbb last_name: Anastos citation: ama: 'Anastos M. Fast algorithms for solving the Hamilton cycle problem with high probability. In: Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. Vol 2023. Society for Industrial and Applied Mathematics; 2023:2286-2323. doi:10.1137/1.9781611977554.ch88' apa: 'Anastos, M. (2023). Fast algorithms for solving the Hamilton cycle problem with high probability. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (Vol. 2023, pp. 2286–2323). Florence, Italy: Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611977554.ch88' chicago: Anastos, Michael. “Fast Algorithms for Solving the Hamilton Cycle Problem with High Probability.” In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, 2023:2286–2323. Society for Industrial and Applied Mathematics, 2023. https://doi.org/10.1137/1.9781611977554.ch88. ieee: M. Anastos, “Fast algorithms for solving the Hamilton cycle problem with high probability,” in Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, Florence, Italy, 2023, vol. 2023, pp. 2286–2323. ista: 'Anastos M. 2023. Fast algorithms for solving the Hamilton cycle problem with high probability. Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms vol. 2023, 2286–2323.' mla: Anastos, Michael. “Fast Algorithms for Solving the Hamilton Cycle Problem with High Probability.” Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, vol. 2023, Society for Industrial and Applied Mathematics, 2023, pp. 2286–323, doi:10.1137/1.9781611977554.ch88. short: M. Anastos, in:, Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2023, pp. 2286–2323. conference: end_date: 2023-01-25 location: Florence, Italy name: 'SODA: Symposium on Discrete Algorithms' start_date: 2023-01-22 date_created: 2023-09-17T22:01:10Z date_published: 2023-01-01T00:00:00Z date_updated: 2023-09-25T09:13:41Z day: '01' department: - _id: MaKw doi: 10.1137/1.9781611977554.ch88 external_id: arxiv: - '2111.14759' intvolume: ' 2023' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.48550/arXiv.2111.14759 month: '01' oa: 1 oa_version: Preprint page: 2286-2323 publication: Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms publication_identifier: isbn: - '9781611977554' publication_status: published publisher: Society for Industrial and Applied Mathematics quality_controlled: '1' scopus_import: '1' status: public title: Fast algorithms for solving the Hamilton cycle problem with high probability type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 2023 year: '2023' ...