Bernhard Fuchs
From MaRDI portal
List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| A note on the terminal Steiner tree problem Information Processing Letters | 2009-04-28 | Paper |
| On the hardness of range assignment problems Networks | 2008-12-17 | Paper |
| Speeding up the Dreyfus-Wagner algorithm for minimum Steiner trees Mathematical Methods of Operations Research | 2008-01-16 | Paper |
| Dynamic programming for minimum Steiner trees Theory of Computing Systems | 2007-12-19 | Paper |
| The number of tree stars is \(O^{*}(1.357^k)\) Algorithmica | 2007-11-28 | Paper |
| Note on maximal split-stable subgraphs Discrete Applied Mathematics | 2007-09-19 | Paper |
| Covering Graphs by Colored Stable Sets Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
| The number of tree stars is O*(1.357k) Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
| On the Hardness of Range Assignment Problems Lecture Notes in Computer Science | 2007-05-02 | Paper |
| scientific article; zbMATH DE number 2230243 (Why is no real title available?) | 2005-11-18 | Paper |
| Online matching on a line Theoretical Computer Science | 2005-04-06 | Paper |
Research outcomes over time
This page was built for person: Bernhard Fuchs
