- Using sparsification for parametric minimum spanning tree problems, FerSluEpp-NJC-96
- Controlling memory access concurrency in efficient fault-tolerant parallel algorithms, KanMicShv-NJC-95
- Approximation algorithms for the bottleneck stretch factor problem, NarSmi-NJC-02
- A new flexible algorithm for the longest common subsequence problem, Ric-NJC-95

Formerly known as BIT.