Falk Hüffner

According to our database1, Falk Hüffner authored at least 61 papers between 2001 and 2018.

Collaborative distances:



In proceedings 
PhD thesis 



On csauthors.net:


Parameterized complexity of team formation in social networks.
Theor. Comput. Sci., 2018

Matching algorithms for assigning orthologs after genome duplication events.
Computational Biology and Chemistry, 2018

Fixed-parameter algorithms for DAG Partitioning.
Discret. Appl. Math., 2017

Automated Search Tree Generation.
Encyclopedia of Algorithms, 2016

Approximability and parameterized complexity of multicover by c-intervals.
Inf. Process. Lett., 2015

A graph modification approach for finding core-periphery structures in protein interaction networks.
Algorithms for Molecular Biology, 2015

The Parameterized Complexity of the Rainbow Subgraph Problem.
Algorithms, 2015

Editing Graphs Into Few Cliques: Complexity, Approximation, and Kernelization Schemes.
Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

Finding Highly Connected Subgraphs.
Proceedings of the SOFSEM 2015: Theory and Practice of Computer Science, 2015

Partitioning Biological Networks into Highly Connected Clusters with Maximum Edge Coverage.
IEEE/ACM Trans. Comput. Biology Bioinform., 2014

Multivariate Algorithmics for NP-Hard String Problems.
Bulletin of the EATCS, 2014

Confluence in Data Reduction: Bridging Graph Transformation and Kernelization.
Computability, 2013

Evaluation of ILP-Based Approaches for Partitioning into Colorful Components.
Proceedings of the Experimental Algorithms, 12th International Symposium, 2013

Parameterized Complexity of DAG Partitioning.
Proceedings of the Algorithms and Complexity, 8th International Conference, 2013

Partitioning into Colorful Components by Minimum Edge Deletions.
Proceedings of the Combinatorial Pattern Matching - 23rd Annual Symposium, 2012

Exploiting bounded signal flow for graph orientation based on cause-effect pairs.
Algorithms for Molecular Biology, 2011

Balanced Interval Coloring.
Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science, 2011

Depth-First Search (Ariadne & Co.).
Proceedings of the Algorithms Unplugged, 2011

Fixed-Parameter Algorithms for Cluster Vertex Deletion.
Theory Comput. Syst., 2010

Fixed-parameter tractability results for feedback set problems in tournaments.
J. Discrete Algorithms, 2010

Separator-based data reduction for signed graph balancing.
J. Comb. Optim., 2010

Topology-Free Querying of Protein Interaction Networks.
Journal of Computational Biology, 2010

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

Isolation concepts for efficiently enumerating dense subgraphs.
Theor. Comput. Sci., 2009

Isolation concepts for clique enumeration: Comparison and computational experiments.
Theor. Comput. Sci., 2009

Torque: topology-free querying of protein interaction networks.
Nucleic Acids Research, 2009

Algorithm Engineering for Optimal Graph Bipartization.
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).
it - Information Technology, 2009

A Faster Fixed-Parameter Approach to Drawing Binary Tanglegrams.
Proceedings of the Parameterized and Exact Computation, 4th International Workshop, 2009

Automated Search Tree Generation.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Tiefensuche (Ariadne und Co.).
Proceedings of the Taschenbuch der Algorithmen, 2008

Data reduction and exact algorithms for clique cover.
ACM Journal of Experimental Algorithmics, 2008

Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs.
European Journal of Operational Research, 2008

Closest 4-leaf power is fixed-parameter tractable.
Discret. Appl. Math., 2008

Techniques for Practical Fixed-Parameter Algorithms.
Comput. J., 2008

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

Speeding up Dynamic Programming for Some NP-Hard Graph Recoloring Problems.
Proceedings of the Theory and Applications of Models of Computation, 2008

Improved Algorithms for Bicluster Editing.
Proceedings of the Theory and Applications of Models of Computation, 2008

Enumerating Isolated Cliques in Synthetic and Financial Networks.
Proceedings of the Combinatorial Optimization and Applications, 2008

Algorithms and experiments for parameterized approaches to hard graph problems.
PhD thesis, 2007

Feedback arc set in bipartite tournaments is NP-complete.
Inf. Process. Lett., 2007

Algorithms for compact letter displays: Comparison and evaluation.
Comput. Stat. Data Anal., 2007

FASPAD: fast signaling pathway detection.
Bioinformatics, 2007

Optimal Edge Deletions for Signed Graph Balancing.
Proceedings of the Experimental Algorithms, 6th International Workshop, 2007

Algorithms and Experiments for Parameterized Approaches to Hard Graph Problems.
Proceedings of the Ausgezeichnete Informatikdissertationen 2007, 2007

Isolation Concepts for Enumerating Dense Subgraphs.
Proceedings of the Computing and Combinatorics, 13th Annual International Conference, 2007

Algorithm Engineering for Color-Coding to Facilitate Signaling Pathway Detection.
Proceedings of 5th Asia-Pacific Bioinformatics Conference, 2007

Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization.
J. Comput. Syst. Sci., 2006

Error Compensation in Leaf Power Problems.
Algorithmica, 2006

Complexity and Exact Algorithms for Multicut.
Proceedings of the SOFSEM 2006: Theory and Practice of Computer Science, 2006

Data Reduction, Exact, and Heuristic Algorithms for Clique Cover.
Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments, 2006

Matrix Robustness, with an Application to Power System Observability.
Proceedings of the Algorithms and Complexity in Durham 2006, 2006

Graph-Modeled Data Clustering: Exact Algorithms for Clique Generation.
Theory Comput. Syst., 2005

Extending the Tractability Border for Closest Leaf Powers.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2005

Improved Fixed-Parameter Algorithms for Two Feedback Set Problems.
Proceedings of the Algorithms and Data Structures, 9th International Workshop, 2005

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

A Structural View on Parameterizing Problems: Distance from Triviality.
Proceedings of the Parameterized and Exact Computation, First International Workshop, 2004

Error Compensation in Leaf Root Problems.
Proceedings of the Algorithms and Computation, 15th International Symposium, 2004

Automated Generation of Search Tree Algorithms for Graph Modification Problems.
Proceedings of the Algorithms, 2003

Graph-Modeled Data Clustering: Fixed-Parameter Algorithms for Clique Generation.
Proceedings of the Algorithms and Complexity, 5th Italian Conference, 2003

Finding Optimal Solutions to Atomix.
Proceedings of the KI 2001: Advances in Artificial Intelligence, 2001