{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:19:44Z","timestamp":1725517184628},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540852377"},{"type":"electronic","value":"9783540852384"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-85238-4_49","type":"book-chapter","created":{"date-parts":[[2008,8,18]],"date-time":"2008-08-18T11:34:36Z","timestamp":1219059276000},"page":"601-612","source":"Crossref","is-referenced-by-count":5,"title":["Monadic Second Order Logic on Graphs with Local Cardinality Constraints"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Szeider","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"49_CR1","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1016\/0196-6774(91)90006-K","volume":"12","author":"S. Arnborg","year":"1991","unstructured":"Arnborg, S., Lagergren, J., Seese, D.: Easy problems for tree-decomposable graphs. J. Algorithms\u00a012(2), 308\u2013340 (1991)","journal-title":"J. Algorithms"},{"key":"49_CR2","unstructured":"Asahiro, Y., Miyano, E., Ono, H.: Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree. In: Proceedings of CATS 2008, Computing: The Australasian Theory Symposium. Conferences in Research and Practice in Information Technology, vol.\u00a077, pp. 97\u2013106. Australian Computer Society (2008)"},{"issue":"6","key":"49_CR3","doi-asserted-by":"publisher","first-page":"1305","DOI":"10.1137\/S0097539793251219","volume":"25","author":"H.L. Bodlaender","year":"1996","unstructured":"Bodlaender, H.L.: A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput.\u00a025(6), 1305\u20131317 (1996)","journal-title":"SIAM J. Comput."},{"issue":"1-2","key":"49_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(97)00228-4","volume":"209","author":"H.L. Bodlaender","year":"1998","unstructured":"Bodlaender, H.L.: A partial k-arboretum of graphs with bounded treewidth. Theoret. Comput. Sci.\u00a0209(1-2), 1\u201345 (1998)","journal-title":"Theoret. Comput. Sci."},{"key":"49_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1007\/978-3-540-28629-5_11","volume-title":"Mathematical Foundations of Computer Science 2004","author":"H.L. Bodlaender","year":"2004","unstructured":"Bodlaender, H.L., Fomin, F.V.: Equitable colorings of bounded treewidth graphs. In: Fiala, J., Koubek, V., Kratochv\u00edl, J. (eds.) MFCS 2004. LNCS, vol.\u00a03153, pp. 180\u2013190. Springer, Heidelberg (2004); Theoret. Comput. Sci. 349(1), pp. 22\u201330, (Full version published, 2005)"},{"issue":"2","key":"49_CR6","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/0095-8956(88)90068-8","volume":"45","author":"G. Cornu\u00e9jols","year":"1988","unstructured":"Cornu\u00e9jols, G.: General factors of graphs. J. Combin. Theory Ser. B\u00a045(2), 185\u2013198 (1988)","journal-title":"J. Combin. Theory Ser. B"},{"key":"49_CR7","unstructured":"Courcelle, B.: Recognizability and second-order definability for sets of finite graphs. Technical Report I-8634, Universit\u00e9 de Bordeaux (1987)"},{"key":"49_CR8","first-page":"193","volume-title":"Handbook of theoretical computer science","author":"B. Courcelle","year":"1990","unstructured":"Courcelle, B.: Graph rewriting: an algebraic and logic approach. In: Handbook of theoretical computer science, vol.\u00a0B, pp. 193\u2013242. Elsevier Science Publishers, North-Holland, Amsterdam (1990)"},{"key":"49_CR9","doi-asserted-by":"crossref","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":"49_CR10","volume-title":"Parameterized Complexity Theory","author":"J. Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)"},{"key":"49_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0045375","volume-title":"Treewidth: Computations and Approximations","author":"T. Kloks","year":"1994","unstructured":"Kloks, T.: Treewidth: Computations and Approximations. Springer, Heidelberg (1994)"},{"issue":"1","key":"49_CR12","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1137\/S0895480103436505","volume":"19","author":"A.V. Kostochka","year":"2005","unstructured":"Kostochka, A.V., Nakprasit, K., Pemmaraju, S.V.: On equitable coloring of d-degenerate graphs. SIAM J. Discrete Math.\u00a019(1), 83\u201395 (2005)","journal-title":"SIAM J. Discrete Math."},{"key":"49_CR13","first-page":"543","volume-title":"Handbook of combinatorial optimization","author":"K.-W. Lih","year":"1998","unstructured":"Lih, K.-W.: The equitable coloring of graphs. In: Handbook of combinatorial optimization, vol.\u00a03, pp. 543\u2013566. Kluwer Academic Publishers, Dordrecht (1998)"},{"key":"49_CR14","first-page":"243","volume-title":"Combinatorial Structures and their Applications (Proc. Calgary Internat. Conf., Calgary, Alta., 1969)","author":"L. Lov\u00e1sz","year":"1970","unstructured":"Lov\u00e1sz, L.: The factorization of graphs. In: Combinatorial Structures and their Applications (Proc. Calgary Internat. Conf., Calgary, Alta., 1969), pp. 243\u2013246. Gordon and Breach, New York (1970)"},{"key":"49_CR15","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/BF01889919","volume":"23","author":"L. Lov\u00e1sz","year":"1972","unstructured":"Lov\u00e1sz, L.: The factorization of graphs. II. Acta Math. Acad. Sci. Hungar.\u00a023, 223\u2013246 (1972)","journal-title":"Acta Math. Acad. Sci. Hungar."},{"key":"49_CR16","doi-asserted-by":"publisher","first-page":"920","DOI":"10.2307\/2319405","volume":"80","author":"W. Meyer","year":"1973","unstructured":"Meyer, W.: Equitable coloring. Amer. Math. Monthly\u00a080, 920\u2013922 (1973)","journal-title":"Amer. Math. Monthly"},{"key":"49_CR17","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001","volume-title":"Invitation to Fixed-Parameter Algorithms","author":"R. Niedermeier","year":"2006","unstructured":"Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press, Oxford (2006)"},{"key":"49_CR18","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/0012-365X(74)90042-9","volume":"7","author":"D.J. Rose","year":"1974","unstructured":"Rose, D.J.: On simple characterizations of k-trees. Discrete Math.\u00a07, 317\u2013322 (1974)","journal-title":"Discrete Math."},{"key":"49_CR19","unstructured":"Samer, M., Szeider, S.: Tractable cases of the extended global cardinality constraint. In: Proceedings of CATS 2008, Computing: The Australasian Theory Symposium. Conferences in Research and Practice in Information Technology, vol.\u00a077, pp. 67\u201374. Australian Computer Society (2008)"},{"key":"49_CR20","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/BF01691346","volume":"2","author":"J.W. Thatcher","year":"1968","unstructured":"Thatcher, J.W., Wright, J.B.: Generalized finite automata theory with an application to a decision problem of second-order logic. Math. Systems Theory\u00a02, 57\u201381 (1968)","journal-title":"Math. Systems Theory"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2008"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85238-4_49.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:31:34Z","timestamp":1619508694000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85238-4_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540852377","9783540852384"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85238-4_49","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}