Falk Hüffner

发表

Topology-Free Querying of Protein Interaction Networks

Roded Sharan, Richard M. Karp, Ron Shamir, 2009, RECOMB.

Graph-Modeled Data Clustering: Fixed-Parameter Algorithms for Clique Generation

Rolf Niedermeier, Falk Hüffner, Jiong Guo, 2003, CIAC.

Graph Modification Problems and Automated Search Tree Generation

Falk Hüffner, 2003 .

Topology-Free Querying of Protein Interaction Networks

Roded Sharan, Richard M. Karp, Ron Shamir, 2009, RECOMB.

Fixed-parameter tractability results for feedback set problems in tournaments

Rolf Niedermeier, Falk Hüffner, Jiong Guo, 2010, J. Discrete Algorithms.

On the Complexity of the Highly Connected Deletion Problem

Christian Komusiewicz, R. Niedermeier, Falk Hüffner, 2013 .

Algorithm Engineering for Optimal Graph Bipartization Falk Hüffner

Falk Hüffner, 2005 .

Closest Strings , Primer Design , and Motif Search 1

R. Niedermeier, Falk Hüffner, J. Gramm, 2002 .

Diplomarbeit Graph Modification Problems and Automated Search Tree Generation Falk Hüffner

R. Niedermeier, Falk Hüffner, 2003 .

Selected Design Issues

Falk Hüffner, Sabine Helwig, Ivo Rössling, 2010, Algorithm Engineering.

Separator-based data reduction for signed graph balancing

Rolf Niedermeier, Nadja Betzler, Falk Hüffner, 2010, J. Comb. Optim..

Parametrisierte Ansätze für schwere Graphprobleme: Algorithmen und ExperimenteAlgorithms and Experiments for Parameterized Approaches to Hard Graph Problems

Falk Hüffner, Falk Hüffner, 2009, it Inf. Technol..

Isolation concepts for efficiently enumerating dense subgraphs

Christian Komusiewicz, Rolf Niedermeier, Hannes Moser, 2009, Theor. Comput. Sci..

Matching algorithms for assigning orthologs after genome duplication events

Christian Komusiewicz, Falk Hüffner, Guillaume Fertin, 2018, Comput. Biol. Chem..

Multivariate Algorithmics for NP-Hard String Problems

Christian Komusiewicz, Rolf Niedermeier, Falk Hüffner, 2014, Bull. EATCS.

Closest 4-leaf power is fixed-parameter tractable

Rolf Niedermeier, Falk Hüffner, Jiong Guo, 2008, Discret. Appl. Math..

Improved Algorithms for Bicluster Editing

Yong Zhang, Christian Komusiewicz, Falk Hüffner, 2008, TAMC.

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

Rolf Niedermeier, Falk Hüffner, Sebastian Wernicke, 2006, J. Comput. Syst. Sci..

Parameterized Algorithmics for Finding Exact Solutions of NP-Hard Biological Problems.

Christian Komusiewicz, Rolf Niedermeier, Falk Hüffner, 2017, Methods in molecular biology.

Data reduction and exact algorithms for clique cover

Rolf Niedermeier, Falk Hüffner, Jiong Guo, 2009, JEAL.

Developing fixed-parameter algorithms to solve combinatorially explosive biological problems.

Rolf Niedermeier, Falk Hüffner, Sebastian Wernicke, 2008, Methods in molecular biology.

Algorithms for compact letter displays: Comparison and evaluation

Rolf Niedermeier, Falk Hüffner, Hans-Peter Piepho, 2007, Comput. Stat. Data Anal..

Isolation concepts for clique enumeration: Comparison and computational experiments

Christian Komusiewicz, Rolf Niedermeier, Hannes Moser, 2009, Theor. Comput. Sci..

Enumerating Isolated Cliques in Synthetic and Financial Networks

Christian Komusiewicz, Rolf Niedermeier, Hannes Moser, 2008, COCOA.

Fixed-Parameter Algorithms for Graph-Modeled Data Clustering

Rolf Niedermeier, Falk Hüffner, Sebastian Wernicke, 2007 .

Automated Generation of Search Tree Algorithms for Hard Graph Modification Problems

Rolf Niedermeier, Falk Hüffner, Jiong Guo, 2004, Algorithmica.

A Faster Fixed-Parameter Approach to Drawing Binary Tanglegrams

