{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T18:08:21Z","timestamp":1743012501239,"version":"3.40.3"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030358013"},{"type":"electronic","value":"9783030358020"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-35802-0_12","type":"book-chapter","created":{"date-parts":[[2019,11,27]],"date-time":"2019-11-27T23:02:50Z","timestamp":1574895770000},"page":"147-161","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["On Strict (Outer-)Confluent Graphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1441-4189","authenticated-orcid":false,"given":"Henry","family":"F\u00f6rster","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7762-8045","authenticated-orcid":false,"given":"Robert","family":"Ganian","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7791-3604","authenticated-orcid":false,"given":"Fabian","family":"Klute","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0454-3937","authenticated-orcid":false,"given":"Martin","family":"N\u00f6llenburg","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,11,28]]},"reference":[{"issue":"1","key":"12_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0166-218X(84)90073-8","volume":"8","author":"M Aigner","year":"1984","unstructured":"Aigner, M., Fromme, M.: A game of cops and robbers. Discrete Appl. Math. 8(1), 1\u201312 (1984). https:\/\/doi.org\/10.1016\/0166-218X(84)90073-8","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"12_CR2","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1109\/TVCG.2016.2598958","volume":"23","author":"B Bach","year":"2017","unstructured":"Bach, B., Riche, N.H., Hurter, C., Marriott, K., Dwyer, T.: Towards unambiguous edge bundling: investigating confluent drawings for network visualization. IEEE Trans. Vis. Comput. Graph. 23(1), 541\u2013550 (2017). https:\/\/doi.org\/10.1109\/TVCG.2016.2598958","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"issue":"1","key":"12_CR3","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1145\/174644.174650","volume":"41","author":"BS Baker","year":"1994","unstructured":"Baker, B.S.: Approximation algorithms for NP-complete problems on planar graphs. J. ACM 41(1), 153\u2013180 (1994). https:\/\/doi.org\/10.1145\/174644.174650","journal-title":"J. ACM"},{"issue":"4","key":"12_CR4","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1002\/jgt.3190140404","volume":"14","author":"C Benzaken","year":"1990","unstructured":"Benzaken, C., Crama, Y., Duchet, P., Hammer, P.L., Maffray, F.: More characterizations of triangulated graphs. J. Graph Theory 14(4), 413\u2013422 (1990). https:\/\/doi.org\/10.1002\/jgt.3190140404","journal-title":"J. Graph Theory"},{"key":"12_CR5","first-page":"165","volume":"58","author":"A Brandst\u00e4dt","year":"1987","unstructured":"Brandst\u00e4dt, A., Spinrad, J., Stewart, L.: Bipartite permutation graphs are bipartite tolerance graphs. Congressus Numerantium 58, 165\u2013174 (1987)","journal-title":"Congressus Numerantium"},{"issue":"2","key":"12_CR6","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s002249910009","volume":"33","author":"B Courcelle","year":"2000","unstructured":"Courcelle, B., Makowsky, J.A., Rotics, U.: Linear time solvable optimization problems on graphs of bounded clique-width. Theory Comput. Syst. 33(2), 125\u2013150 (2000). https:\/\/doi.org\/10.1007\/s002249910009","journal-title":"Theory Comput. Syst."},{"issue":"1\u20133","key":"12_CR7","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/S0166-218X(99)00184-5","volume":"101","author":"B Courcelle","year":"2000","unstructured":"Courcelle, B., Olariu, S.: Upper bounds to the clique width of graphs. Discrete Appl. Math. 101(1\u20133), 77\u2013114 (2000). https:\/\/doi.org\/10.1016\/S0166-218X(99)00184-5","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"12_CR8","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). https:\/\/doi.org\/10.7155\/jgaa.00099","journal-title":"J. Graph Algorithms Appl."},{"issue":"1","key":"12_CR9","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1016\/0095-8956(76)90022-8","volume":"21","author":"G Ehrlich","year":"1976","unstructured":"Ehrlich, G., Even, S., Tarjan, R.E.: Intersection graphs of curves in the plane. J. Comb. Theory Ser. B 21(1), 8\u201320 (1976). https:\/\/doi.org\/10.1016\/0095-8956(76)90022-8","journal-title":"J. Comb. Theory Ser. B"},{"key":"12_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/11618058_16","volume-title":"Graph Drawing","author":"D Eppstein","year":"2006","unstructured":"Eppstein, D., Goodrich, M.T., Meng, J.Y.: Delta-confluent drawings. In: Healy, P., Nikolov, N.S. (eds.) GD 2005. LNCS, vol. 3843, pp. 165\u2013176. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11618058_16"},{"key":"12_CR11","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1007\/s00453-006-0159-8","volume":"47","author":"D Eppstein","year":"2007","unstructured":"Eppstein, D., Goodrich, M.T., Meng, J.Y.: Confluent layered drawings. Algorithmica 47, 439\u2013452 (2007). https:\/\/doi.org\/10.1007\/s00453-006-0159-8","journal-title":"Algorithmica"},{"issue":"1","key":"12_CR12","doi-asserted-by":"publisher","first-page":"22","DOI":"10.20382\/jocg.v7i1a2","volume":"7","author":"D Eppstein","year":"2016","unstructured":"Eppstein, D., Holten, D., L\u00f6ffler, M., N\u00f6llenburg, M., Speckmann, B., Verbeek, K.: Strict confluent drawing. J. Comput. Geom. 7(1), 22\u201346 (2016). https:\/\/doi.org\/10.20382\/jocg.v7i1a2","journal-title":"J. Comput. Geom."},{"issue":"7","key":"12_CR13","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1007\/978-3-642-25878-7_2","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). https:\/\/doi.org\/10.1007\/978-3-642-25878-7_2","journal-title":"J. Graph Algorithms Appl."},{"key":"12_CR14","unstructured":"F\u00f6rster, H., Ganian, R., Klute, F., N\u00f6llenburg, M.: On strict (outer-)confluent graphs. CoRR abs\/1908.05345 (2019). http:\/\/arxiv.org\/abs\/1908.05345"},{"issue":"3","key":"12_CR15","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1145\/65950.65951","volume":"36","author":"CP Gabor","year":"1989","unstructured":"Gabor, C.P., Supowit, K.J., Hsu, W.L.: Recognizing circle graphs in polynomial time. J. ACM 36(3), 435\u2013473 (1989). https:\/\/doi.org\/10.1145\/65950.65951","journal-title":"J. ACM"},{"key":"12_CR16","doi-asserted-by":"publisher","unstructured":"Gaven\u010diak, T., Jel\u00ednek, V., Klav\u00edk, P., Kratochv\u00edl, J.: Cops and robbers on intersection graphs. In: Cai, L., Cheng, S.-W., Lam, T.-W. (eds.) ISAAC 2013. LNCS, vol. 8283, pp. 174\u2013184. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-45030-3_17, https:\/\/doi.org\/10.1016\/j.ejc.2018.04.009","DOI":"10.1007\/978-3-642-45030-3_17 10.1016\/j.ejc.2018.04.009"},{"issue":"2","key":"12_CR17","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1137\/0201013","volume":"1","author":"F Gavril","year":"1972","unstructured":"Gavril, F.: Algorithms for minimum coloring, maximum clique, minimum covering by cliques, and maximum independent set of a chordal graph. SIAM J. Comput. 1(2), 180\u2013187 (1972). https:\/\/doi.org\/10.1137\/0201013","journal-title":"SIAM J. Comput."},{"issue":"5\u20136","key":"12_CR18","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/S0020-0190(00)00025-9","volume":"73","author":"F Gavril","year":"2000","unstructured":"Gavril, F.: Maximum weight independent sets and cliques in intersection graphs of filaments. Inf. Process. Lett. 73(5\u20136), 181\u2013188 (2000). https:\/\/doi.org\/10.1016\/S0020-0190(00)00025-9","journal-title":"Inf. Process. Lett."},{"issue":"6","key":"12_CR19","doi-asserted-by":"publisher","first-page":"708","DOI":"10.1016\/j.dam.2011.05.007","volume":"160","author":"E Gioan","year":"2012","unstructured":"Gioan, E., Paul, C.: Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs. Discrete Appl. Math. 160(6), 708\u2013733 (2012). https:\/\/doi.org\/10.1016\/j.dam.2011.05.007","journal-title":"Discrete Appl. Math."},{"key":"12_CR20","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230130214","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"MC Golumbic","year":"2004","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs, vol. 57. Elsevier, Amsterdam (2004). https:\/\/doi.org\/10.1002\/net.3230130214"},{"issue":"2","key":"12_CR21","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/0166-218X(84)90016-7","volume":"9","author":"MC Golumbic","year":"1984","unstructured":"Golumbic, M.C., Monma, C.L., Trotter Jr., W.T.: Tolerance graphs. Discrete Appl. Math. 9(2), 157\u2013170 (1984). https:\/\/doi.org\/10.1016\/0166-218X(84)90016-7","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"12_CR22","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/0012-365X(83)90019-5","volume":"43","author":"MC Golumbic","year":"1983","unstructured":"Golumbic, M.C., Rotem, D., Urrutia, J.: Comparability graphs and intersection graphs. Discrete Math. 43(1), 37\u201346 (1983). https:\/\/doi.org\/10.1016\/0012-365X(83)90019-5","journal-title":"Discrete Math."},{"issue":"3","key":"12_CR23","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1142\/S0129054100000260","volume":"11","author":"MC Golumbic","year":"2000","unstructured":"Golumbic, M.C., Rotics, U.: On the clique-width of some perfect graph classes. Int. J. Found. Comput. Sci. 11(3), 423\u2013443 (2000). https:\/\/doi.org\/10.1142\/S0129054100000260","journal-title":"Int. J. Found. Comput. Sci."},{"key":"12_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/978-3-642-25870-1_18","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"MM Halld\u00f3rsson","year":"2011","unstructured":"Halld\u00f3rsson, M.M., Kitaev, S., Pyatkin, A.: Alternation graphs. In: Kolman, P., Kratochv\u00edl, J. (eds.) WG 2011. LNCS, vol. 6986, pp. 191\u2013202. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25870-1_18"},{"issue":"5","key":"12_CR25","doi-asserted-by":"publisher","first-page":"741","DOI":"10.1109\/TVCG.2006.147","volume":"12","author":"D Holten","year":"2006","unstructured":"Holten, D.: Hierarchical edge bundles: visualization of adjacency relations in hierarchical data. IEEE Trans. Vis. Comput. Graph. 12(5), 741\u2013748 (2006). https:\/\/doi.org\/10.1109\/TVCG.2006.147","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"issue":"1","key":"12_CR26","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1137\/0214018","volume":"14","author":"WL Hsu","year":"1985","unstructured":"Hsu, W.L.: Maximum weight clique algorithms for circular-arc graphs and circle graphs. SIAM J. Comput. 14(1), 224\u2013231 (1985). https:\/\/doi.org\/10.1137\/0214018","journal-title":"SIAM J. Comput."},{"issue":"4","key":"12_CR27","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/s00453-006-0165-x","volume":"47","author":"P Hui","year":"2007","unstructured":"Hui, P., Pelsmajer, M.J., Schaefer, M., Stefankovic, D.: Train tracks and confluent drawings. Algorithmica 47(4), 465\u2013479 (2007). https:\/\/doi.org\/10.1007\/s00453-006-0165-x","journal-title":"Algorithmica"},{"issue":"1","key":"12_CR28","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/0095-8956(91)90090-7","volume":"52","author":"J Kratochv\u00edl","year":"1991","unstructured":"Kratochv\u00edl, J.: String graphs. I. The number of critical nonstring graphs is infinite. J. Comb. Theory Ser. B 52(1), 53\u201366 (1991). https:\/\/doi.org\/10.1016\/0095-8956(91)90090-7","journal-title":"J. Comb. Theory Ser. B"},{"issue":"1","key":"12_CR29","doi-asserted-by":"publisher","first-page":"160","DOI":"10.4153\/CJM-1971-016-5","volume":"23","author":"A Pnueli","year":"1971","unstructured":"Pnueli, A., Lempel, A., Even, S.: Transitive orientation of graphs and identification of permutation graphs. Can. J. Math. 23(1), 160\u2013175 (1971). https:\/\/doi.org\/10.4153\/CJM-1971-016-5","journal-title":"Can. J. Math."},{"key":"12_CR30","unstructured":"Roberts, F.S.: Indifference graphs. In: Proof Techniques in Graph Theory, pp. 139\u2013146 (1969)"},{"issue":"3","key":"12_CR31","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1145\/322326.322328","volume":"29","author":"K Takamizawa","year":"1982","unstructured":"Takamizawa, K., Nishizeki, T., Saito, N.: Linear-time computability of combinatorial problems on series-parallel graphs. J. ACM 29(3), 623\u2013641 (1982). https:\/\/doi.org\/10.1145\/322326.322328","journal-title":"J. ACM"},{"key":"12_CR32","doi-asserted-by":"publisher","DOI":"10.1137\/1035116","volume-title":"Combinatorics and Partially Ordered Sets: Dimension Theory","author":"WT Trotter","year":"2001","unstructured":"Trotter, W.T.: Combinatorics and Partially Ordered Sets: Dimension Theory, vol. 6. JHU Press, Baltimore (2001). https:\/\/doi.org\/10.1137\/1035116"},{"key":"12_CR33","unstructured":"Wegner, G.: Eigenschaften der Nerven homologisch-einfacher Familien im Rn. Ph.D. thesis, Universit\u00e4t G\u00f6ttingen (1967)"},{"issue":"1\u20132","key":"12_CR34","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/0304-3975(94)00220-D","volume":"147","author":"CW Yu","year":"1995","unstructured":"Yu, C.W., Chen, G.H.: Efficient parallel algorithms for doubly convex-bipartite graphs. Theoret. Comput. Sci. 147(1\u20132), 249\u2013265 (1995). https:\/\/doi.org\/10.1016\/0304-3975(94)00220-D","journal-title":"Theoret. Comput. Sci."}],"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-030-35802-0_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,28]],"date-time":"2023-11-28T01:03:31Z","timestamp":1701133411000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-35802-0_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030358013","9783030358020"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-35802-0_12","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":"28 November 2019","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":"Prague","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Czech Republic","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":"17 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gd2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/kam.mff.cuni.cz\/gd2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-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":"113","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":"34","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":"8","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":"30% - 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.11","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":"12.55","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)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}