The following pages link to (Q4414505):
Displaying 26 items.
- Approximate tree decompositions of planar graphs in linear time (Q306256) (← links)
- Approximate min-max relations on plane graphs (Q358640) (← links)
- A note on disjoint cycles (Q413261) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- On the parameterized complexity of computing balanced partitions in graphs (Q493645) (← links)
- A linear kernel for planar red-blue dominating set (Q516887) (← links)
- Planar feedback vertex set and face cover: combinatorial bounds and subexponential algorithms (Q547307) (← links)
- Kernel bounds for disjoint cycles and disjoint paths (Q638521) (← links)
- Linearity of grid minors in treewidth with applications through bidimensionality (Q949776) (← links)
- Algorithmic graph minor theory: Improved grid minor bounds and Wagner's contraction (Q1022348) (← links)
- An \(O(\log \mathrm{OPT})\)-approximation for covering and packing minor models of \(\theta _r\) (Q1751097) (← links)
- The decycling number of outerplanar graphs (Q1956257) (← links)
- Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions (Q1957653) (← links)
- Jones' conjecture in subcubic graphs (Q2236806) (← links)
- A linear-time kernelization for the rooted \(k\)-leaf outbranching problem (Q2354724) (← links)
- On line graphs of subcubic triangle-free graphs (Q2400553) (← links)
- Recent techniques and results on the Erdős-Pósa property (Q2403789) (← links)
- Improved bottleneck domination algorithms (Q2499580) (← links)
- The role of planarity in connectivity problems parameterized by treewidth (Q2514121) (← links)
- Simpler Linear-Time Kernelization for Planar Dominating Set (Q2891347) (← links)
- Deterministic Algorithms for the Independent Feedback Vertex Set Problem (Q2946071) (← links)
- A Linear Kernel for Planar Feedback Vertex Set (Q3503587) (← links)
- (Q4972036) (← links)
- Planar Feedback Vertex Set and Face Cover: Combinatorial Bounds and Subexponential Algorithms (Q5302061) (← links)
- (Q5743430) (← links)
- Approximability of the independent feedback vertex set problem for bipartite graphs (Q5919046) (← links)
