Locally searching for large induced matchings. - Maximilian Fürst; Marilena Leichter; Dieter Rautenbach (Theor. Comput. Sci., 2018)

An Efficient Reduction of a Gammoid to a Partition Matroid. - Marilena Leichter; Benjamin Moseley; Kirk Pruhs (ESA, 2021)

A stronger impossibility for fully online matching. - Alexander Eckl; Anja Kirschbaum; Marilena Leichter; Kevin Schewior (Oper. Res. Lett., 2021)

Minimum Hitting Set of Interval Bundles Problem: Computational Complexity and Approximability. - Marinus Gottschau; Marilena Leichter (Algorithmica, 2022)

On the impossibility of decomposing binary matroids. - Marilena Leichter; Benjamin Moseley; Kirk Pruhs (Oper. Res. Lett., 2022)