Pages that link to "Item:Q2041981"
From MaRDI portal
The following pages link to Improved analysis of highest-degree branching for feedback vertex set (Q2041981):
Displaying 9 items.
- A parameterized complexity view on collapsing \(k\)-cores (Q825978) (← links)
- An improved deterministic parameterized algorithm for cactus vertex deletion (Q2135634) (← links)
- The structural complexity landscape of finding balance-fair shortest paths (Q2676473) (← links)
- Parameterized Complexity of Fair Feedback Vertex Set Problem (Q5042245) (← links)
- A parameterized algorithm for subset feedback vertex set in tournaments (Q6076355) (← links)
- Exact algorithms for restricted subset feedback vertex set in chordal and split graphs (Q6140360) (← links)
- Kernelization for feedback vertex set via elimination distance to a forest (Q6153475) (← links)
- Improved FPT Algorithms for Deletion to Forest-Like Structures (Q6492092) (← links)
- Preprocessing to reduce the search space: antler structures for feedback vertex set (Q6564613) (← links)
