1: Optimization with Demand Oracles
2: Computing q-gram Frequencies on Collage Systems
3: Computing q-gram Non-overlapping Frequencies on SLP Compressed Texts
4: From Small-World Networks to Comparison-Based Search
5: Compression via Matroids: A Randomized Polynomial Kernel for Odd Cycle Transversal
6: Compressive Mechanism: Utilizing Sparse Representation in Differential Privacy
7: Privacy-Enhanced Methods for Comparing Compressed DNA Sequences
8: K-sort: A new sorting algorithm that beats Heap sort for n <= 70 lakhs!
9: On Polynomial Kernels for Structural Parameterizations of Odd Cycle Transversal
10: Co-nondeterminism in compositions: A kernelization lower bound for a Ramsey-type problem
11: Haplotype Inference on Pedigrees with Recombinations, Errors, and Missing Genotypes via SAT solvers
12: Iterative Constructions and Private Data Release
13: Annotating Simplices with a Homology Basis and Its Applications
14: Lower Bounds for the Average and Smoothed Number of Pareto Optima
15: Detecting 2-joins faster
16: Interference minimization in physical model of wireless networks
17: Sorting Algorithms with Restrictions