We obtain the following results related to dynamic versions of the shortest-paths problem: (i) Reductions that show that the incremental and decremental singlesource shortest-paths...
Emerging large scale distributed networking systems, such as P2P file sharing systems, sensor networks, and ad hoc wireless networks, require replication of content, functionalit...
A weighted undirected network is ∆ growth-bounded if the number of nodes at distance 2r around any given node is at most ∆ times the number of nodes at distance r around the n...
This paper focuses on tractable instances of interval data minmax regret graph problems. More precisely, we provide polynomial and pseudopolynomial algorithms for sets of particul...
Abstract. Motion capture, a currently active research area, needs estimation of the pose of the subject. This requires a match between a model and the 3D shape, constructed using a...