Pages that link to "Item:Q2908537"
From MaRDI portal
The following pages link to Kernelization – Preprocessing with a Guarantee (Q2908537):
Displayed 20 items.
- Linear-vertex kernel for the problem of packing \(r\)-stars into a graph without long induced paths (Q264204) (← links)
- On polynomial kernels for sparse integer linear programs (Q269481) (← links)
- Polynomial kernels and user reductions for the workflow satisfiability problem (Q309799) (← links)
- Algorithms and kernels for \textsc{Feedback Set} problems in generalizations of tournaments (Q329279) (← links)
- The parameterized complexity of local search for TSP, more refined (Q378245) (← links)
- A \(9k\) kernel for nonseparating independent set in planar graphs (Q385964) (← links)
- Guarantees and limits of preprocessing in constraint satisfaction and reasoning (Q460604) (← links)
- Exploiting a hypergraph model for finding Golomb rulers (Q471187) (← links)
- On making a distinguished vertex of minimum degree by vertex deletion (Q528861) (← links)
- Meta-kernelization with structural parameters (Q896025) (← links)
- Kernelization complexity of possible winner and coalitional manipulation problems in voting (Q906403) (← links)
- Using patterns to form homogeneous teams (Q2346970) (← links)
- Towards optimal kernel for edge-disjoint triangle packing (Q2446590) (← links)
- FPT is characterized by useful obstruction sets (Q2828222) (← links)
- A Basic Parameterized Complexity Primer (Q2908536) (← links)
- What’s Next? Future Directions in Parameterized Complexity (Q2908548) (← links)
- Clique Cover and Graph Separation (Q2943572) (← links)
- A Structural Approach to Kernels for ILPs: Treewidth and Total Unimodularity (Q3452840) (← links)
- 3-Hitting set on bounded degree hypergraphs: Upper and lower bounds on the kernel size (Q5261045) (← links)
- Tree Deletion Set Has a Polynomial Kernel but No $\text{OPT}^\mathcal{O}(1)$ Approximation) (Q5741082) (← links)