6 citations · 10 across the 12 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
math.GT2017★ 2 cited
Embeddability in is NP-hard
Arnaud de Mesmay, Yo'av Rieck, Eric Sedgwick +1
We prove that the problem of deciding whether a 2- or 3-dimensional simplicial complex embeds into is NP-hard. Our construction also shows that deciding whether a 3-…
math.DG2017
Constructing monotone homotopies and sweepouts
Erin Wolf Chambers, Gregory R. Chambers, Arnaud de Mesmay +2
This article investigates when homotopies can be converted to monotone homotopies without increasing the lengths of curves. A monotone homotopy is one which consists of curves whic…