1: Approximating Node-Weighted k-MST on Planar Graphs
2: Pull and Push&Pull in Random Evolving Graphs
3: Broadcasting Spanning Forests on a Multiple-Access Channel
4: Freeform Assembly Planning
5: On Spectral Graph Embedding: A Non-Backtracking Perspective and Graph Approximation
6: Computing Hitting Set Kernels By AC^0-Circuits
7: The cover time of a biased random walk on a random cubic graph
8: Slowing Down Top Trees for Better Worst-Case Bounds
9: On Periodicity Lemma for Partial Words
10: Generalizing the Kawaguchi-Kyan bound to stochastic parallel machine scheduling
11: String Periods in the Order-Preserving Model
12: Coordinated Motion Planning: Reconfiguring a Swarm of Labeled Robots with Bounded Stretch
13: Local Mixing Time: Distributed Computation and Applications