The following pages link to Losing Weight by Gaining Edges (Q2921387):
Displaying 13 items.
- An iterative method for linear decomposition of index generating functions (Q2325307) (← links)
- Tennis manipulation: can we help Serena Williams win another tournament? Or can we control a knockout tournament with reasonable complexity? (Q2363601) (← links)
- If the Current Clique Algorithms Are Optimal, so Is Valiant's Parser (Q4562283) (← links)
- Matching Triangles and Basing Hardness on an Extremely Popular Conjecture (Q4571929) (← links)
- (Q4993281) (← links)
- Fine-Grained Reductions and Quantum Speedups for Dynamic Programming. (Q5091156) (← links)
- A Simple Gap-Producing Reduction for the Parameterized Set Cover Problem (Q5091240) (← links)
- On Multidimensional and Monotone k-SUM (Q5111265) (← links)
- On the parameterized intractability of determinant maximization (Q6547207) (← links)
- Counting vanishing matrix-vector products (Q6575406) (← links)
- Parameterized problems complete for nondeterministic FPT time and logarithmic space (Q6614886) (← links)
- Counting vanishing matrix-vector products (Q6639735) (← links)
- Serial batching to minimize the weighted number of tardy jobs (Q6657883) (← links)
