1: On the Ordered List Subgraph Embedding Problems
2: Parameterized Edge Hamiltonicity
3: Engineering Parallel String Sorting
4: Blind-friendly von Neumann’s Heads or Tails
5: A Subquadratic Algorithm for Minimum Palindromic Factorization
6: String Reconstruction from Substring Compositions
7: Zig-zag Sort: A Simple Deterministic Data-Oblivious Sorting Algorithm Running in O(n log n) Time
8: Heat kernel based community detection
9: Coloring Large Complex Networks
10: Two-Point $L_1$ Shortest Path Queries in the Plane
11: The Input/Output Complexity of Sparse Matrix Multiplication