{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T14:03:03Z","timestamp":1742997783521,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030500252"},{"type":"electronic","value":"9783030500269"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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":[[2020]]},"DOI":"10.1007\/978-3-030-50026-9_25","type":"book-chapter","created":{"date-parts":[[2020,6,21]],"date-time":"2020-06-21T23:02:43Z","timestamp":1592780563000},"page":"341-353","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On Computing the Hamiltonian Index of Graphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0717-7303","authenticated-orcid":false,"given":"Geevarghese","family":"Philip","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4918-8150","authenticated-orcid":false,"given":"M. R.","family":"Rani","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9724-3484","authenticated-orcid":false,"given":"R.","family":"Subashini","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,6,22]]},"reference":[{"issue":"4\u20135","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. Inform. Process. Lett. 13(4\u20135), 157\u2013159 (1981). \nhttps:\/\/doi.org\/10.1016\/0020-0190(81)90048-X","journal-title":"Inform. Process. Lett."},{"issue":"1","key":"25_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(97)00228-4","volume":"209","author":"HL Bodlaender","year":"1998","unstructured":"Bodlaender, H.L.: A partial $$k$$-arboretum of graphs with bounded treewidth. Theor. Comput. Sci. 209(1), 1\u201345 (1998)","journal-title":"Theor. Comput. Sci."},{"key":"25_CR3","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/j.ic.2014.12.008","volume":"243","author":"HL Bodlaender","year":"2015","unstructured":"Bodlaender, H.L., Cygan, M., Kratsch, S., Nederlof, J.: Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth. Inform. Comput. 243, 86\u2013111 (2015)","journal-title":"Inform. Comput."},{"key":"25_CR4","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1002\/jgt.3190160209","volume":"16","author":"PA Catlin","year":"1992","unstructured":"Catlin, P.A.: Supereulerian graphs: a survey. J. Graph Theor. 16, 177\u2013196 (1992)","journal-title":"J. Graph Theor."},{"key":"25_CR5","doi-asserted-by":"crossref","unstructured":"Catlin, P.A., Janakiraman, I.T.N., Srinivasan, N.: Hamilton cycles and closed trails in iterated line graphs. J. Graph Theor. 14(3), 347\u2013364 (1990)","DOI":"10.1002\/jgt.3190140308"},{"issue":"3","key":"25_CR6","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1090\/S0002-9947-1968-0231740-1","volume":"134","author":"G Chartrand","year":"1968","unstructured":"Chartrand, G.: On Hamiltonian line-graphs. Trans. Am. Math. Soc. 134(3), 559\u2013566 (1968)","journal-title":"Trans. Am. Math. Soc."},{"key":"25_CR7","doi-asserted-by":"publisher","unstructured":"Cygan, M., et al.: Parameterized Algorithms. Springer, Heidelberg (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-319-21275-3","DOI":"10.1007\/978-3-319-21275-3"},{"key":"25_CR8","doi-asserted-by":"crossref","unstructured":"Cygan, M., Nederlof, J., Pilipczuk, M., Pilipczuk, M., van Rooij, J.M., Wojtaszczyk, J.O.: Solving connectivity problems parameterized by treewidth in single exponential time. In: FOCS 2011, pp. 150\u2013159. IEEE (2011)","DOI":"10.1109\/FOCS.2011.23"},{"key":"25_CR9","doi-asserted-by":"publisher","unstructured":"Downey, R.G., Fellows, M.R.: Fundamentals of Parameterized Complexity. Springer, Heidelberg (2013). \nhttps:\/\/doi.org\/10.1007\/978-1-4471-5559-1","DOI":"10.1007\/978-1-4471-5559-1"},{"key":"25_CR10","doi-asserted-by":"publisher","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006). \nhttps:\/\/doi.org\/10.1007\/3-540-29953-X","DOI":"10.1007\/3-540-29953-X"},{"key":"25_CR11","doi-asserted-by":"crossref","unstructured":"Fomin, F.V., Lokshtanov, D., Panolan, F., Saurabh, S.: Efficient computation of representative families with applications in parameterized and exact algorithms. J. ACM 63(4), 29:1\u201329:60 (2016)","DOI":"10.1145\/2886094"},{"issue":"4","key":"25_CR12","doi-asserted-by":"publisher","first-page":"704","DOI":"10.1137\/0205049","volume":"5","author":"MR Garey","year":"1976","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)","journal-title":"SIAM J. Comput."},{"issue":"6","key":"25_CR13","doi-asserted-by":"publisher","first-page":"701","DOI":"10.4153\/CMB-1965-051-3","volume":"8","author":"F Harary","year":"1965","unstructured":"Harary, F., Nash-Williams, C.S.J.: On Eulerian and Hamiltonian graphs and line graphs. Can. Math. Bull. 8(6), 701\u2013709 (1965)","journal-title":"Can. Math. Bull."},{"key":"25_CR14","unstructured":"Hauptmann, M., Karpi\u0144ski, M.: A compendium on Steiner tree problems. Inst. f\u00fcr Informatik (2013). \nhttp:\/\/citeseerx.ist.psu.edu\/viewdoc\/summary?doi=10.1.1.392.7444"},{"issue":"1","key":"25_CR15","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1016\/j.disc.2007.12.105","volume":"309","author":"Y Hong","year":"2009","unstructured":"Hong, Y., Lin, J.L., Tao, Z.S., Chen, Z.H.: The Hamiltonian index of graphs. Discrete Math. 309(1), 288\u2013292 (2009)","journal-title":"Discrete Math."},{"key":"25_CR16","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/j.tcs.2016.06.040","volume":"645","author":"F Kammer","year":"2016","unstructured":"Kammer, F., Tholey, T.: Approximate tree decompositions of planar graphs in linear time. Theor. Comput. Sci. 645, 60\u201390 (2016)","journal-title":"Theor. Comput. Sci."},{"issue":"9","key":"25_CR17","first-page":"926","volume":"12","author":"HJ Lai","year":"2013","unstructured":"Lai, H.J., Shao, Y., Yan, H.: An update on supereulerian graphs. WSEAS Trans. Math. 12(9), 926\u2013940 (2013)","journal-title":"WSEAS Trans. Math."},{"key":"25_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1007\/978-3-319-12340-0_29","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"M Lampis","year":"2014","unstructured":"Lampis, M., Makino, K., Mitsou, V., Uno, Y.: Parameterized edge hamiltonicity. In: Kratsch, D., Todinca, I. (eds.) WG 2014. LNCS, vol. 8747, pp. 348\u2013359. Springer, Cham (2014). \nhttps:\/\/doi.org\/10.1007\/978-3-319-12340-0_29"},{"key":"25_CR19","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2017.04.045","author":"M Lampis","year":"2017","unstructured":"Lampis, M., Makino, K., Mitsou, V., Uno, Y.: Parameterized edge hamiltonicity. Discrete Appl. Math. (2017). \nhttps:\/\/doi.org\/10.1016\/j.dam.2017.04.045","journal-title":"Discrete Appl. Math."},{"key":"25_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/978-3-030-19955-5_25","volume-title":"Computer Science \u2013 Theory and Applications","author":"N Misra","year":"2019","unstructured":"Misra, N., Panolan, F., Saurabh, S.: On the parameterized complexity of edge-linked paths. In: van Bevern, R., Kucherov, G. (eds.) CSR 2019. LNCS, vol. 11532, pp. 286\u2013298. Springer, Cham (2019). \nhttps:\/\/doi.org\/10.1007\/978-3-030-19955-5_25"},{"key":"25_CR21","unstructured":"Philip, G., Rani, M.R., Subashini, R.: On computing the Hamiltonian index of graphs. CoRR abs\/1912.01990 (2019). \nhttp:\/\/arxiv.org\/abs\/1912.01990"},{"key":"25_CR22","doi-asserted-by":"publisher","unstructured":"Pulleyblank, W.R.: A note on graphs spanned by Eulerian graphs. J. Graph Theory 3(3), 309\u2013310 (1979). \nhttps:\/\/doi.org\/10.1002\/jgt.3190030316","DOI":"10.1002\/jgt.3190030316"},{"issue":"3","key":"25_CR23","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1002\/nav.3800320308","volume":"32","author":"M Richey","year":"1985","unstructured":"Richey, M., Parker, R.G., Rardin, R.: On finding spanning Eulerian subgraphs. Naval Res. Logistics Q. 32(3), 443\u2013455 (1985)","journal-title":"Naval Res. Logistics Q."},{"issue":"4","key":"25_CR24","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). \nhttps:\/\/doi.org\/10.1016\/j.dam.2010.08.027","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"25_CR25","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1016\/j.jda.2010.02.002","volume":"8","author":"I Sau","year":"2010","unstructured":"Sau, I., Thilikos, D.M.: Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs. J. Discrete Algorithms 8(3), 330\u2013338 (2010)","journal-title":"J. Discrete Algorithms"},{"key":"25_CR26","doi-asserted-by":"crossref","unstructured":"Williams, V.V.: Multiplying matrices faster than Coppersmith-Winograd. In: Proceedings of the Forty-Fourth Annual ACM Symposium on Theory of Computing, pp. 887\u2013898. ACM (2012)","DOI":"10.1145\/2213977.2214056"},{"issue":"1\u20132","key":"25_CR27","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1016\/S0012-365X(01)00442-3","volume":"256","author":"L Xiong","year":"2002","unstructured":"Xiong, L., Liu, Z.: Hamiltonian iterated line graphs. Discrete Math. 256(1\u20132), 407\u2013422 (2002)","journal-title":"Discrete Math."}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-50026-9_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,21]],"date-time":"2020-06-21T23:07:55Z","timestamp":1592780875000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-50026-9_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030500252","9783030500269"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-50026-9_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"22 June 2020","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":"Yekaterinburg","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":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 June 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 July 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"csr2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/csr2020.sciencesconf.org\/","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":"49","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":"25","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":"51% - 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":"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)"}},{"value":"The conference was cancelled as a live conference due to the corona pandemic.","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)"}}]}}