Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Guilherme Dias da Fonseca
2010 – today
- 2012
[c8]Sunil Arya, Guilherme Dias da Fonseca, David M. Mount: Optimal area-sensitive bounds for polytope approximation. Symposium on Computational Geometry 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. Herrera 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. Herrera de Figueiredo: The Cost of Perfection for Matchings in Graphs. CoRR abs/1204.2727 (2012)
- [i2]Guilherme Dias da Fonseca, Celina M. Herrera 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. Geometry Appl. 21(5): 559-569 (2011)
- [j9]Vinícius G. P. de Sá, Guilherme Dias da Fonseca, Raphael C. S. Machado, Celina M. Herrera 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. Herrera de Figueiredo, Guilherme Dias da Fonseca, Raphael Machado: Complexity dichotomy on degree-constrained VLSI layouts with unit-length edges. Electronic Notes in Discrete Mathematics 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. Herrera de Figueiredo: Complexity dichotomy on partial grid recognition. CoRR abs/1006.3541 (2010)
2000 – 2009
- 2009
- [j6]Celina M. Herrera 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]
- 2006
- [j5]Celina M. Herrera de Figueiredo, Guilherme Dias da Fonseca, Vinícius G. P. de Sá, Jeremy Spinrad: Algorithms for the Homogeneous Set Sandwich Problem. Algorithmica 46(2): 149-180 (2006)
- 2004
- [j4]Guilherme Dias da Fonseca, Celina M. Herrera de Figueiredo, Paulo Cezar Pinto Carvalho: Kinetic hanger. Inf. Process. Lett. 89(3): 151-157 (2004)
- [c1]Celina M. Herrera de Figueiredo, Guilherme Dias da Fonseca, Vinícius G. P. de Sá, Jeremy Spinrad: Faster Deterministic and Randomized Algorithms on the Homogeneous Set Sandwich Problem. WEA 2004: 243-252
- 2003
- [j3]Guilherme Dias da Fonseca, Celina M. Herrera de Figueiredo: Kinetic heap-ordered trees: Tight analysis and improved algorithms. Inf. Process. Lett. 85(3): 165-169 (2003)
- [j2]Vânia M. F. Dias, Guilherme Dias da Fonseca, Celina M. Herrera 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. Dias, Guilherme Dias da Fonseca, Celina M. Herrera de Figueiredo, Jayme Luiz Szwarcfiter: Stable marriages with restricted pairs. Electronic Notes in Discrete Mathematics 7: 14-17 (2001)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-05-29 22:27 CEST by the dblp team