Bernhard Fuchs

Orcid: 0000-0001-9828-1290

According to our database1, Bernhard Fuchs authored at least 12 papers between 2003 and 2008.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2008
On the hardness of range assignment problems.
Networks, 2008

A Simple 3-Approximation of Minimum Manhattan Networks.
Proceedings of the Seventh Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2008

2007
On the Approximability of Range Assignment Problems
PhD thesis, 2007

Dynamic Programming for Minimum Steiner Trees.
Theory Comput. Syst., 2007

Speeding up the Dreyfus-Wagner algorithm for minimum Steiner trees.
Math. Methods Oper. Res., 2007

Note on maximal split-stable subgraphs.
Discret. Appl. Math., 2007

The Number of Tree Stars Is <i>O</i> <sup>*</sup>(1.357<sup> <i>k</i> </sup>).
Algorithmica, 2007

2006
The number of tree stars is O<sup>*</sup>(1.357<sup>k</sup>).
Electron. Notes Discret. Math., 2006

2005
Online matching on a line.
Theor. Comput. Sci., 2005

Graphical representation of ribosomal RNA probe accessibility data using ARB software package.
BMC Bioinform., 2005

2004
Covering Graphs by Colored Stable Sets.
Electron. Notes Discret. Math., 2004

2003
A note on the terminal Steiner tree problem.
Inf. Process. Lett., 2003


  Loading...