{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T18:36:45Z","timestamp":1770921405947,"version":"3.50.1"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032178008","type":"print"},{"value":"9783032178015","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-17801-5_21","type":"book-chapter","created":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T17:53:16Z","timestamp":1770918796000},"page":"274-287","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Exact Matching and\u00a0Top-k Perfect Matching Parameterized by\u00a0Neighborhood Diversity or\u00a0Bandwidth"],"prefix":"10.1007","author":[{"given":"Nicolas","family":"El Maalouly","sequence":"first","affiliation":[]},{"given":"Kostas","family":"Lakis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,2,13]]},"reference":[{"key":"21_CR1","unstructured":"Beisegel, J., Klost, K., Knorr, K., Ratajczak, F., Scheffler, R.: A graph width perspective on partially ordered Hamiltonian paths. arXiv preprint arXiv:2503.03553 (2025)"},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"Chakrabarty, D., Swamy, C.: Approximation algorithms for minimum norm and ordered optimization problems. In: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, pp. 126\u2013137 (2019)","DOI":"10.1145\/3313276.3316322"},{"key":"21_CR3","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":"21_CR4","unstructured":"El\u00a0Maalouly, N.: Exact Matching: algorithms and Related Problems. In: 40th International Symposium on Theoretical Aspects of Computer Science (STACS), pp. 29:1\u201329:17 (2023)"},{"key":"21_CR5","unstructured":"El\u00a0Maalouly, N., Haslebacher, S., Wulf, L.: On the exact matching problem in dense graphs. In: 41st International Symposium on Theoretical Aspects of Computer Science (STACS), pp. 33:1\u201333:17 (2024)"},{"issue":"50","key":"21_CR6","doi-asserted-by":"publisher","first-page":"7001","DOI":"10.1016\/j.tcs.2011.09.011","volume":"412","author":"P Golovach","year":"2011","unstructured":"Golovach, P., Heggernes, P., Kratsch, D., Lokshtanov, D., Meister, D., Saurabh, S.: Bandwidth on at-free graphs. Theoret. Comput. Sci. 412(50), 7001\u20137008 (2011)","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"21_CR7","doi-asserted-by":"publisher","first-page":"540","DOI":"10.1137\/S0097539793258143","volume":"25","author":"H Kaplan","year":"1996","unstructured":"Kaplan, H., Shamir, R.: Pathwidth, bandwidth, and completion problems to proper interval graphs with small cliques. SIAM J. Comput. 25(3), 540\u2013561 (1996)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"21_CR8","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/s00453-011-9554-x","volume":"64","author":"M Lampis","year":"2012","unstructured":"Lampis, M.: Algorithmic meta-theorems for restrictions of treewidth. Algorithmica 64(1), 19\u201337 (2012)","journal-title":"Algorithmica"},{"key":"21_CR9","unstructured":"Maalouly, N.E., Lakis, K.: Exact matching and top-$$k$$ perfect matching parameterized by neighborhood diversity or bandwidth (2025). https:\/\/arxiv.org\/abs\/2510.12552"},{"key":"21_CR10","unstructured":"Maalouly, N.E., Wulf, L.: Exact matching and the top-$$k$$ perfect matching problem. arXiv preprint arXiv:2209.09661 (2022)"},{"key":"21_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/3-540-10291-4_20","volume-title":"Graphtheoretic Concepts in Computer Science","author":"B Monien","year":"1981","unstructured":"Monien, B., Sudborough, I.H.: Bounding the bandwidth of NP-complete problems. In: Noltemeier, H. (ed.) WG 1980. LNCS, vol. 100, pp. 279\u2013292. Springer, Heidelberg (1981). https:\/\/doi.org\/10.1007\/3-540-10291-4_20"},{"key":"21_CR12","doi-asserted-by":"crossref","unstructured":"Mulmuley, K., Vazirani, U.V., Vazirani, V.V.: Matching is as easy as matrix inversion. In: Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, pp. 345\u2013354 (1987)","DOI":"10.1145\/28395.383347"},{"issue":"2","key":"21_CR13","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1145\/322307.322309","volume":"29","author":"CH Papadimitriou","year":"1982","unstructured":"Papadimitriou, C.H., Yannakakis, M.: The complexity of restricted spanning tree problems. J. ACM (JACM) 29(2), 285\u2013309 (1982)","journal-title":"J. ACM (JACM)"},{"issue":"4","key":"21_CR14","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1137\/0601042","volume":"1","author":"JB Saxe","year":"1980","unstructured":"Saxe, J.B.: Dynamic-programming algorithms for recognizing small-bandwidth graphs in polynomial time. SIAM J. Algebraic Discr. Methods 1(4), 363\u2013369 (1980)","journal-title":"SIAM J. Algebraic Discr. Methods"},{"issue":"4","key":"21_CR15","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1145\/322217.322225","volume":"27","author":"JT Schwartz","year":"1980","unstructured":"Schwartz, J.T.: Fast probabilistic algorithms for verification of polynomial identities. J. ACM (JACM) 27(4), 701\u2013717 (1980)","journal-title":"J. ACM (JACM)"},{"key":"21_CR16","unstructured":"Zabih, R.: Some applications of graph bandwidth to constraint satisfaction problems. In: AAAI, pp. 46\u201351 (1990)"},{"key":"21_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/3-540-09519-5_73","volume-title":"Symbolic and Algebraic Computation","author":"R Zippel","year":"1979","unstructured":"Zippel, R.: Probabilistic algorithms for sparse polynomials. In: Ng, E.W. (ed.) Symbolic and Algebraic Computation. LNCS, vol. 72, pp. 216\u2013226. Springer, Heidelberg (1979). https:\/\/doi.org\/10.1007\/3-540-09519-5_73"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2026: Theory and Practice of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-17801-5_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T17:53:18Z","timestamp":1770918798000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-17801-5_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032178008","9783032178015"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-17801-5_21","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":"13 February 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SOFSEM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Current Trends in Theory and Practice of Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Krakow","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","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":"9 February 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 February 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"51","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sofsem2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sofsem.uj.edu.pl\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}