3 papers
math.CO2025
The unavoidable drawings of complete multipartite graphs
Jozsef Balogh, Irene Parada, Gelasio Salazar
In a simple drawing of a graph every pair of edges intersect each other in at most one point, which is either a common endvertex or a proper crossing. For each positive integer …
cs.CG2024
The Complexity of Geodesic Spanners using Steiner Points
Sarita de Berg, Tim Ophelders, Irene Parada +2
A geometric -spanner on a set of point sites in a metric space is a subgraph of the complete graph on such that for every pair of sites the d…
cs.CG2023
Optimal In-Place Compaction of Sliding Cubes
Irina Kostitsyna, Tim Ophelders, Irene Parada +3
The sliding cubes model is a well-established theoretical framework that supports the analysis of reconfiguration algorithms for modular robots consisting of face-connected cubes.…