Finding Optimal Solutions to Atomix. - Falk Hüffner; Stefan Edelkamp; Henning Fernau; Rolf Niedermeier (KI/ÖGAI, 2001)

Graph-Modeled Data Clustering: Fixed-Parameter Algorithms for Clique Generation. - Jens Gramm; Jiong Guo; Falk Hüffner; Rolf Niedermeier (CIAC, 2003)

Automated Generation of Search Tree Algorithms for Graph Modification Problems. - Jens Gramm; Jiong Guo; Falk Hüffner; Rolf Niedermeier (ESA, 2003)

Error Compensation in Leaf Root Problems. - Michael Dom; Jiong Guo; Falk Hüffner; Rolf Niedermeier (ISAAC, 2004)

A Structural View on Parameterizing Problems: Distance from Triviality. - Jiong Guo; Falk Hüffner; Rolf Niedermeier (IWPEC, 2004)

Automated Generation of Search Tree Algorithms for Hard Graph Modification Problems. - Jens Gramm; Jiong Guo; Falk Hüffner; Rolf Niedermeier (Algorithmica, 2004)

Improved Fixed-Parameter Algorithms for Two Feedback Set Problems. - Jiong Guo; Jens Gramm; Falk Hüffner; Rolf Niedermeier; Sebastian Wernicke 001 (WADS, 2005)

Extending the Tractability Border for Closest Leaf Powers. - Michael Dom; Jiong Guo; Falk Hüffner; Rolf Niedermeier (WG, 2005)

Graph-Modeled Data Clustering: Exact Algorithms for Clique Generation. - Jens Gramm; Jiong Guo; Falk Hüffner; Rolf Niedermeier (Theory Comput. Syst., 2005)

Matrix Robustness, with an Application to Power System Observability. - Matthias Brosemann; Jochen Alber; Falk Hüffner; Rolf Niedermeier (ACiD, 2006)

Data Reduction, Exact, and Heuristic Algorithms for Clique Cover. - Jens Gramm; Jiong Guo; Falk Hüffner; Rolf Niedermeier (ALENEX, 2006)

Complexity and Exact Algorithms for Multicut. - Jiong Guo; Falk Hüffner; Erhan Kenar; Rolf Niedermeier; Johannes Uhlmann (SOFSEM, 2006)

Error Compensation in Leaf Power Problems. - Michael Dom; Jiong Guo; Falk Hüffner; Rolf Niedermeier (Algorithmica, 2006)

Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization. - Jiong Guo; Jens Gramm; Falk Hüffner; Rolf Niedermeier; Sebastian Wernicke 001 (J. Comput. Syst. Sci., 2006)

Algorithm Engineering for Color-Coding to Facilitate Signaling Pathway Detection. - Falk Hüffner; Sebastian Wernicke 001; Thomas Zichner (APBC, 2007)

Isolation Concepts for Enumerating Dense Subgraphs. - Christian Komusiewicz; Falk Hüffner; Hannes Moser; Rolf Niedermeier (COCOON, 2007)

Parametrisierte Ansätze für schwere Graphprobleme: Algorithmen und Experimente [Algorithms and Experiments for Parameterized Approaches to Hard Graph Problems]. - Falk Hüffner (Ausgezeichnete Informatikdissertationen, 2007)

Optimal Edge Deletions for Signed Graph Balancing. - Falk Hüffner; Nadja Betzler; Rolf Niedermeier (WEA, 2007)

FASPAD: fast signaling pathway detection. - Falk Hüffner; Sebastian Wernicke 001; Thomas Zichner (Bioinform., 2007)

Algorithms for compact letter displays: Comparison and evaluation. - Jens Gramm; Jiong Guo; Falk Hüffner; Rolf Niedermeier; Hans-Peter Piepho; Ramona Schmid (Comput. Stat. Data Anal., 2007)

Feedback arc set in bipartite tournaments is NP-complete. - Jiong Guo; Falk Hüffner; Hannes Moser (Inf. Process. Lett., 2007)

