We combine ideas from distance sensitivity oracles (DSOs) and fixed-para...
We study the problem of counting the number of homomorphisms from an inp...
We generalize the tree doubling and Christofides algorithm, the two most...
We present fully polynomial approximation schemes for general classes of...
While many optimization problems work with a fixed number of decision
va...
For theoretical analyses there are two specifics distinguishing GP from ...
Many important graph theoretic notions can be encoded as counting graph
...