{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T07:02:04Z","timestamp":1760079724080},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642452772"},{"type":"electronic","value":"9783642452789"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-45278-9_15","type":"book-chapter","created":{"date-parts":[[2013,11,25]],"date-time":"2013-11-25T15:35:18Z","timestamp":1385393718000},"page":"164-177","source":"Crossref","is-referenced-by-count":6,"title":["Expanding the Expressive Power of Monadic Second-Order Logic on Restricted Graph Classes"],"prefix":"10.1007","author":[{"given":"Robert","family":"Ganian","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan","family":"Obdr\u017e\u00e1lek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"15_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)"},{"issue":"6","key":"15_CR2","doi-asserted-by":"publisher","first-page":"929","DOI":"10.1007\/s00224-006-1350-7","volume":"39","author":"K. Andreev","year":"2006","unstructured":"Andreev, K., R\u00e4cke, H.: Balanced graph partitioning. Theory Comput. Syst.\u00a039(6), 929\u2013939 (2006)","journal-title":"Theory Comput. Syst."},{"key":"15_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04363-9","volume-title":"Scheduling Computer and Manufacturing Processes","author":"J. Bazewicz","year":"2001","unstructured":"Bazewicz, J., Ecker, K., Pesch, E., Schmidt, G., Weglarz, J.: Scheduling Computer and Manufacturing Processes, 2nd edn. Springer-Verlag New York, Inc., Secaucus (2001)","edition":"2"},{"issue":"2","key":"15_CR4","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."},{"issue":"11","key":"15_CR5","doi-asserted-by":"publisher","first-page":"1431","DOI":"10.1016\/j.jpdc.2006.06.004","volume":"66","author":"S. Das","year":"2006","unstructured":"Das, S., Finocchi, I., Petreschi, R.: Conflict-free star-access in parallel memory systems. J. Parallel Distrib. Comput.\u00a066(11), 1431\u20131441 (2006)","journal-title":"J. Parallel Distrib. Comput."},{"key":"15_CR6","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":"15_CR7","series-title":"Leibniz International Proceedings in Informatics (LIPIcs)","first-page":"100","volume-title":"STACS 2012","author":"A. Feldmann","year":"2012","unstructured":"Feldmann, A., Foschini, L.: Balanced Partitions of Trees and Applications. In: STACS 2012. Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a014, pp. 100\u2013111. Schloss Dagstuhl, Dagstuhl (2012)"},{"key":"15_CR8","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/j.ic.2010.11.026","volume":"209","author":"M. Fellows","year":"2011","unstructured":"Fellows, M., Fomin, F., 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":"15_CR9","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)"},{"issue":"23","key":"15_CR10","doi-asserted-by":"publisher","first-page":"2513","DOI":"10.1016\/j.tcs.2010.10.043","volume":"412","author":"J. Fiala","year":"2011","unstructured":"Fiala, J., Golovach, P., Kratochv\u00edl, J.: Parameterized complexity of coloring problems: Treewidth versus vertex cover. Theoret. Comput. Sci.\u00a0412(23), 2513\u20132523 (2011)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"15_CR11","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/BF02579200","volume":"7","author":"A. Frank","year":"1987","unstructured":"Frank, A., Tardos, \u00c9.: An application of simultaneous diophantine approximation in combinatorial optimization. Combinatorica\u00a07(1), 49\u201365 (1987)","journal-title":"Combinatorica"},{"key":"15_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/978-3-642-28050-4_21","volume-title":"Parameterized and Exact Computation","author":"R. Ganian","year":"2012","unstructured":"Ganian, R.: Twin-cover: Beyond vertex cover in parameterized algorithmics. In: Marx, D., Rossmanith, P. (eds.) IPEC 2011. LNCS, vol.\u00a07112, pp. 259\u2013271. Springer, Heidelberg (2012)"},{"key":"15_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1007\/978-3-642-32589-2_38","volume-title":"Mathematical Foundations of Computer Science 2012","author":"R. Ganian","year":"2012","unstructured":"Ganian, R., Hlin\u011bn\u00fd, P., Ne\u0161et\u0159il, J., Obdr\u017e\u00e1lek, J., Ossona de Mendez, P., Ramadurai, R.: When trees grow low: Shrubs and fast MSO1. In: Rovan, B., Sassone, V., Widmayer, P. (eds.) MFCS 2012. LNCS, vol.\u00a07464, pp. 419\u2013430. Springer, Heidelberg (2012)"},{"key":"15_CR14","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1287\/moor.12.3.415","volume":"12","author":"R. Kannan","year":"1987","unstructured":"Kannan, R.: Minkowski\u2019s convex body theorem and integer programming. Math. Oper. Res.\u00a012, 415\u2013440 (1987)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"15_CR15","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/s00453-011-9554-x","volume":"64","author":"M. Lampis","year":"2012","unstructured":"Lampis, M.: Algorithmic meta-theorems for restrictions of treewidth. Algorithmica\u00a064(1), 19\u201337 (2012)","journal-title":"Algorithmica"},{"key":"15_CR16","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1287\/moor.8.4.538","volume":"8","author":"H. Lenstra","year":"1983","unstructured":"Lenstra, H.: Integer programming with a fixed number of variables. Math. Oper. Res.\u00a08, 538\u2013548 (1983)","journal-title":"Math. Oper. Res."},{"key":"15_CR17","unstructured":"MacGregor, R.: On partitioning a graph: a theoretical and empirical study. PhD thesis, University of California, Berkeley (1978)"},{"key":"15_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":"15_CR19","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1016\/j.tcs.2007.03.043","volume":"377","author":"M. Rao","year":"2007","unstructured":"Rao, M.: MSOL partitioning problems on graphs of bounded treewidth and clique-width. Theoret. Comput. Sci.\u00a0377, 260\u2013267 (2007)","journal-title":"Theoret. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-45278-9_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T18:54:59Z","timestamp":1558724099000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-45278-9_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642452772","9783642452789"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-45278-9_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}