Fine-grained complexity of coloring unit disks and balls
DOI10.4230/LIPICS.SOCG.2017.18zbMATH Open1417.68226MaRDI QIDQ4580091FDOQ4580091
Authors: Csaba Biró, Édouard Bonnet, Dániel Marx, Tillmann Miltzow, Paweł Rzążewski 
Publication date: 13 August 2018
Recommendations
- Fine-grained complexity of coloring unit disks and balls
- On coloring unit disk graphs
- Geometric separation and exact solutions for the parameterized independent set problem on disk graphs
- Optimality program in segment and string graphs
- EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Coloring of graphs and hypergraphs (05C15) Graph representations (geometric and intersection representations, etc.) (05C62)
Cited In (6)
- Lower Bounds for Dominating Set in Ball Graphs and for Weighted Dominating Set in Unit-Ball Graphs
- Optimality program in segment and string graphs
- Fine-grained complexity of coloring unit disks and balls
- Optimality program in segment and string graphs
- On the exact complexity of Hamiltonian Cycle and \(q\)-Colouring in disk graphs
- The homogeneous broadcast problem in narrow and wide strips. II: Lower bounds
This page was built for publication: Fine-grained complexity of coloring unit disks and balls
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4580091)
