Pages that link to "Item:Q676315"
From MaRDI portal
The following pages link to Advice classes of parametrized tractability (Q676315):
Displaying 35 items.
- Win-win kernelization for degree sequence completion problems (Q295647) (← links)
- Schulze and ranked-pairs voting are fixed-parameter tractable to bribe, manipulate, and control (Q314421) (← links)
- Incremental list coloring of graphs, parameterized by conservation (Q391091) (← links)
- Parameterized complexity of critical node cuts (Q517024) (← links)
- Infeasibility of instance compression and succinct PCPs for NP (Q619903) (← links)
- The complexity of degree anonymization by vertex addition (Q897957) (← links)
- On problems without polynomial kernels (Q1034099) (← links)
- A general method to speed up fixed-parameter-tractable algorithms (Q1607033) (← links)
- Corrigendum to: ``Advice classes of parameterized tractability'' (Q1706270) (← links)
- On the parametric complexity of schedules to minimize tardy tasks. (Q1874274) (← links)
- Describing parameterized complexity classes (Q1877556) (← links)
- Fixed-parameter tractability and completeness. IV: On completeness for W\([\) P\(]\) and PSPACE analogues (Q1892937) (← links)
- Computing hitting set kernels by \(\mathrm{AC}^0\)-circuits (Q1987509) (← links)
- Approximation in (Poly-) logarithmic space (Q2037114) (← links)
- Parameterized analysis and crossing minimization problems (Q2172859) (← links)
- On the space and circuit complexity of parameterized problems: classes and completeness (Q2343093) (← links)
- The parameterized space complexity of embedding along a path (Q2408562) (← links)
- Kernels in planar digraphs (Q2485283) (← links)
- A parametric analysis of the state-explosion problem in model checking (Q2495399) (← links)
- Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover (Q2576350) (← links)
- The Birth and Early Years of Parameterized Complexity (Q2908529) (← links)
- Studies in Computational Aspects of Voting (Q2908543) (← links)
- A Shortcut to (Sun)Flowers: Kernels in Logarithmic Space or Linear Time (Q2946401) (← links)
- Surfing with Rod (Q2973715) (← links)
- Computing Hitting Set Kernels By AC^0-Circuits (Q3304103) (← links)
- New Limits to Classical and Quantum Instance Compression (Q3449566) (← links)
- Kernelization: New Upper and Lower Bound Techniques (Q3656848) (← links)
- Finding Points in General Position (Q4605338) (← links)
- Fractals for Kernelization Lower Bounds (Q4609787) (← links)
- (Q5009475) (← links)
- Approximation in (Poly-) Logarithmic Space (Q5089177) (← links)
- (Q5743381) (← links)
- Faster Existential FO Model Checking on Posets (Q5892117) (← links)
- On the parallel parameterized complexity of MaxSAT variants (Q6535422) (← links)
- Space-efficient graph kernelizations (Q6636090) (← links)
