The Complexity of Computing Minimal Unidirectional Covering Sets

Dorothea Baumeister, Felix Brandt, Felix A. Fischer, Jan Hoffmann 0002, Jörg Rothe. The Complexity of Computing Minimal Unidirectional Covering Sets. Theory Comput. Syst., 53(3):467-502, 2013. [doi]

@article{BaumeisterBF0R13,
  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 = {2013},
  doi = {10.1007/s00224-012-9437-9},
  url = {http://dx.doi.org/10.1007/s00224-012-9437-9},
  researchr = {https://researchr.org/publication/BaumeisterBF0R13},
  cites = {0},
  citedby = {0},
  journal = {Theory Comput. Syst.},
  volume = {53},
  number = {3},
  pages = {467-502},
}