The following pages link to Bernhard Fuchs (Q1014424):
Displaying 11 items.
- A note on the terminal Steiner tree problem (Q1014425) (← links)
- Online matching on a line (Q1770389) (← links)
- Note on maximal split-stable subgraphs (Q2381823) (← links)
- The number of tree stars is \(O^{*}(1.357^k)\) (Q2461549) (← links)
- Dynamic programming for minimum Steiner trees (Q2464320) (← links)
- Speeding up the Dreyfus-Wagner algorithm for minimum Steiner trees (Q2466792) (← links)
- On the Hardness of Range Assignment Problems (Q3434550) (← links)
- Covering Graphs by Colored Stable Sets (Q3439145) (← links)
- The number of tree stars is O*(1.357k) (Q3439499) (← links)
- On the hardness of range assignment problems (Q3548718) (← links)
- (Q5708535) (← links)