Vera Asodi, Christopher Umans. The complexity of the matroid-greedoid partition problem. Theoretical Computer Science, 410(8-10):859-866, 2009. [doi]
@article{AsodiU09,
title = {The complexity of the matroid-greedoid partition problem},
author = {Vera Asodi and Christopher Umans},
year = {2009},
doi = {10.1016/j.tcs.2008.11.019},
url = {http://dx.doi.org/10.1016/j.tcs.2008.11.019},
tags = {partitioning},
researchr = {https://researchr.org/publication/AsodiU09},
cites = {0},
citedby = {0},
journal = {Theoretical Computer Science},
volume = {410},
number = {8-10},
pages = {859-866},
}