Approximation algorithms for the 0-extension problem
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Efficient location area planning for personal communication systems
Proceedings of the 9th annual international conference on Mobile computing and networking
Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width
Journal of Algorithms
Correlation clustering in general weighted graphs
Theoretical Computer Science - Approximation and online algorithms
Efficient location area planning for personal communication systems
IEEE/ACM Transactions on Networking (TON)
Note: A simple algorithm for multicuts in planar graphs with outer terminals
Discrete Applied Mathematics
Disjoint paths in sparse graphs
Discrete Applied Mathematics
Approximating a class of classification problems
Efficient Approximation and Online Algorithms
Sparse WiFi deployment for vehicular internet access with bounded interconnection gap
IEEE/ACM Transactions on Networking (TON)
Maximum edge-disjoint paths in k-sums of graphs
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
| Hi-index | 0.89 |