Falk Hüffner

Publications
Influence

Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization

J. Guo, J. Gramm, Falk Hüffner, R. Niedermeier, S. Wernicke
Mathematics, Computer Science
J. Comput. Syst. Sci.
1 December 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(c^[email protected]?m) time. Expand

Algorithm Engineering for Color-Coding with Applications to Signaling Pathway Detection

Falk Hüffner, S. Wernicke, T. Zichner
Mathematics, Computer Science
Algorithmica
25 August 2008

This work gives various novel algorithmic improvements for color-coding, both from a worst-case perspective as well as under practical considerations. Expand

Separator-based data reduction for signed graph balancing

Falk Hüffner, N. Betzler, R. Niedermeier
Computer Science, Mathematics
J. Comb. Optim.
1 November 2010

Polynomial-time data reduction is a classical approach to hard graph problems. Expand

Graph-Modeled Data Clustering: Exact Algorithms for Clique Generation

J. Gramm, J. Guo, Falk Hüffner, R. Niedermeier
Mathematics, Computer Science
Theory of Computing Systems
1 July 2005

We present efficient fixed-parameter algorithms for the NP-complete edge modification problems Cluster Editing and Cluster Deletion. Expand

Topology-Free Querying of Protein Interaction Networks

S. Bruckner, Falk Hüffner, R. Karp, R. Shamir, R. Sharan
Biology, Computer Science
J. Comput. Biol.
1 March 2010

In the network querying problem, one is given a protein complex or pathway of species A and a protein interaction network of species B; the goal is to identify subnetworks of B that are similar to the query in terms of sequence, topology, or both. Expand

Algorithm Engineering for Optimal Graph Bipartization

Falk Hüffner
Computer Science
WEA
10 May 2005

We examine exact algorithms for the NP-complete Graph Bipartization problem that asks for a minimum set of vertices to delete from a graph to make it bipartite. Expand

Fixed-Parameter Algorithms for Cluster Vertex Deletion

Falk Hüffner, Christian Komusiewicz, H. Moser, R. Niedermeier
Mathematics, Computer Science
Theory of Computing Systems
1 July 2010

We initiate the first systematic study of the NP-hard Cluster Vertex Deletion (CVD) problem (unweighted and weighted) in terms of fixed-parameter algorithmics. Expand

Fixed-Parameter Algorithms for Cluster Vertex Deletion

Falk Hüffner, Christian Komusiewicz, H. Moser, R. Niedermeier
Computer Science
LATIN
7 April 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. Expand

Optimal Edge Deletions for Signed Graph Balancing

Falk Hüffner, N. Betzler, R. Niedermeier
Mathematics, Computer Science
WEA
6 June 2007

We present an exact algorithm for BALANCED SUBGRAPH based on a combination of data reduction rules and a fixed-parameter algorithm. Expand

Automated Generation of Search Tree Algorithms for Hard Graph Modification Problems

J. Gramm, J. Guo, Falk Hüffner, R. Niedermeier
Mathematics, Computer Science
Algorithmica
1 May 2004

We present a framework for an automated generation of exact search tree algorithms for NP-hard problems. Expand

Recommended Authors