|
Search the dblp DataBase
Falk Hüffner:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Matthias Brosemann, Jochen Alber, Falk Hüffner, Rolf Niedermeier
Matrix Robustness, with an Application to Power System Observability. [Citation Graph (0, 0)][DBLP] ACiD, 2006, pp:37-48 [Conf]
- Falk Hüffner, Sebastian Wernicke, Thomas Zichner
Algorithm Engineering for Color-Coding to Facilitate Signaling Pathway Detection. [Citation Graph (0, 0)][DBLP] APBC, 2007, pp:277-286 [Conf]
- Michael Dom, Jiong Guo, Falk Hüffner, Rolf Niedermeier, Anke Truß
Fixed-Parameter Tractability Results for Feedback Set Problems in Tournaments. [Citation Graph (0, 0)][DBLP] CIAC, 2006, pp:320-331 [Conf]
- Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier
Graph-Modeled Data Clustering: Fixed-Parameter Algorithms for Clique Generation. [Citation Graph (0, 0)][DBLP] CIAC, 2003, pp:108-119 [Conf]
- Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier
Automated Generation of Search Tree Algorithms for Graph Modification Problems. [Citation Graph (0, 0)][DBLP] ESA, 2003, pp:642-653 [Conf]
- Michael Dom, Jiong Guo, Falk Hüffner, Rolf Niedermeier
Error Compensation in Leaf Root Problems. [Citation Graph (0, 0)][DBLP] ISAAC, 2004, pp:389-401 [Conf]
- Jiong Guo, Falk Hüffner, Rolf Niedermeier
A Structural View on Parameterizing Problems: Distance from Triviality. [Citation Graph (0, 0)][DBLP] IWPEC, 2004, pp:162-173 [Conf]
- Falk Hüffner, Stefan Edelkamp, Henning Fernau, Rolf Niedermeier
Finding Optimal Solutions to Atomix. [Citation Graph (0, 0)][DBLP] KI/ÖGAI, 2001, pp:229-243 [Conf]
- Jiong Guo, Falk Hüffner, Erhan Kenar, Rolf Niedermeier, Johannes Uhlmann
Complexity and Exact Algorithms for Multicut. [Citation Graph (0, 0)][DBLP] SOFSEM, 2006, pp:303-312 [Conf]
- Jiong Guo, Jens Gramm, Falk Hüffner, Rolf Niedermeier, Sebastian Wernicke
Improved Fixed-Parameter Algorithms for Two Feedback Set Problems. [Citation Graph (0, 0)][DBLP] WADS, 2005, pp:158-168 [Conf]
- Falk Hüffner
Algorithm Engineering for Optimal Graph Bipartization. [Citation Graph (0, 0)][DBLP] WEA, 2005, pp:240-252 [Conf]
- Michael Dom, Jiong Guo, Falk Hüffner, Rolf Niedermeier
Extending the Tractability Border for Closest Leaf Powers. [Citation Graph (0, 0)][DBLP] WG, 2005, pp:397-408 [Conf]
- Michael Dom, Jiong Guo, Falk Hüffner, Rolf Niedermeier
Error Compensation in Leaf Power Problems. [Citation Graph (0, 0)][DBLP] Algorithmica, 2006, v:44, n:4, pp:363-381 [Journal]
- Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier
Automated Generation of Search Tree Algorithms for Hard Graph Modification Problems. [Citation Graph (0, 0)][DBLP] Algorithmica, 2004, v:39, n:4, pp:321-347 [Journal]
- Jiong Guo, Falk Hüffner, Hannes Moser
Feedback arc set in bipartite tournaments is NP-complete. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2007, v:102, n:2-3, pp:62-65 [Journal]
- Jiong Guo, Jens Gramm, Falk Hüffner, Rolf Niedermeier, Sebastian Wernicke
Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization. [Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2006, v:72, n:8, pp:1386-1396 [Journal]
- Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier
Graph-Modeled Data Clustering: Exact Algorithms for Clique Generation. [Citation Graph (0, 0)][DBLP] Theory Comput. Syst., 2005, v:38, n:4, pp:373-392 [Journal]
- Christian Komusiewicz, Falk Hüffner, Hannes Moser, Rolf Niedermeier
Isolation Concepts for Enumerating Dense Subgraphs. [Citation Graph (0, 0)][DBLP] COCOON, 2007, pp:140-150 [Conf]
- Falk Hüffner, Nadja Betzler, Rolf Niedermeier
Optimal Edge Deletions for Signed Graph Balancing. [Citation Graph (0, 0)][DBLP] WEA, 2007, pp:297-310 [Conf]
Selected Design Issues. [Citation Graph (, )][DBLP]
A Faster Fixed-Parameter Approach to Drawing Binary Tanglegrams. [Citation Graph (, )][DBLP]
Fixed-Parameter Algorithms for Cluster Vertex Deletion. [Citation Graph (, )][DBLP]
Topology-Free Querying of Protein Interaction Networks. [Citation Graph (, )][DBLP]
Improved Algorithms for Bicluster Editing. [Citation Graph (, )][DBLP]
Speeding up Dynamic Programming for Some NP-Hard Graph Recoloring Problems. [Citation Graph (, )][DBLP]
Enumerating Isolated Cliques in Synthetic and Financial Networks. [Citation Graph (, )][DBLP]
Algorithm Engineering for Color-Coding with Applications to Signaling Pathway Detection. [Citation Graph (, )][DBLP]
FASPAD: fast signaling pathway detection. [Citation Graph (, )][DBLP]
Techniques for Practical Fixed-Parameter Algorithms. [Citation Graph (, )][DBLP]
Closest 4-leaf power is fixed-parameter tractable. [Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.003secs
|