3 citations · 4 across the 7 of their papers we have counts for
13 papers
When you come at the kings you best not miss
Oded Lachish, Felix Reidl, Chhaya Trehan
A tournament is an orientation of a complete graph. We say that a vertex in a tournament controls another vertex if there exists a directed path of length at most…
A color-avoiding approach to subgraph counting in bounded expansion classes
Felix Reidl, Blair D. Sullivan
We present an algorithm to count the number of occurrences of a pattern graph as an induced subgraph in a host graph . If belongs to a bounded expansion class, the algor…
Domination above r-independence: does sparseness help?
Carl Einarson, Felix Reidl
Inspired by the potential of improving tractability via gap- or above-guarantee parametrisations, we investigate the complexity of Dominating Set when given a suitable lower-bound…
Longest paths in 2-edge-connected cubic graphs
Nikola K. Blanchard, Eldar Fischer, Oded Lachish +1
We prove almost tight bounds on the length of paths in -edge-connected cubic graphs. Concretely, we show that (i) every -edge-connected cubic graph of size has a path of…
Lower and Upper Bound for Computing the Size of All Second Neighbourhoods
Gregory Gutin, George B. Mertzios, Felix Reidl
We consider the problem of computing the size of each -neighbourhood for every vertex of a graph. Specifically, we ask whether the size of the closed second neighbourhood can be…
Alternative parameterizations of Metric Dimension
Gregory Gutin, M. S. Ramanujan, Felix Reidl +1
A set of vertices in a graph is called resolving if for any two distinct , there is such that , where ${\rm di…