Alexander Pilz

About

I am a postdoctoral researcher in the Theory of Combinatorial Algorithms Group lead by Emo Welzl at the Institute of Theoretical Computer Science, ETH Zürich, supported by an Erwin Schrödinger fellowship of the Austrian Science Foundation (FWF).

My research interests are algorithms and data structures, in particular computational geometry, and combinatorial geometry.

Contact

Alexander Pilz
Institute of Theoretical Computer Science
Department of Computer Science
ETH Zürich
Universitätsstrasse 6
8092 Zürich
Switzerland

Room: CAB G 38
Phone: +41 44 632 0434
E-mail: alexander.pilz(at)inf.ethz.ch

Entry at department

CV

  • February 2016 - present:
    Postdoctoral Researcher at the Institute of Theoretical Computer Science, ETH Zürich
  • March 2014 - December 2015:
    Research Assistant at Graz University of Technology
  • March 2014:
    PhD (Institute of Software Technology, Graz University of Technology; advisor Oswin Aichholzer)
  • March 2011 - February 2014:
    Recipient of a DOC-Fellowship of the Austrian Academy of Sciences at the Institute of Software Technology, Graz University of Technology
  • November 2009 - October 2010:
    Part Time Research Assistant, Graz University of Technology

Detailed CV

Publications

