Irene Parada

About Irene Parada

Irene Parada, With an exceptional h-index of 8 and a recent h-index of 8 (since 2020), a distinguished researcher at Technische Universiteit Eindhoven,

His recent articles reflect a diverse array of research interests and contributions to the field:

Geometric Thickness of Multigraphs is -Complete

Optimal In-Place Compaction of Sliding Cubes

Perfect matchings with crossings

On -Plane Insertion into Plane Drawings

Barking dogs: A Fr\'echet distance variant for detour detection

The Complexity of Geodesic Spanners using Steiner Points

Geometric Thickness of Multigraphs is -complete

Inserting one edge into a simple drawing is hard

Irene Parada Information

University

Position

___

Citations(all)

163

Citations(since 2020)

149

Cited By

41

hIndex(all)

8

hIndex(since 2020)

8

i10Index(all)

5

i10Index(since 2020)

4

Email

University Profile Page

Google Scholar

Top articles of Irene Parada

Geometric Thickness of Multigraphs is -Complete

2024/3/6

Optimal In-Place Compaction of Sliding Cubes

arXiv preprint arXiv:2312.15096

2023/12/22

Perfect matchings with crossings

Algorithmica

2024/3

Philipp Kindermann
Philipp Kindermann

H-Index: 10

Irene Parada
Irene Parada

H-Index: 4

On -Plane Insertion into Plane Drawings

arXiv preprint arXiv:2402.14552

2024/2/22

Barking dogs: A Fr\'echet distance variant for detour detection

arXiv preprint arXiv:2402.13159

2024/2/20

The Complexity of Geodesic Spanners using Steiner Points

arXiv preprint arXiv:2402.12110

2024/2/19

Geometric Thickness of Multigraphs is -complete

arXiv preprint arXiv:2312.05010

2023/12/8

Inserting one edge into a simple drawing is hard

Discrete & Computational Geometry

2023/4

Graphs with large total angular resolution

Theoretical Computer Science

2023/1/17

Irene Parada
Irene Parada

H-Index: 4

Efficient segment folding is hard

Computational Geometry

2022/6/1

On the maximum number of crossings in star-simple drawings of Kn with no empty lens

Journal of Graph Algorithms and Applications

2022

Blocking Delaunay Triangulations from the Exterior

arXiv preprint arXiv:2210.12015

2022/10/21

How to fit a tree in a box

Graphs and Combinatorics

2022/10

Maarten Löffler
Maarten Löffler

H-Index: 16

Irene Parada
Irene Parada

H-Index: 4

Dynamic Embeddings of Dynamic Single-Source Upward Planar Graphs

arXiv preprint arXiv:2209.14094

2022/9/28

Shooting Stars in Simple Drawings of

2022/9/13

Irene Parada
Irene Parada

H-Index: 4

Crossing numbers of beyond-planar graphs revisited

Graph Drawing and Network Visualization: 29th International Symposium, GD 2021, Tübingen, Germany, September 14–17, 2021, Revised Selected Papers

2021/12/22

Irene Parada
Irene Parada

H-Index: 4

Compacting squares: Input-sensitive in-place reconfiguration of sliding squares

arXiv preprint arXiv:2105.07997

2021/5/17

Compacting squares

arXiv e-prints

2021/5

A new meta-module design for efficient reconfiguration of modular robots

Autonomous robots

2021/5

Irene Parada
Irene Parada

H-Index: 4

Vera Sacristán
Vera Sacristán

H-Index: 13

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

Algorithmica

2021/5

See List of Professors in Irene Parada University(Technische Universiteit Eindhoven)