Stable marriages with restricted pairs. - Vânia M. Félix Dias; Guilherme Dias da Fonseca; Celina M. H. de Figueiredo; Jayme Luiz Szwarcfiter (Electron. Notes Discret. Math., 2001)

Kinetic heap-ordered trees: Tight analysis and improved algorithms. - Guilherme Dias da Fonseca; Celina M. H. de Figueiredo (Inf. Process. Lett., 2003)

The stable marriage problem with restricted pairs. - Vânia M. Félix Dias; Guilherme Dias da Fonseca; Celina M. H. de Figueiredo; Jayme Luiz Szwarcfiter (Theor. Comput. Sci., 2003)

Faster Deterministic and Randomized Algorithms on the Homogeneous Set Sandwich Problem. - Celina M. H. de Figueiredo; Guilherme Dias da Fonseca; Vinícius G. P. de Sá; Jeremy P. Spinrad (WEA, 2004)

Kinetic hanger. - Guilherme Dias da Fonseca; Celina M. H. de Figueiredo; Paulo Cezar Pinto Carvalho (Inf. Process. Lett., 2004)

Algorithms for the Homogeneous Set Sandwich Problem. - Celina M. H. de Figueiredo; Guilherme Dias da Fonseca; Vinícius G. P. de Sá; Jeremy P. Spinrad (Algorithmica, 2006)

Approximate Range Searching: The Absolute Model. - Guilherme Dias da Fonseca (WADS, 2007)

Approximate Range Searching In The Absolute Error Model. - Guilherme Dias da Fonseca (2007)

Tradeoffs in Approximate Range Searching Made Simpler. - Sunil Arya; Guilherme Dias da Fonseca; David M. Mount (SIBGRAPI, 2008)

Enclosing weighted points with an almost-unit ball. - Celina M. H. de Figueiredo; Guilherme Dias da Fonseca (Inf. Process. Lett., 2009)

A Unified Approach to Approximate Proximity Searching. - Sunil Arya; Guilherme Dias da Fonseca; David M. Mount (ESA (1), 2010)

Approximate range searching: The absolute model. - Guilherme Dias da Fonseca; David M. Mount (Comput. Geom., 2010)

Complexity dichotomy on degree-constrained VLSI layouts with unit-length edges. - Vinícius G. P. de Sá; Celina M. H. de Figueiredo; Guilherme Dias da Fonseca; Raphael Machado (Electron. Notes Discret. Math., 2010)

Fitting Flats to Points with Outliers. - Guilherme Dias da Fonseca (Int. J. Comput. Geom. Appl., 2011)

Complexity dichotomy on partial grid recognition. - Vinícius G. P. de Sá; Guilherme Dias da Fonseca; Raphael C. S. Machado; Celina M. H. de Figueiredo (Theor. Comput. Sci., 2011)

Optimal area-sensitive bounds for polytope approximation. - Sunil Arya; Guilherme Dias da Fonseca; David M. Mount (SCG, 2012)

Polytope approximation and the Mahler volume. - Sunil Arya; Guilherme Dias da Fonseca; David M. Mount (SODA, 2012)

Linear Time Approximation for Dominating Sets and Independent Dominating Sets in Unit Disk Graphs. - Guilherme Dias da Fonseca; Celina M. H. de Figueiredo; Vinícius G. P. de Sá; Raphael Machado (WAOA, 2012)

The Cost of Perfection for Matchings in Graphs - Emilio Vital Brazil; Guilherme Dias da Fonseca; Celina M. H. de Figueiredo (CoRR, 2012)

Linear-Time Approximation Algorithms for Unit Disk Graphs. - Guilherme Dias da Fonseca; Vinícius Gusmão Pereira de Sá; Celina M. H. de Figueiredo (WAOA, 2014)

Efficient sub-5 approximations for minimum dominating sets in unit disk graphs. - Guilherme Dias da Fonseca; Celina M. H. de Figueiredo; Vinícius Gusmão Pereira de Sá; Raphael C. S. Machado (Theor. Comput. Sci., 2014)

On the recognition of unit disk graphs and the Distance Geometry Problem with Ranges. - Guilherme Dias da Fonseca; Vinícius Gusmão Pereira de Sá; Raphael Carlos Santos Machado; Celina Miraglia Herrera de Figueiredo (Discret. Appl. Math., 2015)

The cost of perfection for matchings in graphs. - Emilio Vital Brazil; Celina M. H. de Figueiredo; Guilherme Dias da Fonseca; Diana Sasaki (Discret. Appl. Math., 2016)

On the ratio between maximum weight perfect matchings and maximum weight matchings in grids. - Guilherme Dias da Fonseca; Bernard Ries; Diana Sasaki (Discret. Appl. Math., 2016)

Near-Optimal epsilon-Kernel Construction and Related Problems. - Sunil Arya; Guilherme Dias da Fonseca; David M. Mount (SoCG, 2017)

Optimal Approximate Polytope Membership. - Sunil Arya; Guilherme Dias da Fonseca; David M. Mount (SODA, 2017)

Near-Optimal ε-Kernel Construction and Related Problems. - Sunil Arya; Guilherme Dias da Fonseca; David M. Mount (CoRR, 2017)

On the Combinatorial Complexity of Approximating Polytopes. - Sunil Arya; Guilherme Dias da Fonseca; David M. Mount (Discret. Comput. Geom., 2017)

