Članki z zahtevami za javni dostop - Falk HüffnerVeč o tem
Na voljo nekje: 33
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
Zahteve: German Research Foundation
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
Zahteve: German Research Foundation
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
Zahteve: German Research Foundation
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
Zahteve: German Research Foundation
Algorithm engineering for color-coding with applications to signaling pathway detection
F Hüffner, S Wernicke, T Zichner
Algorithmica 52, 114-132, 2008
Zahteve: German Research Foundation
Separator-based data reduction for signed graph balancing
F Hüffner, N Betzler, R Niedermeier
Journal of combinatorial optimization 20, 335-360, 2010
Zahteve: German Research Foundation
Algorithm engineering for optimal graph bipartization.
F Hüffner
Journal of Graph Algorithms and Applications 13 (2), 77-98, 2009
Zahteve: German Research Foundation
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
Zahteve: German Research Foundation
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
Zahteve: German Research Foundation
Error compensation in leaf power problems
M Dom, J Guo, F Hüffner, R Niedermeier
Algorithmica 44 (4), 363-381, 2006
Zahteve: German Research Foundation
Techniques for practical fixed-parameter algorithms
F Hüffner, R Niedermeier, S Wernicke
The Computer Journal 51 (1), 7-25, 2008
Zahteve: German Research Foundation
Improved algorithms for bicluster editing
J Guo, F Hüffner, C Komusiewicz, Y Zhang
Theory and Applications of Models of Computation: 5th International …, 2008
Zahteve: German Research Foundation
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
Zahteve: German Research Foundation
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
Zahteve: German Research Foundation
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
Zahteve: German Research Foundation
Partitioning biological networks into highly connected clusters with maximum edge coverage
F Hüffner, C Komusiewicz, A Liebtrau, R Niedermeier
IEEE/ACM transactions on computational biology and bioinformatics 11 (3 …, 2013
Zahteve: German Research Foundation
Isolation concepts for clique enumeration: Comparison and computational experiments
F Hüffner, C Komusiewicz, H Moser, R Niedermeier
Theoretical computer science 410 (52), 5384-5397, 2009
Zahteve: German Research Foundation
Finding highly connected subgraphs
F Hüffner, C Komusiewicz, M Sorge
SOFSEM 2015: Theory and Practice of Computer Science: 41st International …, 2015
Zahteve: German Research Foundation
Speeding up dynamic programming for some NP-hard graph recoloring problems
O Ponta, F Hüffner, R Niedermeier
Theory and Applications of Models of Computation: 5th International …, 2008
Zahteve: German Research Foundation
Faspad: fast signaling pathway detection
F Hüffner, S Wernicke, T Zichner
Bioinformatics 23 (13), 1708-1709, 2007
Zahteve: German Research Foundation
Podatke o objavi in financiranju samodejno določi računalniški program