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
Jump number maximization for proper interval graphs and series-parallel graphs
Information Sciences: an International Journal
The longest path problem is polynomial on cocomparability graphs
WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
Efficient algorithms for the longest path problem
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Parameterized domination in circle graphs
WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
Parameterized Domination in Circle Graphs
Theory of Computing Systems
Hi-index | 0.89 |