Alexander Pilz

Alexander Pilz

Auto-generated profile, based on publicly available information

Alexander Pilz

Institute of Software Technology Graz University of Technology Austria

Research Focus & Metrics

Academic Career Length

18Years (2009-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
11 June 2015 in Discrete & Computational Geometry
Verified
Journal Article
Closed access
PDF file
OAOswin Aichholzer
Oswin Aichholzer
WMWolfgang Mulzer
Wolfgang Mulzer
APAlexander Pilz
Alexander Pilz

1 July 2014 in Computational Geometry
Verified
Journal Article
Closed access
APAlexander Pilz
Alexander Pilz

1 August 2017 in Information Processing Letters
Verified
Journal Article
Closed access
OAOswin Aichholzer
Oswin Aichholzer
THThomas Hackl
Thomas Hackl
MKMatias Korman
Matias Korman
MKMarc van Kreveld
Marc van Kreveld
MLMaarten Löffler
Maarten Löffler
EWEmo Welzl
Emo Welzl

1 January 2015 in Computational Geometry
Verified
Journal Article
Closed access
JDJosé Miguel Díaz-Báñez
José Miguel Díaz-Báñez
MKMatias Korman
Matias Korman
PPPablo Pérez-Lantero
Pablo Pérez-Lantero
APAlexander Pilz
Alexander Pilz
CSCarlos Seara
Carlos Seara
RSRodrigo Silveira
Rodrigo Silveira

1 July 2014 in Computational Geometry
Verified
Journal Article
Closed access
OAOswin Aichholzer
Oswin Aichholzer
RFRuy Fabila-Monroy
Ruy Fabila-Monroy
THThomas Hackl
Thomas Hackl
CHClemens Huemer
Clemens Huemer
APAlexander Pilz
Alexander Pilz
BVBirgit Vogtenhuber
Birgit Vogtenhuber

10 March 2015 in Graphs and Combinatorics
Verified
Journal Article
Open access
PDF file
OAOswin Aichholzer
Oswin Aichholzer
THThomas Hackl
Thomas Hackl
APAlexander Pilz
Alexander Pilz
PRPedro Ramos
Pedro Ramos
VSVera Sacristán
Vera Sacristán
BVBirgit Vogtenhuber
Birgit Vogtenhuber
A good drawing of a simple graph is a drawing on the sphere or, equivalently, in the plane in which vertices are drawn as distinct points, edges are drawn as Jordan arcs connecting their end vertices, and any pair of edges intersects at most once. In any good drawing, the edges of three pairwise connected vertices form a Jordan curve which we call a triangle. We say that a triangle is empty if one of the two connected components it induces does not contain any of the remaining vertices of the drawing of the graph. We show that the number of empty triangles in any good drawing of the complete graph \(K_n\) with \(n\) vertices is at least \(n\) .