On pseudo-convex decompositions, partitions, and coverings. - Oswin Aichholzer; Clemens Huemer; Sarah Renkl; Bettina Speckmann; Csaba D. Tóth (EuroCG, 2005)

On the number of plane graphs. - Oswin Aichholzer; Thomas Hackl; Birgit Vogtenhuber; Clemens Huemer; Ferran Hurtado; Hannes Krasser (SODA, 2006)

Transforming spanning trees and pseudo-triangulations. - Oswin Aichholzer; Franz Aurenhammer; Clemens Huemer; Hannes Krasser (Inf. Process. Lett., 2006)

Connecting colored point sets. - Oswin Aichholzer; Franz Aurenhammer; Thomas Hackl; Clemens Huemer (Discret. Appl. Math., 2007)

On embedding triconnected cubic graphs on point sets. - Alfredo García Olaverri; Ferran Hurtado; Clemens Huemer; Javier Tejel; Pavel Valtr 001 (Electron. Notes Discret. Math., 2007)

Gray Code Enumeration of Plane Straight-Line Graphs. - Oswin Aichholzer; Franz Aurenhammer; Clemens Huemer; Birgit Vogtenhuber (Graphs Comb., 2007)

On the Number of Plane Geometric Graphs. - Oswin Aichholzer; Thomas Hackl; Clemens Huemer; Ferran Hurtado; Hannes Krasser; Birgit Vogtenhuber (Graphs Comb., 2007)

Decompositions, Partitions, and Coverings with Convex Polygons and Pseudo-Triangles. - Oswin Aichholzer; Clemens Huemer; Sarah Kappes; Bettina Speckmann; Csaba D. Tóth (Graphs Comb., 2007)

Matching edges and faces in polygonal partitions. - Oswin Aichholzer; Franz Aurenhammer; Paola Gonzalez-Nava; Thomas Hackl; Clemens Huemer; Ferran Hurtado; Hannes Krasser; Saurabh Ray; Birgit Vogtenhuber (Comput. Geom., 2008)

Triangulations without pointed spanning trees. - Oswin Aichholzer; Clemens Huemer; Hannes Krasser (Comput. Geom., 2008)

The rotation graph of k. - Clemens Huemer; Ferran Hurtado; Julian Pfeifle (Inf. Process. Lett., 2008)

Compatible geometric matchings. - Oswin Aichholzer; Sergey Bereg; Adrian Dumitrescu; Alfredo García Olaverri; Clemens Huemer; Ferran Hurtado; Mikio Kano; Alberto Márquez 001; David Rappaport; Shakhar Smorodinsky; Diane L. Souvaine; Jorge Urrutia; et al. (Comput. Geom., 2009)

Empty monochromatic triangles. - Oswin Aichholzer; Ruy Fabila Monroy; David Flores-Peñaloza; Thomas Hackl; Clemens Huemer; Jorge Urrutia (Comput. Geom., 2009)

On triconnected and cubic plane graphs on given point sets. - Alfredo García Olaverri; Ferran Hurtado; Clemens Huemer; Javier Tejel; Pavel Valtr 001 (Comput. Geom., 2009)

Gray codes for non-crossing partitions and dissections of a convex polygon. - Clemens Huemer; Ferran Hurtado; Marc Noy; Elsa Omaña-Pulido (Discret. Appl. Math., 2009)

On the Chromatic Number of some Flip Graphs. - Ruy Fabila Monroy; David Flores-Peñaloza; Clemens Huemer; Ferran Hurtado; David R. Wood; Jorge Urrutia (Discret. Math. Theor. Comput. Sci., 2009)

Edge-Removal and Non-Crossing Configurations in Geometric Graphs. - Oswin Aichholzer; Sergio Cabello; Ruy Fabila Monroy; David Flores-Peñaloza; Thomas Hackl; Clemens Huemer; Ferran Hurtado; David R. Wood (Discret. Math. Theor. Comput. Sci., 2010)