Algorithms and experiments for parameterized approaches to hard graph problems. - Falk Hüffner (2007)

Enumerating Isolated Cliques in Synthetic and Financial Networks. - Falk Hüffner; Christian Komusiewicz; Hannes Moser; Rolf Niedermeier (COCOA, 2008)

Improved Algorithms for Bicluster Editing. - Jiong Guo; Falk Hüffner; Christian Komusiewicz; Yong Zhang 053 (TAMC, 2008)

Speeding up Dynamic Programming for Some NP-Hard Graph Recoloring Problems. - Oriana Ponta; Falk Hüffner; Rolf Niedermeier (TAMC, 2008)

Algorithm Engineering for Color-Coding with Applications to Signaling Pathway Detection. - Falk Hüffner; Sebastian Wernicke 001; Thomas Zichner (Algorithmica, 2008)

Techniques for Practical Fixed-Parameter Algorithms. - Falk Hüffner; Rolf Niedermeier; Sebastian Wernicke 001 (Comput. J., 2008)

Closest 4-leaf power is fixed-parameter tractable. - Michael Dom; Jiong Guo; Falk Hüffner; Rolf Niedermeier (Discret. Appl. Math., 2008)

Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs. - Jiong Guo; Falk Hüffner; Erhan Kenar; Rolf Niedermeier; Johannes Uhlmann (Eur. J. Oper. Res., 2008)

Data reduction and exact algorithms for clique cover. - Jens Gramm; Jiong Guo; Falk Hüffner; Rolf Niedermeier (ACM J. Exp. Algorithmics, 2008)

Tiefensuche (Ariadne und Co.). - Michael Dom; Falk Hüffner; Rolf Niedermeier (Taschenbuch der Algorithmen, 2008)

Automated Search Tree Generation. - Falk Hüffner (Encyclopedia of Algorithms, 2008)

A Faster Fixed-Parameter Approach to Drawing Binary Tanglegrams. - Sebastian Böcker; Falk Hüffner; Anke Truß; Magnus Wahlström (IWPEC, 2009)

Parametrisierte Ansätze für schwere Graphprobleme: Algorithmen und Experimente (Algorithms and Experiments for Parameterized Approaches to Hard Graph Problems). - Falk Hüffner (it Inf. Technol., 2009)

Algorithm Engineering for Optimal Graph Bipartization. - Falk Hüffner (J. Graph Algorithms Appl., 2009)

Torque: topology-free querying of protein interaction networks. - Sharon Bruckner; Falk Hüffner; Richard M. Karp; Ron Shamir; Roded Sharan (Nucleic Acids Res., 2009)

Isolation concepts for clique enumeration: Comparison and computational experiments. - Falk Hüffner; Christian Komusiewicz; Hannes Moser; Rolf Niedermeier (Theor. Comput. Sci., 2009)

Isolation concepts for efficiently enumerating dense subgraphs. - Christian Komusiewicz; Falk Hüffner; Hannes Moser; Rolf Niedermeier (Theor. Comput. Sci., 2009)

Selected Design Issues. - Sabine Helwig; Falk Hüffner; Ivo Rössling; Maik Weinard (Algorithm Engineering, 2010)

Topology-Free Querying of Protein Interaction Networks. - Sharon Bruckner; Falk Hüffner; Richard M. Karp; Ron Shamir; Roded Sharan (J. Comput. Biol., 2010)

Separator-based data reduction for signed graph balancing. - Falk Hüffner; Nadja Betzler; Rolf Niedermeier (J. Comb. Optim., 2010)

Fixed-parameter tractability results for feedback set problems in tournaments. - Michael Dom; Jiong Guo; Falk Hüffner; Rolf Niedermeier; Anke Truß (J. Discrete Algorithms, 2010)

Fixed-Parameter Algorithms for Cluster Vertex Deletion. - Falk Hüffner; Christian Komusiewicz; Hannes Moser; Rolf Niedermeier (Theory Comput. Syst., 2010)

