The following pages link to (Q3455036):
Displaying 16 items.
- Approximating the \textsc{Sparsest} \(k\)-\textsc{Subgraph} in chordal graphs (Q260267) (← links)
- Blocking optimal arborescences (Q507342) (← links)
- Blocking unions of arborescences (Q1751195) (← links)
- Blocking optimal structures (Q1752656) (← links)
- The complexity of mixed-connectivity (Q2070706) (← links)
- The maximum vertex coverage problem on bipartite graphs (Q2448919) (← links)
- Computing densest \(k\)-subgraph with structural parameters (Q2680362) (← links)
- Interdicting Structured Combinatorial Optimization Problems with {0, 1}-Objectives (Q2976146) (← links)
- Decreasing the Displacement Rank of a Matrix (Q4033820) (← links)
- Covering Vectors by Spaces: Regular Matroids (Q4555045) (← links)
- Symmetric interdiction for matching problems (Q5002612) (← links)
- Parameterized Algorithms for Partial Vertex Covers in Bipartite Graphs (Q5041208) (← links)
- On the fixed-parameter tractability of the partial vertex cover problem with a matching constraint in edge-weighted bipartite graphs (Q5084707) (← links)
- Partial Vertex Cover and Budgeted Maximum Coverage in Bipartite Graphs (Q5361234) (← links)
- Parametric matroid interdiction (Q6122085) (← links)
- On the partial vertex cover problem in bipartite graphs -- a parameterized perspective (Q6151150) (← links)
