{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:32:35Z","timestamp":1742913155726,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030810962"},{"type":"electronic","value":"9783030810979"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-81097-9_16","type":"book-chapter","created":{"date-parts":[[2021,7,19]],"date-time":"2021-07-19T23:04:38Z","timestamp":1626735878000},"page":"197-202","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Gauss-Lintel, an Algorithm Suite for Exploring Chord Diagrams"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3056-008X","authenticated-orcid":false,"given":"Abdullah","family":"Khan","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3820-643X","authenticated-orcid":false,"given":"Alexei","family":"Lisitsa","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0179-9099","authenticated-orcid":false,"given":"Alexei","family":"Vernitski","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,7,20]]},"reference":[{"key":"16_CR1","unstructured":"The On-Line Encyclopedia of Integer Sequences. http:\/\/oeis.org\/A264759"},{"key":"16_CR2","doi-asserted-by":"crossref","unstructured":"Biryukov, O.N.: Parity conditions for realizability of Gauss diagrams. J. Knot Theor. Ramifications 28(1), 1950015 (2019)","DOI":"10.1142\/S0218216519500159"},{"issue":"2","key":"16_CR3","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1142\/S0218216596000102","volume":"5","author":"G Cairns","year":"1996","unstructured":"Cairns, G., Elton, D.M.: The planarity porblem II. J. Knot Theor. Ramification 5(2), 137\u2013144 (1996)","journal-title":"J. Knot Theor. Ramification"},{"key":"16_CR4","unstructured":"Chmutov, M., Hulse, T., Lum, A., Rowell, P.: Plane and spherical curves: an investigation of their invariants. In: Summer Mathematics Research Institute, REU 2006 Proceedings, Oregon State University (2006)"},{"key":"16_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1007\/3-540-63938-1_65","volume-title":"Graph Drawing","author":"H de Fraysseix","year":"1997","unstructured":"de Fraysseix, H., Ossona de Mendez, P.: A short proof of a Gauss problem. In: DiBattista, G. (ed.) GD 1997. LNCS, vol. 1353, pp. 230\u2013235. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-63938-1_65"},{"key":"16_CR6","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/BF02401740","volume":"67","author":"M Dehn","year":"1936","unstructured":"Dehn, M.: \u00dcber Kombinatorische Topologie. Acta Math. 67, 123\u2013168 (1936)","journal-title":"Acta Math."},{"key":"16_CR7","volume-title":"Werke","author":"CF Gauss","year":"1900","unstructured":"Gauss, C.F.: Werke, vol. VII. Tuebner, Leipzig (1900)"},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"Grinblat, A., Lopatkin, V.: On realizabilty of Gauss diagrams and constructions of meanders. J. Knot Theor. Ramifications 29(5), 2050031 (2020)","DOI":"10.1142\/S0218216520500315"},{"issue":"7","key":"16_CR9","doi-asserted-by":"publisher","first-page":"663","DOI":"10.1006\/eujc.1999.0314","volume":"20","author":"LH Kauffman","year":"1999","unstructured":"Kauffman, L.H.: Virtual knot theory. Eur. J. Comb. 20(7), 663\u2013691 (1999)","journal-title":"Eur. J. Comb."},{"key":"16_CR10","unstructured":"Khan, A., Lisitsa, A., Vernitski, A.: Experimental mathematics approach to Gauss diagrams realizability. arxiv:2103.02102 (2021)"},{"key":"16_CR11","doi-asserted-by":"publisher","unstructured":"Khan, A., Lisitsa, A., Vernitski, A.: Gauss-lint algorithms suite for Gauss diagrams generation and analysis. Zenodo (2021). https:\/\/doi.org\/10.5281\/zenodo.4574590","DOI":"10.5281\/zenodo.4574590"},{"key":"16_CR12","doi-asserted-by":"crossref","unstructured":"Lov\u00e1sz, L., Marx, M.L.: A forbidden substructure characterization of Gauss codes. Bull. Am. Math. Soc. 82(1), 121\u2013122 (1976)","DOI":"10.1090\/S0002-9904-1976-13986-9"},{"key":"16_CR13","first-page":"202","volume":"77","author":"RC Lyndon","year":"1954","unstructured":"Lyndon, R.C.: On Burnside\u2019s problem. Trans. Am. Math. Soc. 77, 202\u2013215 (1954)","journal-title":"Trans. Am. Math. Soc."},{"key":"16_CR14","unstructured":"Rosenstiehl, P.: Solution alg\u00e9brique du probl\u00e8me de Gauss sur la permutation des points d\u2019intersection d\u2019une ou plusieurs courbes ferm\u00e9es du plan. C.R. Acad. Sci. 283(s\u00e9rie A), 551\u2013553 (1976)"},{"issue":"6","key":"16_CR15","doi-asserted-by":"publisher","first-page":"1769","DOI":"10.1016\/j.disc.2008.02.035","volume":"309","author":"B Shtylla","year":"2009","unstructured":"Shtylla, B., Traldi, L., Zulli, L.: On the realization of double occurrence words. Discrete Math. 309(6), 1769\u20131773 (2009)","journal-title":"Discrete Math."},{"issue":"3","key":"16_CR16","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/s40598-016-0049-3","volume":"2","author":"G Valette","year":"2016","unstructured":"Valette, G.: A classification of spherical curves based on Gauss diagrams. Arnold Math. J. 2(3), 383\u2013405 (2016). https:\/\/doi.org\/10.1007\/s40598-016-0049-3","journal-title":"Arnold Math. J."},{"issue":"1\u20132","key":"16_CR17","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1017\/S1471068411000494","volume":"12","author":"J Wielemaker","year":"2012","unstructured":"Wielemaker, J., Schrijvers, T., Triska, M., Lager, T.: SWI-prolog. Theor. Pract. Logic Program. 12(1\u20132), 67\u201396 (2012)","journal-title":"Theor. Pract. Logic Program."}],"container-title":["Lecture Notes in Computer Science","Intelligent Computer Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-81097-9_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,19]],"date-time":"2021-07-19T23:08:15Z","timestamp":1626736095000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-81097-9_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030810962","9783030810979"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-81097-9_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"20 July 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CICM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Intelligent Computer Mathematics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Timisoara","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Romania","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 July 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 July 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"mkm2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cicm-conference.org\/2021\/cicm.php","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":"38","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":"12","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":"32% - 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":"3,5","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)"}}]}}