An O(n2 log n) algorithm for the Hamiltonian cycle problem on circular-arc graphs

An O(nlogn) algorithm for finding minimal path cover in circular-arc graphs

CSC '93 Proceedings of the 1993 ACM conference on Computer science

A linear time recognition algorithm for proper interval graphs

Information Processing Letters

An efficient parallel strategy for the two-fixed-endpoint Hamiltonian path problem on distance-hereditary graphs

Journal of Parallel and Distributed Computing

Solving the path cover problem on circular-arc graphs by using an approximation algorithm

Discrete Applied Mathematics

Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs

Theoretical Computer Science

Solving the path cover problem on circular-arc graphs by using an approximation algorithm

Discrete Applied Mathematics

Jump number maximization for proper interval graphs and series-parallel graphs

Information Sciences: an International Journal

Certifying algorithms for the path cover and related problems on interval graphs

ICCSA'10 Proceedings of the 2010 international conference on Computational Science and Its Applications - Volume Part II

Computing and counting longest paths on circular-arc graphs in polynomial time

Discrete Applied Mathematics