A. Dessmark, A. Lingas and A. Proskurowski. Faster Algorithms for Subgraph Isomorphism of Partial k-Trees. 1999 K. Diks, A. Lingas and A. Pelc. An Optimal Algorithm for Broadcasting Multiple Messages in Trees. S.R. Arikati, A. Dessmark, A. Lingas and M. Marathe.
Approximation algorithms for maximum two-dimensional pattern matching.
Accepted for publication in Theoretical Computer Science. A. Dessmark, C. Dorgerloh, A. Lingas and J. Wirtgen. Ultrafast Randomized Parallel Construction and Approximation Algorithms for Spanning Forests in Dense Graphs. A chapter in the book Advances in Randomized Parallel Computing, Kluwer Academic Publishers, Dordrecht, 1999. Minimum Spanning Trees in d Dimensions.