{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:47:48Z","timestamp":1742914068157,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031222023"},{"type":"electronic","value":"9783031222030"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-22203-0_30","type":"book-chapter","created":{"date-parts":[[2023,1,18]],"date-time":"2023-01-18T08:04:02Z","timestamp":1674029042000},"page":"418-431","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Coloring Mixed and\u00a0Directional Interval Graphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3313-1237","authenticated-orcid":false,"given":"Grzegorz","family":"Gutowski","sequence":"first","affiliation":[]},{"given":"Florian","family":"Mittelst\u00e4dt","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3794-4406","authenticated-orcid":false,"given":"Ignaz","family":"Rutter","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2601-6452","authenticated-orcid":false,"given":"Joachim","family":"Spoerhase","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5872-718X","authenticated-orcid":false,"given":"Alexander","family":"Wolff","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7398-718X","authenticated-orcid":false,"given":"Johannes","family":"Zink","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,1,19]]},"reference":[{"issue":"3","key":"30_CR1","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1002\/jgt.22157","volume":"87","author":"J Bang-Jensen","year":"2018","unstructured":"Bang-Jensen, J., Huang, J., Zhu, X.: Completing orientations of partially oriented graphs. J. Graph Theory 87(3), 285\u2013304 (2018). https:\/\/doi.org\/10.1002\/jgt.22157","journal-title":"J. Graph Theory"},{"issue":"1","key":"30_CR2","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1093\/comjnl\/bxv082","volume":"59","author":"C Binucci","year":"2016","unstructured":"Binucci, C., Didimo, W.: Computing quasi-upward planar drawings of mixed graphs. Comput. J. 59(1), 133\u2013150 (2016). https:\/\/doi.org\/10.1093\/comjnl\/bxv082","journal-title":"Comput. J."},{"key":"30_CR3","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.tcs.2014.01.015","volume":"526","author":"C Binucci","year":"2014","unstructured":"Binucci, C., Didimo, W., Patrignani, M.: Upward and quasi-upward planarity testing of embedded mixed graphs. Theor. Comput. Sci. 526, 75\u201389 (2014). https:\/\/doi.org\/10.1016\/j.tcs.2014.01.015","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"30_CR4","doi-asserted-by":"publisher","first-page":"253","DOI":"10.7155\/jgaa.00322","volume":"18","author":"F Frati","year":"2014","unstructured":"Frati, F., Kaufmann, M., Pach, J., T\u00f3th, C.D., Wood, D.R.: On the upward planarity of mixed plane graphs. J. Graph Algorithms Appl. 18(2), 253\u2013279 (2014). https:\/\/doi.org\/10.7155\/jgaa.00322","journal-title":"J. Graph Algorithms Appl."},{"issue":"4","key":"30_CR5","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/j.ipl.2007.11.003","volume":"106","author":"H Furma\u0144czyk","year":"2008","unstructured":"Furma\u0144czyk, H., Kosowski, A., \u017byli\u0144ski, P.: A note on mixed tree coloring. Inf. Process. Lett. 106(4), 133\u2013135 (2008). https:\/\/doi.org\/10.1016\/j.ipl.2007.11.003","journal-title":"Inf. Process. Lett."},{"key":"30_CR6","doi-asserted-by":"publisher","unstructured":"Furma\u0144czyk, H., Kosowski, A., \u017byli\u0144ski, P.: Scheduling with precedence constraints: mixed graph coloring in series-parallel graphs. In: Proceedings of PPAM 2007, pp. 1001\u20131008 (2008). https:\/\/doi.org\/10.1007\/978-3-540-68111-3_106","DOI":"10.1007\/978-3-540-68111-3_106"},{"key":"30_CR7","doi-asserted-by":"publisher","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York (1980). https:\/\/doi.org\/10.1002\/net.3230130214","DOI":"10.1002\/net.3230130214"},{"key":"30_CR8","doi-asserted-by":"crossref","unstructured":"Gutowski, G., Mittelst\u00e4dt, F., Rutter, I., Spoerhase, J., Wolff, A., Zink, J.: Coloring mixed and directional interval graphs. arXiv report (2022). http:\/\/arxiv.org\/abs\/2208.14250","DOI":"10.1007\/978-3-031-22203-0_30"},{"key":"30_CR9","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/BF01194253","volume":"45","author":"P Hansen","year":"1997","unstructured":"Hansen, P., Kuplinsky, J., de Werra, D.: Mixed graph colorings. Math. Methods Oper. Res. 45, 145\u2013160 (1997). https:\/\/doi.org\/10.1007\/BF01194253","journal-title":"Math. Methods Oper. Res."},{"key":"30_CR10","doi-asserted-by":"publisher","unstructured":"Klav\u00edk, P., et al.: Extending partial representations of proper and unit interval graphs. Algorithmica 77(4), 1071\u20131104 (2016). https:\/\/doi.org\/10.1007\/s00453-016-0133-z","DOI":"10.1007\/s00453-016-0133-z"},{"key":"30_CR11","unstructured":"Korte, N., M\u00f6hring, R.H.: Transitive orientation of graphs with side constraints. In: Proceedings of WG 1985, pp. 143\u2013160 (1985)"},{"issue":"1","key":"30_CR12","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1137\/0218005","volume":"18","author":"N Korte","year":"1989","unstructured":"Korte, N., M\u00f6hring, R.H.: An incremental linear-time algorithm for recognizing interval graphs. SIAM J. Comput. 18(1), 68\u201381 (1989). https:\/\/doi.org\/10.1137\/0218005","journal-title":"SIAM J. Comput."},{"issue":"2","key":"30_CR13","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1145\/322123.322125","volume":"26","author":"GS Lueker","year":"1979","unstructured":"Lueker, G.S., Booth, K.S.: A linear time algorithm for deciding interval graph isomorphism. J. ACM 26(2), 183\u2013195 (1979). https:\/\/doi.org\/10.1145\/322123.322125","journal-title":"J. ACM"},{"issue":"1","key":"30_CR14","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/S0012-365X(98)00319-7","volume":"201","author":"RM McConnell","year":"1999","unstructured":"McConnell, R.M., Spinrad, J.P.: Modular decomposition and transitive orientation. Discrete Math. 201(1), 189\u2013241 (1999). https:\/\/doi.org\/10.1016\/S0012-365X(98)00319-7","journal-title":"Discrete Math."},{"issue":"3","key":"30_CR15","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1016\/j.ejc.2007.03.006","volume":"29","author":"B Ries","year":"2008","unstructured":"Ries, B., de Werra, D.: On two coloring problems in mixed graphs. Eur. J. Comb. 29(3), 712\u2013725 (2008). https:\/\/doi.org\/10.1016\/j.ejc.2007.03.006","journal-title":"Eur. J. Comb."},{"key":"30_CR16","doi-asserted-by":"publisher","unstructured":"Sotskov, Y.N.: Mixed graph colorings: a historical review. Mathematics 8(3), 385 (2020). https:\/\/doi.org\/10.3390\/math8030385","DOI":"10.3390\/math8030385"},{"key":"30_CR17","unstructured":"Sotskov, Y.N., Tanaev, V.S.: Chromatic polynomial of a mixed graph. Vestsi Akademii Navuk BSSR. Seryya Fizika-Matematychnykh Navuk 6, 20\u201323 (1976)"},{"issue":"2","key":"30_CR18","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1109\/TSMC.1981.4308636","volume":"11","author":"K Sugiyama","year":"1981","unstructured":"Sugiyama, K., Tagawa, S., Toda, M.: Methods for visual understanding of hierarchical system structures. IEEE Trans. Syst. Man Cybern. 11(2), 109\u2013125 (1981). https:\/\/doi.org\/10.1109\/TSMC.1981.4308636","journal-title":"IEEE Trans. Syst. Man Cybern."},{"issue":"101886","key":"30_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.comgeo.2022.101886","volume":"105\u2013106","author":"J Zink","year":"2022","unstructured":"Zink, J., Walter, J., Baumeister, J., Wolff, A.: Layered drawing of undirected graphs with generalized port constraints. Comput. Geom. 105\u2013106(101886), 1\u201329 (2022). https:\/\/doi.org\/10.1016\/j.comgeo.2022.101886","journal-title":"Comput. Geom."}],"container-title":["Lecture Notes in Computer Science","Graph Drawing and Network Visualization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-22203-0_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,4]],"date-time":"2024-01-04T07:05:54Z","timestamp":1704351954000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22203-0_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031222023","9783031222030"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22203-0_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"19 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"GD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Graph Drawing and Network Visualization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tokyo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gd2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/graphdrawing.github.io\/gd2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"70","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"25","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"7","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"36% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.01","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"7.03","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}