[1]
O. Aichholzer, M. Balko, T. Hackl, A. Pilz, P. Ramos, B. Vogtenhuber, and P. Valtr. Holes in 2-convex point sets. In Proc. 31st European Workshop on Computational Geometry (EuroCG 2016), page 4, Lugano, Switzerland, 2016. [pdf ]
[2]
O. Aichholzer, V. Alvarez, T. Hackl, A. Pilz, B. Speckmann, and B. Vogtenhuber. An improved lower bound on the number of triangulations. In Proc. 32nd Int. Sympos. Comput. Geom. (SoCG 2016) volume 51 of Leibniz International Proceedings in Informatics (LIPIcs), pages 7:1-7:16. [ DOI | pdf ]
[3]
O. Aichholzer, V. Kusters, W. Mulzer, A. Pilz, and M. Wettstein. An optimal algorithm for reconstructing point set order types from radial orderings. In Proceedings 26th Int. Symp. Algorithms and Computation (ISAAC 2015), pages 505-516, 2015. [arXiv:1507.08080]. [ DOI ]
[4]
B.M. Ábrego, O. Aichholzer, S. Fernández-Merchant, T. Hackl, J. Pammer, A. Pilz, P. Ramos, G. Salazar, and B. Vogtenhuber. All Good Drawings of Small Complete Graphs. In Proc. 31st European Workshop on Computational Geometry (EuroCG 2015), pages 57-60, Ljubljana, Slovenia, 2015. [ pdf ]
[5]
O. Aichholzer, T. Hackl, S. Lutteropp, T. Mchedlidze, A. Pilz, and B. Vogtenhuber. Monotone Simultaneous Embedding of Upward Planar Digraphs. Journal of Graph Algorithms and Applications, 19(1):87-110, 2015. [arXiv:1310.6955v2]. [ DOI | pdf ]
[6]
O. Aichholzer, T. Hackl, A. Pilz, P. Ramos, V. Sacristán, and B. Vogtenhuber. Empty triangles in good drawings of the complete graph. Graphs and Combinatorics, 31(2):335-345, 2015. For Springer Online First., [arXiv:1306.5081]. [ DOI | pdf ]
[7]
José Miguel Díaz-Báñez, Matias Korman, Pablo Pérez-Lantero, Alexander Pilz, Carlos Seara, and Rodrigo I. Silveira. New results on stabbing segments with a polygon. Computational Geometry: Theory and Applications, 48(1):14-29, 2015. [arXiv:1211.1490v3]. [ DOI | http ]
[8]
Oswin Aichholzer, Wolfgang Mulzer, and Alexander Pilz. Flip Distance Between Triangulations of a Simple Polygon is NP-Complete. Discrete & Computational Geometry, 54(2):368-389, 2015. [ DOI | http ]
[9]
Alexander Pilz and Emo Welzl. Order on Order Types. In Proc. 31st International Symposium on Computational Geometry (SoCG 2015), pages 285-299, 2015. [ DOI | http ]
[10]
Oswin Aichholzer, Thomas Hackl, Alexander Pilz, Gelasio Salazar, and Birgit Vogtenhuber. Deciding monotonicity of good drawings of the complete graph. In Proc. XVI Spanish Meeting on Computational Geometry (EGC 2015), pages 33-36, 2015. [ pdf ]
[11]
Matias Korman, Stefan Langerman, Wolfgang Mulzer, Alexander Pilz, Maria Saumell, and Birgit Vogtenhuber. The Dual Diameter of Triangulations. Computational Geometry: Theory and Applications, 2015. Accepted.
[12]
Matias Korman, Stefan Langerman, Wolfgang Mulzer, Alexander Pilz, and Birgit Vogtenhuber. Minimum Dual Diameter Triangulations. In Proc. 30th European Workshop on Computational Geometry (EuroCG 2014), online, March 2014.
[13]
O. Aichholzer, F. Aurenhammer, T. Hackl, F. Hurtado, A. Pilz, P. Ramos, J. Urrutia, P. Valtr, and B. Vogtenhuber. On k-Convex Point Sets. Computational Geometry: Theory and Applications, 47(8):809-832, 2014. [ DOI | http | pdf ]
[14]
O. Aichholzer, T. Hackl, S. Lutteropp, T. Mchedlidze, A. Pilz, and B. Vogtenhuber. Monotone Simultaneous Embedding of Directed Paths. In Proc. 30th European Workshop on Computational Geometry (EuroCG 2014), online, Dead Sea, Israel, 2014. [arXiv:1310.6955v2]. [ pdf ]
[15]
O. Aichholzer, T. Hackl, M. Korman, A. Pilz, and B. Vogtenhuber. Geodesic-preserving polygon simplification. International Journal of Computational Geometry & Applications, 24(4):307-323, 2014. [arXiv:1309.3858]. [ DOI | pdf ]
[16]
O. Aichholzer, J. Cardinal, T. Hackl, F. Hurtado, M. Korman, A. Pilz, R.I. Silveira, R. Uehara, B. Vogtenhuber, and E. Welzl. Cell-Paths in Mono- and Bichromatic Line Arrangements in the Plane. Discrete Mathematics & Theoretical Computer Science (DMTCS), 16(3):317-332, 2014. [ http | pdf ]
[17]
O. Aichholzer, T. Hackl, D. Orden, A. Pilz, M. Saumell, and B. Vogtenhuber. Flips in combinatorial pointed pseudo-triangulations with face degree at most four. International Journal of Computational Geometry & Applications, 24(3):197-224, 2014. [arXiv:1310.0833]. [ DOI | pdf ]
[18]
O. Aichholzer, R. Fabila-Monroy, T. Hackl, C. Huemer, A. Pilz, and B. Vogtenhuber. Lower bounds for the number of small convex k-holes. Computational Geometry: Theory and Applications, 47(5):605-613, 2014. [ DOI | pdf ]
[19]
O. Aichholzer, T. Hackl, M. Hoffmann, A. Pilz, G. Rote, B. Speckmann, and B. Vogtenhuber. Plane graphs with parity constraints. Graphs and Combinatorics, 30(1):47-69, 2014. For Springer Online First. [ DOI | pdf ]
[20]
Alexander Pilz. Flip Distance Between Triangulations of a Planar Point Set is APX-Hard. Computational Geometry: Theory and Applications, 47(5):589-604, 2014. [arXiv:1206.3179]. [ DOI ]
[21]
Oswin Aichholzer, Luis Barba, Thomas Hackl, Alexander Pilz, and Birgit Vogtenhuber. Linear Transformation Distance for Bichromatic Matchings. In Proc. 30th Symposium on Computational Geometry (SOCG 2014), pages 154-162. ACM, 2014. [arXiv:1312.0884v1]. [ DOI | http | pdf ]
[22]
Oswin Aichholzer, Matias Korman, Alexander Pilz, and Birgit Vogtenhuber. Geodesic Order Types. Algorithmica, 70(1):112-128, 2014. [ DOI | http ]
[23]
Oswin Aichholzer, Thomas Hackl, Matias Korman, Marc van Kreveld, Maarten Löffler, Alexander Pilz, Bettina Speckmann, and Emo Welzl. Packing Plane Spanning Trees and Paths in Complete Geometric Graphs. In Proc. 26th Annual Canadian Conference on Computational Geometry (CCCG 2014), online, Halifax, Nova Scotia, Canada, 2014. [ pdf ]
[24]
Stefan Felsner and Alexander Pilz. Ham-Sandwich Cuts for Abstract Order Types. In Algorithms and Computation - 25th International Symposium, ISAAC 2014, Jeonju, Korea, December 15-17, 2014, Proceedings, pages 726-737, 2014. [ DOI | http ]
[25]
O. Aichholzer, T. Hackl, M. Korman, A. Pilz, and B. Vogtenhuber. Geodesic-preserving polygon simplification. In Lecture Notes in Computer Science (LNCS), Proc. 24th Int. Symp. Algorithms and Computation (ISAAC 2013), volume 8283, pages 11-21, Hong Kong, China, 2013. Springer Verlag. [arXiv:1309.3858]. [ pdf ]
[26]
O. Aichholzer, J. Cardinal, T. Hackl, F. Hurtado, M. Korman, A. Pilz, R.I. Silveira, R. Uehara, B. Vogtenhuber, and E. Welzl. Cell-Paths in Mono- and Bichromatic Line Arrangements in the Plane. In Proc. 25th Annual Canadian Conference on Computational Geometry (CCCG 2013), pages 169-174, Waterloo, Ontario, Canada, 2013. [ pdf ]
[27]
O. Aichholzer, T. Hackl, A. Pilz, P. Ramos, V. Sacristán, and B. Vogtenhuber. Empty triangles in good drawings of the complete graph. In Mexican Conference on Discrete Mathematics and Computational Geometry, pages 21-29, Oaxaca, México, 2013. [arXiv:1306.5081]. [ pdf ]
[28]
O. Aichholzer, T. Hackl, D. Orden, A. Pilz, M. Saumell, and B. Vogtenhuber. Flips in combinatorial pointed pseudo-triangulations with face degree at most four (extended abstract). In Proc. 15th Spanish Meeting on Computational Geometry (EGC 2013), pages 131-134, Sevilla, Spain, 2013. [arXiv:1310.0833]. [ pdf ]
[29]
O. Aichholzer, R. Fabila-Monroy, T. Hackl, M. van Kreveld, A. Pilz, P. Ramos, and B. Vogtenhuber. Blocking Delaunay Triangulations. Computational Geometry: Theory and Applications, 46(2):154-159, 2013. [PMC:3587385]. [ DOI | pdf ]
[30]
Oswin Aichholzer, Tillmann Miltzow, and Alexander Pilz. Extreme point and halving edge search in abstract order types. Computational Geometry: Theory and Applications, 46(8):970-978, 2013. [ DOI ]
[31]
Oswin Aichholzer, Wolfgang Mulzer, and Alexander Pilz. Flip Distance between Triangulations of a Simple Polygon is NP-Complete. In Proc. 21st European Symposium on Algorithms (ESA 2013), pages 13-24, 2013. [ DOI ]
[32]
Oswin Aichholzer, Wolfgang Mulzer, and Alexander Pilz. Flip Distance between Triangulations of a Simple Polygon is NP-Complete. In Proc. 29th European Workshop on Computational Geometry (EuroCG 2013), pages 115-118, Braunschweig, Germany, 2013.
[33]
José Miguel Díaz-Báñez, Matias Korman, Pablo Pérez-Lantero, Alexander Pilz, Carlos Seara, and Rodrigo I. Silveira. New Results on Stabbing Segments with a Polygon. In Proc. 8th International Conference on Algorithms and Complexity (CIAC 2013), pages 146-157, 2013. [ DOI ]
[34]
Oswin Aichholzer, Matias Korman, Alexander Pilz, and Birgit Vogtenhuber. Geodesic Order Types. In Joachim Gudmundsson, Julián Mestre, and Taso Viglas, editors, Proc. 18th International Computing and Combinatorics Conference (COCOON 2012), volume 7434 of Lecture Notes in Computer Science, pages 216-227, Sydney, Australia, August 2012. Springer.
[35]
Alexander Pilz. Augmentability to Cubic Graphs. In Proc. 28th European Workshop on Computational Geometry (EuroCG 2012), pages 29-32, Assisi, Italy, March 2012.
[36]
O. Aichholzer, R. Fabila-Monroy, T. Hackl, C. Huemer, A. Pilz, and B. Vogtenhuber. Lower bounds for the number of small convex k-holes. In Proc. 24th Annual Canadian Conference on Computational Geometry (CCCG 2012), pages 247-252, Charlottetown, PEI, Canada, 2012. [ pdf ]
[37]
Tillmann Milzow and Alexander Pilz. Selection of Extreme Points and Halving Edges of a Set by its Chirotope. In Proc. 28th European Workshop on Computational Geometry (EuroCG 2012), pages 85-88, Assisi, Italy, march 2012.
[38]
O. Aichholzer, R. Fabila-Monroy, T. Hackl, M. van Kreveld, A. Pilz, P. Ramos, and B. Vogtenhuber. Blocking Delaunay Triangulations. In Proc. 22nd Annual Canadian Conference on Computational Geometry (CCCG 2010), pages 21-24, Winnipeg, Manitoba, Canada, 2010. [ pdf ]
[39]
O. Aichholzer, F. Aurenhammer, T. Hackl, C. Huemer, A. Pilz, and B. Vogtenhuber. 3-Colorability of Pseudo-Triangulations. In Proc. 26th European Workshop on Computational Geometry (EuroCG 2010), pages 21-24, Dortmund, Germany, 2010. [ pdf ]
[40]
O. Aichholzer, T. Hackl, M. Hoffmann, A. Pilz, G. Rote, B. Speckmann, and B. Vogtenhuber. Plane Graphs with Parity Constraints. In Lecture Notes in Computer Science (LNCS), Proc. 11th International Workshop on Algorithms and Data Structures (WADS), volume 5664, pages 13-24, Banff, Alberta, Canada, 2009. [ pdf ]

Entry in the dblp computer science bibliography