1: Efficient Synchronization of State-based CRDTs
2: Flexible and Efficient Algorithms for Abelian Matching in Strings
3: Sever: A Robust Meta-Algorithm for Stochastic Optimization
4: Approximation algorithms for two-machine flow-shop scheduling with a conflict graph
5: Accelerating a fluvial incision and landscape evolution model with parallelism
6: A note on two-colorability of nonuniform hypergraphs
7: Biological and Shortest-Path Routing Procedures for Transportation Network Design
8: Synchronization Strings: Efficient and Fast Deterministic Constructions over Small Alphabets
9: Fairness Through Computationally-Bounded Awareness
10: Efficient Algorithms for Outlier-Robust Regression
11: Probably Approximately Metric-Fair Learning
12: Improved Distributed $\Delta$-Coloring
13: Graph-based Preconditioning Conjugate Gradient Algorithm for N-1 Contingency Analysis
14: Exploration of Graph Computing in Power System State Estimation
15: A Polynomial Kernel for Diamond-Free Editing
16: Ensuring referential integrity under causal consistency
17: Virtual Network Embedding Approximations: Leveraging Randomized Rounding
18: The Electric Two-echelon Vehicle Routing Problem
19: Disconnected Cuts in Claw-free Graphs
20: Multi-Agent Submodular Optimization
21: Graph-based Clustering under Differential Privacy
22: Submodular Hypergraphs: p-Laplacians, Cheeger Inequalities and Spectral Clustering
23: Efficient Enumeration of Bipartite Subgraphs in Graphs
24: Scalable Breadth-First Search on a GPU Cluster
25: Exact uniform sampling over catalan structures
26: Linear-Time In-Place DFS and BFS on the Word RAM
27: Geodabs: Trajectory Indexing Meets Fingerprinting at Scale
28: Mixing Time of Markov chain of the Knapsack Problem
29: New Algorithms for Weighted $k$-Domination and Total $k$-Domination Problems in Proper Interval Graphs
30: A Hybrid Quantum-Classical Paradigm to Mitigate Embedding Costs in Quantum Annealing
31: Topical Community Detection in Event-based Social Network
32: (FPT-)Approximation Algorithms for the Virtual Network Embedding Problem
33: Reactive Proximity Data Structures for Graphs
34: Spanning Trees With Edge Conflicts and Wireless Connectivity
35: Certificates in P and Subquadratic-Time Computation of Radius, Diameter, and all Eccentricities in Graphs
36: On Integer Programming, Discrepancy, and Convolution
37: A pseudo-quasi-polynomial algorithm for solving mean-payoff parity games
38: Mathematical models and search algorithms for the capacitated $p$-center problem
39: Nearly Optimal Time Bounds for kPath in Hypergraphs
40: Graph Ranking and the Cost of Sybil Defense
41: Local Partition in Rich Graphs
42: Multiplicative Updates for Convolutional NMF Under $\beta$-Divergence