1: Parameterized Power Vertex Cover
2: NC Algorithms for Computing a Perfect Matching and a Maximum Flow in One-Crossing-Minor-Free Graphs
3: On Polynomial time Constructions of Minimum Height Decision Tree
4: Nearly Optimal Dynamic $k$-Means Clustering for High-Dimensional Data
5: When can $l_p$-norm objective functions be minimized via graph cuts?
6: A Model for Learned Bloom Filters and Related Structures
7: Smooth $q$-Gram, and Its Applications to Detection of Overlaps among Long, Error-Prone Sequencing Reads
8: Counting and Sampling from Markov Equivalent DAGs Using Clique Trees
9: Fast Approximations for Metric-TSP via Linear Programming
10: Competitive Online Algorithms for Resource Allocation over the Positive Semidefinite Cone
11: Shortest $k$-Disjoint Paths via Determinants
12: Reducing CMSO Model Checking to Highly Connected Graphs
13: An efficient counting method for the colored triad census
14: How to select the best set of ads: Can we do better than Greedy Algorithm?
15: Strong Algorithms for the Ordinal Matroid Secretary Problem
16: Optimal Data Reduction for Graph Coloring Using Low-Degree Polynomials
17: Error correction in fast matrix multiplication and inverse
18: On The Hardness of Approximate and Exact (Bichromatic) Maximum Inner Product
19: Large-deviation Properties of Linear-programming Computational Hardness of the Vertex Cover Problem
20: Dynamic Sampling from a Discrete Probability Distribution with a Known Distribution of Rates
21: The $b$-branching problem in digraphs