1: Exponential Time Approximation for Coloring 3-Colorable Graphs
2: Stochastic Scheduling with Abandonments via Greedy Strategies
3: Pairwise-Independent Contention Resolution
4: Fair Clustering: Critique, Caveats, and Future Directions
5: Comprehensive characterization of three-qubit Grover search algorithm on IBM’s 127-qubit superconducting quantum computers
6: Quantum Metropolis Sampling via Weak Measurement
7: Learning-Based Heavy Hitters and Flow Frequency Estimation in Streams
8: On Computing Pairwise Statistics with Local Differential Privacy
9: Optimal Generation of Strictly Increasing Binary Trees and Beyond
10: Pop Stacks with a Bypass
11: Greedy Gray Codes for some Restricted Classes of Binary Words
12: Bijective BWT based compression schemes
13: An FPRAS for #nFBDD
14: Optimizing Search Strategies: A Study of Two-Pointer Linear Search Implementation
15: Scheduling with Obligatory Tests
16: Competitive Policies for Online Collateral Maintenance
17: Dynamic Metric Embedding into $\ell_p$ Space
18: Sparse Outerstring Graphs Have Logarithmic Treewidth
19: Distribution Learnability and Robustness
20: Capacity-Achieving Gray Codes
21: Robust Gray Codes Approaching the Optimal Rate
22: #CFG and #DNNF admit FPRAS
23: Complexity Classes for Online Problems with and without Predictions
24: Lift-and-Project Integrality Gaps for Santa Claus
25: Sum-of-Squares Lower Bounds for Independent Set in Ultra-Sparse Random Graphs
26: Parameterizing the quantification of CMSO: model checking on minor-closed graph classes
27: Generalized Cuts and Grothendieck Covers: a Primal-Dual Approximation Framework Extending the Goemans–Williamson Algorithm
28: Investigation on centrality measures and opinion dynamics in two-layer networks with replica nodes
29: Approximate Minimum Sum Colorings and Maximum $k$-Colorable Subgraphs of Chordal Graphs
30: VertiMRF: Differentially Private Vertical Federated Data Synthesis
31: On Convex Optimization with Semi-Sensitive Features
32: Cuts in Graphs with Matroid Constraints
33: QSketch: An Efficient Sketch for Weighted Cardinality Estimation in Streams
34: Exact Minimum Weight Spanners via Column Generation
35: Online sorting and online TSP: randomized, stochastic, and high-dimensional
36: Invitation to Local Algorithms
37: Resilient functions: Optimized, simplified, and generalized
38: Instance-Optimal Private Density Estimation in the Wasserstein Distance
39: The periodic structure of local consistency
40: Near Optimal Dual Fault Tolerant Distance Oracle
41: Steiner Tree Parameterized by Multiway Cut and Even Less
42: BinomialHash: A Constant Time, Minimal Memory Consistent Hash Algorithm
43: Fully Dynamic k-Means Coreset in Near-Optimal Update Time