A note on the terminal Steiner tree problem. - Bernhard Fuchs (Inf. Process. Lett., 2003)

Covering Graphs by Colored Stable Sets. - Ulrich Faigle; Bernhard Fuchs; Britta Wienand (Electron. Notes Discret. Math., 2004)

Graphical representation of ribosomal RNA probe accessibility data using ARB software package. - Yadhu Kumar; Ralf Westram; Sebastian Behrens; Bernhard Fuchs; Frank Oliver Glöckner; Rudolf Amann; Harald Meier; Wolfgang Ludwig (BMC Bioinform., 2005)

Online matching on a line. - Bernhard Fuchs; Winfried Hochstättler; Walter Kern (Theor. Comput. Sci., 2005)

The number of tree stars is O*(1.357k). - Bernhard Fuchs; Walter Kern; Xinhui Wang (Electron. Notes Discret. Math., 2006)

The Number of Tree Stars Is O *(1.357 k ). - Bernhard Fuchs; Walter Kern; Xinhui Wang (Algorithmica, 2007)

Note on maximal split-stable subgraphs. - Ulrich Faigle; Bernhard Fuchs; Britta Peis (Discret. Appl. Math., 2007)

Speeding up the Dreyfus-Wagner algorithm for minimum Steiner trees. - Bernhard Fuchs; Walter Kern; Xinhui Wang (Math. Methods Oper. Res., 2007)

Dynamic Programming for Minimum Steiner Trees. - Bernhard Fuchs; Walter Kern; Daniel Mölle; Stefan Richter 001; Peter Rossmanith; Xinhui Wang (Theory Comput. Syst., 2007)

On the Approximability of Range Assignment Problems - Bernhard Fuchs (2007)

A Simple 3-Approximation of Minimum Manhattan Networks. - Bernhard Fuchs; Anna Schulze (CTW, 2008)

On the hardness of range assignment problems. - Bernhard Fuchs (Networks, 2008)