1: Unshuffling Permutations
2: Approximation Algorithms for the Maximum Carpool Matching Problem
3: A Characterization for the Existence of Connected $f$-Factors of $\textit{ Large}$ Minimum Degree
4: Incremental Maintenance of Maximal Cliques in a Dynamic Graph
5: Bipartite Perfect Matching is in quasi-NC
6: A Novel Graph-based Approach for Determining Molecular Similarity
7: Combinatorial algorithm for counting small induced graphs and orbits
8: Edge-Disjoint Node-Independent Spanning Trees in Dense Gaussian Networks
9: Simple and Efficient Fully-Functional Succinct Trees
10: Streaming Space Complexity of Nearly All Functions of One Variable on Frequency Vectors
11: Approximating permanents and hafnians
12: Deterministic sub-linear space LCE data structures with efficient construction