66 citations · 130 across the 32 of their papers we have counts for
40 papers
-arrangements of pseudolines and pseudocircles
Jan Kynčl, Carolina Medina, Gelasio Salazar
A -arrangement of pseudolines is a set of bi-infinite curves in the plane such that any two of them intersect each other in exactly points, at which they cross, and it is si…
Deciding if a shadow resolves into a given link: linear-time algorithms
Andrea Alba, Gelasio Salazar
A {\em shadow} (or {\em projection}) is obtained from a link diagram by ignoring the over/under information at each crossing. Given a fixed link we investigate the complexity o…
Deciding monotonicity of simple drawings of the complete graph
Oswin Aichholzer, Thomas Hackl, Alexander Pilz +2
A drawing of a graph is {\em -monotone} if every vertical line intersects each edge of the graph at most once. We present an time algorithm for deciding whether a simpl…
Regular projections of the link L6n1
Andrea Alba, Santino Ramirez, Gelasio Salazar
Given a link projection and a link , it is natural to ask whether it is possible that is a projection of . Taniyama answered this question for the cases in which …
Rotation systems and simple drawings in surfaces
Rosna Paul, Gelasio Salazar, Alexandra Weinberger
Every simple drawing of a graph in the plane naturally induces a rotation system, but it is easy to exhibit a rotation system that does not arise from a simple drawing in the plane…
Drawings of complete graphs in the projective plane
Alan Arroyo, Dan McQuillan, R. Bruce Richter +2
Hill's Conjecture states that the crossing number of the complete graph in the plane (equivalently, the sphere) is $\frac{1}{4}\lfloor\frac{n}{2}\rfloor\lflo…