Dorothea Baumeister, Felix Brandt, Felix A. Fischer, Jan Hoffmann 0002, Jörg Rothe. The Complexity of Computing Minimal Unidirectional Covering Sets. In Tiziana Calamoneri, Josep Díaz, editors, Algorithms and Complexity, 7th International Conference, CIAC 2010, Rome, Italy, May 26-28, 2010. Proceedings. Volume 6078 of Lecture Notes in Computer Science, pages 299-310, Springer, 2010. [doi]
@inproceedings{BaumeisterBFHR10,
title = {The Complexity of Computing Minimal Unidirectional Covering Sets},
author = {Dorothea Baumeister and Felix Brandt and Felix A. Fischer and Jan Hoffmann 0002 and Jörg Rothe},
year = {2010},
doi = {10.1007/978-3-642-13073-1_27},
url = {http://dx.doi.org/10.1007/978-3-642-13073-1_27},
researchr = {https://researchr.org/publication/BaumeisterBFHR10},
cites = {0},
citedby = {0},
pages = {299-310},
booktitle = {Algorithms and Complexity, 7th International Conference, CIAC 2010, Rome, Italy, May 26-28, 2010. Proceedings},
editor = {Tiziana Calamoneri and Josep Díaz},
volume = {6078},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-642-13072-4},
}