{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T14:27:35Z","timestamp":1710340055482},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,7,27]],"date-time":"2011-07-27T00:00:00Z","timestamp":1311724800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2012,9]]},"DOI":"10.1007\/s00453-011-9548-8","type":"journal-article","created":{"date-parts":[[2011,7,26]],"date-time":"2011-07-26T17:40:50Z","timestamp":1311702050000},"page":"112-125","source":"Crossref","is-referenced-by-count":1,"title":["Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming"],"prefix":"10.1007","volume":"64","author":[{"given":"Gregory","family":"Gutin","sequence":"first","affiliation":[]},{"given":"Eun Jung","family":"Kim","sequence":"additional","affiliation":[]},{"given":"Arezou","family":"Soleimanfallah","sequence":"additional","affiliation":[]},{"given":"Stefan","family":"Szeider","sequence":"additional","affiliation":[]},{"given":"Anders","family":"Yeo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,7,27]]},"reference":[{"key":"9548_CR1","unstructured":"Beldiceanu, N., Carlsson, M., Rampon, J.-X.: Global constraint catalog. Technical Report T2005:08, SICS, SE-16 429 Kista, Sweden (Aug. 2006). On-line version at http:\/\/www.emn.fr\/x-info\/sdemasse\/gccat\/"},{"key":"9548_CR2","first-page":"235","volume-title":"Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, AAAI 2008","author":"C. Bessiere","year":"2008","unstructured":"Bessiere, C., Hebrard, E., Hnich, B., Kiziltan, Z., Quimper, C.-G., Walsh, T.: The parameterized complexity of global constraints. In: Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, AAAI 2008, Chicago, Illinois, USA, July 13\u201317, 2008, pp. 235\u2013240. AAAI Press, Menlo Park (2008)"},{"key":"9548_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"716","DOI":"10.1007\/978-3-540-30201-8_53","volume-title":"Principles and Practice of Constraint Programming (CP 2004)","author":"C. Bessi\u00e9re","year":"2004","unstructured":"Bessi\u00e9re, C., Hebrard, E., Hnich, B., Walsh, T.: The tractability of global constraints. In: Wallace, M. (ed.) Principles and Practice of Constraint Programming (CP 2004). Lecture Notes in Computer Science, vol. 3258, pp. 716\u2013720. Springer, Berlin (2004)"},{"key":"9548_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/978-3-540-45193-8_11","volume-title":"Principles and Practice of Constraint Programming (CP 2003)","author":"S. Bourdais","year":"2003","unstructured":"Bourdais, S., Galinier, P., Pesant, G.: HIBISCUS: a constraint programming application to staff scheduling in health care. In: Rossi, F. (ed.) Principles and Practice of Constraint Programming (CP 2003). Lecture Notes in Computer Science, vol. 2833, pp. 153\u2013167. Springer, Berlin (2003)"},{"issue":"2","key":"9548_CR5","doi-asserted-by":"crossref","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. Comb. Theory, Ser. B 45(2), 185\u2013198 (1988)","journal-title":"J. Comb. Theory, Ser. B"},{"key":"9548_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity. Monographs in Computer Science","author":"R.G. Downey","year":"1999","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Monographs in Computer Science. Springer, New York (1999)"},{"key":"9548_CR7","series-title":"Texts in Theoretical Computer Science. An EATCS Series","volume-title":"Parameterized Complexity Theory","author":"J. Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Texts in Theoretical Computer Science. An EATCS Series, vol.\u00a014. Springer, Berlin (2006)"},{"key":"9548_CR8","first-page":"1033","volume-title":"Proceedings of the International Joint Conference on Artificial Intelligence, IJCAI 2011","author":"S. Gaspers","year":"2011","unstructured":"Gaspers, S., Szeider, S.: Kernels for global constraints. In: Walsh, T. (ed.) Proceedings of the International Joint Conference on Artificial Intelligence, IJCAI 2011, pp.\u00a01033\u20131038. AAAI Press\/IJCAI, Menlo Park (2011)"},{"key":"9548_CR9","first-page":"243","volume-title":"Combinatorial Structures and Their Applications","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":"9548_CR10","doi-asserted-by":"crossref","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. Hung. 23, 223\u2013246 (1972)","journal-title":"Acta Math. Acad. Sci. Hung."},{"key":"9548_CR11","doi-asserted-by":"crossref","unstructured":"Mathieson, L., Szeider, S.: Editing graphs to satisfy degree constraints: A parameterized approach. J.\u00a0Comput. Syst. Sci. (2011, to appear)","DOI":"10.1016\/j.jcss.2011.02.001"},{"key":"9548_CR12","series-title":"Oxford Lecture Series in Mathematics and Its Applications","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 Lecture Series in Mathematics and Its Applications. Oxford University Press, Oxford (2006)"},{"issue":"4","key":"9548_CR13","doi-asserted-by":"crossref","first-page":"757","DOI":"10.1016\/S0022-0000(03)00078-3","volume":"67","author":"K. Pietrzak","year":"2003","unstructured":"Pietrzak, K.: On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems. J. Comput. Syst. Sci. 67(4), 757\u2013771 (2003)","journal-title":"J. Comput. Syst. Sci."},{"key":"9548_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"572","DOI":"10.1007\/978-3-540-30201-8_42","volume-title":"Principles and Practice of Constraint Programming (CP 2004)","author":"J.-C. R\u00e9gin","year":"2004","unstructured":"R\u00e9gin, J.-C., Gomes, C.: The cardinality matrix constraint. In: Wallace, M. (ed.) Principles and Practice of Constraint Programming (CP 2004). Lecture Notes in Computer Science, vol. 3258, pp. 572\u2013587. Springer, Berlin (2004)"},{"key":"9548_CR15","series-title":"Conferences in Research and Practice in Information Technology","first-page":"67","volume-title":"Proceedings of CATS 2008, Computing: The Australasian Theory Symposium, University of Wollongong, New South Wales, Australia, January 22\u201325, 2008","author":"M. Samer","year":"2008","unstructured":"Samer, M., Szeider, S.: Tractable cases of the extended global cardinality constraint. In: Harland, J., Manyem, P. (eds.) Proceedings of CATS 2008, Computing: The Australasian Theory Symposium, University of Wollongong, New South Wales, Australia, January 22\u201325, 2008. Conferences in Research and Practice in Information Technology, vol. 77, pp. 67\u201374. Austr. Comput. Soc., Sydney (2008). Full version appeared in Constraints 16(1), 1\u201324 (2011)"},{"issue":"2","key":"9548_CR16","doi-asserted-by":"crossref","DOI":"10.1145\/1877714.1877718","volume":"12","author":"S. Szeider","year":"2011","unstructured":"Szeider, S.: Monadic second order logic on graphs with local cardinality constraints. ACM Trans. Comput. Log. 12(2), article\u00a012 (2011)","journal-title":"ACM Trans. Comput. Log."},{"key":"9548_CR17","volume-title":"Proceedings of the Twenty-Fifth Conference on Artificial Intelligence, AAAI 2011","author":"S. Szeider","year":"2011","unstructured":"Szeider, S.: Limits of preprocessing. In: Proceedings of the Twenty-Fifth Conference on Artificial Intelligence, AAAI 2011 (2011). To appear"},{"key":"9548_CR18","volume-title":"Handbook of Constraint Programming","author":"W.-J. Hoeve van","year":"2006","unstructured":"van Hoeve, W.-J., Katriel, I.: Global constraints. In: Rossi, F., van Beek, P., Walsh, T. (eds.) Handbook of Constraint Programming. Elsevier, Amsterdam (2006). Chap.\u00a06"},{"key":"9548_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"620","DOI":"10.1007\/11889205_44","volume-title":"Principles and Practice of Constraint Programming\u2014CP 2006, Proceedings of 12th International Conference","author":"W.J. Hoeve van","year":"2006","unstructured":"van Hoeve, W.J., Pesant, G., Rousseau, L.-M., Sabharwal, A.: Revisiting the sequence constraint. In: Benhamou, F. (ed.) Principles and Practice of Constraint Programming\u2014CP 2006, Proceedings of 12th International Conference, Nantes, France, September 25\u201329, 2006. Lecture Notes in Computer Science, vol. 4204, pp. 620\u2013634. Springer, Berlin (2006)"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-011-9548-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-011-9548-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-011-9548-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,13]],"date-time":"2019-06-13T10:33:40Z","timestamp":1560422020000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-011-9548-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,7,27]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,9]]}},"alternative-id":["9548"],"URL":"https:\/\/doi.org\/10.1007\/s00453-011-9548-8","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,7,27]]}}}