1 citations · 1 across the 1 of their papers we have counts for
2 papers
cs.CG2019★ 1 cited
A Proof of Levi's Extension Lemma
Marcus Schaefer
We give a short and self-contained proof of Levi's Extension Lemma for pseudoline arrangements.
cs.CG2019
Link Crossing Number is NP-hard
Arnaud de Mesmay, Marcus Schaefer, Eric Sedgwick
We show that determining the crossing number of a link is NP-hard. For some weaker notions of link equivalence, we also show NP-completeness.