29 citations · 89 across the 22 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2017★ 1 cited
Planar 3-SAT with a Clause/Variable Cycle
Alexander Pilz
In the Planar 3-SAT problem, we are given a 3-SAT formula together with its incidence graph, which is planar, and are asked whether this formula is satisfiable. Since Lichtenstein'…
cs.CC2012
New results on stabbing segments with a polygon
José Miguel Díaz-Báñez, Matias Korman, Pablo Pérez-Lantero +3
We consider a natural variation of the concept of stabbing a segment by a simple polygon: a segment is stabbed by a simple polygon if at least one of its two endpoint…