Irene Parada

According to our database1, Irene Parada authored at least 25 papers between 2016 and 2021.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Crossing Numbers of Beyond-Planar Graphs Revisited.
CoRR, 2021

Compacting Squares.
CoRR, 2021

A new meta-module design for efficient reconfiguration of modular robots.
Auton. Robots, 2021

Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) Musketeers.
Algorithmica, 2021

Upward Point Set Embeddings of Paths and Trees.
Proceedings of the WALCOM: Algorithms and Computation, 2021

On Compatible Matchings.
Proceedings of the WALCOM: Algorithms and Computation, 2021

Crossing-Optimal Extension of Simple Drawings.
Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

Characterizing Universal Reconfigurability of Modular Pivoting Robots.
Proceedings of the 37th International Symposium on Computational Geometry, 2021

2020
Minimal Representations of Order Types by Geometric Graphs.
J. Graph Algorithms Appl., 2020

A superlinear lower bound on the number of 5-holes.
J. Comb. Theory, Ser. A, 2020

Efficient Segment Folding is Hard.
CoRR, 2020

Upward Point Set Embeddings of Paths and Trees.
CoRR, 2020

Saturated k-Plane Drawings with Few Edges.
CoRR, 2020

On the Maximum Number of Crossings in Star-Simple Drawings of K<sub>n</sub> with No Empty Lens.
CoRR, 2020

Inserting One Edge into a Simple Drawing Is Hard.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2020

On the Maximum Number of Crossings in Star-Simple Drawings of K<sub>n</sub> with No Empty Lens.
Proceedings of the Graph Drawing and Network Visualization - 28th International Symposium, 2020

Hiding Sliding Cubes: Why Reconfiguring Modular Robots Is Not Easy (Media Exposition).
Proceedings of the 36th International Symposium on Computational Geometry, 2020

New Results in Sona Drawing: Hardness and TSP Separation.
Proceedings of the 32nd Canadian Conference on Computational Geometry, 2020

2019
Extending simple drawings with one edge is hard.
CoRR, 2019

Extending Simple Drawings.
Proceedings of the Graph Drawing and Network Visualization - 27th International Symposium, 2019

On the 2-Colored Crossing Number.
Proceedings of the Graph Drawing and Network Visualization - 27th International Symposium, 2019

Graphs with Large Total Angular Resolution.
Proceedings of the Graph Drawing and Network Visualization - 27th International Symposium, 2019

Ecient Segment Folding is Hard.
Proceedings of the 31st Canadian Conference on Computational Geometry, 2019

2018
How to Fit a Tree in a Box.
Proceedings of the Graph Drawing and Network Visualization - 26th International Symposium, 2018

2016
A new meta-module for efficient reconfiguration of hinged-units modular robots.
Proceedings of the 2016 IEEE International Conference on Robotics and Automation, 2016


  Loading...