The following pages link to (Q5743380):
Displaying 8 items.
- Preprocessing subgraph and minor problems: when does a small vertex cover help? (Q386050) (← links)
- A completeness theory for polynomial (Turing) kernelization (Q2343083) (← links)
- Parameterized complexity of satisfying almost all linear equations over \(\mathbb F_2\) (Q2392244) (← links)
- A faster FPT algorithm for bipartite contraction (Q2445333) (← links)
- Deterministic Truncation of Linear Matroids (Q3448849) (← links)
- New Limits to Classical and Quantum Instance Compression (Q3449566) (← links)
- A Compression Algorithm for Probability Transition Matrices (Q4243493) (← links)
- Compression via Matroids (Q4962154) (← links)
