Pages that link to "Item:Q2636505"
From MaRDI portal
The following pages link to Parameterized algorithms for edge biclique and related problems (Q2636505):
Displaying 5 items.
- An improved kernel for max-bisection above tight lower bound (Q1985605) (← links)
- An approximation algorithm for the \(l\)-pseudoforest deletion problem (Q2285146) (← links)
- Improved PTAS for the constrained \(k\)-means problem (Q2424715) (← links)
- (Q6065417) (← links)
- Computing dense and sparse subgraphs of weakly closed graphs (Q6107896) (← links)