43 citations · 187 across the 40 of their papers we have counts for
4 papers · 1 filter
The Power of Data Reduction for Matching
George B. Mertzios, André Nichterlein, Rolf Niedermeier
Finding maximum-cardinality matchings in undirected graphs is arguably one of the most central graph primitives. For -edge and -vertex graphs, it is well-known to be solvable…
The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs
René van Bevern, Till Fluschnik, George B. Mertzios +3
This work studies the parameterized complexity of finding secluded solutions to classical combinatorial optimization problems on graphs such as finding minimum s-t separators, feed…
On the Complexity of Weighted Greedy Matchings
Argyrios Deligkas, George B. Mertzios, Paul G. Spirakis
Motivated by the fact that in several cases a matching in a graph is stable if and only if it is produced by a greedy algorithm, we study the problem of computing a maximum weight…
Graph Editing to a Given Degree Sequence
Petr A. Golovach, George B. Mertzios
We investigate the parameterized complexity of the graph editing problem called Editing to a Graph with a Given Degree Sequence, where the aim is to obtain a graph with a given deg…