1: Participatory Budgeting with Donations and Diversity Constraints
2: Speeding up Python-based Lagrangian Fluid-Flow Particle Simulations via Dynamic Collection Data Structures
3: Triangle Centrality
4: On the Hardness of Scheduling With Non-Uniform Communication Delays
5: Perfect Forests in Graphs and Their Extensions
6: Online Domination: The Value of Getting to Know All your Neighbors
7: Graph Vulnerability and Robustness: A Survey
8: Fast mixing via polymers for random graphs with unbounded degree
9: Model Counting meets F0 Estimation
10: A 3D Advancing-Front Delaunay Mesh Refinement Algorithm
11: Testing Dynamic Environments: Back to Basics
12: A Constant-factor Approximation for Weighted Bond Cover
13: General Knapsack Problems in a Dynamic Setting
14: Fault Tolerant Max-Cut
15: Near-Optimal Cayley Expanders for Abelian Groups
16: Improved approximation algorithms for bounded-degree local Hamiltonians
17: Spectral independence, coupling with the stationary distribution, and the spectral gap of the Glauber dynamics
18: Finding Triangles or Independent Sets; and Other Dual Pair Approximations
19: Classes of intersection digraphs with good algorithmic properties
20: Isolation schemes for problems on decomposable graphs
21: Hadamard matrices in ${0,1}$ presentation and an algorithm for generating them
22: FPT algorithms for packing $k$-safe spanning rooted sub(di)graphs
23: Deterministic Rounding of Dynamic Fractional Matchings
24: Determining 4-edge-connected components in linear time
25: Thinking Inside the Ball: Near-Optimal Minimization of the Maximal Loss
26: Approximation schemes for bounded distance problems on fractionally treewidth-fragile graphs
27: Streaming approximation resistance of every ordering CSP
28: Sampling Colorings and Independent Sets of Random Regular Bipartite Graphs in the Non-Uniqueness Region
29: An Optimal Algorithm for Triangle Counting in the Stream
30: Dynamic Enumeration of Similarity Joins
31: The Complexity of Symmetry Breaking in Massive Graphs
32: Identity testing under label mismatch
33: Tree Path Minimum Query Oracle via Boruvka Trees
34: Deep Multilevel Graph Partitioning
35: Scheduling with Testing on Multiple Identical Parallel Machines
36: Local Algorithms for Bounded Degree Sparsifiers in Sparse Graphs
37: Essentiality of the Non-stoquastic Hamiltonians and Driver Graph Design in Quantum Optimization Annealing
38: Universal Algorithms for Clustering Problems
39: Faster Algorithms for Bounded Tree Edit Distance
40: Feedback Vertex Set and Even Cycle Transversal for H-Free Graphs: Finding Large Block Graphs
41: Neural Algorithmic Reasoning
42: Faster Monotone Min-Plus Product, Range Mode, and Single Source Replacement Paths
43: Tight Approximation Algorithms for Geometric Bin Packing with Skewed Items
44: Hashing Modulo Alpha-Equivalence
45: Computing the $4$-Edge-Connected Components of a Graph in Linear Time
46: Improved Approximation for Longest Common Subsequence over Small Alphabets
47: Maximally Satisfying Lower Quotas in the Hospitals/Residents Problem with Ties
48: Faster Algorithms for Longest Common Substring