Follow
Guilherme D. da Fonseca
Guilherme D. da Fonseca
Aix-Marseille University and LIS
Verified email at lis-lab.fr - Homepage
Title
Cited by
Cited by
Year
The stable marriage problem with restricted pairs
VMF Dias, GD da Fonseca, CMH de Figueiredo, JL Szwarcfiter
Theoretical Computer Science 306 (1-3), 391-405, 2003
472003
Optimal approximate polytope membership
S Arya, GD da Fonseca, DM Mount
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017
332017
On the combinatorial complexity of approximating polytopes
S Arya, GD Da Fonseca, DM Mount
Discrete & Computational Geometry 58, 849-870, 2017
302017
Optimal Area-Sensitive Bounds for Polytope Approximation
S Arya, GD da Fonseca, DM Mount
ACM Symposium on Computational Geometry (SoCG), 2012
262012
Approximate range searching: The absolute model
GD Da Fonseca, DM Mount
Computational Geometry 43 (4), 434-444, 2010
262010
Near-Optimal ε-Kernel Construction and Related Problems
S Arya, GD da Fonseca, DM Mount
arXiv preprint arXiv:1703.10868, 2017
252017
Approximate polytope membership queries
S Arya, GD Da Fonseca, DM Mount
Proceedings of the forty-third annual ACM symposium on Theory of computing …, 2011
252011
Polytope Approximation and the Mahler Volume
S Arya, GD da Fonseca, DM Mount
ACM-SIAM Symposium on Discrete Algorithms (SODA), 29-42, 2012
222012
A unified approach to approximate proximity searching
S Arya, G da Fonseca, D Mount
Algorithms–ESA 2010, 374-385, 2011
192011
Shadoks approach to low-makespan coordinated motion planning
L Crombez, GD da Fonseca, Y Gerard, A Gonzalez-Lorenzo, ...
ACM Journal of Experimental Algorithmics (JEA) 27, 1-17, 2022
182022
Approximate polytope membership queries
S Arya, GD Da Fonseca, DM Mount
SIAM Journal on Computing 47 (1), 1-51, 2018
182018
Optimal bound on the combinatorial complexity of approximating polytopes
R Arya, S Arya, GD da Fonseca, D Mount
ACM Transactions on Algorithms 18 (4), 1-29, 2022
172022
Efficient sub-5 approximations for minimum dominating sets in unit disk graphs
GD da Fonseca, CMH de Figueiredo, VGP de Sá, RCS Machado
Theoretical Computer Science 540, 70-81, 2014
152014
On the recognition of unit disk graphs and the Distance Geometry Problem with Ranges
GD da Fonseca, VGP de Sá, RCS Machado, CMH de Figueiredo
Discrete Applied Mathematics 197, 3-19, 2015
142015
Approximate nearest neighbor searching with non-Euclidean and weighted distances
A Abdelkader, S Arya, GD da Fonseca, DM Mount
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
132019
Hamiltonian paths in odd graphs
LR Bueno, L Faria, FCMH De, GD Da Fonseca
Applicable Analysis and Discrete Mathematics 3 (2), 386-394, 2009
132009
Kinetic heap-ordered trees: tight analysis and improved algorithms
GD da Fonseca, CMH de Figueiredo
Information Processing Letters 85 (3), 165-169, 2003
132003
Linear time approximation for dominating sets and independent dominating sets in unit disk graphs
GD da Fonseca, CMH de Figueiredo, VGP de Sá, R Machado
International Workshop on Approximation and Online Algorithms, 82-92, 2012
122012
Enclosing weighted points with an almost-unit ball
CMH de Figueiredo, GD da Fonseca
Information processing letters 109 (21-22), 1216-1221, 2009
102009
Efficient independent set approximation in unit disk graphs
GK Das, GD da Fonseca, RK Jallu
Discrete Applied Mathematics 280, 63-70, 2020
92020
The system can't perform the operation now. Try again later.
Articles 1–20