Guilherme Dias da Fonseca

82 papers A* 13A 1B 7Misc 1Journal 53Unranked 6

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Optimal Area-Sensitive Bounds for Polytope Approximation. Discret. Comput. Geom. Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
2026	J	`jnl`	Shadoks Approach to Parallel Reconfiguration of Triangulations. CoRR Guilherme Dias da Fonseca, Fabien Feschet, Yan Gerard
2025	B	`conf`	PACE Solver Description: Shadoks Approach to Minimum Hitting Set and Dominating Set. IPEC Guilherme Dias da Fonseca, Fabien Feschet, Yan Gerard
2025	J	`jnl`	Untangling Segments in the Plane. CoRR Guilherme Dias da Fonseca, Yan Gerard, Bastien Rivier
2024	J	`jnl`	Economical Convex Coverings and Applications. SIAM J. Comput. Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
2024	J	`jnl`	Further Connectivity Results on Plane Spanning Path Reconfiguration. CoRR Valentino Boucard, Guilherme Dias da Fonseca, Bastien Rivier
2024	A*	`conf`	Shadoks Approach to Knapsack Polygonal Packing (CG Challenge). SoCG Guilherme Dias da Fonseca, Yan Gerard
2024	J	`jnl`	Shadoks Approach to Knapsack Polygonal Packing. CoRR Guilherme Dias da Fonseca, Yan Gerard
2024	B	`conf`	Short Flip Sequences to Untangle Segments in the Plane. WALCOM Guilherme Dias da Fonseca, Yan Gerard, Bastien Rivier
2023	J	`jnl`	Approximate Nearest Neighbor Searching with Non-Euclidean and Weighted Distances. CoRR Ahmed Abdelkader, Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
2023	J	`jnl`	Complexity results on untangling red-blue matchings. Comput. Geom. Arun Kumar Das, Sandip Das, Guilherme Dias da Fonseca, Yan Gerard, Bastien Rivier
2023	J	`jnl`	Conflict Optimization for Binary CSP Applied to Minimum Partition into Plane Subgraphs and Graph Coloring. CoRR 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
2023	J	`jnl`	Conflict Optimization for Binary CSP Applied to Minimum Partition into Plane Subgraphs and Graph Coloring. ACM J. Exp. Algorithmics 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
2023	A*	`conf`	Economical Convex Coverings and Applications. SODA Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
2023	J	`jnl`	Economical Convex Coverings and Applications. CoRR Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
2023	B	`conf`	On the Longest Flip Sequence to Untangle Segments in the Plane. WALCOM Guilherme Dias da Fonseca, Yan Gerard, Bastien Rivier
2023	J	`jnl`	Optimal Area-Sensitive Bounds for Polytope Approximation. CoRR Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
2023	A*	`conf`	Shadoks Approach to Convex Covering (CG Challenge). SoCG Guilherme Dias da Fonseca
2023	J	`jnl`	Shadoks Approach to Convex Covering. CoRR Guilherme Dias da Fonseca
2023	J	`jnl`	Short Flip Sequences to Untangle Segments in the Plane. CoRR Guilherme Dias da Fonseca, Yan Gerard, Bastien Rivier
2022	J	`jnl`	Complexity Results on Untangling Planar Rectilinear Red-Blue Matchings. CoRR Arun Kumar Das, Sandip Das, Guilherme Dias da Fonseca, Yan Gerard, Bastien Rivier
2022	B	`conf`	Complexity Results on Untangling Red-Blue Matchings. LATIN Arun Kumar Das, Sandip Das, Guilherme Dias da Fonseca, Yan Gerard, Bastien Rivier
2022	J	`jnl`	Greedy and Local Search Heuristics to Build Area-Optimal Polygons. ACM J. Exp. Algorithmics Loïc Crombez, Guilherme Dias da Fonseca, Yan Gerard
2022	J	`jnl`	On the Longest Flip Sequence to Untangle Segments in the Plane. CoRR Guilherme Dias da Fonseca, Yan Gerard, Bastien Rivier
2022	J	`jnl`	Optimal Bound on the Combinatorial Complexity of Approximating Polytopes. ACM Trans. Algorithms Rahul Arya, Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
2022	J	`jnl`	Shadoks Approach to Low-Makespan Coordinated Motion Planning. ACM J. Exp. Algorithmics Loïc Crombez, Guilherme Dias da Fonseca, Yan Gerard, Aldo Gonzalez-Lorenzo, Pascal Lafourcade, Luc Libralesso
2022	A*	`conf`	Shadoks Approach to Minimum Partition into Plane Subgraphs (CG Challenge). SoCG Loïc Crombez, Guilherme Dias da Fonseca, Yan Gerard, Aldo Gonzalez-Lorenzo
2021	Misc	`conf`	Efficient Algorithms for Battleship. FUN Loïc Crombez, Guilherme Dias da Fonseca, Yan Gerard
2021	J	`jnl`	Greedy and Local Search Heuristics to Build Area-Optimal Polygons. CoRR Loïc Crombez, Guilherme Dias da Fonseca, Yan Gerard
2021	A*	`conf`	Shadoks Approach to Low-Makespan Coordinated Motion Planning (CG Challenge). SoCG Loïc Crombez, Guilherme Dias da Fonseca, Yan Gerard, Aldo Gonzalez-Lorenzo, Pascal Lafourcade, Luc Libralesso
2021	J	`jnl`	Shadoks Approach to Low-Makespan Coordinated Motion Planning. CoRR Loïc Crombez, Guilherme Dias da Fonseca, Yan Gerard, Aldo Gonzalez-Lorenzo, Pascal Lafourcade, Luc Libralesso
2020	J	`jnl`	Efficient Algorithms for Battleship. CoRR Loïc Crombez, Guilherme Dias da Fonseca, Yan Gerard
2020	J	`jnl`	Efficient independent set approximation in unit disk graphs. Discret. Appl. Math. Gautam K. Das, Guilherme Dias da Fonseca, Ramesh K. Jallu
2020	J	`jnl`	Efficiently Testing Digital Convexity and Recognizing Digital Convex Polygons. J. Math. Imaging Vis. Loïc Crombez, Guilherme Dias da Fonseca, Yan Gerard
2020	A*	`conf`	Optimal Bound on the Combinatorial Complexity of Approximating Polytopes. SODA Rahul Arya, Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
2019	A*	`conf`	Approximate Nearest Neighbor Searching with Non-Euclidean and Weighted Distances. SODA Ahmed Abdelkader, Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
2019	—	`conf`	Efficient Algorithms to Test Digital Convexity. DGCI Loïc Crombez, Guilherme Dias da Fonseca, Yan Gérard
2019	J	`jnl`	Efficient Algorithms to Test Digital Convexity. CoRR Loïc Crombez, Guilherme Dias da Fonseca, Yan Gérard
2019	J	`jnl`	Optimal Bound on the Combinatorial Complexity of Approximating Polytopes. CoRR Rahul Arya, Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
2019	—	`conf`	Peeling Digital Potatoes. CCCG Loïc Crombez, Guilherme Dias da Fonseca, Yan Gerard
2018	A	`conf`	Approximate Convex Intersection Detection with Applications to Width and Minkowski Sums. ESA Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
2018	J	`jnl`	Approximate Convex Intersection Detection with Applications to Width and Minkowski Sums. CoRR Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
2018	J	`jnl`	Approximate Polytope Membership Queries. SIAM J. Comput. Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
2018	J	`jnl`	Peeling Digital Potatoes. CoRR Loïc Crombez, Guilherme Dias da Fonseca, Yan Gérard
2017	A*	`conf`	Near-Optimal epsilon-Kernel Construction and Related Problems. SoCG Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
2017	J	`jnl`	Near-Optimal ε-Kernel Construction and Related Problems. CoRR Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
2017	J	`jnl`	On the Combinatorial Complexity of Approximating Polytopes. Discret. Comput. Geom. Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
2017	A*	`conf`	Optimal Approximate Polytope Membership. SODA Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
2017	J	`jnl`	Shifting Coresets: Obtaining Linear-Time Approximations for Unit Disk Graphs and Other Geometric Intersection Graphs. Int. J. Comput. Geom. Appl. Guilherme Dias da Fonseca, Vinícius Gusmão Pereira de Sá, Celina Miraglia Herrera de Figueiredo
2016	J	`jnl`	Approximate Polytope Membership Queries. CoRR Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
2016	A*	`conf`	On the Combinatorial Complexity of Approximating Polytopes. SoCG Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
2016	J	`jnl`	On the Combinatorial Complexity of Approximating Polytopes. CoRR Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
2016	J	`jnl`	On the ratio between maximum weight perfect matchings and maximum weight matchings in grids. Discret. Appl. Math. Guilherme Dias da Fonseca, Bernard Ries, Diana Sasaki
2016	J	`jnl`	Optimal Approximate Polytope Membership. CoRR Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
2016	J	`jnl`	The cost of perfection for matchings in graphs. Discret. Appl. Math. Emilio Vital Brazil, Celina M. H. de Figueiredo, Guilherme Dias da Fonseca, Diana Sasaki
2015	J	`jnl`	On the recognition of unit disk graphs and the Distance Geometry Problem with Ranges. Discret. Appl. Math. Guilherme Dias da Fonseca, Vinícius Gusmão Pereira de Sá, Raphael Carlos Santos Machado, Celina Miraglia Herrera de Figueiredo
2014	J	`jnl`	Efficient sub-5 approximations for minimum dominating sets in unit disk graphs. Theor. Comput. Sci. Guilherme Dias da Fonseca, Celina M. H. de Figueiredo, Vinícius Gusmão Pereira de Sá, Raphael C. S. Machado
2014	B	`conf`	Linear-Time Approximation Algorithms for Unit Disk Graphs. WAOA Guilherme Dias da Fonseca, Vinícius Gusmão Pereira de Sá, Celina M. H. de Figueiredo
2014	J	`jnl`	Linear-Time Approximation Algorithms for Unit Disk Graphs. CoRR Guilherme Dias da Fonseca, Vinícius Gusmão Pereira de Sá, Celina M. H. de Figueiredo
2013	A*	`ed.`	Symposium on Computational Geometry 2013, SoCG '13, Rio de Janeiro, Brazil, June 17-20, 2013 SoCG Guilherme Dias da Fonseca, Thomas Lewiner, Luis Mariano Peñaranda, Timothy M. Chan, Rolf Klein
2012	J	`jnl`	Linear Time Approximation for Dominating Sets and Independent Dominating Sets in Unit Disk Graphs CoRR Guilherme Dias da Fonseca, Celina M. H. de Figueiredo, Vinícius G. P. de Sá, Raphael Machado
2012	B	`conf`	Linear Time Approximation for Dominating Sets and Independent Dominating Sets in Unit Disk Graphs. WAOA Guilherme Dias da Fonseca, Celina M. H. de Figueiredo, Vinícius G. P. de Sá, Raphael Machado
2012	—	`conf`	Optimal area-sensitive bounds for polytope approximation. SCG Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
2012	A*	`conf`	Polytope approximation and the Mahler volume. SODA Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
2012	J	`jnl`	The Cost of Perfection for Matchings in Graphs CoRR Emilio Vital Brazil, Guilherme Dias da Fonseca, Celina M. H. de Figueiredo
2011	A*	`conf`	Approximate polytope membership queries. STOC Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
2011	J	`jnl`	Complexity dichotomy on partial grid recognition. Theor. Comput. Sci. Vinícius G. P. de Sá, Guilherme Dias da Fonseca, Raphael C. S. Machado, Celina M. H. de Figueiredo
2011	J	`jnl`	Fitting Flats to Points with Outliers. Int. J. Comput. Geom. Appl. Guilherme Dias da Fonseca
2010	—	`conf`	A Unified Approach to Approximate Proximity Searching. ESA (1) Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
2010	J	`jnl`	Approximate range searching: The absolute model. Comput. Geom. Guilherme Dias da Fonseca, David M. Mount
2010	J	`jnl`	Complexity dichotomy on degree-constrained VLSI layouts with unit-length edges. Electron. Notes Discret. Math. Vinícius G. P. de Sá, Celina M. H. de Figueiredo, Guilherme Dias da Fonseca, Raphael Machado
2010	J	`jnl`	Complexity dichotomy on partial grid recognition CoRR Vinícius G. P. de Sá, Guilherme Dias da Fonseca, Raphael Machado, Celina M. H. de Figueiredo
2009	J	`jnl`	Enclosing weighted points with an almost-unit ball. Inf. Process. Lett. Celina M. H. de Figueiredo, Guilherme Dias da Fonseca
2008	—	`conf`	Tradeoffs in Approximate Range Searching Made Simpler. SIBGRAPI Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
2007	—	`—`	Approximate Range Searching In The Absolute Error Model. Guilherme Dias da Fonseca
2007	B	`conf`	Approximate Range Searching: The Absolute Model. WADS Guilherme Dias da Fonseca
2006	J	`jnl`	Algorithms for the Homogeneous Set Sandwich Problem. Algorithmica Celina M. H. de Figueiredo, Guilherme Dias da Fonseca, Vinícius G. P. de Sá, Jeremy P. Spinrad
2004	—	`conf`	Faster Deterministic and Randomized Algorithms on the Homogeneous Set Sandwich Problem. WEA Celina M. H. de Figueiredo, Guilherme Dias da Fonseca, Vinícius G. P. de Sá, Jeremy P. Spinrad
2004	J	`jnl`	Kinetic hanger. Inf. Process. Lett. Guilherme Dias da Fonseca, Celina M. H. de Figueiredo, Paulo Cezar Pinto Carvalho
2003	J	`jnl`	Kinetic heap-ordered trees: Tight analysis and improved algorithms. Inf. Process. Lett. Guilherme Dias da Fonseca, Celina M. H. de Figueiredo
2003	J	`jnl`	The stable marriage problem with restricted pairs. Theor. Comput. Sci. Vânia M. Félix Dias, Guilherme Dias da Fonseca, Celina M. H. de Figueiredo, Jayme Luiz Szwarcfiter
2001	J	`jnl`	Stable marriages with restricted pairs. Electron. Notes Discret. Math. Vânia M. Félix Dias, Guilherme Dias da Fonseca, Celina M. H. de Figueiredo, Jayme Luiz Szwarcfiter