Claus Viehmann

11 papers C 2Journal 9
YearRankTypeTitle / Venue / Authors
2015 J jnl
Nearly tight approximation bounds for vertex cover on dense k-uniform k-partite hypergraphs.
J. Discrete Algorithms
Marek Karpinski, Richard Schmied, Claus Viehmann
2012 J jnl
Approximating edge dominating set in dense graphs.
Theor. Comput. Sci.
Richard Schmied, Claus Viehmann
2012 J jnl
Approximating vertex cover in dense hypergraphs.
J. Discrete Algorithms
Jean Cardinal, Marek Karpinski, Richard Schmied, Claus Viehmann
2012 J jnl
Approximation complexity of Metric Dimension problem.
J. Discrete Algorithms
Mathias Hauptmann, Richard Schmied, Claus Viehmann
2011 C conf
Approximating Edge Dominating Set in Dense Graphs.
TAMC
Richard Schmied, Claus Viehmann
2011 J jnl
Approximating Subdense Instances of Covering Problems.
Electron. Notes Discret. Math.
Jean Cardinal, Marek Karpinski, Richard Schmied, Claus Viehmann
2011 J jnl
Tight Approximation Bounds for Vertex Cover on Dense k-Partite Hypergraphs
CoRR
Marek Karpinski, Richard Schmied, Claus Viehmann
2011 J jnl
Tight Approximation Bounds for Vertex Cover on Dense k-Partite Hypergraphs.
Electron. Colloquium Comput. Complex.
Marek Karpinski, Richard Schmied, Claus Viehmann
2010 J jnl
Approximating Subdense Instances of Covering Problems
CoRR
Jean Cardinal, Marek Karpinski, Richard Schmied, Claus Viehmann
2010 J jnl
Approximating Vertex Cover in Dense Hypergraphs
CoRR
Jean Cardinal, Marek Karpinski, Richard Schmied, Claus Viehmann
2010 C conf
On Approximation Complexity of Metric Dimension Problem.
IWOCA
Mathias Hauptmann, Richard Schmied, Claus Viehmann