The following pages link to Computing and Combinatorics (Q5717009):
Displaying 16 items.
- Tractability in constraint satisfaction problems: a survey (Q271997) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- FPT algorithms for connected feedback vertex set (Q695322) (← links)
- Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization (Q856420) (← links)
- Improved algorithms for feedback vertex set problems (Q955350) (← links)
- On the minimum feedback vertex set problem: Exact and enumeration algorithms (Q958216) (← links)
- A cubic kernel for feedback vertex set and loop cutset (Q968273) (← links)
- Mim-width. II. The feedback vertex set problem (Q2285053) (← links)
- An improved exact algorithm for undirected feedback vertex set (Q2355979) (← links)
- An improved parameterized algorithm for the independent feedback vertex set problem (Q2447761) (← links)
- An Improved Exact Algorithm for Undirected Feedback Vertex Set (Q2867116) (← links)
- FPT Suspects and Tough Customers: Open Problems of Downey and Fellows (Q2908547) (← links)
- Subset Feedback Vertex Set Is Fixed-Parameter Tractable (Q3012825) (← links)
- (Q3304141) (← links)
- A Linear Kernel for Planar Feedback Vertex Set (Q3503587) (← links)
- Iterative Compression and Exact Algorithms (Q3599139) (← links)
