{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T21:35:00Z","timestamp":1725744900909},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642404498"},{"type":"electronic","value":"9783642404504"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40450-4_42","type":"book-chapter","created":{"date-parts":[[2013,8,16]],"date-time":"2013-08-16T03:22:47Z","timestamp":1376623367000},"page":"493-504","source":"Crossref","is-referenced-by-count":1,"title":["Long Circuits and Large Euler Subgraphs"],"prefix":"10.1007","author":[{"given":"Fedor V.","family":"Fomin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Petr A.","family":"Golovach","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"42_CR1","doi-asserted-by":"publisher","first-page":"844","DOI":"10.1145\/210332.210337","volume":"42","author":"N. Alon","year":"1995","unstructured":"Alon, N., Yuster, R., Zwick, U.: Color-coding. J. ACM\u00a042(4), 844\u2013856 (1995)","journal-title":"J. ACM"},{"key":"42_CR2","unstructured":"Berman, P., Karpinski, M., Scott, A.D.: Approximation hardness of short symmetric instances of MAX-3SAT. Electronic Colloquium on Computational Complexity, ECCC (049) (2003)"},{"issue":"6","key":"42_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":"8","key":"42_CR4","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1016\/j.jcss.2009.04.001","volume":"75","author":"H.L. Bodlaender","year":"2009","unstructured":"Bodlaender, H.L., Downey, R.G., Fellows, M.R., Hermelin, D.: On problems without polynomial kernels. J. Comput. Syst. Sci.\u00a075(8), 423\u2013434 (2009)","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"42_CR5","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/j.jda.2011.03.004","volume":"9","author":"L. Cai","year":"2011","unstructured":"Cai, L., Yang, B.: Parameterized complexity of even\/odd subgraph problems. J. Discrete Algorithms\u00a09(3), 231\u2013240 (2011)","journal-title":"J. Discrete Algorithms"},{"key":"42_CR6","first-page":"257","volume":"26","author":"B. Courcelle","year":"1992","unstructured":"Courcelle, B.: The monadic second-order logic of graphs III: tree-decompositions, minor and complexity issues. ITA\u00a026, 257\u2013286 (1992)","journal-title":"ITA"},{"key":"42_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/978-3-642-25870-1_13","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"M. Cygan","year":"2011","unstructured":"Cygan, M., Marx, D., Pilipczuk, M., Pilipczuk, M., Schlotter, I.: Parameterized complexity of Eulerian deletion problems. In: Kolman, P., Kratochv\u00edl, J. (eds.) WG 2011. LNCS, vol.\u00a06986, pp. 131\u2013142. Springer, Heidelberg (2011)"},{"issue":"1","key":"42_CR8","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1137\/110834810","volume":"27","author":"F. Dorn","year":"2013","unstructured":"Dorn, F., Moser, H., Niedermeier, R., Weller, M.: Efficient algorithms for eulerian extension and rural postman. SIAM J. Discrete Math.\u00a027(1), 75\u201394 (2013)","journal-title":"SIAM J. Discrete Math."},{"key":"42_CR9","doi-asserted-by":"publisher","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":"42_CR10","first-page":"463","volume":"2","author":"P. Erd\u00f6s","year":"1935","unstructured":"Erd\u00f6s, P., Szekeres, G.: A combinatorial problem in geometry. Compositio Math.\u00a02, 463\u2013470 (1935)","journal-title":"Compositio Math."},{"issue":"1","key":"42_CR11","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.tcs.2008.09.065","volume":"410","author":"M.R. Fellows","year":"2009","unstructured":"Fellows, M.R., Hermelin, D., Rosamond, F.A., Vialette, S.: On the parameterized complexity of multiple-interval graph problems. Theor. Comput. Sci.\u00a0410(1), 53\u201361 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"42_CR12","unstructured":"Fleischner, H.: Eulerian Graphs and Related Topics, Part 1, Amsterdam. Annals of Discrete Mathematics 45, vol.\u00a01 (1990)"},{"key":"42_CR13","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. Springer, Berlin (2006)"},{"key":"42_CR14","unstructured":"Fomin, F.V., Golovach, P.A.: Parameterized complexity of connected even\/odd subgraph problems. In: STACS 2012. LIPIcs, vol.\u00a014, pp. 432\u2013440. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2012)"},{"key":"42_CR15","doi-asserted-by":"crossref","unstructured":"Gabow, H.N., Nie, S.: Finding a long directed cycle. ACM Transactions on Algorithms\u00a04(1) (2008)","DOI":"10.1145\/1328911.1328918"},{"issue":"4","key":"42_CR16","doi-asserted-by":"publisher","first-page":"704","DOI":"10.1137\/0205049","volume":"5","author":"M.R. Garey","year":"1976","unstructured":"Garey, M.R., Johnson, D.S., Tarjan, R.E.: The planar hamiltonian circuit problem is NP-complete. SIAM J. Comput.\u00a05(4), 704\u2013714 (1976)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"42_CR17","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1016\/j.disopt.2010.09.009","volume":"8","author":"P.A. Golovach","year":"2011","unstructured":"Golovach, P.A., Thilikos, D.M.: Paths of bounded length and their cuts: Parameterized complexity and algorithms. Discrete Optimization\u00a08(1), 72\u201386 (2011)","journal-title":"Discrete Optimization"},{"key":"42_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"610","DOI":"10.1007\/978-3-642-31585-5_54","volume-title":"Automata, Languages, and Programming","author":"A. Kosowski","year":"2012","unstructured":"Kosowski, A., Li, B., Nisse, N., Suchan, K.: k-Chordal graphs: From cops and robber to compact routing via treewidth. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds.) ICALP 2012, Part II. LNCS, vol.\u00a07392, pp. 610\u2013622. Springer, Heidelberg (2012)"},{"key":"42_CR19","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001","volume-title":"Invitation to fixed-parameter algorithms, Oxford Lecture Series in Mathematics and its Applications","author":"R. Niedermeier","year":"2006","unstructured":"Niedermeier, R.: Invitation to fixed-parameter algorithms, Oxford Lecture Series in Mathematics and its Applications, vol.\u00a031. Oxford University Press, Oxford (2006)"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2013"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40450-4_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T17:06:44Z","timestamp":1558026404000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40450-4_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642404498","9783642404504"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40450-4_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}