1: Subquadratic Algorithms for Succinct Stable Matching
2: Generalized Shortest Path Kernel on Graphs
3: Hollow Heaps
4: Memory-Adjustable Navigation Piles with Applications to Sorting and Convex Hulls
5: On the Dominating Set Problem in Random Graphs
6: Federated Scheduling Admits No Constant Speedup Factors for Constrained-Deadline DAG Task Systems
7: Fast hierarchical solvers for sparse matrices using extended sparsification and low-rank approximation
8: Crushing runtimes in adiabatic quantum computation with Energy Landscape Manipulation (ELM): Application to Quantum Factoring
9: Recognizing Union-Find trees is NP-complete
10: Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components
11: Faster Exact and Parameterized Algorithm for Feedback Vertex Set in Tournaments
12: Fast Compatibility Testing for Rooted Phylogenetic Trees
13: Expanders via Local Edge Flips
14: An O(log k log^2 n)-competitive Randomized Algorithm for the k-Sever Problem
15: Span-program-based quantum algorithms for graph bipartiteness and connectivity
16: Approximating Betweenness Centrality in Fully-dynamic Networks
17: A faster FPT Algorithm and a smaller Kernel for Block Graph Vertex Deletion
18: Beyond Level Planarity
19: Approximate Association via Dissociation