{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:38:12Z","timestamp":1759639092510,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030181253"},{"type":"electronic","value":"9783030181260"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-18126-0_4","type":"book-chapter","created":{"date-parts":[[2019,4,14]],"date-time":"2019-04-14T23:02:19Z","timestamp":1555282939000},"page":"38-50","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Graph Orientation with Edge Modifications"],"prefix":"10.1007","author":[{"given":"Yuichi","family":"Asahiro","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jesper","family":"Jansson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eiji","family":"Miyano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hirotaka","family":"Ono","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sandhya","family":"T. P.","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,4,9]]},"reference":[{"key":"4_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/978-3-319-96151-4_5","volume-title":"Combinatorial Optimization","author":"Y Asahiro","year":"2018","unstructured":"Asahiro, Y., Jansson, J., Miyano, E., Nikpey, H., Ono, H.: Graph orientation with splits. In: Lee, J., Rinaldi, G., Mahjoub, A.R. (eds.) ISCO 2018. LNCS, vol. 10856, pp. 52\u201363. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96151-4_5"},{"issue":"3","key":"4_CR2","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1142\/S0129054111008246","volume":"22","author":"Y Asahiro","year":"2011","unstructured":"Asahiro, Y., Jansson, J., Miyano, E., Ono, H.: Graph orientation to maximize the minimum weighted outdegree. Int. J. Found. Comput. Sci. 22(3), 583\u2013601 (2011)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"1","key":"4_CR3","doi-asserted-by":"publisher","first-page":"441","DOI":"10.7155\/jgaa.00371","volume":"19","author":"Y Asahiro","year":"2015","unstructured":"Asahiro, Y., Jansson, J., Miyano, E., Ono, H.: Graph orientations optimizing the number of light or heavy vertices. J. Graph Algorithms Appl. 19(1), 441\u2013465 (2015)","journal-title":"J. Graph Algorithms Appl."},{"issue":"1","key":"4_CR4","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/s10878-009-9276-z","volume":"22","author":"Y Asahiro","year":"2011","unstructured":"Asahiro, Y., Jansson, J., Miyano, E., Ono, H., Zenmyo, K.: Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree. J. Comb. Optim. 22(1), 78\u201396 (2011)","journal-title":"J. Comb. Optim."},{"key":"4_CR5","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1016\/j.dam.2010.11.003","volume":"159","author":"Y Asahiro","year":"2011","unstructured":"Asahiro, Y., Miyano, E., Ono, H.: Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree. Discrete Appl. Math. 159, 498\u2013508 (2011)","journal-title":"Discrete Appl. Math."},{"key":"4_CR6","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1023\/B:MACH.0000033116.57574.95","volume":"56","author":"N Bansal","year":"2004","unstructured":"Bansal, N., Blum, A., Chawla, S.: Correlation clustering. Mach. Learn. 56, 89\u2013113 (2004)","journal-title":"Mach. Learn."},{"issue":"4","key":"4_CR7","doi-asserted-by":"publisher","first-page":"687","DOI":"10.7155\/jgaa.00435","volume":"21","author":"G Borradaile","year":"2017","unstructured":"Borradaile, G., Iglesias, J., Migler, T., Ochoa, A., Wilfong, G., Zhang, L.: Egalitarian graph orientations. J. Graph Algorithms Appl. 21(4), 687\u2013708 (2017)","journal-title":"J. Graph Algorithms Appl."},{"key":"4_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1007\/3-540-48447-7_34","volume-title":"Algorithms and Data Structures","author":"GS Brodal","year":"1999","unstructured":"Brodal, G.S., Fagerberg, R.: Dynamic representations of sparse graphs. In: Dehne, F., Sack, J.-R., Gupta, A., Tamassia, R. (eds.) WADS 1999. LNCS, vol. 1663, pp. 342\u2013351. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48447-7_34"},{"key":"4_CR9","doi-asserted-by":"publisher","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, 185\u2013198 (1988)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"2","key":"4_CR10","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/0304-3975(91)90020-3","volume":"86","author":"M Chrobak","year":"1991","unstructured":"Chrobak, M., Eppstein, D.: Planar orientations with low out-degree and compaction of adjacency matrices. Theor. Comput. Sci. 86(2), 243\u2013266 (1991)","journal-title":"Theor. Comput. Sci."},{"key":"4_CR11","volume-title":"Introduction to Algorithms","author":"T Cormen","year":"2009","unstructured":"Cormen, T., Leiserson, C., Rivest, R., Stein, C.: Introduction to Algorithms, 3rd edn. The MIT Press, Cambridge (2009)","edition":"3"},{"key":"4_CR12","unstructured":"Lov\u00e1sz, L.: The factorization of graphs. In: Combinatorial Structures and Their Applications, pp. 243\u2013246 (1970)"},{"key":"4_CR13","doi-asserted-by":"publisher","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":"4_CR14","doi-asserted-by":"crossref","unstructured":"Orlin, J.B.: Max flows in $$O(nm)$$ time, or better. In: Proceedings of the 45th Annual ACM Symposium on Theory of Computing (STOC 2013), pp. 765\u2013774. Association for Computing Machinery (ACM) (2013)","DOI":"10.1145\/2488608.2488705"},{"key":"4_CR15","unstructured":"Sharan, R.: Graph modification problems and their applications to genomic research. Ph.D. thesis, School of Computer Science, Tel-Aviv University (2002)"},{"key":"4_CR16","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1016\/j.dam.2003.07.007","volume":"143","author":"V Venkateswaran","year":"2004","unstructured":"Venkateswaran, V.: Minimizing maximum indegree. Discrete Appl. Math. 143, 374\u2013378 (2004)","journal-title":"Discrete Appl. Math."}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-18126-0_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T12:44:48Z","timestamp":1709815488000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-18126-0_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030181253","9783030181260"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-18126-0_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"9 April 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FAW","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Frontiers in Algorithmics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sanya","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 April 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 May 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"faw2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/iiis.tsinghua.edu.cn\/~jianli\/FAW2019\/FAW2019.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}