Binary Labelings for Plane Quadrangulations and their Relatives. - Stefan Felsner; Clemens Huemer; Sarah Kappes; David Orden (Discret. Math. Theor. Comput. Sci., 2010)

Large Bichromatic Point Sets Admit Empty Monochromatic 4-Gons. - Oswin Aichholzer; Thomas Hackl; Clemens Huemer; Ferran Hurtado; Birgit Vogtenhuber (SIAM J. Discret. Math., 2010)

Covering Islands in Plane Point Sets. - Ruy Fabila Monroy; Clemens Huemer (EGC, 2011)

On the Fiedler value of large planar graphs (Extended abstract). - Lali Barrière; Clemens Huemer; Dieter Mitsche; David Orden (Electron. Notes Discret. Math., 2011)

A combinatorial property on angular orders of plane point sets. - Ruy Fabila Monroy; Clemens Huemer; Dolores Lara (Inf. Process. Lett., 2011)

On the Fiedler value of large planar graphs - Lali Barrière; Clemens Huemer; Dieter Mitsche; David Orden (CoRR, 2012)

4-labelings and grid embeddings of plane quadrangulations. - Lali Barrière; Clemens Huemer (Discret. Math., 2012)

Token Graphs. - Ruy Fabila Monroy; David Flores-Peñaloza; Clemens Huemer; Ferran Hurtado; Jorge Urrutia; David R. Wood (Graphs Comb., 2012)

Maximizing maximal angles for plane straight-line graphs. - Oswin Aichholzer; Thomas Hackl; Michael Hoffmann 001; Clemens Huemer; Attila Pór; Francisco Santos; Bettina Speckmann; Birgit Vogtenhuber (Comput. Geom., 2013)

On the Number of Edges in Geometric Graphs Without Empty Triangles. - Crevel Bautista-Santiago; Marco A. Heredia; Clemens Huemer; Adriana Ramírez-Vigueras; Carlos Seara; Jorge Urrutia (Graphs Comb., 2013)

The Edge Rotation Graph. - Javier Cano; José Miguel Díaz-Báñez; Clemens Huemer; Jorge Urrutia (Graphs Comb., 2013)

4-Holes in point sets. - Oswin Aichholzer; Ruy Fabila Monroy; Hernán González-Aguilar; Thomas Hackl; Marco A. Heredia; Clemens Huemer; Jorge Urrutia; Birgit Vogtenhuber (Comput. Geom., 2014)

Lower bounds for the number of small convex k-holes. - Oswin Aichholzer; Ruy Fabila Monroy; Thomas Hackl; Clemens Huemer; Alexander Pilz; Birgit Vogtenhuber (Comput. Geom., 2014)

Compatible spanning trees. - Alfredo García Olaverri; Clemens Huemer; Ferran Hurtado; Javier Tejel (Comput. Geom., 2014)

Empty Monochromatic Simplices. - Oswin Aichholzer; Ruy Fabila Monroy; Thomas Hackl; Clemens Huemer; Jorge Urrutia (Discret. Comput. Geom., 2014)

The degree/diameter problem in maximal planar bipartite graphs. - Cristina Dalfó; Clemens Huemer; Julián Salas (Electron. Notes Discret. Math., 2014)

The number of empty four-gons in random point sets. - Ruy Fabila Monroy; Clemens Huemer; Dieter Mitsche (Electron. Notes Discret. Math., 2014)

Note on the number of obtuse angles in Point Sets. - Ruy Fabila Monroy; Clemens Huemer; Eulàlia Tramuns (Int. J. Comput. Geom. Appl., 2014)

On k-gons and k-holes in point sets. - Oswin Aichholzer; Ruy Fabila Monroy; Hernán González-Aguilar; Thomas Hackl; Marco A. Heredia; Clemens Huemer; Jorge Urrutia; Pavel Valtr 001; Birgit Vogtenhuber (Comput. Geom., 2015)

Lower bounds on the maximum number of non-crossing acyclic graphs. - Clemens Huemer; Anna de Mier (Eur. J. Comb., 2015)

