Alexander Pilz‘s Publications

This list is also available as BiBTeX file.
[1]
Oswin Aichholzer, Alan Arroyo, Zuzana Masárová, Irene Parada, Daniel Perz, Alexander Pilz, Josef Tkadlec, and Birgit Vogtenhuber. On Compatible Matchings. Journal of Graph Algorithms and Applications, 26(2):225--240, 2022. [ bib | DOI ]
[2]
Oswin Aichholzer, Thomas Hackl, Maarten Löffler, Alexander Pilz, Irene Parada, Manfred Scheucher, and Birgit Vogtenhuber. Blocking Delaunay Triangulations from Exterior. In Proc. 38th European Workshop on Computational Geometry (EuroCG 2022), pages 9:1--9:7, Perugia, Italy, 2022. [ bib | arXiv | http ]
[3]
Oswin Aichholzer, Alan Arroyo, Zuzana Masárová, Irene Parada, Daniel Perz, Alexander Pilz, Josef Tkadlec, and Birgit Vogtenhuber. On Compatible Matchings. In Ryuhei Uehara, Seok-Hee Hong, and Subhas C. Nandy, editors, WALCOM: Algorithms and Computation, pages 221--233. Springer International Publishing, 2021. Best Paper Award. [ bib | DOI | arXiv ]
[4]
Oswin Aichholzer, Martin Balko, Michael Hoffmann, Jan Kynčl, Wolfgang Mulzer, Irene Parada, Alexander Pilz, Manfred Scheucher, Pavel Valtr, Birgit Vogtenhuber, and Emo Welzl. Minimal representations of order types by geometric graphs. Journal of Graph Algorithms and Applications, 24(4):551--572, 2020. special issue of the 27th International Symposium on Graph Drawing and Network Visualization GD2019. [ bib | DOI ]
[5]
Oswin Aichholzer, José Miguel Díaz-Báñez, Thomas Hackl, David Orden, Alexander Pilz, Inmaculada Ventura, and Birgit Vogtenhuber. Erdős-Szekeres-Type Games. In Proc. 35th European Workshop on Computational Geometry EuroCG '19, pages 23:1--23:7, Utrecht, The Netherlands, 2019. [ bib | .pdf | .pdf ]
[6]
Oswin Aichholzer, Carlos Alegría Galicia, Irene Parada, Alexander Pilz, Javier Tejel, Csaba D. Tóth, Jorge Urrutia, and Birgit Vogtenhuber. Hamiltonian meander paths and cycles on bichromatic point sets. In Proc. XVIII Encuentros de Geometría Computacional, pages 35--38, Girona, Spain, 2019. [ bib | .pdf | .pdf ]
[7]
Oswin Aichholzer, Carlos Alegría Galicia, Irene Parada, Alexander Pilz, Javier Tejel, Csaba D. Tóth, Jorge Urrutia, and Birgit Vogtenhuber. Hamiltonian meander paths and cycles on bichromatic point sets. In EasyChair Preprint no. 3130, 2019. [ bib | http ]
[8]
Oswin Aichholzer, Martin Balko, Michael Hoffmann, Jan Kynčl, Wolfgang Mulzer, Irene Parada, Alexander Pilz, Manfred Scheucher, Pavel Valtr, Birgit Vogtenhuber, and Emo Welzl. Minimal representations of order types by geometric graphs. In Graph Drawing and Network Visualization. GD 2019, volume 11904 of Lecture Notes in Computer Science (LNCS), pages 101--113, Prague, Czechia, 2019. [ bib | DOI | arXiv ]
[9]
Oswin Aichholzer, Thomas Hackl, Matias Korman, Alexander Pilz, André van Renssen, Marcel Roeloffzen, Günter Rote, and Birgit Vogtenhuber. Packing plane spanning graphs with short edges in complete geometric graphs. Computational Geometry, 782:1--15, 2019. [ bib | DOI | http | .pdf ]
[10]
Matias Korman, Stefan Langerman, Wolfgang Mulzer, Alexander Pilz, Maria Saumell, and Birgit Vogtenhuber. The dual diameter of triangulations. Computational Geometry: Theory and Applications, 68:243--252, 2018. Special Issue in Memory of Ferran Hurtado. [ bib | DOI | http ]
[11]
O. Aichholzer, M. Balko, T. Hackl, A. Pilz, P. Ramos, P. Valtr, and B. Vogtenhuber. Holes in 2-convex point sets. In Proc. 28th International Workshop on Combinatorial Algorithms (IWOCA2017), volume 10765 of Lecture Notes in Computer Science (LNCS), pages 169--181, Newcastle, Australia, 2018. [ bib | DOI ]
[12]
O. Aichholzer, M. Balko, T. Hackl, A. Pilz, P. Ramos, P. Valtr, and B. Vogtenhuber. Holes in 2-convex point sets. Computational Geometry: Theory and Applications, 74:38--49, 2018. [ bib | DOI ]
[13]
Oswin Aichholzer, Luis Barba, Thomas Hackl, Alexander Pilz, and Birgit Vogtenhuber. Linear Transformation Distance for Bichromatic Matchings. Computational Geometry: Theory and Applications, 68:77--88, 2018. Special Issue in Memory of Ferran Hurtado. [ bib | DOI | http | .pdf ]
[14]
Oswin Aichholzer, Martin Balko, Michael Hoffmann, Jan Kynčl, Wolfgang Mulzer, Irene Parada, Alexander Pilz, Manfred Scheucher, Pavel Valtr, Birgit Vogtenhuber, and Emo Welzl. Minimal Geometric Graph Representations of Order Types. In Proc. 34th European Workshop on Computational Geometry EuroCG '18, pages 21:1--21:6, Berlin, Germany, 2018. [ bib ]
[15]
O. Aichholzer, T. Hackl, M. Korman, M. van Kreveld, M. Löffler, A. Pilz, B. Speckmann, and E. Welzl. Packing Plane Spanning Trees and Paths in Complete Geometric Graphs. Information Processing Letters (IPL), 124:35--41, 2017. [ bib | DOI | .pdf ]
[16]
O. Aichholzer, A. Fischer, F. Fischer J.F. Meier, U. Pferschy, A. Pilz, and R. Stanek. Minimization and Maximization Versions of the Quadratic Traveling Salesman Problem. OPTIMIZATION, 66(4):521--546, 2017. [ bib | DOI | .pdf ]
[17]
Oswin Aichholzer, Florian Ebenführer, Irene Parada, Alexander Pilz, and Birgit Vogtenhuber. On semi-simple drawings of the complete graph. In Proc. XVII Encuentros de Geometría Computacional, pages 25--28, Alicante, Spain, 2017. [ bib | .pdf ]
[18]
O. Aichholzer, V. Kusters, W. Mulzer, A. Pilz, and M. Wettstein. An optimal algorithm for reconstructing point set order types from radial orderings. International Journal of Computational Geometry & Applications, 27(1--2):57--83, 2017. [ bib | DOI | arXiv | http ]
[19]
Oswin Aichholzer, Thomas Hackl, Matias Korman, Alexander Pilz, Günter Rote, André van Renssen, Marcel Roeloffzen, and Birgit Vogtenhuber. Packing Short Plane Spanning Trees in Complete Geometric Graphs. In Seok-Hee Hong, editor, 27th International Symposium on Algorithms and Computation (ISAAC 2016), volume 64 of Leibniz International Proceedings in Informatics (LIPIcs), pages 9:1--9:12, Dagstuhl, Germany, 2016. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik. [ bib | DOI | http ]
[20]
O. Aichholzer, M. Balko, T. Hackl, A. Pilz, P. Ramos, B. Vogtenhuber, and P. Valtr. Holes in two convex point sets. In Proc. 32st European Workshop on Computational Geometry EuroCG '16, pages 263--266, Lugano, Switzerland, 2016. [ bib | arXiv | .pdf ]
[21]
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) volume 51 of Leibniz International Proceedings in Informatics (LIPIcs), pages 7:1--7:16, Boston, USA, 2016. [ bib | DOI | arXiv | .pdf ]
[22]
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. [ bib | arXiv ]
[23]
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 '15, pages 57--60, Ljubljana, Slovenia, 2015. [ bib | .pdf ]
[24]
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. [ bib | DOI | .pdf ]
[25]
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. [ bib | DOI | arXiv | .pdf ]
[26]
O. Aichholzer, F. Aurenhammer, T. Hackl, C. Huemer, A. Pilz, and B. Vogtenhuber. 3-Colorability of Pseudo-Triangulations. Int'l Journal of Computational Geometry & Applications, 25(4):283--298, 2015. [ bib | DOI | .pdf ]
[27]
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. Comput. Geom., 48(1):14--29, 2015. [ bib | DOI | arXiv | http ]
[28]
Oswin Aichholzer, Wolfgang Mulzer, and Alexander Pilz. Flip Distance Between Triangulations of a Simple Polygon is NP-Complete. Discrete Comput. Geom., 54(2):368--389, 2015. [ bib | DOI | http ]
[29]
Alexander Pilz and Emo Welzl. Order on Order Types. In Proc. 31st International Symposium on Computational Geometry (SoCG 2015), pages 285--299, 2015. [ bib | DOI | http ]
[30]
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. [ bib | .pdf ]
[31]
Matias Korman, Stefan Langerman, Wolfgang Mulzer, Alexander Pilz, Maria Saumell, and Birgit Vogtenhuber. Minimum Dual Diameter Triangulations. In Proc. 30th European Workshop on Computational Geometry (EuroCG 2014), page online, March 2014. [ bib ]
[32]
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. [ bib | DOI | http | .pdf ]
[33]
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 '14, page online, Dead Sea, Israel, 2014. [ bib | .pdf ]
[34]
O. Aichholzer, T. Hackl, M. Korman, A. Pilz, and B. Vogtenhuber. Geodesic-preserving polygon simplification. Int'l Journal of Computational Geometry & Applications, 24(4):307--323, 2014. [ bib | DOI | .pdf ]
[35]
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. [ bib | .html | .pdf ]
[36]
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. Int'l Journal of Computational Geometry & Applications, 24(3):197--224, 2014. [ bib | DOI | arXiv | .pdf ]
[37]
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. [ bib | DOI | .pdf ]
[38]
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. [ bib | DOI | .pdf ]
[39]
Alexander Pilz. Flip Distance Between Triangulations of a Planar Point Set is APX-Hard. Comput. Geom., 47(5):589--604, 2014. [ bib | DOI | arXiv ]
[40]
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. [ bib | DOI | http | .pdf ]
[41]
Oswin Aichholzer, Matias Korman, Alexander Pilz, and Birgit Vogtenhuber. Geodesic Order Types. Algorithmica, 70(1):112--128, 2014. [ bib | DOI | arXiv | http | .pdf ]
[42]
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), page online, Halifax, Nova Scotia, Canada, 2014. [ bib | .pdf ]
[43]
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. [ bib | DOI | http ]
[44]
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. [ bib | .pdf ]
[45]
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. [ bib | .pdf ]
[46]
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. [ bib | arXiv | .pdf ]
[47]
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 2013, pages 131--134, Sevilla, Spain, 2013. [ bib | arXiv | .pdf ]
[48]
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. [ bib | DOI | .pdf ]
[49]
Oswin Aichholzer, Tillmann Miltzow, and Alexander Pilz. Extreme point and halving edge search in abstract order types. Comput. Geom., 46(8):970--978, 2013. [ bib | DOI ]
[50]
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. [ bib | DOI ]
[51]
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. [ bib ]
[52]
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. [ bib | DOI ]
[53]
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. [ bib | DOI | arXiv ]
[54]
Alexander Pilz. Augmentability to Cubic Graphs. In Proc. 28th European Workshop on Computational Geometry (EuroCG 2012), pages 29--32, Assisi, Italy, March 2012. [ bib ]
[55]
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. [ bib | .pdf ]
[56]
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. [ bib ]
[57]
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. [ bib | .pdf ]
[58]
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 '10, pages 21--24, Dortmund, Germany, 2010. [ bib | .pdf ]
[59]
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. [ bib | .pdf ]

This file was generated by bibtex2html 1.98.