New Results on the Complexity of the Max- and Min-Rep Problems

Robert Ganian
January 2011
bib

Abstract

Full Citation:

Robert Ganian. New Results on the Complexity of the Max- and Min-Rep Problems. SOFSEM 2011: Theory and Practice of Computer Science - 37th Conference on Current Trends in Theory and Practice of Computer Science, Nov'y Smokovec, Slovakia, January 22-28, 2011. Proceedings, volume 6543 of Lecture Notes in Computer Science, pages 238-247, 2011, Springer.

Type
Conference Paper
Robert Ganian
Robert Ganian

Robert Ganian is a Professor at the Algorithms and Complexity Group.