Discrete Applied Mathematics

A perspective on certain polynomial-time solvable classes of satisfiability
pp. 177-214(38)
Authors: Franco J.; Van Gelder A.

On the stable set problem in special P₅-free graphs
pp. 215-224(10)
Authors: Gerber M.U.; Lozin V.V.

Superdominance order and distance of trees with bounded maximum degree
pp. 225-233(9)
Authors: Jelen F.; Triesch E.

The complexity of compressing subsegments of images described by finite automata
pp. 235-254(20)
Authors: Karhumaki J.; Plandowski W.; Rytter W.

Connectivity of iterated line graphs
pp. 255-266(12)
Authors: Knor M.; Niepel L.

Approximating minimum size {1,2}-connected networks
pp. 267-288(22)
Author: Krysta P.

Opacity of a finite automaton, method of calculation and the Ising chain
pp. 289-318(30)
Author: Yao J.-Y.

Author Index
pp. 319-319(1)