On the Integrality Gap of the Directed-Component Relaxation for Steiner Tree
On the Integrality Gap of the Subtour LP for the 1,2-TSP
On the maximal number of highly periodic runs in a string
On the Monotonicity of Work Function in k-Server Conjecture
On the Number of Iterations for Dantzig-Wolfe Optimization and Packing-Covering Approximation Algorithms
On the Power of Adaptivity in Sparse Recovery
On the Sample Complexity of Compressed Counting
On the Self-stabilization of Mobile Robots in Graphs
On the strong chromatic index and maximum induced matching of tree-cographs and permutation graphs
On the Sum-of-Squares Algorithm for Bin Packing
On the Use of Suffix Arrays for Memory-Efficient Lempel-Ziv Data Compression
On the Value of Job Migration in Online Makespan Minimization
On the Value of Multiple Read/Write Streams for Data Compression
On the variance of subset sum estimation
On the Worst-Case Performance of the Monte Carlo Method for Incremental Pagerank
On the Worst-case Performance of the Sum-of-Squares Algorithm for Bin Packing
On Thresholds for the Appearance of 2-cores in Mixed Hypergraphs
On Truncated-SVD-like Sparse Solutions to Least-Squares Problems of Arbitrary Dimensions
On Tuning the Bad-Character Rule: the Worst-Character Rule
On Two Dimensional Orthogonal Knapsack Problem