On the Graph-Density of Random 0/1-Polytopes. - Volker Kaibel; Anja Remshagen (RANDOM-APPROX, 2003)

Learning in a Compiler for MINSAT Algorithms. - Anja Remshagen; Klaus Truemper (Theory Pract. Log. Program., 2003)

An Effective QBF Solver for Planning Problems. - Charles Otwell; Anja Remshagen; Klaus Truemper (MSV/AMCS, 2004)

Local search for quantified Boolean formulas. - N. Hristov; Anja Remshagen (ACM Southeast Regional Conference (1), 2005)

An Effective Algorithm for the Futile Questioning Problem. - Anja Remshagen; Klaus Truemper (J. Autom. Reason., 2005)

A SAT-based solver for Q-ALL SAT. - Ben Browning; Anja Remshagen (ACM Southeast Regional Conference, 2006)

The Complexity of Futile Questioning. - Anja Remshagen; Klaus Truemper (FCS, 2007)

An Alternative Representation for QBF. - Anja Remshagen; Klaus Truemper (IC-AI, 2009)

Making discrete mathematics relevant. - Anja Remshagen (ACM Southeast Regional Conference, 2010)

An upper bound for the circuit complexity of existentially quantified Boolean formulas. - Hans Kleine Büning; Anja Remshagen (Theor. Comput. Sci., 2010)

Consistency checking in privacy-aware access control. - Anja Remshagen (ACM Southeast Regional Conference, 2013)

Contextualized learning tools: animations and robots. - Anja Remshagen; Christine Rolka (ACM Southeast Regional Conference, 2014)

Consistency checking in access control. - Anja Remshagen; Li Yang (CODASPY, 2014)