Falk Hüffner

TomTom (Germany) — Germany

Computer Science · Physical Sciences

28h-index2.3kcitations80works0.02yr avg
OpenAlex↗ORCID↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Advanced Graph Theory Research(43), Complexity and Algorithms in Graphs(33), Algorithms and Data Compression(14), Bioinformatics and Genomic Networks(9), DNA and Biological Computing(7)

Publications80 total

Driver Expectations toward Strategic Routing
Transportation Research Record Journal of the Transportation Research Board·2021· 9 citedOpen Access
A Strategic Routing Framework and Algorithms for Computing Alternative Paths
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2020· 2 citedOpen Access
Matching algorithms for assigning orthologs after genome duplication events
Computational Biology and Chemistry·2018
Parameterized complexity of team formation in social networks
Theoretical Computer Science·2017· 5 cited
Fixed-parameter algorithms for DAG Partitioning
Discrete Applied Mathematics·2017· 6 citedOpen Access
Parameterized Algorithmics for Finding Exact Solutions of NP-Hard Biological Problems
Methods in molecular biology·2016· 2 cited
Parameterized Complexity of Team Formation in Social Networks
Lecture notes in computer science·2016· 3 cited
Automated Search Tree Generation
Encyclopedia of Algorithms·2016
A graph modification approach for finding core–periphery structures in protein interaction networks
Algorithms for Molecular Biology·2015· 30 citedOpen Access
Approximability and parameterized complexity of multicover by c-intervals
Information Processing Letters·2015· 5 cited
The Parameterized Complexity of the Rainbow Subgraph Problem
Algorithms·2015· 2 citedOpen Access
Editing Graphs Into Few Cliques: Complexity, Approximation, and Kernelization Schemes
Lecture notes in computer science·2015· 3 cited
Finding Highly Connected Subgraphs
Lecture notes in computer science·2015· 17 cited
Partitioning Biological Networks into Highly Connected Clusters with Maximum Edge Coverage
IEEE/ACM Transactions on Computational Biology and Bioinformatics·2014· 22 cited
A Graph Modification Approach for Finding Core–Periphery Structures in Protein Interaction Networks
Lecture notes in computer science·2014· 2 cited
The Parameterized Complexity of the Rainbow Subgraph Problem
Lecture notes in computer science·2014
Multivariate Algorithmics for NP-Hard String Problems
2014· 35 citedOpen Access
Confluence in Data Reduction: Bridging Graph Transformation and Kernelization
Computability·2013· 1 cited
Evaluation of ILP-Based Approaches for Partitioning into Colorful Components
Lecture notes in computer science·2013· 20 cited
Partitioning Biological Networks into Highly Connected Clusters with Maximum Edge Coverage
Lecture notes in computer science·2013· 5 cited
page 1 of 4Next →

Frequent Co-authors

Rolf Niedermeier(36), Jiong Guo(19), Christian Komusiewicz(13), Jens Gramm(9), Sebastian Wernicke(7), Hannes Moser(7), Michael Dom(6), Johannes Uhlmann(5), Anke Truß(3), Thomas Zichner(3), Sharon Bruckner(3), Nadja Betzler(2), Erhan Kenar(2), Britta Dorn(2), Dominikus Krüger(2), Hans‐Peter Piepho(1), Ramona Schmid(1), Stefan Brückner(1), Richard M. Karp(1), Ron Shamir(1)