1: Streaming Complexity of Spanning Tree Computation
2: A Note on Distance-Preserving Graph Sparsification
3: Closed form distance formula for the balanced multiple travelling salesmen
4: Faster and Enhanced Inclusion-Minimal Cograph Completion
5: Scheduling for Weighted Flow and Completion Times in Reconfigurable Networks
6: Zeroth-Order Algorithms for Nonconvex Minimax Problems with Improved Complexities
7: A Pseudopolynomial Algorithm to Minimize Maximum Lateness on Multiple Related Machines
8: A Greedy algorithm for local heating
9: Arc-routing for winter road maintenance
10: Sorting Permutations with Fixed Pinnacle Set
11: Strongly Stable and Maximum Weakly Stable Noncrossing Matchings
12: Bibliography of distributed approximation beyond bounded degree
13: Communication-Efficient String Sorting
14: Approximation algorithms for scheduling a group of heat pumps
15: Counting directed acyclic and elementary digraphs
16: $O(\log \log n)$ Worst-Case Local Decoding and Update Efficiency for Data Compression
17: Interventions for Ranking in the Presence of Implicit Bias
18: Fixed-parameter tractable algorithms for Tracking Shortest Paths
19: Reasoning About Generalization via Conditional Mutual Information
20: Improved mixing time for k-subgraph sampling
21: Approximations for Throughput Maximization
22: Business Process Full Compliance with Respect to a Set of Conditional Obligation in Polynomial Time