Finding the edge connectivity of directed graphs. Yukon Chang , Susanne Hambrusch , and Janos Simon . On the computational complexity of continuous routing. Finding feasible paths for a two-point body. David Bernstein , Michael Rodeh , and Izidor Gertner .
Approximation algorithms for scheduling arithmetic expressions on pipelined machines.
Hypercube and shuffle-exchange algorithms for image component labeling. Yahya Ould Hamidoune , David Roeder , Steven Janke , Todd Feil , and Richard Koo . The probability of splitters in a list. Fast parallel and serial approximate string matching. Fast algorithms for direct enclosures and direct dominances.