SWAT 2024: 19TH SCANDINAVIAN SYMPOSIUM ON ALGORITHM THEORY

A
Aardal, Karen	Machine-learning augmented enumeration for integer optimization, and beyond
Agrawal, Akanksha	Eliminating Crossings in Ordered Graphs
Ashur, Stav	Local Spanners Revisited
B
Bailey, Lora	Pairwise Rearrangement Is Fixed-Parameter Tractable in the Single Cut-and-Join Model
Balakrishnan, Girish	Succinct Data Structure for Chordal Graphs with Bounded Vertex Leafage
Barish, Robert	Recognition and Proper Coloring of Unit Segment Intersection Graphs
Bazgan, Cristina	Destroying Densest Subgraphs Is Hard
Beisegel, Jesse	The Simultaneous Interval Number: a New Width Parameter That Measures the Similarity to Interval Graphs
Bentert, Matthias	Correlation Clustering with Vertex Splitting
Bercea, Ioana O.	Daisy Bloom Filters
Berg, Magnus	Online Bin Covering with Frequency Predictions
Berthe, Gaétan	Subexponential Parameterized Algorithms in Square Graphs and Intersection Graphs of Thin Objects
Bhattacharya, Sayan	Arboricity-Dependent Algorithms for Edge Coloring
Biedl, Therese	On the Independence Number of 1-Planar Graphs
Bille, Philip	Size-Constrained Weighted Ancestors with Applications
Blake, Heather	Pairwise Rearrangement Is Fixed-Parameter Tractable in the Single Cut-and-Join Model
Blank, Lotte	Range Reporting for Time Series via Rectangle Stabbing
Bodwin, Greg	Turán-type problems in Theoretical Computer Science
Bose, Prosenjit	On the Independence Number of 1-Planar Graphs
Bougeret, Marin	Subexponential Parameterized Algorithms in Square Graphs and Intersection Graphs of Thin Objects
Boyar, Joan	On the Online Weighted Non-Crossing Matching Problem
Brodal, Gerth Stølting	Deterministic Cache-Oblivious Funnelselect
Brunner, Josh	Reconfiguration Algorithms for Cubic Modular Robots with Realistic Movement Constraints
Buchin, Kevin	Dynamic L-Budget Clustering of Curves
Buchin, Maike	Dynamic L-Budget Clustering of Curves
Bumpus, Benjamin Merlin	Fixed-Parameter Tractable Certified Algorithms for Covering and Dominating in Planar Graphs and Beyond
C
Cabello, Sergio	Eliminating Crossings in Ordered Graphs
Chakraborty, Sankardeep	Succinct Data Structure for Chordal Graphs with Bounded Vertex Leafage
Cheung, Kenneth	Reconfiguration Algorithms for Cubic Modular Robots with Realistic Movement Constraints
Chiarelli, Nina	The Simultaneous Interval Number: a New Width Parameter That Measures the Similarity to Interval Graphs
Christiansen, Aleksander Bjørn Grodt	Sparsity-Parameterised Dynamic Edge Colouring
Cochran, Garner	Pairwise Rearrangement Is Fixed-Parameter Tractable in the Single Cut-and-Join Model
Costa, Martin	Arboricity-Dependent Algorithms for Edge Coloring
Crane, Alex	Correlation Clustering with Vertex Splitting
D
Darbouy, Seyed Parsa	Approximating Minimum Sum Coloring with Bundles
Della, Hendrickson	Reconfiguration Algorithms for Cubic Modular Robots with Realistic Movement Constraints
Demaine, Erik	Reconfiguration Algorithms for Cubic Modular Robots with Realistic Movement Constraints
Diomidova, Jenny	Reconfiguration Algorithms for Cubic Modular Robots with Realistic Movement Constraints
Drange, Pål Grønås	Correlation Clustering with Vertex Splitting
Driemel, Anne	Range Reporting for Time Series via Rectangle Stabbing
F
Fomin, Fedor	Stability in Graphs with Matroid Constraints
Fox, Nathan	Pairwise Rearrangement Is Fixed-Parameter Tractable in the Single Cut-and-Join Model
Friggstad, Zachary	Approximating Minimum Sum Coloring with Bundles A Logarithmic Integrality Gap for Generalizations of Quasi-Bipartite Instances of Directed Steiner Tree
G
Gezalyan, Auguste	Delaunay Triangulations in the Hilbert Metric
Golovach, Petr	Stability in Graphs with Matroid Constraints
Gonçalves, Daniel	Subexponential Parameterized Algorithms in Square Graphs and Intersection Graphs of Thin Objects
Gregg, Christine	Reconfiguration Algorithms for Cubic Modular Robots with Realistic Movement Constraints
Gudmundsson, Joachim	Dynamic L-Budget Clustering of Curves
Gärtner, Bernd	Optimizing Symbol Visibility Through Displacement
H
Har-Peled, Sariel	No-Dimensional Tverberg Partitions Revisited Local Spanners Revisited
Huynh, Kien C.	Optimizing Visibility-Based Search in Polygonal Domains
J
Jansen, Bart M. P.	Fixed-Parameter Tractable Certified Algorithms for Covering and Dominating in Planar Graphs and Beyond Search-Space Reduction via Essential Vertices Revisited: Vertex Multicut and Cograph Deletion
Johnson, Matthew	Edge Multiway Cut and Node Multiway Cut Are Hard for Planar Subcubic Graphs
K
Kakimura, Naonori	Parameterized Complexity of Submodular Minimization Under Uncertainty
Kalani, Vishwas	Optimizing Symbol Visibility Through Displacement
Kamali, Shahin	On the Online Weighted Non-Crossing Matching Problem Online Bin Covering with Frequency Predictions
Kaufmann, Michael	Eliminating Crossings in Ordered Graphs
Kim, Soo	Delaunay Triangulations in the Hilbert Metric
Knudsen, Jakob Bæk Tejs	Daisy Bloom Filters
Korhonen, Tuukka	Stability in Graphs with Matroid Constraints
Kostitsyna, Irina	Reconfiguration Algorithms for Cubic Modular Robots with Realistic Movement Constraints Optimal in-Place Compaction of Sliding Cubes
Köhler, Ekkehard	The Simultaneous Interval Number: a New Width Parameter That Measures the Similarity to Interval Graphs
L
Larsen, Kim S.	On the Online Weighted Non-Crossing Matching Problem
Levet, Michael	Canonizing Graphs of Bounded Rank-Width in Parallel via Weisfeiler--Leman Pairwise Rearrangement Is Fixed-Parameter Tractable in the Single Cut-and-Join Model
Li, Yaqiao	On the Online Weighted Non-Crossing Matching Problem
Lopez, Carlos	Delaunay Triangulations in the Hilbert Metric
Louis, Anand	Sparse Cuts in Hypergraphs from Random Walks on Simplicial Complexes
M
M. Reddy, Meghana	Optimizing Symbol Visibility Through Displacement
Mahmoud, Reem	Pairwise Rearrangement Is Fixed-Parameter Tractable in the Single Cut-and-Join Model
Martin, Barnaby	Edge Multiway Cut and Node Multiway Cut Are Hard for Planar Subcubic Graphs
Meulemans, Wouter	Optimizing Symbol Visibility Through Displacement
Milanič, Martin	The Simultaneous Interval Number: a New Width Parameter That Measures the Similarity to Interval Graphs
Miraftab, Babak	On the Independence Number of 1-Planar Graphs
Mitchell, Joseph S. B.	Optimizing Visibility-Based Search in Polygonal Domains
Mock, Daniel	Solving a Family of Multivariate Optimization and Decision Problems on Classes of Bounded Expansion
Mohammad Lavasani, Ali	On the Online Weighted Non-Crossing Matching Problem
Mount, David	Delaunay Triangulations in the Hilbert Metric
Muršič, Peter	The Simultaneous Interval Number: a New Width Parameter That Measures the Similarity to Interval Graphs
N
Narayanaswamy, N S	Succinct Data Structure for Chordal Graphs with Bounded Vertex Leafage
Neiman, Ofer	Path-Reporting Distance Oracles with Linear Size
Nekrich, Yakov	Size-Constrained Weighted Ancestors with Applications
Nguyen, Linh	Optimizing Visibility-Based Search in Polygonal Domains
Nichterlein, André	Destroying Densest Subgraphs Is Hard
O
Ophelders, Tim	Optimal in-Place Compaction of Sliding Cubes
Ortlieb, Christian	Toward Grünbaum's Conjecture
Otachi, Yota	Finding Induced Subgraphs from Graphs with Small Mim-Width
P
Pagh, Rasmus	Daisy Bloom Filters
Pandey, Sukanya	Edge Multiway Cut and Node Multiway Cut Are Hard for Planar Subcubic Graphs
Pankratov, Denis	On the Online Weighted Non-Crossing Matching Problem
Panski, Nadav	Arboricity-Dependent Algorithms for Edge Coloring
Parada, Irene	Optimal in-Place Compaction of Sliding Cubes
Paul, Rameesh	Sparse Cuts in Hypergraphs from Random Walks on Simplicial Complexes
Paulusma, Daniël	Edge Multiway Cut and Node Multiway Cut Are Hard for Planar Subcubic Graphs
Peters, Tom	Optimal in-Place Compaction of Sliding Cubes
Pilipczuk, Michal	Well-structured graphs through the lens of logic
Pissis, Solon	Size-Constrained Weighted Ancestors with Applications
Plätz, Lukas	Dynamic L-Budget Clustering of Curves
Polishchuk, Valentin	Optimizing Visibility-Based Search in Polygonal Domains
R
Ray, Arka	Sparse Cuts in Hypergraphs from Random Walks on Simplicial Complexes
Raymond, Jean-Florent	Subexponential Parameterized Algorithms in Square Graphs and Intersection Graphs of Thin Objects
Reidl, Felix	Correlation Clustering with Vertex Splitting
Robson, Eliot	No-Dimensional Tverberg Partitions Revisited
Rockel-Wolff, Benjamin	A Fast 3-Approximation for the Capacitated Tree Cover Problem with Edge Loads
Rombach, Puck	Canonizing Graphs of Bounded Rank-Width in Parallel via Weisfeiler--Leman
Rossmanith, Peter	Solving a Family of Multivariate Optimization and Decision Problems on Classes of Bounded Expansion
Rotenberg, Eva	Sparsity-Parameterised Dynamic Edge Colouring
S
Sadakane, Kunihiko	Succinct Data Structure for Chordal Graphs with Bounded Vertex Leafage
Salavatipour, Mohammad	Approximation Algorithms for the Airport and Railway Problem
Saurabh, Saket	Stability in Graphs with Matroid Constraints Eliminating Crossings in Ordered Graphs
Scheffler, Robert	The Simultaneous Interval Number: a New Width Parameter That Measures the Similarity to Interval Graphs
Schlotter, Ildikó	Parameterized Complexity of Submodular Minimization Under Uncertainty
Schmidt, Jens	Toward Grünbaum's Conjecture
Shabat, Idan	Path-Reporting Distance Oracles with Linear Size
Sharma, Roohani	Eliminating Crossings in Ordered Graphs
Shibuya, Tetsuo	Recognition and Proper Coloring of Unit Segment Intersection Graphs
Sieger, Nicholas	Canonizing Graphs of Bounded Rank-Width in Parallel via Weisfeiler--Leman
Singgih, Inne	Pairwise Rearrangement Is Fixed-Parameter Tractable in the Single Cut-and-Join Model
Skora, Daniel	Delaunay Triangulations in the Hilbert Metric
Smith, Siani	Edge Multiway Cut and Node Multiway Cut Are Hard for Planar Subcubic Graphs
Solomon, Shay	Arboricity-Dependent Algorithms for Edge Coloring
Sonke, Willem	Optimal in-Place Compaction of Sliding Cubes
Speckmann, Bettina	Optimizing Symbol Visibility Through Displacement Optimal in-Place Compaction of Sliding Cubes
Stadnyk, Grace	Pairwise Rearrangement Is Fixed-Parameter Tractable in the Single Cut-and-Join Model
Stefankovic, Zofia	Delaunay Triangulations in the Hilbert Metric
Stojakovic, Milos	Optimizing Symbol Visibility Through Displacement
Sullivan, Blair D.	Correlation Clustering with Vertex Splitting
Sun, Hao	A Logarithmic Integrality Gap for Generalizations of Quasi-Bipartite Instances of Directed Steiner Tree
Suzuki, Akira	Finding Induced Subgraphs from Graphs with Small Mim-Width
T
Tamura, Yuma	Finding Induced Subgraphs from Graphs with Small Mim-Width
Thiel, Lea	Dynamic L-Budget Clustering of Curves
Tian, Lijiangnan	Approximation Algorithms for the Airport and Railway Problem
U
Uno, Yushi	Eliminating Crossings in Ordered Graphs
V
van Leeuwen, Erik Jan	Edge Multiway Cut and Node Multiway Cut Are Hard for Planar Subcubic Graphs
Vazquez Alferez, Sofia	Destroying Densest Subgraphs Is Hard
Venne, Jaime	Fixed-Parameter Tractable Certified Algorithms for Covering and Dominating in Planar Graphs and Beyond
Verhaegh, Ruben F. A.	Search-Space Reduction via Essential Vertices Revisited: Vertex Multicut and Cograph Deletion
Vlieghe, Juliette Marie Victoire	Sparsity-Parameterised Dynamic Edge Colouring
W
Wiedemann, Alexander	Pairwise Rearrangement Is Fixed-Parameter Tractable in the Single Cut-and-Join Model
Wild, Sebastian	Deterministic Cache-Oblivious Funnelselect
Wolff, Alexander	Eliminating Crossings in Ordered Graphs
Wong, Sampson	Dynamic L-Budget Clustering of Curves

Disclaimer | Powered by EasyChair Smart Program