Lower bounds on the number of crossing-free subgraphs of KN A Garcıa, M Noy, J Tejel
Computational Geometry 16 (4), 211-221, 2000
130 2000 A note on the traveling repairman problem A Garcia, P Jodrá, J Tejel
Networks: An International Journal 40 (1), 27-31, 2002
71 2002 Compatible geometric matchings O Aichholzer, S Bereg, A Dumitrescu, A García, C Huemer, F Hurtado, ...
Computational Geometry 42 (6-7), 617-626, 2009
65 2009 Augmenting the connectivity of geometric graphs M Abellanas, A García, F Hurtado, J Tejel, J Urrutia
Computational Geometry 40 (3), 220-230, 2008
56 2008 Moving coins M Abellanas, S Bereg, F Hurtado, AG Olaverri, D Rappaport, J Tejel
Computational Geometry 34 (1), 35-48, 2006
37 2006 Caminos alternantes M Abellanas, A Garcıa, F Hurtado, J Tejel
Actas X Encuentros de Geometria Computacional (in Spanish), Sevilla, 7-12, 2003
30 2003 Packing trees into planar graphs A García, C Hernando, F Hurtado, M Noy, J Tejel
Journal of Graph Theory 40 (3), 172-181, 2002
29 2002 Augmenting the Rigidity of a Graph in R 2 A García, J Tejel
Algorithmica 59 (2), 145-168, 2011
27 2011 On triconnected and cubic plane graphs on given point sets A García, F Hurtado, C Huemer, J Tejel, P Valtr
Computational Geometry 42 (9), 913-922, 2009
21 2009 A note on the number of empty triangles A García
Computational Geometry: XIV Spanish Meeting on Computational Geometry, EGC …, 2012
14 2012 Polynomially solvable cases of the bipartite traveling salesman problem A García, J Tejel
European Journal of Operational Research 257 (2), 429-438, 2017
13 2017 Packing plane spanning trees into a point set A Biniaz, A García
Computational Geometry 90, 101653, 2020
12 2020 Compatible matchings in geometric graphs O Aichholzer, A García Olaverri, FA Hurtado Díaz, FJ Tejel Altarriba
Actas de los XIV Encuentros de Geometría Computacional, 145-148, 2011
11 2011 Augmenting the connectivity of outerplanar graphs A García, F Hurtado, M Noy, J Tejel
Algorithmica 56 (2), 160, 2010
11 2010 A lower bound for the number of polygonizations of N points in the plane A García, J Tejel
Ars Combinatoria 49, 3-19, 1998
9 * 1998 Twisted ways to find plane structures in simple drawings of complete graphs O Aichholzer, A García, J Tejel, B Vogtenhuber, A Weinberger
arXiv preprint arXiv:2203.06143, 2022
8 2022 On Hamiltonian alternating cycles and paths M Claverol, A García, D Garijo, C Seara, J Tejel
Computational Geometry 68, 146-166, 2018
8 2018 Blocking the J Cano, A García, F Hurtado, T Sakai, J Tejel, J Urrutia
Graphs and combinatorics 31 (5), 1271-1287, 2015
8 2015 Geometric biplane graphs II: Graph augmentation A García, F Hurtado, M Korman, I Matos, M Saumell, RI Silveira, J Tejel, ...
Graphs and Combinatorics 31 (2), 427-452, 2015
8 2015 Geometric biplane graphs II: Graph augmentation A García, F Hurtado, M Korman, I Matos, M Saumell, RI Silveira, J Tejel, ...
Graphs and Combinatorics 31 (2), 427-452, 2015
8 2015 
Jorge UrrutiaInstituto de Matematicas, Universidad Nacional Autonoma de MexicoVerifisert e-postadresse på matem.unam.mx
