András Frank

Citado por

	Todos	Desde 2019
Citações	6509	1187
Índice h	43	16
Índice i10	83	36

320

160

240

198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202439 44 34 44 44 52 49 61 79 73 112 97 136 118 139 157 125 126 169 153 173 201 228 256 266 284 217 253 224 182 199 176 199 308 175 176 216 256 270 89

Acesso público

Ver todos

14 artigos

0 artigo

disponível

não disponível

Com base nas autorizações de financiamento

Coautores

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

Seguir

András Frank

Professor emeritus, Eötvös University Budapest

E-mail confirmado em cs.elte.hu

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


Título Ordenar por citações Ordenar por ano Ordenar por título	Citado por Citado por	Ano
Augmenting graphs to meet edge-connectivity requirements A Frank SIAM Journal on Discrete Mathematics 5 (1), 25-53, 1992	457	1992
An application of simultaneous diophantine approximation in combinatorial optimization A Frank, É Tardos Combinatorica 7, 49-65, 1987	398	1987
Connections in combinatorial optimization A Frank Oxford University Press, 2011	363	2011
Packing paths, circuits, and cuts-a survey A Frank Paths, flows, and VLSI-layout, 47-100, 1990	246*	1990
Generalized polymatroids and submodular flows A Frank, É Tardos Mathematical Programming 42 (1), 489-563, 1988	213	1988
A weighted matroid intersection algorithm A Frank Journal of Algorithms 2 (4), 328-336, 1981	196	1981
An algorithm for submodular functions on graphs A Frank Bonn Workshop on Combinatorial Optimization (Bonn, 1980) 16, 97-120, 1982	192	1982
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
Connectivity augmentation problems in network design A Frank Univ. of Michigan, Ann Arbor, MI (United States), 1994	179	1994
Some polynomial algorithms for certain graphs and hypergraphs A Frank	175	1976
An application of submodular flows A Frank, É Tardos Linear algebra and its applications 114, 329-348, 1989	170	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	135	2003
Connectivity and network flows A Frank Handbook of combinatorics 1, 111-177, 1995	134	1995
On chain and antichain families of a partially ordered set A Frank Journal of Combinatorial Theory, Series B 29 (2), 176-184, 1980	129	1980
How to orient the edges of a graph? A Frank, A Gyárfás Combinatorics, 353-364, 1978	127	1978
Disjoint paths in a rectilinear grid A Frank Combinatorica 2 (4), 361-371, 1982	125	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	117	1985
Kernel systems of directed graphs A Frank	115	1979

O sistema não pode executar a operação agora. Tente novamente mais tarde.

Artigos 1–20

Citações por ano

Citações duplicadas

Citações mescladas

Adicionar coautoresCoautores

Seguir

Citado por

Coautores