[ University of Bonn | Dept. of Computer Science | Chair V | deutsche Version ]

Claus Viehmann Department of Computer Science and Hausdorff Center for Mathematics, HCM University of Bonn Friedrich-Ebert-Allee 144 53113 Bonn Email:  viehmann followed by at cs.uni-bonn.de Phone: +49 228 734129 Fax: +49 228 734440

Publications

• Nearly Tight Approximation Bounds for Vertex Cover on Dense k-Uniform k-Partite Hypergraphs
  Joint work with Marek Karpinski and Richard Schmied
  Journal of Discrete Algorithms 33, pp. 49-57, 2015.
  


• Tight Approximation Bounds for Vertex Cover on Dense k-Partite Hypergraphs
  Joint work with Marek Karpinski and Richard Schmied
  ECCC TR11-098, 2011 (ps,pdf).
  


• Approximability of Vertex Cover in Dense Bipartite Hypergraphs
  Joint work with Jean Cardinal, Marek Karpinski, and Richard Schmied
  CS-Report 85319, 2011 (ps,pdf).
  


• Approximating Vertex Cover in Dense Hypergraphs
  Joint work with Jean Cardinal, Marek Karpinski, and Richard Schmied
  Journal of Discrete Algorithms 13, pp. 67-77, 2012 (ps,pdf).
  


• Approximating Edge Dominating Set in Dense Graphs
  Joint work with Richard Schmied
  Proc. 8th TAMC 2011, LNCS 6648, pp. 37-47;
  also in Theoretical Computer Science 414, pp. 92-99, 2012 (ps,pdf).
  


• Approximating Subdense Instances of Covering Problems
  Joint work with Jean Cardinal, Marek Karpinski, and Richard Schmied
  Proc. 6th LAGOS 2011, pp. 59-65;
  also in Electronic Notes in Discrete Mathematics 37, pp. 297-302, 2011 (ps,pdf).
  


• On Approximation Complexity of Metric Dimension Problem
  Joint work with Mathias Hauptmann and Richard Schmied
  In Proc. 21st IWOCA 2010, LNCS 6460, pp. 136-139, 2011;
  also in Journal of Discrete Algorithms 14, pp. 214-222, 2012 (ps,pdf).
  


• On Approximation Complexity of Edge Dominating Set Problem in Dense Graphs
  Joint work with Richard Schmied
  Proc. 7th JCCGG 2009, pp. 135-136 (ps,pdf).
  


• Polynomial Approximation Schemes for Dense and Geometric k-Restricted Steiner Forest Problems
  Joint work with Mathias Hauptmann, Sören Kühl, and Richard Schmied
  CS-Report 85288, 2008 (ps,pdf).