The former and current scientists of the department include György Elekes, András Frank, József Beck, Éva Tardos, András Hajnal, Lajos Pósa, Miklós Simonovits, Tamás Szőnyi.
•
Lovász, M.D. Plummer: Matching Theory, Akadémiai Kiadó - North Holland, Budapest, 1986
László Moholy-Nagy | László Sólyom | László Nieberl | László Lovász | László Békesi | Alexander Laszlo | László Tökés | László Markovits | Laszlo Bellak | Ken Laszlo | Tony László | Philip de László | Lenstra–Lenstra–Lovász lattice basis reduction algorithm | László Z. Bitó | László Vigh | Laszlo Toth | László Szőgyény-Marich, Sr. | László Szőgyény-Marich, Jr. | László Széchenyi | László Surján | László Somfai | László Lukács | László Kubala | László Horváth | Laszlo Halasz | László Foltán, Sr. | László Foltán, Jr. | Laszlo B. Kish | László Bíró | László Bélády |
Around 1980, Korte and Lovász introduced the greedoid to further generalize this characterization of greedy algorithms; hence the name greedoid.
he studied a weighted version of the set cover problem, and proved that a greedy algorithm provides good approximations to the optimal solution, generalizing previous unweighted results by David S. Johnson (J. Comp. Sys. Sci. 1974) and László Lovász (Discrete Math. 1975).
He graduated from the Fazekas Highschool where he was a classmate of László Lovász, Miklós Laczkovich, and Lajos Pósa.