{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,7]],"date-time":"2025-08-07T08:55:31Z","timestamp":1754556931327},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540390985"},{"type":"electronic","value":"9783540391012"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11847250_15","type":"book-chapter","created":{"date-parts":[[2006,9,13]],"date-time":"2006-09-13T11:43:02Z","timestamp":1158147782000},"page":"166-174","source":"Crossref","is-referenced-by-count":6,"title":["Fixed Parameter Tractability of Independent Set in Segment Intersection Graphs"],"prefix":"10.1007","author":[{"given":"Jan","family":"K\u00e1ra","sequence":"first","affiliation":[]},{"given":"Jan","family":"Kratochv\u00edl","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"15_CR1","volume-title":"Topics in Discrete Mathematics (Dedicated to Jarik Ne\u0161et\u0159il on the occasion of his 60th birthday)","author":"J. Bang-Jensen","year":"2006","unstructured":"Bang-Jensen, J., Reed, B., Schacht, M., \u0160\u00e1mal, R., Toft, B., Wagner, U.: On six problems posed by Jarik Ne\u0161et\u0159il. In: Klazar, M., Kratochvil, J., Loebl, M., Matousek, J., Valtr, P., Thomas, R. (eds.) Topics in Discrete Mathematics (Dedicated to Jarik Ne\u0161et\u0159il on the occasion of his 60th birthday). Springer, Heidelberg (to appear, 2006)"},{"key":"15_CR2","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","volume":"13","author":"K.S. Booth","year":"1976","unstructured":"Booth, K.S., Lueker, G.S.: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms. J. Comput. Syst. Sci.\u00a013, 335\u2013379 (1976)","journal-title":"J. Comput. Syst. Sci."},{"key":"15_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parametrized Complexity","author":"R.G. Downey","year":"1999","unstructured":"Downey, R.G., Fellows, M.R.: Parametrized Complexity. Springer, Heidelberg (1999)"},{"key":"15_CR4","volume-title":"Computers and Intractability. A Guide to the Theory of NP-Completeness","author":"M. Garey","year":"1979","unstructured":"Garey, M., Johnson, D.: Computers and Intractability. A Guide to the Theory of NP-Completeness. Harry Freeman, New York (1979)"},{"key":"15_CR5","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/0166-218X(94)90143-0","volume":"52","author":"J. Kratochv\u00edl","year":"1994","unstructured":"Kratochv\u00edl, J.: A special planar satisfiability problem and a consequence of its NP\u2013completeness. Discrete Appl. Math.\u00a052, 233\u2013252 (1994)","journal-title":"Discrete Appl. Math."},{"key":"15_CR6","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1006\/jctb.1994.1071","volume":"62","author":"J. Kratochv\u00edl","year":"1994","unstructured":"Kratochv\u00edl, J., Matou\u0161ek, J.: Intersection graphs of segments. Journal of Combinatorial Theory Series B\u00a062, 289\u2013315 (1994)","journal-title":"Journal of Combinatorial Theory Series B"},{"key":"15_CR7","first-page":"85","volume":"31","author":"J. Kratochv\u00edl","year":"1990","unstructured":"Kratochv\u00edl, J., Ne\u0161et\u0159il, J.: INDEPENDENT SET and CLIQUE problems in intersection defined classes of graphs. Comment. Math. Univ. Carolin.\u00a031, 85\u201393 (1990)","journal-title":"Comment. Math. Univ. Carolin."},{"key":"15_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/11847250_14","volume-title":"Parameterized and Exact Computation","author":"D. Marx","year":"2006","unstructured":"Marx, D.: Parameterized Complexity of Independence and Domination on Geometric Graphs. In: Bodlaender, H.L., Langston, M.A. (eds.) IWPEC 2006. LNCS, vol.\u00a04169, pp. 154\u2013165. Springer, Heidelberg (2006)"},{"key":"15_CR9","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001","volume-title":"Invitation to Fixed-Parameter Algorithms","author":"R. Niedermeier","year":"2006","unstructured":"Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press, Oxford (2006)"},{"key":"15_CR10","first-page":"139","volume-title":"Proof Techniques in Graph Theory","author":"F.S. Roberts","year":"1969","unstructured":"Roberts, F.S.: Indifference graphs. In: Harary, F. (ed.) Proof Techniques in Graph Theory, pp. 139\u2013146. Academic Press, New York (1969)"}],"container-title":["Lecture Notes in Computer Science","Parameterized and Exact Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11847250_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:18:40Z","timestamp":1619493520000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11847250_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540390985","9783540391012"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/11847250_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}