Birgit Vogtenhuber‘s Publications

[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]

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 ]

[3]

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 ]

[4]

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 ]

[5]

Oswin Aichholzer, Alfredo García, Javier Tejel, Birgit Vogtenhuber, and Alexandra Weinberger. Recognizing rotation systems of generalized twisted drawings in O(n²) time. In Abstracts of the XX Spanish Meeting on Computational Geometry, page 69, Santiago de Compostela, Spain, 2023. [ bib | http ]

[6]

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 ]

[7]

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 K_n. In Patrizio Angelini and Reinhard von Hanxleden, editors, Graph Drawing and Network Visualization, pages 16--24, Cham, 2023. Springer International Publishing. [ bib | DOI | arXiv ]

[8]

Alfredo García, Javier Tejel, Birgit Vogtenhuber, and Alexandra Weinberger. Empty Triangles in Generalized Twisted Drawings of K_n. In Patrizio Angelini and Reinhard von Hanxleden, editors, Graph Drawing and Network Visualization, pages 40--48, Cham, 2023. Springer International Publishing. [ bib | DOI | arXiv ]

[9]

Oswin Aichholzer, Alfredo García, Irene Parada, Birgit Vogtenhuber, and Alexandra Weinberger. Shooting Stars in Simple Drawings of K_m,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 ]

[10]

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 ]

[11]

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 ]

[12]

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 ]

[13]

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 ]

[14]

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 ]

[15]

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 ]

[16]

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 ]

[17]

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 ]

[18]

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 ]

[19]

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 ]

[20]

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. 38^th European Workshop on Computational Geometry (EuroCG 2022), pages 31:1--31:6, Perugia, Italy, 2022. [ bib | http ]

[21]

Oswin Aichholzer, Thomas Hackl, Maarten Löffler, Alexander Pilz, Irene Parada, Manfred Scheucher, and Birgit Vogtenhuber. Blocking Delaunay Triangulations from Exterior. In Proc. 38^th European Workshop on Computational Geometry (EuroCG 2022), pages 9:1--9:7, Perugia, Italy, 2022. [ bib | arXiv | http ]

[22]

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. 38^th European Workshop on Computational Geometry (EuroCG 2022), pages 66:1--66:7, Perugia, Italy, 2022. [ bib | arXiv | http ]

[23]

Daniel Bertschinger, Henry Förster, and Birgit Vogtenhuber. Intersections of Double-Wedge Arrangements. In Proc. 38^th European Workshop on Computational Geometry (EuroCG 2022), pages 58:1--58:6, Perugia, Italy, 2022. [ bib | http ]

[24]

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 ]

[25]

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 ]

[26]

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 ]

[27]

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 ]

[28]

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 ]

[29]

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 K_n. 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 ]

[30]

Man-Kwun Chiu, Stefan Felsner, Manfred Scheucher, Felix Schröder, Raphael Steiner, and Birgit Vogtenhuber. Coloring Circle Arrangements: New 4-Chromatic Planar Graphs. In Proceedings of the 37th European Workshop on Computational Geometry (EuroCG2021), St. Petersburg, Germany, 2021. [ bib | .pdf ]

[31]

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 ]

[32]

Elena Arseneva, Linda Kleist, Boris Klemz, Maarten Löffler, André Schulz, Birgit Vogtenhuber, and Alexander Wolff. Adjacency Graphs of Polyhedral Surfaces. In Kevin Buchin and Éric Colin de Verdière, editors, 37th International Symposium on Computational Geometry (SoCG 2021), volume 189 of Leibniz International Proceedings in Informatics (LIPIcs), pages 11:1--11:17, Dagstuhl, Germany, 2021. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik. [ bib | DOI | http ]

[33]

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 ]

[34]

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 ]

[35]

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 ]

[36]

Robert Ganian, Thekla Hamm, Fabian Klute, Irene Parada, and Birgit Vogtenhuber. Crossing-optimal extension of simple drawings. In Proc. XIX Encuentros de Geometría Computacional, page 5, 2021. [ bib | http ]

