Folgen
Falk Hüffner
Falk Hüffner
TomTom
Bestätigte E-Mail-Adresse bei tomtom.com - Startseite
Titel
Zitiert von
Zitiert von
Jahr
Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization
J Guo, J Gramm, F Hüffner, R Niedermeier, S Wernicke
Journal of Computer and System Sciences 72 (8), 1386-1396, 2006
259*2006
Graph-modeled data clustering: Exact algorithms for clique generation
J Gramm, J Guo, F Hüffner, R Niedermeier
Theory of Computing Systems 38, 373-392, 2005
233*2005
Data reduction and exact algorithms for clique cover
J Gramm, J Guo, F Hüffner, R Niedermeier
Journal of Experimental Algorithmics (JEA) 13, 2.2-2.15, 2009
206*2009
Fixed-parameter algorithms for cluster vertex deletion
F Hüffner, C Komusiewicz, H Moser, R Niedermeier
Theory of Computing Systems 47 (1), 196-217, 2010
1622010
Automated generation of search tree algorithms for hard graph modification problems
J Gramm, J Guo, F Hüffner, R Niedermeier
Algorithmica 39, 321-347, 2004
1572004
A structural view on parameterizing problems: Distance from triviality
J Guo, F Hüffner, R Niedermeier
Parameterized and Exact Computation: First International Workshop, IWPEC …, 2004
1572004
Fixed-parameter tractability results for feedback set problems in tournaments
M Dom, J Guo, F Hüffner, R Niedermeier, A Truss
Journal of Discrete Algorithms 8 (1), 76-86, 2010
136*2010
Topology-free querying of protein interaction networks
S Bruckner, F Hüffner, RM Karp, R Shamir, R Sharan
Journal of computational biology 17 (3), 237-252, 2010
1222010
Algorithm engineering for color-coding with applications to signaling pathway detection
F Hüffner, S Wernicke, T Zichner
Algorithmica 52, 114-132, 2008
116*2008
Separator-based data reduction for signed graph balancing
F Hüffner, N Betzler, R Niedermeier
Journal of combinatorial optimization 20, 335-360, 2010
106*2010
Algorithm engineering for optimal graph bipartization.
F Hüffner
Journal of Graph Algorithms and Applications 13 (2), 77-98, 2009
101*2009
Isolation concepts for efficiently enumerating dense subgraphs
C Komusiewicz, F Hüffner, H Moser, R Niedermeier
Theoretical Computer Science 410 (38-40), 3640-3654, 2009
81*2009
Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs
J Guo, F Hüffner, E Kenar, R Niedermeier, J Uhlmann
European Journal of Operational Research 186 (2), 542-553, 2008
74*2008
Techniques for practical fixed-parameter algorithms
F Hüffner, R Niedermeier, S Wernicke
The Computer Journal 51 (1), 7-25, 2008
662008
Error compensation in leaf power problems
M Dom, J Guo, F Hüffner, R Niedermeier
Algorithmica 44 (4), 363-381, 2006
66*2006
Improved algorithms for bicluster editing
J Guo, F Hüffner, C Komusiewicz, Y Zhang
Theory and Applications of Models of Computation: 5th International …, 2008
542008
Algorithms for compact letter displays: Comparison and evaluation
J Gramm, J Guo, F Hüffner, R Niedermeier, HP Piepho, R Schmid
Computational Statistics & Data Analysis 52 (2), 725-736, 2007
542007
Multivariate algorithmics for NP-hard string problems
L Bulteau, F Hüffner, C Komusiewicz, R Niedermeier
Bulletin-European Association for Theoretical Computer Science 114, 2014
492014
Torque: topology-free querying of protein interaction networks
S Bruckner, F Hüffner, RM Karp, R Shamir, R Sharan
Nucleic acids research 37 (suppl_2), W106-W108, 2009
462009
Feedback arc set in bipartite tournaments is NP-complete
J Guo, F Hüffner, H Moser
Information processing letters 102 (2-3), 62-65, 2007
452007
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20