{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T14:48:00Z","timestamp":1754146080680,"version":"3.41.2"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031987397","type":"print"},{"value":"9783031987403","type":"electronic"}],"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-98740-3_5","type":"book-chapter","created":{"date-parts":[[2025,7,17]],"date-time":"2025-07-17T23:48:43Z","timestamp":1752796123000},"page":"58-71","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Drawing Reeb Graphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8333-3676","authenticated-orcid":false,"given":"Erin","family":"Chambers","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1908-0154","authenticated-orcid":false,"given":"Brittany Terese","family":"Fasy","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2548-7428","authenticated-orcid":false,"given":"Erfan","family":"Hosseini Sereshgi","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0001-9403-8856","authenticated-orcid":false,"given":"Maarten","family":"L\u00f6ffler","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,7,18]]},"reference":[{"key":"5_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/3-540-44969-8_5","volume-title":"Drawing Graphs","author":"O Bastert","year":"2001","unstructured":"Bastert, O., Matuszewski, C.: Layered drawings of digraphs. In: Kaufmann, M., Wagner, D. (eds.) Drawing Graphs. LNCS, vol. 2025, pp. 87\u2013120. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44969-8_5"},{"key":"5_CR2","volume-title":"Graph Drawing: Algorithms for the Visualization of Graphs","author":"G Di Battista","year":"1998","unstructured":"Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of Graphs, 1st edn. Prentice Hall PTR, USA (1998)","edition":"1"},{"issue":"13","key":"5_CR3","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/j.tcs.2007.10.018","volume":"392","author":"S Biasotti","year":"2008","unstructured":"Biasotti, S., Giorgi, D., Spagnuolo, M., Falcidieno, B.: Reeb graphs for shape analysis and applications. Theor. Comput. Sci.: Comput. Algebraic Geom. Appl. 392(13), 5\u201322 (2008). https:\/\/doi.org\/10.1016\/j.tcs.2007.10.018","journal-title":"Theor. Comput. Sci.: Comput. Algebraic Geom. Appl."},{"key":"5_CR4","unstructured":"Chambers, E., Fasy, B.T., Sereshgi, E.H., L\u00f6ffler, M., Percival, S.: Drawing reeb graphs. In: 31st International Symposium on Graph Drawing and Network Visualization, Revised Selected Papers, Part II. Springer (2023)"},{"key":"5_CR5","unstructured":"Chambers, E., Fasy, B.T., Sereshgi, E.H., L\u00f6ffler, M.: Drawing reeb graphs. arXiv:2504.21329 (2025)"},{"issue":"1","key":"5_CR6","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/bf02122694","volume":"10","author":"H De Fraysseix","year":"1990","unstructured":"De Fraysseix, H., Pach, J., Pollack, R.: How to draw a planar graph on a grid. Combinatorica 10(1), 41\u201351 (1990). https:\/\/doi.org\/10.1007\/bf02122694","journal-title":"Combinatorica"},{"key":"5_CR7","doi-asserted-by":"publisher","unstructured":"de\u00a0Silva, V., Munch, E., Patel, A.: Categorified Reeb graphs. Discrete Comput. Geom. 1\u201353 (2016). https:\/\/doi.org\/10.1007\/s00454-016-9763-9","DOI":"10.1007\/s00454-016-9763-9"},{"key":"5_CR8","unstructured":"Di\u00a0Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Layered Drawings of Digraphs, pp. 265\u2013302. Prentice Hall (1998)"},{"key":"5_CR9","doi-asserted-by":"publisher","unstructured":"Edelsbrunner, H., Harer, J., Patel, A.K.: Reeb spaces of piecewise linear mappings. In: Proceedings of the Twenty-fourth Annual Symposium on Computational Geometry, SCG 2008, pp. 242\u2013250. ACM, New York (2008). https:\/\/doi.org\/10.1145\/1377676.1377720","DOI":"10.1145\/1377676.1377720"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Estrella-Balderrama, A., Fowler, J.J., Kobourov, S.G.: On the characterization of level planar trees by minimal patterns. In: International Symposium Graph Drawing and Network Visualization (2009). https:\/\/api.semanticscholar.org\/CorpusID:11606029","DOI":"10.1007\/978-3-642-11805-0_9"},{"key":"5_CR11","unstructured":"Fink, S.D., Pfretzschner, M., Rutter, I., Stumpf, P.: Level planarity is more difficult than we thought. In: 32nd International Symposium on Graph Drawing and Network Visualization (GD 2024), pp. 50\u20131. Schloss Dagstuhl\u2013Leibniz-Zentrum f\u00fcr Informatik (2024)"},{"issue":"3","key":"5_CR12","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1137\/0604033","volume":"4","author":"MR Garey","year":"1983","unstructured":"Garey, M.R., Johnson, D.S.: Crossing number is NP-complete. SIAM J. Algebraic Discrete Methods 4(3), 312\u2013316 (1983). https:\/\/doi.org\/10.1137\/0604033","journal-title":"SIAM J. Algebraic Discrete Methods"},{"issue":"3","key":"5_CR13","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","volume":"1","author":"MR Garey","year":"1976","unstructured":"Garey, M.R., Johnson, D.S., Stockmeyer, L.: Some simplified NP-complete graph problems. Theor. Comput. Sci. 1(3), 237\u2013267 (1976). https:\/\/doi.org\/10.1016\/0304-3975(76)90059-1","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"5_CR14","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF01108622","volume":"12","author":"A Garg","year":"1995","unstructured":"Garg, A., Tamassia, R.: Upward planarity testing. Order 12(2), 109\u2013133 (1995). https:\/\/doi.org\/10.1007\/BF01108622","journal-title":"Order"},{"issue":"2","key":"5_CR15","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1137\/S0097539794277123","volume":"31","author":"A Garg","year":"2001","unstructured":"Garg, A., Tamassia, R.: On the computational complexity of upward and rectilinear planarity testing. SIAM J. Comput. 31(2), 601\u2013625 (2001). https:\/\/doi.org\/10.1137\/S0097539794277123","journal-title":"SIAM J. Comput."},{"key":"5_CR16","doi-asserted-by":"publisher","unstructured":"Harvey, W., Wang, Y., Wenger, R.: A randomized $$O(m \\log m)$$ time algorithm for computing Reeb graphs of arbitrary simplicial complexes. In: Proceedings of the 2010 annual symposium on Computational geometry, SoCG 2010, pp. 267\u2013276. ACM, New York (2010). https:\/\/doi.org\/10.1145\/1810959.1811005","DOI":"10.1145\/1810959.1811005"},{"key":"5_CR17","doi-asserted-by":"crossref","unstructured":"J\u00fcnger, M., Leipert, S.: Level planar embedding in linear time. In: Kratochv\u00edyl, J. (ed.) Graph Drawing, pp. 72\u201381. Springer, Heidelberg (1999)","DOI":"10.1007\/3-540-46648-7_7"},{"key":"5_CR18","unstructured":"Kurlin, V.: Book embeddings of Reeb graphs (2013). 10.48550\/ARXIV.1312.1725"},{"key":"5_CR19","unstructured":"Parsa, S.: A deterministic $$O(m \\log m)$$ time algorithm for the Reeb graph. In: Proceedings of the 28th Annual ACM Symposium on Computational Geometry, SoCG 2012. ACM (2012)"},{"key":"5_CR20","unstructured":"Reeb, G.: Sur les points singuliers d\u2019une forme de pfaff completement integrable ou d\u2019une fonction numerique [on the singular points of a completely integrable pfaff form or of a numerical function]. Comptes Rendus Acad. Sci. Paris 222, 847\u2013849 (1946). https:\/\/cir.nii.ac.jp\/crid\/1571417125676878592"},{"issue":"2","key":"5_CR21","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. SMC 11(2), 109\u2013125 (1981). https:\/\/doi.org\/10.1109\/TSMC.1981.4308636","journal-title":"IEEE Trans. Syst. Man Cybern. SMC"},{"key":"5_CR22","doi-asserted-by":"crossref","unstructured":"Yan, L., et al.: Scalar field comparison with topological descriptors: properties and applications for scientific visualization. In: Computer Graphics Forum, vol. 40, pp. 599\u2013633. Wiley Online Library (2021)","DOI":"10.1111\/cgf.14331"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-98740-3_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,17]],"date-time":"2025-07-17T23:48:45Z","timestamp":1752796125000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-98740-3_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031987397","9783031987403"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-98740-3_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"18 July 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to disclose that\u00a0are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"IWOCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bozeman, MT","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","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 July 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 July 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"36","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.cs.montana.edu\/bhz\/iwoca2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}