Andreas Darmann

1. On planar variants of the monotone satisfiability problem with bounded\n variable appearances
   2016/04/19 by Andreas Darmann, Darmann, Andreas, Janosch Döcker +3 · 1 citation
   Computer Science · Engineering · #Computational Complexity (cs.CC) #Computational Geometry and Mesh Generation #FOS: Computer and information sciences #Optimization and Packing Problems #Vehicle Routing Optimization Methods
2. On simplified NP-complete variants of Not-All-Equal 3-Sat and 3-Sat
   2019/08/12 by Andreas Darmann, Darmann, Andreas, Janosch Döcker +1 · 3 citations
   Computer Science · #Formal Methods in Verification #Complexity and Algorithms in Graphs #Logic, Reasoning, and Knowledge