András Frank

Cited by

	All	Since 2020
Citations	6763	1236
h-index	43	17
i10-index	83	38

320

160

240

198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202541 35 46 45 51 52 61 78 73 114 101 139 122 140 157 125 128 159 156 180 202 225 258 273 280 223 262 222 185 200 174 175 306 187 186 205 245 241 310 45

Public access

View all

15 articles

0 articles

available

not available

Based on funding mandates

Co-authors

Eva TardosProfessor of Computer Science, Cornell UniversityVerified email at cornell.edu
Tamás KirályEötvös Loránd UniversityVerified email at cs.elte.hu
Tibor JordánProfessor of mathematics, Eötvös University, BudapestVerified email at math.elte.hu
Kazuo MurotaThe Institute of Statistical Mathematics / Tokyo Metropolitan UniversityVerified email at tmu.ac.jp
Kristóf BércziMatroid Optimization Research Group, Department of Operations Research, Eötvös Loránd UniversityVerified email at ttk.elte.hu
Zoltán KirályELTE Eötvös Loránd UniversityVerified email at cs.elte.hu
László SzegőAssociate Professor of Operations ResearchVerified email at uni-corvinus.hu
András SebőDirecteur de Recherche, CNRS, Laboratoire G-SCOP, GrenobleVerified email at grenoble-inp.fr
Zoltán SzigetiLaboratoire G-SCOPVerified email at grenoble-inp.fr
Tamas FleinerProfessor of Mathematics, Budapest University of Technology and EconomicsVerified email at cs.bme.hu
Joergen Bang-Jensenprofessor of discrete optimization, University of Southern DenmarkVerified email at imada.sdu.dk
Bill JacksonQueen Mary, University of LondonVerified email at qmul.ac.uk
András BenczúrInstitute for Computer Science and ControlVerified email at sztaki.hu
Takao NishizekiTohoku University (Emeritus Professor)Verified email at ecei.tohoku.ac.jp
Andras GyarfasAlfred renyi institute of Mathematics, Hungarian Academy of SciencesVerified email at renyi.mta.hu
Alexander SchrijverUniversity of Amsterdam and CWIVerified email at cwi.nl
Jens VygenProfessor of Discrete Mathematics, University of BonnVerified email at or.uni-bonn.de
Jacint SzaboEotvos UniversityVerified email at cs.elte.hu
Lap Chi LauUniversity of WaterlooVerified email at cs.uwaterloo.ca
Bruce ShepherdUniversity of British ColumbiaVerified email at cs.ubc.ca

András Frank

Professor emeritus, Eötvös University Budapest

Verified email at cs.elte.hu

discrete optimization combinatorial optimization polynomial algorithms min-max theorems matroid theory


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Augmenting graphs to meet edge-connectivity requirements A Frank SIAM Journal on Discrete Mathematics 5 (1), 25-53, 1992	469	1992
An application of simultaneous diophantine approximation in combinatorial optimization A Frank, É Tardos Combinatorica 7, 49-65, 1987	430	1987
Connections in combinatorial optimization A Frank Oxford University Press, 2011	409	2011
Packing paths, circuits, and cuts-a survey A Frank Paths, flows, and VLSI-layout, 47-100, 1990	247*	1990
Generalized polymatroids and submodular flows A Frank, É Tardos Mathematical Programming 42 (1), 489-563, 1988	217	1988
A weighted matroid intersection algorithm A Frank Journal of Algorithms 2 (4), 328-336, 1981	202	1981
An algorithm for submodular functions on graphs A Frank Bonn Workshop on Combinatorial Optimization (Bonn, 1980) 16, 97-120, 1982	197	1982
Minimal edge-coverings of pairs of sets A Frank, T Jordán Journal of Combinatorial Theory, Series B 65 (1), 73-110, 1995	187	1995
Connectivity augmentation problems in network design A Frank Mathematical Programming: State of the Art 1994, 1994	185	1994
On Kuhn's Hungarian method—a tribute from Hungary A Frank Naval Research Logistics (NRL) 52 (1), 2-5, 2005	182	2005
An application of submodular flows A Frank, É Tardos Linear algebra and its applications 114, 329-348, 1989	174	1989
Some polynomial algorithms for certain graphs and hypergraphs A Frank	174	1976
On decomposing a hypergraph into k connected sub-hypergraphs A Frank, T Király, M Kriesell Discrete Applied Mathematics 131 (2), 373-383, 2003	146	2003
On chain and antichain families of a partially ordered set A Frank Journal of Combinatorial Theory, Series B 29 (2), 176-184, 1980	137	1980
How to orient the edges of a graph? A Frank, A Gyárfás Combinatorics, 353-364, 1978	135	1978
Connectivity and network flows A Frank Handbook of combinatorics 1, 111-177, 1995	134	1995
Disjoint paths in a rectilinear grid A Frank Combinatorica 2 (4), 361-371, 1982	127	1982
Edge-disjoint paths in planar graphs A Frank Journal of Combinatorial Theory, Series B 39 (2), 164-178, 1985	123	1985
On the orientation of graphs A Frank Journal of Combinatorial Theory, Series B 28 (3), 251-261, 1980	123	1980
Kernel systems of directed graphs A Frank Acta Sci. Math.(Szeged) 41 (1-2), 63-76, 1979	117	1979

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors