Pages that link to "Item:Q5428824"
From MaRDI portal
The following pages link to Linear Problem Kernels for NP-Hard Problems on Planar Graphs (Q5428824):
Displaying 39 items.
- A \(13k\)-kernel for planar feedback vertex set via region decomposition (Q306250) (← links)
- Kernelization of edge perfect code and its variants (Q317422) (← links)
- Kernelization using structural parameters on sparse graph classes (Q340583) (← links)
- Planar graph vertex partition for linear problem kernels (Q355502) (← links)
- A \(9k\) kernel for nonseparating independent set in planar graphs (Q385964) (← links)
- Improved linear problem kernel for planar connected dominating set (Q392013) (← links)
- Kernelization for cycle transversal problems (Q423937) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs (Q477653) (← links)
- A linear kernel for planar red-blue dominating set (Q516887) (← links)
- A linear kernel for a planar connected dominating set (Q534569) (← links)
- On the small cycle transversal of planar graphs (Q551170) (← links)
- The parameterized complexity of the induced matching problem (Q1028465) (← links)
- On problems without polynomial kernels (Q1034099) (← links)
- Explicit linear kernels for packing problems (Q1739112) (← links)
- Towards optimal kernel for connected vertex cover in planar graphs (Q1949125) (← links)
- New kernels for several problems on planar graphs (Q2285156) (← links)
- Capacitated domination: problem complexity and approximation algorithms (Q2345937) (← links)
- Towards optimal kernel for edge-disjoint triangle packing (Q2446590) (← links)
- Edge-disjoint packing of stars and cycles (Q2629232) (← links)
- A systematic study on meta-heuristic approaches for solving the graph coloring problem (Q2664279) (← links)
- An improved kernel for planar vertex-disjoint triangle packing (Q2672577) (← links)
- Simpler Linear-Time Kernelization for Planar Dominating Set (Q2891347) (← links)
- Linear-Time Computation of a Linear Problem Kernel for Dominating Set on Planar Graphs (Q2891348) (← links)
- An Improved Kernel for Planar Connected Dominating Set (Q3010387) (← links)
- On the Small Cycle Transversal of Planar Graphs (Q3057617) (← links)
- Edge-Disjoint Packing of Stars and Cycles (Q3467879) (← links)
- Capacitated Domination and Covering: A Parameterized Perspective (Q3503580) (← links)
- The Planar k-Means Problem is NP-Hard (Q3605504) (← links)
- Kernelization: New Upper and Lower Bound Techniques (Q3656848) (← links)
- Planar Capacitated Dominating Set Is W[1]-Hard (Q3656850) (← links)
- Linear Vertex-kernels for Several Dense Ranking r -Constraint Satisfaction Problems (Q4922137) (← links)
- (Q4972036) (← links)
- A Retrospective on (Meta) Kernelization (Q5042460) (← links)
- (Q5363775) (← links)
- Perfect domination and small cycles (Q5367522) (← links)
- (Q5743381) (← links)
- (Q5743382) (← links)
- Further Exploiting <i>c</i>-Closure for FPT Algorithms and Kernels for Domination Problems (Q6071818) (← links)
