Search    Browse

The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Claus Viehmann" ( http://dblp.L3S.de/Authors/Claus_Viehmann )

  Author page on DBLP  Author page in RDF  Community of Claus Viehmann in ASPL-2

Publication years (Num. hits)
2010 (3) 2011 (4) 2012 (2)
Publication types (Num. hits)
article(7) inproceedings(2)
Venues (Conferences, Journals, ...)
CoRR(3) Electronic Colloquium on Compu...(1) Electronic Notes in Discrete M...(1) IWOCA(1) J. Discrete Algorithms(1) TAMC(1) Theor. Comput. Sci.(1)
Authors
Claus Viehmann(9) Richard Schmied(9) Marek Karpinski(6) Jean Cardinal(4) Mathias Hauptmann(1)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
No Growbag Graphs found.
Results
Found 9 publication records. Showing 9 according to the selection in the facets
Hits ?▲ Authors Title Venue Year Link Author keywords
1Richard Schmied, Claus Viehmann Approximating edge dominating set in dense graphs. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Jean Cardinal, Marek Karpinski, Richard Schmied, Claus Viehmann Approximating vertex cover in dense hypergraphs. Search on Bibsonomy J. Discrete Algorithms The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Jean Cardinal, Marek Karpinski, Richard Schmied, Claus Viehmann Approximating Subdense Instances of Covering Problems. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Marek Karpinski, Richard Schmied, Claus Viehmann Tight Approximation Bounds for Vertex Cover on Dense k-Partite Hypergraphs. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2011 DBLP  BibTeX  RDF
1Marek Karpinski, Richard Schmied, Claus Viehmann Tight Approximation Bounds for Vertex Cover on Dense k-Partite Hypergraphs Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Richard Schmied, Claus Viehmann Approximating Edge Dominating Set in Dense Graphs. Search on Bibsonomy TAMC The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Jean Cardinal, Marek Karpinski, Richard Schmied, Claus Viehmann Approximating Vertex Cover in Dense Hypergraphs Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
1Jean Cardinal, Marek Karpinski, Richard Schmied, Claus Viehmann Approximating Subdense Instances of Covering Problems Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
1Mathias Hauptmann, Richard Schmied, Claus Viehmann On Approximation Complexity of Metric Dimension Problem. Search on Bibsonomy IWOCA The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #9 of 9 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.