The Border Gateway Protocol (BGP) is the interdomain routing protocol used to exchange routing information between Autonomous Systems (ASes) in the internet today. While intradoma...
We study the parameterized complexity of a directed analog of the Full Degree Spanning Tree problem where, given a digraph D and a nonnegative integer k, the goal is to construct a...
Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh,...
In this paper, we consider multi-objective evolutionary algorithms for the Vertex Cover problem in the context of parameterized complexity. We relate the runtime of our algorithms...
Home health care, i.e. visiting and nursing patients in their homes, is a growing sector in the medical service business. From a staff rostering point of view, the problem is to f...
A digraph D is strong if it contains a directed path from x to y for every choice of vertices x, y in D. We consider the problem (MSSS) of finding the minimum number of arcs in a ...