Oriol Solé-Pi

Available identifiers

Publication	Date of Publication	Type
Ortho-unit polygons can be guarded with at most $\left\lfloor \frac{n-4}{8} \right\rfloor$ guards	2025-01-13	Paper
Crossing and intersecting families of geometric graphs on point sets	2024-02-15	Paper
Separability, boxicity, and partial orders	2023-12-19	Paper
Covering and packing with homothets of limited capacity	2022-11-16	Paper
Pair crossing number, cutwidth, and good drawings on arbitrary point sets	2022-11-07	Paper
Ortho-unit polygons can be guarded with at most $\lfloor \frac{n-4}{8} \rfloor$ guards	2022-08-26	Paper
An algorithm for estimating the crossing number of dense graphs, and continuous analogs of the crossing and rectilinear crossing numbers	N/A	Paper

This page was built for person: Oriol Solé-Pi