Deterministic coin tossing with applications to optimal parallel list ranking
Information and Control
Locality in distributed graph algorithms
SIAM Journal on Computing
A faster distributed algorithm for computing maximal matchings deterministically
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Distributed computing: a locality-sensitive approach
Distributed computing: a locality-sensitive approach
Distributed approximation: a survey
ACM SIGACT News
Local approximation schemes for ad hoc and sensor networks
DIALM-POMC '05 Proceedings of the 2005 joint workshop on Foundations of mobile computing
Distributed almost exact approximations for minor-closed families
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Network decomposition and locality in distributed computation
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Distributed approximation algorithms for planar graphs
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
Distributed approximation algorithms in unit-disk graphs
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Fast deterministic distributed maximal independent set computation on growth-bounded graphs
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Distributed approximations for packing in unit-disk graphs
DISC'07 Proceedings of the 21st international conference on Distributed Computing
Distributed approximation algorithms for weighted problems in minor-closed families
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
Distributed and parallel algorithms for weighted vertex cover and other covering problems
Proceedings of the 28th ACM symposium on Principles of distributed computing
Brief announcement: a local approximation algorithm for MDS problem in anonymous planar networks
Proceedings of the 2013 ACM symposium on Principles of distributed computing
| Hi-index | 0.00 |
We give an efficient distributed algorithm that finds an almost optimal packing of a graph H in a planar graph G. The algorithm is deterministic and its running time is poly-logarithmic in the order of G.