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 introduce a new, remarkably powerful tool to the toolbox of algebraic FPT algorithms,
determinantal sieving. Given a polynomial P (x 1,…, xn) over a field 𝔽 of characteristic 2, on …

We show that the Waring rank (symmetric tensor rank) of a certain family of polynomials has
intimate connections to the areas of parameterized and exact algorithms, generalizing some …

This survey is an invitation to parameterized counting problems for readers with a
background in parameterized algorithms and complexity. After an introduction to the …

We study the fixed-parameter tractability of the following fundamental problem: given two
directed graphs H→ and G→, count the number of copies of H→ in G→. The standard …

Cache persistence analysis is an important part of worst-case execution time (WCET)
analysis. It has been extensively studied in the past twenty years. Despite these efforts, all …

We study the problem $\#\mathrm {EdgeSub}(\Phi) $ of counting $ k $-edge subgraphs
satisfying a given graph property $\Phi $ in a large host graph $ G $. Building upon the …

Let C be an arithmetic circuit of size s, given as input that computes a polynomial f ∈ F x_1,
x_2, ..., x_n f∈ F x 1, x 2,…, xn, where FF is a finite field or the field of rationals. Using the …

We study the following problem and its applications: given a homogeneous degree-d
polynomial g as an arithmetic circuit C, and ad× d matrix X whose entries are homogeneous …

We design the first efficient sensitivity oracles and dynamic algorithms for a variety of
parameterized problems. Our main approach is to modify the algebraic coding technique …