2 papers
math.GT2026
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…
cs.CG2026
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…