default search action
19th SWAT 2024: Helsinki, Finland
- Hans L. Bodlaender
:
19th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2024, June 12-14, 2024, Helsinki, Finland. LIPIcs 294, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2024, ISBN 978-3-95977-318-8 - Front Matter, Table of Contents, Preface, Conference Organization. 0:i-0:xvi
- Akanksha Agrawal, Sergio Cabello, Michael Kaufmann, Saket Saurabh, Roohani Sharma, Yushi Uno, Alexander Wolff:
Eliminating Crossings in Ordered Graphs. 1:1-1:19 - Stav Ashur, Sariel Har-Peled:
Local Spanners Revisited. 2:1-2:15 - Lora Bailey, Heather C. Smith Blake, Garner Cochran, Nathan Fox, Michael Levet, Reem Mahmoud, Inne Singgih, Grace Stadnyk, Alexander Wiedemann:
Pairwise Rearrangement is Fixed-Parameter Tractable in the Single Cut-and-Join Model. 3:1-3:16 - Girish Balakrishnan, Sankardeep Chakraborty, N. S. Narayanaswamy, Kunihiko Sadakane:
Succinct Data Structure for Chordal Graphs with Bounded Vertex Leafage. 4:1-4:16 - Robert D. Barish, Tetsuo Shibuya:
Recognition and Proper Coloring of Unit Segment Intersection Graphs. 5:1-5:19 - Cristina Bazgan, André Nichterlein, Sofia Vazquez Alferez:
Destroying Densest Subgraphs Is Hard. 6:1-6:17 - Jesse Beisegel, Nina Chiarelli, Ekkehard Köhler, Martin Milanic, Peter Mursic, Robert Scheffler
The Simultaneous Interval Number: A New Width Parameter that Measures the Similarity to Interval Graphs. 7:1-7:20 - Matthias Bentert, Alex Crane, Pål Grønås Drange, Felix Reidl, Blair D. Sullivan:
Correlation Clustering with Vertex Splitting. 8:1-8:17 - Ioana O. Bercea, Jakob Bæk Tejs Houen, Rasmus Pagh:
Daisy Bloom Filters. 9:1-9:19 - Magnus Berg
Online Bin Covering with Frequency Predictions. 10:1-10:17 - Gaétan Berthe
Subexponential Algorithms in Geometric Graphs via the Subquadratic Grid Minor Property: The Role of Local Radius. 11:1-11:18 - Sayan Bhattacharya, Martín Costa, Nadav Panski, Shay Solomon:
Arboricity-Dependent Algorithms for Edge Coloring. 12:1-12:15 - Therese Biedl, Prosenjit Bose, Babak Miraftab:
On the Independence Number of 1-Planar Graphs. 13:1-13:13 - Philip Bille
Size-Constrained Weighted Ancestors with Applications. 14:1-14:12 - Lotte Blank, Anne Driemel:
Range Reporting for Time Series via Rectangle Stabbing. 15:1-15:15 - Joan Boyar
On the Online Weighted Non-Crossing Matching Problem. 16:1-16:19 - Gerth Stølting Brodal
Deterministic Cache-Oblivious Funnelselect. 17:1-17:12 - Kevin Buchin, Maike Buchin, Joachim Gudmundsson, Lukas Plätz, Lea Thiel, Sampson Wong:
Dynamic L-Budget Clustering of Curves. 18:1-18:17 - Benjamin Merlin Bumpus, Bart M. P. Jansen, Jaime Venne:
Fixed-Parameter Tractable Certified Algorithms for Covering and Dominating in Planar Graphs and Beyond. 19:1-19:16 - Aleksander B. G. Christiansen, Eva Rotenberg, Juliette Vlieghe:
Sparsity-Parameterised Dynamic Edge Colouring. 20:1-20:18 - Seyed Parsa Darbouy, Zachary Friggstad:
Approximating Minimum Sum Coloring with Bundles. 21:1-21:14 - Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Saket Saurabh:
Stability in Graphs with Matroid Constraints. 22:1-22:16 - Zachary Friggstad, Hao Sun:
A Logarithmic Integrality Gap for Generalizations of Quasi-Bipartite Instances of Directed Steiner Tree. 23:1-23:15 - Bernd Gärtner, Vishwas Kalani, Meghana M. Reddy, Wouter Meulemans, Bettina Speckmann, Milos Stojakovic:
Optimizing Symbol Visibility Through Displacement. 24:1-24:16 - Auguste H. Gezalyan, Soo Kim, Carlos Lopez, Daniel Skora, Zofia Stefankovic, David M. Mount:
Delaunay Triangulations in the Hilbert Metric. 25:1-25:17 - Sariel Har-Peled, Eliot Wong Robson:
No-Dimensional Tverberg Partitions Revisited. 26:1-26:14 - Kien C. Huynh, Joseph S. B. Mitchell, Linh Nguyen, Valentin Polishchuk:
Optimizing Visibility-Based Search in Polygonal Domains. 27:1-27:16 - Bart M. P. Jansen, Ruben F. A. Verhaegh:
Search-Space Reduction via Essential Vertices Revisited: Vertex Multicut and Cograph Deletion. 28:1-28:17 - Matthew Johnson, Barnaby Martin, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen:
Edge Multiway Cut and Node Multiway Cut Are Hard for Planar Subcubic Graphs. 29:1-29:17 - Naonori Kakimura, Ildikó Schlotter:
Parameterized Complexity of Submodular Minimization Under Uncertainty. 30:1-30:17 - Irina Kostitsyna, Tim Ophelders, Irene Parada, Tom Peters, Willem Sonke, Bettina Speckmann:
Optimal In-Place Compaction of Sliding Cubes. 31:1-31:14 - Michael Levet, Puck Rombach, Nicholas Sieger:
Canonizing Graphs of Bounded Rank-Width in Parallel via Weisfeiler-Leman. 32:1-32:18 - Anand Louis, Rameesh Paul, Arka Ray:
Sparse Cuts in Hypergraphs from Random Walks on Simplicial Complexes. 33:1-33:15 - MIT-NASA Space Robots Team, Josh Brunner, Kenneth C. Cheung, Erik D. Demaine, Jenny Diomidova, Christine Gregg, Della H. Hendrickson, Irina Kostitsyna:
Reconfiguration Algorithms for Cubic Modular Robots with Realistic Movement Constraints. 34:1-34:18 - Daniel Mock, Peter Rossmanith:
Solving a Family Of Multivariate Optimization and Decision Problems on Classes of Bounded Expansion. 35:1-35:18 - Ofer Neiman, Idan Shabat:
Path-Reporting Distance Oracles with Linear Size. 36:1-36:16 - Christian Ortlieb, Jens M. Schmidt:
Toward Grünbaum's Conjecture. 37:1-37:17 - Yota Otachi, Akira Suzuki, Yuma Tamura:
Finding Induced Subgraphs from Graphs with Small Mim-Width. 38:1-38:16 - Benjamin Rockel-Wolff:
A Fast 3-Approximation for the Capacitated Tree Cover Problem with Edge Loads. 39:1-39:14 - Mohammad R. Salavatipour, Lijiangnan Tian:
Approximation Algorithms for the Airport and Railway Problem. 40:1-40:16
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-04 20:49 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: