Pages that link to "Item:Q3499745"
From MaRDI portal
The following pages link to The Lost Continent of Polynomial Time: Preprocessing and Kernelization (Q3499745):
Displaying 18 items.
- A \(2k\) kernel for the cluster editing problem (Q414871) (← links)
- Guarantees and limits of preprocessing in constraint satisfaction and reasoning (Q460604) (← links)
- An improved kernel size for rotation distance in binary trees (Q763531) (← links)
- Meta-kernelization with structural parameters (Q896025) (← links)
- Rotation distance is fixed-parameter tractable (Q989526) (← links)
- A more effective linear kernelization for cluster editing (Q1006044) (← links)
- The parameterized complexity of the induced matching problem (Q1028465) (← links)
- A simple and improved parameterized algorithm for bicluster editing (Q2059879) (← links)
- Color spanning objects: algorithms and hardness results (Q2181240) (← links)
- Clustering with partial information (Q2268879) (← links)
- A complete parameterized complexity analysis of bounded planning (Q2353405) (← links)
- A cubic-vertex kernel for flip consensus tree (Q2441594) (← links)
- A linear kernel for the complementary maximal strip recovery problem (Q2453554) (← links)
- Preprocessing to reduce the search space: antler structures for feedback vertex set (Q2672419) (← links)
- Kernelization – Preprocessing with a Guarantee (Q2908537) (← links)
- Clustering with Partial Information (Q3599122) (← links)
- Parameterized Analysis of Art Gallery and Terrain Guarding (Q5042224) (← links)
- Cluster Editing (Q5326357) (← links)
