{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:17:56Z","timestamp":1759637876815,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030199548"},{"type":"electronic","value":"9783030199555"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-19955-5_25","type":"book-chapter","created":{"date-parts":[[2019,6,23]],"date-time":"2019-06-23T23:10:01Z","timestamp":1561331401000},"page":"286-298","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On the Parameterized Complexity of Edge-Linked Paths"],"prefix":"10.1007","author":[{"given":"Neeldhara","family":"Misra","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fahad","family":"Panolan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Saket","family":"Saurabh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,5,16]]},"reference":[{"issue":"4\/5","key":"25_CR1","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/0020-0190(81)90048-X","volume":"13","author":"AA Bertossi","year":"1981","unstructured":"Bertossi, A.A.: The edge Hamiltonian path problem is NP-complete. Inf. Process. Lett. 13(4\/5), 157\u2013159 (1981)","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"25_CR2","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1016\/j.jctb.2011.02.009","volume":"101","author":"M Bilinski","year":"2011","unstructured":"Bilinski, M., Jackson, B., Ma, J., Yu, X.: Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs. J. Comb. Theory Ser. B 101(4), 214\u2013236 (2011)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"1","key":"25_CR3","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1137\/120880240","volume":"28","author":"HL Bodlaender","year":"2014","unstructured":"Bodlaender, H.L., Jansen, B.M.P., Kratsch, S.: Kernelization lower bounds by cross-composition. SIAM J. Discrete Math. 28(1), 277\u2013305 (2014)","journal-title":"SIAM J. Discrete Math."},{"key":"25_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., et al.: Parameterized Algorithms. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21275-3"},{"issue":"3","key":"25_CR5","doi-asserted-by":"publisher","first-page":"12:1","DOI":"10.1145\/3148227","volume":"65","author":"M Cygan","year":"2018","unstructured":"Cygan, M., Kratsch, S., Nederlof, J.: Fast hamiltonicity checking via bases of perfect matchings. J. ACM 65(3), 12:1\u201312:46 (2018)","journal-title":"J. ACM"},{"key":"25_CR6","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.tcs.2013.11.023","volume":"521","author":"ED Demaine","year":"2014","unstructured":"Demaine, E.D., Demaine, M.L., Harvey, N.J.A., Uehara, R., Uno, T., Uno, Y.: UNO is hard, even for a single player. Theor. Comput. Sci. 521, 51\u201361 (2014)","journal-title":"Theor. Comput. Sci."},{"key":"25_CR7","series-title":"Graduate Texts in Mathematics","volume-title":"Graph Theory","author":"R Diestel","year":"2012","unstructured":"Diestel, R.: Graph Theory. Graduate Texts in Mathematics, vol. 173, 4th edn. Springer, Heidelberg (2012)","edition":"4"},{"issue":"3","key":"25_CR8","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1137\/0202012","volume":"2","author":"J Hopcroft","year":"1973","unstructured":"Hopcroft, J., Tarjan, R.: Dividing a graph into triconnected components. SIAM J. Comput. 2(3), 135\u2013158 (1973)","journal-title":"SIAM J. Comput."},{"key":"25_CR9","unstructured":"Jansen, B.M.P., Pilipczuk, M., Wrochna, M.: Turing kernelization for finding long paths in graphs excluding a topological minor. In: IPEC, vol. 89. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2017)"},{"issue":"C","key":"25_CR10","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/j.jcss.2016.10.008","volume":"85","author":"BM Jansen","year":"2017","unstructured":"Jansen, B.M.: Turing kernelization for finding long paths and cycles in restricted graph classes. J. Comput. Syst. Sci. 85(C), 18\u201337 (2017)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"25_CR11","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/0020-0190(93)90191-B","volume":"46","author":"TH Lai","year":"1993","unstructured":"Lai, T.H., Wei, S.S.: The edge Hamiltonian path problem is NP-complete for bipartite graphs. Inf. Process. Lett. 46(1), 21\u201326 (1993)","journal-title":"Inf. Process. Lett."},{"key":"25_CR12","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/j.dam.2017.04.045","volume":"248","author":"M Lampis","year":"2018","unstructured":"Lampis, M., Makino, K., Mitsou, V., Uno, Y.: Parameterized edge hamiltonicity. Discrete Appl. Math. 248, 68\u201378 (2018)","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"25_CR13","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1016\/j.dam.2010.08.027","volume":"159","author":"Z Ryj\u00e1\u010dek","year":"2011","unstructured":"Ryj\u00e1\u010dek, Z., Woeginger, G.J., Xiong, L.: Hamiltonian index is NP-complete. Discrete Appl. Math. 159(4), 246\u2013250 (2011)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"25_CR14","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1007\/s00453-015-0083-x","volume":"77","author":"S Thomass\u00e9","year":"2017","unstructured":"Thomass\u00e9, S., Trotignon, N., Vuskovic, K.: A polynomial turing-kernel for weighted independent set in bull-free graphs. Algorithmica 77(3), 619\u2013641 (2017)","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-19955-5_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T17:03:14Z","timestamp":1710349394000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-19955-5_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030199548","9783030199555"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-19955-5_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"16 May 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CSR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computer Science Symposium in Russia","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Novosibirsk","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 July 2019","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":"csr2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/logic.pdmi.ras.ru\/csr2019\/","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":"71","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":"31","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":"44% - 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.27","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)"}}]}}