{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T22:34:03Z","timestamp":1743114843034,"version":"3.40.3"},"publisher-location":"Cham","reference-count":10,"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_31","type":"book-chapter","created":{"date-parts":[[2022,3,16]],"date-time":"2022-03-16T00:03:49Z","timestamp":1647389029000},"page":"383-395","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Approximating the Bundled Crossing Number"],"prefix":"10.1007","author":[{"given":"Alan","family":"Arroyo","sequence":"first","affiliation":[]},{"given":"Stefan","family":"Felsner","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,3,16]]},"reference":[{"key":"31_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/978-3-319-50106-2_31","volume-title":"Graph Drawing and Network Visualization","author":"MJ Alam","year":"2016","unstructured":"Alam, M.J., Fink, M., Pupyrev, S.: The bundled crossing number. In: Hu, Y., N\u00f6llenburg, M. (eds.) GD 2016. LNCS, vol. 9801, pp. 399\u2013412. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-50106-2_31"},{"issue":"2","key":"31_CR2","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/s00283-009-9120-4","volume":"32","author":"L Beineke","year":"2010","unstructured":"Beineke, L., Wilson, R.: The early history of the brick factory problem. Math. Intell. 32(2), 41\u201348 (2010)","journal-title":"Math. Intell."},{"key":"31_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/978-3-030-35802-0_5","volume-title":"Graph Drawing and Network Visualization","author":"S Chaplick","year":"2019","unstructured":"Chaplick, S., van Dijk, T.C., Kryven, M., Park, J., Ravsky, A., Wolff, A.: Bundled crossings revisited. In: Archambault, D., T\u00f3th, C.D. (eds.) GD 2019. LNCS, vol. 11904, pp. 63\u201377. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-35802-0_5"},{"key":"31_CR4","unstructured":"Eppstein, D.: https:\/\/en.wikipedia.org\/wiki\/File:Ageev5Xcirclegraph.svg"},{"key":"31_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-11409-0_1","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"D Eppstein","year":"2010","unstructured":"Eppstein, D.: Graph-theoretic solutions to computational geometry problems. In: Paul, C., Habib, M. (eds.) WG 2009. LNCS, vol. 5911, pp. 1\u201316. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-11409-0_1"},{"key":"31_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"454","DOI":"10.1007\/978-3-662-49529-2_34","volume-title":"LATIN 2016: Theoretical Informatics","author":"M Fink","year":"2016","unstructured":"Fink, M., Hershberger, J., Suri, S., Verbeek, K.: Bundled crossings in embedded graphs. In: Kranakis, E., Navarro, G., Ch\u00e1vez, E. (eds.) LATIN 2016. LNCS, vol. 9644, pp. 454\u2013468. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49529-2_34"},{"issue":"4","key":"31_CR7","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1017\/S0013091500025645","volume":"13","author":"F Harary","year":"1963","unstructured":"Harary, F., Hill, A.: On the number of crossings in a complete graph. Proc. Edinburgh Math. Soc. 13(4), 333\u2013338 (1963)","journal-title":"Proc. Edinburgh Math. Soc."},{"issue":"1","key":"31_CR8","first-page":"58","volume":"6","author":"F Harary","year":"1973","unstructured":"Harary, F., Kainen, P.C., Schwenk, A.J.: Toroidal graphs with arbitrarily high crossing numbers. Nanta Math. 6(1), 58\u201367 (1973)","journal-title":"Nanta Math."},{"key":"31_CR9","doi-asserted-by":"crossref","unstructured":"Schaefer, M.: The graph crossing number and its variants: a survey. Electron. J. Comb., 90 (2013). Dynamic Survey 21","DOI":"10.37236\/2713"},{"issue":"1","key":"31_CR10","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1002\/jgt.3190010105","volume":"1","author":"P Tur\u00e1n","year":"1977","unstructured":"Tur\u00e1n, P.: A note of welcome. J. Graph Theory 1(1), 7\u20139 (1977)","journal-title":"J. Graph Theory"}],"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_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,16]],"date-time":"2022-03-16T00:07:23Z","timestamp":1647389243000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-96731-4_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030967307","9783030967314"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-96731-4_31","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)"}}]}}