1: A Note on the Exact Schedulability Analysis for Segmented Self-Suspending Systems
2: On Leader Green Election
3: Random cluster dynamics for the Ising model is rapidly mixing
4: A Linear-Time Algorithm for the Weighted Paired-Domination Problem on Block Graphs
5: Munchausen Iteration
6: Parameterized complexity of the MINCCA problem on graphs of bounded decomposability
7: Algorithms for the Pagination Problem, a Bin Packing with Overlapping Items
8: Capacity Planning for Cluster Tools in the Semiconductor Industry
9: Newer method of string comparison: the Modified Moving Contracting Window Pattern Algorithm
10: New Results on Linear Size Distance Preservers
11: Fully dynamic data structure for LCE queries in compressed space
12: Rank and select: Another lesson learned
13: Faster Online Matrix-Vector Multiplication
14: Negative-Weight Shortest Paths and Unit Capacity Minimum Cost Flow in $\tilde{O}(m^{10/7} \log W)$ Time
15: Minimum Power Range Assignment for Symmetric Connectivity in Sensor Networks with two Power Levels
16: Asymmetric R'enyi Problem and PATRICIA Tries
17: Routing with Congestion in Acyclic Digraphs
18: Deterministic MST Sparsification in the Congested Clique
19: Markov Chain methods for the bipartite Boolean quadratic programming problem
20: Fast Compatibility Testing for Phylogenies with Nested Taxa
21: Concentrated Differential Privacy: Simplifications, Extensions, and Lower Bounds
22: Average Size of a Suffix Tree for Markov Sources
23: The Complexity of Simulation and Matrix Multiplication
24: Solving generalized maximum-weight connected subgraph problem for network enrichment analysis