Andras Frank

Cited by

	All	Since 2015
Citations	5571	1252
h-index	41	18
i10-index	71	34

300

150

225

198119821983198419851986198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202014 21 24 68 37 39 28 41 42 50 45 55 77 88 114 92 127 119 149 156 135 118 169 162 154 194 196 249 275 272 194 259 216 187 187 162 200 289 181 233

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
Kristóf BércziMTA-ELTE Egerváry Research Group, Department of Operations Research, Eötvös Loránd UniversityVerified email at cs.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
Zoltán SzigetiLaboratoire G-SCOPVerified email at grenoble-inp.fr
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
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
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
László A. VéghDepartment of Mathematics, London School of Economics and Political ScienceVerified email at lse.ac.uk
Jacint SzaboEotvos UniversityVerified email at cs.elte.hu
Csaba Királyresearch fellow, MTA-ELTE Egerváry Research Group, ELTE Eötvös Loránd University BudapestVerified email at cs.elte.hu
Lap Chi LauUniversity of WaterlooVerified email at cs.uwaterloo.ca
Péter L. ErdősScientific Adviser, A. Renyi Institue of Mathematics, HASVerified email at renyi.mta.hu
Laszlo A. SzekelyUniversity of South CarolinaVerified email at math.sc.edu

Andras Frank

Professor of Mathematics, Eotvos University Budapest

Verified email at cs.elte.hu

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

Upload PDF

Follow this author

Cited by

Co-authors