The following pages link to (Q5743513):
Displaying 15 items.
- Packing cycles through prescribed vertices under modularity constraints (Q444427) (← links)
- Kernels for deletion to classes of acyclic digraphs (Q1678165) (← links)
- An \(O(\log \mathrm{OPT})\)-approximation for covering and packing minor models of \(\theta _r\) (Q1751097) (← links)
- Computing Weighted Subset Odd Cycle transversals in \(H\)-free graphs (Q2136850) (← links)
- Half-integral packing of odd cycles through prescribed vertices (Q2259381) (← links)
- Parameterised algorithms for deletion to classes of DAGs (Q2322699) (← links)
- Backdoors to tractable answer set programming (Q2341833) (← links)
- Fixed-parameter tractability for subset feedback set problems with parity constraints (Q2344735) (← links)
- Towards a polynomial kernel for directed feedback vertex set (Q2663705) (← links)
- Linear Time Parameterized Algorithms for Subset Feedback Vertex Set (Q3448850) (← links)
- (Q5111250) (← links)
- Hitting Selected (Odd) Cycles (Q5348214) (← links)
- Computing subset transversals in \(H\)-free graphs (Q5918462) (← links)
- (Q6065419) (← links)
- Constant-factor approximation algorithms for parity-constrained facility location and \(k\)-center (Q6107886) (← links)
