Accepted Paper List
Efficiently Reconfiguring a Connected Swarm of Labeled Robots
On the Complexity of Tree Edit Distance with Variables
Pop & push: Ordered tree iteration in O(1)-time
Improved Compression of the Okamura-Seymour Metric
One-Face Shortest Disjoint Paths with a Deviation Terminal
Bi-criteria Approximation Algorithms for Bounded-Degree Subset TSP
Approximating the Minimum Logarithmic Arrangement Problem
Succinct List Indexing in Optimal Time
Budgeted Out-tree Maximization with Submodular Prizes
Space-Efficient Graph Coarsening with Applications to Succinct Planar Encodings
On graphs coverable by k shortest paths
Computing homomorphisms in hereditary graph classes: the peculiar case of the 5-wheel and graphs with no long claws
A Local Search Algorithm for the Min-Sum Submodular Cover Problem
Range Updates and Range Sum Queries on Multidimensional Points with Monoid Weights
Package Delivery Using Drones with Restricted Movement Areas
On Maximizing Sums of Non-monotone Submodular and Linear Functions
Minimizing the Maximum Flow Time in the Online Food Delivery Problem
Extended MSO Model Checking via Small Vertex Integrity
How to Base Security on the Perfect/Statistical Binding Property of Quantum Bit Commitment? (Extended Abstract)
Evacuation from a Disk for Robots with Asymmetric Communication
On Reverse Shortest Paths in Geometric Proximity Graphs
Shortest Beer Path Queries in Interval Graphs
A quantum SDP rounding algorithm for a quantum optimization problem
Integer Complexity and Mixed Binary-Ternary Representation
Finding Matching Cuts in H-Free Graphs
On the Parameterized Intractability of Determinant Maximization
Parameterized Approximation Algorithms for TSP
Nested Active-Time Scheduling
Combinatorial and Algorithmic Aspects of Monadic Stability
Subsequences With Gap Constraints: Complexity Bounds for Matching and Analysis Problems
The Dispersive Art Gallery Problem
An optimal oracle separation of classical and quantum hybrid schemes
Algorithms for coloring reconfiguration under recolorability digraphs
Pursuit-Evasion in Graphs: Zombies, Lazy Zombies and a Survivor
List Locally Surjective Homomorphisms in Hereditary Graph Classes
Polynomial Threshold Functions for Decision Lists
Subquadratic Weighted Matroid Intersection under Rank Oracles
On the complexity of rainbow vertex colouring diametral path graphs
Distortion-Oblivious Algorithms for Scheduling on Multiple Machines
Clustering with Faulty Centers
Graph Product Structure for h-Framed Graphs
Locally checkable problems parameterized by clique-width
External-memory dictionaries with worst-case update cost
Computation of cycle bases in surface embedded graphs
Lower Bounds on Retroactive Data Structures
Complexity and algorithms for Isometric Path Cover on chordal graphs and beyond
Hardness of Approximation for H-free Edge Modification Problems: Towards a Dichotomy
Super-cubic lower bound for generalized Karchmer-Wigderson games
Algorithms for Landmark Hub Labeling
Segment Visibility Counting Queries in Polygons
On constrained intersection representations of graphs and digraphs
Multi-Robot Motion Planning for Unit Discs with Revolving Areas
Simple Order-isomorphic Matching Index with Expected Compact Space
Computing palindromes on a trie in linear time
On finding short reconfiguration sequences between independent sets
Partial and Simultaneous Transitive Orientations via Modular Decompositions
Proportional Allocation of Indivisible Goods up to the Least Valued Good on Average
Improving the Bounds of the Online Dynamic Power Management Problem
On Algorithmic Self-Assembly of Squares by Co-transcriptional Folding
Minimum Link Fencing
Hierarchical Categories in Colored Range Searching
On the Cop Number of String Graphs
Popular Edges with Critical Nodes
Simon's Congruence Pattern Matching
Entropy Matters: Understanding Performance of Sparse Random Embeddings