default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFalk Hüffner
Person information
- affiliation: University of Jena, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[c35]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:
A Strategic Routing Framework and Algorithms for Computing Alternative Paths. ATMOS 2020: 10:1-10:14- [i3]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:
A Strategic Routing Framework and Algorithms for Computing Alternative Paths. CoRR abs/2008.10316 (2020)
2010 – 2019
- 2018
- [j31]Guillaume Fertin, Falk Hüffner, Christian Komusiewicz, Manuel Sorge:
Matching algorithms for assigning orthologs after genome duplication events. Comput. Biol. Chem. 74: 379-390 (2018) - [j30]Robert Bredereck, Jiehua Chen, Falk Hüffner, Stefan Kratsch:
Parameterized complexity of team formation in social networks. Theor. Comput. Sci. 717: 26-36 (2018) - 2017
- [j29]René van Bevern, Robert Bredereck, Morgan Chopin, Sepp Hartung, Falk Hüffner, André Nichterlein, Ondrej Suchý:
Fixed-parameter algorithms for DAG Partitioning. Discret. Appl. Math. 220: 134-160 (2017) - 2016
- [c34]Robert Bredereck, Jiehua Chen, Falk Hüffner, Stefan Kratsch:
Parameterized Complexity of Team Formation in Social Networks. AAIM 2016: 137-149 - [r2]Falk Hüffner:
Automated Search Tree Generation. Encyclopedia of Algorithms 2016: 162-165 - [i2]René van Bevern, Robert Bredereck, Morgan Chopin, Sepp Hartung, Falk Hüffner, André Nichterlein, Ondrej Suchý:
Fixed-Parameter Algorithms for DAG Partitioning. CoRR abs/1611.08809 (2016) - 2015
- [j28]Falk Hüffner, Christian Komusiewicz, Rolf Niedermeier, Martin Rötzschke:
The Parameterized Complexity of the Rainbow Subgraph Problem. Algorithms 8(1): 60-81 (2015) - [j27]Sharon Bruckner, Falk Hüffner, Christian Komusiewicz:
A graph modification approach for finding core-periphery structures in protein interaction networks. Algorithms Mol. Biol. 10: 16 (2015) - [j26]René van Bevern, Jiehua Chen, Falk Hüffner, Stefan Kratsch, Nimrod Talmon, Gerhard J. Woeginger:
Approximability and parameterized complexity of multicover by c-intervals. Inf. Process. Lett. 115(10): 744-749 (2015) - [c33]Falk Hüffner, Christian Komusiewicz, Manuel Sorge:
Finding Highly Connected Subgraphs. SOFSEM 2015: 254-265 - [c32]Falk Hüffner, Christian Komusiewicz, André Nichterlein:
Editing Graphs Into Few Cliques: Complexity, Approximation, and Kernelization Schemes. WADS 2015: 410-421 - 2014
- [j25]Laurent Bulteau, Falk Hüffner, Christian Komusiewicz, Rolf Niedermeier:
Multivariate Algorithmics for NP-Hard String Problems. Bull. EATCS 114 (2014) - [j24]Falk Hüffner, Christian Komusiewicz, Adrian Liebtrau, Rolf Niedermeier:
Partitioning Biological Networks into Highly Connected Clusters with Maximum Edge Coverage. IEEE ACM Trans. Comput. Biol. Bioinform. 11(3): 455-467 (2014) - [c31]Sharon Bruckner, Falk Hüffner, Christian Komusiewicz:
A Graph Modification Approach for Finding Core-Periphery Structures in Protein Interaction Networks. WABI 2014: 340-351 - [c30]Falk Hüffner, Christian Komusiewicz, Rolf Niedermeier, Martin Rötzschke:
The Parameterized Complexity of the Rainbow Subgraph Problem. WG 2014: 287-298 - 2013
- [j23]Hartmut Ehrig, Claudia Ermel, Falk Hüffner, Rolf Niedermeier, Olga Runge:
Confluence in Data Reduction: Bridging Graph Transformation and Kernelization. Comput. 2(1): 31-49 (2013) - [c29]René van Bevern, Robert Bredereck, Morgan Chopin, Sepp Hartung, Falk Hüffner, André Nichterlein, Ondrej Suchý:
Parameterized Complexity of DAG Partitioning. CIAC 2013: 49-60 - [c28]Falk Hüffner, Christian Komusiewicz, Adrian Liebtrau, Rolf Niedermeier:
Partitioning Biological Networks into Highly Connected Clusters with Maximum Edge Coverage. ISBRA 2013: 99-111 - [c27]Sharon Bruckner, Falk Hüffner, Christian Komusiewicz, Rolf Niedermeier:
Evaluation of ILP-Based Approaches for Partitioning into Colorful Components. SEA 2013: 176-187 - 2012
- [c26]Hartmut Ehrig, Claudia Ermel, Falk Hüffner, Rolf Niedermeier, Olga Runge:
Confluence in Data Reduction: Bridging Graph Transformation and Kernelization. CiE 2012: 193-202 - [c25]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 - 2011
- [j22]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 Mol. Biol. 6: 21 (2011) - [c24]Antonios Antoniadis, Falk Hüffner, Pascal Lenzner, Carsten Moldenhauer, Alexander Souza:
Balanced Interval Coloring. STACS 2011: 531-542 - [c23]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 - [p3]Michael Dom, Falk Hüffner, Rolf Niedermeier:
Depth-First Search (Ariadne & Co.). Algorithms Unplugged 2011: 57-68 - 2010
- [j21]Sharon Bruckner, Falk Hüffner, Richard M. Karp, Ron Shamir, Roded Sharan:
Topology-Free Querying of Protein Interaction Networks. J. Comput. Biol. 17(3): 237-252 (2010) - [j20]Falk Hüffner, Nadja Betzler, Rolf Niedermeier:
Separator-based data reduction for signed graph balancing. J. Comb. Optim. 20(4): 335-360 (2010) - [j19]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) - [j18]Falk Hüffner, Christian Komusiewicz, Hannes Moser, Rolf Niedermeier:
Fixed-Parameter Algorithms for Cluster Vertex Deletion. Theory Comput. Syst. 47(1): 196-217 (2010) - [c22]Sabine Helwig, Falk Hüffner, Ivo Rössling, Maik Weinard:
Selected Design Issues. Algorithm Engineering 2010: 58-126 - [i1]Antonios Antoniadis, Falk Hüffner, Pascal Lenzner, Carsten Moldenhauer, Alexander Souza:
Balanced Interval Coloring. CoRR abs/1012.3932 (2010)
2000 – 2009
- 2009
- [j17]Falk Hüffner:
Parametrisierte Ansätze für schwere Graphprobleme: Algorithmen und Experimente (Algorithms and Experiments for Parameterized Approaches to Hard Graph Problems). it Inf. Technol. 51(3): 171-174 (2009) - [j16]Falk Hüffner:
Algorithm Engineering for Optimal Graph Bipartization. J. Graph Algorithms Appl. 13(2): 77-98 (2009) - [j15]Sharon Bruckner, Falk Hüffner, Richard M. Karp, Ron Shamir, Roded Sharan:
Torque: topology-free querying of protein interaction networks. Nucleic Acids Res. 37(Web-Server-Issue): 106-108 (2009) - [j14]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) - [j13]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) - [c21]Sebastian Böcker, Falk Hüffner, Anke Truß, Magnus Wahlström:
A Faster Fixed-Parameter Approach to Drawing Binary Tanglegrams. IWPEC 2009: 38-49 - [c20]Sharon Bruckner, Falk Hüffner, Richard M. Karp, Ron Shamir, Roded Sharan:
Topology-Free Querying of Protein Interaction Networks. RECOMB 2009: 74-89 - 2008
- [j12]Falk Hüffner, Sebastian Wernicke, Thomas Zichner:
Algorithm Engineering for Color-Coding with Applications to Signaling Pathway Detection. Algorithmica 52(2): 114-132 (2008) - [j11]Falk Hüffner, Rolf Niedermeier, Sebastian Wernicke:
Techniques for Practical Fixed-Parameter Algorithms. Comput. J. 51(1): 7-25 (2008) - [j10]Michael Dom, Jiong Guo, Falk Hüffner, Rolf Niedermeier:
Closest 4-leaf power is fixed-parameter tractable. Discret. Appl. Math. 156(18): 3345-3361 (2008) - [j9]Jiong Guo, Falk Hüffner, Erhan Kenar, Rolf Niedermeier, Johannes Uhlmann:
Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs. Eur. J. Oper. Res. 186(2): 542-553 (2008) - [j8]Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier:
Data reduction and exact algorithms for clique cover. ACM J. Exp. Algorithmics 13 (2008) - [c19]Falk Hüffner, Christian Komusiewicz, Hannes Moser, Rolf Niedermeier:
Enumerating Isolated Cliques in Synthetic and Financial Networks. COCOA 2008: 405-416 - [c18]Falk Hüffner, Christian Komusiewicz, Hannes Moser, Rolf Niedermeier:
Fixed-Parameter Algorithms for Cluster Vertex Deletion. LATIN 2008: 711-722 - [c17]Jiong Guo, Falk Hüffner, Christian Komusiewicz, Yong Zhang:
Improved Algorithms for Bicluster Editing. TAMC 2008: 445-456 - [c16]Oriana Ponta, Falk Hüffner, Rolf Niedermeier:
Speeding up Dynamic Programming for Some NP-Hard Graph Recoloring Problems. TAMC 2008: 490-501 - [p2]Michael Dom, Falk Hüffner, Rolf Niedermeier:
Tiefensuche (Ariadne und Co.). Taschenbuch der Algorithmen 2008: 61-73 - [r1]Falk Hüffner:
Automated Search Tree Generation. Encyclopedia of Algorithms 2008 - 2007
- [b1]Falk Hüffner:
Algorithms and experiments for parameterized approaches to hard graph problems. University of Jena, Germany, 2007, pp. 1-170 - [j7]Falk Hüffner, Sebastian Wernicke, Thomas Zichner:
FASPAD: fast signaling pathway detection. Bioinform. 23(13): 1708-1709 (2007) - [j6]Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier, Hans-Peter Piepho, Ramona Schmid:
Algorithms for compact letter displays: Comparison and evaluation. Comput. Stat. Data Anal. 52(2): 725-736 (2007) - [j5]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) - [c15]Falk Hüffner, Sebastian Wernicke, Thomas Zichner:
Algorithm Engineering for Color-Coding to Facilitate Signaling Pathway Detection. APBC 2007: 277-286 - [c14]Christian Komusiewicz, Falk Hüffner, Hannes Moser, Rolf Niedermeier:
Isolation Concepts for Enumerating Dense Subgraphs. COCOON 2007: 140-150 - [c13]Falk Hüffner, Nadja Betzler, Rolf Niedermeier:
Optimal Edge Deletions for Signed Graph Balancing. WEA 2007: 297-310 - [p1]Falk Hüffner:
Parametrisierte Ansätze für schwere Graphprobleme: Algorithmen und Experimente [Algorithms and Experiments for Parameterized Approaches to Hard Graph Problems]. Ausgezeichnete Informatikdissertationen 2007: 151-160 - 2006
- [j4]Michael Dom, Jiong Guo, Falk Hüffner, Rolf Niedermeier:
Error Compensation in Leaf Power Problems. Algorithmica 44(4): 363-381 (2006) - [j3]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) - [c12]Matthias Brosemann, Jochen Alber, Falk Hüffner, Rolf Niedermeier:
Matrix Robustness, with an Application to Power System Observability. ACiD 2006: 37-48 - [c11]Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier:
Data Reduction, Exact, and Heuristic Algorithms for Clique Cover. ALENEX 2006: 86-94 - [c10]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 - [c9]Jiong Guo, Falk Hüffner, Erhan Kenar, Rolf Niedermeier, Johannes Uhlmann:
Complexity and Exact Algorithms for Multicut. SOFSEM 2006: 303-312 - 2005
- [j2]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) - [c8]Jiong Guo, Jens Gramm, Falk Hüffner, Rolf Niedermeier, Sebastian Wernicke:
Improved Fixed-Parameter Algorithms for Two Feedback Set Problems. WADS 2005: 158-168 - [c7]Falk Hüffner:
Algorithm Engineering for Optimal Graph Bipartization. WEA 2005: 240-252 - [c6]Michael Dom, Jiong Guo, Falk Hüffner, Rolf Niedermeier:
Extending the Tractability Border for Closest Leaf Powers. WG 2005: 397-408 - 2004
- [j1]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) - [c5]Michael Dom, Jiong Guo, Falk Hüffner, Rolf Niedermeier:
Error Compensation in Leaf Root Problems. ISAAC 2004: 389-401 - [c4]Jiong Guo, Falk Hüffner, Rolf Niedermeier:
A Structural View on Parameterizing Problems: Distance from Triviality. IWPEC 2004: 162-173 - 2003
- [c3]Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier:
Graph-Modeled Data Clustering: Fixed-Parameter Algorithms for Clique Generation. CIAC 2003: 108-119 - [c2]Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier:
Automated Generation of Search Tree Algorithms for Graph Modification Problems. ESA 2003: 642-653 - 2001
- [c1]Falk Hüffner, Stefan Edelkamp, Henning Fernau, Rolf Niedermeier:
Finding Optimal Solutions to Atomix. KI/ÖGAI 2001: 229-243
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-05 23:38 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
