{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T05:27:34Z","timestamp":1725600454017},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642226847"},{"type":"electronic","value":"9783642226854"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-22685-4_6","type":"book-chapter","created":{"date-parts":[[2011,8,10]],"date-time":"2011-08-10T08:54:39Z","timestamp":1312966479000},"page":"62-73","source":"Crossref","is-referenced-by-count":4,"title":["Parameterized Complexity in Multiple-Interval Graphs: Partition, Separation, Irredundancy"],"prefix":"10.1007","author":[{"given":"Minghui","family":"Jiang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yong","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/S0097539703437843","volume":"36","author":"R. Bar-Yehuda","year":"2006","unstructured":"Bar-Yehuda, R., Halld\u00f3rsson, M.M., Naor, J., Shachnai, H., Shapira, I.: Scheduling split intervals. SIAM Journal on Computing\u00a036, 1\u201315 (2006)","journal-title":"SIAM Journal on Computing"},{"key":"6_CR2","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1145\/1721837.1721856","volume":"6","author":"A. Butman","year":"2010","unstructured":"Butman, A., Hermelin, D., Lewenstein, M., Rawitz, D.: Optimization problems in multiple-interval graphs. ACM Transactions on Algorithms\u00a06, 40 (2010)","journal-title":"ACM Transactions on Algorithms"},{"key":"6_CR3","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/S0020-0190(01)00207-1","volume":"81","author":"M. Cesati","year":"2002","unstructured":"Cesati, M.: Perfect Code is W[1]-complete. Information Processing Letters\u00a081, 163\u2013168 (2002)","journal-title":"Information Processing Letters"},{"key":"6_CR4","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/s10878-009-9233-x","volume":"18","author":"Z. Chen","year":"2009","unstructured":"Chen, Z., Fu, B., Jiang, M., Zhu, B.: On recovering syntenic blocks from comparative maps. Journal of Combinatorial Optimization\u00a018, 307\u2013318 (2009)","journal-title":"Journal of Combinatorial Optimization"},{"key":"6_CR5","first-page":"161","volume":"87","author":"R.G. Downey","year":"1992","unstructured":"Downey, R.G., Fellows, M.R.: Fixed-parameter tractability and completeness. Congressus Numerantium\u00a087, 161\u2013187 (1992)","journal-title":"Congressus Numerantium"},{"key":"6_CR6","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/0304-3975(94)00097-3","volume":"141","author":"R.G. Downey","year":"1995","unstructured":"Downey, R.G., Fellows, M.R.: Fixed-parameter tractability and completeness II: on completeness for W[1]. Theoretical Computer Science\u00a0141, 109\u2013131 (1995)","journal-title":"Theoretical Computer Science"},{"key":"6_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"R.G. Downey","year":"1999","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)"},{"key":"6_CR8","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/S0166-218X(99)00185-7","volume":"100","author":"R.G. Downey","year":"2000","unstructured":"Downey, R.G., Fellows, M.R., Raman, V.: The complexity of irredundant sets parameterized by size. Discrete Applied Mathematics\u00a0100, 155\u2013167 (2000)","journal-title":"Discrete Applied Mathematics"},{"key":"6_CR9","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.tcs.2008.09.065","volume":"410","author":"M.R. Fellows","year":"2009","unstructured":"Fellows, M.R., Hermelin, D., Rosamond, F., Vialette, S.: On the parameterized complexity of multiple-interval graph problems. Theoretical Computer Science\u00a0410, 53\u201361 (2009)","journal-title":"Theoretical Computer Science"},{"key":"6_CR10","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York (1979)"},{"key":"6_CR11","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1137\/0601025","volume":"1","author":"M.R. Garey","year":"1980","unstructured":"Garey, M.R., Johnson, D.S., Miller, G.L., Papadimitriou, C.H.: The complexity of coloring circular arcs and chords. SIAM Journal on Algebraic and Discrete Methods\u00a01, 216\u2013227 (1980)","journal-title":"SIAM Journal on Algebraic and Discrete Methods"},{"key":"6_CR12","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","volume":"1","author":"M.R. Garey","year":"1976","unstructured":"Garey, M.R., Johnson, D.S., Stockmeyer, L.: Some simplified NP-complete graph problems. Theoretical Computer Science\u00a01, 237\u2013267 (1976)","journal-title":"Theoretical Computer Science"},{"key":"6_CR13","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1145\/1412228.1412236","volume":"13","author":"J. Gramm","year":"2009","unstructured":"Gramm, J., Guo, J., H\u00fcffner, F., Niedermeier, R.: Data reduction and exact algorithms for clique cover. ACM Journal of Experimental Algorithmics\u00a013, 2.2 (2009)","journal-title":"ACM Journal of Experimental Algorithmics"},{"key":"6_CR14","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/0012-365X(79)90183-3","volume":"28","author":"J.R. Griggs","year":"1979","unstructured":"Griggs, J.R.: Extremal values of the interval number of a graph, II. Discrete Mathematics\u00a028, 37\u201347 (1979)","journal-title":"Discrete Mathematics"},{"key":"6_CR15","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1109\/TCBB.2008.109","volume":"7","author":"M. Jiang","year":"2010","unstructured":"Jiang, M.: Approximation algorithms for predicting RNA secondary structures with arbitrary pseudoknots. IEEE\/ACM Transactions on Computational Biology and Bioinformatics\u00a07, 323\u2013332 (2010)","journal-title":"IEEE\/ACM Transactions on Computational Biology and Bioinformatics"},{"key":"6_CR16","doi-asserted-by":"publisher","first-page":"4253","DOI":"10.1016\/j.tcs.2010.09.001","volume":"411","author":"M. Jiang","year":"2010","unstructured":"Jiang, M.: On the parameterized complexity of some optimization problems related to multiple-interval graphs. Theoretical Computer Science\u00a0411, 4253\u20134262 (2010)","journal-title":"Theoretical Computer Science"},{"key":"6_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/978-3-642-14553-7_17","volume-title":"Frontiers in Algorithmics","author":"M. Jiang","year":"2010","unstructured":"Jiang, M.: Recognizing d-interval graphs and d-track interval graphs. In: Lee, D.-T., Chen, D.Z., Ying, S. (eds.) FAW 2010. LNCS, vol.\u00a06213, pp. 160\u2013171. Springer, Heidelberg (2010)"},{"key":"6_CR18","doi-asserted-by":"crossref","unstructured":"Jiang, M., Zhang, Y.: Parameterized complexity in multiple-interval graphs: domination. submitted (2011)","DOI":"10.1007\/978-3-642-22685-4_6"},{"key":"6_CR19","doi-asserted-by":"crossref","unstructured":"Marx, D.: Parameterized graph separation problems. In: Proceedings of the 1st International Workshop on Parameterized and Exact Computation, pp. 71\u201382 (2004)","DOI":"10.1007\/978-3-540-28639-4_7"},{"key":"6_CR20","volume-title":"Graph Theory and Its Applications to Problems of Society","author":"F.S. Roberts","year":"1987","unstructured":"Roberts, F.S.: Graph Theory and Its Applications to Problems of Society. SIAM, Philadelphia (1987)"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22685-4_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,30]],"date-time":"2021-11-30T03:48:44Z","timestamp":1638244124000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22685-4_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642226847","9783642226854"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22685-4_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}