We study the knapsack problem with graph theoretic constraints. That is,...
The Euclidean Steiner Minimal Tree problem takes as input a set 𝒫
of poi...
We study the Steiner Tree problem on unit disk graphs. Given a n vertex
...
The study of parameterized streaming complexity on graph problems was
in...
In this work, we initiate a systematic study of parameterized streaming
...
Given a graph G, a q-open neighborhood conflict-free coloring or
q-ONCF-...
We study exact algorithms for Euclidean TSP in R^d. In the
early 1990s ...
In this paper, we study the query complexity of parameterized decision a...
The Metric Embedding problem takes as input two metric spaces (X,D_X) an...