Follow
András Frank
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
4561992
An application of simultaneous diophantine approximation in combinatorial optimization
A Frank, É Tardos
Combinatorica 7, 49-65, 1987
3971987
Connections in combinatorial optimization
A Frank
Oxford University Press, 2011
3622011
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
2131988
A weighted matroid intersection algorithm
A Frank
Journal of Algorithms 2 (4), 328-336, 1981
1941981
An algorithm for submodular functions on graphs
A Frank
Bonn Workshop on Combinatorial Optimization (Bonn, 1980) 16, 97-120, 1982
1921982
Minimal edge-coverings of pairs of sets
A Frank, T Jordán
Journal of Combinatorial Theory, Series B 65 (1), 73-110, 1995
1841995
On Kuhn's Hungarian method—a tribute from Hungary
A Frank
Naval Research Logistics (NRL) 52 (1), 2-5, 2005
1812005
Connectivity augmentation problems in network design
A Frank
Univ. of Michigan, Ann Arbor, MI (United States), 1994
1781994
Some polynomial algorithms for certain graphs and hypergraphs
A Frank
1741976
An application of submodular flows
A Frank, É Tardos
Linear algebra and its applications 114, 329-348, 1989
1691989
On decomposing a hypergraph into k connected sub-hypergraphs
A Frank, T Király, M Kriesell
Discrete Applied Mathematics 131 (2), 373-383, 2003
1352003
Connectivity and network flows
A Frank
Handbook of combinatorics 1, 111-177, 1995
1341995
On chain and antichain families of a partially ordered set
A Frank
Journal of Combinatorial Theory, Series B 29 (2), 176-184, 1980
1291980
How to orient the edges of a graph?
A Frank, A Gyárfás
Combinatorics, 353-364, 1978
1261978
Disjoint paths in a rectilinear grid
A Frank
Combinatorica 2 (4), 361-371, 1982
1251982
On the orientation of graphs
A Frank
Journal of Combinatorial Theory, Series B 28 (3), 251-261, 1980
1241980
Edge-disjoint paths in planar graphs
A Frank
Journal of Combinatorial Theory, Series B 39 (2), 164-178, 1985
1161985
Kernel systems of directed graphs
A Frank
1151979
The system can't perform the operation now. Try again later.
Articles 1–20