The following pages link to Falk Hüffner (Q507586):
Displaying 50 items.
- Fixed-parameter algorithms for DAG partitioning (Q507587) (← links)
- Separator-based data reduction for signed graph balancing (Q613659) (← links)
- Graph-modeled data clustering: Exact algorithms for clique generation (Q814914) (← links)
- Isolation concepts for efficiently enumerating dense subgraphs (Q837155) (← links)
- Feedback arc set in bipartite tournaments is NP-complete (Q845963) (← links)
- Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization (Q856420) (← links)
- Algorithm engineering for color-coding with applications to signaling pathway detection (Q958201) (← links)
- Fixed-parameter algorithms for cluster vertex deletion (Q987386) (← links)
- Closest 4-leaf power is fixed-parameter tractable (Q1003724) (← links)
- Algorithms for compact letter displays: comparison and evaluation (Q1020871) (← links)
- Isolation concepts for clique enumeration: comparison and computational experiments (Q1040581) (← links)
- Parameterized complexity of team formation in social networks (Q1704854) (← links)
- The parameterized complexity of the rainbow subgraph problem (Q1736640) (← links)
- Automated generation of search tree algorithms for hard graphs modification problems (Q1882409) (← links)
- Fixed-parameter tractability results for feedback set problems in tournaments (Q2266940) (← links)
- Approximability and parameterized complexity of multicover by \(c\)-intervals (Q2348702) (← links)
- Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs (Q2462149) (← links)
- Error compensation in leaf power problems (Q2498407) (← links)
- Parameterized Complexity of Team Formation in Social Networks (Q2830065) (← links)
- Partitioning into Colorful Components by Minimum Edge Deletions (Q2904478) (← links)
- The Parameterized Complexity of the Rainbow Subgraph Problem (Q2945198) (← links)
- Exploiting Bounded Signal Flow for Graph Orientation Based on Cause–Effect Pairs (Q2999338) (← links)
- (Q3113717) (← links)
- Fixed-Parameter Tractability Results for Feedback Set Problems in Tournaments (Q3434567) (← links)
- Editing Graphs Into Few Cliques: Complexity, Approximation, and Kernelization Schemes (Q3449838) (← links)
- Improved Algorithms for Bicluster Editing (Q3502668) (← links)
- Speeding up Dynamic Programming for Some NP-Hard Graph Recoloring Problems (Q3502673) (← links)
- (Q3600916) (← links)
- Isolation Concepts for Enumerating Dense Subgraphs (Q3608840) (← links)
- Algorithm Engineering for Optimal Graph Bipartization (Q3627967) (← links)
- A Faster Fixed-Parameter Approach to Drawing Binary Tanglegrams (Q3656849) (← links)
- (Q4437501) (← links)
- (Q4797430) (← links)
- Parameterized Complexity of DAG Partitioning (Q4924637) (← links)
- (Q4967170) (← links)
- Finding Highly Connected Subgraphs (Q5175112) (← links)
- Data Reduction, Exact, and Heuristic Algorithms for Clique Cover (Q5233468) (← links)
- Parameterized and Exact Computation (Q5311509) (← links)
- Algorithms and Data Structures (Q5394246) (← links)
- Data reduction and exact algorithms for clique cover (Q5406188) (← links)
- Optimal Edge Deletions for Signed Graph Balancing (Q5432322) (← links)
- Fixed-Parameter Algorithms for Cluster Vertex Deletion (Q5458573) (← links)
- Enumerating Isolated Cliques in Synthetic and Financial Networks (Q5505678) (← links)
- Experimental and Efficient Algorithms (Q5710023) (← links)
- Algorithms and Computation (Q5712129) (← links)
- Confluence in Data Reduction: Bridging Graph Transformation and Kernelization (Q5891215) (← links)
- Confluence in Data Reduction: Bridging Graph Transformation and Kernelization (Q5891701) (← links)
- Algorithms - ESA 2003 (Q5897283) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5897573) (← links)
- SOFSEM 2006: Theory and Practice of Computer Science (Q5897992) (← links)