[37]

Ruy Fabila-Monroy, Carlos Hidalgo-Toscano, Daniel Perz, and Birgit Vogtenhuber. No selection lemma for empty triangles. In Proc. XIX Encuentros de Geometría Computacional, page 36, 2021. [ bib | http ]

[38]

Robert Ganian, Thekla Hamm, Fabian Klute, Irene Parada, and Birgit Vogtenhuber. Crossing-Optimal Extension of Simple Drawings. In Nikhil Bansal, Emanuela Merelli, and James Worrell, editors, 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021), volume 198 of Leibniz International Proceedings in Informatics (LIPIcs), pages 72:1--72:17, Dagstuhl, Germany, 2021. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik. [ bib | DOI | http ]

[39]

Ruy Fabila-Monroy, Carlos Hidalgo-Toscano, Daniel Perz, and Birgit Vogtenhuber. No Selection Lemma for Empty Triangles. In Jaroslav Nešetřil, Guillem Perarnau, Juanjo Rué, and Oriol Serra, editors, Extended Abstracts EuroComb 2021, pages 720--725, Cham, 2021. Springer International Publishing. [ bib ]

[40]

Man-Kwun Chiu, Stefan Felsner, Manfred Scheucher, Felix Schröder, Raphael Steiner, and Birgit Vogtenhuber. Coloring Circle Arrangements: New 4-Chromatic Planar Graphs. In Jaroslav Nešetřil, Guillem Perarnau, Juanjo Rué, and Oriol Serra, editors, Extended Abstracts EuroComb 2021, pages 84--91, Cham, 2021. Springer International Publishing. [ bib ]

[41]

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 ]

[42]

David Flores-Peñaloza, Mikio Kano, Leonardo Martínez-Sandoval, David Orden, Javier Tejel, Csaba D. Tóth, Jorge Urrutia, and Birgit Vogtenhuber. Rainbow polygons for colored point sets in the plane. Discrete Mathematics, 344(7):112406, 2021. [ bib | DOI | http ]

[43]

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 ]

[44]

Jurek Czyzowicz, Konstantinos Georgiou, Evangelos Kranakis, Lata Narayanan, Jarda Opatrny, and Birgit Vogtenhuber. Evacuating Robots from a Disk Using Face-to-Face Communication. Discrete Mathematics & Theoretical Computer Science, 22(4), 2020. [ bib | arXiv | http ]

[45]

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 ]

[46]

Oswin Aichholzer, Alfredo García, Irene Parada, Birgit Vogtenhuber, and Alexandra Weinberger. Simple Drawings of K_m,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 ]

[47]

Elena Arseneva, Linda Kleist, Boris Klemz, Maarten Löffler, André Schulz, Birgit Vogtenhuber, and Alexander Wolff. Representing Graphs by Polygons with Side Contacts in 3D. In Proceedings of the 36th European Workshop on Computational Geometry (EuroCG2020), Würzburg, Germany, 2020. [ bib | .pdf ]

[48]

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 ]

[49]

Alan Arroyo, Fabian Klute, Irene Parada, Raimund Seidel, Birgit Vogtenhuber, and Tilo Wiedera. Inserting one edge into a simple drawing is hard. In 45th International Workshop on Graph-Theoretic Concepts in Computer Science, Leeds, United Kingdom, 2020. [ bib | DOI | arXiv ]

[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]

Jared Coleman, Evangelos Kranakis, Oscar Morales Ponce, Jaroslav Opatrny, Jorge Urrutia, and Birgit Vogtenhuber. Minimizing The Maximum Distance Traveled To Form Patterns With Systems of Mobile Robots. In Proc. 32^nd Annual Canadian Conference on Computational Geometry CCCG 2020, pages 73--79, Saskatoon, Saskatchewan, Canada, 2020. [ bib | arXiv | .pdf ]

[52]

Bahareh Banyassady, Man-Kwun Chiu, Matias Korman, Wolfgang Mulzer, André van Renssen, Marcel Roeloffzen, Paul Seiferth, Yannik Stein, Birgit Vogtenhuber, and Max Willert. Routing in polygonal domains. Computational Geometry, 87:101593, 2020. Special Issue on the 33rd European Workshop on Computational Geometry. [ bib | DOI | http ]

[53]

Carolina Medina, Irene Parada, Gelasio Salazar, and Birgit Vogtenhuber. Bounding the number of crossings for a particular class of drawings of K_n,n. In Proc. XVIII Encuentros de Geometría Computacional, page 34, Girona, Spain, 2019. [ bib | .pdf | .pdf ]

[54]

David Flores-Peñaloza, Mikio Kano, Leonardo Martínez-Sandoval, David Orden, Javier Tejel, Csaba D. Tóth, Jorge Urrutia, and Birgit Vogtenhuber. Perfect rainbow polygons for colored point sets in the plane. In Proc. XVIII Encuentros de Geometría Computacional, pages 43--46, Girona, Spain, 2019. [ bib | .pdf | .pdf ]

[55]

David Flores-Peñaloza, Mikio Kano, Leonardo Martínez-Sandoval, David Orden, Javier Tejel, Csaba D. Tóth, Jorge Urrutia, and Birgit Vogtenhuber. Perfect rainbow polygons for colored point sets in the plane. In Proc. 22nd Japan Conference on Discrete and Computational Geometry, Graphs, and Games (JCDCG3 2019), pages 57--58, Tokyo, Japan, 2019. [ bib | .pdf ]

[56]

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 R³ and (d-2)-flat configurations in R^d. Computational Geometry: Theory and Applications, 77:51--61, 2019. Special Issue of CCCG 2014. [ bib | DOI | http ]

[57]

Philipp Kindermann, Stephen Kobourov, Maarten Löffler, Martin Nöllenburg, André Schulz, and Birgit Vogtenhuber. Lombardi Drawings of Knots and Links. Journal of Computational Geometry, 10(1):444--476, 2019. [ bib | DOI | arXiv ]

[58]

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. 35^th European Workshop on Computational Geometry EuroCG '19, pages 23:1--23:7, Utrecht, The Netherlands, 2019. [ bib | .pdf | .pdf ]

[59]

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. 35^th European Workshop on Computational Geometry EuroCG '19, pages 56:1--56:7, Utrecht, The Netherlands, 2019. [ bib | .pdf | .pdf ]

[60]

Oswin Aichholzer, Irene Parada, Manfred Scheucher, Birgit Vogtenhuber, and Alexandra Weinberger. Shooting Stars in Simple Drawings of K_m,n. In Proc. 35^th European Workshop on Computational Geometry EuroCG '19, pages 59:1--59:6, Utrecht, The Netherlands, 2019. [ bib | arXiv | .pdf | .pdf ]

[61]

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 ]

[62]

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 ]

[63]

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 ]

[64]

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 ]

[65]

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 ]

[66]

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 ]

[67]

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 ]

[68]

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 ]

[69]

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 ]

[70]

Oswin Aichholzer, Lukas Andritsch, Karin Baur, and Birgit Vogtenhuber. Transformed flips in triangulations and matchings. submitted, pages 1--17, 2019. [ bib | arXiv ]

[71]

Clemens Huemer, Deborah Oliveros, Pablo Pérez-Lantero, Ferran Torra, and Birgit Vogtenhuber. On weighted sums of numbers of convex polygons in point sets. submitted, pages 1--23, 2019. [ bib | arXiv ]

[72]

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 ]

[73]

O. Aichholzer, M. Balko, T. Hackl, A. Pilz, P. Ramos, P. Valtr, and B. Vogtenhuber. Holes in 2-convex point sets. In Proc. 28^th International Workshop on Combinatorial Algorithms (IWOCA2017), volume 10765 of Lecture Notes in Computer Science (LNCS), pages 169--181, Newcastle, Australia, 2018. [ bib | DOI ]

