{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T03:54:34Z","timestamp":1743134074591,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031221040"},{"type":"electronic","value":"9783031221057"}],"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.springernature.com\/gp\/researchers\/text-and-data-mining"},{"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.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-22105-7_33","type":"book-chapter","created":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T02:36:12Z","timestamp":1672540572000},"page":"368-380","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Bounding the\u00a0Number of\u00a0Eulerian Tours in\u00a0Undirected Graphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8738-1595","authenticated-orcid":false,"given":"Giulia","family":"Punzi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,1]]},"reference":[{"key":"33_CR1","doi-asserted-by":"publisher","unstructured":"van Aardenne-Ehrenfest, T., de Bruijn, N.G.: Circuits and trees in oriented linear graphs. In: Classic Papers in Combinatorics, pp. 149\u2013163. Birkh\u00e4user Boston, Boston (1987). https:\/\/doi.org\/10.1007\/978-0-8176-4842-8_12","DOI":"10.1007\/978-0-8176-4842-8_12"},{"issue":"1","key":"33_CR2","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0166-218X(87)90045-X","volume":"18","author":"SW Bent","year":"1987","unstructured":"Bent, S.W., Manber, U.: On non-intersecting Eulerian circuits. Discret. Appl. Math. 18(1), 87\u201394 (1987)","journal-title":"Discret. Appl. Math."},{"key":"33_CR3","doi-asserted-by":"crossref","unstructured":"Bernardini, G., Chen, H., Fici, G., Loukides, G., Pissis, S.P.: Reverse-safe data structures for text indexing. In: Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2020, Salt Lake City, UT, USA, 5\u20136 January 2020, pp. 199\u2013213 (2020)","DOI":"10.1137\/1.9781611976007.16"},{"key":"33_CR4","unstructured":"Brightwell, G.R., Winkler, P.: Counting Eulerian circuits is #P-complete. In: ALENEX\/ANALCO, pp. 259\u2013262. ACM SIAM (2005)"},{"key":"33_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/978-3-030-86593-1_11","volume-title":"Fundamentals of Computation Theory","author":"A Conte","year":"2021","unstructured":"Conte, A., Grossi, R., Loukides, G., Pisanti, N., Pissis, S.P., Punzi, G.: Beyond the BEST theorem: fast assessment of Eulerian trails. In: Bampis, E., Pagourtzis, A. (eds.) FCT 2021. LNCS, vol. 12867, pp. 162\u2013175. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-86593-1_11"},{"key":"33_CR6","unstructured":"Creed, P.J.: Counting and sampling problems on Eulerian graphs. Ph.D. thesis, University of Edinburgh (2010)"},{"key":"33_CR7","unstructured":"Euler, L.: Solutio problematis ad geometriam situs pertinentis. Commentarii Academiae Scientiarum Imperialis Petropolitanae 8, 128\u2013140 (1736)"},{"issue":"1","key":"33_CR8","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/S0012-365X(00)00067-4","volume":"230","author":"H Fleischner","year":"2001","unstructured":"Fleischner, H.: (Some of) the many uses of Eulerian graphs in graph theory (plus some applications). Discret. Math. 230(1), 23\u201343 (2001)","journal-title":"Discret. Math."},{"issue":"3","key":"33_CR9","doi-asserted-by":"publisher","first-page":"588","DOI":"10.1007\/s00453-010-9463-4","volume":"63","author":"Q Ge","year":"2012","unstructured":"Ge, Q., \u0160tefankovi\u010d, D.: The complexity of counting Eulerian tours in 4-regular graphs. Algorithmica 63(3), 588\u2013601 (2012)","journal-title":"Algorithmica"},{"issue":"1","key":"33_CR10","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/BF01442866","volume":"6","author":"C Hierholzer","year":"1873","unstructured":"Hierholzer, C., Wiener, C.: \u00dcber die m\u00f6glichkeit, einen linienzug ohne wiederholung und ohne unterbrechung zu umfahren. Math. Ann. 6(1), 30\u201332 (1873)","journal-title":"Math. Ann."},{"key":"33_CR11","doi-asserted-by":"crossref","unstructured":"Las Vergnas, M.: Le polyn\u00f4me de Martin d\u2019un graphe Eulerien. In: Berge, C., Bresson, D., Camion, P., Maurras, J., Sterboul, F. (eds.) Combinatorial Mathematics, North-Holland Mathematics Studies, vol. 75, pp. 397\u2013411. North-Holland (1983)","DOI":"10.1016\/S0304-0208(08)73415-7"},{"issue":"1","key":"33_CR12","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/BF02122696","volume":"10","author":"M Las Vergnas","year":"1990","unstructured":"Las Vergnas, M.: An upper bound for the number of Eulerian orientations of a regular graph. Combinatorica 10(1), 61\u201365 (1990)","journal-title":"Combinatorica"},{"issue":"4\/5","key":"33_CR13","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1007\/BF01940872","volume":"16","author":"M Mihail","year":"1996","unstructured":"Mihail, M., Winkler, P.: On the number of Eulerian orientations of a graph. Algorithmica 16(4\/5), 402\u2013414 (1996)","journal-title":"Algorithmica"},{"issue":"17","key":"33_CR14","doi-asserted-by":"publisher","first-page":"9748","DOI":"10.1073\/pnas.171285098","volume":"98","author":"PA Pevzner","year":"2001","unstructured":"Pevzner, P.A., Tang, H., Waterman, M.S.: An Eulerian path approach to DNA fragment assembly. Proc. Natl. Acad. Sci. 98(17), 9748\u20139753 (2001)","journal-title":"Proc. Natl. Acad. Sci."},{"key":"33_CR15","unstructured":"Punzi, G.: Novel algorithms for assessing the number of solutions in graph problems. Ph.D. thesis, University of Pisa (2023)"},{"issue":"3","key":"33_CR16","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/BF02579193","volume":"3","author":"A Schrijver","year":"1983","unstructured":"Schrijver, A.: Bounds on the number of Eulerian orientations. Combinatorica 3(3), 375\u2013380 (1983)","journal-title":"Combinatorica"},{"issue":"1","key":"33_CR17","first-page":"23","volume":"19","author":"JI Sohn","year":"2018","unstructured":"Sohn, J.I., Nam, J.W.: The present and future of de novo whole-genome assembly. Brief. Bioinform. 19(1), 23\u201340 (2018)","journal-title":"Brief. Bioinform."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-22105-7_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,30]],"date-time":"2023-03-30T22:05:45Z","timestamp":1680213945000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22105-7_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031221040","9783031221057"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22105-7_33","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":"1 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shenzhen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","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":"22 October 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 October 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cocoon-conference.org\/2022\/","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":"EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"101","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":"39","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":"12","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":"39% - 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":"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)"}}]}}