Marilena Leichter

About Marilena Leichter

Marilena Leichter, With an exceptional h-index of 3 and a recent h-index of 3 (since 2020), a distinguished researcher at Technische Universität München, specializes in the field of Algorithms, Operations Research, Discrete Optimization.

His recent articles reflect a diverse array of research interests and contributions to the field:

On the impossibility of decomposing binary matroids

Minimum hitting set of interval bundles problem: computational complexity and approximability

A Stronger Impossibility for Fully Online Matching

Combinatorial Algorithms for Covering and Scheduling Problems

An Efficient Reduction of a Gammoid to a Partition Matroid

Marilena Leichter Information

University

Position

___

Citations(all)

19

Citations(since 2020)

19

Cited By

4

hIndex(all)

3

hIndex(since 2020)

3

i10Index(all)

0

i10Index(since 2020)

0

Email

University Profile Page

Google Scholar

Marilena Leichter Skills & Research Interests

Algorithms

Operations Research

Discrete Optimization

Top articles of Marilena Leichter

On the impossibility of decomposing binary matroids

Operations Research Letters

2022/9/1

Minimum hitting set of interval bundles problem: computational complexity and approximability

Algorithmica

2022/8

Marinus Gottschau
Marinus Gottschau

H-Index: 2

Marilena Leichter
Marilena Leichter

H-Index: 1

A Stronger Impossibility for Fully Online Matching

Operations Research Letters

2021/9/1

Marilena Leichter
Marilena Leichter

H-Index: 1

Kevin Schewior
Kevin Schewior

H-Index: 9

Combinatorial Algorithms for Covering and Scheduling Problems

2021/3/30

Marilena Leichter
Marilena Leichter

H-Index: 1

An Efficient Reduction of a Gammoid to a Partition Matroid

29th Annual European Symposium on Algorithms (ESA 2021)

2021

See List of Professors in Marilena Leichter University(Technische Universität München)

Co-Authors

academic-engine