Pages that link to "Item:Q5236288"
From MaRDI portal
The following pages link to Losing Treewidth by Separating Subsets (Q5236288):
Displaying 18 items.
- On bounded-degree vertex deletion parameterized by treewidth (Q765338) (← links)
- Preprocessing for outerplanar vertex deletion: an elementary kernel of quartic size (Q2093579) (← links)
- Towards constant-factor approximation for chordal/distance-hereditary vertex deletion (Q2149107) (← links)
- On the feedback number of 3-uniform linear extremal hypergraphs (Q2150590) (← links)
- Approximation algorithm for minimum weight connected-\(k\)-subgraph cover (Q2197543) (← links)
- (Q5009491) (← links)
- (Q5075776) (← links)
- (Q5091010) (← links)
- (Q5091191) (← links)
- Separating layered treewidth and row treewidth (Q6045398) (← links)
- (Q6065472) (← links)
- Kernelization for feedback vertex set via elimination distance to a forest (Q6153475) (← links)
- On maximum bipartite matching with separation (Q6161448) (← links)
- Justifying groups in multiwinner approval voting (Q6165554) (← links)
- \(k\)-median/means with outliers revisited: a simple fpt approximation (Q6591646) (← links)
- Search-space reduction via essential vertices (Q6606914) (← links)
- Approximation algorithm and FPT algorithm for connected-\(k\)-subgraph cover on minor-free graphs (Q6620013) (← links)
- A constant-factor approximation for weighted bond cover (Q6671673) (← links)