Volume 237, Numbers 1-2, 28 April 2000
Bruno Courcelle:
The monadic second-order logic of graphs XII: planar graphs and planar maps.
1-32
Yongge Wang:
Resource bounded randomness and computational complexity.
33-55
Niculae Mandache:
On the computational power of context-free PC grammar systems.
135-148
Siu-Wing Cheng:
The Steiner tree problem for terminals on the boundary of a rectilinear polygon.
213-238
Chung Keung Poon:
A space lower bound for st-connectivity on node-named JAGs.
327-345
U. K. Sarkar:
On the design of a constructive algorithm to solve the multi-peg towers of Hanoi problem.
407-421
Alexander Meduna:
Terminating left-hand sides of scattered context productions M. Nivat.
423-427
Gonzalo Navarro:
Improved approximate pattern matching on hypertext.
455-463
data released under the ODC-BY 1.0 license
