1: Streaming and Communication Complexity of Load-Balancing via Matching Contractors
2: 3SUM in Preprocessed Universes: Faster and Simpler
3: The Parameterized Complexity Landscape of the Unsplittable Flow Problem
4: EFX Allocations and Orientations on Bipartite Multi-graphs: A Complete Picture
5: Deep Learning and Machine Learning – Python Data Structures and Mathematics Fundamental: From Theory to Practice
6: About the Kannan-Bachem algorithm
7: Covariance estimation using Markov chain Monte Carlo
8: Faster Approximation Algorithms for Restricted Shortest Paths in Directed Graphs
9: Parallel Cluster-BFS and Applications to Shortest Paths
10: Optimal Robust Estimation under Local and Global Corruptions: Stronger Adversary and Smaller Error
11: Computing Optimal Regularizers for Online Linear Optimization
12: A Polylogarithmic Approximation for Directed Steiner Forest in Planar Digraphs
13: Sketching, Moment Estimation, and the L'evy-Khintchine Representation Theorem
14: Validating a PTAS for Triangle-Free 2-Matching via a Simple Decomposition Theorem
15: Collision-free Exploration by Mobile Agents Using Pebbles
16: Fixed-Parameter Tractability of Hedge Cut
17: Tight Bounds for Online Balanced Partitioning in the Generalized Learning Model
18: On the formalization of the notion of a concurrent algorithm
19: Privacy-Computation trade-offs in Private Repetition and Metaselection
20: Hypergraphs as Weighted Directed Self-Looped Graphs: Spectral Properties, Clustering, Cheeger Inequality
21: Theoretically Grounded Pruning of Large Ground Sets for Constrained, Discrete Optimization
22: Lower Bounds for Convexity Testing
23: Quantum linear system algorithm with optimal queries to initial state preparation
24: Locally seeded embeddings, and Ramsey numbers of bipartite graphs with sublinear bandwidth
25: Putting Off the Catching Up: Online Joint Replenishment Problem with Holding and Backlog Costs
26: Stronger adversaries grow cheaper forests: online node-weighted Steiner problems
27: Counting Locally Optimal Tours in the TSP
28: Recognizing Sumsets is NP-Complete
29: Deterministic Edge Connectivity and Max Flow using Subquadratic Cut Queries
30: Deterministic $(2/3-\varepsilon)$-Approximation of Matroid Intersection Using Nearly-Linear Independence-Oracle Queries
31: Packing Short Cycles
32: Connectivity Labeling Schemes for Edge and Vertex Faults via Expander Hierarchies
33: Testing Support Size More Efficiently Than Learning Histograms
34: How to Design a Quantum Streaming Algorithm Without Knowing Anything About Quantum Computing
35: Learning $k$-body Hamiltonians via compressed sensing
36: Matching Composition and Efficient Weight Reduction in Dynamic Matching
37: Min-CSPs on Complete Instances
38: Tera-Scale Multilevel Graph Partitioning
39: Fairness and Efficiency in Online Class Matching
40: Overcoming Non-Submodularity: Towards Constant Approximation for Network Immunization
41: Paths and Intersections: Characterization of Quasi-metrics in Directed Okamura-Seymour Instances
42: Near-Optimal Deterministic Network Decomposition and Ruling Set, and Improved MIS
43: Dynamic O(arboricity) coloring in polylogarithmic worst-case time
44: Improved Hardness-of-Approximation for Token Swapping
45: Low-degree spanning trees of $2$-edge-connected graphs in linear time
46: Solving Polynomial Equations Over Finite Fields
47: On the I/O Complexity of the CYK Algorithm and of a Family of Related DP Algorithms
48: Improved Online Reachability Preservers
49: On Sparsest Cut and Conductance in Directed Polymatroidal Networks
50: A New Method for Inserting Train Paths into a Timetable
51: Parameterized Saga of First-Fit and Last-Fit Coloring
52: New Applications of 3SUM-Counting in Fine-Grained Complexity and Pattern Matching
53: Fully-Distributed Byzantine Agreement in Sparse Networks
54: Parameterized Approximation for Capacitated $d$-Hitting Set with Hard Capacities
55: Popping Bubbles in Pangenome Graphs
56: A Simple Parallel Algorithm with Near-Linear Work for Negative-Weight Single-Source Shortest Paths
57: Matrix-by-matrix multiplication algorithm with $O(N^2log_2N)$ computational complexity for variable precision arithmetic