Fast distributed construction of k-dominating sets and applications
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Approximation algorithms for facility location problems (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Efficient algorithms for geometric optimization
ACM Computing Surveys (CSUR)
A constant-factor approximation algorithm for the k-median problem (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Data collection for the Sloan Digital Sky Survey—a network-flow heuristic
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Exact and approximation algorithms for clustering
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
A constant-factor approximation algorithm for the k-median problem
Journal of Computer and System Sciences - STOC 1999
An efficient distributed algorithm for constructing small dominating sets
Distributed Computing - Special issue: Selected papers from PODC '01
Primal-Dual Approximation Algorithms for Metric Facility Location and k-Median Problems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Journal of Parallel and Distributed Computing
A distributed algorithm to find k-dominating sets
Discrete Applied Mathematics - Brazilian symposium on graphs, algorithms and combinatorics
Fixed-parameter algorithms for (k, r)-center in planar graphs and map graphs
ACM Transactions on Algorithms (TALG)
An exact algorithm for the capacitated vertex p-center problem
Computers and Operations Research
Minimum Cost Wireless Broadband Overlay Network Planning
WOWMOM '06 Proceedings of the 2006 International Symposium on on World of Wireless, Mobile and Multimedia Networks
Achieving anonymity via clustering
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
k-Center problems with minimum coverage
Theoretical Computer Science
Distributed approximation of capacitated dominating sets
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Parameterized Complexity for Domination Problems on Degenerate Graphs
Graph-Theoretic Concepts in Computer Science
On hierarchical traffic grooming in WDM networks
IEEE/ACM Transactions on Networking (TON)
An exact algorithm for the capacitated vertex p-center problem
Computers and Operations Research
Fixed-parameter algorithms for the (k, r)-center in planar graphs and map graphs
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Placing and maintaining a core node in wireless ad hoc sensor networks
NETWORKING'07 Proceedings of the 6th international IFIP-TC6 conference on Ad Hoc and sensor networks, wireless networks, next generation internet
Achieving anonymity via clustering
ACM Transactions on Algorithms (TALG)
Delay monitoring for wireless sensor networks: an architecture using air sniffers
MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
Star-block design in two-level survivable optical networks
IEEE/ACM Transactions on Networking (TON)
The south zone: distributed algorithms for alliances
SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
Distributed routing in tree networks with few landmarks
CAAN'06 Proceedings of the Third international conference on Combinatorial and Algorithmic Aspects of Networking
Optimal broadcast domination of arbitrary graphs in polynomial time
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Computer Science Review
The fault tolerant capacitated k-center problem
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
| Hi-index | 0.00 |