Richard Schmied

Publication Activity (10 Years)

Years Active: 2010-2015
Publications (10 Years): 0

Top Venues

CoRR

Electron. Colloquium Comput. Complex.

J. Discrete Algorithms

J. Comput. Syst. Sci.

University of Bonn (PHD)

Education History

University of Bonn

PHD

Publications

Marek Karpinski, Richard Schmied, Claus Viehmann
Nearly tight approximation bounds for vertex cover on dense k-uniform k-partite hypergraphs. J. Discrete Algorithms 33 (2015)
Marek Karpinski, Michael Lampis, Richard Schmied
New inapproximability bounds for TSP. J. Comput. Syst. Sci. 81 (8) (2015)
Marek Karpinski, Richard Schmied
Approximation hardness of graphic TSP on cubic graphs. RAIRO Oper. Res. 49 (4) (2015)
Marek Karpinski, Michael Lampis, Richard Schmied
New Inapproximability Bounds for TSP CoRR (2013)
Marek Karpinski, Richard Schmied
Improved Inapproximability Results for the Shortest Superstring and Related Problems. CATS (2013)
Marek Karpinski, Richard Schmied
Approximation Hardness of Graphic TSP on Cubic Graphs CoRR (2013)
Marek Karpinski, Richard Schmied
Approximation Hardness of Graphic TSP on Cubic Graphs. Electron. Colloquium Comput. Complex. 20 (2013)
Marek Karpinski, Michael Lampis, Richard Schmied
New Inapproximability Bounds for TSP. ISAAC (2013)
Marek Karpinski, Michael Lampis, Richard Schmied
New Inapproximability Bounds for TSP. Electron. Colloquium Comput. Complex. 20 (2013)
Richard Schmied, Claus Viehmann
Approximating edge dominating set in dense graphs. Theor. Comput. Sci. 414 (1) (2012)
Marek Karpinski, Richard Schmied
On Approximation Lower Bounds for TSP with Bounded Metrics. Electron. Colloquium Comput. Complex. 19 (2012)
Mathias Hauptmann, Richard Schmied, Claus Viehmann
Approximation complexity of Metric Dimension problem. J. Discrete Algorithms 14 (2012)
Marek Karpinski, Richard Schmied
On Approximation Lower Bounds for TSP with Bounded Metrics CoRR (2012)
Jean Cardinal, Marek Karpinski, Richard Schmied, Claus Viehmann
Approximating vertex cover in dense hypergraphs. J. Discrete Algorithms 13 (2012)
Marek Karpinski, Richard Schmied, Claus Viehmann
Tight Approximation Bounds for Vertex Cover on Dense k-Partite Hypergraphs. Electron. Colloquium Comput. Complex. 18 (2011)
Richard Schmied, Claus Viehmann
Approximating Edge Dominating Set in Dense Graphs. TAMC (2011)
Jean Cardinal, Marek Karpinski, Richard Schmied, Claus Viehmann
Approximating Subdense Instances of Covering Problems. Electron. Notes Discret. Math. 37 (2011)
Marek Karpinski, Richard Schmied
Improved Lower Bounds for the Shortest Superstring and Related Problems. Electron. Colloquium Comput. Complex. 18 (2011)
Marek Karpinski, Richard Schmied
Improved Lower Bounds for the Shortest Superstring and Related Problems CoRR (2011)
Marek Karpinski, Richard Schmied, Claus Viehmann
Tight Approximation Bounds for Vertex Cover on Dense k-Partite Hypergraphs CoRR (2011)
Jean Cardinal, Marek Karpinski, Richard Schmied, Claus Viehmann
Approximating Subdense Instances of Covering Problems CoRR (2010)
Jean Cardinal, Marek Karpinski, Richard Schmied, Claus Viehmann
Approximating Vertex Cover in Dense Hypergraphs CoRR (2010)
Mathias Hauptmann, Richard Schmied, Claus Viehmann
On Approximation Complexity of Metric Dimension Problem. IWOCA (2010)

Richard Schmied.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Richard Schmied