The obnoxious center problem on weighted cactus graphs
Discrete Applied Mathematics - The 1st cologne-twente workshop on graphs and combinatorial optimization (CTW 2001)
Efficient algorithms for center problems in cactus networks
Theoretical Computer Science
The 2-radius and 2-radiian problems on trees
Theoretical Computer Science
Efficient algorithms for the weighted 2-center problem in a cactus graph
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Centdian computation for sensor networks
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
The connected p-center problem on block graphs with forbidden vertices
Theoretical Computer Science
Backup 2-center on interval graphs
Theoretical Computer Science
Hi-index | 0.90 |