Oriol Andreu Solé-Pi

According to our database, Oriol Andreu Solé-Pi authored at least 10 papers between 2022 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

Pair Crossing Number, Cutwidth, and Good Drawings on Arbitrary Point Sets.

Oriol Andreu Solé-Pi

Discret. Comput. Geom., March, 2025

Ortho-Unit Polygons can be Guarded with at most $\left\lfloor \frac{n-4}{8} \right\rfloor $ Guards.

José Miguel Díaz-Báñez, Paul Horn, Mario Alberto López, Nestaly Marín, Adriana Ramírez-Vigueras, Oriol Andreu Solé-Pi, Alex Stevens, Jorge Urrutia

Graphs Comb., February, 2025

2024

Crossing and intersecting families of geometric graphs on point sets.

Jose Luis Álvarez-Rebollar, Jorge Cravioto-Lagos, Nestaly Marín, Oriol Andreu Solé-Pi, Jorge Urrutia

Graphs Comb., February, 2024

Approximating the Crossing Number of Dense Graphs (Poster Abstract).

Oriol Andreu Solé-Pi

Proceedings of the 32nd International Symposium on Graph Drawing and Network Visualization, 2024

2023

Separability, Boxicity, and Partial Orders.

José Miguel Díaz-Báñez, Paul Horn, Mario Alberto López, Nestaly Marín, Adriana Ramírez-Vigueras, Oriol Andreu Solé-Pi, Alex Stevens, Jorge Urrutia

Order, October, 2023

2022

Optimal placement of base stations in border surveillance using limited capacity drones.

Sergey Bereg, José Miguel Díaz-Báñez, Mohammadreza Haghpanah, Paul Horn, Mario Alberto López, Nestaly Marín, Adriana Ramírez-Vigueras, Fabio Rodríguez, Oriol Andreu Solé-Pi, Alex Stevens, Jorge Urrutia

Theor. Comput. Sci., 2022

Grid straight-line embeddings of trees with a minimum number of bends per path.

Vitor Tocci F. de Luca, Nestaly Marín, Fabiano de S. Oliveira, Adriana Ramírez-Vigueras, Oriol Andreu Solé-Pi, Jayme Luiz Szwarcfiter, Jorge Urrutia

Inf. Process. Lett., 2022

On Rainbow Quadrilaterals in Colored Point Sets.

A. Arévalo, R. Chávez-Jiménez, A. Hernández-Mora, R. López-López, Nestaly Marín, Adriana Ramírez-Vigueras, Oriol Andreu Solé-Pi, Jorge Urrutia

Graphs Comb., 2022

Covering and packing with homothets of limited capacity.

Oriol Andreu Solé-Pi

CoRR, 2022

Ortho-unit polygons can be guarded with at most ⌊(n-4)/8⌋ guards.

José Miguel Díaz-Báñez, Paul Horn, Mario Alberto López, Nestaly Marín, Adriana Ramírez-Vigueras, Oriol Andreu Solé-Pi, Alex Stevens, Jorge Urrutia

CoRR, 2022