Pages that link to "Item:Q2502279"
From MaRDI portal
The following pages link to Scalable parallel algorithms for FPT problems (Q2502279):
Displaying 13 items.
- Lower bounds on paraclique density (Q266841) (← links)
- Parallel FETI algorithms for mortars (Q557948) (← links)
- Vertex cover problem parameterized above and below tight bounds (Q633768) (← links)
- SCIP-Jack -- a solver for STP and variants with parallelization extensions (Q1699618) (← links)
- Multivariate algorithmics for finding cohesive subnetworks (Q1736776) (← links)
- Computing hitting set kernels by \(\mathrm{AC}^0\)-circuits (Q1987509) (← links)
- Efficient parallel algorithms for parameterized problems (Q2319897) (← links)
- A Basic Parameterized Complexity Primer (Q2908536) (← links)
- Scalable Parallel DFPN Search (Q2947916) (← links)
- (Q3028097) (← links)
- Computing Hitting Set Kernels By AC^0-Circuits (Q3304103) (← links)
- Fixed-Parameter Algorithms in Analysis of Heuristics for Extracting Networks in Linear Programs (Q3656864) (← links)
- A SCALABLE PARALLEL ALGORITHM FOR TURNPIKE PROBLEM (Q5217228) (← links)
