About Me
Hi! I am Irene Parada, currently an assistant professor and Serra Húnter fellow at the Universitat Politècnica de Catalunya (UPC BarcelonaTech), Spain. Here I am part of the Research Group on Discrete, Combinatorial and Computational Geometry. Before that I have been a Margarita Salas postdoctoral fellow in the same group, a visiting postdoc of the Geometric Computing Group at Utrecht University, The Netherlands, a postdoctoral researcher in the Section for Algorithms, Logic, and Graphs at the Technical University of Denmark, Denmark, working with Eva Rotenberg, and a postdoc at TU Eindhoven, The Netherlands.
In November 2019 I finished my PhD with distiction at Graz University of Technology, Austria, under the supervision of Oswin Aichholzer.
Contact
Universitat Politècnica de Catalunya
Jordi Girona, 1--3
08034 Barcelona
Spain
Research Interests
Some more background
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 with the best academic record of the year, and in 2015 a Master's degree in Advanced Mathematics and Mathematical Engineering from Universitat Politècnica de Catalunya.
Teaching
Rewarded with Excellent Course Evaluation.
Rewarded with Excellent Course Evaluation.
Publications
-
Graphs with large total angular resolution.Theoretical Computer Science, volume 943, pages 73–88, 2023.
-
Inserting one edge into a simple drawing is hard.Discrete & Computational Geometry, volume 69, no. 3, pages 745–770, 2023.
-
Perfect matchings with crossingsProceedings of the 33rd International Workshop on Combinatorial Algorithms (IWOCA’22), volume 13270 of LNCS, Springer, pages 46–59, 2022.
-
Simple drawings of $K_{m,n}$ contain shooting stars.Proceedings of the 30th International Symposium on Graph Drawing and Network Visualization (GD’22), volume 13764 of LNCS, Springer, pages 49–57, 2022.
-
On compatible matchings.Journal of Graph Algorithms and Applications, volume 26, no. 2, pages 225–240, 2022.On compatible matchings.Proceedings of the 15th International Conference and Workshops on Algorithms and Computing (WALCOM'21), volume 12635 of LNCS, Springer, pages 221–233, 2021.Best paper award
-
Compacting squares: input-sensitive in-place reconfiguration of sliding squares.Proceedings of the 18th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT’22), volume 227 of LIPIcs, Dagstuhl Publishing, pages 4:1–4:19, 2022.
-
On the maximum number of crossings in star-simple drawings of $K_n$ with no empty lens.Journal of Graph Algorithms and Applications, volume 26, no. 3, pages 381–399, 2022.On the maximum number of crossings in star-simple drawings of $K_n$ with no empty lens.Proceedings of the 28th International Symposium on Graph Drawing and Network Visualization (GD'20), volume 12590 of LNCS, Springer, pages 382–389, 2020.
-
Efficient segment folding is hard.Computational Geometry: Theory and Applications, volume 104, page 101860, 2022.
-
Crossing numbers of beyond-planar graphs revisited.Journal of Graph Algorithms and Applications, volume 26, no. 1, pages 149–170, 2022.
-
Saturated k-plane drawings with few edges.Proceedings of the 28th International Symposium on Graph Drawing and Network Visualization (GD'21), volume 12868 of LNCS, Springer, pages 3–17, 2021.Best paper award
-
Crossing-optimal extension of simple drawings.Proceedings of the 48th International Colloquium on Automata, Languages, and Programming (ICALP’21), volume 198 of LIPIcs, Dagstuhl Publishing, pages 72:1–72:17, 2021.
-
Characterizing universal reconfigurability of modular pivoting robots.Proceedings of the 37th International Symposium on Computational Geometry (SoCG’21), volume 189 of LIPIcs, Dagstuhl Publishing, pages 10:1–10:20, 2021.
-
A new meta-module design for efficient reconfiguration of modular robots.Autonomous Robots, volume 45, no. 4, pages 457–472, 2021.A new meta-module for efficient reconfiguration of hinged-units modular robots.Proceedings of the IEEE International Conference on Robotics and Automation (ICRA'16), IEEE, pages 5197–5202, 2016.
-
Universal reconfiguration of facet-connected modular robots by pivots: the O(1) musketeers.Algorithmica, volume 83, no. 5, pages 1316–1351, 2021.Universal reconfiguration of facet-connected modular robots by pivots: the O(1) musketeers.Proceedings of the 27th Annual European Symposium on Algorithms (ESA'19), volume 144 of LIPIcs, Dagstuhl Publishing, pages 3:1–3:14, 2019.
-
Minimal representations of order types by geometric graphs.Journal of Graph Algorithms and Applications, 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.Proceedings of the 27th International Symposium on Graph Drawing and Network Visualization (GD'19), volume 11904 of LNCS, Springer, pages 101–113, 2019.
-
A superlinear lower bound on the number of 5-holes.Journal of Combinatorial Theory, Series A, 173:105236, 2020.A superlinear lower bound on the number of 5-holes.Proceedings of the 33rd International Symposium on Computational Geometry (SoCG'17), volume 77 of LIPIcs, Dagstuhl Publishing, pages 8:1–8:16, 2017.
-
Extending simple drawings.Proceedings of the 27th International Symposium on Graph Drawing and Network Visualization (GD'19), volume 11904 of LNCS, Springer, pages 230–243, 2019.
-
On the 2-colored crossing number.Proceedings of the 27th International Symposium on Graph Drawing and Network Visualization (GD'19), volume 11904 of LNCS, Springer, pages 87–100, 2019.
Theses
-
On straight-line and topological drawings of graphs in the plane.PhD thesis, Graz University of Technology, Austria, 2019. 184 pages.
-
Systematic strategies for 3-dimensional modular robots.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.Bacelor's thesis, Universidad Complutense de Madrid, Spain, 2014. 25 pages.