Guilherme Dias da Fonseca

Publication Activity (10 Years)

Years Active: 2001-2024
Publications (10 Years): 49

Top Topics

Digital Convexity

Related Problems

Motion Planning

Top Venues

Discret. Appl. Math.

Publications

Guilherme Dias da Fonseca, Yan Gerard
Shadoks Approach to Knapsack Polygonal Packing (CG Challenge). SoCG (2024)
Guilherme Dias da Fonseca, Yan Gerard
Shadoks Approach to Knapsack Polygonal Packing. CoRR (2024)
Guilherme Dias da Fonseca, Yan Gerard, Bastien Rivier
Short Flip Sequences to Untangle Segments in the Plane. WALCOM (2024)
Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
Economical Convex Coverings and Applications. SIAM J. Comput. 53 (4) (2024)
Loïc Crombez, Guilherme Dias da Fonseca, Florian Fontan, Yan Gerard, Aldo Gonzalez-Lorenzo, Pascal Lafourcade, Luc Libralesso, Benjamin Momège, Jack Spalding-Jamieson, Brandon Zhang, Da Wei Zheng
Conflict Optimization for Binary CSP Applied to Minimum Partition into Plane Subgraphs and Graph Coloring. ACM J. Exp. Algorithmics 28 (2023)
Guilherme Dias da Fonseca
Shadoks Approach to Convex Covering. CoRR (2023)
Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
Economical Convex Coverings and Applications. CoRR (2023)
Guilherme Dias da Fonseca
Shadoks Approach to Convex Covering (CG Challenge). SoCG (2023)
Guilherme Dias da Fonseca, Yan Gerard, Bastien Rivier
On the Longest Flip Sequence to Untangle Segments in the Plane. WALCOM (2023)
Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
Optimal Area-Sensitive Bounds for Polytope Approximation. CoRR (2023)
Guilherme Dias da Fonseca, Yan Gerard, Bastien Rivier
Short Flip Sequences to Untangle Segments in the Plane. CoRR (2023)
Arun Kumar Das, Sandip Das, Guilherme Dias da Fonseca, Yan Gerard, Bastien Rivier
Complexity results on untangling red-blue matchings. Comput. Geom. 111 (2023)
Loïc Crombez, Guilherme Dias da Fonseca, Florian Fontan, Yan Gerard, Aldo Gonzalez-Lorenzo, Pascal Lafourcade, Luc Libralesso, Benjamin Momège, Jack Spalding-Jamieson, Brandon Zhang, Da Wei Zheng
Conflict Optimization for Binary CSP Applied to Minimum Partition into Plane Subgraphs and Graph Coloring. CoRR (2023)
Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
Economical Convex Coverings and Applications. SODA (2023)
Guilherme Dias da Fonseca, Yan Gerard, Bastien Rivier
On the Longest Flip Sequence to Untangle Segments in the Plane. CoRR (2022)
Rahul Arya, Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
Optimal Bound on the Combinatorial Complexity of Approximating Polytopes. ACM Trans. Algorithms 18 (4) (2022)
Arun Kumar Das, Sandip Das, Guilherme Dias da Fonseca, Yan Gerard, Bastien Rivier
Complexity Results on Untangling Red-Blue Matchings. LATIN (2022)
Loïc Crombez, Guilherme Dias da Fonseca, Yan Gerard
Greedy and Local Search Heuristics to Build Area-Optimal Polygons. ACM J. Exp. Algorithmics 27 (2022)
Arun Kumar Das, Sandip Das, Guilherme Dias da Fonseca, Yan Gerard, Bastien Rivier
Complexity Results on Untangling Planar Rectilinear Red-Blue Matchings. CoRR (2022)
Loïc Crombez, Guilherme Dias da Fonseca, Yan Gerard, Aldo Gonzalez-Lorenzo, Pascal Lafourcade, Luc Libralesso
Shadoks Approach to Low-Makespan Coordinated Motion Planning. ACM J. Exp. Algorithmics 27 (2022)
Loïc Crombez, Guilherme Dias da Fonseca, Yan Gerard, Aldo Gonzalez-Lorenzo
Shadoks Approach to Minimum Partition into Plane Subgraphs (CG Challenge). SoCG (2022)
Loïc Crombez, Guilherme Dias da Fonseca, Yan Gerard, Aldo Gonzalez-Lorenzo, Pascal Lafourcade, Luc Libralesso
Shadoks Approach to Low-Makespan Coordinated Motion Planning (CG Challenge). SoCG (2021)
Loïc Crombez, Guilherme Dias da Fonseca, Yan Gerard
Greedy and Local Search Heuristics to Build Area-Optimal Polygons. CoRR (2021)
Loïc Crombez, Guilherme Dias da Fonseca, Yan Gerard, Aldo Gonzalez-Lorenzo, Pascal Lafourcade, Luc Libralesso
Shadoks Approach to Low-Makespan Coordinated Motion Planning. CoRR (2021)
Loïc Crombez, Guilherme Dias da Fonseca, Yan Gerard
Efficient Algorithms for Battleship. FUN (2021)
Gautam K. Das, Guilherme Dias da Fonseca, Ramesh K. Jallu
Efficient independent set approximation in unit disk graphs. Discret. Appl. Math. 280 (2020)
Loïc Crombez, Guilherme Dias da Fonseca, Yan Gerard
Efficient Algorithms for Battleship. CoRR (2020)
Loïc Crombez, Guilherme Dias da Fonseca, Yan Gerard
Efficiently Testing Digital Convexity and Recognizing Digital Convex Polygons. J. Math. Imaging Vis. 62 (5) (2020)
Rahul Arya, Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
Optimal Bound on the Combinatorial Complexity of Approximating Polytopes. SODA (2020)
Loïc Crombez, Guilherme Dias da Fonseca, Yan Gerard
Peeling Digital Potatoes. CCCG (2019)
Rahul Arya, Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
Optimal Bound on the Combinatorial Complexity of Approximating Polytopes. CoRR (2019)
Loïc Crombez, Guilherme Dias da Fonseca, Yan Gérard
Efficient Algorithms to Test Digital Convexity. CoRR (2019)
Loïc Crombez, Guilherme Dias da Fonseca, Yan Gérard
Efficient Algorithms to Test Digital Convexity. DGCI (2019)
Ahmed Abdelkader, Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
Approximate Nearest Neighbor Searching with Non-Euclidean and Weighted Distances. SODA (2019)
Loïc Crombez, Guilherme Dias da Fonseca, Yan Gérard
Peeling Digital Potatoes. CoRR (2018)
Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
Approximate Convex Intersection Detection with Applications to Width and Minkowski Sums. CoRR (2018)
Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
Approximate Convex Intersection Detection with Applications to Width and Minkowski Sums. ESA (2018)
Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
Approximate Polytope Membership Queries. SIAM J. Comput. 47 (1) (2018)
Guilherme Dias da Fonseca, Vinícius Gusmão Pereira de Sá, Celina Miraglia Herrera de Figueiredo
Shifting Coresets: Obtaining Linear-Time Approximations for Unit Disk Graphs and Other Geometric Intersection Graphs. Int. J. Comput. Geom. Appl. 27 (4) (2017)
Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
On the Combinatorial Complexity of Approximating Polytopes. Discret. Comput. Geom. 58 (4) (2017)
Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
Near-Optimal epsilon-Kernel Construction and Related Problems. SoCG (2017)
Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
Near-Optimal ε-Kernel Construction and Related Problems. CoRR (2017)
Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
Optimal Approximate Polytope Membership. SODA (2017)
Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
Optimal Approximate Polytope Membership. CoRR (2016)
Guilherme Dias da Fonseca, Bernard Ries, Diana Sasaki
On the ratio between maximum weight perfect matchings and maximum weight matchings in grids. Discret. Appl. Math. 207 (2016)
Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
On the Combinatorial Complexity of Approximating Polytopes. CoRR (2016)
Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
Approximate Polytope Membership Queries. CoRR (2016)
Emilio Vital Brazil, Celina M. H. de Figueiredo, Guilherme Dias da Fonseca, Diana Sasaki
The cost of perfection for matchings in graphs. Discret. Appl. Math. 210 (2016)
Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
On the Combinatorial Complexity of Approximating Polytopes. SoCG (2016)
Guilherme Dias da Fonseca, Vinícius Gusmão Pereira de Sá, Raphael Carlos Santos Machado, Celina Miraglia Herrera de Figueiredo
On the recognition of unit disk graphs and the Distance Geometry Problem with Ranges. Discret. Appl. Math. 197 (2015)
Guilherme Dias da Fonseca, Celina M. H. de Figueiredo, Vinícius Gusmão Pereira de Sá, Raphael C. S. Machado
Efficient sub-5 approximations for minimum dominating sets in unit disk graphs. Theor. Comput. Sci. 540 (2014)
Guilherme Dias da Fonseca, Vinícius Gusmão Pereira de Sá, Celina M. H. de Figueiredo
Linear-Time Approximation Algorithms for Unit Disk Graphs. WAOA (2014)
Guilherme Dias da Fonseca, Vinícius Gusmão Pereira de Sá, Celina M. H. de Figueiredo
Linear-Time Approximation Algorithms for Unit Disk Graphs. CoRR (2014)
Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
Optimal area-sensitive bounds for polytope approximation. SCG (2012)
Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
Polytope approximation and the Mahler volume. SODA (2012)
Guilherme Dias da Fonseca, Celina M. H. de Figueiredo, Vinícius G. P. de Sá, Raphael Machado
Linear Time Approximation for Dominating Sets and Independent Dominating Sets in Unit Disk Graphs. WAOA (2012)
Guilherme Dias da Fonseca, Celina M. H. de Figueiredo, Vinícius G. P. de Sá, Raphael Machado
Linear Time Approximation for Dominating Sets and Independent Dominating Sets in Unit Disk Graphs CoRR (2012)
Emilio Vital Brazil, Guilherme Dias da Fonseca, Celina M. H. de Figueiredo
The Cost of Perfection for Matchings in Graphs CoRR (2012)
Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
Approximate polytope membership queries. STOC (2011)
Vinícius G. P. de Sá, Guilherme Dias da Fonseca, Raphael C. S. Machado, Celina M. H. de Figueiredo
Complexity dichotomy on partial grid recognition. Theor. Comput. Sci. 412 (22) (2011)
Guilherme Dias da Fonseca
Fitting Flats to Points with Outliers. Int. J. Comput. Geom. Appl. 21 (5) (2011)
Vinícius G. P. de Sá, Celina M. H. de Figueiredo, Guilherme Dias da Fonseca, Raphael Machado
Complexity dichotomy on degree-constrained VLSI layouts with unit-length edges. Electron. Notes Discret. Math. 36 (2010)
Guilherme Dias da Fonseca, David M. Mount
Approximate range searching: The absolute model. Comput. Geom. 43 (4) (2010)
Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
A Unified Approach to Approximate Proximity Searching. ESA (1) (2010)
Vinícius G. P. de Sá, Guilherme Dias da Fonseca, Raphael Machado, Celina M. H. de Figueiredo
Complexity dichotomy on partial grid recognition CoRR (2010)
Celina M. H. de Figueiredo, Guilherme Dias da Fonseca
Enclosing weighted points with an almost-unit ball. Inf. Process. Lett. 109 (21-22) (2009)
Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
Tradeoffs in Approximate Range Searching Made Simpler. SIBGRAPI (2008)
Guilherme Dias da Fonseca
Approximate Range Searching: The Absolute Model. WADS (2007)
Celina M. H. de Figueiredo, Guilherme Dias da Fonseca, Vinícius G. P. de Sá, Jeremy P. Spinrad
Algorithms for the Homogeneous Set Sandwich Problem. Algorithmica 46 (2) (2006)
Celina M. H. de Figueiredo, Guilherme Dias da Fonseca, Vinícius G. P. de Sá, Jeremy P. Spinrad
Faster Deterministic and Randomized Algorithms on the Homogeneous Set Sandwich Problem. WEA (2004)
Guilherme Dias da Fonseca, Celina M. H. de Figueiredo, Paulo Cezar Pinto Carvalho
Kinetic hanger. Inf. Process. Lett. 89 (3) (2004)
Vânia M. Félix Dias, Guilherme Dias da Fonseca, Celina M. H. de Figueiredo, Jayme Luiz Szwarcfiter
The stable marriage problem with restricted pairs. Theor. Comput. Sci. 306 (1-3) (2003)
Guilherme Dias da Fonseca, Celina M. H. de Figueiredo
Kinetic heap-ordered trees: Tight analysis and improved algorithms. Inf. Process. Lett. 85 (3) (2003)
Vânia M. Félix Dias, Guilherme Dias da Fonseca, Celina M. H. de Figueiredo, Jayme Luiz Szwarcfiter
Stable marriages with restricted pairs. Electron. Notes Discret. Math. 7 (2001)