On Generalizations of Network Design Problems with Degree Bounds
On Geometric Spanners of Euclidean and Unit Disk Graphs
On Graph Crossing Number and Edge Planarization
On group feedback vertex set parameterized by the size of the cutset
On k-Column Sparse Packing Programs
On Multiway Cut parameterized above lower bounds
On optimally partitioning a text to improve its compression
On Parsimonious Explanations for 2-D Tree- and Linearly-Ordered Data
On Polynomial Kernels for Structural Parameterizations of Odd Cycle Transversal
On Practical Algorithms for Entropy Estimation and the Improved Sample Complexity of Compressed Counting
On Problems as Hard as CNFSAT
On Profit-Maximizing Pricing for the Highway and Tollbooth Problems
On Revenue Maximization in Second-Price Ad Auctions
On Smoothed Analysis of Quicksort and Hoare's Find
On Some Peculiarities of Dynamic Switch between Component Implementations in an Autonomic Computing System
On some simplicial elimination schemes for chordal graphs
On sparse representations of linear operators and the approximation of matrix products
On Stabilization in Herman's Algorithm
On Strongly Connected Digraphs with Bounded Cycle Length
On the (Im)possibility of Preserving Utility and Privacy in Personalized Social Recommendations