default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRichard Schmied
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
[j7]Marek Karpinski, Michael Lampis, Richard Schmied:
New inapproximability bounds for TSP. J. Comput. Syst. Sci. 81(8): 1665-1677 (2015)- [j6]Marek Karpinski, Richard Schmied, Claus Viehmann:
Nearly tight approximation bounds for vertex cover on dense k-uniform k-partite hypergraphs. J. Discrete Algorithms 33: 49-57 (2015) - [j5]Marek Karpinski, Richard Schmied:
Approximation hardness of graphic TSP on cubic graphs. RAIRO Oper. Res. 49(4): 651-668 (2015) - 2013
- [b1]Richard Schmied:
On Approximability of Bounded Degree Instances of Selected Optimization Problems. University of Bonn, 2013 - [c4]Marek Karpinski, Richard Schmied:
Improved Inapproximability Results for the Shortest Superstring and Related Problems. CATS 2013: 27-36 - [c3]Marek Karpinski, Michael Lampis, Richard Schmied:
New Inapproximability Bounds for TSP. ISAAC 2013: 568-578 - [i12]Marek Karpinski, Michael Lampis, Richard Schmied:
New Inapproximability Bounds for TSP. CoRR abs/1303.6437 (2013) - [i11]Marek Karpinski, Richard Schmied:
Approximation Hardness of Graphic TSP on Cubic Graphs. CoRR abs/1304.6800 (2013) - [i10]Marek Karpinski, Michael Lampis, Richard Schmied:
New Inapproximability Bounds for TSP. Electron. Colloquium Comput. Complex. TR13 (2013) - [i9]Marek Karpinski, Richard Schmied:
Approximation Hardness of Graphic TSP on Cubic Graphs. Electron. Colloquium Comput. Complex. TR13 (2013) - 2012
- [j4]Jean Cardinal, Marek Karpinski, Richard Schmied, Claus Viehmann:
Approximating vertex cover in dense hypergraphs. J. Discrete Algorithms 13: 67-77 (2012) - [j3]Mathias Hauptmann, Richard Schmied, Claus Viehmann:
Approximation complexity of Metric Dimension problem. J. Discrete Algorithms 14: 214-222 (2012) - [j2]Richard Schmied, Claus Viehmann:
Approximating edge dominating set in dense graphs. Theor. Comput. Sci. 414(1): 92-99 (2012) - [i8]Marek Karpinski, Richard Schmied:
On Approximation Lower Bounds for TSP with Bounded Metrics. CoRR abs/1201.5821 (2012) - [i7]Marek Karpinski, Richard Schmied:
On Approximation Lower Bounds for TSP with Bounded Metrics. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [j1]Jean Cardinal, Marek Karpinski, Richard Schmied, Claus Viehmann:
Approximating Subdense Instances of Covering Problems. Electron. Notes Discret. Math. 37: 297-302 (2011) - [c2]Richard Schmied, Claus Viehmann:
Approximating Edge Dominating Set in Dense Graphs. TAMC 2011: 37-47 - [i6]Marek Karpinski, Richard Schmied, Claus Viehmann:
Tight Approximation Bounds for Vertex Cover on Dense k-Partite Hypergraphs. CoRR abs/1107.2000 (2011) - [i5]Marek Karpinski, Richard Schmied:
Improved Lower Bounds for the Shortest Superstring and Related Problems. CoRR abs/1111.5442 (2011) - [i4]Marek Karpinski, Richard Schmied:
Improved Lower Bounds for the Shortest Superstring and Related Problems. Electron. Colloquium Comput. Complex. TR11 (2011) - [i3]Marek Karpinski, Richard Schmied, Claus Viehmann:
Tight Approximation Bounds for Vertex Cover on Dense k-Partite Hypergraphs. Electron. Colloquium Comput. Complex. TR11 (2011) - 2010
- [c1]Mathias Hauptmann, Richard Schmied, Claus Viehmann:
On Approximation Complexity of Metric Dimension Problem. IWOCA 2010: 136-139 - [i2]Jean Cardinal, Marek Karpinski, Richard Schmied, Claus Viehmann:
Approximating Subdense Instances of Covering Problems. CoRR abs/1011.0078 (2010) - [i1]Jean Cardinal, Marek Karpinski, Richard Schmied, Claus Viehmann:
Approximating Vertex Cover in Dense Hypergraphs. CoRR abs/1012.2573 (2010)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:09 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
