2008 |
13 | | Bernhard Fuchs,
Anna Schulze:
A Simple 3-Approximation of Minimum Manhattan Networks.
CTW 2008: 26-29 |
12 | EE | Bernhard Fuchs:
On the hardness of range assignment problems.
Networks 52(4): 183-195 (2008) |
2007 |
11 | EE | Bernhard Fuchs,
Walter Kern,
Xinhui Wang:
The Number of Tree Stars Is O *(1.357 k ).
Algorithmica 49(3): 232-244 (2007) |
10 | EE | Ulrich Faigle,
Bernhard Fuchs,
Britta Peis:
Note on maximal split-stable subgraphs.
Discrete Applied Mathematics 155(15): 2031-2038 (2007) |
9 | EE | Bernhard Fuchs,
Walter Kern,
Daniel Mölle,
Stefan Richter,
Peter Rossmanith,
Xinhui Wang:
Dynamic Programming for Minimum Steiner Trees.
Theory Comput. Syst. 41(3): 493-500 (2007) |
2006 |
8 | EE | Bernhard Fuchs:
On the Hardness of Range Assignment Problems.
CIAC 2006: 127-138 |
7 | EE | Bernhard Fuchs,
Walter Kern,
Xinhui Wang:
The number of tree stars is O*(1.357k).
Electronic Notes in Discrete Mathematics 25: 183-185 (2006) |
2005 |
6 | EE | Yadhu Kumar,
Ralf Westram,
Sebastian Behrens,
Bernhard Fuchs,
Frank Oliver Glöckner,
Rudolf Amann,
Harald Meier,
Wolfgang Ludwig:
Graphical representation of ribosomal RNA probe accessibility data using ARB software package.
BMC Bioinformatics 6: 61 (2005) |
5 | EE | Bernhard Fuchs:
On the Hardness of Range Assignment Problems
Electronic Colloquium on Computational Complexity (ECCC)(113): (2005) |
4 | EE | Bernhard Fuchs,
Winfried Hochstättler,
Walter Kern:
Online matching on a line.
Theor. Comput. Sci. 332(1-3): 251-264 (2005) |
2004 |
3 | EE | Ulrich Faigle,
Bernhard Fuchs,
Britta Wienand:
Covering Graphs by Colored Stable Sets.
Electronic Notes in Discrete Mathematics 17: 145-149 (2004) |
2003 |
2 | EE | Bernhard Fuchs,
Winfried Hochstättler,
Walter Kern:
Online Matching On a Line.
Electronic Notes in Discrete Mathematics 13: 49-51 (2003) |
1 | EE | Bernhard Fuchs:
A note on the terminal Steiner tree problem.
Inf. Process. Lett. 87(4): 219-220 (2003) |