Falk Hüffner

According to our database, Falk Hüffner authored at least 62 papers between 2001 and 2020.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2020

A Strategic Routing Framework and Algorithms for Computing Alternative Paths.

Thomas Bläsius, Maximilian Böther, Philipp Fischbeck, Tobias Friedrich, Alina Gries, Falk Hüffner, Otto Kißig, Pascal Lenzner, Louise Molitor, Leon Schiller, Armin Wells, Simon Wietheger

Proceedings of the 20th Symposium on Algorithmic Approaches for Transportation Modelling, 2020

2018

Parameterized complexity of team formation in social networks.

Robert Bredereck, Jiehua Chen, Falk Hüffner, Stefan Kratsch

Theor. Comput. Sci., 2018

Matching algorithms for assigning orthologs after genome duplication events.

Guillaume Fertin, Falk Hüffner, Christian Komusiewicz, Manuel Sorge

Comput. Biol. Chem., 2018

2017

Fixed-parameter algorithms for DAG Partitioning.

René van Bevern, Robert Bredereck, Morgan Chopin, Sepp Hartung, Falk Hüffner, André Nichterlein, Ondrej Suchý

Discret. Appl. Math., 2017

2016

Automated Search Tree Generation.

Falk Hüffner

Encyclopedia of Algorithms, 2016

2015

Approximability and parameterized complexity of multicover by c-intervals.

René van Bevern, Jiehua Chen, Falk Hüffner, Stefan Kratsch, Nimrod Talmon, Gerhard J. Woeginger

Inf. Process. Lett., 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

The Parameterized Complexity of the Rainbow Subgraph Problem.

Falk Hüffner, Christian Komusiewicz, Rolf Niedermeier, Martin Rötzschke

Algorithms, 2015

Editing Graphs Into Few Cliques: Complexity, Approximation, and Kernelization Schemes.

Falk Hüffner, Christian Komusiewicz, André Nichterlein

Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

Finding Highly Connected Subgraphs.

Falk Hüffner, Christian Komusiewicz, Manuel Sorge

Proceedings of the SOFSEM 2015: Theory and Practice of Computer Science, 2015

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

Multivariate Algorithmics for NP-Hard String Problems.

Laurent Bulteau, Falk Hüffner, Christian Komusiewicz, Rolf Niedermeier

Bull. EATCS, 2014

2013

Confluence in Data Reduction: Bridging Graph Transformation and Kernelization.

Hartmut Ehrig, Claudia Ermel, Falk Hüffner, Rolf Niedermeier, Olga Runge

Comput., 2013

Evaluation of ILP-Based Approaches for Partitioning into Colorful Components.

Sharon Bruckner, Falk Hüffner, Christian Komusiewicz, Rolf Niedermeier

Proceedings of the Experimental Algorithms, 12th International Symposium, 2013

Parameterized Complexity of DAG Partitioning.

René van Bevern, Robert Bredereck, Morgan Chopin, Sepp Hartung, Falk Hüffner, André Nichterlein, Ondrej Suchý

Proceedings of the Algorithms and Complexity, 8th International Conference, 2013

2012

Partitioning into Colorful Components by Minimum Edge Deletions.

Sharon Bruckner, Falk Hüffner, Christian Komusiewicz, Rolf Niedermeier, Sven Thiel, Johannes Uhlmann

Proceedings of the Combinatorial Pattern Matching - 23rd Annual Symposium, 2012

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

Balanced Interval Coloring.

Antonios Antoniadis, Falk Hüffner, Pascal Lenzner, Carsten Moldenhauer, Alexander Souza

Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science, 2011

Depth-First Search (Ariadne & Co.).

Michael Dom, Falk Hüffner, Rolf Niedermeier

Proceedings of the Algorithms Unplugged, 2011

2010

Fixed-Parameter Algorithms for Cluster Vertex Deletion.

Falk Hüffner, Christian Komusiewicz, Hannes Moser, Rolf Niedermeier

Theory Comput. Syst., 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

Separator-based data reduction for signed graph balancing.

Falk Hüffner, Nadja Betzler, Rolf Niedermeier

J. Comb. Optim., 2010

Topology-Free Querying of Protein Interaction Networks.

Sharon Bruckner, Falk Hüffner, Richard M. Karp, Ron Shamir, Roded Sharan

J. Comput. Biol., 2010

Selected Design Issues.

Sabine Helwig, Falk Hüffner, Ivo Rössling, Maik Weinard

Proceedings of the Algorithm Engineering: Bridging the Gap between Algorithm Theory and Practice [outcome of a Dagstuhl Seminar], 2010

2009

Isolation concepts for efficiently enumerating dense subgraphs.

Christian Komusiewicz, Falk Hüffner, Hannes Moser, Rolf Niedermeier

Theor. Comput. Sci., 2009

Isolation concepts for clique enumeration: Comparison and computational experiments.

Falk Hüffner, Christian Komusiewicz, Hannes Moser, Rolf Niedermeier

Theor. Comput. Sci., 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

Algorithm Engineering for Optimal Graph Bipartization.

Falk Hüffner

J. Graph Algorithms Appl., 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

A Faster Fixed-Parameter Approach to Drawing Binary Tanglegrams.

Sebastian Böcker, Falk Hüffner, Anke Truß, Magnus Wahlström

