In the parameterized k-clique problem, or k-Clique for short, we are
giv...
In the classical survivable network design problem (SNDP), we are given ...
In the k-connected directed Steiner tree problem (k-DST), we are given a...
Our motivation is to improve on the best approximation guarantee known f...
In the Directed Steiner Tree (DST) problem, we are given a directed grap...
We study the variant of the Euclidean Traveling Salesman problem where
i...
Graph compression or sparsification is a basic information-theoretic and...
In the k-Connected Directed Steiner Tree problem (k-DST), we are given a...
Given a graph G=(V,E), capacities w(e) on edges, and a subset of
termina...
Directed Steiner Tree (DST) is a central problem in combinatorial
optimi...
In the Directed Steiner Tree (DST) problem we are given an n-vertex
dire...
This paper concerns proving almost tight (super-polynomial) running time...
In the Group Steiner Tree problem (GST), we are given a (vertex or
edge)...
We study the parameterized complexity of approximating the k-Dominating ...
We consider questions that arise from the intersection between the areas...
In this paper, we develop new tools and connections for exponential time...