[74]

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 ]

[75]

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 ]

[76]

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 K_n. SIAM Journal on Discrete Mathematics, 32(4):2482--2492, 2018. [ bib | DOI | arXiv ]

[77]

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 ]

[78]

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 ]

[79]

Jean Cardinal, Stefan Felsner, Tillmann Miltzow, Casey Tompkins, and Birgit Vogtenhuber. Intersection Graphs of Rays and Grounded Segments. Journal of Graph Algorithms and Applications, 22(2):273--295, 2018. [ bib | DOI | arXiv ]

[80]

Philipp Kindermann, Stephen Kobourov, Maarten Löffler, Martin Nöllenburg, André Schulz, and Birgit Vogtenhuber. Lombardi Drawings of Knots and Links. In Fabrizio Frati and Kwan-Liu Ma, editors, Graph Drawing and Network Visualization. GD 2017., pages 113--126, Boston, MA, USA, 2018. Springer, Cham. Revised Selected Papers. [ bib | DOI | arXiv ]

[81]

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. 34^th European Workshop on Computational Geometry EuroCG '18, pages 21:1--21:6, Berlin, Germany, 2018. [ bib ]

[82]

Oswin Aichholzer, Michael Kerber, István Talata, and Birgit Vogtenhuber. A Note on Planar Monohedral Tilings. In Proc. 34^th European Workshop on Computational Geometry EuroCG '18, pages 31:1--31:6, Berlin, Germany, 2018. [ bib ]

[83]

Oswin Aichholzer, Wolfgang Mulzer, Partick Schnider, and Birgit Vogtenhuber. NP-Completeness of Max-Cut for Segment Intersection Graphs. In Proc. 34^th European Workshop on Computational Geometry EuroCG '18, pages 32:1--32:6, Berlin, Germany, 2018. [ bib ]

[84]

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 ]

[85]

John Iacono and Birgit Vogtenhuber. In pursuit of a dynamic tree decomposition. In Proceedings of the of the 21st Japan Conference on Discrete and Computational Geometry, Graphs, and Games (JCDCG^32018), pages 23--25, Manila, Philippines, 2018. [ bib ]

[86]

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 ]

[87]

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. 33^rd European Workshop on Computational Geometry EuroCG '17, pages 69--73, Malmö, Sweden, 2017. [ bib | arXiv | .pdf ]

[88]

O. Aichholzer, L. Andritsch, K. Baur, and B. Vogtenhuber. Perfect k-colored matchings and k+2-gonal tilings. In Proc. 33^rd European Workshop on Computational Geometry EuroCG '17, pages 81--84, Malmö, Sweden, 2017. [ bib | arXiv | .pdf ]

[89]

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 K_n. In Proc. XVII Encuentros de Geometría Computacional, pages 17--20, Alicante, Spain, 2017. [ bib | arXiv | .pdf ]

[90]

Bahareh Banyassady, Man-Kwun Chiu, Matias Korman, Wolfgang Mulzer, André van Renssen, Marcel Roeloffzen, Paul Seiferth, Yannik Stein, Birgit Vogtenhuber, and Max Willert. Routing in Polygonal Domains. In Yoshio Okamoto and Takeshi Tokuyama, editors, 28th International Symposium on Algorithms and Computation (ISAAC 2017), volume 92 of Leibniz International Proceedings in Informatics (LIPIcs), pages 10:1--10:13, Dagstuhl, Germany, 2017. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik. [ bib | DOI | http ]

[91]

Jean Cardinal, Stefan Felsner, Tillmann Miltzow, Casey Tompkins, and Birgit Vogtenhuber. "Intersection Graphs of Rays and Grounded Segments". In Hans L. Bodlaender and Gerhard J. Woeginger, editors, Graph-Theoretic Concepts in Computer Science (WG 2017), pages 153--166, Cham, 2017. Springer International Publishing. Revised Selected Papers. [ bib | DOI ]

