About Me

Hi! I am Irene Parada, currently a postdoctoral researcher at TU Eindhoven (The Netherlands). Before, I was a research assistant at Graz University of Technology (Austria). In November 2019 I finished my PhD there under the supervision of Oswin Aichholzer.

I was born in Madrid in 1992, the same year that the Olympic Games and the World Expo took place in Spain.

In 2014 I obtained a Bachelor's degree in Mathematical Engineering from Universidad Complutense de Madrid, and in 2015 a Master's degree in Advanced Mathematics and Mathematical Engineering from Universitat Politècnica de Catalunya.

My main research interests are in Discrete and Computational Geometry and Graph Drawing.
Last update: Jan. 30, 2021

Contact

Irene Parada ORCID iD icon[ORCiD link]
Department of Mathematics and Computer Science
TU Eindhoven
The Netherlands

Short CV

Jan. 2020–present
Postdoctoral research assistant, TU Eindhoven, The Netherlands.
Nov. 2019–Jan. 2020
Postdoctoral research assistant, Graz University of Technology, Austria.
Aug. 2015–Nov. 2019
Research assistant in Discrete and Computational Geometry, Graz University of Technology, Austria. Advisor: Prof. O. Aichholzer.
PhD in Technical Mathematics summa cum laude. Advisor: Prof. O. Aichholzer.
Sep. 2014–Jul. 2015
Master’s degree in Advanced Mathematics and Mathematical Engineering (60 ECTS), Universitat Politècnica de Catalunya (UPC), Spain.
Sep. 2010–Jul. 2014
Bachelor’s Degree in Mathematical Engineering (240 ECTS), Universidad Complutense de Madrid (UCM), Spain. Best academic record.
Fall Semester 2013/2014
Exchange Semester at the Royal Institute of Technology (KTH), Sweden.
Sep. 2011–present
Bachelor's Degree in Physics (155/240 ECTS), Universidad Nacional de Educación a Distancia (UNED), the public open university of Spain.

