{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:47:12Z","timestamp":1725472032852},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540359043"},{"type":"electronic","value":"9783540359050"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11786986_57","type":"book-chapter","created":{"date-parts":[[2006,6,28]],"date-time":"2006-06-28T10:46:45Z","timestamp":1151491605000},"page":"655-666","source":"Crossref","is-referenced-by-count":1,"title":["A Parameterized View on Matroid Optimization Problems"],"prefix":"10.1007","author":[{"given":"D\u00e1niel","family":"Marx","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"57_CR1","series-title":"Monographs in Computer Science","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. Monographs in Computer Science. Springer, New York (1999)"},{"volume-title":"Handbook of combinatorics","year":"1995","key":"57_CR2","unstructured":"Graham, R.L., Gr\u00f6tschel, M., Lov\u00e1sz, L. (eds.): Handbook of combinatorics, vol.\u00a01(2). Elsevier Science B.V., Amsterdam (1995)"},{"key":"57_CR3","first-page":"45","volume-title":"Combinatorial surveys (Proc. Sixth British Combinatorial Conf., Royal Holloway Coll., Egham, 1977)","author":"L. Lov\u00e1sz","year":"1977","unstructured":"Lov\u00e1sz, L.: Flats in matroids and geometric graphs. In: Combinatorial surveys (Proc. Sixth British Combinatorial Conf., Royal Holloway Coll., Egham, 1977), pp. 45\u201386. Academic Press, London (1977)"},{"issue":"2","key":"57_CR4","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1016\/0095-8956(80)90066-0","volume":"28","author":"L. Lov\u00e1sz","year":"1980","unstructured":"Lov\u00e1sz, L.: Matroid matching and some applications. J. Combin. Theory Ser. B\u00a028(2), 208\u2013236 (1980)","journal-title":"J. Combin. Theory Ser. B"},{"issue":"3","key":"57_CR5","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1016\/j.tcs.2005.10.008","volume":"351","author":"D. Marx","year":"2006","unstructured":"Marx, D.: Parameterized coloring problems on chordal graphs. Theoret. Comput. Sci.\u00a0351(3), 407\u2013424 (2006)","journal-title":"Theoret. Comput. Sci."},{"key":"57_CR6","series-title":"North-Holland Math. Stud","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/S0304-0208(08)73110-4","volume-title":"Analysis and design of algorithms for combinatorial problems (Udine, 1982)","author":"B. Monien","year":"1985","unstructured":"Monien, B.: How to find long paths efficiently. In: Analysis and design of algorithms for combinatorial problems (Udine, 1982). North-Holland Math. Stud, vol.\u00a0109, pp. 239\u2013254. North-Holland, Amsterdam (1985)"},{"key":"57_CR7","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/0022-247X(68)90163-7","volume":"22","author":"H. Perfect","year":"1968","unstructured":"Perfect, H.: Applications of Menger\u2019s graph theorem. J. Math. Anal. Appl.\u00a022, 96\u2013111 (1968)","journal-title":"J. Math. Anal. Appl."},{"key":"57_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1007\/3-540-53832-1_28","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"J. Plehn","year":"1991","unstructured":"Plehn, J., Voigt, B.: Finding minimally weighted subgraphs. In: M\u00f6hring, R.H. (ed.) WG 1990. LNCS, vol.\u00a0484, pp. 18\u201329. Springer, Heidelberg (1991)"},{"key":"57_CR9","doi-asserted-by":"crossref","unstructured":"Recski, A.: Matroid theory and its applications in electric network theory and statics. Springer-Verlag, Berlin, New York and Akad\u00e9miai Kiad\u00f3, Budapest (1989)","DOI":"10.1007\/978-3-662-22143-3"},{"issue":"4","key":"57_CR10","doi-asserted-by":"crossref","first-page":"701","DOI":"10.1145\/322217.322225","volume":"27","author":"J.T. Schwartz","year":"1980","unstructured":"Schwartz, J.T.: Fast probabilistic algorithms for verification of polynomial identities. J. Assoc. Comput. Mach.\u00a027(4), 701\u2013717 (1980)","journal-title":"J. Assoc. Comput. Mach."},{"issue":"5","key":"57_CR11","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1006\/jsco.1994.1025","volume":"17","author":"V. Shoup","year":"1994","unstructured":"Shoup, V.: Fast construction of irreducible polynomials over finite fields. J. Symbolic Comput.\u00a017(5), 371\u2013391 (1994)","journal-title":"J. Symbolic Comput."},{"key":"57_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1007\/3-540-09519-5_73","volume-title":"Symbolic and Algebraic Computation","author":"R. Zippel","year":"1979","unstructured":"Zippel, R.: Probabilistic algorithms for sparse polynomials. In: Ng, K.W. (ed.) EUROSAM 1979 and ISSAC 1979. LNCS, vol.\u00a072, pp. 216\u2013226. Springer, Heidelberg (1979)"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11786986_57.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:19:56Z","timestamp":1619507996000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11786986_57"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540359043","9783540359050"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/11786986_57","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}