[92]

Matias Korman, Wolfgang Mulzer, André van Renssen, Marcel Roeloffzen, Paul Seiferth, Yannik Stein, Birgit Vogtenhuber, and Max Willert. Routing in Simple Polygons. In Proc. 33^rd European Workshop on Computational Geometry EuroCG '17, pages 17--20, Malmö, Sweden, 2017. [ bib ]

[93]

Bahareh Banyassady, Matias Korman, Wolfgang Mulzer, André van Renssen, Marcel Roeloffzen, Paul Seiferth, Yannik Stein, Birgit Vogtenhuber, and Max Willert. Routing in Polygonal Domains. In Proc. of the 20^th Japan Conference on Discrete and Computational Geometry, Graphs, and Games (JCDCG³ 2017), pages 88--89, Tokyo, Japan, 2017. [ bib ]

[94]

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 ]

[95]

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 ]

[96]

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 ]

[97]

O. Aichholzer, M. Balko, T. Hackl, A. Pilz, P. Ramos, B. Vogtenhuber, and P. Valtr. Holes in two convex point sets. In Proc. 32^st European Workshop on Computational Geometry EuroCG '16, pages 263--266, Lugano, Switzerland, 2016. [ bib | arXiv | .pdf ]

[98]

O. Aichholzer, V. Alvarez, T. Hackl, A. Pilz, B. Speckmann, and B. Vogtenhuber. An improved lower bound on the number of triangulations. In Proc. 32^nd 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 ]

[99]

O. Aichholzer, T. Hackl, P. Valtr, and B. Vogtenhuber. A note on the number of general 4-holes in perturbed grids. In Proc. 18^th Japan Conference on Discrete and Computational Geometry and Graphs (JCDCG² 2015), pages 68--69, Kyoto, Japan, 2015. [ bib ]

[100]

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. 23^nd 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 ]

[101]

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. 31^st European Workshop on Computational Geometry EuroCG '15, pages 57--60, Ljubljana, Slovenia, 2015. [ bib | .pdf ]

[102]

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 ]

[103]

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 ]

[104]

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 ]

[105]

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 ]

[106]

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 ]

[107]

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 ]

[108]

Imre Bárány, Ruy Fabila-Monroy, and Birgit Vogtenhuber. (n,m)-Fold Covers of Spheres. Proceedings of the Steklov Institute of Mathematics, 288:203--208, 2015. [ bib | DOI | arXiv ]

[109]

Jurek Czyzowicz, Konstantinos Georgiou, Evangelos Kranakis, Lata Narayanan, Jarda Opatrny, and Birgit Vogtenhuber. Evacuating Robots from a Disk Using Face-to-Face Communication (Extended Abstract). In V. Paschos and P. Widmayer, editors, Algorithms and Complexity. CIAC 2015., volume 9079 of Lecture Notes in Computer Science (LNCS), pages 140--152, Paris, France, 2015. Springer. [ bib | DOI | arXiv ]

[110]

Matias Korman, Stefan Langerman, Wolfgang Mulzer, Alexander Pilz, Maria Saumell, and Birgit Vogtenhuber. Minimum Dual Diameter Triangulations. In Proc. 30^th European Workshop on Computational Geometry (EuroCG 2014), page online, March 2014. [ bib ]

[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. 30^th 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, 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 ]

[115]

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 ]

[116]

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 ]

[117]

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 ]

[118]

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 ]

[119]

Oswin Aichholzer, Luis Barba, Thomas Hackl, Alexander Pilz, and Birgit Vogtenhuber. Linear Transformation Distance for Bichromatic Matchings. In Proc. 30^th Symposium on Computational Geometry (SOCG 2014), pages 154--162. ACM, 2014. [ bib | DOI | http | .pdf ]

[120]

