{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:55:39Z","timestamp":1725569739213},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642169250"},{"type":"electronic","value":"9783642169267"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-16926-7_11","type":"book-chapter","created":{"date-parts":[[2010,11,10]],"date-time":"2010-11-10T02:48:26Z","timestamp":1289357306000},"page":"100-111","source":"Crossref","is-referenced-by-count":5,"title":["Efficient Algorithms for Eulerian Extension"],"prefix":"10.1007","author":[{"given":"Frederic","family":"Dorn","sequence":"first","affiliation":[]},{"given":"Hannes","family":"Moser","sequence":"additional","affiliation":[]},{"given":"Rolf","family":"Niedermeier","sequence":"additional","affiliation":[]},{"given":"Mathias","family":"Weller","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","unstructured":"http:\/\/jorlin.scripts.mit.edu\/Solution_Manual.html"},{"key":"11_CR2","volume-title":"Network Flows: Theory, Algorithms, and Applications","author":"R.K. Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, Englewood Cliffs (1993)"},{"issue":"1","key":"11_CR3","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1002\/jgt.3190010115","volume":"1","author":"F.T. Boesch","year":"1977","unstructured":"Boesch, F.T., Suffel, C., Tindell, R.: The spanning subgraphs of Eulerian graphs. J.\u00a0Graph Theory\u00a01(1), 79\u201384 (1977)","journal-title":"J.\u00a0Graph Theory"},{"issue":"13","key":"11_CR4","doi-asserted-by":"publisher","first-page":"1824","DOI":"10.1016\/j.dam.2006.03.031","volume":"154","author":"P. Burzyn","year":"2006","unstructured":"Burzyn, P., Bonomo, F., Dur\u00e1n, G.: NP-completeness results for edge modification problems. Discrete Appl. Math.\u00a0154(13), 1824\u20131844 (2006)","journal-title":"Discrete Appl. Math."},{"key":"11_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":"2","key":"11_CR6","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1287\/opre.43.2.231","volume":"43","author":"H.A. Eiselt","year":"1995","unstructured":"Eiselt, H.A., Gendreau, M., Laporte, G.: Arc routing problems part I: The chinese postman problem. Oper. Res.\u00a043(2), 231\u2013242 (1995)","journal-title":"Oper. Res."},{"issue":"3","key":"11_CR7","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":"11_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/978-3-642-10217-2_2","volume-title":"Combinatorial Algorithms","author":"M. Fellows","year":"2009","unstructured":"Fellows, M.: Towards fully multivariate algorithmics: Some new results and directions in parameter ecology. In: Fiala, J., Kratochv\u00edl, J., Miller, M. (eds.) IWOCA 2009. LNCS, vol.\u00a05874, pp. 2\u201310. Springer, Heidelberg (2009)"},{"key":"11_CR9","volume-title":"Parameterized Complexity Theory","author":"J. Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)"},{"issue":"3","key":"11_CR10","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":"11_CR11","unstructured":"H\u00f6hn, W., Jacobs, T., Megow, N.: On Eulerian extension problems and their application to sequencing problems. Technical Report 008, Combinatorial Optimization and Graph Algorithms, TU Berlin (2009)"},{"issue":"3","key":"11_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"},{"issue":"3","key":"11_CR13","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1002\/jgt.3190100306","volume":"10","author":"L. Lesniak","year":"1986","unstructured":"Lesniak, L., Oellermann, O.R.: An Eulerian exposition. J.\u00a0Graph Theory\u00a010(3), 277\u2013297 (1986)","journal-title":"J.\u00a0Graph Theory"},{"key":"11_CR14","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/S0166-218X(00)00391-7","volume":"113","author":"A. Natanzon","year":"2001","unstructured":"Natanzon, A., Shamir, R., Sharan, R.: Complexity classification of some edge modification problems. Discrete Appl. Math.\u00a0113, 109\u2013128 (2001)","journal-title":"Discrete Appl. Math."},{"key":"11_CR15","doi-asserted-by":"publisher","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":"11_CR16","unstructured":"Niedermeier, R.: Reflections on multivariate algorithmics and problem parameterization. In: Proc. 27th STACS, IBFI Dagstuhl, Germany. LIPIcs, vol.\u00a05, pp. 17\u201332 (2010)"},{"issue":"3","key":"11_CR17","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":"11_CR18","series-title":"LNCS","first-page":"542","volume-title":"Proc. 11th WADS","author":"M. Weller","year":"2009","unstructured":"Weller, M., Komusiewicz, C., Niedermeier, R., Uhlmann, J.: On making directed graphs transitive. In: Dehne, F., et al. (eds.) Proc. 11th WADS. LNCS, vol.\u00a05664, pp. 542\u2013553. Springer, Heidelberg (2009)"}],"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-16926-7_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,22]],"date-time":"2019-03-22T00:51:22Z","timestamp":1553215882000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16926-7_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642169250","9783642169267"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16926-7_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}