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.

Prior to this, I was a Margarita Salas postdoctoral fellow with the same group and a visiting postdoc with the Geometric Computing Group at Utrecht University in the Netherlands. I've also held a postdoctoral position in the Section for Algorithms, Logic, and Graphs at the Technical University of Denmark, where I worked with Eva Rotenberg, as well as a postdoc position in the Algorithms cluster at TU Eindhoven, The Netherlands.

Contact

Irene Parada ORCID iD icon[ORCiD link]
Edifici Omega (office 440), Campus Nord
Universitat Politècnica de Catalunya
Jordi Girona, 1--3
08034 Barcelona
Spain
E-mail: irene.parada(at)upc.edu

Research Interests

Combinatorial and Computational Geometry
Graph Drawing
Algorithms for Robotics

Academic background

In 2019, I completed my PhD with distinction at Graz University of Technology, Austria, under the supervision of Oswin Aichholzer. Prior to that, in 2015, I earned a Master's degree in Advanced Mathematics and Mathematical Engineering from Universitat Politècnica de Catalunya. A year earlier, in 2014, I received my Bachelor's degree in Mathematical Engineering from Universidad Complutense de Madrid, where I graduated with the highest academic honors of the year.

Teaching

Spring Semester 2024
Computación Numérica. (Numerical Computing.) Lecturer and Coordinator. Universitat Politècnica de Catalunya, Spain.
Métodos Numéricos. (Numerical Methods.) Lecturer and Coordinator. Universitat Politècnica de Catalunya, Spain.
1st Quartile 2022/2023
Motion and Manipulation. Lecturer. Utrecht University, The Netherlands.
4th Quartile 2020/2021
Seminar Algorithms. Lecturer. TU Eindhoven, The Netherlands.
Rewarded with Excellent Course Evaluation.
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.
Rewarded with Excellent Course Evaluation.
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. Lecturer. Graz University of Technology, Austria.
Spring Semester 2019
Enumerative Combinatoric Algorithms. Guest lecturer. Graz University of Technology, Austria.
Fall Semester 2018/2019
Design and Analysis of Algorithms. (Entwurf und Analyse von Algorithmen.) Guest lecturer. Graz University of Technology, Austria.
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

  • Perfect matchings with crossings.
    O. Aichholzer, R. Fabila-Monroy, P. Kindermann, I. Parada, R. Paul, D. Perz, P. Schnider, and B. Vogtenhuber.
    Algorithmica, volume 86, no. 3, pages 697–716, 2024.
    Perfect matchings with crossings
    O. Aichholzer, R. Fabila-Monroy, P. Kindermann, I. Parada, R. Paul, D. Perz, P. Schnider, and B. Vogtenhuber.
    Proceedings of the 33rd International Workshop on Combinatorial Algorithms (IWOCA’22), volume 13270 of LNCS, Springer, pages 46–59, 2022.
  • Dynamic Embeddings of Dynamic Single-Source Upward Planar Graphs.
    I. van der Hoog, I. Parada, and E. Rotenberg.
    Proceedings of the 32nd Annual European Symposium on Algorithms (ESA'24), volume 14578 of LIPIcs, Springer, pages 336–349, 2024.
  • Geometric Thickness of Multigraphs is $\mathbf{\exists\mathbb{R}}$-Complete.
    Henry Förster, P. Kindermann, T. Miltzow, I. Parada, S. Terziadis, and B. Vogtenhuber.
    Proceedings of the 16th Latin American Symposium on Theoretical Informatics (LATIN'24), volume 308 of LNCS, Dagstuhl Publishing, pages 70:1--70:18, 2024.
  • On $k$-Plane Insertion into Plane Drawings.
    J. Katheder, P. Kindermann, F. Klute, I. Parada, and I. Rutter.
    Proceedings of the 32nd International Symposium on Graph Drawing and Network Visualization (GD'24), 2024. To appear.
  • Optimal In-Place Compaction of Sliding Cubes.
    I. Kostitsyna, T. Ophelders, I. Parada, T. Peters, W. Sonke, and B. Speckmann.
    Proceedings of the 19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT'19), volume 294 of LIPIcs, Dagstuhl Publishing, pages 31:1–31:14, 2024.
    Optimal In-Place Compaction of Sliding Cubes.
    I. Kostitsyna, T. Ophelders, I. Parada, T. Peters, W. Sonke, and B. Speckmann.
    Proceedings of the 40th International Symposium on Computational Geometry (SoCG'24), Media Exposition, volume 293 of LIPIcs, Dagstuhl Publishing, pages 89:1–89:4, 2024.
  • The Complexity of Geodesic Spanners using Steiner Points.
    S. de Berg, T. Ophelders, I. Parada, F. Staals, and J. Wulms.
    Proceedings of the 35th International Symposium on Algorithms and Computation (ISAAC'24), 2024. To appear.
  • Barking dogs: A Fréchet distance variant for detour detection.
    I. van der Hoog, F. Klute, I. Parada, and P. Schnider.
    2024. Submitted.
  • Graphs with large total angular resolution.
    O. Aichholzer, M. Korman, Y. Okamoto, I. Parada, D. Perz, A. van Renssen, and B. Vogtenhuber.
    Theoretical Computer Science, volume 943, pages 73–88, 2023.
    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.
  • Inserting one edge into a simple drawing is hard.
    A. Arroyo, F. Klute, I. Parada, R. Seidel, B. Vogtenhuber, and T. Wiedera.
    Discrete & Computational Geometry, volume 69, no. 3, pages 745–770, 2023.
    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.
  • Perfect matchings with crossings
    O. Aichholzer, R. Fabila-Monroy, P. Kindermann, I. Parada, R. Paul, D. Perz, P. Schnider, and B. Vogtenhuber.
    Abstracts of the Computational Geometry: Young Researchers Forum (CG:YRF’21), pages 24–27, 2021.
  • Simple drawings of $K_{m,n}$ contain shooting stars.
    O. Aichholzer, A. García, I. Parada, B. Vogtenhuber, and A. Weinberger.
    Proceedings of the 30th International Symposium on Graph Drawing and Network Visualization (GD’22), volume 13764 of LNCS, Springer, pages 49–57, 2022.
    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.
  • On compatible matchings.
    O. Aichholzer, A. Arroyo, Z. Masárová, I. Parada, D. Perz, A. Pilz, J. Tkadlec, and B. Vogtenhuber.
    Journal of Graph Algorithms and Applications, volume 26, no. 2, pages 225–240, 2022.
    On compatible matchings.
    O. Aichholzer, A. Arroyo, Z. Masárová, I. Parada, D. Perz, A. Pilz, J. Tkadlec, and B. Vogtenhuber.
    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
  • Blocking Delaunay triangulations from the exterior.
    O. Aichholzer, T. Hackl, M. Löffler, A. Pilz, I. Parada, M. Scheucher, and B. Vogtenhuber.
    Proceedings of the 38th European Workshop on Computational Geometry (EuroCG'22), pages 9:1–9:8, 2022.
  • Compacting squares: input-sensitive in-place reconfiguration of sliding squares.
    H. A. Akitaya, E. D. Demaine, M. Korman, I. Kostitsyna, I. Parada, W. Sonke, B. Speckmann, R. Uehara, and J. Wulms.
    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.
    Compacting squares: input-sensitive in-place reconfiguration of sliding squares.
    H. A. Akitaya, E. D. Demaine, M. Korman, I. Kostitsyna, I. Parada, W. Sonke, B. Speckmann, R. Uehara, and J. Wulms.
    Proceedings of the 38th European Workshop on Computational Geometry (EuroCG'22), pages 19:1–19:8, 2022.
  • How to fit a tree in a box.
    H. A. Akitaya, M. Löffler, and I. Parada.
    Graphs and Combinatorics, volume 38, no. 5, pages 155, 2022.
    How to fit a tree in a box.
    H. A. 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 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.
    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.
    S. Felsner, M. Hoffmann, K. Knorr, and I. Parada.
    Proceedings of the 28th International Symposium on Graph Drawing and Network Visualization (GD'20), volume 12590 of LNCS, Springer, pages 382–389, 2020.
    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.
  • EfficienSummert segment folding is hard.
    T. Horiyama, F. Klute, M. Korman, I. Parada, R. Uehara, and K. Yamanaka.
    Computational Geometry: Theory and Applications, volume 104, page 101860, 2022.
    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.
  • Crossing numbers of beyond-planar graphs revisited.
    N. van Beusekom, I. Parada, and B. Speckmann.
    Journal of Graph Algorithms and Applications, volume 26, no. 1, pages 149–170, 2022.
    Crossing numbers of beyond-planar graphs revisited.
    N. van Beusekom, I. Parada, and B. Speckmann.
    Proceedings of the 37th European Workshop on Computational Geometry (EuroCG'21), pages 36:1–36:7, 2021.
  • Saturated k-plane drawings with few edges.
    S. Chaplick, F. Klute, J. Rollin, I. Parada, and T. Ueckerdt.
    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.
    R. Ganian, T. Hamm, F. Klute, I. Parada, and B. Vogtenhuber.
    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.
    Crossing-optimal extension of simple drawings.
    R. Ganian, T. Hamm, F. Klute, I. Parada, and B. Vogtenhuber.
    Abstracts of the XIX Spanish Meeting on Computational Geometry (EGC’21), page 5, 2021.
  • 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.
    Proceedings of the 37th International Symposium on Computational Geometry (SoCG’21), volume 189 of LIPIcs, Dagstuhl Publishing, pages 10:1–10:20, 2021.
    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.
    Proceedings of the 37th European Workshop on Computational Geometry (EuroCG'21), pages 56:1–56:7, 2021.
  • A new meta-module design for efficient reconfiguration of modular robots.
    I. Parada, V. Sacristán, and R. I. Silveira.
    Autonomous Robots, volume 45, no. 4, pages 457–472, 2021.
    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.
  • Upward point set embeddings of paths and trees.
    E. Arseneva, P. Cano, L. Kleist, T. Mchedlidze, S. Mehrabi, I. Parada, and P. Valtr.
    Proceedings of the 15th International Conference and Workshops on Algorithms and Computing (WALCOM'21), volume 12635 of LNCS, Springer, pages 234–246, 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.
    Algorithmica, volume 83, no. 5, pages 1316–1351, 2021.
    Universal reconfiguration of facet-connected modular robots by pivots: the O(1) musketeers.
    H. A. 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. A. 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, 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.
  • Dominect: a simple yet deep 2-player board game.
    O. Aichholzer, M. Löffler, J. Lynch, Z. Masárová, J. Orthaber, I. Parada, R. Paul, D. Perz, B. Vogtenhuber, and A. Weinberger.
    Abstracts of the 23rd Thailand-Japan Conference on Discrete and Computational Geometry, Graphs, and Games (TJCDCGGG 2020+1), pages 112–113, 2021.
  • Dominect: a simple yet deep 2-player board game.
    O. Aichholzer, R. Fabila Monroy, P. Kindermann, I. Parada, R. Paul, D. Perz, P. Schnider, and B. Vogtenhuber.
    Abstracts of the Computational Geometry: Young Researchers Forum (CG:YRF’21), pages 24–27, 2021.
  • 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'20), 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, 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.
    https://link.springer.com/chapter/10.1007/978-3-031-55598-5_22 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, https://link.springer.com/chapter/10.1007/978-3-031-55598-5_22 2017.
  • 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.
  • 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.
  • 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.
  • 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 Sarita de Berg Nathan van Beusekom Pilar Cano Steven Chaplick Man-Kwun Chiu Mirela Damian Erik D. Demaine Martin Derka Yevhenii Diomidov Vida Dujmović Florian Ebenführer David Eppstein Ruy Fabila Monroy Robin Flatland Henry Förster Adrian Fuchs Robert Ganian Andrei Gonczi Thomas Hackl Thekla Hamm Robert A. Hearn Dylan H. Hendrickson Adam Hesterberg Carlos Hidalgo Toscano Michael Hoffmann Ivor van der Hoog Takashi Horiyama Julia Katheder Philipp Kindermann Linda Kleist Fabian Klute Matias Korman Oliver Korten Irina Kostitsyna Jan Kynčl Maarten Löffler Jayson Lynch Zuzana Masárová Tamara Mchedlidze Carolina Medina Saeed Mehrabi Tillmann Miltzow Wolfgang Mulzer Yoshio Okamoto Tim Ophelders Joachim Orthaber Belén Palop Rosna Paul Daniel Perz Tom Peters Alexander Pilz André van Renssen Jonathan Rollin Eva Rotenberg Mikhail Rudoy Ignaz Rutter Vera Sacristán Gelasio Salazar Manfred Scheucher Patrick Schnider Raimund Seidel Rodrigo I. Silveira Willem Sonke Bettina Speckmann Frank Staals Javier Tejel Soeren Terziadis Josef Tkadlec Csaba D. Tóth Torsten Ueckerdt Ryuhei Uehara Jorge Urrutia Pavel Valtr Birgit Vogtenhuber Kees Voorintholt Alexandra Weinberger Emo Welzl Tilo Wiedera Jules Wulms Katsuhisa Yamanaka Francisco Zaragoza Zeyu Zhang