{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T19:04:00Z","timestamp":1757617440699,"version":"3.44.0"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031826696"},{"type":"electronic","value":"9783031826702"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-82670-2_5","type":"book-chapter","created":{"date-parts":[[2025,2,7]],"date-time":"2025-02-07T23:24:46Z","timestamp":1738970686000},"page":"51-64","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Shortest Longest-Path Graph Orientations for\u00a0Trees"],"prefix":"10.1007","author":[{"given":"Yuichi","family":"Asahiro","sequence":"first","affiliation":[]},{"given":"Jesper","family":"Jansson","sequence":"additional","affiliation":[]},{"given":"Avraham A.","family":"Melkman","sequence":"additional","affiliation":[]},{"given":"Eiji","family":"Miyano","sequence":"additional","affiliation":[]},{"given":"Hirotaka","family":"Ono","sequence":"additional","affiliation":[]},{"given":"Quan","family":"Xue","sequence":"additional","affiliation":[]},{"given":"Yoshichika","family":"Yano","sequence":"additional","affiliation":[]},{"given":"Shay","family":"Zakov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,2,7]]},"reference":[{"issue":"1","key":"5_CR1","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 Algor. Appl. 19(1), 441\u2013465 (2015)","journal-title":"J. Graph Algor. Appl."},{"issue":"1","key":"5_CR2","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":"5_CR3","doi-asserted-by":"publisher","unstructured":"Asahiro, Y., et al.: Shortest longest-path graph orientations. In: Proceedings of the 29th International Computing and Combinatorics Conference (COCOON 2023). LNCS, vol. 14422 , pp. 141\u2013154. Springer, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-49190-0_10","DOI":"10.1007\/978-3-031-49190-0_10"},{"issue":"2","key":"5_CR4","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1142\/S0129054107004644","volume":"18","author":"Y Asahiro","year":"2007","unstructured":"Asahiro, Y., Miyano, E., Ono, H., Zenmyo, K.: Graph orientation algorithms to minimize the maximum outdegree. Int. J. Found. Comput. Sci. 18(2), 197\u2013215 (2007)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"4","key":"5_CR5","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 Algor. Appl. 21(4), 687\u2013708 (2017)","journal-title":"J. Graph Algor. Appl."},{"issue":"2","key":"5_CR6","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."},{"issue":"3","key":"5_CR7","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/0012-365X(80)90236-8","volume":"30","author":"DP Dailey","year":"1980","unstructured":"Dailey, D.P.: Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete. Disc. Math. 30(3), 289\u2013293 (1980)","journal-title":"Disc. Math."},{"issue":"1","key":"5_CR8","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/0095-8956(79)90048-0","volume":"26","author":"RW Deming","year":"1979","unstructured":"Deming, R.W.: Acyclic orientations of a graph and chromatic and independence numbers. J. Comb. Theory Ser. B 26(1), 101\u2013110 (1979)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"4","key":"5_CR9","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1080\/15427951.2011.604554","volume":"7","author":"M Elberfeld","year":"2011","unstructured":"Elberfeld, M., et al.: On the approximability of reachability-preserving network orientations. Internet Math. 7(4), 209\u2013232 (2011)","journal-title":"Internet Math."},{"key":"5_CR10","unstructured":"Gallai, T.: On directed graphs and circuits. In: Theory of Graphs (Proceedings of the Colloquium held at Tihany\u00a01966), pp. 115\u2013118. Akad\u00e9miai Kiad\u00f3 (1968)"},{"issue":"5\u20136","key":"5_CR11","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1002\/mana.19650280503","volume":"28","author":"M Hasse","year":"1965","unstructured":"Hasse, M.: Zur algebraischen Begr\u00fcndung der Graphentheorie. I. Mathematische Nachrichten 28(5\u20136), 275\u2013290 (1965)","journal-title":"I. Mathematische Nachrichten"},{"key":"5_CR12","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2023.114176","volume":"978","author":"F H\u00f6rsch","year":"2023","unstructured":"H\u00f6rsch, F.: On orientations maximizing total arc-connectivity. Theor. Comput. Sci. 978, 114176 (2023)","journal-title":"Theor. Comput. Sci."},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Proceedings of Complexity of Computer Computations. The IBM Research Symposia Series, pp. 85\u2013103. Plenum Press (1972)","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"5_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/978-3-540-87361-7_19","volume-title":"Algorithms in Bioinformatics","author":"A Medvedovsky","year":"2008","unstructured":"Medvedovsky, A., Bafna, V., Zwick, U., Sharan, R.: An algorithm for orienting graphs based on cause-effect pairs and its applications to orienting protein networks. In: Crandall, K.A., Lagergren, J. (eds.) WABI 2008. LNCS, vol. 5251, pp. 222\u2013232. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-87361-7_19"},{"issue":"5","key":"5_CR15","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1051\/m2an\/1967010501291","volume":"1","author":"B Roy","year":"1967","unstructured":"Roy, B.: Nombre chromatique et plus longs chemins d\u2019un graphe. Revue fran\u00e7aise d\u2019informatique et de recherche op\u00e9rationnelle 1(5), 129\u2013132 (1967)","journal-title":"Revue fran\u00e7aise d\u2019informatique et de recherche op\u00e9rationnelle"},{"issue":"1\u20133","key":"5_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. Disc. Appl. Math. 143(1\u20133), 374\u2013378 (2004)","journal-title":"Disc. Appl. Math."},{"key":"5_CR17","unstructured":"Vitaver, L.M.: Determination of minimal coloring of vertices of a graph by means of Boolean powers of the incidence matrix. In: Proceedings of the USSR Academy of Sciences, vol. 147, pp. 758\u2013759. Nauka (1967). (in Russian)"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2025: Theory and Practice of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-82670-2_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,6]],"date-time":"2025-09-06T04:39:25Z","timestamp":1757133565000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-82670-2_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031826696","9783031826702"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-82670-2_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"7 February 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SOFSEM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Current Trends in Theory and Practice of Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bratislava","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Slovakia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 January 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 January 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"50","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sofsem2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.sofsem.sk","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}