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!
|
| [29] | 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)
|
|
| [28] | Irene Parada, Vera Sacristán and Rodrigo I. Silveira, A new meta-module for efficient reconfiguration of hinged-units modular robots, In 2016 IEEE International Conference on Robotics and Automation, ICRA, 5197–5202, (2016).
|
|
| [27] | O. Aichholzer, L. Andritsch, K. Baur and B. 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)
|
| [26] | Oswin Aichholzer, Martin Balko, Thomas Hackl, Jan Kyn\v cl, Irene de 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).
|
| [25] | 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)
|
| [24] | 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)
|
|
| [23] | 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).
|
| [22] | 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)
|
| [21] | 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)
|
| [20] | 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)
|
|
| [19] | 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).
|
| [18] | 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)
|
| [17] | 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 Abstracts of the XVIII Spanish Meeting on Computational Geometry (EGC), 34, (2019). (extended abstract)
|
| [16] | 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)
|
| [15] | Fabian Klute, Irene Parada and Thekla Hamm, Extending to 1-plane drawings, In Abstracts of the XVIII Spanish Meeting on Computational Geometry (EGC), 30–33, (2019). (extended abstract)
|
| [14] | 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).
|
| [13] | Oswin Aichholzer, Matias Korman, Yoshio Okamoto, Irene Parada, Daniel Perz, André van Renssen and Birgit Vogtenhuber, Graphs with large total angular resolution, In Proceedings of the 27th International Symposium on Graph Drawing and Network Visualization (GD), Springer, 11904, 193–199, (2019).
|
| [12] | 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 27th International Symposium on Graph Drawing and Network Visualization (GD), Springer, 11904, 101–113, (2019).
|
| [11] | 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 Abstracts of the XVIII Spanish Meeting on Computational Geometry (EGC), 64, (2019). (extended abstract)
|
| [10] | 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)
|
| [9] | Irene Parada, On straight-line and topological drawings of graphs in the plane, PhD thesis, Graz University of Technology, (2019).
|
| [8] | 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).
|
| [7] | 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, In Abstracts of the XVIII Spanish Meeting on Computational Geometry (EGC), 35–38, (2019). ((extended abstract))
|
| [6] | 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)
|
|
| [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, Journal of Combinatorial Theory, Series A, 137, (2020).
|
| [4] | 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))
|
| [3] | 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))
|
| [2] | 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).
|
| [1] | 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).
|
