1: Cycles to the Rescue! Novel Constraints to Compute Maximum Planar Subgraphs Fast
2: Shortest Reconfiguration Sequence for Sliding Tokens on Spiders
3: Improved bounds for multipass pairing heaps and path-balanced binary search trees
4: A Nearly-Linear Bound for Chasing Nested Convex Bodies
5: Approximating some network problems with scenarios
6: Almost optimal Boolean matrix multiplication [BMM]-by multi-encoding of rows and columns
7: On $r$-Simple $k$-Path and Related Problems Parameterized by $k/r$
8: On Nondeterministic Derandomization of Freivalds’ Algorithm: Consequences, Avenues and Algorithmic Progress
9: Optimal Online Contention Resolution Schemes via Ex-Ante Prophet Inequalities
10: A new benchmark set for Traveling salesman problem and Hamiltonian cycle problem
11: Resolution with Counting: Dag-Like Lower Bounds and Different Moduli
12: Parameterized algorithms and data reduction for the short secluded $s$-$t$-path problem
13: Maximum Rooted Connected Expansion
14: Fast entropy-bounded string dictionary look-up with mismatches
15: Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments
16: Linear-Time Online Algorithm Inferring the Shortest Path from a Walk
17: Beyond Worst-Case Analysis
18: Approximate Nearest Neighbor Search in High Dimensions
19: Finding a Maximum-Weight Convex Set in a Chordal Graph
20: Fully Dynamic Maximal Independent Set with Sublinear in n Update Time
21: Is your function low-dimensional?
22: Practical Access to Dynamic Programming on Tree Decompositions
23: Listing All Maximal $k$-Plexes in Temporal Graphs
24: Conditional Sparse $\ell_p$-norm Regression With Optimal Probability
25: Conflict-free Replicated Data Types: An Overview
26: BDDs Naturally Represent Boolean Functions, and ZDDs Naturally Represent Sets of Sets
27: Online Matching in a Ride-Sharing Platform
28: Algorithmic Building Blocks for Asymmetric Memories
29: On Coalitional Manipulation for Multiwinner Elections: Shortlisting
30: Dynamic Trees with Almost-Optimal Access Cost
31: Computing the Chromatic Number Using Graph Decompositions via Matrix Rank
32: Lower Bounds for Dynamic Programming on Planar Graphs of Bounded Cutwidth
33: Amortized Analysis of Asynchronous Price Dynamics
34: Approximability of Discriminators Implies Diversity in GANs
35: Sublinear-Time Quadratic Minimization via Spectral Decomposition of Matrices
36: The Stochastic Score Classification Problem
37: Decremental SPQR-trees for Planar Graphs
38: Effective Wireless Scheduling via Hypergraph Sketches