Pages that link to "Item:Q1877701"
From MaRDI portal
The following pages link to Solving large FPT problems on coarse-grained parallel machines (Q1877701):
Displaying 16 items.
- On the approximability of the link building problem (Q391785) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- Vertex cover problem parameterized above and below tight bounds (Q633768) (← links)
- Improved upper bounds for vertex cover (Q708228) (← links)
- Strong computational lower bounds via parameterized complexity (Q856413) (← links)
- Linear kernelizations for restricted 3-Hitting Set problems (Q989471) (← links)
- Approximation for vertex cover in \(\beta\)-conflict graphs (Q1679502) (← links)
- Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs (Q1764807) (← links)
- Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms (Q1877711) (← links)
- Towards optimal kernel for edge-disjoint triangle packing (Q2446590) (← links)
- Properties of vertex cover obstructions (Q2455575) (← links)
- Tight lower bounds for certain parameterized NP-hard problems (Q2568440) (← links)
- Parameterized computation and complexity: a new approach dealing with NP-hardness (Q2576825) (← links)
- Parameterized Complexity (Q2841253) (← links)
- The Impact of Parameterized Complexity to Interdisciplinary Problem Solving (Q2908532) (← links)
- A Basic Parameterized Complexity Primer (Q2908536) (← links)
