Selecting and covering colored points

2018/05/28 by Esther M. Arkin, Aritra Banik, Paz Carmi +5 · 1 citation
Computer Science · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Computational Geometry and Mesh Generation

paper · doi:10.1016/j.dam.2018.05.011

openalex publication_date 2018/05/28 · crossref created 2018/05/28 · crossref issued 2018/12/01 · crossref published 2018/12/01 · crossref published-print 2018/12/01 · crossref deposited 2024/04/05 · openalex created_date 2025/10/10 · crossref indexed 2026/06/19 · openalex updated_date 2026/07/29

Citations

• Some Theorems on Abstract Graphs
• Optimal packing and covering in the plane are NP-complete
• Note on Hamilton Circuits
• The complexity of theorem-proving procedures

Cited by

• Boolean satisfiability problem [wikipedia]