Oswin Aichholzer, Matias Korman, Alexander Pilz, and Birgit Vogtenhuber. Geodesic Order Types. Algorithmica, 70(1):112--128, 2014. [ bib | DOI | arXiv | http | .pdf ]

[121]

Bernardo M. Ábrego, Oswin Aichholzer, Silvia Fernández-Merchant, Pedro Ramos, and Birgit Vogtenhuber. Non-Shellable Drawings of K_n with Few Crossings. In Proc. 26^th Annual Canadian Conference on Computational Geometry CCCG 2014, page online, Halifax, Nova Scotia, Canada, 2014. [ bib ]

[122]

Oswin Aichholzer, Thomas Hackl, Stefan Huber, and Birgit Vogtenhuber. Straight Skeletons by Means of Voronoi Diagrams Under Polyhedral Distance Functions. In Proc. 26^th Annual Canadian Conference on Computational Geometry (CCCG 2014), page online, Halifax, Nova Scotia, Canada, 2014. [ bib | .pdf ]

[123]

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 R³. In Proc. 26^th Annual Canadian Conference on Computational Geometry CCCG 2014, page online, Halifax, Nova Scotia, Canada, 2014. [ bib ]

[124]

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. 22^nd 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 ]

[125]

O. Aichholzer, T. Hackl, M. Korman, A. Pilz, and B. Vogtenhuber. Geodesic-preserving polygon simplification. In Lecture Notes in Computer Science (LNCS), Proc. 24^th Int. Symp. Algorithms and Computation (ISAAC 2013), volume 8283, pages 11--21, Hong Kong, China, 2013. Springer Verlag. [ bib | .pdf ]

[126]

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. 25^th Annual Canadian Conference on Computational Geometry CCCG 2013, pages 169--174, Waterloo, Ontario, Canada, 2013. [ bib | .pdf ]

[127]

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 ]

[128]

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. 15^th Spanish Meeting on Computational Geometry 2013, pages 131--134, Sevilla, Spain, 2013. [ bib | arXiv | .pdf ]

[129]

O. Aichholzer, T. Hackl, V. Sacristán, B. Vogtenhuber, and R. Wallner. Simulating distributed algorithms for lattice agents. In Proc. 15^th Spanish Meeting on Computational Geometry 2013, pages 81--84, Sevilla, Spain, 2013. [ bib | .pdf ]

[130]

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 ]

[131]

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 ]

[132]

O. Aichholzer, J. Urrutia, and B. Vogtenhuber. Balanced 6-holes in bichromatic point sets. In Proc. of the 16^th Japan Conference on Discrete and Computational Geometry and Graphs (JCDCG² 2013), Tokyo, Japan, 2013. [ bib | .pdf ]

[133]

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 ]

[134]

Oswin Aichholzer, Matias Korman, Alexander Pilz, and Birgit Vogtenhuber. Geodesic Order Types. In Joachim Gudmundsson, Julián Mestre, and Taso Viglas, editors, Proc. 18^th 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 ]

[135]

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. 24^th Annual Canadian Conference on Computational Geometry CCCG 2012, pages 247--252, Charlottetown, PEI, Canada, 2012. [ bib | .pdf ]

[136]

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 ]

[137]

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 ]

[138]

O. Aichholzer, F. Hurtado, and B. Vogtenhuber. Compatible Matchings for Bichromatic Plane Straight-line Graphs. In Proc. 28^th European Workshop on Computational Geometry EuroCG '12, pages 257--260, Assisi, Italy, 2012. [ bib | .pdf ]

[139]

B. Vogtenhuber. Combinatorial Aspects of [Colored] Point Sets in the Plane. PhD thesis, Institute for Software Technology, Graz University of Technology, Graz, Austria, December 2011. Supervisor: Oswin Aichholzer. [ bib | .pdf ]

[140]

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. 23^rd Annual Canadian Conference on Computational Geometry CCCG 2011, pages 21--26, Toronto, Canada, 2011. [ bib | .pdf ]

[141]

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 ]

