An O(nlogn) algorithm for finding minimal path cover in circular-arc graphs
CSC '93 Proceedings of the 1993 ACM conference on Computer science
Linear Time Algorithms for Hamiltonian Problems on (Claw, Net)-Free Graphs
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
An efficient parallel algorithm for scheduling interval ordered tasks
Journal of Complexity
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
A simple algorithm to find Hamiltonian cycles in proper interval graphs
Information Processing Letters
Solving the path cover problem on circular-arc graphs by using an approximation algorithm
Discrete Applied Mathematics
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
| Hi-index | 0.89 |