{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T15:43:15Z","timestamp":1725637395587},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642258695"},{"type":"electronic","value":"9783642258701"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-25870-1_28","type":"book-chapter","created":{"date-parts":[[2011,11,30]],"date-time":"2011-11-30T13:32:45Z","timestamp":1322659965000},"page":"307-318","source":"Crossref","is-referenced-by-count":9,"title":["From Few Components to an Eulerian Graph by Adding Arcs"],"prefix":"10.1007","author":[{"given":"Manuel","family":"Sorge","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ren\u00e9","family":"van Bevern","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rolf","family":"Niedermeier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mathias","family":"Weller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"8","key":"28_CR1","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.\u00a0Comput. System Sci.\u00a075(8), 423\u2013434 (2009)","journal-title":"J.\u00a0Comput. System Sci."},{"key":"28_CR2","first-page":"376","volume":"23","author":"A. Cayley","year":"1889","unstructured":"Cayley, A.: A theorem on trees. Quart. J. Math.\u00a023, 376\u2013378 (1889)","journal-title":"Quart. J. Math."},{"key":"28_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1007\/978-3-642-02927-1_32","volume-title":"Automata, Languages and Programming","author":"M. Dom","year":"2009","unstructured":"Dom, M., Lokshtanov, D., Saurabh, S.: Incompressibility Through Colors and IDs. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol.\u00a05555, pp. 378\u2013389. Springer, Heidelberg (2009)"},{"key":"28_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1007\/978-3-642-16926-7_11","volume-title":"Graph Theoretic Concepts in Computer Science","author":"F. Dorn","year":"2010","unstructured":"Dorn, F., Moser, H., Niedermeier, R., Weller, M.: Efficient Algorithms for Eulerian Extension. In: Thilikos, D.M. (ed.) WG 2010. LNCS, vol.\u00a06410, pp. 100\u2013111. Springer, Heidelberg (2010)"},{"key":"28_CR5","doi-asserted-by":"publisher","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)"},{"issue":"3","key":"28_CR6","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1287\/opre.43.3.399","volume":"43","author":"H.A. Eiselt","year":"1995","unstructured":"Eiselt, H.A., Gendreau, M., Laporte, G.: Arc routing problems, part II: The rural postman problem. Oper. Res.\u00a043(3), 399\u2013414 (1995)","journal-title":"Oper. Res."},{"key":"28_CR7","volume-title":"Parameterized Complexity Theory","author":"J. Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)"},{"key":"28_CR8","doi-asserted-by":"crossref","unstructured":"Frederickson, G.N.: Approximation Algorithms for NP-hard Routing Problems. PhD thesis, Faculty of the Graduate School of the University of Maryland (1977)","DOI":"10.1109\/SFCS.1976.6"},{"issue":"3","key":"28_CR9","first-page":"538","volume":"26","author":"G.N. Frederickson","year":"1979","unstructured":"Frederickson, G.N.: Approximation algorithms for some postman problems. J.\u00a0ACM\u00a026(3), 538\u2013554 (1979)","journal-title":"J.\u00a0ACM"},{"key":"28_CR10","doi-asserted-by":"crossref","unstructured":"H\u00f6hn, W., Jacobs, T., Megow, N.: On Eulerian extensions and their application to no-wait flowshop scheduling. J. Sched. (to appear, 2011)","DOI":"10.1007\/s10951-011-0241-1"},{"key":"28_CR11","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1137\/S009753979225030X","volume":"24","author":"S. Kapoor","year":"1995","unstructured":"Kapoor, S., Ramesh, H.: Algorithms for enumerating all spanning trees of undirected and weighted graphs. SIAM J. Comput.\u00a024, 247\u2013265 (1995)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"28_CR12","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1002\/net.3230060305","volume":"6","author":"J.K. Lenstra","year":"1976","unstructured":"Lenstra, J.K., Kan, A.H.G.R.: On general routing problems. Networks\u00a06(3), 273\u2013280 (1976)","journal-title":"Networks"},{"key":"28_CR13","doi-asserted-by":"crossref","unstructured":"Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press (2006)","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001"},{"issue":"1","key":"28_CR14","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1002\/net.3230040105","volume":"4","author":"C.S. Orloff","year":"1974","unstructured":"Orloff, C.S.: A fundamental problem in vehicle routing. Networks\u00a04(1), 35\u201364 (1974)","journal-title":"Networks"},{"issue":"3","key":"28_CR15","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1002\/net.3230060306","volume":"6","author":"C.S. Orloff","year":"1976","unstructured":"Orloff, C.S.: On general routing problems: Comments. Networks\u00a06(3), 281\u2013284 (1976)","journal-title":"Networks"},{"key":"28_CR16","unstructured":"Sorge, M.: On Making Directed Graphs Eulerian. Diplomarbeit, Institut f\u00fcr Informatik, Friedrich-Schiller-Universit\u00e4t Jena, Available electronically. arXiv:1101.4283 [cs.DM] (2011)"},{"key":"28_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"310","DOI":"10.1007\/978-3-642-25011-8_25","volume-title":"IWOCA 2011","author":"M. Sorge","year":"2011","unstructured":"Sorge, M., van Bevern, R., Niedermeier, R., Weller, M.: A New View on Rural Postman Based on Eulerian Extension and Matching. In: Iliopoulos, C.S. (ed.) IWOCA 2011. LNCS, vol.\u00a07056, pp. 310\u2013323. Springer, Heidelberg (2011)"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25870-1_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,15]],"date-time":"2024-04-15T03:49:30Z","timestamp":1713152970000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25870-1_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642258695","9783642258701"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25870-1_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}