[142]

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. 27^th European Workshop on Computational Geometry EuroCG '11, pages 115--118, Morschach, Switzerland, 2011. [ bib | .pdf ]

[143]

O. Aichholzer, T. Hackl, and B. Vogtenhuber. Compatible Pointed Pseudo-Triangulations. In Proc. 22^nd Annual Canadian Conference on Computational Geometry CCCG 2010, pages 91--94, Winnipeg, Manitoba, Canada, 2010. [ bib | .pdf ]

[144]

O. Aichholzer, R. Fabila-Monroy, T. Hackl, M. van Kreveld, A. Pilz, P. Ramos, and B. Vogtenhuber. Blocking Delaunay Triangulations. In Proc. 22^nd Annual Canadian Conference on Computational Geometry CCCG 2010, pages 21--24, Winnipeg, Manitoba, Canada, 2010. [ bib | .pdf ]

[145]

O. Aichholzer, F. Aurenhammer, T. Hackl, C. Huemer, A. Pilz, and B. Vogtenhuber. 3-Colorability of Pseudo-Triangulations. In Proc. 26^th European Workshop on Computational Geometry EuroCG '10, pages 21--24, Dortmund, Germany, 2010. [ bib | .pdf ]

[146]

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 ]

[147]

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. 11^th International Workshop on Algorithms and Data Structures (WADS), volume 5664, pages 13--24, Banff, Alberta, Canada, 2009. [ bib | .pdf ]

[148]

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. 25^th European Workshop on Computational Geometry EuroCG '09, pages 139--142, Brussels, Belgium, 2009. [ bib | .pdf ]

[149]

O. Aichholzer, T. Hackl, C. Huemer, F. Hurtado, and B. Vogtenhuber. Large bichromatic point sets admit empty monochromatic 4-gons. In Proc. 25^th European Workshop on Computational Geometry EuroCG '09, pages 133--136, Brussels, Belgium, 2009. [ bib | .pdf ]

[150]

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. 25^th European Workshop on Computational Geometry EuroCG '09, pages 167--170, Brussels, Belgium, 2009. [ bib | .pdf ]

[151]

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 ]

[152]

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. 10^th International Workshop on Algorithms and Data Structures (WADS), volume 4619, pages 458--469, Halifax, Nova Scotia, Canada, 2007. [ bib | DOI | arXiv | .pdf ]

[153]

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. 23^rd European Workshop on Computational Geometry EuroCG '07, pages 98--101, Graz, Austria, 2007. [ bib | arXiv | .pdf ]

[154]

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 ]

[155]

B. Vogtenhuber. On Plane Straight-Line Graphs. Master's thesis, IST-TU Graz, Austria, January 2007. Supervisor: Oswin Aichholzer. [ bib | .pdf ]

[156]

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 ]

[157]

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 ]

[158]

O. Aichholzer, T. Hackl, C. Huemer, F. Hurtado, H. Krasser, and B. Vogtenhuber. On the number of plane graphs. In Proc. 17^th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 504--513, Miami, Florida, USA, 2006. [ bib | .pdf ]

[159]

O. Aichholzer, F. Aurenhammer, C. Huemer, and B. Vogtenhuber. Gray code enumeration of plane straight-line graphs. In Proc. 22^nd European Workshop on Computational Geometry EuroCG '06, pages 71--74, Delphi, Greece, 2006. [ bib | .ps.gz ]

[160]

O. Aichholzer, T. Hackl, C. Huemer, F. Hurtado, H. Krasser, and B. Vogtenhuber. Bounding the number of plane graphs. In Proc. 15^th Annual Fall Workshop on Computational Geometry and Visualization, pages 31--32, Philadelphia, Pennsylvania, USA, 2005. [ bib ]

[161]

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. 17^th Annual Canadian Conference on Computational Geometry CCCG 2005, pages 123--126, Windsor, Ontario, Canada, 2005. [ bib | .ps.gz ]

This file was generated by bibtex2html 1.98.