1 paper
Robert Bredereck, Vincent Froese, Marcel Koseler +3
There has been intensive work on the parameterized complexity of the typically NP-hard task to edit undirected graphs into graphs fulfilling certain given vertex degree constraints…