Follow
Clemens Huemer
Title
Cited by
Cited by
Year
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
672007
Compatible geometric matchings
O Aichholzer, S Bereg, A Dumitrescu, A García, C Huemer, F Hurtado, ...
Computational Geometry 42 (6), 617-626, 2009
612009
Token graphs
R Fabila-Monroy, D Flores-Peñaloza, C Huemer, F Hurtado, J Urrutia, ...
Graphs and Combinatorics 28 (3), 365-380, 2012
492012
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
422010
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
312006
Empty monochromatic triangles
O Aichholzer, R Fabila-Monroy, D Flores-Penaloza, T Hackl, C Huemer, ...
Computational Geometry 42 (9), 934-938, 2009
302009
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
282010
Gray code enumeration of plane straight-line graphs
O Aichholzer, F Aurenhammer, C Huemer, B Vogtenhuber
Graphs and Combinatorics 23 (5), 467-479, 2007
242007
Transforming spanning trees and pseudo-triangulations
O Aichholzer, F Aurenhammer, C Huemer, H Krasser
Information Processing Letters 97 (1), 19-22, 2006
232006
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
202015
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
202009
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
172009
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
172007
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
162014
Triangulations without pointed spanning trees
O Aichholzer, C Huemer, H Krasser
Computational Geometry 40 (1), 79-83, 2008
162008
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
152014
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
132009
On the Fiedler value of large planar graphs
L Barriere, C Huemer, D Mitsche, D Orden
Linear Algebra and its Applications 439 (7), 2070-2084, 2013
122013
Maximizing maximal angles for plane straight-line graphs
O Aichholzer, T Hackl, M Hoffmann, C Huemer, A Pór, F Santos, ...
Computational Geometry 46 (1), 17-28, 2013
112013
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
112008
The system can't perform the operation now. Try again later.
Articles 1–20