{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,2]],"date-time":"2026-02-02T17:29:29Z","timestamp":1770053369693,"version":"3.49.0"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032166319","type":"print"},{"value":"9783032166326","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-16632-6_2","type":"book-chapter","created":{"date-parts":[[2026,2,2]],"date-time":"2026-02-02T06:49:18Z","timestamp":1770014958000},"page":"19-31","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On Fixed-Parameter Tractability of\u00a0Weighted 0\u20131 Timed Matching Problem on\u00a0Temporal Graphs"],"prefix":"10.1007","author":[{"given":"Rinku","family":"Kumar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1883-4639","authenticated-orcid":false,"given":"Bodhisatwa","family":"Mazumdar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0957-492X","authenticated-orcid":false,"given":"Subhrangsu","family":"Mandal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,2,3]]},"reference":[{"key":"2_CR1","unstructured":"Bampis, E., Escoffier, B., Lampis, M., Paschos, V.T.: Multistage matchings. In: Scandinavian Symposium and Workshops on Algorithm Theory (SWAT), vol.\u00a0101, pp.\u00a07\u20131 (2018)"},{"key":"2_CR2","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1016\/j.tcs.2019.03.026","volume":"806","author":"J Baste","year":"2020","unstructured":"Baste, J., Bui-Xuan, B.M., Roux, A.: Temporal matching. Theor. Comput. Sci. 806, 184\u2013196 (2020)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Bodlaender, H.L., Bonsma, P., Lokshtanov, D.: The fine details of fast dynamic programming over tree decompositions. In: International Symposium on Parameterized and Exact Computation (IPEC), pp. 41\u201353 (2013)","DOI":"10.1007\/978-3-319-03898-8_5"},{"issue":"9","key":"2_CR4","doi-asserted-by":"publisher","first-page":"2754","DOI":"10.1007\/s00453-021-00831-w","volume":"83","author":"A Casteigts","year":"2021","unstructured":"Casteigts, A., Himmel, A.S., Molter, H., Zschoche, P.: Finding temporal paths under waiting time constraints. Algorithmica 83(9), 2754\u20132802 (2021)","journal-title":"Algorithmica"},{"issue":"8","key":"2_CR5","doi-asserted-by":"publisher","first-page":"2135","DOI":"10.1007\/s00453-022-00951-x","volume":"84","author":"M Chimani","year":"2022","unstructured":"Chimani, M., Troost, N., Wiedera, T.: Approximating multistage matching problems. Algorithmica 84(8), 2135\u20132153 (2022)","journal-title":"Algorithmica"},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"Cygan, M., et al.: Parameterized Algorithms, vol.\u00a05. Springer, Heidelberg (2015)","DOI":"10.1007\/978-3-319-21275-3"},{"key":"2_CR7","doi-asserted-by":"publisher","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","volume":"17","author":"J Edmonds","year":"1965","unstructured":"Edmonds, J.: Paths, trees, and flowers. Can. J. Math. 17, 449\u2013467 (1965)","journal-title":"Can. J. Math."},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Even, S., Kariv, O.: An O ($$n^{2. 5}$$) algorithm for maximum matching in general graphs. In: Annual Symposium on Foundations of Computer Science (SFCS), pp. 100\u2013112 (1975)","DOI":"10.1109\/SFCS.1975.5"},{"issue":"10","key":"2_CR9","doi-asserted-by":"publisher","first-page":"14835","DOI":"10.1109\/TVT.2024.3401230","volume":"73","author":"X Fan","year":"2024","unstructured":"Fan, X., et al.: Temporal data dissemination in UAV-assisted VANETs through time-varying graphs. IEEE Trans. Veh. Technol. 73(10), 14835\u201314846 (2024)","journal-title":"IEEE Trans. Veh. Technol."},{"key":"2_CR10","unstructured":"Ferreira, A.: On models and algorithms for dynamic communication networks: the case for evolving graphs. In: $$4^{e}$$ rencontres francophones sur les Aspects Algorithmiques des Telecommunications (ALGOTEL), pp. 155\u2013161 (2002)"},{"key":"2_CR11","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability, vol.\u00a029. WH Freeman, New York (2002)"},{"key":"2_CR12","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/j.jctb.2018.03.007","volume":"132","author":"DJ Harvey","year":"2018","unstructured":"Harvey, D.J., Wood, D.R.: The treewidth of line graphs. J. Comb. Theory Ser. B 132, 157\u2013179 (2018)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"4","key":"2_CR13","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1137\/0202019","volume":"2","author":"JE Hopcroft","year":"1973","unstructured":"Hopcroft, J.E., Karp, R.M.: An $$n^{5\/2}$$ algorithm for maximum matchings in bipartite graphs. SIAM J. Comput. 2(4), 225\u2013231 (1973)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"2_CR14","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.103.038702","volume":"103","author":"JL Iribarren","year":"2009","unstructured":"Iribarren, J.L., Moro, E.: Impact of human activity patterns on the dynamics of information diffusion. Phys. Rev. Lett. 103(3), 038702 (2009)","journal-title":"Phys. Rev. Lett."},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"Korhonen, T.: A single-exponential time 2-approximation algorithm for treewidth. In: IEEE Annual Symposium on Foundations of Computer Science (FOCS), pp. 184\u2013192 (2021)","DOI":"10.1109\/FOCS52979.2021.00026"},{"key":"2_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/1752-0509-4-130","volume":"4","author":"S Lebre","year":"2010","unstructured":"Lebre, S., Becq, J., Devaux, F., Stumpf, M.P., Lelandais, G.: Statistical inference of the time-varying structure of gene-regulation networks. BMC Syst. Biol. 4, 1\u201316 (2010)","journal-title":"BMC Syst. Biol."},{"issue":"12","key":"2_CR17","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0242875","volume":"15","author":"O Lordan","year":"2020","unstructured":"Lordan, O., Sallan, J.M.: Dynamic measures for transportation networks. PLoS ONE 15(12), e0242875 (2020)","journal-title":"PLoS ONE"},{"key":"2_CR18","doi-asserted-by":"crossref","unstructured":"Mandal, S., Gupta, A.: Approximation algorithms for permanent dominating set problem on dynamic networks. In: International Conference on Distributed Computing and Internet Technology (ICDCIT), pp. 265\u2013279 (2018)","DOI":"10.1007\/978-3-319-72344-0_22"},{"issue":"03","key":"2_CR19","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1142\/S012905412050015X","volume":"31","author":"S Mandal","year":"2020","unstructured":"Mandal, S., Gupta, A.: Convergecast tree on temporal graphs. Int. J. Found. Comput. Sci. 31(03), 385\u2013409 (2020)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"2_CR20","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1016\/j.dam.2021.12.027","volume":"319","author":"S Mandal","year":"2022","unstructured":"Mandal, S., Gupta, A.: Maximum 0\u20131 timed matching on temporal graphs. Disc. Appl. Math. 319, 310\u2013326 (2022)","journal-title":"Disc. Appl. Math."},{"key":"2_CR21","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/j.jcss.2021.08.004","volume":"123","author":"A Marino","year":"2022","unstructured":"Marino, A., Silva, A.: Coloring temporal graphs. J. Comput. Syst. Sci. 123, 171\u2013185 (2022)","journal-title":"J. Comput. Syst. Sci."},{"key":"2_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jcss.2023.04.005","volume":"137","author":"GB Mertzios","year":"2023","unstructured":"Mertzios, G.B., Molter, H., Niedermeier, R., Zamaraev, V., Zschoche, P.: Computing maximum matchings in temporal graphs. J. Comput. Syst. Sci. 137, 1\u201319 (2023)","journal-title":"J. Comput. Syst. Sci."},{"key":"2_CR23","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.jcss.2021.03.005","volume":"120","author":"GB Mertzios","year":"2021","unstructured":"Mertzios, G.B., Molter, H., Zamaraev, V.: Sliding window temporal graph coloring. J. Comput. Syst. Sci. 120, 97\u2013115 (2021)","journal-title":"J. Comput. Syst. Sci."},{"key":"2_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2016.04.006","volume":"634","author":"O Michail","year":"2016","unstructured":"Michail, O., Spirakis, P.G.: Traveling salesman problems in temporal graphs. Theor. Comput. Sci. 634, 1\u201323 (2016)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"2_CR25","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s00453-005-1187-5","volume":"45","author":"M Mucha","year":"2006","unstructured":"Mucha, M., Sankowski, P.: Maximum matchings in planar graphs via gaussian elimination. Algorithmica 45(1), 3\u201320 (2006)","journal-title":"Algorithmica"},{"key":"2_CR26","doi-asserted-by":"crossref","unstructured":"Picavet, T., Nguyen, N.T., Bui-Xuan, B.M.: Temporal matching on geometric graph data. In: International Conference on Algorithms and Complexity (CIAC), pp. 394\u2013408 (2021)","DOI":"10.1007\/978-3-030-75242-2_28"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing and Intelligent Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-16632-6_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,2]],"date-time":"2026-02-02T06:49:21Z","timestamp":1770014961000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-16632-6_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032166319","9783032166326"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-16632-6_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"3 February 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICDCIT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Distributed Computing and Intelligent Technology","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bhubaneswar","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 January 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 January 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icdcit2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/icdcit.kiit.ac.in\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}