Reminder

In all DK related publications, it is required to acknowledge support of the FWF. The following naming convention must be used in all cases:

    Austrian Science Fund (FWF): W1230

For example, you may include a sentence such as "The author acknowledges the support of the Austrian Science Fund (FWF): W1230." Please do not forget!

Project 11:
(Geometric) graphs: Flip distances and crossing numbers

[47]Phoebe de Nooijer, Soeren Nickel, Alexandra Weinberger, Zuzana Masárová, Tamara Mchedlidze, Maarten Löffler and Günter Rote, Removing Popular Faces in Curve Arrangements by Inserting one more Curve, Chapter in Proc. 38th European Workshop on Computational Geometry (EuroCG), 38:1–38:8, (2022). (extended abstract) [bibtex] [url]
[46]Takashi Horiyama, Fabian Klute, Matias Korman, Irene Parada, Ryuhei Uehara and Katsuhisa Yamanaka, Efficient segment folding is hard, Computational Geometry: Theory and Applications, 104(101860), (2022). [bibtex] [doi]
[45]Alan Arroyo, Fabian Klute, Irene Parada, Raimund Seidel, Birgit Vogtenhuber and Tilo Wiedera, Inserting one edge into a simple drawing is hard, Discrete & Computational Geometry, (2022). (to appear) [bibtex]
[44]Oswin Aichholzer, Johannes Obenaus, Joachim Orthaber, Rosna Paul, Patrick Schnider, Raphael Steiner, Tim Taubner and Birgit Vogtenhuber, Edge Partitions of Complete Geometric Graphs, In Proc. 38th Int. Symposium on Computational Geometry (SoCG), (2022). (to appear) [bibtex]
[43]Oswin Aichholzer, Kristin Knorr, Maarten Löffler, Zuzana Masárová, Wolfgang Mulzer, Johannes Obenaus, Rosna Paul and Birgit Vogtenhuber, Flipping Plane Spanning Paths, Chapter in Proc. 38th European Workshop on Computational Geometry (EuroCG), 66:1–66:7, (2022). (extended abstract) [bibtex] [url]
[42]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 33rd Int. Workshop on Combinatorial Algorithms, (2022). (to appear) [bibtex]
[41]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 Proc. 38th Int. Symposium on Computational Geometry (SoCG), (2022). (to appear) [bibtex]
[40]Oswin Aichholzer, Man-Kwun Chiu, Hung P. Hoang, Michael Hoffmann, Yannic Maus, Birgit Vogtenhuber and Alexandra Weinberger, Gioan's Theorem for complete bipartite graphs, Chapter in Proc. 38th European Workshop on Computational Geometry (EuroCG), 31:1–31:6, (2022). (extended abstract) [bibtex] [url]
[39]Oswin Aichholzer, Thomas Hackl, Maarten Löffler, Alexander Pilz, Irene Parada, Manfred Scheucher and Birgit Vogtenhuber, Blocking Delaunay triangulations from the exterior, In Proceedings of the 38th European Workshop on Computational Geometry (EuroCG'22), (2022). (extended abstract) [bibtex] [pdf]
[38]Irene Parada, Vera Sacristán and Rodrigo I. Silveira, A new meta-module design for efficient reconfiguration of modular robots, Autonomous Robots, 45(4), 457–472, (2021). [bibtex] [doi]
[37]Hugo Akitaya, Esther Arkin, Mirela Damian, Erik D. Demaine, Vida Dujmović, Robin Flatland, Matias Korman, Belen Palop, Irene Parada, André van Renssen and Vera Sacristán, Universal reconfiguration of facet-connected modular robots by pivots: the O(1) musketeers, Algorithmica, 83(5), 1316–1351, (2021). [bibtex] [doi]
[36]Oswin Aichholzer, Alan Arroyo, Zuzana Masárová, Irene Parada, Daniel Perz, Alexander Pilz, Josef Tkadlec and Birgit Vogtenhuber, On compatible matchings, In Proceedings of the 15th International Conference and Workshops on Algorithms and Computing (WALCOM'21), Springer, 12635, 221–233, (2021). [bibtex] [doi]
[35]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). [bibtex]
[34]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, 4, (2021). [bibtex] [url]
[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, 6-10, (2021). [bibtex] [url]
[32]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, 24-27, (2021). [bibtex] [url]
[31]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 Abstracts of the 23rd Thailand-Japan Conference on Discrete and Computational Geometry, Graphs, and Games (TJCDCGGG 2020+1), 112–113, (2021). (extended abstract) [bibtex] [pdf]
[30]Alan Arroyo, Fabian Klute, Irene Parada, Raimund Seidel, Birgit Vogtenhuber and Tilo Wiedera, Inserting one edge into a simple drawing is hard, In 46th International Workshop on Graph-Theoretic Concepts in Computer Science, (2020). [bibtex]
[29]Oswin Aichholzer, Martin Balko, Thomas Hackl, Jan Kynčl, Irene Parada, Manfred Scheucher, Pavel Valtr and Birgit Vogtenhuber, A superlinear lower bound on the number of 5-holes, Journal of Combinatorial Theory, Series A, 137, (2020). [bibtex] [doi]
[28]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 (EuroCG'20), 36:1–36:7, (2020). (extended abstract) [bibtex] [pdf]
[27]Oswin Aichholzer, Luis E. Caraballo, José M. Díaz-Báñez, Ruy Fabila-Monroy, Irene Parada, Inmaculada Ventura and Birgit Vogtenhuber, Scheduling drones to cover outdoor events, In Proceedings of the 36th European Workshop on Computational Geometry (EuroCG'20), 24:1–24:6, (2020). (extended abstract) [bibtex] [pdf]
[26]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 Proceedings of the 28th International Symposium on Graph Drawing and Network Visualization (GD), (2020). [bibtex] [doi]
[25]Irene Parada, On straight-line and topological drawings of graphs in the plane, PhD thesis, TU Graz, (2019). [bibtex] [url]
[24]Carolina Medina, Irene Parada, Gelasio Salazar and Birgit Vogtenhuber, Bounding the number of crossings for a particular class of drawings of $K_{n,n}$, Chapter in XVIII Spanish Meeting on Computational Geometry, 34, (2019). (extended abstract) [bibtex] [pdf]
[23]Thekla Hamm, Fabian Klute and Irene Parada, Extending to 1-plane drawings, In XVIII Spanish Meeting on Computational Geometry, 30–33, (2019). (extended abstract) [bibtex] [pdf]
[22]Takashi Horiyama, Fabian Klute, Matias Korman, Irene Parada, Ryuhei Uehara and Katsuhisa Yamanaka, Efficient segment folding is hard, In Proceedings of the 31st Canadian Conference in Computational Geometry (CCCG), 182–188, (2019). (extended abstract) [bibtex]
[21]Alan Arroyo, Martin Derka and Irene Parada, Extending simple drawings, In Proceedings of the 34th European Workshop on Computational Geometry (EuroCG), 60:1–60:7, (2019). (extended abstract) [bibtex] [pdf]
[20]Alan Arroyo, Martin Derka and Irene Parada, Extending simple drawings, In 27th International Symposium on Graph Drawing and Network Visualization (GD), Springer, 11904, 230–243, (2019). [bibtex] [doi]
[19]Hugo Akitaya, Esther Arkin, Mirela Damian, Erik D. Demaine, Vida Dujmović, Robin Flatland, Matias Korman, Belen Palop, Irene Parada, André van Renssen and Vera Sacristán, Reconfiguring edge-connected pivoting modular robots, In XVIII Spanish Meeting on Computational Geometry, 64, (2019). (extended abstract) [bibtex] [pdf]
[18]Hugo Akitaya, Esther Arkin, Mirela Damian, Erik D. Demaine, Vida Dujmović, Robin Flatland, Matias Korman, Belen Palop, Irene Parada, André van Renssen and Vera Sacristán, Universal reconfiguration of facet-connected modular robots by pivots: the O(1) musketeers, In Proceedings of the 27th Annual European Symposium on Algorithms (ESA), 144, 3:1–3:14, (2019). [bibtex] [doi]
[17]Oswin Aichholzer, Lukas Andritsch, Karin Baur and Birgit Vogtenhuber, Transformed flips in triangulations and matchings, (2019). (preprint) [bibtex]
[16]Oswin Aichholzer, Carlos Alegría, Irene Parada, Alexander Pilz, Javier Tejel, Csaba D. Tóth, Jorge Urrutia and Birgit Vogtenhuber, Hamiltonian meander paths and cycles on bichromatic point sets, Chapter in XVIII Spanish Meeting on Computational Geometry, 35–38, (2019). (extended abstract) [bibtex] [pdf]
[15]Oswin Aichholzer, Matias Korman, Yoshio Okamoto, Irene Parada, Daniel Perz, André van Renssen and Birgit Vogtenhuber, Graphs with large total angular resolution, Chapter in International Symposium on Graph Drawing and Network Visualization, Springer, 11904, 193–199, (2019). [bibtex] [doi]
[14]Oswin Aichholzer, Irene Parada, Manfred Scheucher, Birgit Vogtenhuber and Alexandra Weinberger, Shooting stars in simple drawings of $K_{m,n}$, In Proceedings of the 35th European Workshop on Computational Geometry (EuroCG), 59:1–59:6, (2019). (extended abstract) [bibtex] [pdf]
[13]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, Chapter in International Symposium on Graph Drawing and Network Visualization, Springer, 11904, 101–113, (2019). [bibtex] [doi]
[12]Oswin Aichholzer, Ruy Fabila, Adrian Fuchs, Carlos Hidalgo, Irene Parada, Birgit Vogtenhuber and Francisco Zaragoza, On the 2-colored crossing number, In Proceedings of the 35th European Workshop on Computational Geometry (EuroCG), 56:1–56:7, (2019). (extended abstract) [bibtex] [pdf]
[11]Oswin Aichholzer, Ruy Fabila, Adrian Fuchs, Carlos Hidalgo, Irene Parada, Birgit Vogtenhuber and Francisco Zaragoza, On the 2-colored crossing number, In 27th International Symposium on Graph Drawing and Network Visualization (GD), Springer, 11904, 87–100, (2019). [bibtex] [doi]
[10]Hugo Akitaya, Maarten Löffler and Irene Parada, How to fit a tree in a box, In Proceedings of the 26th International Symposium on Graph Drawing and Network Visualization (GD), Springer, 11282, 361–367, (2018). [bibtex] [doi]
[9]Oswin Aichholzer, L. Andritsch, Karin Baur and Birgit Vogtenhuber, Perfect $k$-Colored Matchings and $(k+2)$-Gonal Tilings, Graphs and Combinatorics, 34(6), 1333–1346, (2018). [bibtex] [doi]
[8]Oswin Aichholzer, Michael Kerber, I. Talata and Birgit Vogtenhuber, A Note on Planar Monohedral Tilings, In Proceedings of the 34th European Workshop on Computational Geometry (EuroCG), 31:1–31:6, (2018). (extended abstract) [bibtex] [pdf]
[7]Oswin Aichholzer, Wolfgang Mulzer, P. Schnider and Birgit Vogtenhuber, NP-Completeness of Max-Cut for Segment Intersection Graphs, In Proceedings of the 34th European Workshop on Computational Geometry (EuroCG), 32:1–32:6, (2018). (extended abstract) [bibtex] [pdf]
[6]Oswin Aichholzer, Martin Balko, M. 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 Proceedings of the 34th European Workshop on Computational Geometry (EuroCG), 21:1–21:6, (2018). (extended abstract) [bibtex] [pdf]
[5]Oswin Aichholzer, Martin Balko, Thomas Hackl, Jan Kynčl, Irene Parada, Manfred Scheucher, Pavel Valtr and Birgit Vogtenhuber, A superlinear lower bound on the number of 5-holes, In Proceedings of the 33rd European Workshop on Computational Geometry (EuroCG), 69–72, (2017). (extended abstract) [bibtex] [pdf]
[4]Oswin Aichholzer, Florian Ebenführer, Irene Parada, Alexander Pilz and Birgit Vogtenhuber, On semi-simple drawings of the complete graph, In Abstracts of the XVII Spanish Meeting on Computational Geometry (EGC), 25–28, (2017). (extended abstract) [bibtex] [pdf]
[3]Oswin Aichholzer, Martin Balko, Thomas Hackl, Jan Kynčl, Irene Parada, Manfred Scheucher, Pavel Valtr and Birgit Vogtenhuber, A superlinear lower bound on the number of 5-holes, In 33rd International Symposium on Computational Geometry (SoCG), 77, 8:1–8:16, (2017). [bibtex] [doi]
[2]Oswin Aichholzer, L. Andritsch, Karin Baur and Birgit Vogtenhuber, Perfect $k$-colored matchings and $k+2$-gonal tilings, In Proceedings of the 33rd European Workshop on Computational Geometry (EuroCG), 81–84, (2017). (extended abstract) [bibtex] [pdf]
[1]Irene Parada, Vera Sacristán and Rodrigo I. Silveira, A new meta-module for efficient robot reconfiguration, In Abstracts of the XVI Spanish Meeting on Computational Geometry (EGC), 49–52, (2015). (extended abstract) [bibtex] [pdf]