Pages that link to "Item:Q5458573"
From MaRDI portal
The following pages link to Fixed-Parameter Algorithms for Cluster Vertex Deletion (Q5458573):
Displaying 11 items.
- Separator-based data reduction for signed graph balancing (Q613659) (← links)
- Fixed-parameter enumerability of cluster editing and related problems (Q970105) (← links)
- Faster parameterized algorithm for cluster vertex deletion (Q2035480) (← links)
- Fixed-parameter tractability results for feedback set problems in tournaments (Q2266940) (← links)
- Iterative compression and exact algorithms (Q2268862) (← links)
- Improved Algorithms for Bicluster Editing (Q3502668) (← links)
- Kernelization through Tidying (Q3557047) (← links)
- Iterative Compression and Exact Algorithms (Q3599139) (← links)
- Iterative Compression for Exactly Solving NP-Hard Minimization Problems (Q3637312) (← links)
- Bounded-Degree Techniques Accelerate Some Parameterized Graph Algorithms (Q3656854) (← links)
- Pareto Complexity of Two-Parameter FPT Problems: A Case Study for Partial Vertex Cover (Q3656855) (← links)
