{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,28]],"date-time":"2026-01-28T07:56:29Z","timestamp":1769586989702,"version":"3.49.0"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031222023","type":"print"},{"value":"9783031222030","type":"electronic"}],"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_15","type":"book-chapter","created":{"date-parts":[[2023,1,18]],"date-time":"2023-01-18T08:04:02Z","timestamp":1674029042000},"page":"201-216","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["st-Orientations with\u00a0Few Transitive Edges"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5320-9110","authenticated-orcid":false,"given":"Carla","family":"Binucci","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4379-6059","authenticated-orcid":false,"given":"Walter","family":"Didimo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9806-7411","authenticated-orcid":false,"given":"Maurizio","family":"Patrignani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,19]]},"reference":[{"key":"15_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/3-540-62495-3_34","volume-title":"Graph Drawing","author":"M Alzohairi","year":"1997","unstructured":"Alzohairi, M., Rival, I.: Series-parallel planar ordered sets have pagenumber two. In: North, S. (ed.) GD 1996. LNCS, vol. 1190, pp. 11\u201324. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-62495-3_34"},{"issue":"1","key":"15_CR2","doi-asserted-by":"publisher","first-page":"53","DOI":"10.7155\/jgaa.00217","volume":"15","author":"P Angelini","year":"2011","unstructured":"Angelini, P., Cittadini, L., Didimo, W., Frati, F., Di Battista, G., Kaufmann, M., Symvonis, A.: On the perspectives opened by right angle crossing drawings. J. Graph Algorithms Appl. 15(1), 53\u201378 (2011)","journal-title":"J. Graph Algorithms Appl."},{"issue":"8","key":"15_CR3","doi-asserted-by":"publisher","first-page":"826","DOI":"10.1109\/12.868028","volume":"49","author":"P Bertolazzi","year":"2000","unstructured":"Bertolazzi, P., Di Battista, G., Didimo, W.: Computing orthogonal drawings with the minimum number of bends. IEEE Trans. Computers 49(8), 826\u2013840 (2000)","journal-title":"IEEE Trans. Computers"},{"issue":"1","key":"15_CR4","first-page":"133","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)","journal-title":"Comput. J."},{"key":"15_CR5","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)","journal-title":"Theor. Comput. Sci."},{"key":"15_CR6","unstructured":"Binucci, C., Didimo, W., Patrignani, M.: $$st$$-orientations with few transitive edges. CoRR 2208.11414 (2022). http:\/\/arxiv.org\/abs\/2208.11414"},{"key":"15_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/3-540-45749-6_25","volume-title":"Algorithms \u2014 ESA 2002","author":"U Brandes","year":"2002","unstructured":"Brandes, U.: Eager st-Ordering. In: M\u00f6hring, R., Raman, R. (eds.) ESA 2002. LNCS, vol. 2461, pp. 247\u2013256. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45749-6_25"},{"key":"15_CR8","unstructured":"Chimani, M., Gutwenger, C., J\u00fcnger, M., Klau, G.W., Klein, K., Mutzel, P.: The open graph drawing framework (OGDF). In: Handbook of Graph Drawing and Visualization, pp. 543\u2013569. Chapman and Hall\/CRC (2013)"},{"key":"15_CR9","unstructured":"Di Battista, G., Didimo, W.: Gdtoolkit. In: Handbook of Graph Drawing and Visualization, pp. 571\u2013597. Chapman and Hall\/CRC (2013)"},{"key":"15_CR10","unstructured":"Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice-Hall (1999)"},{"key":"15_CR11","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/0304-3975(88)90123-5","volume":"61","author":"G Di Battista","year":"1988","unstructured":"Di Battista, G., Tamassia, R.: Algorithms for plane representations of acyclic digraphs. Theor. Comput. Sci. 61, 175\u2013198 (1988)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"15_CR12","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/BF02187850","volume":"7","author":"GD Battista","year":"1992","unstructured":"Battista, G.D., Tamassia, R., Tollis, I.G.: Area requirement and symmetry display of planar upward drawings. Discrete Comput. Geomet. 7(4), 381\u2013401 (1992). https:\/\/doi.org\/10.1007\/BF02187850","journal-title":"Discrete Comput. Geomet."},{"issue":"4","key":"15_CR13","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1007\/s00453-005-1185-7","volume":"45","author":"E Di Giacomo","year":"2006","unstructured":"Di Giacomo, E., Didimo, W., Liotta, G., Wismath, S.K.: Book embeddability of series-parallel digraphs. Algorithmica 45(4), 531\u2013547 (2006)","journal-title":"Algorithmica"},{"issue":"1","key":"15_CR14","doi-asserted-by":"publisher","first-page":"31","DOI":"10.7155\/jgaa.00099","volume":"9","author":"M Dickerson","year":"2005","unstructured":"Dickerson, M., Eppstein, D., Goodrich, M.T., Meng, J.Y.: Confluent drawings: visualizing non-planar diagrams in a planar way. J. Graph Algorithms Appl. 9(1), 31\u201352 (2005)","journal-title":"J. Graph Algorithms Appl."},{"key":"15_CR15","doi-asserted-by":"crossref","unstructured":"Didimo, W.: Upward graph drawing. In: Encyclopedia of Algorithms, pp. 2308\u20132312 (2016)","DOI":"10.1007\/978-1-4939-2864-4_653"},{"issue":"2","key":"15_CR16","doi-asserted-by":"publisher","first-page":"221","DOI":"10.7155\/jgaa.00068","volume":"7","author":"W Didimo","year":"2003","unstructured":"Didimo, W., Pizzonia, M.: Upward embeddings and orientations of undirected planar graphs. J. Graph Algorithms Appl. 7(2), 221\u2013241 (2003)","journal-title":"J. Graph Algorithms Appl."},{"issue":"1\u20133","key":"15_CR17","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/S0166-218X(00)00172-4","volume":"103","author":"P Eades","year":"2000","unstructured":"Eades, P., Symvonis, A., Whitesides, S.: Three-dimensional orthogonal graph drawing algorithms. Discret. Appl. Math. 103(1\u20133), 55\u201387 (2000)","journal-title":"Discret. Appl. Math."},{"issue":"2","key":"15_CR18","doi-asserted-by":"publisher","first-page":"203","DOI":"10.7155\/jgaa.00067","volume":"7","author":"M Eiglsperger","year":"2003","unstructured":"Eiglsperger, M., Kaufmann, M., Eppinger, F.: An approach for mixed upward planarization. J. Graph Algorithms Appl. 7(2), 203\u2013220 (2003)","journal-title":"J. Graph Algorithms Appl."},{"issue":"7","key":"15_CR19","doi-asserted-by":"publisher","first-page":"689","DOI":"10.7155\/jgaa.00312","volume":"17","author":"D Eppstein","year":"2013","unstructured":"Eppstein, D., Simons, J.A.: Confluent Hasse diagrams. J. Graph Algorithms Appl. 17(7), 689\u2013710 (2013)","journal-title":"J. Graph Algorithms Appl."},{"issue":"3","key":"15_CR20","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1016\/0304-3975(76)90086-4","volume":"2","author":"S Even","year":"1976","unstructured":"Even, S., Tarjan, R.E.: Computing an $$st$$-numbering. Theor. Comput. Sci. 2(3), 339\u2013344 (1976)","journal-title":"Theor. Comput. Sci."},{"key":"15_CR21","doi-asserted-by":"crossref","unstructured":"Even, S., Tarjan, R.E.: Corrigendum: Computing an $$st$$-numbering. TCS 2(1976), 339\u2013344. Theor. Comput. Sci. 4(1), 123 (1977)","DOI":"10.1016\/0304-3975(76)90086-4"},{"issue":"2","key":"15_CR22","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)","journal-title":"J. Graph Algorithms Appl."},{"key":"15_CR23","doi-asserted-by":"crossref","unstructured":"Fusy, \u00c9., Narmanli, E., Schaeffer, G.: On the enumeration of plane bipolar posets and transversal structures. CoRR abs\/2105.06955 (2021)","DOI":"10.1007\/978-3-030-83823-2_90"},{"key":"15_CR24","unstructured":"Healy, P., Nikolov, N.S.: Hierarchical drawing algorithms. In: Handbook of Graph Drawing and Visualization, pp. 409\u2013453. Chapman and Hall\/CRC (2013)"},{"key":"15_CR25","doi-asserted-by":"crossref","unstructured":"J\u00fcnger, M., Mutzel, P. (eds.): Graph Drawing Software. Springer (2004)","DOI":"10.1007\/978-3-642-18638-7"},{"key":"15_CR26","doi-asserted-by":"crossref","unstructured":"Kaufmann, M., Wagner, D. (eds.): Drawing Graphs, Methods and Models (the book grow out of a Dagstuhl Seminar, April 1999), Lecture Notes in Computer Science, vol. 2025. Springer (2001)","DOI":"10.1007\/3-540-44969-8"},{"key":"15_CR27","unstructured":"Lempel, A., Even, S., Cederbaum, I.: An algorithm for planarity testing of graphs. In: Theory of Graphs: International Symposium (Rome 1966), pp. 215\u2013232. Gordon and Breach, New York (1967)"},{"issue":"1\u20133","key":"15_CR28","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. Discret. Math. 201(1\u20133), 189\u2013241 (1999)","journal-title":"Discret. Math."},{"issue":"2","key":"15_CR29","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1145\/49097.49099","volume":"19","author":"BME Moret","year":"1988","unstructured":"Moret, B.M.E.: Planar NAE3SAT is in P. SIGACT News 19(2), 51\u201354 (1988)","journal-title":"SIGACT News"},{"issue":"2\u20133","key":"15_CR30","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1016\/j.tcs.2008.08.012","volume":"408","author":"C Papamanthou","year":"2008","unstructured":"Papamanthou, C., Tollis, I.G.: Algorithms for computing a parameterized $$st$$-orientation. Theor. Comput. Sci. 408(2\u20133), 224\u2013240 (2008)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"15_CR31","doi-asserted-by":"publisher","first-page":"337","DOI":"10.7155\/jgaa.00210","volume":"14","author":"C Papamanthou","year":"2010","unstructured":"Papamanthou, C., Tollis, I.G.: Applications of parameterized $$st$$-orientations. J. Graph Algorithms Appl. 14(2), 337\u2013365 (2010)","journal-title":"J. Graph Algorithms Appl."},{"issue":"1","key":"15_CR32","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1016\/0095-8956(76)90024-1","volume":"21","author":"C Platt","year":"1976","unstructured":"Platt, C.: Planar lattices and planar graphs. J. Comb. Theory Ser. B 21(1), 30\u201339 (1976)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"4","key":"15_CR33","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/BF02187706","volume":"1","author":"P Rosenstiehl","year":"1986","unstructured":"Rosenstiehl, P., Tarjan, R.E.: Rectilinear planar layouts and bipolar orientations of planar graphs. Discrete & Computational Geometry 1(4), 343\u2013353 (1986). https:\/\/doi.org\/10.1007\/BF02187706","journal-title":"Discrete & Computational Geometry"},{"key":"15_CR34","doi-asserted-by":"crossref","unstructured":"Schaefer, T.J.: The complexity of satisfiability problems. In: Proceedings of the 10th Annual ACM Symposium on Theory of Computing, pp. 216\u2013226 (1978)","DOI":"10.1145\/800133.804350"},{"key":"15_CR35","doi-asserted-by":"crossref","unstructured":"Wiese, R., Eiglsperger, M., Kaufmann, M.: yFiles - visualization and automatic layout of graphs. In: Graph Drawing Software, pp. 173\u2013191. Springer (2004)","DOI":"10.1007\/978-3-642-18638-7_8"}],"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_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,4]],"date-time":"2024-01-04T07:04:32Z","timestamp":1704351872000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22203-0_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031222023","9783031222030"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22203-0_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"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)"}}]}}