3 papers
cs.DS2026
How many users have been here for a long time? Efficient solutions for counting long aggregated visits
Peyman Afshani, Rezaul Chowdhury, Inge Li Gørtz +3
This paper addresses the Counting Long Aggregated Visits problem, which is defined as follows. We are given users and regions, where each user spends some time visiting som…
cs.CG2025
Computing Diverse and Nice Triangulations
Waldo Gálvez, Mayank Goswami, Arturo Merino +2
We initiate the study of computing diverse triangulations to a given polygon. Given a simple -gon , an integer , a quality measure on the set of triangulation…
cs.CG2025
A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems
Waldo Gálvez, Mayank Goswami, Arturo Merino +3
There has been considerable recent interest in computing a diverse collection of solutions to a given optimization problem, both in the AI and theory communities. Given a classical…