Filter Results:
- Full text PDF available (44)
Publication Year
2001
2018
- This year (2)
- Last 5 years (20)
- Last 10 years (46)
Publication Type
Co-author
Journals and Conferences
Learn More
- Jiong Guo, Jens Gramm, Falk Hüffner, Rolf Niedermeier, Sebastian Wernicke
- J. Comput. Syst. Sci.
- 2006
We show that the NP-complete FEEDBACK VERTEX SET problem, which asks for the smallest set of vertices to remove from a graph to destroy all cycles, is deterministically solvable in O(ck · m) time.… (More)
- Sharon Bruckner, Falk Hüffner, Richard M. Karp, Ron Shamir, Roded Sharan
- Journal of Computational Biology
- 2009
In the network querying problem, one is given a protein complex or pathway of species A and a protein-protein interaction network of species B; the goal is to identify subnetworks of B that are… (More)
- Falk Hüffner, Sebastian Wernicke, Thomas Zichner
- Algorithmica
- 2007
Color-coding is a technique to design fixed-parameter algorithms for several NP-complete subgraph isomorphism problems. Somewhat surprisingly, not much work has so far been spent on the actual… (More)
- Falk Hüffner, Nadja Betzler, Rolf Niedermeier
- WEA
- 2007
The Balanced Subgraph problem (edge deletion variant) asks for a 2-coloring of a graph that minimizes the inconsistencies with given edge labels. It has applications in social networks, systems… (More)
- Falk Hüffner, Nadja Betzler, Rolf Niedermeier
- J. Comb. Optim.
- 2010
Abstract Polynomial-time data reduction is a classical approach to h ard graph problems. Typically, particular small subgraphs are replaced b y smaller gadgets. We generalize this approach to handle… (More)
- Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier
- Theory of Computing Systems
- 2004
We present efficient fixed-parameter algorithms for the NP-complete edge modification problems Cluster Editing and Cluster Deletion. Here, the goal is to make the fewest changes to the edge set of an… (More)
- Jiong Guo, Falk Hüffner, Rolf Niedermeier
- IWPEC
- 2004
Based on a series of known and new examples, we propose the generalized setting of “distance from triviality” measurement as a reasonable and prospective way of determining useful structural problem… (More)
- Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier
- ACM Journal of Experimental Algorithmics
- 2008
To cover the edges of a graph with a minimum number of cliques is an NP-hard problem with many applications. For this problem we develop efficient and effective polynomial-time data reduction rules… (More)
- Falk Hüffner, Christian Komusiewicz, Hannes Moser, Rolf Niedermeier
- Theory of Computing Systems
- 2008
We initiate the first systematic study of the NP-hard Cluster Vertex Deletion (CVD) problem (unweighted and weighted) in terms of fixed-parameter algorithmics. In the unweighted case, one searches… (More)
- Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier
- Algorithmica
- 2004
We present a framework for an automated generation of exact search tree algorithms for NP-hard problems. The purpose of our approach is twofold—rapid development and improved upper bounds. Many… (More)