{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,9]],"date-time":"2024-04-09T05:18:02Z","timestamp":1712639882117},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2022,7,14]],"date-time":"2022-07-14T00:00:00Z","timestamp":1657756800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,7,14]],"date-time":"2022-07-14T00:00:00Z","timestamp":1657756800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"name":"European Research Council","award":["819416"],"award-info":[{"award-number":["819416"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2022,10]]},"DOI":"10.1007\/s00453-022-01003-0","type":"journal-article","created":{"date-parts":[[2022,7,14]],"date-time":"2022-07-14T06:02:43Z","timestamp":1657778563000},"page":"3075-3100","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Parameterized Complexity of Maximum Edge Colorable Subgraph"],"prefix":"10.1007","volume":"84","author":[{"given":"Akanksha","family":"Agrawal","sequence":"first","affiliation":[]},{"given":"Madhumita","family":"Kundu","sequence":"additional","affiliation":[]},{"given":"Abhishek","family":"Sahu","sequence":"additional","affiliation":[]},{"given":"Saket","family":"Saurabh","sequence":"additional","affiliation":[]},{"given":"Prafullkumar","family":"Tale","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,7,14]]},"reference":[{"key":"1003_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, A., Kanesh, L., Saurabh, S., Tale, P.: Paths to trees and cacti. In: International Conference on Algorithms and Complexity, p 31\u201342. Springer (2017)","DOI":"10.1007\/978-3-319-57586-5_4"},{"key":"1003_CR2","unstructured":"Aloisio, A., Mkrtchyan, V.: On the fixed-parameter tractability of the maximum 2-edge-colorable subgraph problem. arXiv preprint arXiv:1904.09246 (2019)"},{"key":"1003_CR3","doi-asserted-by":"crossref","unstructured":"Alon, N., Yuster, R., Zwick, U.: Color coding. In: M.\u00a0Kao (ed.) Encyclopedia of Algorithms - 2008 Edition (2008)","DOI":"10.1007\/978-0-387-30162-4_76"},{"issue":"1","key":"1003_CR4","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s00373-018-1986-5","volume":"35","author":"Y Cao","year":"2019","unstructured":"Cao, Y., Chen, G., Jing, G., Stiebitz, M., Toft, B.: Graph edge coloring: A survey. Graphs and Combinatorics 35(1), 33\u201366 (2019)","journal-title":"Graphs and Combinatorics"},{"key":"1003_CR5","doi-asserted-by":"crossref","unstructured":"Chen, J., Kanj, I.A., Xia, G.: Improved parameterized upper bounds for vertex cover. In: Mathematical Foundations of Computer Science 2006, 31st International Symposium (MFCS), vol. 4162, p 238\u2013249 (2006)","DOI":"10.1007\/11821069_21"},{"issue":"40\u201342","key":"1003_CR6","doi-asserted-by":"publisher","first-page":"3736","DOI":"10.1016\/j.tcs.2010.06.026","volume":"411","author":"J Chen","year":"2010","unstructured":"Chen, J., Kanj, I.A., Xia, G.: Improved upper bounds for vertex cover. Theoret. Comput. Sci. 411(40\u201342), 3736\u20133756 (2010)","journal-title":"Theoret. Comput. Sci."},{"issue":"6","key":"1003_CR7","doi-asserted-by":"publisher","first-page":"2526","DOI":"10.1137\/080716475","volume":"38","author":"J Chen","year":"2009","unstructured":"Chen, J., Kneis, J., Lu, S., M\u00f6lle, D., Richter, S., Rossmanith, P., Sze, S.H., Zhang, F.: Randomized divide-and-conquer: Improved path, matching, and packing algorithms. SIAM J. Comput. 38(6), 2526\u20132547 (2009)","journal-title":"SIAM J. Comput."},{"key":"1003_CR8","doi-asserted-by":"crossref","unstructured":"Cygan, M., Fomin, F.V., Kowalik, L., Lokshtanov, D., Marx, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S.: Parameterized Algorithms. Springer (2015)","DOI":"10.1007\/978-3-319-21275-3"},{"key":"1003_CR9","doi-asserted-by":"crossref","unstructured":"Feige, U., Ofek, E., Wieder, U.: Approximating maximum edge coloring in multigraphs. In: International Workshop on Approximation Algorithms for Combinatorial Optimization, p 108\u2013121. Springer (2002)","DOI":"10.1007\/3-540-45753-4_11"},{"key":"1003_CR10","doi-asserted-by":"crossref","unstructured":"Fomin, F.V., Lokshtanov, D., Saurabh, S., Zehavi, M.: Kernelization: Theory of Parameterized Preprocessing. Cambridge University Press (2019)","DOI":"10.1017\/9781107415157"},{"key":"1003_CR11","unstructured":"Galby, E., Lima, P.T., Paulusma, D., Ries, B.: On the parameterized complexity of $$k$$-edge colouring. arXiv preprint arXiv:1901.01861 (2019)"},{"key":"1003_CR12","unstructured":"Gr\u00fcttemeier, N., Komusiewicz, C., Morawietz, N.: Maximum edge-colorable subgraph and strong triadic closure parameterized by distance to low-degree graphs. To appear, Scandinavian Symposium and Workshops on Algorithm Theory (2020)"},{"issue":"4","key":"1003_CR13","doi-asserted-by":"publisher","first-page":"1684","DOI":"10.1007\/s00453-018-0497-3","volume":"81","author":"S Gupta","year":"2019","unstructured":"Gupta, S., Roy, S., Saurabh, S., Zehavi, M.: Parameterized algorithms and kernels for rainbow matching. Algorithmica 81(4), 1684\u20131698 (2019)","journal-title":"Algorithmica"},{"issue":"4","key":"1003_CR14","doi-asserted-by":"publisher","first-page":"718","DOI":"10.1137\/0210055","volume":"10","author":"I Holyer","year":"1981","unstructured":"Holyer, I.: The NP-completeness of edge-coloring. SIAM J. Comput. 10(4), 718\u2013720 (1981)","journal-title":"SIAM J. Comput."},{"key":"1003_CR15","unstructured":"Jansen, B.M.P., Pieterse, A.: Sparsification upper and lower bounds for graphs problems and not-all-equal SAT. In: 10th International Symposium on Parameterized and Exact Computation, IPEC, pp. 163\u2013174 (2015)"},{"issue":"3","key":"1003_CR16","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1287\/moor.12.3.415","volume":"12","author":"R Kannan","year":"1987","unstructured":"Kannan, R.: Minkowski\u2019s convex body theorem and integer programming. Math. Oper. Res. 12(3), 415\u2013440 (1987)","journal-title":"Math. Oper. Res."},{"issue":"4","key":"1003_CR17","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1287\/moor.8.4.538","volume":"8","author":"HW Lenstra Jr","year":"1983","unstructured":"Lenstra, H.W., Jr.: Integer programming with a fixed number of variables. Math. Oper. Res. 8(4), 538\u2013548 (1983)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"1003_CR18","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/0196-6774(83)90032-9","volume":"4","author":"D Leven","year":"1983","unstructured":"Leven, D., Galil, Z.: NP completeness of finding the chromatic index of regular graphs. J. Algorithms 4(1), 35\u201344 (1983)","journal-title":"J. Algorithms"},{"key":"1003_CR19","doi-asserted-by":"crossref","unstructured":"Micali, S., Vazirani, V.V.: An $$\\cal{O}(\\sqrt{|V|} \\cdot |{E}|)$$ algorithm for finding maximum matching in general graphs. In: 21st Annual Symposium on Foundations of Computer Science (sfcs 1980), p 17\u201327. IEEE (1980)","DOI":"10.1109\/SFCS.1980.12"},{"key":"1003_CR20","unstructured":"Naor, M., Schulman, L.J., Srinivasan, A.: Splitters and near-optimal derandomization. In: Proceedings of IEEE 36th Annual Foundations of Computer Science, p 182\u2013191. IEEE (1995)"},{"key":"1003_CR21","unstructured":"Sinnamon, C.: A randomized algorithm for edge-colouring graphs in $$\\cal{O} (m \\sqrt{n}) $$ time. arXiv preprint arXiv:1907.03201 (2019)"},{"key":"1003_CR22","first-page":"25","volume":"3","author":"VG Vizing","year":"1964","unstructured":"Vizing, V.G.: On an estimate of the chromatic class of a p-graph. Discret Analiz 3, 25\u201330 (1964)","journal-title":"Discret Analiz"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-022-01003-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00453-022-01003-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-022-01003-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,30]],"date-time":"2022-09-30T14:20:09Z","timestamp":1664547609000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00453-022-01003-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,14]]},"references-count":22,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2022,10]]}},"alternative-id":["1003"],"URL":"https:\/\/doi.org\/10.1007\/s00453-022-01003-0","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,7,14]]},"assertion":[{"value":"4 March 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 July 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 July 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}