Magnus Wahlström, Falk Hüffner, Sebastian Böcker, 2009, IWPEC.

Partitioning Biological Networks into Highly Connected Clusters with Maximum Edge Coverage

Christian Komusiewicz, Rolf Niedermeier, Falk Hüffner, 2014, IEEE/ACM Transactions on Computational Biology and Bioinformatics.

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

Thomas Zichner, Falk Hüffner, Sebastian Wernicke, 2008, Algorithmica.

Exploiting bounded signal flow for graph orientation based on cause-effect pairs

Rolf Niedermeier, Falk Hüffner, Britta Dorn, 2011, Algorithms for Molecular Biology.

Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs

Rolf Niedermeier, Falk Hüffner, Erhan Kenar, 2008, Eur. J. Oper. Res..

A Structural View on Parameterizing Problems: Distance from Triviality

Rolf Niedermeier, Falk Hüffner, Jiong Guo, 2004, IWPEC.

Fixed-Parameter Algorithms for Cluster Vertex Deletion

Christian Komusiewicz, Rolf Niedermeier, Hannes Moser, 2010, Theory of Computing Systems.

Fixed-Parameter Algorithms for Cluster Vertex Deletion

Christian Komusiewicz, Rolf Niedermeier, Hannes Moser, 2008, LATIN.

Algorithm Engineering for Optimal Graph Bipartization

Falk Hüffner, Falk Hüffner, 2005, J. Graph Algorithms Appl..

Graph-Modeled Data Clustering: Exact Algorithms for Clique Generation

Rolf Niedermeier, Falk Hüffner, Jiong Guo, 2005, Theory of Computing Systems.

Balanced Interval Coloring

Alexander Souza, Falk Hüffner, Antonios Antoniadis, 2010, STACS.

Techniques for Practical Fixed-Parameter Algorithms

Rolf Niedermeier, Falk Hüffner, Sebastian Wernicke, 2007, Comput. J..

Optimal Edge Deletions for Signed Graph Balancing

Rolf Niedermeier, Nadja Betzler, Falk Hüffner, 2007, WEA.

Fixed-parameter tractability results for feedback set problems in tournaments

Rolf Niedermeier, Falk Hüffner, Jiong Guo, 2006, J. Discrete Algorithms.

Algorithms and experiments for parameterized approaches to hard graph problems

Falk Hüffner, 2007 .

Algorithms and Experiments for Parameterized Approaches to Hard Graph Problems

Falk Hüffner, 2007 .

Parameterized Complexity of Team Formation in Social Networks

Stefan Kratsch, Robert Bredereck, Falk Hüffner, 2016, AAIM.

Speeding up Dynamic Programming for Some NP-Hard Graph Recoloring Problems

Rolf Niedermeier, Falk Hüffner, Oriana Ponta, 2008, TAMC.

Improved Fixed-Parameter Algorithms for Two Feedback Set Problems

Rolf Niedermeier, Falk Hüffner, Sebastian Wernicke, 2005, WADS.

Error Compensation in Leaf Root Problems

Rolf Niedermeier, Falk Hüffner, Jiong Guo, 2004, ISAAC.

A graph modification approach for finding core–periphery structures in protein interaction networks

Christian Komusiewicz, Falk Hüffner, Sharon Bruckner, 2014, Algorithms for Molecular Biology.

Confluence in Data Reduction: Bridging Graph Transformation and Kernelization

Hartmut Ehrig, Rolf Niedermeier, Falk Hüffner, 2012, Comput..

Confluence in Data Reduction: Bridging Graph Transformation and Kernelization

Hartmut Ehrig, Rolf Niedermeier, Falk Hüffner, 2012, De Computis.

Data Reduction, Exact, and Heuristic Algorithms for Clique Cover

Rolf Niedermeier, Falk Hüffner, Jiong Guo, 2006, ALENEX.

Fixed-parameter algorithms for DAG Partitioning

René van Bevern, Robert Bredereck, Falk Hüffner, 2016, Discret. Appl. Math..

Torque: topology-free querying of protein interaction networks

Roded Sharan, Richard M. Karp, Ron Shamir, 2009, Nucleic Acids Res..

Isolation Concepts for Enumerating Dense Subgraphs

Christian Komusiewicz, Rolf Niedermeier, Hannes Moser, 2007, COCOON.