Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O (1) Musketeers HA Akitaya, EM Arkin, M Damian, ED Demaine, V Dujmović, R Flatland, ...
Algorithmica 83, 1316-1351, 2021
38 2021 Inserting one edge into a simple drawing is hard A Arroyo, F Klute, I Parada, B Vogtenhuber, R Seidel, T Wiedera
Discrete & Computational Geometry 69 (3), 745-770, 2023
18 2023 A new meta-module design for efficient reconfiguration of modular robots I Parada, V Sacristán, RI Silveira
Autonomous robots 45 (4), 457-472, 2021
18 2021 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, ...
Journal of Combinatorial Theory, Series A 173, 105236, 2020
16 2020 Extending simple drawings A Arroyo, M Derka, I Parada
International Symposium on Graph Drawing and Network Visualization, 230-243, 2019
14 2019 Characterizing universal reconfigurability of modular pivoting robots HA Akitaya, ED Demaine, A Gonczi, DH Hendrickson, A Hesterberg, ...
arXiv preprint arXiv:2012.07556, 2020
13 2020 Crossing-optimal extension of simple drawings R Ganian, T Hamm, F Klute, I Parada, B Vogtenhuber
arXiv preprint arXiv:2012.07457, 2020
12 2020 Compacting squares: Input-sensitive in-place reconfiguration of sliding squares HA Akitaya, ED Demaine, M Korman, I Kostitsyna, I Parada, W Sonke, ...
arXiv preprint arXiv:2105.07997, 2021
10 2021 How to fit a tree in a box HA Akitaya, M Löffler, I Parada
Graphs and Combinatorics 38 (5), 155, 2022
9 2022 On the 2-colored crossing number O Aichholzer, R Fabila-Monroy, A Fuchs, C Hidalgo-Toscano, I Parada, ...
International Symposium on Graph Drawing and Network Visualization, 87-100, 2019
8 2019 Edge‐minimum saturated S Chaplick, F Klute, I Parada, J Rollin, T Ueckerdt
Journal of Graph Theory 106 (4), 741-762, 2024
7 2024 A new meta-module for efficient reconfiguration of hinged-units modular robots I Parada, V Sacristán, RI Silveira
2016 IEEE International Conference on Robotics and Automation (ICRA), 5197-5202, 2016
7 2016 Perfect matchings with crossings O Aichholzer, R Fabila-Monroy, P Kindermann, I Parada, R Paul, D Perz, ...
Algorithmica 86 (3), 697-716, 2024
6 2024 Minimal representations of order types by geometric graphs O Aichholzer, M Balko, M Hoffmann, J Kynčl, W Mulzer, I Parada, A Pilz, ...
International Symposium on Graph Drawing and Network Visualization, 101-113, 2019
6 2019 Optimal in-place compaction of sliding cubes I Kostitsyna, T Ophelders, I Parada, T Peters, W Sonke, B Speckmann
arXiv preprint arXiv:2312.15096, 2023
5 2023 Crossing numbers of beyond-planar graphs revisited N van Beusekom, I Parada, B Speckmann
Graph Drawing and Network Visualization: 29th International Symposium, GD …, 2021
5 2021 On semi-simple drawings of the complete graph O Aichholzer, F Ebenführer, I Parada, A Pilz, B Vogtenhuber
XVII Spanish Meeting on Computational Geometry (EGC 2017), 25-28, 2017
5 2017 Shooting Stars in Simple Drawings of O Aichholzer, A García, I Parada, B Vogtenhuber, A Weinberger
International Symposium on Graph Drawing and Network Visualization, 49-57, 2022
4 2022 On the Maximum Number of Crossings in Star-Simple Drawings of S Felsner, M Hoffmann, K Knorr, I Parada
International Symposium on Graph Drawing and Network Visualization, 382-389, 2020
4 2020 Hiding sliding cubes: Why reconfiguring modular robots is not easy (media exposition) T Miltzow, I Parada, W Sonke, B Speckmann, J Wulms
36th International Symposium on Computational Geometry (SoCG 2020), 2020
4 2020 