Suivre
Irene Parada
Irene Parada
Adresse e-mail validée de upc.edu
Titre
Citée par
Citée par
Année
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
402021
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
152021
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
152020
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
142023
Extending simple drawings
A Arroyo, M Derka, I Parada
International Symposium on Graph Drawing and Network Visualization, 230-243, 2019
112019
Characterizing universal reconfigurability of modular pivoting robots
HA Akitaya, ED Demaine, A Gonczi, DH Hendrickson, A Hesterberg, ...
arXiv preprint arXiv:2012.07556, 2020
102020
Crossing-optimal extension of simple drawings
R Ganian, T Hamm, F Klute, I Parada, B Vogtenhuber
arXiv preprint arXiv:2012.07457, 2020
102020
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
92021
How to fit a tree in a box
HA Akitaya, M Löffler, I Parada
Graphs and Combinatorics 38 (5), 155, 2022
82022
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
82019
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
82016
Edge-Minimum Saturated k-Planar Drawings
S Chaplick, F Klute, I Parada, J Rollin, T Ueckerdt
Graph Drawing and Network Visualization: 29th International Symposium, GD …, 2021
72021
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
72019
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
52017
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
42023
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
42022
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
32020
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
32020
Extending simple drawings with one edge is hard
A Arroyo, F Klute, I Parada, R Seidel, B Vogtenhuber, T Wiedera
arXiv preprint arXiv:1909.07347, 2019
32019
Hamiltonian meander paths and cycles on bichromatic point sets
O Aichholzer, C Alegría, I Parada, A Pilz, J Tejel, CD Tóth, J Urrutia, ...
XVIII Spanish Meeting on Computational Geometry, 35-38, 2019
32019
Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.
Articles 1–20