Information Processing Letters
An Approximate Algorithm for the Weighted Hamiltonian Path Completion Problem on a Tree
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
A linear algorithm for the Hamiltonian completion number of the line graph of a cactus
Discrete Applied Mathematics - The 1st cologne-twente workshop on graphs and combinatorial optimization (CTW 2001)
Path partition for graphs with special blocks
Discrete Applied Mathematics
Solving the path cover problem on circular-arc graphs by using an approximation algorithm
Discrete Applied Mathematics
The approximability of the weighted Hamiltonian path completion problem on a tree
Theoretical Computer Science
Proof that pyramid networks are 1-Hamiltonian-connected with high probability
Information Sciences: an International Journal
Finding a minimum path cover of a distance-hereditary graph in polynomial time
Discrete Applied Mathematics
Node-searching problem on block graphs
Discrete Applied Mathematics
Optimal vertex ranking of block graphs
Information and Computation
Solving the path cover problem on circular-arc graphs by using an approximation algorithm
Discrete Applied Mathematics
Path covering number and L(2,1)-labeling number of graphs
Discrete Applied Mathematics
| Hi-index | 5.23 |