Kuhn, F., Wattenhofer, R.: On the complexity of distributed graph coloring. In: Proc. 25th ACM Symp. Principles Distrib. Comput. (PODC), pp. 7–15 (2006)
Kutten, S., Peleg, D.: Tight fault locality. SIAM J. Comput. 30(1), 247–268 (electronic) (2000)
Lenzen, C., Oswald, Y., Wattenhofer, R.: What can be approximated locally?: case study: dominating sets in planar graphs. In: Proc. 20th ACM Symp. Parallelism Algo. Archit. (SPAA), pp. 46–54 (2008)
Linial, N.: Distributive graph algorithms global solutions from local data. In: Proc. 28th IEEE Symp. Found. Comput. Sci. (FOCS), pp. 331–335 (1987)
Linial, N.: Locality in distributed graph algorithms. SIAM J. Comput. 21, 193 (1992)
Lotker, Z., Patt-Shamir, B., Rosén, A.: Distributed approximate matching. SIAM J. Comput. 39(2), 445–460 (2009)
Luby, M.: A simple parallel algorithm for the maximal independent set problem. SIAM J. Comput. 15, 1036–1053 (1986)
Nakano, K., Olariu, S.: Uniform leader election protocols for radio networks. IEEE Trans. Parallel Distrib. Syst. 13(5), 516–526 (2002)
Naor, M., Stockmeyer, L.: What can be computed locally? SIAM J. Comput. 24(6), 1259–1277 (1995)
Panconesi, A., Rizzi, R.: Some simple distributed algorithms for sparse networks. Distrib. Comput. 14, 97–100 (2001)
Panconesi, A., Srinivasan, A.: On the complexity of distributed network decomposition. J. Algorithms 20(2), 356–374 (1996)
Peleg, D.: Distributed computing. A locality-sensitive approach. SIAM Monographs on Discrete Mathematics and Applications, 5. Philadelphia, PA: SIAM, Society for Industrial and Applied Mathematics. xvi, 343 p. (2000)
Schneider, J., Wattenhofer, R.: A new technique for distributed symmetry breaking. In: Proc. 29th ACM Symp. Principles Distrib. Comput. (PODC), pp. 257–266 (2010)
Schneider, J., Wattenhofer, R.: An optimal maximal independent set algorithm for bounded-independence graphs. Distrib. Comput. 22(5-6), 1–13 (2010)
Szegedy, M., Vishwanathan, S.: Locality based graph coloring. In: Proc. 25th ACM Symp. Theor. Comput. (STOC), pp. 201–207 (1993)