Jan. 2020–present TU Eindhoven.
Postdoctoral research assistant.
Aug. 2019–Jan. 2020 DACH joint project "Arrangements and Drawings" funded by the Austrian Science Fund (FWF) as a trilateral project with the German Research Foundation (DFG) and the Swiss National Science Foundation (SNSF).
Research assistant.
Aug. 2015–Jul. 2015 Doctoral Program "Discrete Mathematics" funded by the Austrian Science Fund (FWF).
Research assistant and PhD candidate.
Jan. 2017–Jan. 2020 Horizon 2020 Marie Skłodowska–Curie Research and Innovation Staff Exchange project "Combinatorics of Networks and Computation" funded by European Union.
Project member and management support.
2018 Bilateral Japanese-Austrian Joint Seminar funded by the Austrian Science Fund (FWF) and the Japan Society for the Promotion of Science (JSPS).
Project member.
2015–2016 Bilateral project "Erdős–Szekeres type questions for point sets" funded by the Austrian Science Fund (FWF) and the Czech Science Foundation (GA ČR).
Project member.
2021 Best paper award at WALCOM 2021.
2018 2nd place in the 2018 Graph Drawing Contest, Live Challenge: Manual Category (with F. Klute).
2017 Winner of the 2017 Graph Drawing Contest, Creative Topics: Human Metabolism (with F. Klute).
Spring Sem. 2015 Scholarship for academic support activities (AAD3) at the Universitat Politècnica de Catalunya (UPC).
2013–2014 Best Academic Record of the Bachelor’s Degree.
2013–2014 Erasmus Grant.
2011 Winner of the Encuentra Matemáticas competition of the Univesidad Politécnica de Madrid, Spain.
2010–2011 Excellence Scholarship of Madrid.
2010 Bronze medal in the National Physics Olympiad.
2020
Feb. 4 Extending simple and 1-plane drawings of graphs.
Noon seminar, TU Eindhoven, The Netherlands.
Jun. 23 Hiding sliding Cubes: Why reconfiguring modular robots is not easy.
36th International Symposium on Computational Geometry, live online (due to the COVID-19 pandemic).
Jun. 26 Inserting one edge into a simple drawing is hard.
46th International Workshop on Graph-Theoretic Concepts in Computer Science, live online (due to the COVID-19 pandemic).
2019
Dec. 13 Extending drawings and arrangements.
Discrete Mathematics Day, Graz, Austria. Invited talk.
Sep. 19 Extending simple drawings.
27th International Symposium on Graph Drawing and Network Visualization, Průhonice, Czech Republic.
Sep. 18 Minimal representations of order types by geometric graphs.
27th International Symposium on Graph Drawing and Network Visualization, Průhonice, Czech Republic.
Jul. 01 Bounding the number of crossings for a particular class of drawings of Kn,n.
XVIII Spanish Meeting on Computational Geometry, Girona, Spain.
Jul. 01 Extending to 1-plane drawings.
XVIII Spanish Meeting on Computational Geometry, Girona, Spain.
Jun. 14 On the complexity of extending drawings of graphs.
Doctoral School Seminar, Graz University of Technology, Austria.
Mar. 18 Extending simple drawings.
35th European Workshop on Computational Geometry, Utrecht, the Netherlands.
Feb. 05 A superlinear lower bound on the number of 5-holes.
Congreso Bienal de la RSME, Santander, Spain. Invited talk.
Feb. 01 Unavoidable configurations in simple drawings.
Doctoral School Seminar, Graz University of Technology, Austria.
2018
May 11 Minimal geometric graph representations of order types.
Intensive Research Program in Discrete, Combinatorial and Computational Geometry Seminar, Barcelona, Spain.
Apr. 13 Minimal geometric graph representations of order types.
Advanced Topics in Discrete Mathematics seminar, Graz University of Technology, Austria.
2017
Dec. 19 A superlinear lower bound on the number of 5-holes.
Computational Geometry seminar, Universitat Politècnica de Catalunya, Spain.
Dec. 14 On simple and semi-simple drawings of the complete graph.
Discrete Mathematics Day, Graz, Austria. Invited talk.
Oct. 05 A superlinear lower bound on the number of 5-holes.
Tardes de Álgebra, Combinatoria y Optimización, Cinvestav, Mexico.
Sep. 28 A superlinear lower bound on the number of 5-holes.
Taller de Teoría de Gráficas y Geometría Discreta, Zacatecas, Mexico. Invited talk.
Sep. 12 A superlinear lower bound on the number of 5-holes.
Seminario Tartaglia, Universidad Autónoma de San Luis Potosí, Mexico.
Jun. 26 On semi-simple drawings of the complete graph.
XVII Spanish Meeting on Computational Geometry, Alicante, Spain.
Jun. 02 A superlinear lower bound on the number of 5-holes.
DK special “Mini-SoCG” session, Graz University of Technology, Austria.
2016
May 19 A new meta-module for efficient reconfiguration of hinged-units modular robots.
IEEE International Conference on Robotics and Automation, Stockholm, Sweden.
2015
Dec. 03 Rotation systems.
IST Institutsseminar, Graz, Austria.
Jul. 02 A new meta-module for efficient robot reconfiguration.
XVI Spanish Meeting on Computational Geometry, Barcelona, Spain.
2020
Jan. 27–31 5th Workshop on Applied Geometric Algorithms, Langbroek, The Netherlands.
Mar. 16–18 36th European Workshop on Computational Geometry, held online due to the COVID-19 pandemic.
Mar. 21–27 35th Bellairs Winter Workshop on Computational Geometry, held online due to the COVID-19 pandemic.
Jun. 22–26 36th International Symposium on Computational Geometry, held online due to the COVID-19 pandemic.
Jun. 24–26 46th International Workshop on Graph-Theoretic Concepts in Computer Science, held online due to the COVID-19 pandemic.
2019
Nov. 18–22 16th European Research Week on Geometric Graphs, Strobl, Austria.
Sep. 17–20 27th International Symposium on Graph Drawing and Network Visualization, Průhonice, Czech Republic.
Sep. 16–17 PhD school on Graph Drawing and Network Visualization, Průhonice, Czech Republic.
Aug. 26–30 Bertinoro Workshop on Distributed Geometric Algorithms, Bertinoro, Italy.
Aug. 19–23 3rd DACH Workshop on Arrangements and Drawings, Capricorns, Wergenstein, Switzerland.
Jul. 01–03 XVIII Spanish Meeting on Computational Geometry, Girona, Spain.
Jun. 24–28 6th Austrian-Japanese-Mexican-Spanish Workshop on Discrete Geometry, Strobl, Austria.
May 05–10 11th Crossing Numbers Workshop, Telč, Czech Republic.
Mar. 22–29 34th Bellairs Winter Workshop on Computational Geometry, Holetown, Barbados.
Mar. 18–20 35th European Workshop on Computational Geometry, Utrecht, the Netherlands.
Mar. 08–15 7th Annual Workshop on Geometry and Graphs, Holetown, Barbados.
Feb. 04–08 Congreso Bienal de la RSME, Santander, Spain.
Jan. 21–25 2nd DACH ArrDra Workshop, St. Martin bei Graz, Austria.
2018
Nov. 01–06 Japan-Austria Bilateral Seminar, Zao, Japan.
Sep. 26–28 26th International Symposium on Graph Drawing and Network Visualization, Barcelona, Spain.
Sep. 24–25 PhD school on Recent Trends in Graph Drawing and Network Visualization, Barcelona, Spain.
Jul. 30–Aug. 03 17th Workshop: Routing in Ensenada, Mexico.
Jul. 23–27 3rd Renunión de Optimización, Matemáticas y Algoritmos, CDMX, Mexico.
Jun. 04–08 5th Austrian-Japanese-Mexican-Spanish Workshop on Discrete Geometry, Barcelona, Spain.
May 28–Jun. 01 CONNECT Workshop on Geometric and Algorithmic Aspects of Networks, Barcelona, Spain.
Apr. 30–May 18 Intensive Research Program in Discrete, Combinatorial and Computational Geometry, Barcelona, Spain.
Mar. 23–30 33rd Bellairs Winter Workshop on Computational Geometry, Holetown, Barbados.
Mar. 11–16 6th Annual Workshop on Geometry and Graphs, Holetown, Barbados.
Jan. 29–Feb. 02 Seville CONNECT Workshop, Sevilla, Spain.
2017
Sep. 24–29 Taller de Teoría de Gráficas y Geometría Discreta, Zacatecas, Mexico.
Jul. 31–Aug. 04 16th Workshop: Routing in Ensenada, Mexico.
Jul. 24–28 2nd Renunión de Optimización, Matemáticas y Algoritmos, CDMX, Mexico.
Jun. 26–28 XVII Spanish Meeting on Computational Geometry, Alicante, Spain.
Jun. 19–23 4th Austrian-Japanese-Mexican-Spanish Workshop on Discrete Geometry, Valladolid, Spain.
Jun. 12–16 CONNECT Workshop on Geometric Networks, Barcelona, Spain.
May 08–12 9th Crossing Numbers Workshop, Osnabrück, Germany.
Apr. 05–07 33rd European Workshop on Computational Geometry, Malmö, Sweden.
Jan. 27–Feb. 03 32nd Bellairs Winter Workshop on Computational Geometry, Holetown, Barbados.
2016
Sep. 28–Oct. 06 DK Fall School: Discrete Geometry and Topology, Graz, Austria.
Jul. 11–15 3rd Austrian-Japanese-Mexican-Spanish Workshop on Discrete Geometry, Ensenada, Mexico.
Jun. 16–24 Satellite Discrete Geometry Workshop and 8th Crossing Numbers Workshop, Strobl, Austria.
May 23–27 13th European Research Week on Geometric Graphs, Barcelona, Spain.
May 16–21 IEEE International Conference on Robotics and Automation, Stockholm, Sweden.
2015
Oct. 26–30 Workshop on Sidedness Queries, Ratsch, Austria.
Jul. 06–10 2nd Austrian-Japanese-Mexican-Spanish Workshop on Discrete Geometry, Barcelona, Spain.
Jul. 01–03 XVI Spanish Meeting on Computational Geometry, Barcelona, Spain.
Jun. 22–25 31st International Symposium on Computational Geometry, Eindhoven, the Netherlands.
In 2017–2019 Total of 2 months visiting Prof. R. Fabila and his research group at Cinvestav, Mexico.
In 2016–2019 Total of 3 weeks visiting Prof. V. Sacristán and her research group at Universitat Politècnica de Catalunya (UPC), Spain.
In 2017–2019 Total of 2 months visiting Prof. G. Salazar and his research group at Universidad Autónoma de San Luis Potosí (UASLP), Mexico.
In 2017–2018 Total of 2 months visiting Prof. J. Urrutia and his research group at Universidad Nacional Autónoma de México (UNAM), Mexico.
In 2015–2016 Total of 1 month visiting Prof. P. Valtr and his research group at Charles University in Prague, Czech Republic.
Oct. 10, 2018 Presentation and poster at the FWF DK Review Hearing, Vienna, Austria. The project got granted for another four years.
Jul. 09–10, 2018 Participation in the DK Retreat, Admont, Austria.
Jun. 15–16, 2018 Parada, I. Discrete and Computational Geometry: Order Types, Graphs, and Applications. Poster presented at Discrete Mathematics Symposium, Graz University of Technology, Austria.
May 21, 2018 Presentation at the midterm meeting of the CONNECT H2020-MSCA-RISE project.
Sep. 28–Oct. 06, 2016 Organizational support for the DK Fall School: Discrete Geometry and Topology, Graz, Austria.
Jun. 16–24, 2016 Organizational support for the Satellite Discrete Geometry Workshop and the 8th Crossing Numbers Workshop, Strobl, Austria.
Jul. 01–03, 2015 Organizational support for the XVI Spanish Meeting on Computational Geometry, Barcelona, Spain.
Dec. 12, 2014 I. Parada, P. Romero, G. Rodríguez, C. Amorós, and G. Barderas, G. RPAS Route Optimization. Presentation by P. Romero at the Fuzzy-MAD Congress 2014, Universidad Complutense de Madrid, Spain.
2012–2013 Author of collaborations and in charge of one section of Matgazine, the mathematics magazine of students of Universidad Complutense de Madrid, Spain.
Summer 2012 Volunteering in Addis Ababa and Asco, Ethiopia, using Padovan’s Method with children suffering from neurological deficits.
2011/2012 Volunteering teaching among groups deemed of social exclusion at Valdeperales Association, Madrid, Spain.
Summer 2011 Volunteering in Bacau, Romania, using Padovan’s Method with children suffering from neurological deficits.

