The following pages link to (Q5226839):
Displaying 7 items.
- Positive planar satisfiability problems under 3-connectivity constraints (Q2143145) (← links)
- On simplified NP-complete variants of \textsc{Monotone} 3\textsc{-Sat} (Q2223685) (← links)
- Twenty years of progress of \(\mathrm{JCDCG}^3\) (Q2308489) (← links)
- Colourful components in \(k\)-caterpillars and planar graphs (Q2664941) (← links)
- 3-Valued Circuit SAT for STE with Automatic Refinement (Q3510816) (← links)
- Planar 3-SAT with a clause/variable cycle (Q5116495) (← links)
- The Complexity of Drawing Graphs on Few Lines and Few Planes (Q6075709) (← links)