Evripidis Bampis. The complexity of short schedules for uet bipartite graphs. RAIRO - Operations Research, 33(3):367-370, 1999. [doi]
@article{Bampis99,
title = {The complexity of short schedules for uet bipartite graphs},
author = {Evripidis Bampis},
year = {1999},
doi = {10.1051/ro:1999115},
url = {http://dx.doi.org/10.1051/ro:1999115},
researchr = {https://researchr.org/publication/Bampis99},
cites = {0},
citedby = {0},
journal = {RAIRO - Operations Research},
volume = {33},
number = {3},
pages = {367-370},
}