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 …

The goal of this textbook is twofold. First, the book serves as an introduction to the field of
parameterized algorithms and complexity accessible to graduate students and advanced …

Let M=(E, I) be a matroid and let S={S 1, ċ, S t} be a family of subsets of E of size p. A
subfamily Ŝ⊆ S is q-representative for S if for every set Y⊆ E of size at most q, if there is a …

Parameterized computation theory has developed rapidly over the last two decades. In
theoretical computer science, it has attracted considerable attention for its theoretical value …

Finding paths of length k in O*(2k) time Page 1 Information Processing Letters 109 (2009)
315–318 Contents lists available at ScienceDirect Information Processing Letters www.elsevier.com/locate/ipl …

We study the problem of deciding whether an n-variate polynomial, presented as an
arithmetic circuit G, contains a degree k square-free term with an odd coefficient. We show …

ACM: Digital Library: Communications of the ACM ACM Digital Library Communications of the
ACM Volume 59, Number 1 (2016), Pages 98-105 Algebraic fingerprints for faster algorithms …

We present parameterized algorithms for the k-path problem, the p-packing of q-sets
problem, and the q-dimensional p-matching problem. Our algorithms solve these problems …

Code similarity is one promising approach to detect vulnerabilities hidden in software
programs. However, due to the complexity and diversity of source code, current methods …

Abstract Let M=(E, I) be a matroid and let S={S 1,…, St} be a family of subsets of E of size p.
A subfamily Ŝ⊆ S is q-representative for S if for every set Y⊆ E of size at most q, if there is a …