Efficient algorithms for center problems in cactus networks
Theoretical Computer Science
Treewidth: structure and algorithms
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
On graph thickness, geometric thickness, and separator theorems
Computational Geometry: Theory and Applications
A new template for solving p-median problems for trees in sub-quadratic time
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Backup 2-center on interval graphs
Theoretical Computer Science
Complexity results for the p-median problem with mutual communication
Operations Research Letters
Hi-index | 0.00 |