{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T11:01:34Z","timestamp":1725879694186},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319530062"},{"type":"electronic","value":"9783319530079"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-53007-9_11","type":"book-chapter","created":{"date-parts":[[2017,2,2]],"date-time":"2017-02-02T05:13:23Z","timestamp":1486012403000},"page":"118-129","source":"Crossref","is-referenced-by-count":1,"title":["On Structural Parameterizations of Graph Motif and Chromatic Number"],"prefix":"10.1007","author":[{"given":"Bireswar","family":"Das","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Murali Krishna","family":"Enduri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Neeldhara","family":"Misra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"I. Vinod","family":"Reddy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,1,26]]},"reference":[{"key":"11_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/978-3-642-17493-3_4","volume-title":"Parameterized and Exact Computation","author":"AM Ambalath","year":"2010","unstructured":"Ambalath, A.M., Balasundaram, R., Rao H., C., Koppula, V., Misra, N., Philip, G., Ramanujan, M.S.: On the kernelization complexity of colorful motifs. In: Raman, V., Saurabh, S. (eds.) IPEC 2010. LNCS, vol. 6478, pp. 14\u201325. Springer, Heidelberg (2010). doi: 10.1007\/978-3-642-17493-3_4"},{"issue":"5","key":"11_CR2","first-page":"1296","volume":"8","author":"N Betzler","year":"2011","unstructured":"Betzler, N., Van Bevern, R., Fellows, M.R., Komusiewicz, C., Niedermeier, R.: Parameterized algorithmics for finding connected motifs in biological networks. IEEE\/ACM TCBB 8(5), 1296\u20131308 (2011)","journal-title":"IEEE\/ACM TCBB"},{"key":"11_CR3","unstructured":"Bodlaender, H.L., Jansen, B.M., Kratsch, S.: Cross-composition: a new technique for kernelization lower bounds (2010). arXiv preprint arXiv:1011.4224"},{"key":"11_CR4","unstructured":"Bonnet, \u00c9., Sikora, F.: The graph motif problem parameterized by the structure of the input graph. In: LIPIcs-Leibniz International Proceedings in Informatics, vol. 43. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2015)"},{"issue":"3","key":"11_CR5","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1016\/S0166-218X(02)00242-1","volume":"127","author":"L Cai","year":"2003","unstructured":"Cai, L.: Parameterized complexity of vertex colouring. Discret. Appl. Math. 127(3), 415\u2013429 (2003)","journal-title":"Discret. Appl. Math."},{"key":"11_CR6","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/S0167-5060(08)70731-3","volume":"1","author":"V Chv\u00e1tal","year":"1977","unstructured":"Chv\u00e1tal, V., Hammer, P.L.: Aggregation of inequalities in integer programming. Ann. Discret. Math. 1, 145\u2013162 (1977)","journal-title":"Ann. Discret. Math."},{"issue":"1","key":"11_CR7","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1016\/0890-5401(90)90043-H","volume":"85","author":"B Courcelle","year":"1990","unstructured":"Courcelle, B.: The monadic second-order logic of graphs. I. Recognizable sets of finite graphs. Inf. Comput. 85(1), 12\u201375 (1990)","journal-title":"Inf. Comput."},{"key":"11_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., Fomin, F.V., Kowalik, \u0141., Lokshtanov, D., Marx, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S.: Parameterized Algorithms, vol. 4. Springer, New York (2015)"},{"key":"11_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"RG Downey","year":"1999","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity, vol. 3. Springer, Heidelberg (1999)"},{"key":"11_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1007\/978-3-540-73420-8_31","volume-title":"Automata, Languages and Programming","author":"MR Fellows","year":"2007","unstructured":"Fellows, M.R., Fertin, G., Hermelin, D., Vialette, S.: Sharp tractability borderlines for finding connected motifs in vertex-colored graphs. In: Arge, L., Cachin, C., Jurdzi\u0144ski, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol. 4596, pp. 340\u2013351. Springer, Heidelberg (2007). doi: 10.1007\/978-3-540-73420-8_31"},{"key":"11_CR11","unstructured":"Foldes, S., Hammer, P.L.: Split graphs. Institut f\u00fcr \u00d6konometrie und Operations Research, Universit\u00e4t Bonn (1976)"},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"Fomin, F.V., Golovach, P.A., Lokshtanov, D., Saurabh, S.: Algorithmic lower bounds for problems parameterized by clique-width. In: Proceedings of 21st Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 493\u2013502. SIAM (2010)","DOI":"10.1137\/1.9781611973075.42"},{"issue":"1","key":"11_CR13","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/BF02020961","volume":"18","author":"T Gallai","year":"1967","unstructured":"Gallai, T.: Transitiv orientierbare graphen. Acta Mathematica Hungarica 18(1), 25\u201366 (1967)","journal-title":"Acta Mathematica Hungarica"},{"key":"11_CR14","unstructured":"Ganian, R.: Using neighborhood diversity to solve hard problems (2012). arXiv preprint arXiv:1201.3091"},{"issue":"2","key":"11_CR15","first-page":"77","volume":"17","author":"R Ganian","year":"2015","unstructured":"Ganian, R.: Improving vertex cover as a graph parameter. Discret. Math. Theoret. Comput. Sci. 17(2), 77\u2013100 (2015)","journal-title":"Discret. Math. Theoret. Comput. Sci."},{"key":"11_CR16","unstructured":"Jansen, B.M., et al.: The power of data reduction: kernels for fundamental graph problems (2013)"},{"issue":"4","key":"11_CR17","first-page":"360","volume":"3","author":"V Lacroix","year":"2006","unstructured":"Lacroix, V., Fernandes, C.G., Sagot, M.F.: Motif search in graphs: application to metabolic networks. IEEE\/ACM TCBB 3(4), 360\u2013368 (2006)","journal-title":"IEEE\/ACM TCBB"},{"key":"11_CR18","volume-title":"Threshold Graphs and Related Topics","author":"NV Mahadev","year":"1995","unstructured":"Mahadev, N.V., Peled, U.N.: Threshold Graphs and Related Topics, vol. 56. Elsevier, Amsterdam (1995)"},{"issue":"1","key":"11_CR19","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1007\/s00453-015-0033-7","volume":"75","author":"SH S\u00e6ther","year":"2016","unstructured":"S\u00e6ther, S.H., Telle, J.A.: Between treewidth and clique-width. Algorithmica 75(1), 218\u2013253 (2016)","journal-title":"Algorithmica"},{"issue":"1","key":"11_CR20","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/0166-218X(94)00156-8","volume":"62","author":"G Tinhofer","year":"1995","unstructured":"Tinhofer, G.: Bin-packing and matchings in threshold graphs. Discret. Appl. Math. 62(1), 279\u2013289 (1995)","journal-title":"Discret. Appl. Math."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Discrete Applied Mathematics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-53007-9_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,25]],"date-time":"2017-06-25T05:35:20Z","timestamp":1498368920000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-53007-9_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319530062","9783319530079"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-53007-9_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}