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
On the bit-complexity of sparse polynomial multiplication
On the Border Length Minimization Problem (BLMP) on a Square Array
On the Complexity of Approximate Sum of Sorted List
On the Complexity of Searching in Trees: Average-case Minimization
On the Complexity of Spill Everywhere under SSA Form
On the Complexity of Submodular Function Minimisation on Diamonds
On the Continuous CNN Problem
On the Efficiency of Influence-and-Exploit Strategies for Revenue Maximization under Positive Externalities
On the hardness of distance oracle for sparse graph
On the Hardness of Welfare Maximization in Combinatorial Auctions with Submodular Valuations
On the Hopcroft's minimization algorithm
On the Insertion Time of Cuckoo Hashing