Peter Damaschke The Hamiltonian Circuit Problem for Circle Graphs is NP-Complete. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1989, v:32, n:1, pp:1-2 [Journal]

A. Prasad Sistla On Verifying that a Concurrent Program Satisfies a Nondeterministic Specification. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1989, v:32, n:1, pp:17-23 [Journal]

Kazuo Iwano An Improvement of Goldberg, Plotkin and Vaidya's Maximal Node-Disjoint Paths Algorithm. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1989, v:32, n:1, pp:25-27 [Journal]