Shifting Coresets: Obtaining Linear-Time Approximations for Unit Disk Graphs and Other Geometric Intersection Graphs. - Guilherme Dias da Fonseca; Vinícius Gusmão Pereira de Sá; Celina Miraglia Herrera de Figueiredo (Int. J. Comput. Geom. Appl., 2017)

Approximate Convex Intersection Detection with Applications to Width and Minkowski Sums. - Sunil Arya; Guilherme Dias da Fonseca; David M. Mount (ESA, 2018)

Approximate Polytope Membership Queries. - Sunil Arya; Guilherme Dias da Fonseca; David M. Mount (SIAM J. Comput., 2018)

Peeling Digital Potatoes. - Loïc Crombez; Guilherme Dias da Fonseca; Yan Gerard (CCCG, 2019)

Efficient Algorithms to Test Digital Convexity. - Loïc Crombez; Guilherme Dias da Fonseca; Yan Gérard (DGCI, 2019)

Approximate Nearest Neighbor Searching with Non-Euclidean and Weighted Distances. - Ahmed Abdelkader; Sunil Arya; Guilherme Dias da Fonseca; David M. Mount (SODA, 2019)

Efficient independent set approximation in unit disk graphs. - Gautam K. Das; Guilherme Dias da Fonseca; Ramesh K. Jallu (Discret. Appl. Math., 2020)

Efficiently Testing Digital Convexity and Recognizing Digital Convex Polygons. - Loïc Crombez; Guilherme Dias da Fonseca; Yan Gerard (J. Math. Imaging Vis., 2020)

Shadoks Approach to Low-Makespan Coordinated Motion Planning (CG Challenge). - Loïc Crombez; Guilherme Dias da Fonseca; Yan Gerard; Aldo Gonzalez-Lorenzo; Pascal Lafourcade 001; Luc Libralesso (SoCG, 2021)

Efficient Algorithms for Battleship. - Loïc Crombez; Guilherme Dias da Fonseca; Yan Gerard (FUN, 2021)

Shadoks Approach to Minimum Partition into Plane Subgraphs (CG Challenge). - Loïc Crombez; Guilherme Dias da Fonseca; Yan Gerard; Aldo Gonzalez-Lorenzo (SoCG, 2022)

Complexity Results on Untangling Planar Rectilinear Red-Blue Matchings. - Arun Kumar Das 001; Sandip Das 001; Guilherme Dias da Fonseca; Yan Gerard; Bastien Rivier (CoRR, 2022)

Greedy and Local Search Heuristics to Build Area-Optimal Polygons. - Loïc Crombez; Guilherme Dias da Fonseca; Yan Gerard (ACM J. Exp. Algorithmics, 2022)

Shadoks Approach to Low-Makespan Coordinated Motion Planning. - Loïc Crombez; Guilherme Dias da Fonseca; Yan Gerard; Aldo Gonzalez-Lorenzo; Pascal Lafourcade 001; Luc Libralesso (ACM J. Exp. Algorithmics, 2022)

Optimal Bound on the Combinatorial Complexity of Approximating Polytopes. - Rahul Arya; Sunil Arya; Guilherme Dias da Fonseca; David M. Mount (ACM Trans. Algorithms, 2022)

Shadoks Approach to Convex Covering (CG Challenge). - Guilherme Dias da Fonseca (SoCG, 2023)

On the Longest Flip Sequence to Untangle Segments in the Plane. - Guilherme Dias da Fonseca; Yan Gerard; Bastien Rivier (WALCOM, 2023)

Shadoks Approach to Convex Covering. - Guilherme Dias da Fonseca (CoRR, 2023)

Complexity results on untangling red-blue matchings. - Arun Kumar Das 001; Sandip Das 001; Guilherme Dias da Fonseca; Yan Gerard; Bastien Rivier (Comput. Geom., 2023)

Conflict Optimization for Binary CSP Applied to Minimum Partition into Plane Subgraphs and Graph Coloring. - Loïc Crombez; Guilherme Dias da Fonseca; Florian Fontan; Yan Gerard; Aldo Gonzalez-Lorenzo; Pascal Lafourcade 001; Luc Libralesso; Benjamin Momège; Jack Spalding-Jamieson; Brandon Zhang; Da Wei Zheng (ACM J. Exp. Algorithmics, 2023)

Shadoks Approach to Knapsack Polygonal Packing (CG Challenge). - Guilherme Dias da Fonseca; Yan Gerard (SoCG, 2024)

Short Flip Sequences to Untangle Segments in the Plane. - Guilherme Dias da Fonseca; Yan Gerard; Bastien Rivier (WALCOM, 2024)

Shadoks Approach to Knapsack Polygonal Packing. - Guilherme Dias da Fonseca; Yan Gerard (CoRR, 2024)

Further Connectivity Results on Plane Spanning Path Reconfiguration. - Valentino Boucard; Guilherme Dias da Fonseca; Bastien Rivier (CoRR, 2024)

Economical Convex Coverings and Applications. - Sunil Arya; Guilherme Dias da Fonseca; David M. Mount (SIAM J. Comput., 2024)

Untangling Segments in the Plane. - Guilherme Dias da Fonseca; Yan Gerard; Bastien Rivier (CoRR, 2025)