Falk Hüffner

From MaRDI portal
Person:507586

Available identifiers

zbMath Open huffner.falkWikidataQ102343732 ScholiaQ102343732MaRDI QIDQ507586

List of research outcomes

PublicationDate of PublicationType
Data Reduction, Exact, and Heuristic Algorithms for Clique Cover2019-09-11Paper
https://portal.mardi4nfdi.de/entity/Q49671702019-07-03Paper
The parameterized complexity of the rainbow subgraph problem2019-03-26Paper
Parameterized complexity of team formation in social networks2018-03-13Paper
Fixed-parameter algorithms for DAG partitioning2017-02-06Paper
Parameterized Complexity of Team Formation in Social Networks2016-11-09Paper
Editing Graphs Into Few Cliques: Complexity, Approximation, and Kernelization Schemes2015-10-30Paper
The Parameterized Complexity of the Rainbow Subgraph Problem2015-09-09Paper
Approximability and parameterized complexity of multicover by \(c\)-intervals2015-06-15Paper
Finding Highly Connected Subgraphs2015-02-20Paper
Data reduction and exact algorithms for clique cover2014-04-01Paper
Confluence in Data Reduction: Bridging Graph Transformation and Kernelization2013-10-10Paper
Parameterized Complexity of DAG Partitioning2013-06-07Paper
Partitioning into Colorful Components by Minimum Edge Deletions2012-08-14Paper
Confluence in Data Reduction: Bridging Graph Transformation and Kernelization2012-08-14Paper
https://portal.mardi4nfdi.de/entity/Q31137172012-01-23Paper
Exploiting Bounded Signal Flow for Graph Orientation Based on Cause–Effect Pairs2011-05-12Paper
Separator-based data reduction for signed graph balancing2010-12-21Paper
Fixed-parameter algorithms for cluster vertex deletion2010-08-13Paper
Algorithms - ESA 20032010-03-03Paper
Fixed-parameter tractability results for feedback set problems in tournaments2010-02-26Paper
Feedback arc set in bipartite tournaments is NP-complete2010-01-29Paper
A Faster Fixed-Parameter Approach to Drawing Binary Tanglegrams2010-01-14Paper
Isolation concepts for clique enumeration: comparison and computational experiments2009-11-25Paper
Isolation concepts for efficiently enumerating dense subgraphs2009-09-10Paper
Algorithms for compact letter displays: comparison and evaluation2009-06-02Paper
Algorithm Engineering for Optimal Graph Bipartization2009-05-19Paper
Isolation Concepts for Enumerating Dense Subgraphs2009-03-06Paper
Closest 4-leaf power is fixed-parameter tractable2009-03-04Paper
https://portal.mardi4nfdi.de/entity/Q36009162009-02-06Paper
Enumerating Isolated Cliques in Synthetic and Financial Networks2009-01-27Paper
Algorithm engineering for color-coding with applications to signaling pathway detection2008-12-02Paper
Improved Algorithms for Bicluster Editing2008-05-27Paper
Speeding up Dynamic Programming for Some NP-Hard Graph Recoloring Problems2008-05-27Paper
Fixed-Parameter Algorithms for Cluster Vertex Deletion2008-04-15Paper
Optimal Edge Deletions for Signed Graph Balancing2008-01-02Paper
Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs2007-11-23Paper
Fixed-Parameter Tractability Results for Feedback Set Problems in Tournaments2007-05-02Paper
Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization2006-12-07Paper
SOFSEM 2006: Theory and Practice of Computer Science2006-11-14Paper
Graph-Theoretic Concepts in Computer Science2006-11-01Paper
Algorithms and Data Structures2006-10-25Paper
Error compensation in leaf power problems2006-08-16Paper
Graph-modeled data clustering: Exact algorithms for clique generation2006-02-08Paper
Algorithms and Computation2005-12-22Paper
Experimental and Efficient Algorithms2005-11-30Paper
Parameterized and Exact Computation2005-08-23Paper
Automated generation of search tree algorithms for hard graphs modification problems2004-10-01Paper
https://portal.mardi4nfdi.de/entity/Q44375012003-12-02Paper
https://portal.mardi4nfdi.de/entity/Q47974302003-03-13Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Falk Hüffner