András Frank

Cited by

	All	Since 2019
Citations	6649	1321
h-index	43	17
i10-index	83	38

320

160

240

198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202439 43 36 44 44 52 49 61 78 73 110 99 140 118 142 157 125 124 168 159 173 202 228 258 268 282 220 256 222 182 204 175 180 305 187 179 204 244 243 259

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
László SzegőAssociate Professor of Operations ResearchVerified email at uni-corvinus.hu
Zoltán KirályELTE Eötvös Loránd UniversityVerified email at cs.elte.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
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
Bill JacksonQueen Mary, University of LondonVerified email at qmul.ac.uk
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	462	1992
An application of simultaneous diophantine approximation in combinatorial optimization A Frank, É Tardos Combinatorica 7, 49-65, 1987	413	1987
Connections in combinatorial optimization A Frank Oxford University Press, 2011	389	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	218	1988
A weighted matroid intersection algorithm A Frank Journal of Algorithms 2 (4), 328-336, 1981	200	1981
An algorithm for submodular functions on graphs A Frank Bonn Workshop on Combinatorial Optimization (Bonn, 1980) 16, 97-120, 1982	196	1982
Connectivity augmentation problems in network design A Frank Univ. of Michigan, Ann Arbor, MI (United States), 1994	186	1994
On Kuhn's Hungarian method—a tribute from Hungary A Frank Naval Research Logistics (NRL) 52 (1), 2-5, 2005	184	2005
Minimal edge-coverings of pairs of sets A Frank, T Jordán Journal of Combinatorial Theory, Series B 65 (1), 73-110, 1995	184	1995
Some polynomial algorithms for certain graphs and hypergraphs A Frank	176	1976
An application of submodular flows A Frank, É Tardos Linear algebra and its applications 114, 329-348, 1989	173	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	139	2003
On chain and antichain families of a partially ordered set A Frank Journal of Combinatorial Theory, Series B 29 (2), 176-184, 1980	136	1980
Connectivity and network flows A Frank Handbook of combinatorics 1, 111-177, 1995	134	1995
How to orient the edges of a graph? A Frank, A Gyárfás Combinatorics, 353-364, 1978	133	1978
Disjoint paths in a rectilinear grid A Frank Combinatorica 2 (4), 361-371, 1982	127	1982
On the orientation of graphs A Frank Journal of Combinatorial Theory, Series B 28 (3), 251-261, 1980	125	1980
Edge-disjoint paths in planar graphs A Frank Journal of Combinatorial Theory, Series B 39 (2), 164-178, 1985	119	1985
Kernel systems of directed graphs A Frank Acta Sci. Math.(Szeged) 41 (1-2), 63-76, 1979	114	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