{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T10:14:12Z","timestamp":1773483252673,"version":"3.50.1"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030799861","type":"print"},{"value":"9783030799878","type":"electronic"}],"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-79987-8_34","type":"book-chapter","created":{"date-parts":[[2021,6,29]],"date-time":"2021-06-29T23:05:05Z","timestamp":1625007905000},"page":"485-500","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["K\u00f6nigsberg Sightseeing: Eulerian Walks in Temporal Graphs"],"prefix":"10.1007","author":[{"given":"Andrea","family":"Marino","sequence":"first","affiliation":[]},{"given":"Ana","family":"Silva","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,6,30]]},"reference":[{"key":"34_CR1","doi-asserted-by":"crossref","unstructured":"Eleni, C.A., Mertzios, G.B., Spirakis, P.G.: The temporal explorer who returns to the base. In: 11th International Conference on Algorithms and Complexity - CIAC 2019, Rome, Italy, pp. 13\u201324 (2019)","DOI":"10.1007\/978-3-030-17402-6_2"},{"key":"34_CR2","doi-asserted-by":"crossref","unstructured":"Arumugam, S., Hamid, I., Abraham, V.M.: Decomposition of graphs into paths and cycles. J. Discrete Math. (2013)","DOI":"10.1155\/2013\/721051"},{"key":"34_CR3","unstructured":"Borgnat, P., Fleury, E., Guillaume, J-P., Magnien, C., Robardet, C., Scherrer, A.: Evolving networks. In: Mining Massive Data Sets for Security, pp. 198\u2013203 (2007)"},{"key":"34_CR4","unstructured":"Bumpus, B.M., Meeks, K.: Edge exploration of temporal graphs. In: Proceedings of Combinatorial Algorithms - 32nd International Workshop, IWOCA 2021, Ottawa, Canada, 5\u20137July 2020 (2021). To appear"},{"issue":"5","key":"34_CR5","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1080\/17445760.2012.668546","volume":"27","author":"A Casteigts","year":"2012","unstructured":"Casteigts, A., Flocchini, P., Quattrociocchi, W., Santoro, N.: Time-varying graphs and dynamic networks. Int. J. Parallel Emerg. Distrib. Syst. 27(5), 387\u2013408 (2012)","journal-title":"Int. J. Parallel Emerg. Distrib. Syst."},{"issue":"1","key":"34_CR6","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/s10100-018-0598-8","volume":"28","author":"M Kayac\u0131 \u00c7odur","year":"2018","unstructured":"Kayac\u0131 \u00c7odur, M., Y\u0131lmaz, M.: A time-dependent hierarchical Chinese postman problem. Central Euro. J. Oper. Res. 28(1), 337\u2013366 (2018). https:\/\/doi.org\/10.1007\/s10100-018-0598-8","journal-title":"Central Euro. J. Oper. Res."},{"issue":"1","key":"34_CR7","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/s00453-012-9667-x","volume":"68","author":"M Cygan","year":"2014","unstructured":"Cygan, M., Marx, D., Pilipczuk, M., Pilipczuk, M., Schlotter, I.: Parameterized complexity of Eulerian deletion problems. Algorithmica 68(1), 41\u201361 (2014)","journal-title":"Algorithmica"},{"issue":"4","key":"34_CR8","doi-asserted-by":"publisher","first-page":"864","DOI":"10.1137\/S0097539792225297","volume":"23","author":"E Dahlhaus","year":"1994","unstructured":"Dahlhaus, E., Johnson, D.S., Papadimitriou, C.H., Seymour, P.D., Yannakakis, M.: The complexity of multiterminal cuts. SIAM J. Comput. 23(4), 864\u2013894 (1994)","journal-title":"SIAM J. Comput."},{"key":"34_CR9","doi-asserted-by":"crossref","unstructured":"Erlebach, T., Hoffmann, M., Kammer, F.: In: 42nd International Colloquium on Automata, Languages, and Programming - ICALP 2015, Kyoto, Japan, volume 9134 of Lecture Notes in Computer Science, pp. 444\u2013455. Springer (2015)","DOI":"10.1007\/978-3-662-47672-7_36"},{"key":"34_CR10","unstructured":"Erlebach, T., Spooner, J.T.: Faster exploration of degree-bounded temporal graphs. In: 43rd International Symposium on Mathematical Foundations of Computer Science - MFCS 2018. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2018)"},{"key":"34_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/978-3-030-54921-3_8","volume-title":"Structural Information and Communication Complexity","author":"T Erlebach","year":"2020","unstructured":"Erlebach, T., Spooner, J.T.: Non-strict temporal exploration. In: Richa, A.W., Scheideler, C. (eds.) SIROCCO 2020. LNCS, vol. 12156, pp. 129\u2013145. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-54921-3_8"},{"key":"34_CR12","doi-asserted-by":"crossref","unstructured":"Fomin, F.V., Golovach, P.A.: Long circuits and large Euler subgraphs. SIAM J. Discrete Math. 28(2), 878\u2013892 (2014)","DOI":"10.1137\/130936816"},{"key":"34_CR13","doi-asserted-by":"crossref","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)","DOI":"10.1137\/0205049"},{"key":"34_CR14","doi-asserted-by":"crossref","unstructured":"G\u00f3mez, R., Wakabayashi, Y.: Covering a graph with nontrivial vertex-disjoint paths: existence and optimization. In: International Workshop on Graph-Theoretic Concepts in Computer Science - WG 2018, Cottbus, Germany, 27\u201329 June, pp. 228\u2013238. Springer (2018)","DOI":"10.1007\/978-3-030-00256-5_19"},{"key":"34_CR15","unstructured":"Guan, M.: Graphic programming using odd or even points. Acta Math. Sin. (in Chinese), 10, 263\u2013266 (1960). Translated in Chinese Mathematics 1. American Mathematical Society, 273\u2013277"},{"key":"34_CR16","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J., Kumar, A.: Connectivity and inference problems for temporal networks. In: 32nd annual ACM Symposium on Theory of Computing - STOC 2000, Portland, Oregon, 21\u201323 May 2000","DOI":"10.1145\/335305.335364"},{"issue":"1","key":"34_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s13278-018-0537-7","volume":"8","author":"M Latapy","year":"2018","unstructured":"Latapy, M., Viard, T., Magnien, C.: Stream graphs and link streams for the modeling of interactions over time. Soc. Netw. Anal. Mining 8(1), 1\u201329 (2018). https:\/\/doi.org\/10.1007\/s13278-018-0537-7","journal-title":"Soc. Netw. Anal. Mining"},{"key":"34_CR18","unstructured":"Manuel, P.: Revisiting path-type covering and partitioning problems. arXiv preprint arXiv:1807.10613 (2018)"},{"issue":"4","key":"34_CR19","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1080\/15427951.2016.1177801","volume":"12","author":"O Michail","year":"2016","unstructured":"Michail, O.: An introduction to temporal graphs: an algorithmic perspective. Internet Math. 12(4), 239\u2013280 (2016)","journal-title":"Internet Math."},{"key":"34_CR20","doi-asserted-by":"crossref","unstructured":"Michail, O., Spirakis, P.G.: Traveling salesman problems in temporal graphs. Theor. Comput. Sci. 63(4), 1\u201323 (2016)","DOI":"10.1016\/j.tcs.2016.04.006"},{"key":"34_CR21","doi-asserted-by":"crossref","unstructured":"Orlin, J.B.: Some problems on dynamic\/periodic graphs. In: Progress in Combinatorial Optimization, pp. 273\u2013293. Elsevier (1984)","DOI":"10.1016\/B978-0-12-566780-7.50022-2"},{"key":"34_CR22","first-page":"833","volume":"8","author":"J Sun","year":"2011","unstructured":"Sun, J., Tan, G., Honglei, Q.: Dynamic programming algorithm for the time dependent Chinese postman problem. J. Inf. Comput. Sci. 8, 833\u2013841 (2011)","journal-title":"J. Inf. Comput. Sci."},{"issue":"3\u20134","key":"34_CR23","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1016\/S0898-1221(02)00156-6","volume":"44","author":"H-F Wang","year":"2002","unstructured":"Wang, H.-F., Wen, Y.-P.: Time-constrained Chinese postman problems. Comput. Math. Appl. 44(3\u20134), 375\u2013387 (2002)","journal-title":"Comput. Math. Appl."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-79987-8_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,2]],"date-time":"2023-01-02T01:57:12Z","timestamp":1672624632000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-79987-8_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030799861","9783030799878"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-79987-8_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"30 June 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWOCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ottawa, ON","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","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":"5 July 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 July 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"32","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iwoca2021.eecs.uottawa.ca\/","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":"107","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":"38","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":"36% - 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.1","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":"9.1","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 workshop was held virtually.","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)"}}]}}