International Symposium on Computational Geometry, SoCG 2017


Article Details
Title: A Superlinear Lower Bound on the Number of 5-Holes
Article URLs:
Alternative Article URLs:
Authors: Oswin Aichholzer
  • Graz University of Technology, Institute for Software Technology
Martin Balko
  • Charles University, Department of Applied Mathematics
  • Charles University, Institute for Theoretical Computer Science
  • Charles University, Faculty of Mathematics and Physics
  • Hungarian Academy of Sciences, Alfréd Rényi Institute of Mathematics
Thomas Hackl
  • Graz University of Technology, Institute for Software Technology
Jan Kyncl
  • Charles University, Department of Applied Mathematics
  • Charles University, Institute for Theoretical Computer Science
  • Charles University, Faculty of Mathematics and Physics
Irene Parada
  • Graz University of Technology, Institute for Software Technology
Manfred Scheucher
  • Graz University of Technology, Institute for Software Technology
  • Hungarian Academy of Sciences, Alfréd Rényi Institute of Mathematics
Pavel Valtr
  • Charles University, Department of Applied Mathematics
  • Charles University, Institute for Theoretical Computer Science
  • Charles University, Faculty of Mathematics and Physics
  • Hungarian Academy of Sciences, Alfréd Rényi Institute of Mathematics
Birgit Vogtenhuber
  • Graz University of Technology, Institute for Software Technology
Sharing: Unknown
Verification: Authors have not verified information
Artifact Evaluation Badge: none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers:
DBLP Key: conf/compgeom/AichholzerBHKPS17
Author Comments:

Discuss this paper and its artifacts below