{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T01:02:19Z","timestamp":1743037339445,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642280498"},{"type":"electronic","value":"9783642280504"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"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":[[2012]]},"DOI":"10.1007\/978-3-642-28050-4_3","type":"book-chapter","created":{"date-parts":[[2012,3,8]],"date-time":"2012-03-08T23:40:26Z","timestamp":1331250026000},"page":"27-40","source":"Crossref","is-referenced-by-count":4,"title":["Parameterized Complexity in Multiple-Interval Graphs: Domination"],"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":"3_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":"3_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":"3_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":"3_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":"3_CR5","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":"3_CR6","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":"3_CR7","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":"3_CR8","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":"3_CR9","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":"3_CR10","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":"3_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/978-3-642-22685-4_6","volume-title":"Computing and Combinatorics","author":"M. Jiang","year":"2011","unstructured":"Jiang, M., Zhang, Y.: Parameterized Complexity in Multiple-Interval Graphs: Partition, Separation, Irredundancy. In: Fu, B., Du, D.-Z. (eds.) COCOON 2011. LNCS, vol.\u00a06842, pp. 62\u201373. Springer, Heidelberg (2011)"},{"key":"3_CR12","unstructured":"Kratochv\u00edl, J.: Perfect codes in general graphs. Akademia Praha (1991)"},{"key":"3_CR13","unstructured":"Roberts, F.S.: Graph Theory and Its Applications to Problems of Society. SIAM (1987)"}],"container-title":["Lecture Notes in Computer Science","Parameterized and Exact Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-28050-4_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T09:32:26Z","timestamp":1556443946000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-28050-4_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642280498","9783642280504"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-28050-4_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}