1: Isometric path complexity of graphs
2: Optimization Perspectives on Shellsort
3: Correlation Clustering Algorithm for Dynamic Complete Signed Graphs: An Index-based Approach
4: Exactly Hittable Interval Graphs
5: ReSQueing Parallel and Private Stochastic Convex Optimization
6: Inferring multiple consensus trees and supertrees using clustering: a review
7: Quantum Annealing vs. QAOA: 127 Qubit Higher-Order Ising Problems on NISQ Computers
8: Algorithms for Massive Data – Lecture Notes
9: Parameterized Lower Bounds for Problems in P via Fine-Grained Cross-Compositions
10: Small-World Formation via Local Information
11: Transactional Composition of Nonblocking Data Structures
12: Fast Parallel Algorithms for Enumeration of Simple, Temporal, and Hop-Constrained Cycles
13: Reducing Maximum Weighted Matching to the Largest Cardinality Matching in CONGEST
14: Provably Fast and Space-Efficient Parallel Biconnectivity
15: Matching Using Sufficient Dimension Reduction for Heterogeneity Causal Effect Estimation
16: R'enyi-Ulam Games and Online Computation with Imperfect Advice
17: Dynamic Maintenance of Monotone Dynamic Programs and Applications
18: Expanding the reach of quantum optimization with fermionic embeddings
19: Exact and Heuristic Approaches to Speeding Up the MSM Time Series Distance Computation
20: Max-Min Diversification with Fairness Constraints: Exact and Approximation Algorithms
21: Algorithms and Complexity for Computing Nash Equilibria in Adversarial Team Games
22: Streaming Zero-Knowledge Proofs
23: Sum Labelling Graphs of Maximum Degree Two
24: Better Differentially Private Approximate Histograms and Heavy Hitters using the Misra-Gries Sketch
25: Perturbation results for distance-edge-monitoring numbers
26: Finding and Counting Patterns in Sparse Graphs
27: Randomized Greedy Algorithms and Composable Coreset for k-Center Clustering with Outliers