Pages that link to "Item:Q1607033"
From MaRDI portal
The following pages link to A general method to speed up fixed-parameter-tractable algorithms (Q1607033):
Displayed 21 items.
- Improved upper bounds for vertex cover (Q708228) (← links)
- Refined memorization for vertex cover (Q835007) (← links)
- An efficient fixed-parameter algorithm for 3-hitting set (Q876698) (← links)
- Fixed parameter algorithms for one-sided crossing minimization revisited (Q935846) (← links)
- Two fixed-parameter algorithms for vertex covering by paths on trees (Q963337) (← links)
- Fixed-parameter algorithms for cluster vertex deletion (Q987386) (← links)
- Efficiency in exponential time for domination-type problems (Q1003475) (← links)
- Fixed-parameter algorithms for Kemeny rankings (Q1035688) (← links)
- Going weighted: parameterized algorithms for cluster editing (Q1040589) (← links)
- Call control with \(k\) rejections (Q1877703) (← links)
- On the existence of subexponential parameterized algorithms (Q1877709) (← links)
- Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms (Q1877711) (← links)
- Improved exact algorithms for MAX-SAT (Q1878397) (← links)
- New fixed-parameter algorithms for the minimum quartet inconsistency problem (Q1959377) (← links)
- Applying modular decomposition to parameterized cluster editing problems (Q2272201) (← links)
- A refined search tree technique for dominating set on planar graphs (Q2575830) (← links)
- Parameterized computation and complexity: a new approach dealing with NP-hardness (Q2576825) (← links)
- On the (Non-)existence of Polynomial Kernels for P l -free Edge Modification Problems (Q3058699) (← links)
- New Fixed-Parameter Algorithms for the Minimum Quartet Inconsistency Problem (Q3503579) (← links)
- Problem Kernels for NP-Complete Edge Deletion Problems: Split and Related Graphs (Q5387826) (← links)
- Going Weighted: Parameterized Algorithms for Cluster Editing (Q5505638) (← links)