Falk Hüffner

Hartmut Ehrig, Claudia Ermel, Falk Hüffner, Rolf Niedermeier, Olga Runge: Confluence in Data Reduction: Bridging Graph Transformation and Kernelization. CiE 2012: 193-202

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

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

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

Antonios Antoniadis, Falk Hüffner, Pascal Lenzner, Carsten Moldenhauer, Alexander Souza: Balanced Interval Coloring. STACS 2011: 531-542

Britta Dorn, Falk Hüffner, Dominikus Krüger, Rolf Niedermeier, Johannes Uhlmann: Exploiting Bounded Signal Flow for Graph Orientation Based on Cause-Effect Pairs. TAPAS 2011: 104-115

Sharon Bruckner, Falk Hüffner, Richard M. Karp, Ron Shamir, Roded Sharan: Topology-Free Querying of Protein Interaction Networks. Journal of Computational Biology 17(3): 237-252 (2010)

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

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

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

Sabine Helwig, Falk Hüffner, Ivo Rössling, Maik Weinard: Selected Design Issues. Algorithm Engineering 2010: 58-126

Antonios Antoniadis, Falk Hüffner, Pascal Lenzner, Carsten Moldenhauer, Alexander Souza: Balanced Interval Coloring. CoRR abs/1012.3932 (2010)

Falk Hüffner: Parametrisierte Ansätze für schwere Graphprobleme: Algorithmen und Experimente (Algorithms and Experiments for Parameterized Approaches to Hard Graph Problems). it - Information Technology 51(3): 171-174 (2009)

Falk Hüffner: Algorithm Engineering for Optimal Graph Bipartization. J. Graph Algorithms Appl. 13(2): 77-98 (2009)

Sharon Bruckner, Falk Hüffner, Richard M. Karp, Ron Shamir, Roded Sharan: Torque: topology-free querying of protein interaction networks. Nucleic Acids Research 37(Web-Server-Issue): 106-108 (2009)

Christian Komusiewicz, Falk Hüffner, Hannes Moser, Rolf Niedermeier: Isolation concepts for efficiently enumerating dense subgraphs. Theor. Comput. Sci. 410(38-40): 3640-3654 (2009)

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

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

Sharon Bruckner, Falk Hüffner, Richard M. Karp, Ron Shamir, Roded Sharan: Topology-Free Querying of Protein Interaction Networks. RECOMB 2009: 74-89

Falk Hüffner, Sebastian Wernicke, Thomas Zichner: Algorithm Engineering for Color-Coding with Applications to Signaling Pathway Detection. Algorithmica 52(2): 114-132 (2008)

Falk Hüffner, Rolf Niedermeier, Sebastian Wernicke: Techniques for Practical Fixed-Parameter Algorithms. Comput. J. 51(1): 7-25 (2008)

Michael Dom, Jiong Guo, Falk Hüffner, Rolf Niedermeier: Closest 4-leaf power is fixed-parameter tractable. Discrete Applied Mathematics 156(18): 3345-3361 (2008)

Jiong Guo, Falk Hüffner, Erhan Kenar, Rolf Niedermeier, Johannes Uhlmann: Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs. European Journal of Operational Research 186(2): 542-553 (2008)

Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier: Data reduction and exact algorithms for clique cover. ACM Journal of Experimental Algorithmics 13 (2008)

Falk Hüffner, Christian Komusiewicz, Hannes Moser, Rolf Niedermeier: Enumerating Isolated Cliques in Synthetic and Financial Networks. COCOA 2008: 405-416

Falk Hüffner, Christian Komusiewicz, Hannes Moser, Rolf Niedermeier: Fixed-Parameter Algorithms for Cluster Vertex Deletion. LATIN 2008: 711-722

Jiong Guo, Falk Hüffner, Christian Komusiewicz, Yong Zhang: Improved Algorithms for Bicluster Editing. TAMC 2008: 445-456

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

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

Falk Hüffner: Automated Search Tree Generation. Encyclopedia of Algorithms 2008

Falk Hüffner: Algorithms and experiments for parameterized approaches to hard graph problems. Friedrich Schiller University of Jena 2007, pp. 1-170

Falk Hüffner, Sebastian Wernicke, Thomas Zichner: FASPAD: fast signaling pathway detection. Bioinformatics 23(13): 1708-1709 (2007)

Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier, Hans-Peter Piepho, Ramona Schmid: Algorithms for compact letter displays: Comparison and evaluation. Computational Statistics & Data Analysis 52(2): 725-736 (2007)

Jiong Guo, Falk Hüffner, Hannes Moser: Feedback arc set in bipartite tournaments is NP-complete. Inf. Process. Lett. 102(2-3): 62-65 (2007)

Falk Hüffner, Sebastian Wernicke, Thomas Zichner: Algorithm Engineering for Color-Coding to Facilitate Signaling Pathway Detection. APBC 2007: 277-286

Christian Komusiewicz, Falk Hüffner, Hannes Moser, Rolf Niedermeier: Isolation Concepts for Enumerating Dense Subgraphs. COCOON 2007: 140-150

Falk Hüffner, Nadja Betzler, Rolf Niedermeier: Optimal Edge Deletions for Signed Graph Balancing. WEA 2007: 297-310

Michael Dom, Jiong Guo, Falk Hüffner, Rolf Niedermeier: Error Compensation in Leaf Power Problems. Algorithmica 44(4): 363-381 (2006)

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

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

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

Michael Dom, Jiong Guo, Falk Hüffner, Rolf Niedermeier, Anke Truß: Fixed-Parameter Tractability Results for Feedback Set Problems in Tournaments. CIAC 2006: 320-331

Jiong Guo, Falk Hüffner, Erhan Kenar, Rolf Niedermeier, Johannes Uhlmann: Complexity and Exact Algorithms for Multicut. SOFSEM 2006: 303-312

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

Jiong Guo, Jens Gramm, Falk Hüffner, Rolf Niedermeier, Sebastian Wernicke: Improved Fixed-Parameter Algorithms for Two Feedback Set Problems. WADS 2005: 158-168

Falk Hüffner: Algorithm Engineering for Optimal Graph Bipartization. WEA 2005: 240-252

Michael Dom, Jiong Guo, Falk Hüffner, Rolf Niedermeier: Extending the Tractability Border for Closest Leaf Powers. WG 2005: 397-408

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

Michael Dom, Jiong Guo, Falk Hüffner, Rolf Niedermeier: Error Compensation in Leaf Root Problems. ISAAC 2004: 389-401

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

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

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

Falk Hüffner, Stefan Edelkamp, Henning Fernau, Rolf Niedermeier: Finding Optimal Solutions to Atomix. KI/ÖGAI 2001: 229-243