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 consider questions that arise from the intersection between the areas of polynomial-time
approximation algorithms, subexponential-time algorithms, and fixed-parameter tractable …

Structural graph parameters, such as treewidth, pathwidth, and clique-width, are a central
topic of study in parameterized complexity. A main aim of research in this area is to …

Given a graph $ G $ and an integer $ k $, Max Min FVS asks whether there exists a minimal
set of vertices of size at least $ k $ whose deletion destroys all cycles. We present several …

The parameterized complexity of problems is often studied with respect to the size of their
optimal solutions. However, for a maximization problem, the size of the optimal solution can …

For any $\varepsilon> 0$, we give a polynomial-time $ n^\varepsilon $-approximation
algorithm for Max Independent Set in graphs of bounded twin-width given with an $ O (1) …

In this paper, we develop new tools and connections for exponential time approximation. In
this setting, we are given a problem instance and an integer r> 1 r> 1, and the goal is to …

This survey investigates the field of moderate exponential-time algorithms for NP-hard
scheduling problems, ie, exact algorithms whose worst-case time complexity is moderately …

In this work, we focus on several completion problems for subclasses of chordal graphs:
Minimum Fill-In, Interval Completion, Proper Interval Completion, Trivially Perfect …