A 2-approximation NC algorithm for connected vertex cover and tree cover
Information Processing Letters
What cannot be computed locally!
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Fast construction of overlay networks
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
The price of being near-sighted
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Maximizing throughput in wireless networks via gossiping
SIGMETRICS '06/Performance '06 Proceedings of the joint international conference on Measurement and modeling of computer systems
Distributed approximate matching
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
What can be approximated locally?: case study: dominating sets in planar graphs
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Improved distributed approximate matching
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
A log-star distributed maximal independent set algorithm for growth-bounded graphs
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Distributed weighted vertex cover via maximal matchings
ACM Transactions on Algorithms (TALG)
Distributed Approximation of Cellular Coverage
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
Distributed and parallel algorithms for weighted vertex cover and other covering problems
Proceedings of the 28th ACM symposium on Principles of distributed computing
IEEE/ACM Transactions on Networking (TON)
Local Algorithms: Self-stabilization on Speed
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Low-complexity distributed scheduling algorithms for wireless networks
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
Distributed fractional packing and maximum weighted b-matching via tail-recursive duality
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Low-complexity and distributed energy minimization in multihop wireless networks
IEEE/ACM Transactions on Networking (TON)
A new technique for distributed symmetry breaking
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Filtering: a method for solving graph problems in MapReduce
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Efficient distributed weighted matchings on trees
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Provider-customer coalitional games
IEEE/ACM Transactions on Networking (TON)
Distributed weighted vertex cover via maximal matchings
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Fast deterministic distributed maximal independent set computation on growth-bounded graphs
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Greedy sequential maximal independent set and matching are parallel on average
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
Stone age distributed computing
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Efficient parallel and external matching
Euro-Par'13 Proceedings of the 19th international conference on Parallel Processing
Information and Computation
| Hi-index | 0.89 |