The following pages link to Nondeterminism within $P^ * $ (Q4202212):
Displaying 50 items.
- An improved fixed-parameter algorithm for vertex cover (Q293227) (← links)
- Vertex cover kernelization revisited. Upper and lower bounds for a refined parameter (Q372970) (← links)
- Multicut in trees viewed through the eyes of vertex cover (Q440014) (← links)
- Lower bounds on kernelization (Q456702) (← links)
- Guarantees and limits of preprocessing in constraint satisfaction and reasoning (Q460604) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- Parameterized complexity of coloring problems: treewidth versus vertex cover (Q534566) (← links)
- On quasilinear-time complexity theory (Q672330) (← links)
- Fixed-parameter tractability and completeness II: On completeness for W[1] (Q673779) (← links)
- Advice classes of parametrized tractability (Q676315) (← links)
- Improved upper bounds for vertex cover (Q708228) (← links)
- Kernelization hardness of connectivity problems in \(d\)-degenerate graphs (Q713308) (← links)
- Parameterized reductions and algorithms for a graph editing problem that generalizes vertex cover (Q714786) (← links)
- Parameterized enumeration, transversals, and imperfect phylogeny reconstruction (Q820146) (← links)
- Compactors for parameterized counting problems (Q826317) (← links)
- Multistage graph problems on a global budget (Q831134) (← links)
- Refined memorization for vertex cover (Q835007) (← links)
- Efficient algorithms for counting parameterized list \(H\)-colorings (Q931733) (← links)
- A problem reduction based approach to discrete optimization algorithm design (Q975314) (← links)
- The parameterized complexity of editing graphs for bounded degeneracy (Q986553) (← links)
- A kernelization algorithm for \(d\)-hitting set (Q988567) (← links)
- Linear kernelizations for restricted 3-Hitting Set problems (Q989471) (← links)
- On parameterized exponential time complexity (Q1029333) (← links)
- On the complexity of database queries (Q1307689) (← links)
- On fixed-parameter tractability and approximability of NP optimization problems (Q1362338) (← links)
- On directed covering and domination problems (Q1735678) (← links)
- Extended formulations for vertex cover (Q1790198) (← links)
- The inapproximability of non-NP-hard optimization problems. (Q1853546) (← links)
- Solving large FPT problems on coarse-grained parallel machines (Q1877701) (← links)
- On the existence of subexponential parameterized algorithms (Q1877709) (← links)
- Fixed-parameter tractability and completeness. IV: On completeness for W\([\) P\(]\) and PSPACE analogues (Q1892937) (← links)
- Approximation in (Poly-) logarithmic space (Q2037114) (← links)
- Sliding window temporal graph coloring (Q2037193) (← links)
- Dynamic kernels for hitting sets and set packing (Q2093581) (← links)
- Parameterized complexity of finding subgraphs with hereditary properties on hereditary graph classes (Q2140500) (← links)
- Component order connectivity in directed graphs (Q2165039) (← links)
- Parameterized analysis and crossing minimization problems (Q2172859) (← links)
- Refined notions of parameterized enumeration kernels with applications to matching cut enumeration (Q2237892) (← links)
- On width measures and topological problems on semi-complete digraphs (Q2312615) (← links)
- A completeness theory for polynomial (Turing) kernelization (Q2343083) (← links)
- On sparsification for computing treewidth (Q2343087) (← links)
- On the space and circuit complexity of parameterized problems: classes and completeness (Q2343093) (← links)
- A multivariate framework for weighted FPT algorithms (Q2402359) (← links)
- Crown reductions for the minimum weighted vertex cover problem (Q2473030) (← links)
- Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover (Q2576350) (← links)
- Diversity of solutions: an exploration through the lens of fixed-parameter tractability theory (Q2667823) (← links)
- Safe Approximation and Its Relation to Kernelization (Q2891346) (← links)
- The Impact of Parameterized Complexity to Interdisciplinary Problem Solving (Q2908532) (← links)
- Maximum Minimal Vertex Cover Parameterized by Vertex Cover (Q2946427) (← links)
- Kernelization: New Upper and Lower Bound Techniques (Q3656848) (← links)
