{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,2]],"date-time":"2026-02-02T20:07:50Z","timestamp":1770062870971,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540427070","type":"print"},{"value":"9783540454779","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45477-2_19","type":"book-chapter","created":{"date-parts":[[2007,8,16]],"date-time":"2007-08-16T07:09:01Z","timestamp":1187248141000},"page":"201-216","source":"Crossref","is-referenced-by-count":7,"title":["Small k-Dominating Sets in Planar Graphs with Applications"],"prefix":"10.1007","author":[{"given":"Cyril","family":"Gavoille","sequence":"first","affiliation":[]},{"given":"David","family":"Peleg","sequence":"additional","affiliation":[]},{"given":"Andr\u00e9","family":"Raspaud","sequence":"additional","affiliation":[]},{"given":"Eric","family":"Sopena","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,10,2]]},"reference":[{"key":"19_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(97)00228-4","volume":"209","author":"H. L. Bodlaender","year":"1998","unstructured":"Hans Leo Bodlaender. A partial k-arboretum of graphs with bounded treewidth. Theoretical Computer Science, 209:1\u201345, 1998.","journal-title":"Theoretical Computer Science"},{"key":"19_CR2","unstructured":"Victor Chepoi and Yann Vaxes. On covering bridged plane triangulations with balls. Manuscript submitted, 2000."},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"Reinhard Diestel. Graph Theory (second edition), volume 173 of Graduate Texts in Mathematics. Springer, February 2000.","DOI":"10.1007\/978-3-662-53622-3_7"},{"key":"19_CR4","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/s004530010020","volume":"27","author":"D. Eppstein","year":"2000","unstructured":"David Eppstein. Diameter and treewidth in minor-closed graph families. Algorithmica, 27:275\u2013291, 2000.","journal-title":"Algorithmica"},{"issue":"1","key":"19_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1093\/comjnl\/43.1.1","volume":"43","author":"C. Gavoille","year":"2000","unstructured":"Cyril Gavoille. On the dilation of interval routing. The Computer Journal, 43(1):1\u20137, 2000.","journal-title":"The Computer Journal"},{"issue":"2","key":"19_CR6","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/S0304-3975(99)00283-2","volume":"245","author":"C. Gavoille","year":"2000","unstructured":"Cyril Gavoille. A survey on interval routing. Theoretical Computer Science, 245(2):217\u2013253, 2000.","journal-title":"Theoretical Computer Science"},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"Cyril Gavoille, Michal Katz, Nir A. Katz, Christophe Paul, and David Peleg. Approximate distance labeling schemes. In 9th Annual European Symposium on Algorithms (ESA), volume Lectures Notes in Computer Science. Springer, August 2001. To appear.","DOI":"10.1007\/3-540-44676-1_40"},{"issue":"4","key":"19_CR8","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1137\/S0895480197328631","volume":"12","author":"C. Gavoille","year":"1999","unstructured":"Cyril Gavoille and David Peleg. The compactness of interval routing. SIAM Journal on Discrete Mathematics, 12(4):459\u2013473, October 1999.","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"19_CR9","unstructured":"Cyril Gavoille, David Peleg, Andr\u00e9 Raspaud, and Eric Sopena. Small k-dominating sets in planar graphs with applications. Research Report RR-1258-01, LaBRI, University of Bordeaux, 351, cours de la Lib\u00e9ration, 33405 Talence Cedex, France, May 2001."},{"issue":"1\u20132","key":"19_CR10","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/S0304-3975(98)00042-5","volume":"234","author":"R. Kr\u00e1\u013eovi\u010d","year":"2000","unstructured":"Rastislav Kr\u00e1\u013eovi\u010d, Peter Ru\u017ei\u010dka, and Daniel \u0160tefankovi\u010d. The complexity of shortest path and dilation bounded interval routing. Theoretical Computer Science, 234(1\u20132):85\u2013107, 2000.","journal-title":"Theoretical Computer Science"},{"key":"19_CR11","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1016\/0012-365X(75)90058-8","volume":"13","author":"L. Lov\u00e1sz","year":"1975","unstructured":"Laszlo Lov\u00e1sz. On the ratio of optimal integral and fractional covers. Discrete Mathematics, 13:383\u2013390, 1975.","journal-title":"Discrete Mathematics"},{"issue":"3","key":"19_CR12","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1002\/(SICI)1097-0118(199607)22:3<213::AID-JGT2>3.0.CO;2-P","volume":"22","author":"G. MacGillivray","year":"1996","unstructured":"G. MacGillivray and K. Seyffarth. Domination numbers of planar graphs. Journal of Graph Theory, 22(3):213\u2013229, 1996.","journal-title":"Journal of Graph Theory"},{"key":"19_CR13","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/0196-6774(86)90023-4","volume":"7","author":"N. Robertson","year":"1986","unstructured":"Neil Robertson and Paul D. Seymour. Graph minors. II. Algorithmic aspects of tree-width. Journal of Algorithms, 7:309\u2013322, 1986.","journal-title":"Journal of Algorithms"},{"issue":"1","key":"19_CR14","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1093\/comjnl\/28.1.5","volume":"28","author":"N. Santoro","year":"1985","unstructured":"Nicola Santoro and Ramez Khatib. Labelling and implicit routing in networks. The Computer Journal, 28(1):5\u20138, February 1985.","journal-title":"The Computer Journal"},{"key":"19_CR15","unstructured":"Savio S. H. Tse and Francis C. M. Lau. An optimal lower bound for interval routing in general networks. In 4th International Colloquium on Structural Information & Communication Complexity (SIROCCO), pages 112\u2013124. Carleton Scientific, July 1997."},{"key":"19_CR16","unstructured":"Savio S. H. Tse and Francis C. M. Lau. Some results on the space requirement of interval routing. In 6th International Colloquium on Structural Information & Communication Complexity (SIROCCO), pages 264\u2013279. Carleton Scientific, July 1999."},{"issue":"4","key":"19_CR17","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1093\/comjnl\/30.4.298","volume":"30","author":"J. Leeuwen van","year":"1987","unstructured":"Jan van Leeuwen and Richard B. Tan. Interval routing. The Computer Journal, 30(4):298\u2013307, 1987.","journal-title":"The Computer Journal"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45477-2_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T00:27:00Z","timestamp":1556756820000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45477-2_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540427070","9783540454779"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-45477-2_19","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2001]]}}}