Pages that link to "Item:Q5363792"
From MaRDI portal
The following pages link to Fast biclustering by dual parameterization (Q5363792):
Displaying 8 items.
- Even better fixed-parameter algorithms for bicluster editing (Q2019506) (← links)
- A simple and improved parameterized algorithm for bicluster editing (Q2059879) (← links)
- Subexponential algorithm for \(d\)-cluster edge deletion: exception or rule? (Q2186825) (← links)
- Parameterized low-rank binary matrix approximation (Q2218414) (← links)
- Complexity of modification problems for reciprocal best match graphs (Q2290642) (← links)
- Faster parameterized algorithm for \textsc{Bicluster Editing} (Q2656354) (← links)
- Faster parameterized algorithms for \textsc{Bicluster Editing} and \textsc{Flip Consensus Tree} (Q2693636) (← links)
- A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)
