Arthur C. Gomes
1 indexed paper
Recent (6 mo)
1With code
0Influential cites
0Benchmarked
0Publications per year
126
Top categories
Combinatorics×1Complexity×1
Frequent co-authors
Research Timeline
2026
The complexity of minimum-density locating-dominating set in infinite periodic graphs
The paper proves that finding a minimum-density locating-dominating set in infinite Z-periodic graphs is NP-hard.
Highlighted terms show continued research focus across papers