External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

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. 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]

Authors

Dorothea Baumeister

This author has not been identified. Look up 'Dorothea Baumeister' in Google

Felix Brandt

This author has not been identified. Look up 'Felix Brandt' in Google

Felix A. Fischer

This author has not been identified. Look up 'Felix A. Fischer' in Google

Jan Hoffmann 0002

This author has not been identified. Look up 'Jan Hoffmann 0002' in Google

Jörg Rothe

This author has not been identified. Look up 'Jörg Rothe' in Google
runs on