Parameterized complexity/multivariate complexity algorithmics is an exciting field of modern
algorithm design and analysis, with a broad range of theoretical and practical aspects that …

In this article we study a well-known problem, called Bipartite Token Jumping and not-so-
well known problem (s), which we call, Half (Induced-) Subgraph, and show that under Gap …

Parameterized complexity is a multivariate theory for the analysis of computational
problems. It leads to practically efficient algorithms for many NP-hard problems and also …

Traditionally, the beams of mechanical presses are designed and optimized empirically. The
empirical design cannot satisfy the increasingly strict requirements on product performance …

In this chapter, we will first look at parameterized counting problems as an analog to the
classical problem of counting. We establish the classes# W [t] and related issues, and prove …