19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 294, pp. 1-686, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@Proceedings{bodlaender:LIPIcs.SWAT.2024, title = {{LIPIcs, Volume 294, SWAT 2024, Complete Volume}}, booktitle = {19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024)}, pages = {1--686}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-318-8}, ISSN = {1868-8969}, year = {2024}, volume = {294}, editor = {Bodlaender, Hans L.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2024}, URN = {urn:nbn:de:0030-drops-200397}, doi = {10.4230/LIPIcs.SWAT.2024}, annote = {Keywords: LIPIcs, Volume 294, SWAT 2024, Complete Volume} }
19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 294, pp. 0:i-0:xvi, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{bodlaender:LIPIcs.SWAT.2024.0, author = {Bodlaender, Hans L.}, title = {{Front Matter, Table of Contents, Preface, Conference Organization}}, booktitle = {19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024)}, pages = {0:i--0:xvi}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-318-8}, ISSN = {1868-8969}, year = {2024}, volume = {294}, editor = {Bodlaender, Hans L.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2024.0}, URN = {urn:nbn:de:0030-drops-200400}, doi = {10.4230/LIPIcs.SWAT.2024.0}, annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization} }
Akanksha Agrawal, Sergio Cabello, Michael Kaufmann, Saket Saurabh, Roohani Sharma, Yushi Uno, and Alexander Wolff. Eliminating Crossings in Ordered Graphs. In 19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 294, pp. 1:1-1:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{agrawal_et_al:LIPIcs.SWAT.2024.1, author = {Agrawal, Akanksha and Cabello, Sergio and Kaufmann, Michael and Saurabh, Saket and Sharma, Roohani and Uno, Yushi and Wolff, Alexander}, title = {{Eliminating Crossings in Ordered Graphs}}, booktitle = {19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024)}, pages = {1:1--1:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-318-8}, ISSN = {1868-8969}, year = {2024}, volume = {294}, editor = {Bodlaender, Hans L.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2024.1}, URN = {urn:nbn:de:0030-drops-200417}, doi = {10.4230/LIPIcs.SWAT.2024.1}, annote = {Keywords: Ordered graphs, book embedding, edge deletion, d-planar, hitting set} }
Stav Ashur and Sariel Har-Peled. Local Spanners Revisited. In 19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 294, pp. 2:1-2:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{ashur_et_al:LIPIcs.SWAT.2024.2, author = {Ashur, Stav and Har-Peled, Sariel}, title = {{Local Spanners Revisited}}, booktitle = {19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024)}, pages = {2:1--2:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-318-8}, ISSN = {1868-8969}, year = {2024}, volume = {294}, editor = {Bodlaender, Hans L.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2024.2}, URN = {urn:nbn:de:0030-drops-200420}, doi = {10.4230/LIPIcs.SWAT.2024.2}, annote = {Keywords: Geometric graphs, Fault-tolerant spanners} }
Lora Bailey, Heather Smith Blake, Garner Cochran, Nathan Fox, Michael Levet, Reem Mahmoud, Inne Singgih, Grace Stadnyk, and Alexander Wiedemann. Pairwise Rearrangement is Fixed-Parameter Tractable in the Single Cut-and-Join Model. In 19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 294, pp. 3:1-3:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{bailey_et_al:LIPIcs.SWAT.2024.3, author = {Bailey, Lora and Blake, Heather Smith and Cochran, Garner and Fox, Nathan and Levet, Michael and Mahmoud, Reem and Singgih, Inne and Stadnyk, Grace and Wiedemann, Alexander}, title = {{Pairwise Rearrangement is Fixed-Parameter Tractable in the Single Cut-and-Join Model}}, booktitle = {19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024)}, pages = {3:1--3:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-318-8}, ISSN = {1868-8969}, year = {2024}, volume = {294}, editor = {Bodlaender, Hans L.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2024.3}, URN = {urn:nbn:de:0030-drops-200436}, doi = {10.4230/LIPIcs.SWAT.2024.3}, annote = {Keywords: Genome Rearrangement, Phylogenetics, Single Cut-and-Join, Computational Complexity} }
Girish Balakrishnan, Sankardeep Chakraborty, N. S. Narayanaswamy, and Kunihiko Sadakane. Succinct Data Structure for Chordal Graphs with Bounded Vertex Leafage. In 19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 294, pp. 4:1-4:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{balakrishnan_et_al:LIPIcs.SWAT.2024.4, author = {Balakrishnan, Girish and Chakraborty, Sankardeep and Narayanaswamy, N. S. and Sadakane, Kunihiko}, title = {{Succinct Data Structure for Chordal Graphs with Bounded Vertex Leafage}}, booktitle = {19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024)}, pages = {4:1--4:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-318-8}, ISSN = {1868-8969}, year = {2024}, volume = {294}, editor = {Bodlaender, Hans L.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2024.4}, URN = {urn:nbn:de:0030-drops-200446}, doi = {10.4230/LIPIcs.SWAT.2024.4}, annote = {Keywords: succinct data structure, chordal graphs, leafage, vertex leafage, path graphs} }
Robert D. Barish and Tetsuo Shibuya. Recognition and Proper Coloring of Unit Segment Intersection Graphs. In 19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 294, pp. 5:1-5:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{barish_et_al:LIPIcs.SWAT.2024.5, author = {Barish, Robert D. and Shibuya, Tetsuo}, title = {{Recognition and Proper Coloring of Unit Segment Intersection Graphs}}, booktitle = {19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024)}, pages = {5:1--5:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-318-8}, ISSN = {1868-8969}, year = {2024}, volume = {294}, editor = {Bodlaender, Hans L.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2024.5}, URN = {urn:nbn:de:0030-drops-200452}, doi = {10.4230/LIPIcs.SWAT.2024.5}, annote = {Keywords: graph class recognition, proper coloring, geometric intersection graph, segment intersection graph, fine-grained complexity, Exponential Time Hypothesis} }
Cristina Bazgan, André Nichterlein, and Sofia Vazquez Alferez. Destroying Densest Subgraphs Is Hard. In 19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 294, pp. 6:1-6:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{bazgan_et_al:LIPIcs.SWAT.2024.6, author = {Bazgan, Cristina and Nichterlein, Andr\'{e} and Vazquez Alferez, Sofia}, title = {{Destroying Densest Subgraphs Is Hard}}, booktitle = {19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024)}, pages = {6:1--6:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-318-8}, ISSN = {1868-8969}, year = {2024}, volume = {294}, editor = {Bodlaender, Hans L.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2024.6}, URN = {urn:nbn:de:0030-drops-200461}, doi = {10.4230/LIPIcs.SWAT.2024.6}, annote = {Keywords: Graph modification problems, NP-hardness, fixed-parameter tractability, W-hardness, special graph classes} }
Jesse Beisegel, Nina Chiarelli, Ekkehard Köhler, Martin Milanič, Peter Muršič, and Robert Scheffler. The Simultaneous Interval Number: A New Width Parameter that Measures the Similarity to Interval Graphs. In 19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 294, pp. 7:1-7:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{beisegel_et_al:LIPIcs.SWAT.2024.7, author = {Beisegel, Jesse and Chiarelli, Nina and K\"{o}hler, Ekkehard and Milani\v{c}, Martin and Mur\v{s}i\v{c}, Peter and Scheffler, Robert}, title = {{The Simultaneous Interval Number: A New Width Parameter that Measures the Similarity to Interval Graphs}}, booktitle = {19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024)}, pages = {7:1--7:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-318-8}, ISSN = {1868-8969}, year = {2024}, volume = {294}, editor = {Bodlaender, Hans L.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2024.7}, URN = {urn:nbn:de:0030-drops-200470}, doi = {10.4230/LIPIcs.SWAT.2024.7}, annote = {Keywords: Interval graph, simultaneous representation, width parameter, algorithm, parameterized complexity} }
Matthias Bentert, Alex Crane, Pål Grønås Drange, Felix Reidl, and Blair D. Sullivan. Correlation Clustering with Vertex Splitting. In 19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 294, pp. 8:1-8:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{bentert_et_al:LIPIcs.SWAT.2024.8, author = {Bentert, Matthias and Crane, Alex and Drange, P\r{a}l Gr{\o}n\r{a}s and Reidl, Felix and Sullivan, Blair D.}, title = {{Correlation Clustering with Vertex Splitting}}, booktitle = {19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024)}, pages = {8:1--8:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-318-8}, ISSN = {1868-8969}, year = {2024}, volume = {294}, editor = {Bodlaender, Hans L.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2024.8}, URN = {urn:nbn:de:0030-drops-200483}, doi = {10.4230/LIPIcs.SWAT.2024.8}, annote = {Keywords: graph modification, cluster editing, overlapping clustering, approximation, parameterized complexity} }
Ioana O. Bercea, Jakob Bæk Tejs Houen, and Rasmus Pagh. Daisy Bloom Filters. In 19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 294, pp. 9:1-9:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{bercea_et_al:LIPIcs.SWAT.2024.9, author = {Bercea, Ioana O. and Houen, Jakob B{\ae}k Tejs and Pagh, Rasmus}, title = {{Daisy Bloom Filters}}, booktitle = {19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024)}, pages = {9:1--9:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-318-8}, ISSN = {1868-8969}, year = {2024}, volume = {294}, editor = {Bodlaender, Hans L.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2024.9}, URN = {urn:nbn:de:0030-drops-200491}, doi = {10.4230/LIPIcs.SWAT.2024.9}, annote = {Keywords: Bloom filters, input distribution, learned data structures} }
Magnus Berg and Shahin Kamali. Online Bin Covering with Frequency Predictions. In 19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 294, pp. 10:1-10:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{berg_et_al:LIPIcs.SWAT.2024.10, author = {Berg, Magnus and Kamali, Shahin}, title = {{Online Bin Covering with Frequency Predictions}}, booktitle = {19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024)}, pages = {10:1--10:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-318-8}, ISSN = {1868-8969}, year = {2024}, volume = {294}, editor = {Bodlaender, Hans L.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2024.10}, URN = {urn:nbn:de:0030-drops-200504}, doi = {10.4230/LIPIcs.SWAT.2024.10}, annote = {Keywords: Bin Covering, Online Algorithms with Predictions, PAC Learning, Learning-Augmented Algorithms} }
Gaétan Berthe, Marin Bougeret, Daniel Gonçalves, and Jean-Florent Raymond. Subexponential Algorithms in Geometric Graphs via the Subquadratic Grid Minor Property: The Role of Local Radius. In 19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 294, pp. 11:1-11:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{berthe_et_al:LIPIcs.SWAT.2024.11, author = {Berthe, Ga\'{e}tan and Bougeret, Marin and Gon\c{c}alves, Daniel and Raymond, Jean-Florent}, title = {{Subexponential Algorithms in Geometric Graphs via the Subquadratic Grid Minor Property: The Role of Local Radius}}, booktitle = {19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024)}, pages = {11:1--11:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-318-8}, ISSN = {1868-8969}, year = {2024}, volume = {294}, editor = {Bodlaender, Hans L.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2024.11}, URN = {urn:nbn:de:0030-drops-200519}, doi = {10.4230/LIPIcs.SWAT.2024.11}, annote = {Keywords: geometric intersection graphs, subexponential FPT algorithms, cycle-hitting problems, bidimensionality} }
Sayan Bhattacharya, Martín Costa, Nadav Panski, and Shay Solomon. Arboricity-Dependent Algorithms for Edge Coloring. In 19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 294, pp. 12:1-12:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{bhattacharya_et_al:LIPIcs.SWAT.2024.12, author = {Bhattacharya, Sayan and Costa, Mart{\'\i}n and Panski, Nadav and Solomon, Shay}, title = {{Arboricity-Dependent Algorithms for Edge Coloring}}, booktitle = {19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024)}, pages = {12:1--12:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-318-8}, ISSN = {1868-8969}, year = {2024}, volume = {294}, editor = {Bodlaender, Hans L.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2024.12}, URN = {urn:nbn:de:0030-drops-200524}, doi = {10.4230/LIPIcs.SWAT.2024.12}, annote = {Keywords: Dynamic Algorithms, Graph Algorithms, Edge Coloring, Arboricity} }
Therese Biedl, Prosenjit Bose, and Babak Miraftab. On the Independence Number of 1-Planar Graphs. In 19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 294, pp. 13:1-13:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{biedl_et_al:LIPIcs.SWAT.2024.13, author = {Biedl, Therese and Bose, Prosenjit and Miraftab, Babak}, title = {{On the Independence Number of 1-Planar Graphs}}, booktitle = {19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024)}, pages = {13:1--13:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-318-8}, ISSN = {1868-8969}, year = {2024}, volume = {294}, editor = {Bodlaender, Hans L.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2024.13}, URN = {urn:nbn:de:0030-drops-200537}, doi = {10.4230/LIPIcs.SWAT.2024.13}, annote = {Keywords: 1-planar graph, independent set, minimum degree} }
Philip Bille, Yakov Nekrich, and Solon P. Pissis. Size-Constrained Weighted Ancestors with Applications. In 19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 294, pp. 14:1-14:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{bille_et_al:LIPIcs.SWAT.2024.14, author = {Bille, Philip and Nekrich, Yakov and Pissis, Solon P.}, title = {{Size-Constrained Weighted Ancestors with Applications}}, booktitle = {19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024)}, pages = {14:1--14:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-318-8}, ISSN = {1868-8969}, year = {2024}, volume = {294}, editor = {Bodlaender, Hans L.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2024.14}, URN = {urn:nbn:de:0030-drops-200544}, doi = {10.4230/LIPIcs.SWAT.2024.14}, annote = {Keywords: weighted ancestors, string indexing, data structures} }
Lotte Blank and Anne Driemel. Range Reporting for Time Series via Rectangle Stabbing. In 19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 294, pp. 15:1-15:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{blank_et_al:LIPIcs.SWAT.2024.15, author = {Blank, Lotte and Driemel, Anne}, title = {{Range Reporting for Time Series via Rectangle Stabbing}}, booktitle = {19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024)}, pages = {15:1--15:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-318-8}, ISSN = {1868-8969}, year = {2024}, volume = {294}, editor = {Bodlaender, Hans L.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2024.15}, URN = {urn:nbn:de:0030-drops-200559}, doi = {10.4230/LIPIcs.SWAT.2024.15}, annote = {Keywords: Data Structures, Fr\'{e}chet distance, Rectangle Stabbing, Orthogonal Range Searching} }
Joan Boyar, Shahin Kamali, Kim S. Larsen, Ali Mohammad Lavasani, Yaqiao Li, and Denis Pankratov. On the Online Weighted Non-Crossing Matching Problem. In 19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 294, pp. 16:1-16:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{boyar_et_al:LIPIcs.SWAT.2024.16, author = {Boyar, Joan and Kamali, Shahin and Larsen, Kim S. and Lavasani, Ali Mohammad and Li, Yaqiao and Pankratov, Denis}, title = {{On the Online Weighted Non-Crossing Matching Problem}}, booktitle = {19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024)}, pages = {16:1--16:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-318-8}, ISSN = {1868-8969}, year = {2024}, volume = {294}, editor = {Bodlaender, Hans L.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2024.16}, URN = {urn:nbn:de:0030-drops-200567}, doi = {10.4230/LIPIcs.SWAT.2024.16}, annote = {Keywords: Online algorithms, weighted matching problem, Euclidean plane, non-crossing constraints, competitive analysis, randomized online algorithms, online algorithms with advice, online algorithms with revoking} }
Gerth Stølting Brodal and Sebastian Wild. Deterministic Cache-Oblivious Funnelselect. In 19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 294, pp. 17:1-17:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{brodal_et_al:LIPIcs.SWAT.2024.17, author = {Brodal, Gerth St{\o}lting and Wild, Sebastian}, title = {{Deterministic Cache-Oblivious Funnelselect}}, booktitle = {19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024)}, pages = {17:1--17:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-318-8}, ISSN = {1868-8969}, year = {2024}, volume = {294}, editor = {Bodlaender, Hans L.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2024.17}, URN = {urn:nbn:de:0030-drops-200576}, doi = {10.4230/LIPIcs.SWAT.2024.17}, annote = {Keywords: Multiple selection, cache-oblivious algorithm, entropy bounds} }
Kevin Buchin, Maike Buchin, Joachim Gudmundsson, Lukas Plätz, Lea Thiel, and Sampson Wong. Dynamic L-Budget Clustering of Curves. In 19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 294, pp. 18:1-18:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{buchin_et_al:LIPIcs.SWAT.2024.18, author = {Buchin, Kevin and Buchin, Maike and Gudmundsson, Joachim and Pl\"{a}tz, Lukas and Thiel, Lea and Wong, Sampson}, title = {{Dynamic L-Budget Clustering of Curves}}, booktitle = {19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024)}, pages = {18:1--18:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-318-8}, ISSN = {1868-8969}, year = {2024}, volume = {294}, editor = {Bodlaender, Hans L.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2024.18}, URN = {urn:nbn:de:0030-drops-200588}, doi = {10.4230/LIPIcs.SWAT.2024.18}, annote = {Keywords: clustering, streaming algorithm, polygonal curves, Fr\'{e}chet distance, storage efficiency, simplification, approximation algorithms} }
Benjamin Merlin Bumpus, Bart M. P. Jansen, and Jaime Venne. Fixed-Parameter Tractable Certified Algorithms for Covering and Dominating in Planar Graphs and Beyond. In 19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 294, pp. 19:1-19:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{bumpus_et_al:LIPIcs.SWAT.2024.19, author = {Bumpus, Benjamin Merlin and Jansen, Bart M. P. and Venne, Jaime}, title = {{Fixed-Parameter Tractable Certified Algorithms for Covering and Dominating in Planar Graphs and Beyond}}, booktitle = {19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024)}, pages = {19:1--19:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-318-8}, ISSN = {1868-8969}, year = {2024}, volume = {294}, editor = {Bodlaender, Hans L.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2024.19}, URN = {urn:nbn:de:0030-drops-200595}, doi = {10.4230/LIPIcs.SWAT.2024.19}, annote = {Keywords: fixed-parameter tractability, certified algorithms} }
Aleksander B. G. Christiansen, Eva Rotenberg, and Juliette Vlieghe. Sparsity-Parameterised Dynamic Edge Colouring. In 19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 294, pp. 20:1-20:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{christiansen_et_al:LIPIcs.SWAT.2024.20, author = {Christiansen, Aleksander B. G. and Rotenberg, Eva and Vlieghe, Juliette}, title = {{Sparsity-Parameterised Dynamic Edge Colouring}}, booktitle = {19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024)}, pages = {20:1--20:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-318-8}, ISSN = {1868-8969}, year = {2024}, volume = {294}, editor = {Bodlaender, Hans L.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2024.20}, URN = {urn:nbn:de:0030-drops-200608}, doi = {10.4230/LIPIcs.SWAT.2024.20}, annote = {Keywords: edge colouring, arboricity, hierarchical partition, dynamic algorithms, amortized analysis} }
Seyed Parsa Darbouy and Zachary Friggstad. Approximating Minimum Sum Coloring with Bundles. In 19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 294, pp. 21:1-21:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{darbouy_et_al:LIPIcs.SWAT.2024.21, author = {Darbouy, Seyed Parsa and Friggstad, Zachary}, title = {{Approximating Minimum Sum Coloring with Bundles}}, booktitle = {19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024)}, pages = {21:1--21:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-318-8}, ISSN = {1868-8969}, year = {2024}, volume = {294}, editor = {Bodlaender, Hans L.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2024.21}, URN = {urn:nbn:de:0030-drops-200611}, doi = {10.4230/LIPIcs.SWAT.2024.21}, annote = {Keywords: Approximation Algorithms, Scheduling, Coloring} }
Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, and Saket Saurabh. Stability in Graphs with Matroid Constraints. In 19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 294, pp. 22:1-22:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{fomin_et_al:LIPIcs.SWAT.2024.22, author = {Fomin, Fedor V. and Golovach, Petr A. and Korhonen, Tuukka and Saurabh, Saket}, title = {{Stability in Graphs with Matroid Constraints}}, booktitle = {19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024)}, pages = {22:1--22:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-318-8}, ISSN = {1868-8969}, year = {2024}, volume = {294}, editor = {Bodlaender, Hans L.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2024.22}, URN = {urn:nbn:de:0030-drops-200629}, doi = {10.4230/LIPIcs.SWAT.2024.22}, annote = {Keywords: frameworks, independent stable sets, parameterized complexity, kernelization} }
Zachary Friggstad and Hao Sun. A Logarithmic Integrality Gap for Generalizations of Quasi-Bipartite Instances of Directed Steiner Tree. In 19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 294, pp. 23:1-23:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{friggstad_et_al:LIPIcs.SWAT.2024.23, author = {Friggstad, Zachary and Sun, Hao}, title = {{A Logarithmic Integrality Gap for Generalizations of Quasi-Bipartite Instances of Directed Steiner Tree}}, booktitle = {19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024)}, pages = {23:1--23:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-318-8}, ISSN = {1868-8969}, year = {2024}, volume = {294}, editor = {Bodlaender, Hans L.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2024.23}, URN = {urn:nbn:de:0030-drops-200638}, doi = {10.4230/LIPIcs.SWAT.2024.23}, annote = {Keywords: Steiner Tree, Approximation Algorithms, Linear Programming} }
Bernd Gärtner, Vishwas Kalani, Meghana M. Reddy, Wouter Meulemans, Bettina Speckmann, and Miloš Stojaković. Optimizing Symbol Visibility Through Displacement. In 19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 294, pp. 24:1-24:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{gartner_et_al:LIPIcs.SWAT.2024.24, author = {G\"{a}rtner, Bernd and Kalani, Vishwas and M. Reddy, Meghana and Meulemans, Wouter and Speckmann, Bettina and Stojakovi\'{c}, Milo\v{s}}, title = {{Optimizing Symbol Visibility Through Displacement}}, booktitle = {19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024)}, pages = {24:1--24:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-318-8}, ISSN = {1868-8969}, year = {2024}, volume = {294}, editor = {Bodlaender, Hans L.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2024.24}, URN = {urn:nbn:de:0030-drops-200643}, doi = {10.4230/LIPIcs.SWAT.2024.24}, annote = {Keywords: symbol placement, visibility, jittering, stacking order} }
Auguste H. Gezalyan, Soo H. Kim, Carlos Lopez, Daniel Skora, Zofia Stefankovic, and David M. Mount. Delaunay Triangulations in the Hilbert Metric. In 19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 294, pp. 25:1-25:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{gezalyan_et_al:LIPIcs.SWAT.2024.25, author = {Gezalyan, Auguste H. and Kim, Soo H. and Lopez, Carlos and Skora, Daniel and Stefankovic, Zofia and Mount, David M.}, title = {{Delaunay Triangulations in the Hilbert Metric}}, booktitle = {19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024)}, pages = {25:1--25:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-318-8}, ISSN = {1868-8969}, year = {2024}, volume = {294}, editor = {Bodlaender, Hans L.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2024.25}, URN = {urn:nbn:de:0030-drops-200657}, doi = {10.4230/LIPIcs.SWAT.2024.25}, annote = {Keywords: Delaunay Triangulations, Hilbert metric, convexity, randomized algorithms} }
Sariel Har-Peled and Eliot W. Robson. No-Dimensional Tverberg Partitions Revisited. In 19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 294, pp. 26:1-26:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{harpeled_et_al:LIPIcs.SWAT.2024.26, author = {Har-Peled, Sariel and Robson, Eliot W.}, title = {{No-Dimensional Tverberg Partitions Revisited}}, booktitle = {19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024)}, pages = {26:1--26:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-318-8}, ISSN = {1868-8969}, year = {2024}, volume = {294}, editor = {Bodlaender, Hans L.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2024.26}, URN = {urn:nbn:de:0030-drops-200664}, doi = {10.4230/LIPIcs.SWAT.2024.26}, annote = {Keywords: Points, partitions, convex hull, high dimension} }
Kien C. Huynh, Joseph S. B. Mitchell, Linh Nguyen, and Valentin Polishchuk. Optimizing Visibility-Based Search in Polygonal Domains. In 19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 294, pp. 27:1-27:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{huynh_et_al:LIPIcs.SWAT.2024.27, author = {Huynh, Kien C. and Mitchell, Joseph S. B. and Nguyen, Linh and Polishchuk, Valentin}, title = {{Optimizing Visibility-Based Search in Polygonal Domains}}, booktitle = {19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024)}, pages = {27:1--27:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-318-8}, ISSN = {1868-8969}, year = {2024}, volume = {294}, editor = {Bodlaender, Hans L.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2024.27}, URN = {urn:nbn:de:0030-drops-200671}, doi = {10.4230/LIPIcs.SWAT.2024.27}, annote = {Keywords: Quota watchman route problem, budgeted watchman route problem, visibility-based search, approximation} }
Bart M. P. Jansen and Ruben F. A. Verhaegh. Search-Space Reduction via Essential Vertices Revisited: Vertex Multicut and Cograph Deletion. In 19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 294, pp. 28:1-28:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{jansen_et_al:LIPIcs.SWAT.2024.28, author = {Jansen, Bart M. P. and Verhaegh, Ruben F. A.}, title = {{Search-Space Reduction via Essential Vertices Revisited: Vertex Multicut and Cograph Deletion}}, booktitle = {19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024)}, pages = {28:1--28:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-318-8}, ISSN = {1868-8969}, year = {2024}, volume = {294}, editor = {Bodlaender, Hans L.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2024.28}, URN = {urn:nbn:de:0030-drops-200683}, doi = {10.4230/LIPIcs.SWAT.2024.28}, annote = {Keywords: fixed-parameter tractability, essential vertices, integrality gap} }
Matthew Johnson, Barnaby Martin, Sukanya Pandey, Daniël Paulusma, Siani Smith, and Erik Jan van Leeuwen. Edge Multiway Cut and Node Multiway Cut Are Hard for Planar Subcubic Graphs. In 19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 294, pp. 29:1-29:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{johnson_et_al:LIPIcs.SWAT.2024.29, author = {Johnson, Matthew and Martin, Barnaby and Pandey, Sukanya and Paulusma, Dani\"{e}l and Smith, Siani and van Leeuwen, Erik Jan}, title = {{Edge Multiway Cut and Node Multiway Cut Are Hard for Planar Subcubic Graphs}}, booktitle = {19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024)}, pages = {29:1--29:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-318-8}, ISSN = {1868-8969}, year = {2024}, volume = {294}, editor = {Bodlaender, Hans L.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2024.29}, URN = {urn:nbn:de:0030-drops-200699}, doi = {10.4230/LIPIcs.SWAT.2024.29}, annote = {Keywords: multiway cut, planar subcubic graph, complexity dichotomy, graph containment} }
Naonori Kakimura and Ildikó Schlotter. Parameterized Complexity of Submodular Minimization Under Uncertainty. In 19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 294, pp. 30:1-30:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{kakimura_et_al:LIPIcs.SWAT.2024.30, author = {Kakimura, Naonori and Schlotter, Ildik\'{o}}, title = {{Parameterized Complexity of Submodular Minimization Under Uncertainty}}, booktitle = {19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024)}, pages = {30:1--30:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-318-8}, ISSN = {1868-8969}, year = {2024}, volume = {294}, editor = {Bodlaender, Hans L.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2024.30}, URN = {urn:nbn:de:0030-drops-200702}, doi = {10.4230/LIPIcs.SWAT.2024.30}, annote = {Keywords: Submodular minimization, optimization under uncertainty, parameterized complexity, cut function} }
Irina Kostitsyna, Tim Ophelders, Irene Parada, Tom Peters, Willem Sonke, and Bettina Speckmann. Optimal In-Place Compaction of Sliding Cubes. In 19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 294, pp. 31:1-31:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{kostitsyna_et_al:LIPIcs.SWAT.2024.31, author = {Kostitsyna, Irina and Ophelders, Tim and Parada, Irene and Peters, Tom and Sonke, Willem and Speckmann, Bettina}, title = {{Optimal In-Place Compaction of Sliding Cubes}}, booktitle = {19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024)}, pages = {31:1--31:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-318-8}, ISSN = {1868-8969}, year = {2024}, volume = {294}, editor = {Bodlaender, Hans L.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2024.31}, URN = {urn:nbn:de:0030-drops-200713}, doi = {10.4230/LIPIcs.SWAT.2024.31}, annote = {Keywords: Sliding cubes, Reconfiguration algorithm, Modular robots} }
Michael Levet, Puck Rombach, and Nicholas Sieger. Canonizing Graphs of Bounded Rank-Width in Parallel via Weisfeiler-Leman. In 19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 294, pp. 32:1-32:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{levet_et_al:LIPIcs.SWAT.2024.32, author = {Levet, Michael and Rombach, Puck and Sieger, Nicholas}, title = {{Canonizing Graphs of Bounded Rank-Width in Parallel via Weisfeiler-Leman}}, booktitle = {19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024)}, pages = {32:1--32:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-318-8}, ISSN = {1868-8969}, year = {2024}, volume = {294}, editor = {Bodlaender, Hans L.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2024.32}, URN = {urn:nbn:de:0030-drops-200724}, doi = {10.4230/LIPIcs.SWAT.2024.32}, annote = {Keywords: Graph Isomorphism, Weisfeiler-Leman, Rank-Width, Canonization, Descriptive Complexity, Circuit Complexity} }
Anand Louis, Rameesh Paul, and Arka Ray. Sparse Cuts in Hypergraphs from Random Walks on Simplicial Complexes. In 19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 294, pp. 33:1-33:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{louis_et_al:LIPIcs.SWAT.2024.33, author = {Louis, Anand and Paul, Rameesh and Ray, Arka}, title = {{Sparse Cuts in Hypergraphs from Random Walks on Simplicial Complexes}}, booktitle = {19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024)}, pages = {33:1--33:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-318-8}, ISSN = {1868-8969}, year = {2024}, volume = {294}, editor = {Bodlaender, Hans L.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2024.33}, URN = {urn:nbn:de:0030-drops-200739}, doi = {10.4230/LIPIcs.SWAT.2024.33}, annote = {Keywords: Sparse Cuts, Random Walks, Link Expansion, Hypergraph Expansion, Simplicial Complexes, High Dimensional Expander, Threshold Rank} }
MIT-NASA Space Robots Team, Josh Brunner, Kenneth C. Cheung, Erik D. Demaine, Jenny Diomidova, Christine Gregg, Della H. Hendrickson, and Irina Kostitsyna. Reconfiguration Algorithms for Cubic Modular Robots with Realistic Movement Constraints. In 19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 294, pp. 34:1-34:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{mitnasaspacerobotsteam_et_al:LIPIcs.SWAT.2024.34, author = {MIT-NASA Space Robots Team and Brunner, Josh and Cheung, Kenneth C. and Demaine, Erik D. and Diomidova, Jenny and Gregg, Christine and Hendrickson, Della H. and Kostitsyna, Irina}, title = {{Reconfiguration Algorithms for Cubic Modular Robots with Realistic Movement Constraints}}, booktitle = {19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024)}, pages = {34:1--34:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-318-8}, ISSN = {1868-8969}, year = {2024}, volume = {294}, editor = {Bodlaender, Hans L.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2024.34}, URN = {urn:nbn:de:0030-drops-200742}, doi = {10.4230/LIPIcs.SWAT.2024.34}, annote = {Keywords: Modular robotics, programmable matter, digital materials, motion planning} }
Daniel Mock and Peter Rossmanith. Solving a Family Of Multivariate Optimization and Decision Problems on Classes of Bounded Expansion. In 19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 294, pp. 35:1-35:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{mock_et_al:LIPIcs.SWAT.2024.35, author = {Mock, Daniel and Rossmanith, Peter}, title = {{Solving a Family Of Multivariate Optimization and Decision Problems on Classes of Bounded Expansion}}, booktitle = {19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024)}, pages = {35:1--35:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-318-8}, ISSN = {1868-8969}, year = {2024}, volume = {294}, editor = {Bodlaender, Hans L.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2024.35}, URN = {urn:nbn:de:0030-drops-200754}, doi = {10.4230/LIPIcs.SWAT.2024.35}, annote = {Keywords: bounded expansion, parameterized algorithms, sparsity, counting logic, dominating set, model checking, multivariate optimization} }
Ofer Neiman and Idan Shabat. Path-Reporting Distance Oracles with Linear Size. In 19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 294, pp. 36:1-36:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{neiman_et_al:LIPIcs.SWAT.2024.36, author = {Neiman, Ofer and Shabat, Idan}, title = {{Path-Reporting Distance Oracles with Linear Size}}, booktitle = {19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024)}, pages = {36:1--36:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-318-8}, ISSN = {1868-8969}, year = {2024}, volume = {294}, editor = {Bodlaender, Hans L.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2024.36}, URN = {urn:nbn:de:0030-drops-200760}, doi = {10.4230/LIPIcs.SWAT.2024.36}, annote = {Keywords: Graph Algorithms, Shortest Paths, Distance Oracles} }
Christian Ortlieb and Jens M. Schmidt. Toward Grünbaum’s Conjecture. In 19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 294, pp. 37:1-37:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{ortlieb_et_al:LIPIcs.SWAT.2024.37, author = {Ortlieb, Christian and Schmidt, Jens M.}, title = {{Toward Gr\"{u}nbaum’s Conjecture}}, booktitle = {19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024)}, pages = {37:1--37:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-318-8}, ISSN = {1868-8969}, year = {2024}, volume = {294}, editor = {Bodlaender, Hans L.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2024.37}, URN = {urn:nbn:de:0030-drops-200777}, doi = {10.4230/LIPIcs.SWAT.2024.37}, annote = {Keywords: Planar graph, spanning tree, maximum degree, Schnyder wood} }
Yota Otachi, Akira Suzuki, and Yuma Tamura. Finding Induced Subgraphs from Graphs with Small Mim-Width. In 19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 294, pp. 38:1-38:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{otachi_et_al:LIPIcs.SWAT.2024.38, author = {Otachi, Yota and Suzuki, Akira and Tamura, Yuma}, title = {{Finding Induced Subgraphs from Graphs with Small Mim-Width}}, booktitle = {19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024)}, pages = {38:1--38:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-318-8}, ISSN = {1868-8969}, year = {2024}, volume = {294}, editor = {Bodlaender, Hans L.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2024.38}, URN = {urn:nbn:de:0030-drops-200788}, doi = {10.4230/LIPIcs.SWAT.2024.38}, annote = {Keywords: mim-width, graph algorithm, NP-hardness, induced subgraph problem, cluster vertex deletion} }
Benjamin Rockel-Wolff. A Fast 3-Approximation for the Capacitated Tree Cover Problem with Edge Loads. In 19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 294, pp. 39:1-39:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{rockelwolff:LIPIcs.SWAT.2024.39, author = {Rockel-Wolff, Benjamin}, title = {{A Fast 3-Approximation for the Capacitated Tree Cover Problem with Edge Loads}}, booktitle = {19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024)}, pages = {39:1--39:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-318-8}, ISSN = {1868-8969}, year = {2024}, volume = {294}, editor = {Bodlaender, Hans L.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2024.39}, URN = {urn:nbn:de:0030-drops-200793}, doi = {10.4230/LIPIcs.SWAT.2024.39}, annote = {Keywords: Approximation Algorithms, Tree Cover, LP} }
Mohammad R. Salavatipour and Lijiangnan Tian. Approximation Algorithms for the Airport and Railway Problem. In 19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 294, pp. 40:1-40:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{salavatipour_et_al:LIPIcs.SWAT.2024.40, author = {Salavatipour, Mohammad R. and Tian, Lijiangnan}, title = {{Approximation Algorithms for the Airport and Railway Problem}}, booktitle = {19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024)}, pages = {40:1--40:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-318-8}, ISSN = {1868-8969}, year = {2024}, volume = {294}, editor = {Bodlaender, Hans L.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2024.40}, URN = {urn:nbn:de:0030-drops-200806}, doi = {10.4230/LIPIcs.SWAT.2024.40}, annote = {Keywords: Facility Location, Approximation Algorithms, Dynamic Programming} }
Feedback for Dagstuhl Publishing