Depth-First Search (Ariadne & Co.). - Michael Dom; Falk Hüffner; Rolf Niedermeier (Algorithms Unplugged, 2011)

Balanced Interval Coloring. - Antonios Antoniadis 001; Falk Hüffner; Pascal Lenzner; Carsten Moldenhauer; Alexander Souza (STACS, 2011)

Exploiting bounded signal flow for graph orientation based on cause-effect pairs. - Britta Dorn; Falk Hüffner; Dominikus Krüger; Rolf Niedermeier; Johannes Uhlmann (Algorithms Mol. Biol., 2011)

Partitioning into Colorful Components by Minimum Edge Deletions. - Sharon Bruckner; Falk Hüffner; Christian Komusiewicz; Rolf Niedermeier; Sven Thiel; Johannes Uhlmann (CPM, 2012)

Parameterized Complexity of DAG Partitioning. - René van Bevern; Robert Bredereck; Morgan Chopin; Sepp Hartung; Falk Hüffner; André Nichterlein; Ondrej Suchý 001 (CIAC, 2013)

Evaluation of ILP-Based Approaches for Partitioning into Colorful Components. - Sharon Bruckner; Falk Hüffner; Christian Komusiewicz; Rolf Niedermeier (SEA, 2013)

Confluence in Data Reduction: Bridging Graph Transformation and Kernelization. - Hartmut Ehrig; Claudia Ermel; Falk Hüffner; Rolf Niedermeier; Olga Runge (Comput., 2013)

Multivariate Algorithmics for NP-Hard String Problems. - Laurent Bulteau; Falk Hüffner; Christian Komusiewicz; Rolf Niedermeier (Bull. EATCS, 2014)

Partitioning Biological Networks into Highly Connected Clusters with Maximum Edge Coverage. - Falk Hüffner; Christian Komusiewicz; Adrian Liebtrau; Rolf Niedermeier (IEEE ACM Trans. Comput. Biol. Bioinform., 2014)

Finding Highly Connected Subgraphs. - Falk Hüffner; Christian Komusiewicz; Manuel Sorge (SOFSEM, 2015)

Editing Graphs Into Few Cliques: Complexity, Approximation, and Kernelization Schemes. - Falk Hüffner; Christian Komusiewicz; André Nichterlein (WADS, 2015)

The Parameterized Complexity of the Rainbow Subgraph Problem. - Falk Hüffner; Christian Komusiewicz; Rolf Niedermeier; Martin Rötzschke (Algorithms, 2015)

A graph modification approach for finding core-periphery structures in protein interaction networks. - Sharon Bruckner; Falk Hüffner; Christian Komusiewicz (Algorithms Mol. Biol., 2015)

Approximability and parameterized complexity of multicover by c-intervals. - René van Bevern; Jiehua Chen 001; Falk Hüffner; Stefan Kratsch; Nimrod Talmon; Gerhard J. Woeginger (Inf. Process. Lett., 2015)

Automated Search Tree Generation. - Falk Hüffner (Encyclopedia of Algorithms, 2016)

Fixed-parameter algorithms for DAG Partitioning. - René van Bevern; Robert Bredereck; Morgan Chopin; Sepp Hartung; Falk Hüffner; André Nichterlein; Ondrej Suchý 001 (Discret. Appl. Math., 2017)

Matching algorithms for assigning orthologs after genome duplication events. - Guillaume Fertin; Falk Hüffner; Christian Komusiewicz; Manuel Sorge (Comput. Biol. Chem., 2018)

Parameterized complexity of team formation in social networks. - Robert Bredereck; Jiehua Chen 001; Falk Hüffner; Stefan Kratsch (Theor. Comput. Sci., 2018)

A Strategic Routing Framework and Algorithms for Computing Alternative Paths. - Thomas Bläsius; Maximilian Böther; Philipp Fischbeck; Tobias Friedrich 001; Alina Gries; Falk Hüffner; Otto Kißig; Pascal Lenzner; Louise Molitor; Leon Schiller; Armin Wells; Simon Wietheger (ATMOS, 2020)