Parameterization and approximation are two popular ways of coping with NP-hard
problems. More recently, the two have also been combined to derive many interesting …

We investigate the fine-grained complexity of approximating the classical $ k $-median/$ k $-
means clustering problems in general metric spaces. We show how to improve the …

We study the parameterized complexity of approximating the kDominating Set (DomSet)
problem where an integer k and a graph G on n vertices are given as input, and the goal is …

We consider questions that arise from the intersection between the areas of approximation
algorithms, subexponential-time algorithms, and fixed-parameter tractable algorithms. The …

A new method is proposed for online handwriting recognition of Kanji characters. The
method employs substroke HMM as minimum units to constitute Japanese Kanji characters …

We show that the problem of finding a Resolution refutation that is at most polynomially
longer than a shortest one is NP-hard. In the parlance of proof complexity, Resolution is not …

We show, assuming the (randomized) Gap Exponential Time Hypothesis (Gap-ETH), that
the following tasks cannot be done in T (k)· N o (k)-time for any function T where N denote …

We consider questions that arise from the intersection between the areas of polynomial-time
approximation algorithms, subexponential-time algorithms, and fixed-parameter tractable …

Over the past decade, many results have focused on the design of parameterized
approximation algorithms for W [1]-hard problems. However, there are fundamental …

For every graph G, let ω (G) be the largest size of complete subgraph in G. This paper
presents a simple algorithm which, on input a graph G, a positive integer k and a small …