1: For-all Sparse Recovery in Near-Optimal Time
2: A Natural Generalization of Bounded Tree-Width and Bounded Clique-Width
3: How Fast Can We Multiply Large Integers on an Actual Computer?
4: Tactical Fixed Job Scheduling with Spread-Time Constraints
5: Integer Set Compression and Statistical Modeling
6: Reduction of Maximum Flow Network Interdiction Problem from The Clique Problem
7: Longest Common Subsequence in k-length substrings
8: Hybridization Number on Three Rooted Binary Trees is EPT
9: Parameterized Directed $k$-Chinese Postman Problem and $k$ Arc-Disjoint Cycles Problem on Euler Digraphs
10: On-line approach to off-line coloring problems on graphs with geometric representations
11: Strong Equivalence Relations for Iterated Models
12: Polynomial-Time Space-Optimal Silent Self-Stabilizing Minimum-Degree Spanning Tree Construction
13: Data Compaction - Compression without Decompression
14: Large Cuts with Local Algorithms on Triangle-Free Graphs
15: Local Approximability of Minimum Dominating Set on Planar Graphs
16: Partitioning Perfect Graphs into Stars
17: Network-Based Vertex Dissolution
18: Automated Verification, Synthesis and Correction of Concurrent Systems via MSO Logic
19: Optimal Gossip with Direct Addressing
20: Direction Finding Algorithms with Joint Iterative Subspace Optimization
21: Dynamic Partial Sorting
22: Static Level Ancestors in Practice
23: Rendezvous in Networks in Spite of Delay Faults
24: Tree-based Coarsening and Partitioning of Complex Networks
25: An Anti-Folk Theorem for Large Repeated Games with Imperfect Monitoring
26: Algorithms for Dynamic Reeb Graphs
27: Sparsification and subexponential approximation
28: Robust Integer Programming
29: Optimal Alphabetic Ternary Trees
30: Partitioning Complex Networks via Size-constrained Clustering
31: Metric tree-like structures in real-life networks: an empirical study
32: Generalized Huffman Coding for Binary Trees with Choosable Edge Lengths
33: Subgraph Enumeration in Massive Graphs
34: Processing Succinct Matrices and Vectors
35: A subexponential parameterized algorithm for Proper Interval Completion
36: A subexponential parameterized algorithm for Interval Completion