1: An Efficient Data Structure for Fast Mining High Utility Itemsets
2: A characterization of linearizable instances of the quadratic minimum spanning tree problem
3: Distributed Estimation of Graph 4-Profiles
4: Efficient Ranking of Lyndon Words and Decoding Lexicographically Minimal de Bruijn Sequence
5: An Improved Combinatorial Polynomial Algorithm for the Linear Arrow-Debreu Market
6: On the Complexity of Inner Product Similarity Join
7: Lempel-Ziv Computation In Compressed Space (LZ-CICS)
8: A Shifting Bloom Filter Framework for Set Queries
9: Minors in graphs of large ${\theta}_r$-girth
10: Treetopes and their Graphs
11: Dynamic Sketching for Graph Optimization Problems with Applications to Cut-Preserving Sketches
12: A Still Simpler Way of Introducing the Interior-Point Method for Linear Programming
13: On the Smoothness of Paging Algorithms
14: Layered Heaps Beating Standard and Fibonacci Heaps in Practice
15: Linear-Vertex Kernel for the Problem of Packing $r$-Stars into a Graph without Long Induced Paths
16: Fast graph operations in quantum computation
17: A faster subquadratic algorithm for finding outlier correlations
18: An $O(\log OPT)$-approximation for covering and packing minor models of ${\theta}_r$
19: Canonical Paths for MCMC: from Art to Science
20: Reachability problems for PAMs