{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,21]],"date-time":"2025-11-21T22:58:40Z","timestamp":1763765920554,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"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_21","type":"book-chapter","created":{"date-parts":[[2012,3,8]],"date-time":"2012-03-08T23:40:26Z","timestamp":1331250026000},"page":"259-271","source":"Crossref","is-referenced-by-count":25,"title":["Twin-Cover: Beyond Vertex Cover in Parameterized Algorithmics"],"prefix":"10.1007","author":[{"given":"Robert","family":"Ganian","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"21_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1007\/978-3-642-17517-6_33","volume-title":"Algorithms and Computation","author":"A. Adiga","year":"2010","unstructured":"Adiga, A., Chitnis, R., Saurabh, S.: Parameterized Algorithms for Boxicity. In: Cheong, O., Chwa, K.-Y., Park, K. (eds.) ISAAC 2010, Part I. LNCS, vol.\u00a06506, pp. 366\u2013377. Springer, Heidelberg (2010)"},{"key":"21_CR2","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":"A.M. Ambalath","year":"2010","unstructured":"Ambalath, A.M., Balasundaram, R., Chintan Rao, H., 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.\u00a06478, pp. 14\u201325. Springer, Heidelberg (2010)"},{"key":"21_CR3","first-page":"185","volume":"30","author":"D. Berend","year":"2010","unstructured":"Berend, D., Tassa, T.: Improved bounds on bell numbers and on moments of sums of random variables. Probability and Mathematical Statistics\u00a030, 185\u2013205 (2010)","journal-title":"Probability and Mathematical Statistics"},{"key":"21_CR4","doi-asserted-by":"publisher","first-page":"3736","DOI":"10.1016\/j.tcs.2010.06.026","volume":"411","author":"J. Chen","year":"2010","unstructured":"Chen, J., Kanj, I.A., Xia, G.: Improved upper bounds for vertex cover. Theor. Comput. Sci.\u00a0411, 3736\u20133756 (2010)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"21_CR5","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s002249910009","volume":"33","author":"B. Courcelle","year":"2000","unstructured":"Courcelle, B., Makowsky, J.A., Rotics, U.: Linear time solvable optimization problems on graphs of bounded clique-width. Theory Comput. Syst.\u00a033(2), 125\u2013150 (2000)","journal-title":"Theory Comput. Syst."},{"key":"21_CR6","series-title":"Monographs in Computer Science","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. Monographs in Computer Science. Springer, Heidelberg (1999)"},{"key":"21_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/978-3-642-11269-0_10","volume-title":"Parameterized and Exact Computation","author":"R. Enciso","year":"2009","unstructured":"Enciso, R., Fellows, M.R., Guo, J., Kanj, I., Rosamond, F., Such\u00fd, O.: What Makes Equitable Connected Partition Easy. In: Chen, J., Fomin, F.V. (eds.) IWPEC 2009. LNCS, vol.\u00a05917, pp. 122\u2013133. Springer, Heidelberg (2009)"},{"key":"21_CR8","doi-asserted-by":"publisher","first-page":"799","DOI":"10.1016\/j.jcss.2010.07.003","volume":"77","author":"M.R. Fellows","year":"2011","unstructured":"Fellows, M.R., Fertin, G., Hermelin, D., Vialette, S.: Upper and lower bounds for finding connected motifs in vertex-colored graphs. J. Comput. Syst. Sci.\u00a077, 799\u2013811 (2011)","journal-title":"J. Comput. Syst. Sci."},{"key":"21_CR9","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/j.ic.2010.11.026","volume":"209","author":"M.R. Fellows","year":"2011","unstructured":"Fellows, M.R., Fomin, F.V., Lokshtanov, D., Rosamond, F., Saurabh, S., Szeider, S., Thomassen, C.: On the complexity of some colorful problems parameterized by treewidth. Inf. Comput.\u00a0209, 143\u2013153 (2011)","journal-title":"Inf. Comput."},{"key":"21_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1007\/978-3-540-92182-0_28","volume-title":"Algorithms and Computation","author":"M.R. Fellows","year":"2008","unstructured":"Fellows, M.R., Lokshtanov, D., Misra, N., Rosamond, F.A., Saurabh, S.: Graph Layout Problems Parameterized by Vertex Cover. In: Hong, S.-H., Nagamochi, H., Fukunaga, T. (eds.) ISAAC 2008. LNCS, vol.\u00a05369, pp. 294\u2013305. Springer, Heidelberg (2008)"},{"key":"21_CR11","doi-asserted-by":"publisher","first-page":"909","DOI":"10.1137\/070687256","volume":"23","author":"M.R. Fellows","year":"2009","unstructured":"Fellows, M.R., Rosamond, F.A., Rotics, U., Szeider, S.: Clique-width is NP-complete. SIAM J. Discret. Math.\u00a023, 909\u2013939 (2009)","journal-title":"SIAM J. Discret. Math."},{"key":"21_CR12","doi-asserted-by":"crossref","unstructured":"Fiala, J., Golovach, P.A., Kratochv\u00edl, J.: Parameterized complexity of coloring problems: Treewidth versus vertex cover. Theoretical Computer Science (2010) (in Press)","DOI":"10.1007\/978-3-642-02017-9_25"},{"key":"21_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1007\/978-3-642-19222-7_5","volume-title":"Combinatorial Algorithms","author":"R. Ganian","year":"2011","unstructured":"Ganian, R.: Thread Graphs, Linear Rank-Width and their Algorithmic Applications. In: Iliopoulos, C.S., Smyth, W.F. (eds.) IWOCA 2010. LNCS, vol.\u00a06460, pp. 38\u201342. Springer, Heidelberg (2011)"},{"key":"21_CR14","doi-asserted-by":"crossref","unstructured":"Ganian, R., Hlin\u011bn\u00fd, P.: On parse trees and Myhill\u2013Nerode\u2013type tools for handling graphs of bounded rank-width. Discrete Appl. Math. (2009) (to appear)","DOI":"10.1016\/j.dam.2009.10.018"},{"key":"21_CR15","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-completeness. Discrete Appl. Math.\u00a052, 233\u2013252 (1994)","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"21_CR16","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1109\/TCBB.2006.55","volume":"3","author":"V. Lacroix","year":"2006","unstructured":"Lacroix, V., Fernandes, C.G., Sagot, M.-F.F.: Motif search in graphs: application to metabolic networks. IEEE\/ACM Transactions on Computational Biology and Bioinformatics\u00a03(4), 360\u2013368 (2006)","journal-title":"IEEE\/ACM Transactions on Computational Biology and Bioinformatics"},{"key":"21_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1007\/978-3-642-15775-2_47","volume-title":"Algorithms \u2013 ESA 2010","author":"M. Lampis","year":"2010","unstructured":"Lampis, M.: Algorithmic Meta-Theorems for Restrictions of Treewidth. In: de Berg, M., Meyer, U. (eds.) ESA 2010, Part I. LNCS, vol.\u00a06346, pp. 549\u2013560. Springer, Heidelberg (2010)"},{"key":"21_CR18","doi-asserted-by":"publisher","first-page":"920","DOI":"10.2307\/2319405","volume":"80","author":"W. Meyer","year":"1973","unstructured":"Meyer, W.: Equitable coloring. American Mathematical Monthly\u00a080, 920\u2013922 (1973)","journal-title":"American Mathematical Monthly"},{"key":"21_CR19","unstructured":"Roberts, F.S.: On the boxicity and cubicity of a graph. In: Recent Progresses in Combinatorics. Academic Press (1969)"}],"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_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T09:32:03Z","timestamp":1556443923000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-28050-4_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642280498","9783642280504"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-28050-4_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}