ebook img

SOFSEM 2023: Theory and Practice of Computer Science: 48th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2023 Nový Smokovec, Slovakia, January 15–18, 2023 Proceedings PDF

401 Pages·2023·11.721 MB·English
Save to my drive
Quick download
Download
Most books are stored in the elastic cloud where traffic is expensive. For this reason, we have a limit on daily download.

Preview SOFSEM 2023: Theory and Practice of Computer Science: 48th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2023 Nový Smokovec, Slovakia, January 15–18, 2023 Proceedings

Leszek Gąsieniec (Ed.) S S o C R A SOFSEM 2023: 8 7 8 Theory and Practice 3 1 S C of Computer Science N L 48th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2023 Nový Smokovec, Slovakia, January 15–18, 2023, Proceedings Lecture Notes in Computer Science 13878 Founding Editors Gerhard Goos, Germany Juris Hartmanis, USA Editorial Board Members Elisa Bertino, USA Bernhard Steffen , Germany Wen Gao, China Moti Yung , USA Advanced Research in Computing and Software Science Subline of Lecture Notes in Computer Science Subline Series Editors Giorgio Ausiello, University of Rome ‘La Sapienza’, Italy Vladimiro Sassone, University of Southampton, UK Subline Advisory Board Susanne Albers, TU Munich, Germany Benjamin C. Pierce, University of Pennsylvania, USA Bernhard Steffen , University of Dortmund, Germany Deng Xiaotie, Peking University, Beijing, China Jeannette M. Wing, Microsoft Research, Redmond, WA, USA More information about this series at https://link.springer.com/bookseries/558 ą Leszek G sieniec (Ed.) SOFSEM 2023: Theory and Practice of Computer Science 48th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2023 ý – Nov Smokovec, Slovakia, January 15 18, 2023 Proceedings 123 Editor Leszek Gąsieniec University of Liverpool Liverpool, UK ISSN 0302-9743 ISSN 1611-3349 (electronic) Lecture Notesin Computer Science ISBN 978-3-031-23100-1 ISBN978-3-031-23101-8 (eBook) https://doi.org/10.1007/978-3-031-23101-8 ©TheEditor(s)(ifapplicable)andTheAuthor(s),underexclusivelicense toSpringerNatureSwitzerlandAG2023 Thisworkissubjecttocopyright.AllrightsarereservedbythePublisher,whetherthewholeorpartofthe material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation, broadcasting, reproduction on microfilms or in any other physical way, and transmission or information storageandretrieval,electronicadaptation,computersoftware,orbysimilarordissimilarmethodologynow knownorhereafterdeveloped. Theuseofgeneraldescriptivenames,registerednames,trademarks,servicemarks,etc.inthispublication doesnotimply,evenintheabsenceofaspecificstatement,thatsuchnamesareexemptfromtherelevant protectivelawsandregulationsandthereforefreeforgeneraluse. Thepublisher,theauthors,andtheeditorsaresafetoassumethattheadviceandinformationinthisbookare believedtobetrueandaccurateatthedateofpublication.Neitherthepublishernortheauthorsortheeditors give a warranty, expressed or implied, with respect to the material contained herein or for any errors or omissionsthatmayhavebeenmade.Thepublisherremainsneutralwithregardtojurisdictionalclaimsin publishedmapsandinstitutionalaffiliations. ThisSpringerimprintispublishedbytheregisteredcompanySpringerNatureSwitzerlandAG Theregisteredcompanyaddressis:Gewerbestrasse11,6330Cham,Switzerland Preface This volume contains the papers selected for presentation at SOFSEM 2023, the 48th International Conference on Current Trends in Theory and Practice of Computer Science, which was held during January 15–18, 2023, in Nový Smokovec, Slovakia. SOFSEM (originally the SOFtware SEMinar) is an annual international winter con- ferencedevotedtothetheoryandpracticeofcomputerscience.Itsaimistopresentthe latest developments inresearch for professionalsfrom academia and industry working in leading areas of computer science. While being a well-established and fully inter- national conference, SOFSEM also maintains the best of its original Winter School aspects,suchasahighnumberofinvitedtalks,in-depthcoverageofselectedresearch areas, and ample opportunity to discuss and exchange new ideas. The series of SOFSEM conferences was interrupted in 2022 due to the COVID-19 pandemic, but SOFSEMwasheldagainthisyear, inscenicNovýSmokovecintheTatra Mountains, Slovakia. The renewed scope and format of SOFSEM is focused entirely on the original research and challenges in foundations of computer science including algorithms, AI-basedmethods,computationalcomplexity,andformalmodels.TheSOFSEM2023 Program Committee was formed of 24 international experts supported by 55 external reviewers. Due to the new format and the post-pandemic sentiment in academia the event attracted only 43 full submissions; however, these were of high quality. The conferenceprogramconsistedof26papers,whereeachacceptedpaperwentthrougha thorough selection process supported by at least three external reviews. All reviews were single blind. TheSOFSEM2023ProgramCommitteedecidedtosplittheprizefortheBestPaper Award between two papers: “Balanced Substructures in Bicolored Graphs,” by P. S. Ardra, R. Krithika, S. Saurabh, and R. Sharma and “On the Complexity of Scheduling Problems With a Fixed Number of Parallel Identical Machines,” by K. KahlerandK.Jansen.Similarly,theBestStudentPaperAwardwassplitbetweentwo papers: “On the 2-Layer Window Width Minimization Problem,” by M. Bekos, H. Förster, M. Kaufmann, S. Kobourov, M. Kryven, A. Kuckuk, and L. Schlipf and “SequentiallySwappingTokens:FurtheronGraphClasses,”byH.Kiya,Y.Okada,H. Ono, and Y. Otachi. I would like to thank the invited speakers for their talks, including Věra Kůrková (Institute of Computer Science of the Czech Academy of Sciences, Czech Republic), “Some implications of high-dimensional geometry for classification by neural net- works”,GerthStøltingBrodal(AarhusUniversity,Denmark),“DataStructureDesign– Theory and Practice”, and Sławomir Lasota (Uniwersytet Warszawski, Poland), “Ackermannian lower bound for the reachability problem of Petri nets”. Many thanks gototheSOFSEM2023ProgramCommitteemembers,theexternalreviewers,andthe vi Preface creators of EasyChair system. Special thanks go to the SOFSEM Steering Committee members Július Štuller and Jan van Leeuwen for their advice and support throughout the whole conference cycle. January 2023 Leszek Gąsieniec Organization General Chair Peter Gurský Pavol Jozef Šafárik University in Košice, Slovakia Program Committee Amihood Amir Bar-Ilan University, Israel, and Georgia Tech, USA Michael Blondin Université de Sherbrooke, Canada Marek Chrobak University of California, Riverside, USA Paola Flocchini University of Ottawa, Canada Anna Gambin Uniwersytet Warszawski, Poland Robert Ganian Vienna University of Technology, Austria Leszek Gąsieniec (Chair) University of Liverpool, UK Davide Grossi University of Groningen, Netherlands Christoph Haase University of Oxford, UK Cezary Kaliszyk University of Innsbruck, Austria Ralf Klasing CNRS and University of Bordeaux, France Rastislav Královič Comenius University in Bratislava, Slovakia Giuseppe Liotta University of Perugia, Italy Paweł Parys University of Warsaw, Poland Vangelis Paschos LAMSADE, Paris Dauphine University, France Daniel Paulusma Durham University, UK Tomasz Radzik King’s College London, UK David Sarne Bar-Ilan University, Israel Christian Scheideler University of Paderborn, Germany Paweł Sobociński Tallinn University of Technology, Estonia Paul Spirakis University of Liverpool, UK Grzegorz Stachowiak University of Wrocław, Poland Sebastian Wild University of Liverpool, UK Qin Xin University of the Faroe Islands, Faroe Islands Steering Committee Barbara Catania University of Genoa, Italy Mirosław Kutyłowski Wrocław University of Technology, Poland Tiziana Margaria-Steffen University of Limerick, Ireland Branislav Rovan Comenius University in Bratislava, Slovakia Petr Šaloun Technical University of Ostrava, Czech Republic Július Štuller (Chair) Czech Academy of Sciences, Czech Republic Jan van Leeuwen Utrecht University, The Netherlands viii Organization Additional Reviewers Barloy, Corentin Kozłowski, Łukasz Paweł Boneh, Itai Kurpicz, Florian Bose, Prosenjit Kutner, David Brakensiek, Joshua Lubiw, Anna Calamoneri, Tiziana Marcus, Shoshana Chakraborty, Dibyayan Montecchiani, Fabrizio Chrzaszcz, Jacek Niemiro, Wojciech Chung, Neo Christopher Niemyska, Wanda Czerwiński, Wojciech Ochem, Pascal Daming, Zhu Ordyniak, Sebastian Deligkas, Argyrios Ortali, Giacomo Di Lavore, Elena Pajak, Dominik Dojer, Norbert Pardubska, Dana Earnshaw, Matthew Paszek, Jarosław Eiben, Eduard Patro, Subhasree Erlebach, Thomas Polesiuk, Piotr Fischer, Johannes Przybylski, Bartłomiej Fleischmann, Pamela Raptopoulos, Christoforos Foucaud, Florent Raskin, Mikhail Fox, Kyle Roditty, Liam Grüttemeier, Niels Román, Mario Gupta, Siddharth Rzążewski, Paweł Hermelin, Danny Shabtay, Dvir Itzhaki, Michael Skretas, George Kindermann, Philipp Tappini, Alessandra Klobas, Nina Walen, Tomasz Kobayashi, Yasuaki Wasa, Kunihiro Korchemna, Viktoriia Contents Graphs Problems and Optimisation The Complexity of Finding Tangles . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 Oksana Firman, Philipp Kindermann, Boris Klemz, Alexander Ravsky, Alexander Wolff, and Johannes Zink A Spectral Algorithm for Finding Maximum Cliques in Dense Random Intersection Graphs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 18 Filippos Christodoulou, Sotiris Nikoletseas, Christoforos Raptopoulos, and Paul G. Spirakis Solving Cut-Problems in Quadratic Time for Graphs with Bounded Treewidth. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 33 Hauke Brinkop and Klaus Jansen More Effort Towards Multiagent Knapsack . . . . . . . . . . . . . . . . . . . . . . . . 47 Sushmita Gupta, Pallavi Jain, and Sanjay Seetharaman Graph Drawing and Visualization Dominance Drawings for DAGs with Bounded Modular Width . . . . . . . . . . 65 Giacomo Ortali and Ioannis G. Tollis Morphing Planar Graph Drawings Through 3D. . . . . . . . . . . . . . . . . . . . . . 80 Kevin Buchin, Will Evans, Fabrizio Frati, Irina Kostitsyna, Maarten Löffler, Tim Ophelders, and Alexander Wolff Visualizing Multispecies Coalescent Trees: Drawing Gene Trees Inside Species Trees. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 96 JonathanKlawitter,FelixKlesen,MoritzNiederer,andAlexanderWolff Parameterized Approaches to Orthogonal Compaction. . . . . . . . . . . . . . . . . 111 WalterDidimo,SiddharthGupta,PhilippKindermann,GiuseppeLiotta, Alexander Wolff, and Meirav Zehavi NP-Hardness and Fixed Parameter Tractability Hardness of Bounding Influence via Graph Modification. . . . . . . . . . . . . . . 129 Robert D. Barish and Tetsuo Shibuya Heuristics for Opinion Diffusion via Local Elections. . . . . . . . . . . . . . . . . . 144 Rica Gonen, Martin Koutecký, Roei Menashof, and Nimrod Talmon

See more

The list of books you might like

Most books are stored in the elastic cloud where traffic is expensive. For this reason, we have a limit on daily download.