PEPPA: a project for evolutionary predator prey algorithms. - Hendrik Blom; Christiane Küch; Katja Losemann; Chris Schwiegelshohn (GECCO (Companion), 2009)

Descriptional Complexity of Deterministic Regular Expressions. - Katja Losemann; Wim Martens; Matthias Niewerth (MFCS, 2012)

The complexity of evaluating path expressions in SPARQL. - Katja Losemann; Wim Martens (PODS, 2012)

Foundations of regular expressions in XML schema languages and SPARQL. - Katja Losemann (SIGMOD/PODS PhD Symposium, 2012)

The complexity of regular expressions and property paths in SPARQL. - Katja Losemann; Wim Martens (ACM Trans. Database Syst., 2013)

MSO queries on trees: enumerating answers under updates. - Katja Losemann; Wim Martens (CSL-LICS, 2014)

Foundations of Regular Languages for Processing RDF and XML. - Katja Losemann (2015)

Closure properties and descriptional complexity of deterministic regular expressions. - Katja Losemann; Wim Martens; Matthias Niewerth (Theor. Comput. Sci., 2016)

Deciding definability by deterministic regular expressions. - Wojciech Czerwinski; Claire David; Katja Losemann; Wim Martens (J. Comput. Syst. Sci., 2017)