{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:31:25Z","timestamp":1742913085913,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030967307"},{"type":"electronic","value":"9783030967314"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-030-96731-4_9","type":"book-chapter","created":{"date-parts":[[2022,3,16]],"date-time":"2022-03-16T00:03:49Z","timestamp":1647389029000},"page":"97-108","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["StreamTable: An Area Proportional Visualization for\u00a0Tables with\u00a0Flowing Streams"],"prefix":"10.1007","author":[{"given":"Jared","family":"Espenant","sequence":"first","affiliation":[]},{"given":"Debajyoti","family":"Mondal","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,3,16]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Abrahamsen, M., Miltzow, T., Seiferth, N.: Framework for ER-completeness of two-dimensional packing problems. In: Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science (FOCS), pp. 1014\u20131021. IEEE (2020)","key":"9_CR1","DOI":"10.1109\/FOCS46700.2020.00098"},{"issue":"3","key":"9_CR2","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1111\/cgf.12910","volume":"35","author":"MD Bartolomeo","year":"2016","unstructured":"Bartolomeo, M.D., Hu, Y.: There is more to streamgraphs than movies: better aesthetics via ordering and lassoing. Comput. Graph. Forum 35(3), 341\u2013350 (2016)","journal-title":"Comput. Graph. Forum"},{"issue":"1","key":"9_CR3","first-page":"100","volume":"7","author":"K Buchin","year":"2016","unstructured":"Buchin, K., Eppstein, D., L\u00f6ffler, M., N\u00f6llenburg, M., Silveira, R.I.: Adjacency-preserving spatial treemaps. J. Comput. Geom. 7(1), 100\u2013122 (2016)","journal-title":"J. Comput. Geom."},{"issue":"6","key":"9_CR4","doi-asserted-by":"publisher","first-page":"1245","DOI":"10.1109\/TVCG.2008.166","volume":"14","author":"L Byron","year":"2008","unstructured":"Byron, L., Wattenberg, M.: Stacked graphs - geometry & aesthetics. IEEE Trans. Vis. Comput. Graph. 14(6), 1245\u20131252 (2008)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"doi-asserted-by":"crossref","unstructured":"Chen, T., Fan, M.K.H.: On convex formulation of the floorplan area minimization problem. In: Sarrafzadeh, M. (ed.) Proceedings of the 1998 International Symposium on Physical Design (ISPD), pp. 124\u2013128. ACM (1998)","key":"9_CR5","DOI":"10.1145\/274535.274553"},{"issue":"3","key":"9_CR6","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1137\/110834032","volume":"41","author":"D Eppstein","year":"2012","unstructured":"Eppstein, D., Mumford, E., Speckmann, B., Verbeek, K.: Area-universal and constrained rectangular layouts. SIAM J. Comput. 41(3), 537\u2013564 (2012)","journal-title":"SIAM J. Comput."},{"doi-asserted-by":"crossref","unstructured":"Espenant, J., Mondal, D.: StreamTable: an area proportional visualization for tables with flowing streams. arXiv:2103.15037 (2021)","key":"9_CR7","DOI":"10.1007\/978-3-030-96731-4_9"},{"key":"9_CR8","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1016\/j.comgeo.2017.06.010","volume":"68","author":"WS Evans","year":"2018","unstructured":"Evans, W.S., et al.: Table cartogram. Comput. Geom. 68, 174\u2013185 (2018)","journal-title":"Comput. Geom."},{"issue":"4","key":"9_CR9","doi-asserted-by":"publisher","first-page":"704","DOI":"10.1137\/0205049","volume":"5","author":"MR Garey","year":"1976","unstructured":"Garey, M.R., Johnson, D.S., Tarjan, R.E.: The planar Hamiltonian circuit problem is NP-complete. SIAM J. Comput. 5(4), 704\u2013714 (1976)","journal-title":"SIAM J. Comput."},{"key":"9_CR10","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, San Francisco (1979)"},{"unstructured":"Gurobi Optimization, L.: Gurobi optimizer reference manual (2020). https:\/\/www.gurobi.com\/wp-content\/plugins\/hd_documentations\/documentation\/9.1\/refman.pdf","key":"9_CR11"},{"doi-asserted-by":"publisher","unstructured":"Hasan, M.R., Tasnim, D.M.J., Schneider, K.A.: Putting table cartograms into practice. In: Proceedings of the 16th International Symposium on Visual Computing (ISVC), vol. 13017, pp. 91\u2013102. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-90439-5_8","key":"9_CR12","DOI":"10.1007\/978-3-030-90439-5_8"},{"issue":"1","key":"9_CR13","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1109\/2945.981848","volume":"8","author":"S Havre","year":"2002","unstructured":"Havre, S., Hetzler, E.G., Whitney, P., Nowell, L.T.: ThemeRiver: visualizing thematic changes in large document collections. IEEE Trans. Vis. Comput. Graph. 8(1), 9\u201320 (2002)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"9_CR14","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/3-540-44590-0_37","volume-title":"Theory and Application of Diagrams","author":"E M\u00e4kinen","year":"2000","unstructured":"M\u00e4kinen, E., Siirtola, H.: Reordering the reorderable matrix as an algorithmic problem. In: Anderson, M., Cheng, P., Haarslev, V. (eds.) Diagrams 2000. LNCS (LNAI), vol. 1889, pp. 453\u2013468. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44590-0_37"},{"issue":"1","key":"9_CR15","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1137\/0208008","volume":"8","author":"J Opatrny","year":"1979","unstructured":"Opatrny, J.: Total ordering problem. SIAM J. Comput. 8(1), 111\u2013114 (1979)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"9_CR16","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/BF01415168","volume":"33","author":"E Rosenberg","year":"1989","unstructured":"Rosenberg, E.: Optimal module sizing in VLSI floorplanning by nonlinear programming. ZOR Meth. Model. Oper. Res. 33(2), 131\u2013143 (1989)","journal-title":"ZOR Meth. Model. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-96731-4_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,29]],"date-time":"2023-01-29T06:56:01Z","timestamp":1674975361000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-96731-4_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030967307","9783030967314"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-96731-4_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"16 March 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WALCOM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference and Workshops on Algorithms and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Jember","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Indonesia","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":"24 March 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 March 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"walcom2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/walcom2022.unej.ac.id\/","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":"89","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":"30","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":"0","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":"34% - 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","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":"2-9","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":"The proceedings also include 3 invited papers.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}