Richard Schmied

24 papers B 1C 2Journal 19Unranked 1
YearRankTypeTitle / Venue / Authors
2015 J jnl
Approximation hardness of graphic TSP on cubic graphs.
RAIRO Oper. Res.
Marek Karpinski, Richard Schmied
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
2015 J jnl
New inapproximability bounds for TSP.
J. Comput. Syst. Sci.
Marek Karpinski, Michael Lampis, Richard Schmied
2013 J jnl
Approximation Hardness of Graphic TSP on Cubic Graphs
CoRR
Marek Karpinski, Richard Schmied
2013 J jnl
Approximation Hardness of Graphic TSP on Cubic Graphs.
Electron. Colloquium Comput. Complex.
Marek Karpinski, Richard Schmied
2013 — conf
Improved Inapproximability Results for the Shortest Superstring and Related Problems.
CATS
Marek Karpinski, Richard Schmied
2013 J jnl
New Inapproximability Bounds for TSP
CoRR
Marek Karpinski, Michael Lampis, Richard Schmied
2013 B conf
New Inapproximability Bounds for TSP.
ISAAC
Marek Karpinski, Michael Lampis, Richard Schmied
2013 J jnl
New Inapproximability Bounds for TSP.
Electron. Colloquium Comput. Complex.
Marek Karpinski, Michael Lampis, Richard Schmied
2013 — —
On Approximability of Bounded Degree Instances of Selected Optimization Problems.
Richard Schmied
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
2012 J jnl
On Approximation Lower Bounds for TSP with Bounded Metrics
CoRR
Marek Karpinski, Richard Schmied
2012 J jnl
On Approximation Lower Bounds for TSP with Bounded Metrics.
Electron. Colloquium Comput. Complex.
Marek Karpinski, Richard Schmied
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
Improved Lower Bounds for the Shortest Superstring and Related Problems
CoRR
Marek Karpinski, Richard Schmied
2011 J jnl
Improved Lower Bounds for the Shortest Superstring and Related Problems.
Electron. Colloquium Comput. Complex.
Marek Karpinski, Richard Schmied
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