Andreas Brandstädt, Dieter Kratsch. On the restriction of some NP-complete graph problems to permutation graphs. In Lothar Budach, editor, Fundamentals of Computation Theory, FCT 85, Cottbus, GDR, September 9-13, 1985. Volume 199 of Lecture Notes in Computer Science, pages 53-62, Springer, 1985.
Abstract is missing.