1: List-coloring embedded graphs
2: Finding Efficient Region in The Plane with Line segments
3: Efficient Rounding for the Noncommutative Grothendieck Inequality
4: Tree t-spanners in Outerplanar Graphs via Supply Demand Partition
5: Greedy Selfish Network Creation
6: Volume Rendering of AMR Simulations
7: An Atypical Survey of Typical-Case Heuristic Algorithms
8: Limited-Capacity Many-To-Many Point Matching in One Dimension
9: Dominator Tree Certification and Independent Spanning Trees
10: On the Power of Conditional Samples in Distribution Testing