{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T15:03:38Z","timestamp":1743087818943,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031231001"},{"type":"electronic","value":"9783031231018"}],"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-23101-8_1","type":"book-chapter","created":{"date-parts":[[2022,12,19]],"date-time":"2022-12-19T20:18:53Z","timestamp":1671481133000},"page":"3-17","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Complexity of\u00a0Finding Tangles"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9450-7640","authenticated-orcid":false,"given":"Oksana","family":"Firman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5764-7719","authenticated-orcid":false,"given":"Philipp","family":"Kindermann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4532-3765","authenticated-orcid":false,"given":"Boris","family":"Klemz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Ravsky","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5872-718X","authenticated-orcid":false,"given":"Alexander","family":"Wolff","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7398-718X","authenticated-orcid":false,"given":"Johannes","family":"Zink","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,1]]},"reference":[{"key":"1_CR1","doi-asserted-by":"publisher","unstructured":"Bereg, S., Holroyd, A., Nachmanson, L., Pupyrev, S.: Representing permutations with few moves. SIAM J. Discrete Math. 30(4), 1950\u20131977 (2016). https:\/\/arxiv.org\/abs\/1508.03674, https:\/\/doi.org\/10.1137\/15M1036105","DOI":"10.1137\/15M1036105"},{"key":"1_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1007\/978-3-319-03841-4_42","volume-title":"Graph Drawing","author":"S Bereg","year":"2013","unstructured":"Bereg, S., Holroyd, A.E., Nachmanson, L., Pupyrev, S.: Drawing permutations with few corners. In: Wismath, S., Wolff, A. (eds.) GD 2013. LNCS, vol. 8242, pp. 484\u2013495. Springer, Cham (2013). https:\/\/doi.org\/10.1007\/978-3-319-03841-4_42"},{"key":"1_CR3","doi-asserted-by":"publisher","unstructured":"Birman, J.S., Williams, R.F.: Knotted periodic orbits in dynamical systems\u2014I: Lorenz\u2019s equation. Topology 22(1), 47\u201382 (1983). https:\/\/doi.org\/10.1016\/0040-9383(83)90045-9","DOI":"10.1016\/0040-9383(83)90045-9"},{"issue":"12","key":"1_CR4","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1038\/scientificamerican1286-46","volume":"254","author":"JP Crutchfield","year":"1986","unstructured":"Crutchfield, J.P., Farmer, J.D., Packard, N.H., Shaw, R.S.: Chaos. Sci. Am. 254(12), 46\u201357 (1986)","journal-title":"Sci. Am."},{"key":"1_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/978-3-030-35802-0_16","volume-title":"Graph Drawing and Network Visualization","author":"O Firman","year":"2019","unstructured":"Firman, O., Kindermann, P., Ravsky, A., Wolff, A., Zink, J.: Computing height-optimal tangles\u00a0faster. In: Archambault, D., T\u00f3th, C.D. (eds.) GD 2019. LNCS, vol. 11904, pp. 203\u2013215. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-35802-0_16"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Kauffman, S.A.: The Origins of Order: Self-Organization and Selection in Evolution. Oxford University Press, Oxford (1993)","DOI":"10.1007\/978-94-015-8054-0_8"},{"key":"1_CR7","unstructured":"Kindermann, P., Zink, J.: Java and Python code for computing tangles. Github repository (2022). https:\/\/github.com\/PhKindermann\/chaotic-attractors"},{"key":"1_CR8","unstructured":"Knuth, D.E.: The Art of Computer Programming, Volume III: Sorting and Searching, 2nd edn. Addison-Wesley, Boston (1998). https:\/\/www.worldcat.org\/oclc\/312994415"},{"key":"1_CR9","doi-asserted-by":"publisher","unstructured":"Mindlin, G., Hou, X.-J., Gilmore, R., Solari, H., Tufillaro, N.B.: Classification of strange attractors by integers. Phys. Rev. Lett. 64, 2350\u20132353 (1990). https:\/\/doi.org\/10.1103\/PhysRevLett.64.2350","DOI":"10.1103\/PhysRevLett.64.2350"},{"key":"1_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1007\/978-3-030-04414-5_8","volume-title":"Graph Drawing and Network Visualization","author":"M Olszewski","year":"2018","unstructured":"Olszewski, M., et al.: Visualizing the template of a chaotic attractor. In: Biedl, T., Kerren, A. (eds.) GD 2018. LNCS, vol. 11282, pp. 106\u2013119. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-04414-5_8"},{"key":"1_CR11","doi-asserted-by":"publisher","unstructured":"Sado, K., Igarashi, Y.: A function for evaluating the computing time of a bubbling system. Theor. Comput. Sci. 54, 315\u2013324 (1987). https:\/\/doi.org\/10.1016\/0304-3975(87)90136-8","DOI":"10.1016\/0304-3975(87)90136-8"},{"key":"1_CR12","doi-asserted-by":"publisher","unstructured":"Schaefer, T.J.: The complexity of satisfiability problems. In: Proceedings of 10th Annual ACM Symposium on Theory Computing (STOC\u201978), pp. 216\u2013226 (1978). https:\/\/doi.org\/10.1145\/800133.804350","DOI":"10.1145\/800133.804350"},{"key":"1_CR13","unstructured":"Stewart, I.: Does God Play Dice?: The New Mathematics of Chaos. Penguin (1997)"},{"key":"1_CR14","first-page":"436","volume":"48","author":"P Tur\u00e1n","year":"1941","unstructured":"Tur\u00e1n, P.: On an external problem in graph theory. Mat. Fiz. Lapok 48, 436\u2013452 (1941)","journal-title":"Mat. Fiz. Lapok"},{"key":"1_CR15","doi-asserted-by":"publisher","unstructured":"Wang, D.C., Novel routing schemes for IC layout part I: two-layer channel routing. In: Proceedings of 28th ACM\/IEEE Design Automation Conference (DAC 1991), pp. 49\u201353 (1991). https:\/\/doi.org\/10.1145\/127601.127626","DOI":"10.1145\/127601.127626"},{"key":"1_CR16","unstructured":"Yamanaka, K., Horiyama, T., Uno, T., Wasa, K.: Ladder-lottery realization. In: Proceedings of 30th Canadian Conference on Computational Geometry (CCCG), pp. 61\u201367 (2018). http:\/\/www.cs.umanitoba.ca\/~cccg2018\/papers\/session2A-p3.pdf"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2023: Theory and Practice of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-23101-8_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,7]],"date-time":"2023-01-07T00:05:05Z","timestamp":1673049905000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-23101-8_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031231001","9783031231018"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-23101-8_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"1 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SOFSEM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Current Trends in Theory and Practice of Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nov\u00fd Smokovec","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Slovakia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 January 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 January 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"48","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sofsem2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ics.science.upjs.sk\/sofsem2023\/","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":"43","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":"26","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":"60% - 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":"6-7","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)"}}]}}