| Token graphs R Fabila-Monroy, D Flores-Peñaloza, C Huemer, F Hurtado, J Urrutia, ... Graphs and Combinatorics 28 (3), 365-380, 2012 | 79 | 2012 |
| Compatible geometric matchings O Aichholzer, S Bereg, A Dumitrescu, A García, C Huemer, F Hurtado, ... Computational Geometry 42 (6), 617-626, 2009 | 67 | 2009 |
| On the number of plane geometric graphs O Aichholzer, T Hackl, C Huemer, F Hurtado, H Krasser, B Vogtenhuber Graphs and Combinatorics 23 (1), 67-84, 2007 | 66 | 2007 |
| Edge-removal and non-crossing configurations in geometric graphs O Aichholzer, S Cabello, R Fabila-Monroy, D Flores-Penaloza, T Hackl, ... Discrete Mathematics and Theoretical Computer Science 12 (1), 75-86, 2010 | 45 | 2010 |
| Large bichromatic point sets admit empty monochromatic 4-gons O Aichholzer, T Hackl, C Huemer, F Hurtado, B Vogtenhuber SIAM Journal on Discrete Mathematics 23 (4), 2147-2155, 2010 | 34 | 2010 |
| Empty monochromatic triangles O Aichholzer, R Fabila-Monroy, D Flores-Penaloza, T Hackl, C Huemer, ... Computational Geometry 42 (9), 934-938, 2009 | 33 | 2009 |
| On the number of plane graphs O Aichholzer, T Hackl, B Vogtenhuber, C Huemer, F Hurtado, H Krasser Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete …, 2006 | 31 | 2006 |
| On the Laplacian spectra of token graphs C Dalfó, F Duque, R Fabila-Monroy, MA Fiol, C Huemer, ... Linear Algebra and its Applications 625, 322-348, 2021 | 26 | 2021 |
| Gray code enumeration of plane straight-line graphs O Aichholzer, F Aurenhammer, C Huemer, B Vogtenhuber Graphs and Combinatorics 23 (5), 467-479, 2007 | 26 | 2007 |
| On k-gons and k-holes in point sets O Aichholzer, R Fabila-Monroy, H González-Aguilar, T Hackl, MA Heredia, ... Computational Geometry 48 (7), 528-537, 2015 | 25 | 2015 |
| Transforming spanning trees and pseudo-triangulations O Aichholzer, F Aurenhammer, C Huemer, H Krasser Information Processing Letters 97 (1), 19-22, 2006 | 25 | 2006 |
| 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 | 22 | 2009 |
| On the chromatic number of some flip graphs R Fabila-Monroy, D Flores-Penaloza, C Huemer, F Hurtado, J Urrutia, ... Discrete Mathematics and Theoretical Computer Science 11 (2), 47--56, 2009 | 20 | 2009 |
| Gray codes for non-crossing partitions and dissections of a convex polygon C Huemer, F Hurtado, M Noy, E Omaña-Pulido Discrete Applied Mathematics 157 (7), 1509-1520, 2009 | 18 | 2009 |
| 4-holes in point sets O Aichholzer, R Fabila-Monroy, H González-Aguilar, T Hackl, MA Heredia, ... Computational Geometry 47 (6), 644-650, 2014 | 17 | 2014 |
| Triangulations without pointed spanning trees O Aichholzer, C Huemer, H Krasser Computational Geometry 40 (1), 79-83, 2008 | 17 | 2008 |
| Decompositions, partitions, and coverings with convex polygons and pseudo-triangles O Aichholzer, C Huemer, S Kappes, B Speckmann, CD Tóth Graphs and Combinatorics 23 (5), 481-507, 2007 | 17 | 2007 |
| Lower bounds for the number of small convex k-holes O Aichholzer, R Fabila-Monroy, T Hackl, C Huemer, A Pilz, ... Computational Geometry 47 (5), 605-613, 2014 | 16 | 2014 |
| Lower bounds for the colored mixed chromatic number of some classes of graphs R Fabila-Monroy, D Flores, C Huemer, A Montejano Comment. Math. Univ. Carolin 49 (4), 637-645, 2008 | 16 | 2008 |
| Matching points with disks with a common intersection C Huemer, P Pérez-Lantero, C Seara, RI Silveira Discrete Mathematics 342 (7), 1885-1893, 2019 | 15 | 2019 |