Proceedings of the Parameterized and Exact Computation, 4th International Workshop, 2009

2008

Automated Search Tree Generation.

Falk Hüffner

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Tiefensuche (Ariadne und Co.).

Michael Dom, Falk Hüffner, Rolf Niedermeier

Proceedings of the Taschenbuch der Algorithmen, 2008

Data reduction and exact algorithms for clique cover.

Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier

ACM J. Exp. Algorithmics, 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

Closest 4-leaf power is fixed-parameter tractable.

Michael Dom, Jiong Guo, Falk Hüffner, Rolf Niedermeier

Discret. Appl. Math., 2008

Techniques for Practical Fixed-Parameter Algorithms.

Falk Hüffner, Rolf Niedermeier, Sebastian Wernicke

Comput. J., 2008

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

Falk Hüffner, Sebastian Wernicke, Thomas Zichner

Algorithmica, 2008

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

Oriana Ponta, Falk Hüffner, Rolf Niedermeier

Proceedings of the Theory and Applications of Models of Computation, 2008

Improved Algorithms for Bicluster Editing.

Jiong Guo, Falk Hüffner, Christian Komusiewicz, Yong Zhang

Proceedings of the Theory and Applications of Models of Computation, 2008

Enumerating Isolated Cliques in Synthetic and Financial Networks.

Falk Hüffner, Christian Komusiewicz, Hannes Moser, Rolf Niedermeier

Proceedings of the Combinatorial Optimization and Applications, 2008

2007

Algorithms and experiments for parameterized approaches to hard graph problems.

Falk Hüffner

PhD thesis, 2007

Feedback arc set in bipartite tournaments is NP-complete.

Jiong Guo, Falk Hüffner, Hannes Moser

Inf. Process. Lett., 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

FASPAD: fast signaling pathway detection.

Falk Hüffner, Sebastian Wernicke, Thomas Zichner

Bioinform., 2007

Optimal Edge Deletions for Signed Graph Balancing.

Falk Hüffner, Nadja Betzler, Rolf Niedermeier

Proceedings of the Experimental Algorithms, 6th International Workshop, 2007

Parametrisierte Ansätze für schwere Graphprobleme: Algorithmen und Experimente [Algorithms and Experiments for Parameterized Approaches to Hard Graph Problems].

Falk Hüffner

Proceedings of the Ausgezeichnete Informatikdissertationen 2007, 2007

Isolation Concepts for Enumerating Dense Subgraphs.

Christian Komusiewicz, Falk Hüffner, Hannes Moser, Rolf Niedermeier

Proceedings of the Computing and Combinatorics, 13th Annual International Conference, 2007

Algorithm Engineering for Color-Coding to Facilitate Signaling Pathway Detection.

Falk Hüffner, Sebastian Wernicke, Thomas Zichner

Proceedings of 5th Asia-Pacific Bioinformatics Conference, 2007

2006

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

Jiong Guo, Jens Gramm, Falk Hüffner, Rolf Niedermeier, Sebastian Wernicke

J. Comput. Syst. Sci., 2006

Error Compensation in Leaf Power Problems.

Michael Dom, Jiong Guo, Falk Hüffner, Rolf Niedermeier

Algorithmica, 2006

Complexity and Exact Algorithms for Multicut.

Jiong Guo, Falk Hüffner, Erhan Kenar, Rolf Niedermeier, Johannes Uhlmann

Proceedings of the SOFSEM 2006: Theory and Practice of Computer Science, 2006

Data Reduction, Exact, and Heuristic Algorithms for Clique Cover.

Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier

Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments, 2006

Matrix Robustness, with an Application to Power System Observability.

Matthias Brosemann, Jochen Alber, Falk Hüffner, Rolf Niedermeier

Proceedings of the Algorithms and Complexity in Durham 2006, 2006

2005

Graph-Modeled Data Clustering: Exact Algorithms for Clique Generation.

Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier

Theory Comput. Syst., 2005

Extending the Tractability Border for Closest Leaf Powers.

Michael Dom, Jiong Guo, Falk Hüffner, Rolf Niedermeier

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2005

Improved Fixed-Parameter Algorithms for Two Feedback Set Problems.

Jiong Guo, Jens Gramm, Falk Hüffner, Rolf Niedermeier, Sebastian Wernicke

Proceedings of the Algorithms and Data Structures, 9th International Workshop, 2005

2004

Automated Generation of Search Tree Algorithms for Hard Graph Modification Problems.

Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier

Algorithmica, 2004

A Structural View on Parameterizing Problems: Distance from Triviality.

Jiong Guo, Falk Hüffner, Rolf Niedermeier

Proceedings of the Parameterized and Exact Computation, First International Workshop, 2004

Error Compensation in Leaf Root Problems.

Michael Dom, Jiong Guo, Falk Hüffner, Rolf Niedermeier

Proceedings of the Algorithms and Computation, 15th International Symposium, 2004

2003

Automated Generation of Search Tree Algorithms for Graph Modification Problems.

Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier

Proceedings of the Algorithms, 2003

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

Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier

Proceedings of the Algorithms and Complexity, 5th Italian Conference, 2003

2001

Finding Optimal Solutions to Atomix.

Falk Hüffner, Stefan Edelkamp, Henning Fernau, Rolf Niedermeier

Proceedings of the KI 2001: Advances in Artificial Intelligence, 2001