1. The Rectilinear Steiner Tree Problem is $NP$-Complete
2. On vertex-induced forests in cubic graphs. Proceedings of the 5th South East Conference on Combinatorics, Graph Theory, and Computing (1974) 501–512.
3. and , Some further approximation algorithms for the vertex cover problem. Proceedings of the 8th Colloquium on Trees in Algebra and Programming (1983) 341–349.
4. A new proof and generalizations of a theorem of Erdős and Pósa on graphs withoutk+1 independent circuits
5. Bounds on feedback vertex sets of undirected cubic graphs. Coll. Math. Soc. Janos Bolyai 42. Algebra, Combinatorics and Logic in Computer Science (1983) 719–729.