An incremental algorithm for a generalization of the shortest-path problem. Efficient parallel shortest-paths in digraphs with a separator decomposition. Hans L. Bodlaender and Ton Kloks . Efficient and constructive algorithms for the pathwidth and treewidth of graphs. References and Citations.
Approximation algorithms for network design problems on bounded sets.
J. A. Hoogeveen . Single-machine scheduling to minimize a function of two or three maximum cost criteria. Improved approximation algorithms for uniform connectivity problems. References, Citations, etc. Off-line maintenance of planar configurations.