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 …

This paper provides a comprehensive overview of the process for information retrieval from
invoices. Invoices serve as proof of purchase and contain important information, including …

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

We study local subgraph counting queries, Q=(p, o), to count how many times a given k-
node pattern graph p appears around every node υ in a data graph G when the given center …

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 …

Finding an envy-free allocation of indivisible resources to agents is a central task in many
multiagent systems. Often, non-trivial envy-free allocations do not exist and determining …

We investigate novel random graph embeddings that can be computed in expected
polynomial time and that are able to distinguish all non-isomorphic graphs in expectation …

We present the first super-linear lower bounds for natural graph problems in the CONGEST
model, answering a long-standing open question. Specifically, we show that any exact …

In this note we present an algorithm that lists all $4 $-cycles in a graph in time $\tilde
{O}(\min (n^ 2, m^{4/3})+ t) $ where $ t $ is their number. Notably, this separates $4 $-cycle …

The Subtree Isomorphism problem asks whether a given tree is contained in another given
tree. The problem is of fundamental importance and has been studied since the 1960s. For …