13 citations · 48 across the 26 of their papers we have counts for
5 papers · 1 filter
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…
Parameterized Algorithms for Zero Extension and Metric Labelling Problems
Felix Reidl, Magnus Wahlström
We consider the problems ZERO EXTENSION and METRIC LABELLING under the paradigm of parameterized complexity. These are natural, well-studied problems with important applications, b…
Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-Wideness
Wojciech Nadara, Marcin Pilipczuk, Roman Rabinovich +2
The notions of bounded expansion and nowhere denseness not only offer robust and general definitions of uniform sparseness of graphs, they also describe the tractability boundary f…
Searching for Maximum Out-Degree Vertices in Tournaments
Gregory Gutin, George B. Mertzios, Felix Reidl
A vertex in a tournament is called a king if for every vertex of there is a directed path from to of length at most 2. It is not hard to show that every ver…