Teaching

3rd Quartile 2020/2021
Data Structures. Teaching assistant. TU Eindhoven, The Netherlands.
1st Quartile 2020/2021
Algorithms and Data Structures. Teaching assistant and guest lecturer. TU Eindhoven, The Netherlands.
4th Quartile 2019/2020
Topological Data Analysis. Teaching assistant. TU Eindhoven, The Netherlands.
3rd Quartile 2019/2020
Data Structures. Teaching assistant. TU Eindhoven, The Netherlands.
Fall Semester 2019/2020
Discrete and Computational Geometry. Co-lecturer. Graz University of Technology, Austria.
Slides: Convex Hulls  |  Pointsets I  |  Order Types I  |  Order Types II  |  Line Arrangements
Spring Semester 2019
Enumerative Combinatoric Algorithms. Guest lecturer. Graz University of Technology, Austria.
Slides: Introduction to Enumeration and Pigeonhole Principle
Fall Semester 2018/2019
Design and Analysis of Algorithms. (Entwurf und Analyse von Algorithmen.) Guest lecturer. Graz University of Technology, Austria.
Slides: Dynamic Programming
Spring Semester 2015
Lineal Algebra. (Álgebra Lineal.) Student assistant. Universitat Politècnica de Catalunya, Spain.
Affine and Euclidean Geometry. (Geometría Afín y Euclídea.) Student assistant. Universitat Politècnica de Catalunya, Spain.
Discrete Mathematics. (Matemática Discreta.) Student assistant. Universitat Politècnica de Catalunya, Spain.

