Pages that link to "Item:Q3012824"

The following pages link to Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization (Q3012824):

Displaying 13 items.

• Vertex cover kernelization revisited. Upper and lower bounds for a refined parameter (Q372970) (← links)
• Preprocessing subgraph and minor problems: when does a small vertex cover help? (Q386050) (← links)
• On cutwidth parameterized by vertex cover (Q476444) (← links)
• Kernelization hardness of connectivity problems in \(d\)-degenerate graphs (Q713308) (← links)
• On the hardness of losing width (Q2441542) (← links)
• On Polynomial Kernels for Structural Parameterizations of Odd Cycle Transversal (Q2891343) (← links)
• On the Hardness of Losing Width (Q2891345) (← links)
• On Cutwidth Parameterized by Vertex Cover (Q2891354) (← links)
• Kernelization – Preprocessing with a Guarantee (Q2908537) (← links)
• Fixed-Parameter Tractability of Treewidth and Pathwidth (Q2908539) (← links)
• Dual parameterization and parameterized approximability of subset graph problems (Q2969972) (← links)
• Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization (Q3012824) (← links)
• New Limits to Classical and Quantum Instance Compression (Q3449566) (← links)