| 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 | 47 | 2021 |
| 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 | 19 | 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 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 |
| Characterizing universal reconfigurability of modular pivoting robots HA Akitaya, ED Demaine, A Gonczi, DH Hendrickson, A Hesterberg, ... arXiv preprint arXiv:2012.07556, 2020 | 15 | 2020 |
| Extending simple drawings A Arroyo, M Derka, I Parada International Symposium on Graph Drawing and Network Visualization, 230-243, 2019 | 15 | 2019 |
| Crossing-optimal extension of simple drawings R Ganian, T Hamm, F Klute, I Parada, B Vogtenhuber arXiv preprint arXiv:2012.07457, 2020 | 14 | 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 | 12 | 2021 |
| How to fit a tree in a box HA Akitaya, M Löffler, I Parada Graphs and Combinatorics 38 (5), 155, 2022 | 10 | 2022 |
| 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 | 8 | 2023 |
| 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 ‐planar drawings S Chaplick, F Klute, I Parada, J Rollin, T Ueckerdt Journal of Graph Theory 106 (4), 741-762, 2024 | 7 | 2024 |
| Crossing numbers of beyond-planar graphs revisited N van Beusekom, I Parada, B Speckmann arXiv preprint arXiv:2105.12452, 2021 | 7 | 2021 |
| 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 | 7 | 2019 |
| 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 | 5 | 2024 |
| 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 |
| Geometric Thickness of Multigraphs is -Complete H Förster, P Kindermann, T Miltzow, I Parada, S Terziadis, B Vogtenhuber Latin American Symposium on Theoretical Informatics, 336-349, 2024 | 4 | 2024 |
| 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 with No Empty Lens S Felsner, M Hoffmann, K Knorr, I Parada International Symposium on Graph Drawing and Network Visualization, 382-389, 2020 | 4 | 2020 |
