On the k-path partition of graphs
Theoretical Computer Science
Path partition for graphs with special blocks
Discrete Applied Mathematics
Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs
Theoretical Computer Science
Linear structure of bipartite permutation graphs and the longest path problem
Information Processing Letters
NP-hard graph problems and boundary classes of graphs
Theoretical Computer Science
Finding Hamiltonian circuits in quasi-adjoint graphs
Discrete Applied Mathematics
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
Longest Path Problems on Ptolemaic Graphs
IEICE - Transactions on Information and Systems
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
Boundary properties of graphs for algorithmic graph problems
Theoretical Computer Science
Contracting a chordal graph to a split graph or a tree
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Efficient algorithms for the longest path problem
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Hi-index | 0.06 |