1: Preprocessing Subgraph and Minor Problems: When Does a Small Vertex Cover Help?
2: The McDougal Cave and Counting issues
3: Near-Optimal Online Multiselection in Internal and External Memory
4: Nonuniform Vote Aggregation Algorithms
5: Provable ICA with Unknown Gaussian Noise, and Implications for Gaussian Mixtures and Autoencoders
6: Metrical Service Systems with Multiple Servers
7: On Deterministic Sketching and Streaming for Sparse Recovery and Norm Estimation
8: Kernelization Lower Bounds By Cross-Composition
9: The Online Replacement Path Problem
10: Performance Evaluation of A Proposed Variant of Frequency Count (VFC) List Accessing Algorithm
11: Some Novel Results From Analysis of Move To Front (MTF) List Accessing Algorithm
12: Data Structures on Event Graphs
13: Mining Preserving Structures in a Graph Sequence
14: Estimation of Simultaneously Sparse and Low Rank Matrices
15: Non-Minimal Triangulations for Mixed Stochastic/Deterministic Graphical Models