Publications

  • Crossing-optimal extension of simple drawings.
    R. Ganian, T. Hamm, F. Klute, I. Parada, and B. Vogtenhuber.
    ArXiv e-Prints, 2020.
  • Characterizing universal reconfigurability of modular pivoting robots.
    H. A. Akitaya, E. D. Demaine, A. Gonczi, D. H. Hendrickson, A. Hesterberg, M. Korman, O. Korten, J. Lynch, I. Parada, and V. Sacristán.
    ArXiv e-Prints, 2020.
  • Saturated k-plane drawings with few edges.
    F. Klute and I. Parada.
    ArXiv e-Prints, 2020.
  • A new meta-module design for efficient reconfiguration of modular robots.
    I. Parada, V. Sacristán, and R. I. Silveira.
    Autonomous Robots, accepted.
    A new meta-module for efficient reconfiguration of hinged-units modular robots.
    I. Parada, V. Sacristán, and R. I. Silveira.
    Proceedings of the IEEE International Conference on Robotics and Automation (ICRA'16), IEEE, pages 5197–5202, 2016.
    A new meta-module for efficient robot reconfiguration.
    I. Parada, V. Sacristán, and R. I. Silveira.
    Abstracts of the XVI Spanish Meeting on Computational Geometry (EGC'15), pages 49–52, 2015.
  • On compatible matchings.
    O. Aichholzer, A. Arroyo, Z. Masárová, I. Parada, D. Perz, A. Pilz, J. Tkadlec, and B. Vogtenhuber.
    Accepted at the 15th International Conference and Workshops on Algorithms and Computing (WALCOM'21).
    Best paper award
  • Upward point set embeddings of paths and trees.
    E. Arseneva, P. Cano, L. Kleist, T. Mchedlidze, S. Mehrabi, I. Parada, and P. Valtr.
    Accepted at the 15th International Conference and Workshops on Algorithms and Computing (WALCOM'21).
  • On the maximum number of crossings in star-simple drawings of $K_n$ with no empty lens.
    S. Felsner, M. Hoffmann, K. Knorr, and I. Parada.
    Accepted at the 28th International Symposium on Graph Drawing and Network Visualization (GD'20).
    On the maximum number of crossings in star-simple drawings of $K_n$ with no empty lens.
    S. Felsner, M. Hoffmann, K. Knorr, and I. Parada.
    Proceedings of the 36th European Workshop on Computational Geometry (EuroCG'20), pages 79:1–79:7, 2020.
  • Universal reconfiguration of facet-connected modular robots by pivots: the O(1) musketeers.
    H. Akitaya, E. Arkin, M. Damian, E. D. Demaine, V. Dujmović, R. Flatland, M. Korman, B. Palop, I. Parada, A. van Renssen, and V. Sacristán.
    Algorithmica, 2021.
    Universal reconfiguration of facet-connected modular robots by pivots: the O(1) musketeers.
    H. Akitaya, E. Arkin, M. Damian, E. D. Demaine, V. Dujmović, R. Flatland, M. Korman, B. Palop, I. Parada, A. van Renssen, and V. Sacristán.
    Proceedings of the 27th Annual European Symposium on Algorithms (ESA'19), volume 144 of LIPIcs, Dagstuhl Publishing, pages 3:1–3:14, 2019.
    Reconfiguring edge-connected pivoting modular robots.
    H. Akitaya, E. Arkin, M. Damian, E. D. Demaine, V. Dujmović, R. Flatland, M. Korman, B. Palop, I. Parada, A. van Renssen, and V. Sacristán.
    Abstracts of the XVIII Spanish Meeting on Computational Geometry (EGC'19), page 64, 2019.
  • Minimal representations of order types by geometric graphs.
    O. Aichholzer, M. Balko, M. Hoffmann, J. Kynčl, W. Mulzer, I. Parada, A. Pilz, M. Scheucher, P. Valtr, B. Vogtenhuber, and E. Welzl.
    Journal of Graph Algorithms and Applications (JGAA), Special issue on selected papers from the 27th International Symposium on Graph Drawing and Network Visualization (GD'19), volume 24, no. 4, pages 551–572, 2020.
    Minimal representations of order types by geometric graphs.
    O. Aichholzer, M. Balko, M. Hoffmann, J. Kynčl, W. Mulzer, I. Parada, A. Pilz, M. Scheucher, P. Valtr, B. Vogtenhuber, and E. Welzl.
    Proceedings of the 27th International Symposium on Graph Drawing and Network Visualization (GD'19), volume 11904 of LNCS, Springer, pages 101–113, 2019.
    Minimal geometric graph representations of order types.
    O. Aichholzer, M. Balko, M. Hoffmann, J. Kynčl, W. Mulzer, I. Parada, A. Pilz, M. Scheucher, P. Valtr, B. Vogtenhuber, and E. Welzl.
    Proceedings of the 34th European Workshop on Computational Geometry (EuroCG'18), pages 21:1–21:6, 2018.
  • New results in sona drawing: hardness and TSP separation.
    M.-K. Chiu, E. D. Demaine, Y. Diomidov, D. Eppstein, R. A. Hearn, A. Hesterberg, M. Korman, I. Parada, and M. Rudoy.
    Proceedings of the 31st Canadian Conference in Computational Geometry (CCCG'20), pages 63–72, 2020.
  • Inserting one edge into a simple drawing is hard.
    A. Arroyo, F. Klute, I. Parada, R. Seidel, B. Vogtenhuber, and T. Wiedera.
    Proceedings of the 46th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'20), volume 12301 of LNCS, Springer, pages 325–338, 2020.
  • Hiding sliding cubes: Why reconfiguring modular robots is not easy.
    T. Miltzow, I. Parada, W. Sonke, B. Speckmann, and J. Wulms.
    Proceedings of the 36th International Symposium on Computational Geometry (SoCG 2020), Media Exposition, pages 78:1–78:5, 2020.
  • A superlinear lower bound on the number of 5-holes.
    O. Aichholzer, M. Balko, T. Hackl, J. Kynčl, I. Parada, M. Scheucher, P. Valtr, and B. Vogtenhuber.
    Journal of Combinatorial Theory, Series A (JCTA), 173:105236, 2020.
    A superlinear lower bound on the number of 5-holes.
    O. Aichholzer, M. Balko, T. Hackl, J. Kynčl, I. Parada, M. Scheucher, P. Valtr, and B. Vogtenhuber.
    Proceedings of the 33rd International Symposium on Computational Geometry (SoCG'17), volume 77 of LIPIcs, Dagstuhl Publishing, pages 8:1–8:16, 2017.
    A superlinear lower bound on the number of 5-holes.
    O. Aichholzer, M. Balko, T. Hackl, J. Kynčl, I. Parada, M. Scheucher, P. Valtr, and B. Vogtenhuber.
    Proceedings of the 33rd European Workshop on Computational Geometry (EuroCG'17), pages 69–72, 2017.
  • Simple drawings of $K_{m,n}$ contain shooting stars.
    O. Aichholzer, A. García, I. Parada, B. Vogtenhuber, and A. Weinberger.
    Proceedings of the 36th European Workshop on Computational Geometry (EuroCG'20), pages 36:1–36:7, 2020.
  • Scheduling drones to cover outdoor events.
    O. Aichholzer, L. E. Caraballo de La Cruz, J.-M. Díaz-Báñez, R. Fabila-Monroy, I. Parada, I. Ventura, and B. Vogtenhuber.
    Proceedings of the 36th European Workshop on Computational Geometry (EuroCG'20), pages 24:1–24:7, 2020.
  • Graphs with large total angular resolution.
    O. Aichholzer, M. Korman, Y. Okamoto, I. Parada, D. Perz, A. van Renssen, and B. Vogtenhuber.
    Proceedings of the 27th International Symposium on Graph Drawing and Network Visualization (GD'19), volume 11904 of LNCS, Springer, pages 193–199, 2019.
  • Extending simple drawings.
    A. Arroyo, M. Derka, and I. Parada.
    Proceedings of the 27th International Symposium on Graph Drawing and Network Visualization (GD'19), volume 11904 of LNCS, Springer, pages 230–243, 2019.
    Extending simple drawings.
    A. Arroyo, M. Derka, and I. Parada.
    Proceedings of the 35th European Workshop on Computational Geometry (EuroCG'19), pages 60:1–60:7, 2019.
  • On the 2-colored crossing number.
    O. Aichholzer, R. Fabila-Monroy, A. Fuchs, C. Hidalgo-Toscano, I. Parada, B. Vogtenhuber, and F. Zaragoza.
    Proceedings of the 27th International Symposium on Graph Drawing and Network Visualization (GD'19), volume 11904 of LNCS, Springer, pages 87–100, 2019.
    On the 2-colored crossing number.
    O. Aichholzer, R. Fabila-Monroy, A. Fuchs, C. Hidalgo-Toscano, I. Parada, B. Vogtenhuber, and F. Zaragoza.
    Proceedings of the 35th European Workshop on Computational Geometry (EuroCG'19), pages 56:1–56:7, 2019.
  • Efficient segment folding is hard.
    T. Horiyama, F. Klute, M. Korman, I. Parada, R. Uehara, and K. Yamanaka.
    Proceedings of the 31st Canadian Conference in Computational Geometry (CCCG'19), pages 177–183, 2019.
  • Extending to 1-plane drawings.
    F. Klute, I. Parada, and T. Hamm.
    Abstracts of the XVIII Spanish Meeting on Computational Geometry (EGC'19), pages 30–33, 2019.
  • Hamiltonian meander paths and cycles on bichromatic point sets.
    O. Aichholzer, C. Alegría, I. Parada, A. Pilz, J. Tejel, C. D. Tóth, J. Urrutia, and B. Vogtenhuber.
    Abstracts of the XVIII Spanish Meeting on Computational Geometry (EGC'19), pages 35–38, 2019.
  • Bounding the number of crossings for a particular class of drawings of $K_{n,n}$.
    C. Medina, I. Parada, G. Salazar, and B. Vogtenhuber.
    Abstracts of the XVIII Spanish Meeting on Computational Geometry (EGC'19), page 34, 2019.
  • Shooting stars in simple drawings of $K_{m,n}$.
    O. Aichholzer, I. Parada, M. Scheucher, B. Vogtenhuber, and A. Weinberger.
    Proceedings of the 35th European Workshop on Computational Geometry (EuroCG'19), pages 59:1–59:6, 2019.
  • How to fit a tree in a box.
    H. Akitaya, M. Löffler, and I. Parada.
    Proceedings of the 26th International Symposium on Graph Drawing and Network Visualization (GD'18), volume 11282 of LNCS, Springer, pages 361–367, 2018.
  • On semi-simple drawings of the complete graph.
    O. Aichholzer, F. Ebenführer, I. Parada, A. Pilz, and B. Vogtenhuber.
    Abstracts of the XVII Spanish Meeting on Computational Geometry (EGC'17), pages 25–28, 2017.

Theses

  • On straight-line and topological drawings of graphs in the plane.
    I. Parada.
    PhD thesis, Graz University of Technology, Austria, 2019. 184 pages.
  • Systematic strategies for 3-dimensional modular robots.
    I. Parada.
    Master’s thesis, Universitat Politècnica de Catalunya, Spain, 2015. 48 pages.
  • Optimización de estrategias de vuelo de vehículos pilotados por control remoto.
    I. Parada.
    Bacelor's thesis, Universidad Complutense de Madrid, Spain, 2014. 25 pages.

List of Co-Authors

Oswin Aichholzer Carlos Alegría Hugo Akitaya Esther Arkin Alan Arroyo Elena Arseneva Martin Balko Pilar Cano Man-Kwun Chiu Mirela Damian Erik D. Demaine Martin Derka Yevhenii Diomidov Vida Dujmović Florian Ebenführer David Eppstein Ruy Fabila Monroy Robin Flatland Adrian Fuchs Robert Ganian Andrei Gonczi Thomas Hackl Thekla Hamm Robert A. Hearn Dylan H. Hendrickson Adam Hesterberg Carlos Hidalgo Toscano Michael Hoffmann Takashi Horiyama Linda Kleist Fabian Klute Matias Korman Oliver Korten Jan Kynčl Maarten Löffler Jayson Lynch Zuzana Masárová Tamara Mchedlidze Carolina Medina Saeed Mehrabi Tillmann Miltzow Wolfgang Mulzer Yoshio Okamoto Belén Palop Daniel Perz Alexander Pilz André van Renssen Mikhail Rudoy Vera Sacristán Gelasio Salazar Manfred Scheucher Raimund Seidel Rodrigo I. Silveira Willem Sonke Bettina Speckmann Javier Tejel Josef Tkadlec Csaba D. Tóth Ryuhei Uehara Jorge Urrutia Pavel Valtr Birgit Vogtenhuber Alexandra Weinberger Emo Welzl Tilo Wiedera Jules Wulms Katsuhisa Yamanaka Francisco Zaragoza