These are problems I am interested in, but not strictly my own research.
If you find an answer to any of them, let me know!
Problems
Is there a constant factor approximation to longest path/cycle in
planar graphs?
Can all 2-quantifier equalities in Peano arithmetic be decided?
Universal-universal can (it's just polynomial identity testing), as can
universal-existential.