{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T09:35:01Z","timestamp":1758274501616},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540310006"},{"type":"electronic","value":"9783540314684"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11604686_16","type":"book-chapter","created":{"date-parts":[[2005,12,5]],"date-time":"2005-12-05T15:02:01Z","timestamp":1133794921000},"page":"175-186","source":"Crossref","is-referenced-by-count":0,"title":["Induced Subgraphs of Bounded Degree and Bounded Treewidth"],"prefix":"10.1007","author":[{"given":"Prosenjit","family":"Bose","sequence":"first","affiliation":[]},{"given":"Vida","family":"Dujmovi\u0107","sequence":"additional","affiliation":[]},{"given":"David R.","family":"Wood","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"16_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1007\/3-540-36136-7_37","volume-title":"Algorithms and Computation","author":"T Biedl","year":"2002","unstructured":"Biedl, T., Wilkinson, D.F.: Bounded-degree independent sets in planar graphs. In: Bose, P., Morin, P. (eds.) ISAAC 2002. LNCS, vol.\u00a02518, pp. 416\u2013427. Springer, Heidelberg (2002)"},{"issue":"1-2","key":"16_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(97)00228-4","volume":"209","author":"H.L. Bodlaender","year":"1998","unstructured":"Bodlaender, H.L.: A partial k-arboretum of graphs with bounded treewidth. Theoret. Comput. Sci.\u00a0209(1-2), 1\u201345 (1998)","journal-title":"Theoret. Comput. Sci."},{"issue":"1-3","key":"16_CR3","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/j.disc.2003.12.003","volume":"282","author":"P. Bose","year":"2004","unstructured":"Bose, P., Smid, M., Wood, D.R.: Light edges in degree-constrained graphs. Discrete Math.\u00a0282(1-3), 35\u201341 (2004)","journal-title":"Discrete Math."},{"key":"16_CR4","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/BF02992776","volume":"25","author":"G.A. Dirac","year":"1961","unstructured":"Dirac, G.A.: On rigid circuit graphs. Abh. Math. Sem. Univ. Hamburg\u00a025, 71\u201376 (1961)","journal-title":"Abh. Math. Sem. Univ. Hamburg"},{"key":"16_CR5","volume-title":"Algorithms in Combinatorial Geometry","author":"H. Edelsbrunner","year":"1988","unstructured":"Edelsbrunner, H.: Algorithms in Combinatorial Geometry. Springer, Heidelberg (1988)"},{"issue":"1","key":"16_CR6","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1137\/0212002","volume":"12","author":"D. Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, D.: Optimal search in planar subdivisions. SIAM J. Comput.\u00a012(1), 28\u201335 (1983)","journal-title":"SIAM J. Comput."},{"key":"16_CR7","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/0-387-22444-0_4","volume-title":"Recent Advances in Algorithms and Combinatorics","author":"B.A. Reed","year":"2003","unstructured":"Reed, B.A.: Algorithmic aspects of tree width. In: Reed, B.A., Sales, C.L. (eds.) Recent Advances in Algorithms and Combinatorics, pp. 85\u2013107. Springer, Heidelberg (2003)"},{"key":"16_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/3-540-63397-9_35","volume-title":"Algorithms - ESA \u201997","author":"J. Snoeyink","year":"1997","unstructured":"Snoeyink, J., van Kreveld, M.: Linear-time reconstruction of Delaunay triangulations with applications. In: Burkard, R.E., Woeginger, G.J. (eds.) ESA 1997. LNCS, vol.\u00a01284, pp. 459\u2013471. Springer, Heidelberg (1997)"}],"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\/11604686_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:04:18Z","timestamp":1619507058000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11604686_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540310006","9783540314684"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/11604686_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}