The Diameter of Cyclic Kautz Digraphs. - Katerina Böhmová; Cristina Dalfó; Clemens Huemer (Electron. Notes Discret. Math., 2015)

3-Colorability of Pseudo-Triangulations. - Oswin Aichholzer; Franz Aurenhammer; Thomas Hackl; Clemens Huemer; Alexander Pilz; Birgit Vogtenhuber (Int. J. Comput. Geom. Appl., 2015)

Production matrices for geometric graphs. - Clemens Huemer; Carlos Seara; Rodrigo I. Silveira; Alexander Pilz (Electron. Notes Discret. Math., 2016)

Carathéodory's Theorem in Depth. - Ruy Fabila Monroy; Clemens Huemer (Discret. Comput. Geom., 2017)

Characteristic polynomials of production matrices for geometric graphs. - Clemens Huemer; Alexander Pilz; Carlos Seara; Rodrigo I. Silveira (Electron. Notes Discret. Math., 2017)

Optimal Grid Drawings of Complete Multipartite Graphs and an Integer Variant of the Algebraic Connectivity. - Ruy Fabila Monroy; Carlos Hidalgo-Toscano; Clemens Huemer; Dolores Lara; Dieter Mitsche (GD, 2018)

New results on production matrices for geometric graphs. - Guillermo Esteban; Clemens Huemer; Rodrigo I. Silveira (Electron. Notes Discret. Math., 2018)

A new lower bound on the maximum number of plane graphs using production matrices. - Clemens Huemer; Alexander Pilz; Rodrigo I. Silveira (Comput. Geom., 2019)

Matching points with disks with a common intersection. - Clemens Huemer; Pablo Pérez-Lantero; Carlos Seara; Rodrigo I. Silveira (Discret. Math., 2019)

New production matrices for geometric graphs. - Guillermo Esteban; Clemens Huemer; Rodrigo I. Silveira (CoRR, 2020)

The intersection graph of the disks with diameters the sides of a convex n-gon. - Clemens Huemer; Pablo Pérez-Lantero (Discret. Math., 2020)

New cyclic Kautz digraphs with optimal diameter. - Katherina Böhmova; Cristina Dalfó; Clemens Huemer (Contributions Discret. Math., 2021)

On circles enclosing many points. - Mercè Claverol; Clemens Huemer; Alejandra Martínez-Moraian (Discret. Math., 2021)

Voronoi Diagrams of Arbitrary Order on the Sphere. - Mercè Claverol; Andrea de las Heras Parrilla; Clemens Huemer (CoRR, 2022)

On Weighted Sums of Numbers of Convex Polygons in Point Sets. - Clemens Huemer; Déborah Oliveros; Pablo Pérez-Lantero; Ferran Torra Clotet; Birgit Vogtenhuber (Discret. Comput. Geom., 2022)

On maximum-sum matchings of points. - Sergey Bereg; Oscar Chacón-Rivera; David Flores-Peñaloza; Clemens Huemer; Pablo Pérez-Lantero; Carlos Seara (J. Glob. Optim., 2023)

Matching random colored points with rectangles. - Josué Corujo; David Flores-Peñaloza; Clemens Huemer; Pablo Pérez-Lantero; Carlos Seara (J. Comb. Optim., 2023)

On polynomials associated to Voronoi diagrams of point sets and crossing numbers. - Mercè Claverol; Andrea de las Heras Parrilla; David Flores-Peñaloza; Clemens Huemer; David Orden (Discret. Math. Theor. Comput. Sci., 2024)

The edge labeling of higher order Voronoi diagrams. - Mercè Claverol; Andrea de las Heras Parrilla; Clemens Huemer; Alejandra Martínez-Moraian (J. Glob. Optim., 2024)

Sibson's formula for higher order Voronoi diagrams. - Mercè Claverol; Andrea de las Heras Parrilla; Clemens Huemer; Dolores Lara (Comput. Aided Geom. Des., 2025)