Disjoint paths in circular arc graphs
Nordic Journal of Computing
Powers of Geometric Intersection Graphs and Dispersion Algorithms
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Maintenance of a Percing Set for Intervals with Applications
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Powers of geometric intersection graphs and dispersion algorithms
Discrete Applied Mathematics - Special issue on stability in graphs and related topics
Solving the path cover problem on circular-arc graphs by using an approximation algorithm
Discrete Applied Mathematics
Approximating minimum coloring and maximum independent set in dotted interval graphs
Information Processing Letters
Improved approximation algorithms for connected sensor cover
Wireless Networks
From a Circular-Arc Model to a Proper Circular-Arc Model
Graph-Theoretic Concepts in Computer Science
Hadwiger's conjecture for proper circular arc graphs
European Journal of Combinatorics
Polynomial-time solvability of the maximum clique problem
ECC'09 Proceedings of the 3rd international conference on European computing conference
Solving the path cover problem on circular-arc graphs by using an approximation algorithm
Discrete Applied Mathematics
Approximating minimum coloring and maximum independent set in dotted interval graphs
Information Processing Letters
| Hi-index | 0.00 |