default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGuilherme Dias da Fonseca
Person information
- affiliation: Aix-Marseille University, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j25]Sunil Arya
, Guilherme Dias da Fonseca, David M. Mount:
Economical Convex Coverings and Applications. SIAM J. Comput. 53(4): 1002-1038 (2024)- [c26]Guilherme Dias da Fonseca, Yan Gerard:
Shadoks Approach to Knapsack Polygonal Packing (CG Challenge). SoCG 2024: 84:1-84:9 - [c25]Guilherme Dias da Fonseca, Yan Gerard, Bastien Rivier:
Short Flip Sequences to Untangle Segments in the Plane. WALCOM 2024: 163-178 - [i24]Guilherme Dias da Fonseca, Yan Gerard:
Shadoks Approach to Knapsack Polygonal Packing. CoRR abs/2403.20123 (2024) - 2023
- [j24]Arun Kumar Das, Sandip Das, Guilherme Dias da Fonseca, Yan Gerard, Bastien Rivier:
Complexity results on untangling red-blue matchings. Comput. Geom. 111: 101974 (2023) - [j23]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: 1.2:1-1.2:13 (2023) - [c24]Guilherme Dias da Fonseca:
Shadoks Approach to Convex Covering (CG Challenge). SoCG 2023: 67:1-67:9 - [c23]Sunil Arya, Guilherme Dias da Fonseca, David M. Mount:
Economical Convex Coverings and Applications. SODA 2023: 1834-1861 - [c22]Guilherme Dias da Fonseca, Yan Gerard, Bastien Rivier:
On the Longest Flip Sequence to Untangle Segments in the Plane. WALCOM 2023: 102-112 - [i23]Guilherme Dias da Fonseca:
Shadoks Approach to Convex Covering. CoRR abs/2303.07696 (2023) - [i22]Sunil Arya, Guilherme Dias da Fonseca, David M. Mount:
Economical Convex Coverings and Applications. CoRR abs/2303.08349 (2023) - [i21]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 abs/2303.09632 (2023) - [i20]Ahmed Abdelkader, Sunil Arya, Guilherme Dias da Fonseca, David M. Mount:
Approximate Nearest Neighbor Searching with Non-Euclidean and Weighted Distances. CoRR abs/2306.15621 (2023) - [i19]Sunil Arya, Guilherme Dias da Fonseca, David M. Mount:
Optimal Area-Sensitive Bounds for Polytope Approximation. CoRR abs/2306.15648 (2023) - [i18]Guilherme Dias da Fonseca, Yan Gerard, Bastien Rivier:
Short Flip Sequences to Untangle Segments in the Plane. CoRR abs/2307.00853 (2023) - 2022
- [j22]Loïc Crombez, Guilherme Dias da Fonseca, Yan Gerard:
Greedy and Local Search Heuristics to Build Area-Optimal Polygons. ACM J. Exp. Algorithmics 27: 2.2:1-2.2:11 (2022) - [j21]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: 3.2:1-3.2:17 (2022) - [j20]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): 35:1-35:29 (2022) - [c21]Loïc Crombez, Guilherme Dias da Fonseca, Yan Gerard, Aldo Gonzalez-Lorenzo:
Shadoks Approach to Minimum Partition into Plane Subgraphs (CG Challenge). SoCG 2022: 71:1-71:8 - [c20]Arun Kumar Das, Sandip Das, Guilherme Dias da Fonseca, Yan Gerard, Bastien Rivier:
Complexity Results on Untangling Red-Blue Matchings. LATIN 2022: 730-745 - [i17]Arun Kumar Das, Sandip Das, Guilherme Dias da Fonseca, Yan Gerard, Bastien Rivier:
Complexity Results on Untangling Planar Rectilinear Red-Blue Matchings. CoRR abs/2202.11857 (2022) - [i16]Guilherme Dias da Fonseca, Yan Gerard, Bastien Rivier:
On the Longest Flip Sequence to Untangle Segments in the Plane. CoRR abs/2210.12036 (2022) - 2021
- [c19]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: 63:1-63:9 - [c18]Loïc Crombez, Guilherme Dias da Fonseca, Yan Gerard:
Efficient Algorithms for Battleship. FUN 2021: 11:1-11:15 - [i15]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 abs/2103.13956 (2021) - [i14]Loïc Crombez, Guilherme Dias da Fonseca, Yan Gerard:
Greedy and Local Search Heuristics to Build Area-Optimal Polygons. CoRR abs/2106.14728 (2021) - 2020
- [j19]Gautam K. Das, Guilherme Dias da Fonseca, Ramesh K. Jallu:
Efficient independent set approximation in unit disk graphs. Discret. Appl. Math. 280: 63-70 (2020) - [j18]Loïc Crombez, Guilherme Dias da Fonseca, Yan Gerard:
Efficiently Testing Digital Convexity and Recognizing Digital Convex Polygons. J. Math. Imaging Vis. 62(5): 693-703 (2020) - [c17]Rahul Arya, Sunil Arya, Guilherme Dias da Fonseca, David M. Mount:
Optimal Bound on the Combinatorial Complexity of Approximating Polytopes. SODA 2020: 786-805 - [i13]Loïc Crombez, Guilherme Dias da Fonseca, Yan Gerard:
Efficient Algorithms for Battleship. CoRR abs/2004.07354 (2020)
2010 – 2019
- 2019
- [c16]Loïc Crombez, Guilherme Dias da Fonseca, Yan Gerard:
Peeling Digital Potatoes. CCCG 2019: 124-132 - [c15]Loïc Crombez, Guilherme Dias da Fonseca, Yan Gérard:
Efficient Algorithms to Test Digital Convexity. DGCI 2019: 409-419 - [c14]Ahmed Abdelkader, Sunil Arya, Guilherme Dias da Fonseca, David M. Mount:
Approximate Nearest Neighbor Searching with Non-Euclidean and Weighted Distances. SODA 2019: 355-372 - [i12]Loïc Crombez, Guilherme Dias da Fonseca, Yan Gérard:
Efficient Algorithms to Test Digital Convexity. CoRR abs/1901.04738 (2019) - [i11]Rahul Arya, Sunil Arya, Guilherme Dias da Fonseca, David M. Mount:
Optimal Bound on the Combinatorial Complexity of Approximating Polytopes. CoRR abs/1910.14459 (2019) - 2018
- [j17]Sunil Arya, Guilherme Dias da Fonseca, David M. Mount:
Approximate Polytope Membership Queries. SIAM J. Comput. 47(1): 1-51 (2018) - [c13]Sunil Arya, Guilherme Dias da Fonseca, David M. Mount:
Approximate Convex Intersection Detection with Applications to Width and Minkowski Sums. ESA 2018: 3:1-3:14 - [i10]Sunil Arya, Guilherme Dias da Fonseca, David M. Mount:
Approximate Convex Intersection Detection with Applications to Width and Minkowski Sums. CoRR abs/1807.00484 (2018) - [i9]Loïc Crombez, Guilherme Dias da Fonseca, Yan Gérard:
Peeling Digital Potatoes. CoRR abs/1812.05410 (2018) - 2017
- [j16]Sunil Arya, Guilherme Dias da Fonseca, David M. Mount:
On the Combinatorial Complexity of Approximating Polytopes. Discret. Comput. Geom. 58(4): 849-870 (2017) - [j15]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): 255-276 (2017) - [c12]Sunil Arya, Guilherme Dias da Fonseca, David M. Mount:
Near-Optimal epsilon-Kernel Construction and Related Problems. SoCG 2017: 10:1-10:15 - [c11]Sunil Arya, Guilherme Dias da Fonseca, David M. Mount:
Optimal Approximate Polytope Membership. SODA 2017: 270-288 - [i8]Sunil Arya, Guilherme Dias da Fonseca, David M. Mount:
Near-Optimal ε-Kernel Construction and Related Problems. CoRR abs/1703.10868 (2017) - 2016
- [j14]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: 45-55 (2016) - [j13]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: 112-122 (2016) - [c10]Sunil Arya, Guilherme Dias da Fonseca, David M. Mount:
On the Combinatorial Complexity of Approximating Polytopes. SoCG 2016: 11:1-11:15 - [i7]Sunil Arya, Guilherme Dias da Fonseca, David M. Mount:
On the Combinatorial Complexity of Approximating Polytopes. CoRR abs/1604.01175 (2016) - [i6]Sunil Arya, Guilherme Dias da Fonseca, David M. Mount:
Approximate Polytope Membership Queries. CoRR abs/1604.01183 (2016) - [i5]Sunil Arya, Guilherme Dias da Fonseca, David M. Mount:
Optimal Approximate Polytope Membership. CoRR abs/1612.01696 (2016) - 2015
- [j12]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: 3-19 (2015) - 2014
- [j11]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: 70-81 (2014) - [c9]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: 132-143 - [i4]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 abs/1402.4722 (2014) - 2013
- [e1]Guilherme Dias da Fonseca, Thomas Lewiner, Luis Mariano Peñaranda, Timothy M. Chan, Rolf Klein:
Symposium on Computational Geometry 2013, SoCG '13, Rio de Janeiro, Brazil, June 17-20, 2013. ACM 2013, ISBN 978-1-4503-2031-3 [contents] - 2012
- [c8]Sunil Arya, Guilherme Dias da Fonseca, David M. Mount:
Optimal area-sensitive bounds for polytope approximation. SCG 2012: 363-372 - [c7]Sunil Arya, Guilherme Dias da Fonseca, David M. Mount:
Polytope approximation and the Mahler volume. SODA 2012: 29-42 - [c6]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: 82-92 - [i3]Emilio Vital Brazil, Guilherme Dias da Fonseca, Celina M. H. de Figueiredo:
The Cost of Perfection for Matchings in Graphs. CoRR abs/1204.2727 (2012) - [i2]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 abs/1204.3488 (2012) - 2011
- [j10]Guilherme Dias da Fonseca:
Fitting Flats to Points with Outliers. Int. J. Comput. Geom. Appl. 21(5): 559-569 (2011) - [j9]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): 2370-2379 (2011) - [c5]Sunil Arya, Guilherme Dias da Fonseca, David M. Mount:
Approximate polytope membership queries. STOC 2011: 579-586 - 2010
- [j8]Guilherme Dias da Fonseca, David M. Mount:
Approximate range searching: The absolute model. Comput. Geom. 43(4): 434-444 (2010) - [j7]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: 391-398 (2010) - [c4]Sunil Arya, Guilherme Dias da Fonseca, David M. Mount:
A Unified Approach to Approximate Proximity Searching. ESA (1) 2010: 374-385 - [i1]Vinícius G. P. de Sá, Guilherme Dias da Fonseca, Raphael Machado, Celina M. H. de Figueiredo:
Complexity dichotomy on partial grid recognition. CoRR abs/1006.3541 (2010)
2000 – 2009
- 2009
- [j6]Celina M. H. de Figueiredo, Guilherme Dias da Fonseca:
Enclosing weighted points with an almost-unit ball. Inf. Process. Lett. 109(21-22): 1216-1221 (2009) - 2008
- [c3]Sunil Arya, Guilherme Dias da Fonseca, David M. Mount:
Tradeoffs in Approximate Range Searching Made Simpler. SIBGRAPI 2008: 237-244 - 2007
- [c2]Guilherme Dias da Fonseca:
Approximate Range Searching: The Absolute Model. WADS 2007: 2-14 - 2006
- [j5]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): 149-180 (2006) - 2004
- [j4]Guilherme Dias da Fonseca, Celina M. H. de Figueiredo, Paulo Cezar Pinto Carvalho:
Kinetic hanger. Inf. Process. Lett. 89(3): 151-157 (2004) - [c1]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: 243-252 - 2003
- [j3]Guilherme Dias da Fonseca, Celina M. H. de Figueiredo:
Kinetic heap-ordered trees: Tight analysis and improved algorithms. Inf. Process. Lett. 85(3): 165-169 (2003) - [j2]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): 391-405 (2003) - 2001
- [j1]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: 14-17 (2001)
Coauthor Index
aka: Celina Miraglia Herrera de Figueiredo
aka: Yan Gerard
aka: Vinícius Gusmão Pereira de Sá
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-23 18:33 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
