Marilena Leichter

According to our database, Marilena Leichter authored at least 5 papers between 2018 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2022

On the impossibility of decomposing binary matroids.

Marilena Leichter, Benjamin Moseley, Kirk Pruhs

Oper. Res. Lett., 2022

Minimum Hitting Set of Interval Bundles Problem: Computational Complexity and Approximability.

Marinus Gottschau, Marilena Leichter

Algorithmica, 2022

2021

A stronger impossibility for fully online matching.

Alexander Eckl, Anja Kirschbaum, Marilena Leichter, Kevin Schewior

Oper. Res. Lett., 2021

An Efficient Reduction of a Gammoid to a Partition Matroid.

Marilena Leichter, Benjamin Moseley, Kirk Pruhs

Proceedings of the 29th Annual European Symposium on Algorithms, 2021

2018

Locally searching for large induced matchings.

Maximilian Fürst, Marilena Leichter, Dieter Rautenbach

Theor. Comput. Sci., 2018