Satoru Iwata. Computing the Maximum Degree of Minors in Matrix Pencils via Combinatorial Relaxation. Algorithmica, 36(4):331-341, 2003. [doi]
@article{Iwata03:0,
title = {Computing the Maximum Degree of Minors in Matrix Pencils via Combinatorial Relaxation},
author = {Satoru Iwata},
year = {2003},
doi = {10.1007/s00453-003-1022-9},
url = {http://dx.doi.org/10.1007/s00453-003-1022-9},
researchr = {https://researchr.org/publication/Iwata03%3A0},
cites = {0},
citedby = {0},
journal = {Algorithmica},
volume = {36},
number = {4},
pages = {331-341},
}