4 citations · 4 across the 2 of their papers we have counts for
2 papers
cs.ET2021
Solving the One-dimensional Distance Geometry Problem by Optical Computing
S. B. Hengeveld, N. Rubiano da Silva, D. S. Gonçalves +2
Distance geometry problem belongs to a class of hard problems in classical computation that can be understood in terms of a set of inputs processed according to a given transformat…
cs.CG2020★ 4 cited
A Practical Algorithm with Performance Guarantees for the Art Gallery Problem
Simon Hengeveld, Tillmann Miltzow
Given a closed simple polygon , we say two points see each other if the segment is fully contained in . The art gallery problem seeks a minimum size set $G\subset…