SWAT 2024: 19TH SCANDINAVIAN SYMPOSIUM ON ALGORITHM THEORY

This page contains an index consisting of author-provided keywords.

$
$1$-planar graph	On the Independence Number of 1-Planar Graphs
A
algorithm	The Simultaneous Interval Number: a New Width Parameter That Measures the Similarity to Interval Graphs
algorithms	Machine-learning augmented enumeration for integer optimization, and beyond
algorithms with predictions	Daisy Bloom Filters
amortised analysis	Sparsity-Parameterised Dynamic Edge Colouring
Approximation	Correlation Clustering with Vertex Splitting Approximation Algorithms for the Airport and Railway Problem
Approximation algorithm	Optimizing Visibility-Based Search in Polygonal Domains
Approximation Algorithms	A Logarithmic Integrality Gap for Generalizations of Quasi-Bipartite Instances of Directed Steiner Tree Dynamic L-Budget Clustering of Curves Approximating Minimum Sum Coloring with Bundles A Fast 3-Approximation for the Capacitated Tree Cover Problem with Edge Loads
arboricity	Sparsity-Parameterised Dynamic Edge Colouring Arboricity-Dependent Algorithms for Edge Coloring
B
Baker's technique	Fixed-Parameter Tractable Certified Algorithms for Covering and Dominating in Planar Graphs and Beyond
bidimensionality	Subexponential Parameterized Algorithms in Square Graphs and Intersection Graphs of Thin Objects
Bin Covering	Online Bin Covering with Frequency Predictions
Bloom filters	Daisy Bloom Filters
book embedding	Eliminating Crossings in Ordered Graphs
Bounded expansion	Solving a Family of Multivariate Optimization and Decision Problems on Classes of Bounded Expansion
Budgeted watchman route problem	Optimizing Visibility-Based Search in Polygonal Domains
C
c-planar	Eliminating Crossings in Ordered Graphs
cache-oblivious algorithm	Deterministic Cache-Oblivious Funnelselect
Canonization	Canonizing Graphs of Bounded Rank-Width in Parallel via Weisfeiler--Leman
Capacitated Facility Location	Approximation Algorithms for the Airport and Railway Problem
certified algorithms	Fixed-Parameter Tractable Certified Algorithms for Covering and Dominating in Planar Graphs and Beyond
Chordal graphs	Succinct Data Structure for Chordal Graphs with Bounded Vertex Leafage
Circuit Complexity	Canonizing Graphs of Bounded Rank-Width in Parallel via Weisfeiler--Leman
cluster editing	Correlation Clustering with Vertex Splitting
cluster vertex deletion	Finding Induced Subgraphs from Graphs with Small Mim-Width
clustering	Dynamic L-Budget Clustering of Curves
Coloring	Approximating Minimum Sum Coloring with Bundles
combinatorial optimization	Machine-learning augmented enumeration for integer optimization, and beyond
competitive analysis	On the Online Weighted Non-Crossing Matching Problem
complexity dichotomy	Edge Multiway Cut and Node Multiway Cut Are Hard for Planar Subcubic Graphs
Computational Complexity	Pairwise Rearrangement Is Fixed-Parameter Tractable in the Single Cut-and-Join Model
Computational Geometry	Local Spanners Revisited
convex hull	No-Dimensional Tverberg Partitions Revisited
Convexity	Delaunay Triangulations in the Hilbert Metric
correlation clustering	Correlation Clustering with Vertex Splitting
Counting Logic	Solving a Family of Multivariate Optimization and Decision Problems on Classes of Bounded Expansion
cut function	Parameterized Complexity of Submodular Minimization Under Uncertainty
cycle-hitting problems	Subexponential Parameterized Algorithms in Square Graphs and Intersection Graphs of Thin Objects
D
data structures	Range Reporting for Time Series via Rectangle Stabbing Size-Constrained Weighted Ancestors with Applications
Delaunay Graphs	Local Spanners Revisited
Delaunay Triangulations	Delaunay Triangulations in the Hilbert Metric
Descriptive Complexity	Canonizing Graphs of Bounded Rank-Width in Parallel via Weisfeiler--Leman
directed feedback vertex set	Search-Space Reduction via Essential Vertices Revisited: Vertex Multicut and Cograph Deletion
Directed Steiner Tree	A Logarithmic Integrality Gap for Generalizations of Quasi-Bipartite Instances of Directed Steiner Tree
Distance Oracles	Path-Reporting Distance Oracles with Linear Size
Dominating Set	Solving a Family of Multivariate Optimization and Decision Problems on Classes of Bounded Expansion Fixed-Parameter Tractable Certified Algorithms for Covering and Dominating in Planar Graphs and Beyond
Dynamic Algorithms	Sparsity-Parameterised Dynamic Edge Colouring Arboricity-Dependent Algorithms for Edge Coloring
E
Edge Coloring	Arboricity-Dependent Algorithms for Edge Coloring
edge colouring	Sparsity-Parameterised Dynamic Edge Colouring
edge deletion	Eliminating Crossings in Ordered Graphs
entropy	Daisy Bloom Filters
entropy bounds	Deterministic Cache-Oblivious Funnelselect
essential vertices	Search-Space Reduction via Essential Vertices Revisited: Vertex Multicut and Cograph Deletion
Euclidean plane	On the Online Weighted Non-Crossing Matching Problem
Exponential Time Hypothesis	Recognition and Proper Coloring of Unit Segment Intersection Graphs
F
Fault Tolerant Spanners	Local Spanners Revisited
fine-grained complexity	Recognition and Proper Coloring of Unit Segment Intersection Graphs
Fixed-parameter tractability	Destroying Densest Subgraphs Is Hard
fixed-parameter tractable	Fixed-Parameter Tractable Certified Algorithms for Covering and Dominating in Planar Graphs and Beyond
fixed-parameter tractable algorithms	Search-Space Reduction via Essential Vertices Revisited: Vertex Multicut and Cograph Deletion
frameworks	Stability in Graphs with Matroid Constraints
Fréchet distance	Dynamic L-Budget Clustering of Curves Range Reporting for Time Series via Rectangle Stabbing
G
Genome Rearrangement	Pairwise Rearrangement Is Fixed-Parameter Tractable in the Single Cut-and-Join Model
Geometric Graphs	Local Spanners Revisited
geometric intersection graph	Recognition and Proper Coloring of Unit Segment Intersection Graphs
graph algorithm	Finding Induced Subgraphs from Graphs with Small Mim-Width
Graph Algorithms	Path-Reporting Distance Oracles with Linear Size Arboricity-Dependent Algorithms for Edge Coloring
graph class recognition	Recognition and Proper Coloring of Unit Segment Intersection Graphs
graph containment	Edge Multiway Cut and Node Multiway Cut Are Hard for Planar Subcubic Graphs
Graph Isomorphism	Canonizing Graphs of Bounded Rank-Width in Parallel via Weisfeiler--Leman
graph modification	Correlation Clustering with Vertex Splitting
Graph modification problem	Destroying Densest Subgraphs Is Hard
H
H-Subgraph-Free Deletion	Fixed-Parameter Tractable Certified Algorithms for Covering and Dominating in Planar Graphs and Beyond
hierarchical partition	Sparsity-Parameterised Dynamic Edge Colouring
high dimension	No-Dimensional Tverberg Partitions Revisited
High Dimensional Expander	Sparse Cuts in Hypergraphs from Random Walks on Simplicial Complexes
Hilbert metric	Delaunay Triangulations in the Hilbert Metric
hitting set	Eliminating Crossings in Ordered Graphs
Hypergraph Expansion	Sparse Cuts in Hypergraphs from Random Walks on Simplicial Complexes
I
Independent set	On the Independence Number of 1-Planar Graphs
independent stable sets	Stability in Graphs with Matroid Constraints
induced subgraph problem	Finding Induced Subgraphs from Graphs with Small Mim-Width
integrality gap	Search-Space Reduction via Essential Vertices Revisited: Vertex Multicut and Cograph Deletion
intersection graph of segments	Subexponential Parameterized Algorithms in Square Graphs and Intersection Graphs of Thin Objects
interval graph	The Simultaneous Interval Number: a New Width Parameter That Measures the Similarity to Interval Graphs
J
jittering	Optimizing Symbol Visibility Through Displacement
K
kernelization	Stability in Graphs with Matroid Constraints
L
Leafage	Succinct Data Structure for Chordal Graphs with Bounded Vertex Leafage
Learning-Augmented Algorithms	Online Bin Covering with Frequency Predictions
Linear Programming	A Logarithmic Integrality Gap for Generalizations of Quasi-Bipartite Instances of Directed Steiner Tree
Link Expansion	Sparse Cuts in Hypergraphs from Random Walks on Simplicial Complexes
local search	Fixed-Parameter Tractable Certified Algorithms for Covering and Dominating in Planar Graphs and Beyond
lower bounds	Search-Space Reduction via Essential Vertices Revisited: Vertex Multicut and Cograph Deletion
LP	A Fast 3-Approximation for the Capacitated Tree Cover Problem with Edge Loads
M
matching problem	On the Online Weighted Non-Crossing Matching Problem
maximum degree	Toward Grünbaum's Conjecture
mim-width	Finding Induced Subgraphs from Graphs with Small Mim-Width
minimum degree	On the Independence Number of 1-Planar Graphs
Model checking	Solving a Family of Multivariate Optimization and Decision Problems on Classes of Bounded Expansion
modular robot	Reconfiguration Algorithms for Cubic Modular Robots with Realistic Movement Constraints
Modular robots	Optimal in-Place Compaction of Sliding Cubes
multiple selection	Deterministic Cache-Oblivious Funnelselect
Multivariate Optimization	Solving a Family of Multivariate Optimization and Decision Problems on Classes of Bounded Expansion
multiway cut	Edge Multiway Cut and Node Multiway Cut Are Hard for Planar Subcubic Graphs
N
Network Design	Approximation Algorithms for the Airport and Railway Problem
non-crossing constraints	On the Online Weighted Non-Crossing Matching Problem
NP-hardness	Finding Induced Subgraphs from Graphs with Small Mim-Width Destroying Densest Subgraphs Is Hard
O
Online algorithms	On the Online Weighted Non-Crossing Matching Problem
online algorithms with advice	On the Online Weighted Non-Crossing Matching Problem
Online Algorithms with Predictions	Online Bin Covering with Frequency Predictions
online algorithms with revoking	On the Online Weighted Non-Crossing Matching Problem
optimization under uncertainty	Parameterized Complexity of Submodular Minimization Under Uncertainty
ordered graphs	Eliminating Crossings in Ordered Graphs
Orthogonal Range Searching	Range Reporting for Time Series via Rectangle Stabbing
overlapping clustering	Correlation Clustering with Vertex Splitting
P
PAC Learning	Online Bin Covering with Frequency Predictions
parameterized complexity	Correlation Clustering with Vertex Splitting The Simultaneous Interval Number: a New Width Parameter That Measures the Similarity to Interval Graphs Stability in Graphs with Matroid Constraints Parameterized Complexity of Submodular Minimization Under Uncertainty
partitions	No-Dimensional Tverberg Partitions Revisited
Path graphs	Succinct Data Structure for Chordal Graphs with Bounded Vertex Leafage
perturbation resilience	Fixed-Parameter Tractable Certified Algorithms for Covering and Dominating in Planar Graphs and Beyond
Phylogenetics	Pairwise Rearrangement Is Fixed-Parameter Tractable in the Single Cut-and-Join Model
pivoting cube model	Reconfiguration Algorithms for Cubic Modular Robots with Realistic Movement Constraints
Planar graph	Toward Grünbaum's Conjecture
planar graphs	Fixed-Parameter Tractable Certified Algorithms for Covering and Dominating in Planar Graphs and Beyond
planar subcubic graph	Edge Multiway Cut and Node Multiway Cut Are Hard for Planar Subcubic Graphs
Points	No-Dimensional Tverberg Partitions Revisited
polygonal curves	Dynamic L-Budget Clustering of Curves
proper coloring	Recognition and Proper Coloring of Unit Segment Intersection Graphs
Q
Quota watchman route problem	Optimizing Visibility-Based Search in Polygonal Domains
R
Random Walks	Sparse Cuts in Hypergraphs from Random Walks on Simplicial Complexes
Randomized algorithms	Delaunay Triangulations in the Hilbert Metric
randomized online algorithms	On the Online Weighted Non-Crossing Matching Problem
Rank-Width	Canonizing Graphs of Bounded Rank-Width in Parallel via Weisfeiler--Leman
Reconfiguration algorithm	Optimal in-Place Compaction of Sliding Cubes
reconfiguration algorithms	Reconfiguration Algorithms for Cubic Modular Robots with Realistic Movement Constraints
Rectangle Stabbing	Range Reporting for Time Series via Rectangle Stabbing
S
Scheduling	Approximating Minimum Sum Coloring with Bundles
Schnyder wood	Toward Grünbaum's Conjecture
segment intersection graph	Recognition and Proper Coloring of Unit Segment Intersection Graphs
Shortest Paths	Path-Reporting Distance Oracles with Linear Size
Simplicial Complexes	Sparse Cuts in Hypergraphs from Random Walks on Simplicial Complexes
simplification	Dynamic L-Budget Clustering of Curves
simultaneous representation	The Simultaneous Interval Number: a New Width Parameter That Measures the Similarity to Interval Graphs
Single Cut-and-Join	Pairwise Rearrangement Is Fixed-Parameter Tractable in the Single Cut-and-Join Model
sliding cube model	Reconfiguration Algorithms for Cubic Modular Robots with Realistic Movement Constraints
Sliding cubes	Optimal in-Place Compaction of Sliding Cubes
spanning tree	Toward Grünbaum's Conjecture
Sparse Cuts	Sparse Cuts in Hypergraphs from Random Walks on Simplicial Complexes
Sparsity	Solving a Family of Multivariate Optimization and Decision Problems on Classes of Bounded Expansion
special graph classes	Destroying Densest Subgraphs Is Hard
stacking order	Optimizing Symbol Visibility Through Displacement
storage efficiency	Dynamic L-Budget Clustering of Curves
streaming algorithm	Dynamic L-Budget Clustering of Curves
string indexing	Size-Constrained Weighted Ancestors with Applications
subexponential FPT algorithms	Subexponential Parameterized Algorithms in Square Graphs and Intersection Graphs of Thin Objects
submodular minimization	Parameterized Complexity of Submodular Minimization Under Uncertainty
Succinct data structure	Succinct Data Structure for Chordal Graphs with Bounded Vertex Leafage
symbol placement	Optimizing Symbol Visibility Through Displacement
T
TBA	Machine-learning augmented enumeration for integer optimization, and beyond Turán-type problems in Theoretical Computer Science Well-structured graphs through the lens of logic
TBA1	Turán-type problems in Theoretical Computer Science Well-structured graphs through the lens of logic
TBA2	Turán-type problems in Theoretical Computer Science Well-structured graphs through the lens of logic
Threshold Rank	Sparse Cuts in Hypergraphs from Random Walks on Simplicial Complexes
Tree Cover	A Fast 3-Approximation for the Capacitated Tree Cover Problem with Edge Loads
V
Vertex leafage	Succinct Data Structure for Chordal Graphs with Bounded Vertex Leafage
vertex multicut	Search-Space Reduction via Essential Vertices Revisited: Vertex Multicut and Cograph Deletion
vertex splitting	Correlation Clustering with Vertex Splitting
visibility	Optimizing Symbol Visibility Through Displacement
Visibility-based search	Optimizing Visibility-Based Search in Polygonal Domains
W
W-hardness	Destroying Densest Subgraphs Is Hard
weighted ancestors	Size-Constrained Weighted Ancestors with Applications
weighted matching	On the Online Weighted Non-Crossing Matching Problem
Weisfeiler--Leman	Canonizing Graphs of Bounded Rank-Width in Parallel via Weisfeiler--Leman
width parameter	The Simultaneous Interval Number: a New Width Parameter That Measures the Similarity to Interval Graphs

Disclaimer | Powered by EasyChair Smart Program