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
On the (non-)existence of polynomial kernels for Pl-free edge modification problems
On the Additive Constant of the k-server Work Function Algorithm
On the Algorithmic Complexity of the Mastermind Game with Black-Peg Results
On the Approximability and Hardness of Minimum Topic Connected Overlay and Its Special Instances
On the Approximability of Geometric and Geographic Generalization and the Min-Max Bin Covering Problem
On the approximability of the vertex cover and related problems
On the asymptotic behavior of some Algorithms
On the Average Complexity of Moore's State Minimization Algorithm