{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T01:52:51Z","timestamp":1772502771249,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540390985","type":"print"},{"value":"9783540391012","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11847250_14","type":"book-chapter","created":{"date-parts":[[2006,9,13]],"date-time":"2006-09-13T11:43:02Z","timestamp":1158147782000},"page":"154-165","source":"Crossref","is-referenced-by-count":38,"title":["Parameterized Complexity of Independence and Domination on Geometric Graphs"],"prefix":"10.1007","author":[{"given":"D\u00e1niel","family":"Marx","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"3-4","key":"14_CR1","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/S0925-7721(98)00028-5","volume":"11","author":"P.K. Agarwal","year":"1998","unstructured":"Agarwal, P.K., van Kreveld, M., Suri, S.: Label placement by maximum independent set in rectangles. Comput. Geom.\u00a011(3-4), 209\u2013218 (1998)","journal-title":"Comput. Geom."},{"key":"14_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/11847250_15","volume-title":"Parameterized and Exact Computation","author":"J. K\u00e1ra","year":"2006","unstructured":"K\u00e1ra, J., Kratochv\u00edl, J.: Fixed Parameter Tractability of Independent Set in Segment Intersection Graphs. In: Bodlaender, H.L., Langston, M.A. (eds.) IWPEC 2006. LNCS, vol.\u00a04169, pp. 166\u2013174. Springer, Heidelberg (2006)"},{"key":"14_CR3","unstructured":"Malesi\u0144ska, E.: Graph-Theoretical Models for Frequency Assignment Problems. PhD thesis, Technical University of Berlin (1997)"},{"key":"14_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1007\/11561071_41","volume-title":"Algorithms \u2013 ESA 2005","author":"D. Marx","year":"2005","unstructured":"Marx, D.: Efficient approximation schemes for geometric problems? In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol.\u00a03669, pp. 448\u2013459. Springer, Heidelberg (2005)"},{"issue":"6","key":"14_CR5","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/0020-0190(88)90174-3","volume":"28","author":"D.W. Wang","year":"1988","unstructured":"Wang, D.W., Kuo, Y.-S.: A study on two geometric location problems. Inform. Process. Lett.\u00a028(6), 281\u2013286 (1988)","journal-title":"Inform. Process. Lett."}],"container-title":["Lecture Notes in Computer Science","Parameterized and Exact Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11847250_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:18:39Z","timestamp":1619493519000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11847250_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540390985","9783540391012"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/11847250_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}