1: Unified Compression-Based Acceleration of Edit-Distance Computation
2: A Deterministic Algorithm for the Vertex Connectivity Survivable Network Design Problem
3: Relaxation-based coarsening and multiscale graph organization
4: Spectral Methods for Matrices and Tensors
5: A note on Johnson, Minkoff and Phillips’ algorithm for the Prize-Collecting Steiner Tree Problem
6: Are there any good digraph width measures?
7: A Streaming Approximation Algorithm for Klee’s Measure Problem
8: Optimal stochastic planarization
9: On Feedback Vertex Set: New Measure and New Structures
10: Randomness criteria in binary visibility graph perspective
11: On the bias of BFS
12: Polynomial Time Algorithm for Graph Isomorphism Testing
13: Clustering with Spectral Norm and the k-means Algorithm
14: Contribution Games in Social Networks
15: All Ternary Permutation Constraint Satisfaction Problems Parameterized Above Average Have Kernels with Quadratic Numbers of Variables
16: A Polynomial time Algorithm for Hamilton Cycle with maximum Degree 3, 3SAT
17: Wedderburn rank reduction and Krylov subspace method for tensor approximation. Part 1: Tucker case
18: Feasibility Analysis of Sporadic Real-Time Multiprocessor Task Systems
19: An O(M(n) log n) algorithm for the Jacobi symbol
20: A Faster Algorithm for the Maximum Even Factor Problem
21: One Tree Suffices: A Simultaneous O(1)-Approximation for Single-Sink Buy-at-Bulk
22: Complexity Analysis of Balloon Drawing for Rooted Trees
23: On the Continuous CNN Problem