ProfessorsProfessors of Eötvös Loránd TudományegyetemAndrás Frank

András Frank

Eötvös Loránd Tudományegyetem

H-index: 42

Europe-Hungary

About András Frank

András Frank, With an exceptional h-index of 42 and a recent h-index of 16 (since 2020), a distinguished researcher at Eötvös Loránd Tudományegyetem, specializes in the field of discrete optimization, combinatorial optimization, polynomial algorithms, min-max theorems, matroid theory.

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

A network flow approach to a common generalization of Clar and Fries numbers

Decreasing minimization on M-convex sets: background and structures

Fair integral submodular flows

Fair integral network flows

Decreasing minimization on base-polyhedra: relation between discrete and continuous cases

A discrete convex min-max formula for box-TDI polyhedra

Decreasing minimization on M-convex sets: algorithms and applications

A simple algorithm and min–max formula for the inverse arborescence problem

András Frank Information

University	Eötvös Loránd Tudományegyetem
Position	Professor of Mathematics
Citations(all)	6448
Citations(since 2020)	1125
Cited By	5763
hIndex(all)	42
hIndex(since 2020)	16
i10Index(all)	82
i10Index(since 2020)	34
Email	Access Email
University Profile Page	Eötvös Loránd Tudományegyetem
Google Scholar	View Google Scholar Profile

András Frank Skills & Research Interests

discrete optimization

combinatorial optimization

polynomial algorithms

min-max theorems

matroid theory

Top articles of András Frank

Title	Journal	Author(s)	Publication Date
A network flow approach to a common generalization of Clar and Fries numbers	arXiv preprint arXiv:2307.03285	Erika Bérczi-Kovács András Frank	2023/7/6
Decreasing minimization on M-convex sets: background and structures	Mathematical Programming	András Frank Kazuo Murota	2022
Fair integral submodular flows	Discrete Applied Mathematics	András Frank Kazuo Murota	2022/10/30
Fair integral network flows	Mathematics of Operations Research (online)	András Frank Kazuo Murota	2022/9/23
Decreasing minimization on base-polyhedra: relation between discrete and continuous cases	Japan Journal of Industrial and Applied Mathematics	András Frank Kazuo Murota	2022/5
A discrete convex min-max formula for box-TDI polyhedra	Mathematics of Operations Research	András Frank Kazuo Murota	2022/5
Decreasing minimization on M-convex sets: algorithms and applications	Mathematical Programming	A. Frank K. Murota	2022
A simple algorithm and min–max formula for the inverse arborescence problem	Discrete Applied Mathematics	András Frank Gergely Hajdu	2021/5/31