Pages that link to "Item:Q3195132"
From MaRDI portal
The following pages link to Explicit Linear Kernels via Dynamic Programming (Q3195132):
Displaying 13 items.
- A linear kernel for planar red-blue dominating set (Q516887) (← links)
- Editing to a planar graph of given degrees (Q730508) (← links)
- Explicit linear kernels for packing problems (Q1739112) (← links)
- Lower bounds for protrusion replacement by counting equivalence classes (Q2174552) (← links)
- How much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs? (Q2324243) (← links)
- Changes in dense linear algebra kernels: decades-long perspective (Q2848246) (← links)
- Bidimensionality and Kernels (Q3387764) (← links)
- A Retrospective on (Meta) Kernelization (Q5042460) (← links)
- (Q5111863) (← links)
- How much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs (Q5111869) (← links)
- Hitting Minors on Bounded Treewidth Graphs. I. General Upper Bounds (Q5130572) (← links)
- (Q5468299) (← links)
- Hitting Minors on Bounded Treewidth Graphs. IV. An Optimal Algorithm (Q6115414) (← links)