Kernelization of the subset general position problem in geometry
From MaRDI portal
Recommendations
- Finding points in general position
- On the General Position Subset Selection Problem
- Applications of incidence bounds in point covering problems
- General position subsets and independent hyperplanes in d-space
- Tight kernels for covering and hitting: point hyperplane cover and polynomial point hitting set
Cites work
- scientific article; zbMATH DE number 1749054 (Why is no real title available?)
- scientific article; zbMATH DE number 1424290 (Why is no real title available?)
- scientific article; zbMATH DE number 1433426 (Why is no real title available?)
- Better lower bounds on detecting affine and spherical degeneracies
- Constructing Arrangements of Lines and Hyperplanes with Applications
- Corrigendum: Topologically sweeping an arrangement
- Covering things with things
- General position subsets and independent hyperplanes in d-space
- Kernel bounds for disjoint cycles and disjoint paths
- On the General Position Subset Selection Problem
- Parameterized algorithms
- Point line cover: the easy kernel is essentially tight
- Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses
- Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
- Topologically sweeping an arrangement
- Towards optimal and expressive kernelization for \(d\)-hitting set
Cited in
(3)
This page was built for publication: Kernelization of the subset general position problem in geometry
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111239)
