New approximation techniques for some ordering problems
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Divide-and-conquer approximation algorithms via spreading metrics
Journal of the ACM (JACM)
An optimal parallel algorithm for all-pairs shortest paths on unweighted interval graphs
Nordic Journal of Computing
Selecting forwarding neighbors in wireless ad hoc networks
Mobile Networks and Applications - Discrete algorithms and methods for mobile computing and communications
l22 spreading metrics for vertex ordering problems
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
On the independent dominating set polytope
European Journal of Combinatorics
Fast algorithms for identifying maximal common connected sets of interval graphs
Discrete Applied Mathematics
Information Processing Letters
The LBFS Structure and Recognition of Interval Graphs
SIAM Journal on Discrete Mathematics
INTEGRA: fast multi-bit flip-flop clustering for clock power saving based on interval graphs
Proceedings of the 2011 international symposium on Physical design
Power domination problem in graphs
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Lexicographic breadth first search – a survey
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
The stable set problem and the thinness of a graph
Operations Research Letters
Algorithms for interval structures with applications
Theoretical Computer Science
Domatic partition in homogeneous wireless sensor networks
Journal of Network and Computer Applications
| Hi-index | 0.89 |