Bernhard Fuchs - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 17 from 17

2025

A Scalable Hybrid Approach to Detecting Fraud with Machine LearningSyrine ben Abid, Bernhard Fuchs, Günter Haberkorn, Kathrin Jepsen, Alexander Krampetz, Detlev Matthes. eusipco 2025: 1297-1301 [doi]

2008

On the hardness of range assignment problemsBernhard Fuchs. networks, 52(4):183-195, 2008. [doi]

A Simple 3-Approximation of Minimum Manhattan NetworksBernhard Fuchs, Anna Schulze. colognetwente 2008: 26-29

2007

Note on maximal split-stable subgraphsUlrich Faigle, Bernhard Fuchs, Britta Peis. DAM, 155(15):2031-2038, 2007. [doi]

On the Approximability of Range Assignment ProblemsBernhard Fuchs. PhD thesis, University of Cologne, Germany, 2007. [doi]

Dynamic Programming for Minimum Steiner TreesBernhard Fuchs, Walter Kern, Daniel Mölle, Stefan Richter, Peter Rossmanith, Xinhui Wang. mst, 41(3):493-500, 2007. [doi]

The Number of Tree Stars Is ::::O:::: :::*:::(1.357::: ::::k:::: :::)Bernhard Fuchs, Walter Kern, Xinhui Wang. algorithmica, 49(3):232-244, 2007. [doi]

Speeding up the Dreyfus-Wagner algorithm for minimum Steiner treesBernhard Fuchs, Walter Kern, Xinhui Wang. mmor, 66(1):117-125, 2007. [doi]

2006

On the Hardness of Range Assignment ProblemsBernhard Fuchs. ciac 2006: 127-138 [doi]

The number of tree stars is O:::*:::(1.357:::k:::)Bernhard Fuchs, Walter Kern, Xinhui Wang. endm, 25:183-185, 2006. [doi]

2005

2004

Covering Graphs by Colored Stable SetsUlrich Faigle, Bernhard Fuchs, Britta Wienand. endm, 17:145-149, 2004. [doi]

Covering Graphs by Colored Stable SetsUlrich Faigle, Bernhard Fuchs, Britta Wienand. colognetwente 2004: 127-131

2003

A note on the terminal Steiner tree problemBernhard Fuchs. ipl, 87(4):219-220, 2003. [doi]

Online Matching On a LineBernhard Fuchs, Winfried Hochstättler, Walter Kern. endm, 13:49-51, 2003. [doi]

Sign in or sign up to see more results.

runs on WebDSL