Clemens Huemer

Orcid: 0000-0001-7557-0823

Affiliations:
  • Polytechnic University of Catalonia, Barcelona, Spain


According to our database1, Clemens Huemer authored at least 57 papers between 2005 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
The edge labeling of higher order Voronoi diagrams.
J. Glob. Optim., October, 2024

Sibson's formula for higher order Voronoi diagrams.
CoRR, 2024

2023
Matching random colored points with rectangles.
J. Comb. Optim., March, 2023

On maximum-sum matchings of points.
J. Glob. Optim., 2023

On polynomials associated to Voronoi diagrams of point sets and crossing numbers.
CoRR, 2023

2022
On Weighted Sums of Numbers of Convex Polygons in Point Sets.
Discret. Comput. Geom., 2022

Voronoi Diagrams of Arbitrary Order on the Sphere.
CoRR, 2022

2021
On circles enclosing many points.
Discret. Math., 2021

New cyclic Kautz digraphs with optimal diameter.
Contributions Discret. Math., 2021

2020
The intersection graph of the disks with diameters the sides of a convex n-gon.
Discret. Math., 2020

New production matrices for geometric graphs.
CoRR, 2020

2019
Matching points with disks with a common intersection.
Discret. Math., 2019

A new lower bound on the maximum number of plane graphs using production matrices.
Comput. Geom., 2019

2018
New results on production matrices for geometric graphs.
Electron. Notes Discret. Math., 2018

Optimal Grid Drawings of Complete Multipartite Graphs and an Integer Variant of the Algebraic Connectivity.
Proceedings of the Graph Drawing and Network Visualization - 26th International Symposium, 2018

2017
Characteristic polynomials of production matrices for geometric graphs.
Electron. Notes Discret. Math., 2017

Carathéodory's Theorem in Depth.
Discret. Comput. Geom., 2017

2016
Production matrices for geometric graphs.
Electron. Notes Discret. Math., 2016

2015
3-Colorability of Pseudo-Triangulations.
Int. J. Comput. Geom. Appl., 2015

The Diameter of Cyclic Kautz Digraphs.
Electron. Notes Discret. Math., 2015

Lower bounds on the maximum number of non-crossing acyclic graphs.
Eur. J. Comb., 2015

On k-gons and k-holes in point sets.
Comput. Geom., 2015

2014
Note on the number of obtuse angles in Point Sets.
Int. J. Comput. Geom. Appl., 2014

The number of empty four-gons in random point sets.
Electron. Notes Discret. Math., 2014

The degree/diameter problem in maximal planar bipartite graphs.
Electron. Notes Discret. Math., 2014

Empty Monochromatic Simplices.
Discret. Comput. Geom., 2014

Compatible spanning trees.
Comput. Geom., 2014

Lower bounds for the number of small convex k-holes.
Comput. Geom., 2014

4-Holes in point sets.
Comput. Geom., 2014

2013
The Edge Rotation Graph.
Graphs Comb., 2013

On the Number of Edges in Geometric Graphs Without Empty Triangles.
Graphs Comb., 2013

Maximizing maximal angles for plane straight-line graphs.
Comput. Geom., 2013

2012
Token Graphs.
Graphs Comb., 2012

4-labelings and grid embeddings of plane quadrangulations.
Discret. Math., 2012

On the Fiedler value of large planar graphs
CoRR, 2012

2011
A combinatorial property on angular orders of plane point sets.
Inf. Process. Lett., 2011

On the Fiedler value of large planar graphs (Extended abstract).
Electron. Notes Discret. Math., 2011

Covering Islands in Plane Point Sets.
Proceedings of the Computational Geometry - XIV Spanish Meeting on Computational Geometry, 2011

2010
Large Bichromatic Point Sets Admit Empty Monochromatic 4-Gons.
SIAM J. Discret. Math., 2010

Binary Labelings for Plane Quadrangulations and their Relatives.
Discret. Math. Theor. Comput. Sci., 2010

Edge-Removal and Non-Crossing Configurations in Geometric Graphs.
Discret. Math. Theor. Comput. Sci., 2010

2009
On the Chromatic Number of some Flip Graphs.
Discret. Math. Theor. Comput. Sci., 2009

Gray codes for non-crossing partitions and dissections of a convex polygon.
Discret. Appl. Math., 2009

On triconnected and cubic plane graphs on given point sets.
Comput. Geom., 2009

Empty monochromatic triangles.
Comput. Geom., 2009

Compatible geometric matchings.
Comput. Geom., 2009

2008
The rotation graph of k.
Inf. Process. Lett., 2008

Triangulations without pointed spanning trees.
Comput. Geom., 2008

Matching edges and faces in polygonal partitions.
Comput. Geom., 2008

2007
Decompositions, Partitions, and Coverings with Convex Polygons and Pseudo-Triangles.
Graphs Comb., 2007

On the Number of Plane Geometric Graphs.
Graphs Comb., 2007

Gray Code Enumeration of Plane Straight-Line Graphs.
Graphs Comb., 2007

On embedding triconnected cubic graphs on point sets.
Electron. Notes Discret. Math., 2007

Connecting colored point sets.
Discret. Appl. Math., 2007

2006
Transforming spanning trees and pseudo-triangulations.
Inf. Process. Lett., 2006

On the number of plane graphs.
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

2005
On pseudo-convex decompositions, partitions, and coverings.
Proceedings of the (Informal) Proceedings of the 21st European Workshop on Computational Geometry, 2005


  Loading...