1: A heuristic algorithm using tree decompositions for the maximum happy vertices problem
2: Minimum Flow Decomposition in Graphs with Cycles using Integer Linear Programming
3: Complexity of diameter on AT-free graphs is linear
4: Space-efficient data structure for next/previous larger/smaller value queries
5: Maximal Closed Substrings
6: Diameter Minimization by Shortcutting with Degree Constraints
7: The Rique-Number of Graphs
8: Online Load Balancing on Uniform Machines with Limited Migration
9: Generalized $k$-Center: Distinguishing Doubling and Highway Dimension
10: Online Demand Scheduling with Failovers
11: Optimal General Factor Problem and Jump System Intersection
12: Optimal Diagonal Preconditioning
13: Treasure Hunt in Graph using Pebbles
14: Scalable Adversarial Attack Algorithms on Influence Maximization
15: Johnson-Lindenstrauss embeddings for noisy vectors – taking advantage of the noise
16: Can an NN model plainly learn planar layouts?
17: Elastic-Degenerate String Matching with 1 Error
18: Algorithms for Discrepancy, Matchings, and Approximations: Fast, Simple, and Practical
19: The distance backbone of directed networks
20: On the arboreal jump number of a poset
21: Tight Chernoff-Like Bounds Under Limited Independence
22: Computing Generalized Convolutions Faster Than Brute Force
23: Reconciling Individual Probability Forecasts
24: Recognizing Geometric Intersection Graphs Stabbed by a Line
25: Optimizing Reconfigurable Optical Datacenters: The Power of Randomization
26: Induced Cycles and Paths Are Harder Than You Think
27: The Power of Uniform Sampling for Coresets
28: Deciding a Graph Property by a Single Mobile Agent: One-Bit Memory Suffices
29: Resolving Infeasibility of Linear Systems: A Parameterized Approach
30: Solving the Maximum Popular Matching Problem with Matroid Constraints
31: Classification Protocols with Minimal Disclosure
32: Constructing Optimal Contraction Trees for Tensor Network Quantum Circuit Simulation
33: ~{O}ptimal Vertex Fault-Tolerant Spanners in ~{O}ptimal Time: Sequential, Distributed and Parallel
34: A Local Search Algorithm for the Min-Sum Submodular Cover Problem
35: Multitask Learning via Shared Features: Algorithms and Hardness
36: Computing the Hit Rate of Similarity Caching
37: $1D$ to $nD$: A Meta Algorithm for Multivariate Global Optimization via Univariate Optimizers