Tight Approximation Bounds for Vertex Cover on Dense k-Partite Hypergraphs. - Marek Karpinski; Richard Schmied; Claus Viehmann (Electron. Colloquium Comput. Complex., 2011)

Approximating Subdense Instances of Covering Problems. - Jean Cardinal; Marek Karpinski; Richard Schmied; Claus Viehmann (Electron. Notes Discret. Math., 2011)

Approximating vertex cover in dense hypergraphs. - Jean Cardinal; Marek Karpinski; Richard Schmied; Claus Viehmann (J. Discrete Algorithms, 2012)

Approximation complexity of Metric Dimension problem. - Mathias Hauptmann; Richard Schmied; Claus Viehmann (J. Discrete Algorithms, 2012)

Approximating edge dominating set in dense graphs. - Richard Schmied; Claus Viehmann (Theor. Comput. Sci., 2012)

Nearly tight approximation bounds for vertex cover on dense k-uniform k-partite hypergraphs. - Marek Karpinski; Richard Schmied; Claus Viehmann (J. Discrete Algorithms, 2015)