Pages that link to "Item:Q4625655"
From MaRDI portal
The following pages link to The Parameterized Complexity of the <i>k</i> -Biclique Problem (Q4625655):
Displaying 13 items.
- Hardness and tractability of the \(\gamma\)\textsf{-Complete Subgraph} problem (Q2032141) (← links)
- Parameterized counting of partially injective homomorphisms (Q2032353) (← links)
- On closest pair in Euclidean metric: monochromatic is as hard as bichromatic (Q2221003) (← links)
- Parameterized Dynamic Variants of Red-Blue Dominating Set (Q3297772) (← links)
- A Simple Gap-Producing Reduction for the Parameterized Set Cover Problem (Q5091240) (← links)
- Finding small satisfying assignments faster than brute force: a fine-grained perspective into boolean constraint satisfaction (Q5092478) (← links)
- Quasipolynomiality of the Smallest Missing Induced Subgraph (Q6051910) (← links)
- (Q6065417) (← links)
- Computing dense and sparse subgraphs of weakly closed graphs (Q6107896) (← links)
- Parameterized Counting and Cayley Graph Expanders (Q6158357) (← links)
- The parameterized complexity of welfare guarantees in Schelling segregation (Q6614026) (← links)
- Minimum separator reconfiguration (Q6615312) (← links)
- Parameterized inapproximability of the minimum distance problem over all fields and the shortest vector problem in all \(\ell_{p}\) norms (Q6621748) (← links)
