András Frank

Cited by

	All	Since 2017
Citations	6107	1302
h-index	41	18
i10-index	81	39

300

150

225

198319841985198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202228 62 35 43 34 44 43 53 43 62 72 77 101 85 139 120 153 171 129 124 167 160 172 202 234 247 287 258 220 262 216 189 189 180 207 283 187 184 257 180

Public access

View all

6 articles

0 articles

available

not available

Based on funding mandates

Co-authors

Eva TardosProfessor of Computer Science, Cornell UniversityVerified email at cornell.edu
Tibor JordánProfessor of mathematics, Eötvös University, BudapestVerified email at math.elte.hu
Tamás KirályEötvös Loránd UniversityVerified email at cs.elte.hu
Kazuo MurotaThe Institute of Statistical Mathematics / Tokyo Metropolitan UniversityVerified email at tmu.ac.jp
Kristóf BércziMTA-ELTE Matroid Optimization Research Group, Dept. of Operations Research, Eötvös Loránd Univ.Verified email at ttk.elte.hu
Zoltán KirályEotvos 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
András BenczúrInstitute for Computer Science and ControlVerified email at sztaki.hu
Joergen Bang-Jensenprofessor of discrete optimization, University of Southern DenmarkVerified email at imada.sdu.dk
Takao NishizekiTohoku University (Emeritus Professor)Verified email at ecei.tohoku.ac.jp
Bill JacksonQueen Mary, University of LondonVerified email at qmul.ac.uk
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
Bruce ShepherdUniversity of British ColumbiaVerified email at cs.ubc.ca
Jacint SzaboEotvos UniversityVerified email at cs.elte.hu
Lap Chi LauUniversity of WaterlooVerified email at cs.uwaterloo.ca
László A. VéghDepartment of Mathematics, London School of Economics and Political ScienceVerified email at lse.ac.uk

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	448	1992
An application of simultaneous diophantine approximation in combinatorial optimization A Frank, É Tardos Combinatorica 7 (1), 49-65, 1987	341	1987
Connections in combinatorial optimization A Frank Oxford University Press, 2011	315	2011
Packing paths, circuits, and cuts-a survey A Frank Paths, flows, and VLSI-layout, 47-100, 1990	234*	1990
Generalized polymatroids and submodular flows A Frank, É Tardos Mathematical Programming 42 (1), 489-563, 1988	209	1988
An algorithm for submodular functions on graphs A Frank Bonn Workshop on Combinatorial Optimization (Bonn, 1980) 16, 97-120, 1982	181	1982
Minimal edge-coverings of pairs of sets A Frank, T Jordán Journal of Combinatorial Theory, Series B 65 (1), 73-110, 1995	179	1995
Connectivity augmentation problems in network design A Frank Univ. of Michigan, Ann Arbor, MI (United States), 1994	173	1994
A weighted matroid intersection algorithm A Frank Journal of Algorithms 2 (4), 328-336, 1981	172	1981
On Kuhn's Hungarian method—a tribute from Hungary A Frank Naval Research Logistics (NRL) 52 (1), 2-5, 2005	168	2005
Some polynomial algorithms for certain graphs and hypergraphs A Frank	166	1976
An application of submodular flows A Frank, É Tardos Linear algebra and its applications 114, 329-348, 1989	165	1989
On decomposing a hypergraph into k connected sub-hypergraphs A Frank, T Király, M Kriesell Discrete Applied Mathematics 131 (2), 373-383, 2003	129	2003
Connectivity and network flows A Frank Handbook of combinatorics 1, 111-177, 1995	127	1995
On chain and antichain families of a partially ordered set A Frank Journal of Combinatorial Theory, Series B 29 (2), 176-184, 1980	120	1980
Disjoint paths in a rectilinear grid A Frank Combinatorica 2 (4), 361-371, 1982	118	1982
On the orientation of graphs A Frank Journal of Combinatorial Theory, Series B 28 (3), 251-261, 1980	118	1980
Edge-disjoint paths in planar graphs A Frank Journal of Combinatorial Theory, Series B 39 (2), 164-178, 1985	115	1985
How to orient the edges of a graph? A Frank, A Gyárfás Combinatorics, 353-364, 1978	115	1978
Kernel systems of directed graphs A Frank Acta Sci. Math.(Szeged) 41 (1-2), 63-76, 1979	106	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