Integrally indecomposable polytopes and the survivable network design problem. - Elke Eisenschmidt; Matthias Köppe (DRCN, 2007)

Computation of atomic fibers of Z-linear maps. - Elke Eisenschmidt; Raymond Hemmecke; Matthias Köppe (Contributions Discret. Math., 2011)

Bi-tone and k-tone decompositions of Boolean functions. - Utz-Uwe Haus; Elke Eisenschmidt (ISAIM, 2012)

Discovering all associations in discrete data using frequent minimally infrequent attribute sets. - Elke Eisenschmidt; Utz-Uwe Haus (Discret. Appl. Math., 2012)

A polynomial time approximation algorithm for the two-commodity splittable flow problem. - Elke Eisenschmidt; Utz-Uwe Haus (Math. Methods Oper. Res., 2013)