Mod/Resc parsimony inference: theory and application (Q418168): Difference between revisions

@@ Property / cites work @@
+Q4393480
@@ Property / cites work: Q4393480 / rank @@
+Normal rank
@@ Property / cites work @@
+Covering graphs with few complete bipartite subgraphs
+Normal rank
@@ Property / cites work @@
+Parametrized complexity theory.
@@ Property / cites work: Parametrized complexity theory. / rank @@
+Normal rank
@@ Property / cites work @@
+Data reduction and exact algorithms for clique cover
+Normal rank
@@ Property / cites work @@
+Q3758977
@@ Property / cites work: Q3758977 / rank @@
+Normal rank
@@ Property / cites work @@
+Inapproximability of Nondeterministic State and Transition Complexity Assuming P ≠ NP
+Normal rank
@@ Property / cites work @@
+On covering graphs by complete bipartite subgraphs
+Normal rank
@@ Property / cites work @@
+Q3682546
@@ Property / cites work: Q3682546 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5710169
@@ Property / cites work: Q5710169 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4152571
@@ Property / cites work: Q4152571 / rank @@
+Normal rank
@@ Property / cites work @@
+Bicliques in graphs. I: Bounds on their number
@@ Property / cites work: Bicliques in graphs. I: Bounds on their number / rank @@
+Normal rank
@@ Property / cites work @@
+A New Algorithm for Generating All the Maximal Independent Sets
+Normal rank