default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBernhard Fuchs
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2008
[j11]Bernhard Fuchs:
On the hardness of range assignment problems. Networks 52(4): 183-195 (2008)- [c3]Bernhard Fuchs, Anna Schulze:
A Simple 3-Approximation of Minimum Manhattan Networks. CTW 2008: 26-29 - 2007
- [b1]Bernhard Fuchs:
On the Approximability of Range Assignment Problems. University of Cologne, Germany, 2007 - [j10]Bernhard Fuchs, Walter Kern, Xinhui Wang:
The Number of Tree Stars Is O *(1.357 k ). Algorithmica 49(3): 232-244 (2007) - [j9]Ulrich Faigle, Bernhard Fuchs, Britta Peis:
Note on maximal split-stable subgraphs. Discret. Appl. Math. 155(15): 2031-2038 (2007) - [j8]Bernhard Fuchs, Walter Kern, Xinhui Wang:
Speeding up the Dreyfus-Wagner algorithm for minimum Steiner trees. Math. Methods Oper. Res. 66(1): 117-125 (2007) - [j7]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
- [j6]Bernhard Fuchs, Walter Kern, Xinhui Wang:
The number of tree stars is O*(1.357k). Electron. Notes Discret. Math. 25: 183-185 (2006) - [c2]Bernhard Fuchs:
On the Hardness of Range Assignment Problems. CIAC 2006: 127-138 - 2005
- [j5]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 Bioinform. 6: 61 (2005) - [j4]Bernhard Fuchs, Winfried Hochstättler, Walter Kern:
Online matching on a line. Theor. Comput. Sci. 332(1-3): 251-264 (2005) - [i1]Bernhard Fuchs:
On the Hardness of Range Assignment Problems. Electron. Colloquium Comput. Complex. TR05 (2005) - 2004
- [j3]Ulrich Faigle, Bernhard Fuchs, Britta Wienand:
Covering Graphs by Colored Stable Sets. Electron. Notes Discret. Math. 17: 145-149 (2004) - [c1]Ulrich Faigle, Bernhard Fuchs, Britta Wienand:
Covering Graphs by Colored Stable Sets. CTW 2004: 127-131 - 2003
- [j2]Bernhard Fuchs, Winfried Hochstättler, Walter Kern:
Online Matching On a Line. Electron. Notes Discret. Math. 13: 49-51 (2003) - [j1]Bernhard Fuchs:
A note on the terminal Steiner tree problem. Inf. Process. Lett. 87(4): 219-220 (2003)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
