A linear time recognition algorithm for proper interval graphs
Information Processing Letters
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
A polynomial solution to the k-fixed-endpoint path cover problem on proper interval graphs
Theoretical Computer Science
Efficient algorithms for the longest path problem
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
| Hi-index | 0.90 |