An O(nlogn) algorithm for finding minimal path cover in circular-arc graphs
CSC '93 Proceedings of the 1993 ACM conference on Computer science
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
On the k-path partition of graphs
Theoretical Computer Science
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
On the k-path cover problem for cacti
Theoretical Computer Science
The approximability of the weighted Hamiltonian path completion problem on a tree
Theoretical Computer Science
Finding a minimum path cover of a distance-hereditary graph in polynomial time
Discrete Applied Mathematics
Note: The harmonious coloring problem is NP-complete for interval and permutation graphs
Discrete Applied Mathematics
Necessary Condition for Path Partitioning Constraints
CPAIOR '07 Proceedings of the 4th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
The 2-Terminal-Set Path Cover Problem and Its Polynomial Solution on Cographs
FAW '08 Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics
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
A polynomial solution to the k-fixed-endpoint path cover problem on proper interval graphs
Theoretical Computer Science
The longest path problem is polynomial on cocomparability graphs
WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
A polynomial time algorithm for longest paths in biconvex graphs
WALCOM'11 Proceedings of the 5th international conference on WALCOM: algorithms and computation
An efficient exact algorithm for the minimum ultrametric tree problem
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
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
Path covering number and L(2,1)-labeling number of graphs
Discrete Applied Mathematics
Computing and counting longest paths on circular-arc graphs in polynomial time
Discrete Applied Mathematics
| Hi-index | 0.90 |