We study the parameterized complexity of two families of problems: the bounded length disjoint paths problem and the bounded length cut problem. From Menger’s theorem both proble...
We study an NP-hard (and MaxSNP-hard) problem in trees--Multicommodity Demand Flow--dealing with demand flows between pairs of nodes and trying to maximize the value of the routed...
High-dimensional problems arising from robot motion planning, biology, data mining, and geographic information systems often require the computation of k nearest neighbor (knn) gr...
This paper presents a distributed algorithm for wireless adhoc networks that runs in polylogarithmic number of rounds in the size of the network and constructs a lightweight, line...
A frequently arising problem in computational geometry is when a physical structure, such as an ad-hoc wireless sensor network or a protein backbone, can measure local information...
Mihai Badoiu, Erik D. Demaine, Mohammad Taghi Haji...