Oswin Aichholzer‘s Publications

This list is also available as BiBTeX file.
[1]
Oswin Aichholzer, Alfredo García, Javier Tejel, Birgit Vogtenhuber, and Alexandra Weinberger. Twisted Ways to Find Plane Structures in Simple Drawings of Complete Graphs. Discrete & Computational Geometry, 71:40--66, 2024. [ bib | DOI ]
[2]
Bernardo M. Ábrego, Oswin Aichholzer, Silvia Fernández-Merchant, Jesús Leaños, and Gelasio Salazar. There is a unique crossing-minimal rectilinear drawing of K18. Ars Mathematica Contemporanea, 24:1--29, 2024. [ bib | DOI ]
[3]
Oswin Aichholzer and Anna Brötzner. Bicolored Order Types. Computing in Geometry and Topology, 3(2):3:1--3:17, Jan. 2024. [ bib | DOI | http ]
[4]
Oswin Aichholzer, Joachim Orthaber, and Birgit Vogtenhuber. Towards Crossing-Free Hamiltonian Cycles in Simple Drawings of Complete Graphs. Computing in Geometry and Topology, 3(2):5:1--5:30, Jan. 2024. [ bib | DOI | http ]
[5]
Oswin Aichholzer, Ruy Fabila-Monroy, Philipp Kindermann, Irene Parada, Rosna Paul, Daniel Perz, Patrick Schnider, and Birgit Vogtenhuber. Perfect Matchings with Crossings. Algorithmica, 86:697--716, 2024. [ bib | DOI ]
[6]
Oswin Aichholzer, Anna Brötzner, Daniel Perz, and Patrick Schnider. Flips in Odd Matchings. In Proceedings of the 36th Canadian Conference on Computational Geometry (CCCG 2024), pages 299--303, 2024. [ bib | .pdf ]
[7]
Oswin Aichholzer, Anna Brötzner, Daniel Perz, and Patrick Schnider. Flips in Odd Matchings. In Proceedings of the 40th European Workshop on Computational Geometry (EuroCG 2024), pages 59:1--59:6, 2024. [ bib | .pdf ]
[8]
Oswin Aichholzer, Sergio Cabello, Viola Mészáros, and Jan Soukup. Connected matchings. In Proceedings of the 40th European Workshop on Computational Geometry (EuroCG 2024), pages 54:1--54:7, 2024. [ bib | .pdf ]
[9]
Oswin Aichholzer, Birgit Vogtenhuber, and Alexandra Weinberger. Isomorphisms of simple drawings of complete multipartite graphs. In Abstracts of the XX Spanish Meeting on Computational Geometry, page 59, Santiago de Compostela, Spain, 2023. [ bib | http ]
[10]
Oswin Aichholzer, Alfredo García, Javier Tejel, Birgit Vogtenhuber, and Alexandra Weinberger. Recognizing rotation systems of generalized twisted drawings in O(n2) time. In Abstracts of the XX Spanish Meeting on Computational Geometry, page 69, Santiago de Compostela, Spain, 2023. [ bib | http ]
[11]
Oswin Aichholzer, Alfredo García, Javier Tejel, Birgit Vogtenhuber, and Alexandra Weinberger. Characterizing rotation systems of generalized twisted drawings via 5-tuples. In Abstracts of the XX Spanish Meeting on Computational Geometry, page 71, Santiago de Compostela, Spain, 2023. [ bib | http ]
[12]
Oswin Aichholzer, David Eppstein, and Eva-Maria Hainzl. Geometric dominating sets - a minimum version of the No-Three-In-Line Problem. Computational Geometry, 108:101--913, 2023. [ bib | DOI | arXiv | http ]
[13]
Oswin Aichholzer, Kristin Knorr, Wolfgang Mulzer, Nicolas El Maalouly, Johannes Obenaus, Rosna Paul, Meghana M. Reddy, Birgit Vogtenhuber, and Alexandra Weinberger. Compatible Spanning Trees in Simple Drawings of Kn. In Patrizio Angelini and Reinhard von Hanxleden, editors, Graph Drawing and Network Visualization, pages 16--24, Cham, 2023. Springer International Publishing. [ bib | DOI | arXiv ]
[14]
Oswin Aichholzer, Alfredo García, Irene Parada, Birgit Vogtenhuber, and Alexandra Weinberger. Shooting Stars in Simple Drawings of Km,n. In Patrizio Angelini and Reinhard von Hanxleden, editors, Graph Drawing and Network Visualization, pages 49--57, Cham, 2023. Springer International Publishing. [ bib | DOI | arXiv ]
[15]
Oswin Aichholzer, Matias Korman, Yoshio Okamoto, Irene Parada, Daniel Perz, André van Renssen, and Birgit Vogtenhuber. Graphs with large total angular resolution. Theoretical Computer Science, 943:73--88, 2023. [ bib | DOI | arXiv | http ]
[16]
Oswin Aichholzer, Joachim Orthaber, and Birgit Vogtenhuber. Towards Crossing-Free Hamiltonian Cycles in Simple Drawings of Complete Graphs. In Proceedings of the 39th European Workshop on Computational Geometry (EuroCG 2023), pages 33:1--33:7, 2023. [ bib | .pdf ]
[17]
Oswin Aichholzer and Anna Brötzner. Two Equivalent Representations of Bicolored Order Types. In Proceedings of the 39th European Workshop on Computational Geometry (EuroCG 2023), pages 1:1--1:6, 2023. [ bib | .pdf ]
[18]
Oswin Aichholzer, Stefan Felsner, Rosna Paul, Manfred Scheucher, and Birgit Vogtenhuber. Bichromatic Perfect Matchings with Crossings. In Proceedings of the 39th European Workshop on Computational Geometry (EuroCG 2023), pages 28:1--28:7, 2023. [ bib | .pdf ]
[19]
Oswin Aichholzer, Kristin Knorr, Wolfgang Mulzer, Johannes Obenaus, Rosna Paul, and Birgit Vogtenhuber. Flipping Plane Spanning Paths. In Chun-Cheng Lin, Bertrand M. T. Lin, and Giuseppe Liotta, editors, WALCOM: Algorithms and Computation, pages 49--60, Cham, 03 2023. Springer Nature Switzerland. [ bib | DOI | arXiv ]
[20]
Oswin Aichholzer, Man-Kwun Chiu, Hung P. Hoang, Michael Hoffmann, Jan Kynčl, Yannic Maus, Birgit Vogtenhuber, and Alexandra Weinberger. Drawings of Complete Multipartite Graphs up to Triangle Flips. In Erin W. Chambers and Joachim Gudmundsson, editors, 39th International Symposium on Computational Geometry (SoCG 2023), volume 258 of Leibniz International Proceedings in Informatics (LIPIcs), pages 6:1--6:16, Dagstuhl, Germany, 2023. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik. [ bib | DOI | http ]
[21]
Oswin Aichholzer, Birgit Vogtenhuber, and Alexandra Weinberger. "Different Types of Isomorphisms of Drawings of Complete Multipartite Graphs". In Michael A. Bekos and Markus Chimani, editors, Graph Drawing and Network Visualization, volume 14466 of Lecture Notes in Computer Science (LNCS), pages 34--50, Cham, 2023. Springer Nature Switzerland. [ bib | DOI | arXiv ]
[22]
Oswin Aichholzer, Stefan Felsner, Rosna Paul, Manfred Scheucher, and Birgit Vogtenhuber. "Bichromatic Perfect Matchings with Crossings". In Michael A. Bekos and Markus Chimani, editors, Graph Drawing and Network Visualization, volume 14465 of Lecture Notes in Computer Science (LNCS), pages 124--132, Cham, 2023. Springer Nature Switzerland. [ bib | DOI | arXiv ]
[23]
Oswin Aichholzer, Manuel Borrazzo, Prosenjit Bose, Jean Cardinal, Fabrizio Frati, Pat Morin, and Birgit Vogtenhuber. Drawing Graphs as Spanners. Discrete & Computational Geometry, 68:774--795, 06 2022. [ bib | DOI | arXiv | .pdf ]
[24]
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 ]
[25]
Oswin Aichholzer, Jan Kynčl, Manfred Scheucher, Birgit Vogtenhuber, and Pavel Valtr. On crossing-families in planar point sets. Computational Geometry, 107:101--899, 2022. [ bib | DOI | arXiv | http ]
[26]
Oswin Aichholzer, Erik D. Demaine, Matias Korman, Anna Lubiw, Jayson Lynch, Zuzana Masárová, Mikhail Rudoy, Virginia Vassilevska Williams, and Nicole Wein. Hardness of Token Swapping on Trees. In Shiri Chechik, Gonzalo Navarro, Eva Rotenberg, and Grzegorz Herman, editors, 30th Annual European Symposium on Algorithms (ESA 2022), volume 244 of Leibniz International Proceedings in Informatics (LIPIcs), pages 3:1--3:15, Dagstuhl, Germany, 2022. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik. [ bib | DOI | arXiv | http ]
[27]
Oswin Aichholzer, Man-Kwun Chiu, Hung P. Hoang, Michael Hoffmann, Yannic Maus, Birgit Vogtenhuber, and Alexandra Weinberger. Gioan's Theorem for complete bipartite graphs. In Proc. 38th European Workshop on Computational Geometry (EuroCG 2022), pages 31:1--31:6, Perugia, Italy, 2022. [ bib | http ]
[28]
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 ]
[29]
Oswin Aichholzer, Kristin Knorr, Maarten Löffler, Zuzana Masárová, Wolfgang Mulzer, Johannes Obenaus, Rosna Paul, and Birgit Vogtenhuber. Flipping Plane Spanning Paths. In Proc. 38th European Workshop on Computational Geometry (EuroCG 2022), pages 66:1--66:7, Perugia, Italy, 2022. [ bib | arXiv | http ]
[30]
Oswin Aichholzer, Alfredo García, Javier Tejel, Birgit Vogtenhuber, and Alexandra Weinberger. Twisted Ways to Find Plane Structures in Simple Drawings of Complete Graphs. In Xavier Goaoc and Michael Kerber, editors, 38th International Symposium on Computational Geometry (SoCG 2022), volume 224 of Leibniz International Proceedings in Informatics (LIPIcs), pages 5:1--5:18, Dagstuhl, Germany, 2022. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik. [ bib | DOI | arXiv | http ]
[31]
Oswin Aichholzer, Johannes Obenaus, Joachim Orthaber, Rosna Paul, Patrick Schnider, Raphael Steiner, Tim Taubner, and Birgit Vogtenhuber. Edge Partitions of Complete Geometric Graphs. In Xavier Goaoc and Michael Kerber, editors, 38th International Symposium on Computational Geometry (SoCG 2022), volume 224 of Leibniz International Proceedings in Informatics (LIPIcs), pages 6:1--6:16, Dagstuhl, Germany, 2022. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik. [ bib | DOI | http ]
[32]
Oswin Aichholzer, Ruy Fabila-Monroy, Philipp Kindermann, Irene Parada, Rosna Paul, Daniel Perz, Patrick Schnider, and Birgit Vogtenhuber. Perfect Matchings with Crossings. In Combinatorial Algorithms: 33rd International Workshop, IWOCA 2022, Trier, Germany, June 7--9, 2022, Proceedings, pages 46--59, Berlin, Heidelberg, 2022. Springer-Verlag. [ bib | DOI ]
[33]
Oswin Aichholzer, Julia Obmann, Pavel Paták, Daniel Perz, Josef Tkadlec, and Birgit Vogtenhuber. Disjoint Compatibility via Graph Classes. In Michael A. Bekos and Michael Kaufmann, editors, Graph-Theoretic Concepts in Computer Science. WG 2022., volume 13453 of Lecture Notes in Computer Science (LNCS), pages 16--28, Cham, 2022. Springer International Publishing. [ bib | DOI ]
[34]
Oswin Aichholzer, Jean Cardinal, Tony Huynh, Kolja Knauer, Torsten Mütze, Raphael Steiner, and Birgit Vogtenhuber. Flip distances between graph orientations. Algorithmica, pages 1--28, 2021. [ bib | DOI | arXiv ]
[35]
Oswin Aichholzer, Hugo A. Akitaya, Kenneth C. Cheung, Erik D. Demaine, Martin L. Demaine, Sándor P. Fekete, Linda Kleist, Irina Kostitsyna, Maarten Löffler, Zuzana Masárová, Klara Mundilova, and Christiane Schmidt. "Folding polyominoes with holes into a cube". Computational Geometry, 93:101700, 2021. [ bib | DOI | arXiv | http | .pdf ]
[36]
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 ]
[37]
Oswin Aichholzer, Michael Hoffmann, Johannes Obenaus, Rosna Paul, Daniel Perz, Nadja Seiferth, Birgit Vogtenhuber, and Alexandra Weinberger. Plane Spanning Trees in Edge-Colored Simple Drawings of Kn. In Graph Drawing and Network Visualization (GD 2020), Lecture Notes in Computer Science (LNCS), pages 482--489. Springer International Publishing, 2021. [ bib | DOI | arXiv | http ]
[38]
Oswin Aichholzer, Jan Kynčl, Manfred Scheucher, and Birgit Vogtenhuber. On 4-Crossing-Families in Point Sets and an Asymptotic Upper Bound. In Proceedings of the 37th European Workshop on Computational Geometry (EuroCG2021), pages 38:1--38:8, St. Petersburg, Germany, 2021. [ bib | arXiv | .pdf ]
[39]
Oswin Aichholzer, David Eppstein, and Eva-Maria Hainzl. Geometric Dominating Sets -- A Minimum Version of the No-Three-In-Line Problem. In Proceedings of the 37th European Workshop on Computational Geometry (EuroCG2021), pages 17:1--17:7, St. Petersburg, Germany, 2021. [ bib | arXiv | .pdf ]
[40]
Oswin Aichholzer, Alfredo García, Javier Tejel, Birgit Vogtenhuber, and Alexandra Weinberger. Plane Matchings in Simple Drawings of Complete Graphs. In Proceedings of the Computational Geometry: Young Researchers Forum, pages 6--10, 2021. [ bib | http ]
[41]
Oswin Aichholzer, Ruy Fabila-Monroy, Philipp Kindermann, Irene Parada, Rosna Paul, Daniel Perz, Patrick Schnider, and Birgit Vogtenhuber. Perfect Matchings with Crossings. In Proceedings of the Computational Geometry: Young Researchers Forum, pages 24--27, 2021. [ bib | http ]
[42]
Oswin Aichholzer, Alfredo García, Javier Tejel, Birgit Vogtenhuber, and Alexandra Weinberger. Plane paths in simple drawings of complete graphs. In Proc. XIX Encuentros de Geometría Computacional, page 4, 2021. [ bib | http ]
[43]
Oswin Aichholzer, Maarten Löffler, Jayson Lynch, Zuzana Masárová, Joachim Orthaber, Irene Parada, Rosna Paul, Daniel Perz, Birgit Vogtenhuber, and Alexandra Weinberger. Dominect: A Simple yet Deep 2-Player Board Game. In 23rd Thailand-Japan Conference on Discrete and Computational Geometry, Graphs, and Games (TJCDCGGG 2020+1), pages 112--113, 2021. [ bib | http ]
[44]
Oswin Aichholzer, Johannes Obenaus, Joachim Orthaber, Rosna Paul, Patrick Schnider, Raphael Steiner, Tim Taubner, and Birgit Vogtenhuber. Edge Partitions of Complete Geometric Graphs (Part 2). 2021. [ bib | arXiv ]
[45]
Oswin Aichholzer. Another Small but Long Step for Crossing Numbers: cr(13) = 225 and cr(14) = 315. In Proceedings of the 33rd Canadian Conference on Computational Geometry (CCCG 2021), pages 72--77, 2021. [ bib | http ]
[46]
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 ]
[47]
Oswin Aichholzer, Frank Duque, Ruy Fabila-Monroy, Carlos Hidalgo-Toscano, and Oscar E. García-Quintero. An Ongoing Project to Improve the Rectilinear and the Pseudolinear Crossing Constants. Journal of Graph Algorithms and Applications, 24(3):421--432, 2020. [ bib | DOI | arXiv ]
[48]
Oswin Aichholzer, Alfredo García, Irene Parada, Birgit Vogtenhuber, and Alexandra Weinberger. Simple Drawings of Km,n Contain Shooting Stars. In Proceedings of the 36th European Workshop on Computational Geometry (EuroCG2020), pages 36:1--36:7, Würzburg, Germany, 2020. [ bib | .pdf ]
[49]
O. Aichholzer, L. E. Caraballo, J.M. Díaz-Bá nez, R. Fabila-Monroy, I. Parada, I. Ventura, and B. Vogtenhuber. Scheduling drones to cover outdoor events. In Proceedings of the 36th European Workshop on Computational Geometry (EuroCG2020), pages 24:1--24:7, Würzburg, Germany, 2020. [ bib | .pdf ]
[50]
Oswin Aichholzer, Manuel Borrazzo, Prosenjit Bose, Jean Cardinal, Fabrizio Frati, Pat Morin, and Birgit Vogtenhuber. Drawing Graphs as Spanners. In Isolde Adler and Haiko Müller, editors, 45th International Workshop on Graph-Theoretic Concepts in Computer Science. WG2020., volume 12301 of Lecture Notes in Computer Science (LNCS), pages 310--324, Leeds, United Kingdom, 2020. Springer International Publishing. [ bib | DOI | arXiv | .pdf ]
[51]
O. Aichholzer, J. Obmann, P. Paták, D. Perz, and J. Tkadlec. Disjoint tree-compatible plane perfect matchings. In Proceedings of the 36th European Workshop on Computational Geometry (EuroCG2020), pages 56:1--56:7, Würzburg, Germany, 2020. [ bib | .pdf ]
[52]
Oswin Aichholzer, Ruy Fabila-Monroy, Ferran Hurtado, Pablo Perez-Lantero, Andres J. Ruiz-Vargas, Jorge Urrutia, and Birgit Vogtenhuber. Cross-sections of line configurations in R3 and (d-2)-flat configurations in Rd. Computational Geometry: Theory and Applications, 77:51--61, 2019. Special Issue of CCCG 2014. [ bib | DOI | http ]
[53]
Oswin Aichholzer and Daniel Perz. Triangles in the colored Euclidean plane. In Proc. 35th European Workshop on Computational Geometry EuroCG '19, pages 10:1--10:7, Utrecht, The Netherlands, 2019. [ bib | .pdf | .pdf ]
[54]
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 ]
[55]
Oswin Aichholzer, Ruy Fabila Monroy, Adrian Fuchs, Carlos Hidalgo Toscano, Irene Parada, Birgit Vogtenhuber, and Francisco Zaragoza. On the 2-Colored Crossing Number. In Proc. 35th European Workshop on Computational Geometry EuroCG '19, pages 56:1--56:7, Utrecht, The Netherlands, 2019. [ bib | .pdf | .pdf ]
[56]
Oswin Aichholzer, Irene Parada, Manfred Scheucher, Birgit Vogtenhuber, and Alexandra Weinberger. Shooting Stars in Simple Drawings of Km,n. In Proc. 35th European Workshop on Computational Geometry EuroCG '19, pages 59:1--59:6, Utrecht, The Netherlands, 2019. [ bib | arXiv | .pdf | .pdf ]
[57]
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 ]
[58]
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 ]
[59]
Oswin Aichholzer, Ruy Fabila-Monroy, and Julia Obmann. On the Triangle Vector. In Proc. XVIII Encuentros de Geometría Computacional, pages 55--58, Girona, Spain, 2019. [ bib | .pdf | .pdf ]
[60]
Oswin Aichholzer, Ruy Fabila-Monroy, Adrian Fuchs, Carlos Hidalgo-Toscano, Irene Parada, Birgit Vogtenhuber, and Francisco Zaragoza. On the 2-colored crossing number. In Graph Drawing and Network Visualization. GD 2019, volume 11904 of Lecture Notes in Computer Science (LNCS), pages 87--100, Prague, Czechia, 2019. [ bib | DOI | arXiv ]
[61]
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 ]
[62]
Oswin Aichholzer, Matias Korman, Yoshio Okamoto, Irene Parada, Daniel Perz, André van Renssen, and Birgit Vogtenhuber. Graphs with large total angular resolution. In Graph Drawing and Network Visualization. GD 2019, volume 11904 of Lecture Notes in Computer Science (LNCS), pages 193--199, Prague, Czechia, 2019. [ bib | DOI | arXiv ]
[63]
Oswin Aichholzer, Linda Kleist, Boris Klemz, Felix Schröder, and Birgit Vogtenhuber. On the Edge-Vertex Ratio of Maximal Thrackles. In Graph Drawing and Network Visualization. GD 2019, volume 11904 of Lecture Notes in Computer Science (LNCS), pages 482--495, Prague, Czechia, 2019. [ bib | DOI | arXiv ]
[64]
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 ]
[65]
O. Aichholzer, M. Balko, T. Hackl, J. Kynčl, I. Parada, M. Scheucher, P. Valtr, and B. Vogtenhuber. A superlinear lower bound on the number of 5-holes. Journal of Combinatorial Theory A, pages 1--31, 2019. online. [ bib | DOI | arXiv | http | .pdf ]
[66]
Oswin Aichholzer, Jean Cardinal, Tony Huynh, Kolja Knauer, Torsten Mütze, Raphael Steiner, and Birgit Vogtenhuber. Flip distances between graph orientations. In 45th International Workshop on Graph-Theoretic Concepts in Computer Science, volume 11789 of Lecture Notes in Computer Science (LNCS), pages 120--134, Vall de Nuria, Spain, 2019. [ bib | DOI | arXiv ]
[67]
Oswin Aichholzer, Hugo A. Akitaya, Kenneth C. Cheung, Erik D. Demaine, Martin L. Demaine, Sándor P. Fekete, Linda Kleist, Irina Kostitsyna, Maarten Löffler, Zuzana Masárová, Klara Mundilova, and Christiane Schmidt. Folding Polyominoes with Holes into a Cube. In Proc. 31th Annual Canadian Conference on Computational Geometry CCCG 2019, pages 164--170, Edmonton, Alberta, Canada, 2019. [ bib | .pdf | .pdf ]
[68]
Oswin Aichholzer, Lukas Andritsch, Karin Baur, and Birgit Vogtenhuber. Transformed flips in triangulations and matchings. submitted, pages 1--17, 2019. [ bib | arXiv ]
[69]
Oswin Aichholzer, Michael Biro, Erik Demaine, Martin Demaine, David Eppstein, Sándor P. Fekete, Adam Hesterberg, Irina Kostitsyna, and Christiane Schmidt. Folding Polyominoes into (Poly)Cubes. International Journal of Computational Geometry & Applications, 28(3):197--226, 2018. [ bib | DOI ]
[70]
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 ]
[71]
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 ]
[72]
Oswin Aichholzer, Nieves Atienza, José M. Díaz-Báñez, Ruy Fabila-Monroy, David Flores-Peñaloza, Pablo Pérez-Lantero, Jorge Urrutia, and Birgit Vogtenhuber. Computing Balanced Islands in Two Colored Point Sets in the Plane. Information Processing Letters, 135:28 -- 32, 2018. [ bib | DOI | arXiv | http ]
[73]
Bernardo M. Ábrego, Oswin Aichholzer, Silvia Fernández-Merchant, Dan McQuillan, Bojan Mohar, Petra Mutzel, Pedro Ramos, R. Bruce Richter, and Birgit Vogtenhuber. Bishellable drawings of Kn. SIAM Journal on Discrete Mathematics, 32(4):2482--2492, 2018. [ bib | DOI | arXiv ]
[74]
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 ]
[75]
Oswin Aichholzer, Ruy Fabila-Monroy, David Flores-Peñaloza, Thomas Hackl, Jorge Urrutia, and Birgit Vogtenhuber. Modem Illumination of Monotone Polygons. Computational Geometry: Theory and Applications, 68:101--118, 2018. Special Issue in Memory of Ferran Hurtado. [ bib | DOI | http ]
[76]
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 ]
[77]
Oswin Aichholzer, Michael Kerber, István Talata, and Birgit Vogtenhuber. A Note on Planar Monohedral Tilings. In Proc. 34th European Workshop on Computational Geometry EuroCG '18, pages 31:1--31:6, Berlin, Germany, 2018. [ bib ]
[78]
Oswin Aichholzer, Wolfgang Mulzer, Partick Schnider, and Birgit Vogtenhuber. NP-Completeness of Max-Cut for Segment Intersection Graphs. In Proc. 34th European Workshop on Computational Geometry EuroCG '18, pages 32:1--32:6, Berlin, Germany, 2018. [ bib ]
[79]
Oswin Aichholzer, Lukas Andritsch, Karin Baur, and Birgit Vogtenhuber. Perfect k-Colored Matchings and (k+2)-Gonal Tilings. Graphs and Combinatorics, 34(6):1333--1346, 2018. [ bib | DOI | arXiv | http ]
[80]
O. Aichholzer, M. Balko, T. Hackl, J. Kynčl, I. Parada, M. Scheucher, P. Valtr, and B. Vogtenhuber. A superlinear lower bound on the number of 5-holes. In Boris Aronov and Matthew J. Katz, editors, 33rd International Symposium on Computational Geometry (SoCG 2017), volume 77 of Leibniz International Proceedings in Informatics (LIPIcs), pages 8:1--8:16, Brisbane, Australia, 2017. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik. [ bib | DOI | arXiv | .pdf ]
[81]
O. Aichholzer, M. Balko, T. Hackl, J. Kynčl, I. Parada, M. Scheucher, P. Valtr, and B. Vogtenhuber. A superlinear lower bound on the number of 5-holes. In Proc. 33rd European Workshop on Computational Geometry EuroCG '17, pages 69--73, Malmö, Sweden, 2017. [ bib | arXiv | .pdf ]
[82]
O. Aichholzer, L. Andritsch, K. Baur, and B. Vogtenhuber. Perfect k-colored matchings and k+2-gonal tilings. In Proc. 33rd European Workshop on Computational Geometry EuroCG '17, pages 81--84, Malmö, Sweden, 2017. [ bib | arXiv | .pdf ]
[83]
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 ]
[84]
Bernardo M. Ábrego, Oswin Aichholzer, Silvia Fernández-Merchant, Dan McQuillan, Bojan Mohar, Petra Mutzel, Pedro Ramos, R. Bruce Richter, and Birgit Vogtenhuber. Bishellable drawings of Kn. In Proc. XVII Encuentros de Geometría Computacional, pages 17--20, Alicante, Spain, 2017. [ bib | arXiv | .pdf ]
[85]
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 ]
[86]
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 ]
[87]
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 ]
[88]
Oswin Aichholzer, Thomas Hackl, Pavel Valtr, and Birgit Vogtenhuber. A Note on the Number of General 4-holes in (Perturbed) Grids. In Jin Akiyama, Hiro Ito, Toshinori Sakai, and Yushi Uno, editors, Discrete and Computational Geometry and Graphs. JCDCGG 2015., volume 9943 of Lecture Notes in Computer Science (LNCS), pages 1--12. Springer, Cham, 2016. [ bib | DOI ]
[89]
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 ]
[90]
O. Aichholzer, G. Araujo-Pardo, N. García-Colín, T. Hackl, D. Lara, C. Rubio-Montiel, and J. Urrutia. Geometric achromatic and pseudoachromatic indices. Graphs and Combinatorics, 32(2):431--451, 2016. [ bib | DOI | .pdf ]
[91]
Oswin Aichholzer, Jean Cardinal, Vincent Kusters, Stefan Langerman, and Pavel Valtr. Reconstructing Point Set Order Types from Radial Orderings. International Journal of Computational Geometry & Applications, 26(3/4):167--184, 2016. [ bib | DOI | .pdf ]
[92]
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 ]
[93]
O. Aichholzer, T. Hackl, and M. Scheucher. Planar L-Shaped Point Set Embedding of Trees. In Proc. 32st European Workshop on Computational Geometry EuroCG '16, pages 51--54, Lugano, Switzerland, 2016. [ bib | arXiv | .pdf ]
[94]
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 ]
[95]
O. Aichholzer, T. Hackl, P. Valtr, and B. Vogtenhuber. A note on the number of general 4-holes in perturbed grids. In Proc. 18th Japan Conference on Discrete and Computational Geometry and Graphs (JCDCG2 2015), pages 68--69, Kyoto, Japan, 2015. [ bib ]
[96]
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 ]
[97]
O. Aichholzer, T. Biedl, T. Hackl, M. Held, S. Huber, P. Palfrader, and B. Vogtenhuber. Representing Directed Trees as Straight Skeletons. In Emilio Di Giacomo and Anna Lubiw, editors, Proc. 23nd International Symposium on Graph Drawing (GD 2015), volume 9411 of Lecture Notes in Computer Science (LNCS), pages 335--347, Los Angeles, CA, USA, 2015. [ bib | DOI | .pdf ]
[98]
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 ]
[99]
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 ]
[100]
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 ]
[101]
Oswin Aichholzer, Ruy Fabila-Monroy, Hernan Gonzalez-Aguilar, Thomas Hackl, Marco A. Heredia, Clemens Huemer, Jorge Urrutia, Pavel Valtr, and Birgit Vogtenhuber. On k-Gons and k-Holes in Point Sets. Computational Geometry: Theory and Applications, 48(7):528--537, 2015. [ bib | DOI | .pdf ]
[102]
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 ]
[103]
O. Aichholzer, W. Aigner, F. Aurenhammer, B. Jüttler K.Č Dobiášová, and G. Rote. Triangulations with circular arcs. Journal of Graph Algorithms and Applications, 19(1):43--65, 2015. [ bib | DOI | .pdf ]
[104]
Oswin Aichholzer, Sang Won Bae, Luis Barba, Prosenjit Bose, Matias Korman, André van Renssen, Perouz Taslakian, and Sander Verdonschot. Reprint of: Theta-3 is connected. Computational Geometry Theory and Application, 48:369--442, 2015. [ bib | DOI ]
[105]
Oswin Aichholzer, Andrei Asinowski, and Tillmann Miltzow. Disjoint compatibility graph of non-crossing matchings of points in convex position. The Electronic Journal of Combinatorics, 22:1--65, 2015. [ bib | http | .pdf ]
[106]
O. Aichholzer, L.E. Caraballo, J.M. Díaz-Báñez, R. Fabila-Monroy, C. Ochoa, and P. Nigsch. Characterization of extremal antipodal polygons. Graphs and Combinatorics, 31:321--333, 2015. [ bib | DOI | .pdf ]
[107]
Oswin Aichholzer, Michael Biro, Erik Demaine, Martin Demaine, David Eppstein, Sándor P. Fekete, Adam Hesterberg, Irina Kostitsyna, and Christiane Schmidt. Folding Polyominoes into (Poly)Cubes. In Proc. 27th Annual Canadian Conference on Computational Geometry CCCG 2015, pages 101--106, Kingston, Ontario, Canada, 2015. [ bib | .html ]
[108]
Oswin Aichholzer, Thomas Hackl, Sarah Lutteropp, Tamara Mchedlidze, and Birgit Vogtenhuber. Embedding Four-directional Paths on Convex Point Sets. Journal of Graph Algorithms and Applications, 19(2):743--759, 2015. [ bib | DOI | .pdf ]
[109]
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 ]
[110]
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 ]
[111]
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 ]
[112]
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 ]
[113]
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 ]
[114]
O. Aichholzer, R. Fabila-Monroy, T. Hackl, C. Huemer, and J. Urrutia. Empty Monochromatic Simplices. Discrete & Computational Geometry, 51(2):362--393, 2014. [ bib | DOI | .pdf ]
[115]
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 ]
[116]
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 ]
[117]
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 ]
[118]
O. Aichholzer, R. Fabila-Monroy, H. González-Aguilar, T. Hackl, M.A. Heredia, C. Huemer, J. Urrutia, and B. Vogtenhuber. 4-Holes in Point Sets. Computational Geometry: Theory and Applications, 47(6):644--650, 2014. Special Issue on the 27th European Workshop on Computational Geometry (EuroCG 2011). [ bib | DOI | .pdf ]
[119]
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 ]
[120]
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 ]
[121]
B.M. Ábrego, O. Aichholzer, S. Fernández-Merchant, P. Ramos, and G. Salazar. Shellable drawings and the cylindrical crossing number of Kn. Discrete and Computational Geometry, 52:743--753, 2014. [ bib | DOI | arXiv | .pdf ]
[122]
Oswin Aichholzer, Matias Korman, Alexander Pilz, and Birgit Vogtenhuber. Geodesic Order Types. Algorithmica, 70(1):112--128, 2014. [ bib | DOI | arXiv | http | .pdf ]
[123]
Oswin Aichholzer, Greg Aloupis, Erik D. Demaine, Martin L. Demaine, Sándor P. Fekete, Michal Hoffmann, Anna Lubiw, Jack Snoeyink, and Andrew Winslow. Covering Folded Shapes. Journal of Computational Geometry, 5:150--168, 2014. [ bib | http ]
[124]
Oswin Aichholzer, Sang Won Bae, Luis Barba, Prosenjit Bose, Matias Korman, André van Renssen, Perouz Taslakian, and Sander Verdonschot. Theta-3 is connected. Computational Geometry Theory and Application, 47:910--917, 2014. [ bib | DOI ]
[125]
Bernardo M. Ábrego, Oswin Aichholzer, Silvia Fernández-Merchant, Pedro Ramos, and Birgit Vogtenhuber. Non-Shellable Drawings of Kn with Few Crossings. In Proc. 26th Annual Canadian Conference on Computational Geometry CCCG 2014, page online, Halifax, Nova Scotia, Canada, 2014. [ bib ]
[126]
Oswin Aichholzer, Thomas Hackl, Stefan Huber, and Birgit Vogtenhuber. Straight Skeletons by Means of Voronoi Diagrams Under Polyhedral Distance Functions. In Proc. 26th Annual Canadian Conference on Computational Geometry (CCCG 2014), page online, Halifax, Nova Scotia, Canada, 2014. [ bib | .pdf ]
[127]
Oswin Aichholzer, Michael Hoffmann, Marc Van Kreveld, and Günter Rote. Graph Drawings with Relative Edge Length Specifications. In Proc. 26th Annual Canadian Conference on Computational Geometry CCCG 2014, page online, Halifax, Nova Scotia, Canada, 2014. [ bib ]
[128]
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 ]
[129]
Oswin Aichholzer, Ruy Fabila-Monroy, Ferran Hurtado, Pablo Perez-Lantero, Andres J. Ruiz-Vargas, Jorge Urrutia, and Birgit Vogtenhuber. Order types and cross-sections of line arrangements in R3. In Proc. 26th Annual Canadian Conference on Computational Geometry CCCG 2014, page online, Halifax, Nova Scotia, Canada, 2014. [ bib ]
[130]
Oswin Aichholzer, Thomas Hackl, Sarah Lutteropp, Tamara Mchedlidze, and Birgit Vogtenhuber. Embedding Four-directional Paths on Convex Point Sets. In C. Duncan and A. Symvonis, editors, Proc. 22nd International Symposium on Graph Drawing (GD 2014), volume 8871 of Lecture Notes in Computer Science (LNCS), pages 355--366, Würzburg, Germany, 2014. [ bib | .pdf ]
[131]
Oswin Aichholzer, Jean Cardinal, Vincent Kusters, Stefan Langerman, and Pavel Valtr. Reconstructing Point Set Order Types from Radial Orderings. In Algorithms and Computation - 25th International Symposium, ISAAC 2014, Jeonju, Korea, December 15-17, 2014, Proceedings, pages 15--26, 2014. [ bib | DOI | .pdf ]
[132]
Sven Bock, Roland Klöbl, Thomas Hackl, Oswin Aichholzer, and Gerald Steinbauer. "Playing Nine Men's Morris with the Humanoid Robot Nao". In Proc. Austrian Robotics Workshop (AWS 2014), pages 58--63, Linz, Austria, 2014. [ bib | .pdf ]
[133]
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 ]
[134]
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 ]
[135]
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 ]
[136]
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 ]
[137]
O. Aichholzer, T. Hackl, V. Sacristán, B. Vogtenhuber, and R. Wallner. Simulating distributed algorithms for lattice agents. In Proc. 15th Spanish Meeting on Computational Geometry 2013, pages 81--84, Sevilla, Spain, 2013. [ bib | .pdf ]
[138]
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 ]
[139]
O. Aichholzer, T. Hackl, D. Orden, P. Ramos, G. Rote, A. Schulz, and B. Speckmann. Flip Graphs of Bounded-Degree Triangulations. Graphs and Combinatorics, 29(6):1577--1593, 2013. [ bib | DOI | arXiv | .pdf ]
[140]
O. Aichholzer, T. Hackl, M. Hoffmann, C. Huemer, A. Pór, F. Santos, B. Speckmann, and B. Vogtenhuber. Maximizing Maximal Angles for Plane Straight Line Graphs. Computational Geometry: Theory and Applications, 46(1):17--28, 2013. [ bib | DOI | arXiv | .pdf ]
[141]
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 ]
[142]
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 ]
[143]
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 ]
[144]
O. Aichholzer and B. Jüttler. Einführung in die Angewandte Geometrie. Mathematik Kompakt. Birkhäuser, 2013. [ bib ]
[145]
O. Aichholzer, J. Urrutia, and B. Vogtenhuber. Balanced 6-holes in bichromatic point sets. In Proc. of the 16th Japan Conference on Discrete and Computational Geometry and Graphs (JCDCG2 2013), Tokyo, Japan, 2013. [ bib | .pdf ]
[146]
B.M. Ábrego, O. Aichholzer, S. Fernández-Merchant, P. Ramos, and G. Salazar. More on the crossing number of Kn: Monotone drawings. Electronic Notes in Discrete Mathematics, 44:411--414, 2013. Special issue dedicated to LAGOS2013. [ bib | DOI | http ]
[147]
O. Aichholzer, S.R. Allen, G. Aloupis, L. Barba, P. Bose, J.-L. De Carufel, J. Iacono, S. Langerman, D.L. Souvaine, P. Taslakin, and M. Yagnatinsky. Sum of Squared Edges for MST of a Point Set in a Unit Square. In Proc. of the 16th Japan Conference on Discrete and Computational Geometry and Graphs (JCDCG2 2013), Tokyo, Japan, 2013. [ bib ]
[148]
O. Aichholzer, G. Aloupis, E.D. Demaine, M.L. Demaine, S.P. Fekete, M. Hoffmann, A. Lubiwk, J. Snoeyink, and a. Winslow. Covering Folded Shapes. In Proc. 25th Annual Canadian Conference on Computational Geometry CCCG 2013, pages 73--78, Waterloo, Ontario, Canada, 2013. [ bib ]
[149]
Oswin Aichholzer, Sang Won Bae, Luis Barba, Prosenjit Bose, Matias Korman, André van Renssen, Perouz Taslakian, and Sander Verdonschot. Theta 3 is connected. In Proc. 25th Annual Canadian Conference on Computational Geometry CCCG 2013, pages 205--211, Waterloo, Ontario, Canada, 2013. invited to special issue of CCCG 2013. [ bib ]
[150]
O. Aichholzer, L.E. Caraballo, J.M. Díaz-Báñez, R. Fabila-Monroy, C. Ochoa, and P. Nigsch. Extremal antipodal polygons and polytopes. In Mexican Conference on Discrete Mathematics and Computational Geometry, pages 11--20, Oaxaca, México, 2013. [ bib | .pdf ]
[151]
J. Abhau, O. Aichholzer, S. Colutto, B. Kornberger, and O. Scherzer. Shape Spaces via Medial Axis Transforms for Segmentation of Complex Geometry in 3D Voxel Data. Inverse Problems and Imaging, 7(1):1--25, 2013. [ bib ]
[152]
Oswin Aichholzer, Jorge Urrutia, and Birgit Vogtenhuber. Balanced 6-holes in linearly separable bichromatic point sets. Electronic Notes in Discrete Mathematics, 44:181 -- 186, 2013. Special issue dedicated to LAGOS2013. [ bib | DOI | http ]
[153]
Bernardo M. Ábrego, Oswin Aichholzer, Silvia Fernández-Merchant, Pedro Ramos, and Gelasio Salazar. The 2-page crossing number of Kn. Discrete & Computational Geometry, 49(4):747--777, 2013. [ bib | .pdf ]
[154]
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 ]
[155]
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 ]
[156]
O. Aichholzer, H. Cheng, S.L. Devadoss, T. Hackl, S. Huber, B. Li, and A. Risteski. What makes a Tree a Straight Skeleton? In Proc. 24th Annual Canadian Conference on Computational Geometry CCCG 2012, pages 253--258, Charlottetown, PEI, Canada, 2012. [ bib | .pdf ]
[157]
O. Aichholzer, H. Cheng, S.L. Devadoss, T. Hackl, S. Huber, B. Li, and A. Risteski. What makes a Tree a Straight Skeleton? In Proc. 28th European Workshop on Computational Geometry EuroCG '12, pages 137--140, Assisi, Italy, 2012. [ bib | .pdf ]
[158]
O. Aichholzer, T. Hackl, and B. Vogtenhuber. On 5-Gons and 5-Holes. In A. Marquez, P. Ramos, and J. Urrutia, editors, Computational Geometry: XIV Spanish Meeting on Computational Geometry, EGC 2011, Festschrift Dedicated to Ferran Hurtado on the Occasion of His 60th Birthday, Alcalá de Henares, Spain, June 27-30, 2011, Revised Selected Papers, volume 7579 of Lecture Notes in Computer Science (LNCS), pages 1--13. Springer, 2012. [ bib | .pdf ]
[159]
O. Aichholzer, G. Rote, A. Schulz, and B. Vogtenhuber. Pointed Drawings of Planar Graphs. Computational Geometry: Theory and Applications, pages 482--494, 2012. special issue of CCCG 2007. [ bib | DOI | .pdf ]
[160]
O. Aichholzer, F. Hurtado, and B. Vogtenhuber. Compatible Matchings for Bichromatic Plane Straight-line Graphs. In Proc. 28th European Workshop on Computational Geometry EuroCG '12, pages 257--260, Assisi, Italy, 2012. [ bib | .pdf ]
[161]
O. Aichholzer, F. Aurenhammer, E.D. Demaine, F. Hurtado, P. Ramos, and J. Urrutia. On k-convex polygons. Computational Geometry: Theory and Applications, 45(3):73--87, 2012. [ bib | .pdf ]
[162]
O. Aichholzer, S.R. Allen, G. Aloupis, L. Barba, P. Bose, S. Langerman, and J. Iacono. Sum of Squared Edges for MST of a Point Set in a Unit Square. In Proc. 22nd Annual Fall Workshop on Computational Geometry, University of Maryland, Maryland, USA, 2012. [ bib ]
[163]
Bernardo M. Ábrego, Oswin Aichholzer, Silvia Fernández-Merchant, Pedro Ramos, and Gelasio Salazar. The 2-page crossing number of Kn. In 28th Ann. ACM Symp. Computational Geometry, pages 397--403, Chapel Hill, NC, USA, 2012. [ bib | .pdf ]
[164]
O. Aichholzer, M. Cetina, R. Fabila-Monroy, J. Leaños, G. Salazar, and J. Urrutia. Convexifying monotone polygons while maintaining internal visibility. In A. Marquez, P. Ramos, and J. Urrutia, editors, Special issue: XIV Encuentros de Geometría Computacional ECG2011, volume 7579 of Lecture Notes in Computer Science (LNCS), pages 98--108. Springer, 2012. [ bib | .pdf ]
[165]
Oswin Aichholzer, Ruy Fabila-Monroy, Hernan Gonzalez-Aguilar, Thomas Hackl, Marco A. Heredia, Clemens Huemer, Jorge Urrutia, Pavel Valtr, and Birgit Vogtenhuber. On k-Gons and k-Holes in Point Sets. In Proc. 23rd Annual Canadian Conference on Computational Geometry CCCG 2011, pages 21--26, Toronto, Canada, 2011. [ bib | .pdf ]
[166]
O. Aichholzer, T. Hackl, and B. Vogtenhuber. On 5-gons and 5-holes. In Proc. XIV Encuentros de Geometría Computacional, pages 7--10, Alcalá, Spain, 2011. [ bib | .pdf ]
[167]
O. Aichholzer, R. Fabila-Monroy, H. González-Aguilar, T. Hackl, M.A. Heredia, C. Huemer, J. Urrutia, and B. Vogtenhuber. 4-Holes in Point Sets. In Proc. 27th European Workshop on Computational Geometry EuroCG '11, pages 115--118, Morschach, Switzerland, 2011. [ bib | .pdf ]
[168]
O. Aichholzer, W. Aigner, T. Hackl, and N. Wolpert. Exact medial axis computation for circular arc boundaries. In J.D. Boissonat, M.L. Mazure, and L.L. Schumaker, editors, Proc. 7th International Conference on Curves and Surfaces 2010 (Avignon, France), LNCS 6920, number 6920 in Lecture Notes in Computer Science (LNCS), pages 28--42, Avignon, France, 2011. Springer. [ bib | .pdf ]
[169]
O. Aichholzer, F. Aurenhammer, T. Hackl, B. Jüttler, M. Oberneder, and Z. Sír. Computational and Structural Advantages of Circular Boundary Representation. Int'l. Journal of Computational Geometry & Applications, 21(1):47--69, 2011. [ bib | .pdf ]
[170]
O. Aichholzer, W. Aigner, F. Aurenhammer, and B. Jüttler. Exact medial axis computation for triangulated solids with respect to piecewise linear metrics. In J.D. Boissonat, M.L. Mazure, and L.L. Schumaker, editors, Proc. 7th International Conference on Curves and Surfaces 2010 (Avignon, France), number 6920 in Lecture Notes in Computer Science, pages 1--27, Avignon, France, 2011. Springer. [ bib | .pdf ]
[171]
O. Aichholzer, W. Aigner, F. Aurenhammer, B. Jüttler K.Č Dobiášová, and G. Rote. Triangulations with circular arcs. In 19th Symposium on Graph Drawing 2011 (Eindhoven, The Netherlands), pages 296--307, 2011. [ bib | .pdf ]
[172]
Oswin Aichholzer, Greg Aloupis, Erik D. Demaine, Martin L. Demaine, Vida Dujmović, Ferran Hurtado, Anna Lubiw, Günter Rote, André Schulz, Diane L. Souvaine, and Andrew Winslow. Convexifying Polygons Without Losing Visibilities. In Proc. 23rd Annual Canadian Conference on Computational Geometry CCCG 2011, pages 229--234, Toronto, Canada, 2011. [ bib | .pdf ]
[173]
O. Aichholzer, A. García, F. Hurtado, and J. Tejel. Compatible matchings in geometric graphs. In Proc. XIV Encuentros de Geometría Computacional, pages 145--148, Alcalá, Spain, 2011. [ bib | .pdf ]
[174]
B.M. Ábrego, O. Aichholzer, S. Fernández-Merchant, J. Leaños, and G. Salazar. There is a unique crossing-minimal rectilinear drawing of K18. In Electronic Notes in Discrete Mathematics, volume 38, pages 547--552, 2011. [ bib | .pdf ]
[175]
O. Aichholzer, M. Cetina, R. Fabila-Monroy, J. Leaños, G. Salazar, and J. Urrutia. Convexifying monotone polygons while maintaining internal visibility. In Proc. XIV Encuentros de Geometría Computacional, pages 35--38, Alcalá, Spain, 2011. [ bib | .pdf ]
[176]
Oswin Aichholzer, Daniel Detassis, Thomas Hackl, Gerald Steinbauer, and Johannes Thonhauser. "Playing Pylos with an Autonomous Robot". In IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), pages 2507--2508, Taipei, Taiwan, 2010. [ bib | .pdf ]
[177]
O. Aichholzer, T. Hackl, and B. Vogtenhuber. Compatible Pointed Pseudo-Triangulations. In Proc. 22nd Annual Canadian Conference on Computational Geometry CCCG 2010, pages 91--94, Winnipeg, Manitoba, Canada, 2010. [ bib | .pdf ]
[178]
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 ]
[179]
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 ]
[180]
O. Aichholzer, T. Hackl, C. Huemer, F. Hurtado, and B. Vogtenhuber. Large bichromatic point sets admit empty monochromatic 4-gons. SIAM Journal on Discrete Mathematics (SIDMA), 23(4):2147--2155, 2010. [ bib | DOI | .pdf ]
[181]
O. Aichholzer, W. Aigner, F. Aurenhammer, T. Hackl, B. Jüttler, E. Pilgerstorfer, and M. Rabl. Divide-and conquer for Voronoi diagrams revisited. Computational Geometry: Theory and Applications, 43(8):688--699, 2010. Special Issue on the 25th Annual Symposium on Computational Geometry (SoCG'09). [ bib | DOI | .pdf ]
[182]
O. Aichholzer, S. Cabello, R. Fabila-Monroy, D. Flores-Peñaloza, T. Hackl, C. Huemer, F. Hurtado, and D.R. Wood. Edge-Removal and Non-Crossing Configurations in Geometric Graphs. Discrete Mathematics & Theoretical Computer Science (DMTCS), 12(1):75--86, 2010. [ bib | .pdf ]
[183]
O. Aichholzer, W. Aigner, F. Aurenhammer, K.Č Dobiášová, and B. Jüttler. Arc Triangulations. In Proc. 26th European Workshop on Computational Geometry EuroCG '10, pages 17--20, Dortmund, Germany, 2010. [ bib | .pdf ]
[184]
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 ]
[185]
O. Aichholzer, T. Hackl, D. Orden, P. Ramos, G. Rote, A. Schulz, and B. Speckmann. Flip Graphs of Bounded-Degree Triangulations. In Electronic Notes in Discrete Mathematics: Proc. European Conference on Combinatorics, Graph Theory and Applications EuroComb 2009, volume 34, pages 509--513, Bordeaux, France, 2009. [ bib | arXiv | .pdf ]
[186]
O. Aichholzer, F. Aurenhammer, O. Devillers, T. Hackl, M. Teillaud, and B. Vogtenhuber. Lower and upper bounds on the number of empty cylinders and ellipsoids. In Proc. 25th European Workshop on Computational Geometry EuroCG '09, pages 139--142, Brussels, Belgium, 2009. [ bib | .pdf ]
[187]
O. Aichholzer, T. Hackl, C. Huemer, F. Hurtado, and B. Vogtenhuber. Large bichromatic point sets admit empty monochromatic 4-gons. In Proc. 25th European Workshop on Computational Geometry EuroCG '09, pages 133--136, Brussels, Belgium, 2009. [ bib | .pdf ]
[188]
O. Aichholzer, R. Fabila-Monroy, D. Flores-Peñaloza, T. Hackl, C. Huemer, J. Urrutia, and B. Vogtenhuber. Modem Illumination of Monotone Polygons. In Proc. 25th European Workshop on Computational Geometry EuroCG '09, pages 167--170, Brussels, Belgium, 2009. [ bib | .pdf ]
[189]
O. Aichholzer, W. Aigner, F. Aurenhammer, T. Hackl, B. Jüttler, E. Pilgerstorfer, and M. Rabl. Divide-and-Conquer for Voronoi Diagrams Revisited. In 25th Ann. ACM Symp. Computational Geometry, pages 189--197, Aarhus, Denmark, 2009. [ bib | .pdf ]
[190]
O. Aichholzer, W. Aigner, F. Aurenhammer, T. Hackl, B. Jüttler, E. Pilgerstorfer, and M. Rabl. Divide-and-Conquer for Voronoi Diagrams Revisited. In Proc. 25th European Workshop on Computational Geometry EuroCG '09, pages 293--296, Brussels, Belgium, 2009. [ bib | .pdf ]
[191]
O. Aichholzer, R. Fabila-Monroy, D. Flores-Peñaloza, T. Hackl, C. Huemer, and J. Urrutia. Empty Monochromatic Triangles. Computational Geometry: Theory and Applications, 42(9):934--938, 2009. [ bib | DOI | .pdf ]
[192]
O. Aichholzer, W. Aigner, F. Aurenhammer, T. Hackl, B. Jüttler, and M. Rabl. Medial Axis Computation for Planar Free-Form Shapes. Computer-Aided Design, 41(5):339--349, 2009. Special issue: Voronoi Diagrams and their Applications. [ bib | DOI | .pdf ]
[193]
O. Aichholzer, F. Aurenhammer, T. Hackl, and B. Speckmann. On Minimum Weight Pseudo-Triangulations. Computational Geometry: Theory and Applications, 42(6-7):627--631, 2009. [ bib | .pdf ]
[194]
O. Aichholzer, S. Bereg, A. Dumitrescu, A. García, C. Huemer, F. Hurtado, M. Kano, A. Márquez, D. Rappaport, S. Smorodinsky, D. Souvaine, J. Urrutia, and D. Wood. Compatible Geometric Matchings. Computational Geometry: Theory and Applications, 42(6-7):617--626, 2009. [ bib | .pdf ]
[195]
O. Aichholzer, F. Aurenhammer, F. Hurtado, P. Ramos, and J. Urrutia. Two-Convex Polygons. In Proc. 25th European Workshop on Computational Geometry EuroCG '09, pages 117--120, Brussels, Belgium, 2009. [ bib | .pdf ]
[196]
O. Aichholzer, J. García, D. Orden, and P.A. Ramos. New results on lower bounds for the number of (<=k)-facets. European Journal of Combinatorics, 30:1568--1574, 2009. [ bib | .pdf ]
[197]
O. Aichholzer. [Empty] [colored] k-gons - Recent results on some Erdös-Szekeres type problems. In Proc. XIII Encuentros de Geometría Computacional, pages 43--52, Zaragoza, Spain, 2009. [ bib | .pdf ]
[198]
O. Aichholzer, F. Aurenhammer, B. Kornberger, S. Plantinga, G. Rote, A. Sturm, and G. Vegter. Recovering Structure from r-Sampled Objects. In Eurographics Symposium on Geometry Processing, special issue of Computer Graphics Forum 28(5), pages 1349--1360, Berlin, Germany, 2009. [ bib | .pdf ]
[199]
E. Ackerman, O. Aichholzer, and B. Keszegh. Improved Upper Bounds on the Reflexivity of Point Sets. Computational Geometry: Theory and Applications, 42:241--249, 2009. [ bib | .pdf ]
[200]
O. Aichholzer, R. Fabila-Monroy, D. Flores-Peñaloza, T. Hackl, C. Huemer, and J. Urrutia. Empty Monochromatic Triangles. In Proc. 20th Annual Canadian Conference on Computational Geometry CCCG 2008, pages 75--78, Montreal, Quebec, Canada, 2008. [ bib | .pdf ]
[201]
O. Aichholzer, S. Cabello, R. Fabila-Monroy, D. Flores-Peñaloza, T. Hackl, C. Huemer, F. Hurtado, and D.R. Wood. Edge-Removal and Non-Crossing Configurations in Geometric Graphs. In Proc. 24th European Workshop on Computational Geometry EuroCG '08, pages 119--122, Nancy, France, 2008. [ bib | .pdf ]
[202]
O. Aichholzer, F. Aurenhammer, T. Hackl, B. Kornberger, S. Plantinga, G. Rote, A. Sturm, and G. Vegter. Seed Polytopes for Incremental Approximation. In Proc. 24th European Workshop on Computational Geometry EuroCG '08, pages 13--16, Nancy, France, 2008. [ bib | .ps.gz ]
[203]
O. Aichholzer, F. Aurenhammer, P. Gonzalez-Nava, T. Hackl, C. Huemer, F. Hurtado, H. Krasser, S. Ray, and B. Vogtenhuber. Matching Edges and Faces in Polygonal Partitions. Computational Geometry: Theory and Applications, 39(2):134--141, 2008. [ bib | .ps.gz ]
[204]
O. Aichholzer, S. Bereg, A. Dumitrescu, A. García, C. Huemer, F. Hurtado, M. Kano, A. Márquez, D. Rappaport, S. Smorodinsky, D. Souvaine, J. Urrutia, and D. Wood. Compatible Geometric Matchings. Electronic Notes in Discrete Mathematics, 31:201--206, 2008. [ bib | DOI | .pdf ]
[205]
O. Aichholzer, S. Bereg, A. Dumitrescu, A. García, C. Huemer, F. Hurtado, M. Kano, A. Márquez, D. Rappaport, S. Smorodinsky, D. Souvaine, J. Urrutia, and D. Wood. Compatible Geometric Matchings. In Proc. 1st Topological & Geometric Graph Theory 2008, pages 194--199, Paris, France, 2008. [ bib | .pdf ]
[206]
O. Aichholzer, D. Orden, F. Santos, and B. Speckmann. On the Number of Pseudo-Triangulations of Certain Point Sets. Journal of Combinatorial Theory, Series A, 115(2):254--278, 2008. [ bib | .pdf ]
[207]
O. Aichholzer, C. Huemer, and H. Krasser. Triangulations Without Pointed Spanning Trees. Computational Geometry: Theory and Applications, 40(1):79--83, 2008. [ bib | .pdf ]
[208]
O. Aichholzer and T. Hackl, editors. Collection of Abstracts of the 23rd European Workshop on Computational Geometry 2007, Graz, Austria, 2007. [ bib ]
[209]
O. Aichholzer, T. Hackl, M. Hoffmann, C. Huemer, A. Por, F. Santos, B. Speckmann, and B. Vogtenhuber. Maximizing Maximal Angles for Plane Straight Line Graphs. In Lecture Notes in Computer Science (LNCS), Proc. 10th International Workshop on Algorithms and Data Structures (WADS), volume 4619, pages 458--469, Halifax, Nova Scotia, Canada, 2007. [ bib | DOI | arXiv | .pdf ]
[210]
O. Aichholzer, T. Hackl, M. Hoffmann, C. Huemer, F. Santos, B. Speckmann, and B. Vogtenhuber. Maximizing Maximal Angles for Plane Straight Line Graphs. In Proc. 23rd European Workshop on Computational Geometry EuroCG '07, pages 98--101, Graz, Austria, 2007. [ bib | arXiv | .pdf ]
[211]
O. Aichholzer, F. Aurenhammer, T. Hackl, B. Jüttler, M. Oberneder, and Z. Sír. Computational and Structural Advantages of Circular Boundary Representation. In Lecture Notes in Computer Science (LNCS), Proc. 10th International Workshop on Algorithms and Data Structures (WADS), volume 4619, pages 374--385, Halifax, Nova Scotia, Canada, 2007. [ bib | .ps.gz ]
[212]
O. Aichholzer, F. Aurenhammer, T. Hackl, B. Kornberger, M. Peternell, and H. Pottmann. Approximating Boundary-Triangulated Objects with Balls. In Proc. 23rd European Workshop on Computational Geometry EuroCG '07, pages 130--133, Graz, Austria, 2007. [ bib | .pdf ]
[213]
O. Aichholzer, F. Aurenhammer, T. Hackl, and B. Speckmann. On (Pointed) Minimum Weight Pseudo-Triangulations. In Proc. 19th Annual Canadian Conference on Computational Geometry CCCG 2007, pages 209--212, Ottawa, Ontario, Canada, 2007. [ bib | .pdf ]
[214]
O. Aichholzer, F. Aurenhammer, T. Hackl, and C. Huemer. Connecting Colored Point Sets. Discrete Applied Mathematics, 155(3):271--278, 2007. [ bib | .ps.gz ]
[215]
O. Aichholzer, F. Aurenhammer, and T. Hackl. Pre-triangulations and liftable complexes. Discrete & Computational Geometry, 38:701--725, 2007. [ bib | .ps.gz ]
[216]
O. Aichholzer, T. Hackl, C. Huemer, F. Hurtado, H. Krasser, and B. Vogtenhuber. On the number of plane geometric graphs. Graphs and Combinatorics (Springer), 23(1):67--84, 2007. [ bib | DOI | .ps.gz ]
[217]
O. Aichholzer, J. García, D. Orden, and P.A. Ramos. New lower bounds for the number of (<=k)-edges and the rectilinear crossing number of kn. Discrete & Computational Geometry, 38:1--14, 2007. [ bib | .ps.gz ]
[218]
O. Aichholzer, G. Rote, A. Schulz, and B. Vogtenhuber. Pointed Drawings of Planar Graphs. In Proc. 19th Annual Canadian Conference on Computational Geometry CCCG 2007, pages 237--240, Ottawa, Ontario, Canada, 2007. [ bib | .pdf ]
[219]
O. Aichholzer, C. Huemer, S. Kappes, B. Speckmann, and C. D. Tóth. Decompositions, Partitions, and Coverings with Convex Polygons and Pseudo-Triangles. Graphs and Combinatorics, 23(5):481--507, 2007. [ bib | .pdf ]
[220]
O. Aichholzer and K. Reinhardt. A quadratic distance bound on sliding between crossing-free spanning trees. Computational Geometry: Theory and Applications, special issue, 37:155--161, 2007. [ bib | .ps.gz ]
[221]
O. Aichholzer, J. García, D. Orden, and P.A. Ramos. New results on lower bounds for the number of (<=k)-facets. In Proceedings EuroComb'07, Electronic Notes in Discrete Mathematics, volume 29C, pages 189--193, 2007. [ bib | .pdf ]
[222]
E. Ackerman, O. Aichholzer, and B. Keszegh. Improved Upper Bounds on the Reflexivity of Point Sets. In Proc. 19th Annual Canadian Conference on Computational Geometry CCCG 2007, pages 29--32, Ottawa, Ontario, Canada, 2007. [ bib | .pdf ]
[223]
O. Aichholzer, F. Aurenhammer, C. Huemer, and B. Vogtenhuber. Gray code enumeration of plane straight-line graphs. Graphs and Combinatorics (Springer), 23(5):467--479, 2007. [ bib | DOI | .pdf ]
[224]
O. Aichholzer, F. Aurenhammer, and T. Hackl. Pre-triangulations and liftable complexes. In 22nd Ann. ACM Symp. Computational Geometry, pages 282--291, Sedona, Arizona, USA, 2006. [ bib | .ps.gz ]
[225]
O. Aichholzer, T. Hackl, C. Huemer, F. Hurtado, H. Krasser, and B. Vogtenhuber. On the number of plane graphs. In Proc. 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 504--513, Miami, Florida, USA, 2006. [ bib | .pdf ]
[226]
O. Aichholzer and H. Krasser. Abstract Order Type Extension and New Results on the Rectilinear Crossing Number. Computational Geometry: Theory and Applications, Special Issue on the 21st European Workshop on Computational Geometry, 36(1):2--15, 2006. [ bib | .ps.gz ]
[227]
O. Aichholzer, F. Aurenhammer, C. Huemer, and H. Krasser. Transforming Spanning Trees and Pseudo-Triangulations. Information Processing Letters (IPL), 97(1):19--22, 2006. [ bib | .ps.gz | .pdf ]
[228]
O. Aichholzer, C. Huemer, S. Renkl, B. Speckmann, and C. D. Tóth. Decompositions, Partitions, and Coverings with Convex Polygons and Pseudo-Triangles. In Pawel Urzyczyn Rastislav Královic, editor, Proceedings 31st International Symposium on Mathematical Foundations of Computer Science, Lecture Notes in Computer Science, volume 4162, pages 86--97, Stará Lesná, Slovakia, 2006. [ bib | .pdf ]
[229]
O. Aichholzer, F. Aurenhammer, C. Huemer, and B. Vogtenhuber. Gray code enumeration of plane straight-line graphs. In Proc. 22nd European Workshop on Computational Geometry EuroCG '06, pages 71--74, Delphi, Greece, 2006. [ bib | .ps.gz ]
[230]
O. Aichholzer, D. Orden, and P.A. Ramos. On the Structure of sets attaining the rectilinear crossing number. In Proc. 22nd European Workshop on Computational Geometry EuroCG '06, pages 43--46, Delphi, Greece, 2006. [ bib | .pdf ]
[231]
O. Aichholzer, J. García, D. Orden, and P.A. Ramos. New lower bounds for the number of (<=k)-edges and the rectilinear crossing number of kn. In Actas de las IV Jornadas de Matematica Discreta y Algoritmica, pages 57--64, 2006. [ bib | .ps.gz ]
[232]
O. Aichholzer, F. Aurenhammer, and H. Krasser. On the Crossing Number of Complete Graphs. Computing, 76:165--176, 2006. [ bib | .ps.gz ]
[233]
O. Aichholzer, T. Hackl, C. Huemer, F. Hurtado, H. Krasser, and B. Vogtenhuber. Bounding the number of plane graphs. In Proc. 15th Annual Fall Workshop on Computational Geometry and Visualization, pages 31--32, Philadelphia, Pennsylvania, USA, 2005. [ bib ]
[234]
O. Aichholzer, F. Aurenhammer, P. Gonzalez-Nava, T. Hackl, C. Huemer, F. Hurtado, H. Krasser, S. Ray, and B. Vogtenhuber. Matching Edges and Faces in Polygonal Partitions. In Proc. 17th Annual Canadian Conference on Computational Geometry CCCG 2005, pages 123--126, Windsor, Ontario, Canada, 2005. [ bib | .ps.gz ]
[235]
O. Aichholzer, F. Aurenhammer, C. Huemer, and H. Krasser. Transforming Spanning Trees and Pseudo-Triangulations. In Proc. 21th European Workshop on Computational Geometry EWCG '05, pages 81--84, Eindhoven, The Nederlands, 2005. [ bib | .ps.gz | .pdf ]
[236]
O. Aichholzer, D. Bremner, E.D. Demaine, F. Hurtado, E. Kranakis, H. Krasser, S. Ramaswami, S. Sethia, and J. Urrutia. Games on Triangulations. Theoretical Computer Science, 343(1-2):42--71, 2005. [ bib | .pdf ]
[237]
O. Aichholzer, C. Huemer, S. Renkl, B. Speckmann, and C. D. Tóth. On Pseudo-Convex Decompositions, Partitions, and Coverings. In Proc. 21th European Workshop on Computational Geometry EWCG '05, pages 89--92, Eindhoven, The Nederlands, 2005. [ bib | .ps.gz | .pdf ]
[238]
O. Aichholzer and H. Krasser. Abstract Order Type Extension and New Results on the Rectilinear Crossing Number. In Proc. 21th Ann. ACM Symp. Computational Geometry, pages 91--98, Pisa, Italy, 2005. [ bib | .ps.gz ]
[239]
O. Aichholzer and H. Krasser. Abstract Order Type Extension and New Results on the Rectilinear Crossing Number. In Proc. 21th European Workshop on Computational Geometry EWCG '05, pages 61--64, Eindhoven, The Nederlands, 2005. [ bib | .ps.gz | .pdf ]
[240]
O. Aichholzer, D. Orden, F. Santos, and B. Speckmann. On the Number of Pseudo-Triangulations of Certain Point Sets. In Proc. 20th European Workshop on Computational Geometry EWCG '04, pages 119--122, Sevilla, Spain, 2004. [ bib | .ps.gz ]
[241]
O. Aichholzer, F. Aurenhammer, and B. Palop. Quickest Paths, Straight Skeletons, and the City Voronoi Diagram. Discrete & Computational Geometry, 31(1):17--35, 2004. [ bib | .ps.gz ]
[242]
O. Aichholzer and K. Reinhardt. A quadratic distance bound on sliding between crossing-free spanning trees - Extended Abstract. In Proc. 20th European Workshop on Computational Geometry EWCG '04, pages 13--16, Sevilla, Spain, 2004. [ bib | .ps.gz ]
[243]
O. Aichholzer, C. Huemer, and H. Krasser. Triangulations Without Pointed Spanning Trees - Extended Abstract. In Proc. 20th European Workshop on Computational Geometry EWCG '04, pages 221--224, Sevilla, Spain, 2004. [ bib | .ps.gz ]
[244]
O. Aichholzer, F. Hurtado, and M. Noy. A Lower Bound on the Number of Triangulations of Planar Point Sets. Computational Geometry: Theory and Applications, 29(2):135--145, 2004. [ bib | .ps.gz | .pdf ]
[245]
O. Aichholzer, F. Aurenhammer, H. Krasser, and B. Speckmann. Convexity Minimizes Pseudo-Triangulations. Computational Geometry: Theory and Applications, 28(1):3--10, 2004. [ bib | .ps.gz ]
[246]
O. Aichholzer, M. Hoffmann, B. Speckmann, and C. D. Tóth. Degree Bounds for Constrained Pseudo-Triangulations. In Proc. 15th Annual Canadian Conference on Computational Geometry CCCG 2003, pages 155--158, Halifax, Nova Scotia, Canada, 2003. [ bib | .ps.gz ]
[247]
O. Aichholzer, D. Orden, F. Santos, and B. Speckmann. On the Number of Pseudo-Triangulations of Certain Point Sets. In Proc. 15th Annual Canadian Conference on Computational Geometry CCCG 2003, pages 141--144, Halifax, Nova Scotia, Canada, 2003. [ bib | .ps.gz ]
[248]
O. Aichholzer, F. Aurenhammer, P. Brass, and H. Krasser. Pseudo-Triangulations from Surfaces and a Novel Type of Edge Flip. SIAM Journal on Computing, 32:1621--1653, 2003. [ bib | .ps.gz ]
[249]
O. Aichholzer, D. Bremner, E.D. Demaine, D. Meijer, V. Sacristán, and M. Soss. Long Proteins with Unique Optimal Foldings in the H-P Model. Computational Geometry: Theory and Applications, 25:139--159, 2003. [ bib | .ps.gz ]
[250]
O. Aichholzer, G. Rote, B. Speckmann, and I. Streinu. The Zigzag Path of a Pseudo-Triangulation. In Lecture Notes in Computer Science, Proc. 8th International Workshop on Algorithms and Data Structures (WADS), volume 2748, pages 377--389, 2003. [ bib | .ps.gz ]
[251]
O. Aichholzer, F. Aurenhammer, and H. Krasser. Adapting (Pseudo)-Triangulations with a Near-Linear Number of Edge Flips. In Lecture Notes in Computer Science 2748, Proc. 8th International Workshop on Algorithms and Data Structures (WADS), volume 2748, pages 12--24, 2003. [ bib | .ps.gz ]
[252]
O. Aichholzer, F. Aurenhammer, F. Hurtado, and H. Krasser. Towards Compatible Triangulations. Theoretical Computer Science, 296:3--13, 2003. Special Issue. [ bib | .ps.gz ]
[253]
O. Aichholzer, F. Aurenhammer, P. Brass, and H. Krasser. Spatial Embedding of Pseudo-Triangulations. In Proc. 19th Ann. ACM Symp. Computational Geometry, volume 19, pages 144--153, San Diego, California, USA, 2003. [ bib | .ps.gz ]
[254]
O. Aichholzer, D. Bremner, E.D. Demaine, F. Hurtado, E. Kranakis, H. Krasser, S. Ramaswami, S. Sethia, and J. Urrutia. Geometric Games on Triangulations. In Proc. 19th European Workshop on Computational Geometry CG '03 Bonn, pages 89--92, Bonn, Germany, 2003. [ bib | .ps.gz ]
[255]
O. Aichholzer, D. Bremner, E.D. Demaine, F. Hurtado, E. Kranakis, H. Krasser, S. Ramaswami, S. Sethia, and J. Urrutia. Playing with Triangulations. In Lecture Notes in Computer Science 2866, Japanese Conference, JCDCG 2002, pages 22--37, 2003. [ bib | .ps.gz ]
[256]
O. Aichholzer, F. Aurenhammer, and T. Werner. Algorithmic Fun - Abalone. Special Issue on Foundations of Information Processing of TELEMATIK, 1:4--6, 2002. [ bib | .ps.gz ]
[257]
O. Aichholzer, D. Bremner, E.D. Demaine, F. Hurtado, E. Kranakis, H. Krasser, S. Ramaswami, S. Sethia, and J. Urrutia. Playing with Triangulations. In Proc. Japan Conference on Discrete and Computational Geometry JCDCG 2002, pages 46--54, Tokyo, Japan, 2002. [ bib | .ps.gz ]
[258]
O. Aichholzer, B. Speckmann, and I. Streinu. The Path of a Pseudo-Triangulation. In Abstracts of the DIMACS Workshop on Computational Geometry 2002, page 2, Piscataway (NJ), USA, 2002. [ bib | .pdf ]
[259]
O. Aichholzer, F. Aurenhammer, H. Krasser, and B. Speckmann. Convexity Minimizes Pseudo-Triangulations. In Proc. 14th Annual Canadian Conference on Computational Geometry CCCG 2002, pages 158--161, Lethbridge, Alberta, Canada, 2002. [ bib | .ps.gz ]
[260]
O. Aichholzer, F. Aurenhammer, and H. Krasser. On the Crossing Number of Complete Graphs. In Proc. 18th Ann. ACM Symp. Computational Geometry, pages 19--24, Barcelona, Spain, 2002. [ bib | .ps.gz ]
[261]
O. Aichholzer and F. Aurenhammer. Voronoi Diagrams - Computational Geometry's Favorite. Special Issue on Foundations of Information Processing of TELEMATIK, 1:7--11, 2002. [ bib | .ps.gz ]
[262]
O. Aichholzer, F. Aurenhammer, and H. Krasser. On the Crossing Number of Complete Graphs - Extended Abstract. In Proc. 18th European Workshop on Computational Geometry CG '02 Warszawa, pages 90--92, Warszawa, Poland, 2002. [ bib | .ps.gz ]
[263]
O. Aichholzer, C. Cortés, E.D. Demaine, V. Dujmović, J. Erickson, H. Meijer, M. Overmars, B. Palop, S. Ramaswami, and G.T. Toussaint. Flipturning Polygons. Discrete & Computational Geometry, 28(2):231--253, 2002. [Report UU-CS-2000-31, Universiteit Utrecht, The Netherlands, 2000]. [ bib | .ps.gz ]
[264]
O. Aichholzer, L.S. Alboul, and F. Hurtado. On Flips in Polyhedral Surfaces. International Journal of Foundations of Computer Science (IJFCS), special issue on Volume and Surface Triangulations, 13(2):303--311, 2002. [ bib | .ps.gz ]
[265]
O. Aichholzer, F. Aurenhammer, and H. Krasser. Enumerating Order Types for Small Point Sets with Applications. Order, 19:265--281, 2002. [ bib | .ps.gz ]
[266]
O. Aichholzer, F. Aurenhammer, and H. Krasser. Progress on rectilinear crossing numbers. Technical report, IGI-TU Graz, Austria, 2002. [ bib | .ps.gz ]
[267]
O. Aichholzer, F. Aurenhammer, and H. Krasser. Points and Combinatorics. Special Issue on Foundations of Information Processing of TELEMATIK, 1:12--17, 2002. [ bib | .ps.gz ]
[268]
O. Aichholzer, F. Aurenhammer, and B. Palop. Quickest Paths, Straight Skeletons, and the City Voronoi Diagram. In Proc. 18th Ann. ACM Symp. Computational Geometry, pages 151--159, Barcelona, Spain, 2002. [ bib | .ps.gz ]
[269]
O. Aichholzer, F. Aurenhammer, and F. Hurtado. Sequences of spanning trees and a fixed tree theorem. Computational Geometry: Theory and Applications, 21(1--2):3--20, 2002. Special Issue. [Report MA2-IR-00-00026, Universitat Politećnica de Catalunya, Barcelona, Spain, 2000]. [ bib | .ps.gz ]
[270]
O. Aichholzer, F. Aurenhammer, C. Icking, R. Klein, E. Langetepe, and G. Rote. Generalized self-approaching curves. Discrete Applied Mathematics, 109(1-2):3--24, 2001. Special Issue. [SFB-Report F003-134, TU Graz, Austria, 1998]. [ bib | .ps.gz | .pdf ]
[271]
O. Aichholzer and H. Krasser. The Point Set Order Type Data Base: A Collection of Applications and Results. In Proc. 13th Annual Canadian Conference on Computational Geometry CCCG 2001, pages 17--20, Waterloo, Ontario, Canada, 2001. [ bib | .ps.gz ]
[272]
O. Aichholzer, F. Hurtado, and M. Noy. On the Number of Triangulations Every Planar Point Set Must Have. In Proc. 13th Annual Canadian Conference on Computational Geometry CCCG 2001, pages 13--16, Waterloo, Ontario, Canada, 2001. [ bib | .ps.gz ]
[273]
O. Aichholzer, F. Aurenhammer, and H. Krasser. Enumerating Order Types for Small Point Sets with Applications. In Proc. 17th Ann. ACM Symp. Computational Geometry, pages 11--18, Medford, Massachusetts, USA, 2001. [ bib | .ps.gz ]
[274]
O. Aichholzer, L.S. Alboul, and F. Hurtado. On Flips in Polyhedral Surfaces. In Proc. 17th European Workshop on Computational Geometry CG '2001, pages 27--30, Berlin, Germany, 2001. [ bib | .ps.gz ]
[275]
O. Aichholzer, F. Aurenhammer, and H. Krasser. On Compatible Triangulations of Point Sets. In Proc. 17th European Workshop on Computational Geometry CG '2001, pages 23--26, Berlin, Germany, 2001. [ bib | .ps.gz ]
[276]
O. Aichholzer, E.D. Demaine, J. Erickson, F. Hurtado, M. Overmars, M.A. Soss, and G.T. Toussaint. Reconfiguring Convex Polygons. Computational Geometry: Theory and Applications, 20:85--95, 2001. [Report UU-CS-2000-30, Universiteit Utrecht, The Netherlands, 2000]. [ bib | .ps.gz | .pdf ]
[277]
O. Aichholzer, D. Bremner, E.D. Demaine, D. Meijer, V. Sacristán, and M. Soss. Long Proteins with Unique Optimal Foldings in the H-P Model. In Proc. 17th European Workshop on Computational Geometry CG '2001, pages 59--62, Berlin, Germany, 2001. [ bib | .ps.gz ]
[278]
O. Aichholzer, F. Aurenhammer, B. Brandtstätter, H. Krasser, C. Magele, M. Mühlmann, and W. Renhart. Evolution Strategy and Hierarchical Clustering. In 13th COMPUMAG Conference on the Computation of Electromagnetic Fields, Lyon-Evian, France, 2001. [ bib | .ps.gz ]
[279]
O. Aichholzer, F. Aurenhammer, F. Hurtado, and H. Krasser. Towards Compatible Triangulations. In Jie Wang, editor, Proc. 7th Ann. Int'l. Computing and Combinatorics Conf. COCOON'01, Lecture Notes in Computer Science, volume 2108, pages 101--110, Guilin, China, 2001. Springer Verlag. [ bib | .ps.gz ]
[280]
O. Aichholzer, F. Aurenhammer, B. Brandtstätter, T. Ebner, H. Krasser, and C. Magele. Niching evolution strategy with cluster algorithms. In 9th Biennial IEEE Conf. Electromagnetic Field Computations, Milwaukee, Wisconsin, USA, 2000. [ bib | .ps.gz ]
[281]
O. Aichholzer, C. Cortés, E.D. Demaine, V. Dujmović, J. Erickson, H. Meijer, M. Overmars, B. Palop, S. Ramaswami, and G.T. Toussaint. Flipturning Polygons. In Proc. Japan Conference on Discrete and Computational Geometry JCDCG 2000, Tokay University, Tokyo, Japan, 2000. [ bib | .ps.gz ]
[282]
O. Aichholzer, F. Aurenhammer, and F. Hurtado. Edge Operations on Non-Crossing Spanning Trees. In Proc. 16th European Workshop on Computational Geometry CG '2000, pages 121--125, Eilat, Israel, 2000. [ bib | .ps.gz ]
[283]
O. Aichholzer. Extremal Properties of 0/1-Polytopes of Dimension 5. In G. Ziegler and G. Kalai, editors, Polytopes - Combinatorics and Computation, pages 111--130. Birkhäuser, 2000. [SFB-Report F003-132, TU Graz, Austria, 1998]. [ bib | .ps.gz ]
[284]
O. Aichholzer, E.D. Demaine, J. Erickson, F. Hurtado, M. Overmars, M.A. Soss, and G.T. Toussaint. Reconfiguring Convex Polygons. In Proc. 12th Annual Canadian Conference on Computational Geometry CCCG 2000, pages 17--20, Fredericton, New Brunswick, Canada, 2000. [ bib | .ps.gz ]
[285]
O. Aichholzer. The Path of a Triangulation. In Proc. 15th Ann. ACM Symp. Computational Geometry, pages 14--23, Miami Beach, Florida, USA, 1999. [ bib | .ps.gz ]
[286]
O. Aichholzer, F. Aurenhammer, D.Z. Chen, D.T. Lee, and E. Papadopoulou. Skew Voronoi diagrams. Int'l. Journal of Computational Geometry & Applications, 9:235--247, 1999. [ bib | .ps.gz ]
[287]
O. Aichholzer, F. Aurenhammer, and R. Hainz. New results on MWT subgraphs. Information Processing Letters, 69:215--219, 1999. [SFB Report F003-140, TU Graz, Austria, 1998]. [ bib | .ps.gz ]
[288]
O. Aichholzer, F. Aurenhammer, G. Rote, and Y.-F. Xu. Constant-level greedy triangulations approximate the MWT well. Journal of Combinatorial Optimization, 2:361--369, 1998. [SFB-Report F003-050, TU Graz, Austria, 1995]. [ bib | .ps.gz ]
[289]
O. Aichholzer, F. Aurenhammer, C. Icking, R. Klein, E. Langetepe, and G. Rote. Generalized self-approaching curves. In Proc. 14th European Workshop on Computational Geometry CG '98, pages 15--18, Barcelona, Spain, 1998. [ bib | .ps.gz ]
[290]
O. Aichholzer, F. Aurenhammer, C. Icking, R. Klein, E. Langetepe, and G. Rote. Generalized self-approaching curves. In Proc. 9th Int. Symp. Algorithms and Computation ISAAC'98, Lecture Notes in Computer Science, volume 1533, pages 317--326, Taejon, Korea, 1998. Springer Verlag. [ bib | .ps.gz ]
[291]
O. Aichholzer and F. Aurenhammer. Straight skeletons for general polygonal figures in the plane. In A.M. Samoilenko, editor, Voronoi's Impact on Modern Sciences II, volume 21, pages 7--21. Proc. Institute of Mathematics of the National Academy of Sciences of Ukraine, Kiev, Ukraine, 1998. [ bib | .ps.gz ]
[292]
O. Aichholzer. Efficient {0,1}-String Searching Based on Pre-clustering. In Proc. 14th European Workshop on Computational Geometry CG '98, pages 11--13, Barcelona, Spain, 1998. [SFB Report F003-94, TU Graz, Austria, 1996]. [ bib | .ps.gz ]
[293]
O. Aichholzer, H. Alt, and G. Rote. Matching Shapes with a Reference Point. Int'l Journal of Computational Geometry & Applications, 7(4):349--363, 1997. [ bib | .ps.gz ]
[294]
R. Hainz, O. Aichholzer, and F. Aurenhammer. New results on minimum-weight triangulations and the LMT skeleton. In Proc. 13th European Workshop on Computational Geometry CG '97, pages 4--6, Würzburg, Germany, 1997. [ bib | .ps.gz ]
[295]
O. Aichholzer, F. Aurenhammer, D.Z. Chen, D.T. Lee, A. Mukhopadhyay, and E. Papadopoulou. Voronoi diagrams for direction-sensitive distances (communication). In Proc. 13th Ann. ACM Symp. Computational Geometry, pages 418--420, Nice, France, 1997. [SFB Report F003-098, TU Graz, Austria, 1996]. [ bib | .ps.gz ]
[296]
O. Aichholzer. Combinatorial & Computational Properties of the Hypercube - New Results on Covering, Slicing, Clustering and Searching on the Hypercube. PhD thesis, IGI-TU Graz, Austria, 1997. [ bib | .ps.gz ]
[297]
O. Aichholzer. The Path of a Triangulation. In Proc. 13th European Workshop on Computational Geometry CG '97, pages 1--3, Würzburg, Germany, 1997. [ bib | .ps.gz ]
[298]
O. Aichholzer, F. Aurenhammer, S.-W. Cheng, N. Katoh, G. Rote, M. Taschwer, and Y.-F. Xu. Triangulations intersect nicely. Discrete & Computational Geometry, 16:339--359, 1996. Special Issue. [SFB Report F003-030, TU Graz, Austria, 1995]. [ bib | .ps.gz ]
[299]
O. Aichholzer and F. Aurenhammer. Classifying hyperplanes in hypercubes. SIAM Journal on Discrete Mathematics, 9(2):225--232, 1996. [IIG-Report-Series 408, TU Graz, Austria, 1995]. [ bib | .ps.gz ]
[300]
O. Aichholzer, F. Aurenhammer, G. Rote, and Y.-F. Xu. Constant-level greedy triangulations approximate the MWT well. In Cheng Du, Zhang, editor, Proc. 2nd Int'l. Symp. Operations Research & Applications ISORA'96, Lecture Notes in Operations Research, volume 2, pages 309--318, Guilin, P. R. China, 1996. World Publishing Corporation. [ bib | .ps.gz ]
[301]
O. Aichholzer, F. Aurenhammer, G. Rote, and Y.-F. Xu. New greedy triangulation algorithms. In Proc. 12th European Workshop on Computational Geometry CG '96, pages 11--14, Münster, Germany, 1996. [ bib | .ps.gz ]
[302]
O. Aichholzer and F. Aurenhammer. Straight skeletons for general polygonal figures. In Proc. 2nd Ann. Int'l. Computing and Combinatorics Conf. COCOON'96, Lecture Notes in Computer Science, volume 1090, pages 117--126, Hong Kong, 1996. Springer Verlag. [IIG-Report-Series 423, TU Graz, Austria, 1995]. [ bib | .ps.gz ]
[303]
O. Aichholzer. Clustering the Hypercube. SFB-Report F003-93, SFB 'Optimierung und Kontrolle', TU Graz, Austria, 1996. [ bib | .ps.gz ]
[304]
O. Aichholzer. Local properties of triangulations. In Proc. 11th European Workshop on Computational Geometry CG '95, pages 27--30, Hagenberg/Linz, Austria, 1995. [ bib | .ps.gz ]
[305]
O. Aichholzer, F. Aurenhammer, and G. Rote. Optimal graph orientation with storage applications. SFB-Report F003-51, SFB 'Optimierung und Kontrolle', TU Graz, Austria, 1995. [ bib | .ps.gz ]
[306]
O. Aichholzer, D. Alberts, F. Aurenhammer, and B. Gärtner. A novel type of skeleton for polygons. Journal of Universal Computer Science, 1(12):752--761, 1995. [IIG-Report-Series 424, TU Graz, Austria, 1995]. [ bib | .ps.gz ]
[307]
O. Aichholzer, D. Alberts, F. Aurenhammer, and B. Gärtner. Straight skeletons of simple polygons. In Proc. 4th Int. Symp. of LIESMARS, pages 114--124, Wuhan, P. R. China, 1995. [ bib | .ps.gz ]
[308]
O. Aichholzer, R.L.S. Drysdale, and G. Rote. A Simple Linear Time Greedy Triangulation Algorithm for Uniformly Distributed Points. IIG-Report-Series 408, TU Graz, Austria, 1995. Presented at the Workshop on Computational Geometry, Army MSI Cornell, Stony Brook, 1994. [ bib | .ps.gz ]
[309]
O. Aichholzer, F. Aurenhammer, G. Rote, and M. Taschwer. Triangulations intersect nicely. In Proc. 11th Ann. ACM Symp. Computational Geometry, pages 220--229, Vancouver, Canada, 1995. [ bib | .ps.gz ]
[310]
O. Aichholzer, H. Alt, and G. Rote. Matching Shapes with a Reference Point. In Proc. 10th European Workshop on Computational Geometry CG '94, pages 81--84, Santander, Spain, 1994. [ bib | .ps.gz ]
[311]
O. Aichholzer and F. Aurenhammer. Classifying hyperplanes in hypercubes. In Proc. 10th European Workshop on Computational Geometry CG '94, pages 53--57, Santander, Spain, 1994. [ bib | .ps.gz ]
[312]
O. Aichholzer, H. Alt, and G. Rote. Matching Shapes with a Reference Point. In Proc. 10th Ann. ACM Symp. Computational Geometry, pages 85--92, Stony Brook, New York, USA, 1994. [ bib | .ps.gz ]
[313]
O. Aichholzer and H. Hassler. A fast method for modulus reduction in Residue Number System. In Proc. epp'93, pages 41--54, Vienna, Austria, 1993. [IIG-Report-Series 312, TU Graz, Austria, 1991]. [ bib | .ps.gz ]
[314]
O. Aichholzer. Hyperebenen in Hyperkuben - Eine Klassifizierung und Quantifizierung. Master's thesis, IGI-TU Graz, Austria, 1992. [ bib | .ps.gz ]

This file was generated by bibtex2html 1.98.