{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T05:51:24Z","timestamp":1782971484911,"version":"3.54.5"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540877783","type":"print"},{"value":"9783540877790","type":"electronic"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-87779-0_6","type":"book-chapter","created":{"date-parts":[[2008,9,22]],"date-time":"2008-09-22T05:17:14Z","timestamp":1222060634000},"page":"78-92","source":"Crossref","is-referenced-by-count":67,"title":["Fast Distributed Approximations in Planar Graphs"],"prefix":"10.1007","author":[{"given":"Andrzej","family":"Czygrinow","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michal","family":"Ha\u0144\u0107kowiak","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wojciech","family":"Wawrzyniak","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Goldberg, A.V., Luby, M., Plotkin, S.A.: Network Decomposition and Locality in Distributed Computation. In: Proc. 30th IEEE Symp. on Foundations of Computer Science, pp. 364\u2013369 (1989)","DOI":"10.1109\/SFCS.1989.63504"},{"key":"6_CR2","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/S0019-9958(86)80023-7","volume":"70","author":"R. Cole","year":"1986","unstructured":"Cole, R., Vishkin, U.: Deterministic coin tossing with applications to optimal parallel list ranking. Information and Control\u00a070, 32\u201353 (1986)","journal-title":"Information and Control"},{"key":"6_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/11841036_24","volume-title":"Algorithms \u2013 ESA 2006","author":"A. Czygrinow","year":"2006","unstructured":"Czygrinow, A., Ha\u0144\u0107kowiak, M.: Distributed almost exact approximations for minor-closed families. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol.\u00a04168, pp. 244\u2013255. Springer, Heidelberg (2006)"},{"key":"6_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"534","DOI":"10.1007\/11864219_27","volume-title":"Distributed Computing","author":"A. Czygrinow","year":"2006","unstructured":"Czygrinow, A., Ha\u0144\u0107kowiak, M.: Distributed approximation algorithms in unit disc graphs. In: Dolev, S. (ed.) DISC 2006. LNCS, vol.\u00a04167, pp. 534\u2013536. Springer, Heidelberg (2006)"},{"issue":"4","key":"6_CR5","doi-asserted-by":"publisher","first-page":"588","DOI":"10.1016\/j.jda.2005.07.006","volume":"4","author":"A. Czygrinow","year":"2006","unstructured":"Czygrinow, A., Ha\u0144\u0107kowiak, M.: Distributed algorithms for weighted problems in sparse graphs. Journal of Discrete Algorithms\u00a04(4), 588\u2013607 (2006)","journal-title":"Journal of Discrete Algorithms"},{"key":"6_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1007\/11758471_29","volume-title":"Algorithms and Complexity","author":"A. Czygrinow","year":"2006","unstructured":"Czygrinow, A., Ha\u0144\u0107kowiak, M., Szymanska, E.: Distributed approximation approximations for planar graphs. In: Calamoneri, T., Finocchi, I., Italiano, G.F. (eds.) CIAC 2006. LNCS, vol.\u00a03998, pp. 296\u2013307. Springer, Heidelberg (2006)"},{"key":"6_CR7","volume-title":"Graph Theory","author":"R. Diestel","year":"2005","unstructured":"Diestel, R.: Graph Theory, 3rd edn. Springer, Heidelberg (2005)","edition":"3"},{"issue":"4","key":"6_CR8","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1145\/1054916.1054931","volume":"35","author":"M. Elkin","year":"2004","unstructured":"Elkin, M.: An Overview of Distributed Approximation. ACM SIGACT News Distributed Computing Column\u00a035(4), 132, 40\u201357 (2004)","journal-title":"ACM SIGACT News Distributed Computing Column"},{"key":"6_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/11561927_21","volume-title":"Distributed Computing","author":"F. Kuhn","year":"2005","unstructured":"Kuhn, F., Moscibroda, T., Nieberg, T., Wattenhofer, R.: Fast Deterministic Distributed Maximal Independent Set Computation on Growth-Bounded Graphs. In: Fraigniaud, P. (ed.) DISC 2005. LNCS, vol.\u00a03724. Springer, Heidelberg (2005)"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Kuhn, F., Moscibroda, T., Nieberg, T., Wattenhofer, R.: Local Approximation Schemes for Ad Hoc and Sensor Networks. In: 3rd ACM Joint Workshop on Foundations of Mobile Computing (DIALM-POMC), Cologne, Germany (2005)","DOI":"10.1145\/1080810.1080827"},{"key":"6_CR11","unstructured":"Lenzen, C., Wattenhofer, R.: Leveraging Linial\u2019s Locality Limit. In: 22nd International Symposium on Distributed Computing (DISC 2008), Arcachon, France (to appear, 2008)"},{"issue":"1","key":"6_CR12","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1137\/0221015","volume":"21","author":"N. Linial","year":"1992","unstructured":"Linial, N.: Locality in distributed graph alogrithms. SIAM Journal on Computing\u00a021(1), 193\u2013201 (1992)","journal-title":"SIAM Journal on Computing"},{"key":"6_CR13","first-page":"1331","volume-title":"Handbook of Combinatorics","author":"J. Nesetril","year":"1995","unstructured":"Nesetril, J.: Ramsey Theory. In: Graham, R.L., Groschel, M., Lov\u00e1sz, L. (eds.) Handbook of Combinatorics, vol.\u00a0II, pp. 1331\u20131403. Elsevier, Amsterdam (1995)"},{"key":"6_CR14","unstructured":"Panconesi, A.: Distributed Algorithms Notes (manuscript)"},{"key":"6_CR15","doi-asserted-by":"crossref","unstructured":"Peleg, D.: Distributed Algorithms, A Locality-Sensitive Approach. SIAM Press, Philadelphia (2000)","DOI":"10.1137\/1.9780898719772"},{"key":"6_CR16","unstructured":"West, D.: Introduction to graph theory, 2nd edn. Penitence-Hall Inc (2001)"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-87779-0_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,4]],"date-time":"2024-05-04T04:08:24Z","timestamp":1714795704000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-87779-0_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540877783","9783540877790"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-87779-0_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008]]}}}