Parameterized Algorithms for Maximum Edge Biclique and Related Problems (Q4632171): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-319-39817-4_8
+Normal rank
@@ Property / OpenAlex ID @@
+W2505071075
@@ Property / OpenAlex ID: W2505071075 / rank @@
+Normal rank
@@ Property / cites work @@
+Solving the maximum edge biclique packing problem on unbalanced bipartite graphs
+Normal rank
@@ Property / cites work @@
+On problems without polynomial kernels
@@ Property / cites work: On problems without polynomial kernels / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating Clique and Biclique Problems
@@ Property / cites work: Approximating Clique and Biclique Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Learning Theory and Kernel Machines
@@ Property / cites work: Learning Theory and Kernel Machines / rank @@
+Normal rank
@@ Property / cites work @@
+The maximum edge biclique problem is NP-complete
@@ Property / cites work: The maximum edge biclique problem is NP-complete / rank @@
+Normal rank
@@ Property / cites work @@
+Managing Broader Product Lines through Delayed Differentiation Using Vanilla Boxes
+Normal rank
@@ Property / cites work @@
+Inapproximability of Maximum Weighted Edge Biclique and Its Applications
+Normal rank
@@ Property / cites work @@
+Algorithmic and complexity issues of three clustering methods in microarray data analysis
+Normal rank