Boris Klemz, Günter Rote. Linear-Time Algorithms for Maximum-Weight Induced Matchings and Minimum Chain Covers in Convex Bipartite Graphs. Algorithmica, 84(4):1064-1080, 2022. [doi]
@article{KlemzR22,
title = {Linear-Time Algorithms for Maximum-Weight Induced Matchings and Minimum Chain Covers in Convex Bipartite Graphs},
author = {Boris Klemz and Günter Rote},
year = {2022},
doi = {10.1007/s00453-021-00904-w},
url = {https://doi.org/10.1007/s00453-021-00904-w},
researchr = {https://researchr.org/publication/KlemzR22},
cites = {0},
citedby = {0},
journal = {Algorithmica},
volume = {84},
number = {4},
pages = {1064-1080},
}