6 citations · 6 across the 1 of their papers we have counts for
2 papers
cs.DS2007
Dial a Ride from k-forest
Anupam Gupta, MohammadTaghi Hajiaghayi, Viswanath Nagarajan +1
The k-forest problem is a common generalization of both the k-MST and the dense--subgraph problems. Formally, given a metric space on vertices , with demand pairs $\s…
cs.DM2005★ 6 cited
Bidimensionality, Map Graphs, and Grid Minors
Erik D. Demaine, MohammadTaghi Hajiaghayi
In this paper we extend the theory of bidimensionality to two families of graphs that do not exclude fixed minors: map graphs and power graphs. In both cases we prove a polynomial…