András Frank

Q: What Schools Are Affiliated With András Frank

András Frank is affiliated with the following schools: University of Szeged, Eötvös Loránd University

András Frank's AcademicInfluence.com Rankings

András Frank

Mathematics

#870

World Rank

#1538

Historical Rank

Combinatorics

#25

World Rank

#29

Historical Rank

Graph Theory

#34

World Rank

#41

Historical Rank

Operations Research

#70

World Rank

#72

Historical Rank

mathematics Degrees

Download Badge

Mathematics

András Frank's Degrees

PhD Mathematics Eötvös Loránd University

Why Is András Frank Influential?

(Suggest an Edit or Addition)

According to Wikipedia, András Frank is a Hungarian mathematician, working in combinatorics, especially in graph theory, and combinatorial optimisation. He is director of the Institute of Mathematics of the Faculty of Sciences of the Eötvös Loránd University, Budapest.

(See a Problem?)

András Frank's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Augmenting graphs to meet edge-connectivity requirements (1990) (331)
An application of simultaneous diophantine approximation in combinatorial optimization (1987) (295)
Connections in Combinatorial Optimization (2011) (249)
Generalized polymatroids and submodular flows (1988) (164)
An Algorithm for Submodular Functions on Graphs (1982) (150)
Minimal Edge-Coverings of Pairs of Sets (1995) (143)
A Weighted Matroid Intersection Algorithm (1981) (143)
On Kuhn's Hungarian Method—A tribute from Hungary (2005) (141)
An application of submodular flows (1989) (124)
On decomposing a hypergraph into k connected sub-hypergraphs (2003) (113)
On chain and antichain families of a partially ordered set (1980) (105)
Connectivity and network flows (1996) (96)
Disjoint paths in a rectilinear grid (1982) (85)
Preserving and Increasing Local Edge-Connectivity in Mixed Graphs (1995) (77)
Algorithms for Routing around a Rectangle (1992) (73)
On the orientation of graphs and hypergraphs (2003) (68)
A Primal-Dual Algorithm for Submodular Flows (1985) (67)
On a theorem of Mader (1992) (63)
How to make a digraph strongly connected (1981) (63)
Rooted k-connections in digraphs (2009) (62)
Finding feasible vectors of Edmonds-Giles polyhedra (1984) (58)
Conservative weightings and ear-decompositions of graphs (1990) (58)
Increasing the rooted-connectivity of a digraph by one (1999) (57)
Applications of submodular functions (1993) (50)
Edge-disjoint paths in planar graphs (1985) (49)
On sparse subgraphs preserving connectivity properties (1993) (48)
On Connectivity Properties of Eulerian Digraphs (1988) (46)
Submodular functions in graph theory (1993) (45)
On the orientation of graphs (1980) (39)
Constructive characterizations for packing and covering with trees (2003) (39)
On Integer Multiflow Maximization (1997) (38)
Covering directed and odd cuts (1984) (37)
An algorithm for source location in directed graphs (2005) (34)
Note on the path-matching formula (2002) (32)
Variations for Lovász’ Submodular Ideas (2008) (29)
Edge-Connection of Graphs, Digraphs, and Hypergraphs (2006) (29)
A Survey on Covering Supermodular Functions (2009) (27)
Covering symmetric supermodular functions by graphs (1999) (27)
Graph Orientations with Edge-connection and Parity Constraints (2002) (25)
Packing Arborescences (2009) (23)
An Orientation Theorem with Parity Conditions (1999) (22)
Combined connectivity augmentation and orientation problems (2001) (22)
Directed vertex-connectivity augmentation (1999) (21)
A quick proof for the cactus representation of mincuts (2009) (21)
Restricted t-matchings in bipartite graphs (2003) (20)
An application of simultaneous approximation in combinatorial optimization (1985) (20)
MATROIDS FROM CROSSING FAMILIES (1984) (17)
A Survey On T-joins, T-cuts, and conservative weightings (1996) (17)
Discrete Decreasing Minimization, Part II: Views from Discrete Convex Analysis (2018) (16)
An algorithm to increase the node-connectivity of a digraph by one (2008) (14)
Finding Minimum Generators of Path Systems' (1999) (14)
Characterizing and recognizing generalized polymatroids (2014) (14)
Discrete Decreasing Minimization, Part I: Base-polyhedra with Applications in Network Optimization (2018) (13)
On circuit decomposition of planar Eulerian graphs (1990) (12)
A note on packing paths in planar graphs (1995) (12)
Socially intelligent virtual petz (1997) (12)
On Packing T-Cuts (1994) (11)
Simple push-relabel algorithms for matroids and submodular flows (2012) (10)
A note on degree-constrained subgraphs (2008) (10)
Node-Capacitated Ring Routing (2002) (9)
Supermodularity in Unweighted Graph Optimization I: Branchings and Matchings (2016) (9)
An Extension of a Theorem of Henneberg and Laman (2001) (9)
Finding minimum weighted generators of a path system (1997) (9)
Edge-disjoint circuits in graphs on the torus (1992) (9)
A Discrete Convex Min-Max Formula for Box-TDI Polyhedra (2020) (8)
How to Make a Strongly Connected Digraph Two-Connected (1995) (8)
Connectivity augmentation of networks: structures and algorithms (1999) (8)
Decreasing minimization on M-convex sets: algorithms and applications (2020) (7)
An Algorithm for Node-Capacitated Ring Routing (2005) (7)
Supermodularity in Unweighted Graph Optimization II: Matroidal Term Rank Augmentation (2016) (7)
A note on k-strongly connected orientations of an undirected graph (1982) (7)
Graph Connectivity Augmentation (2015) (7)
Fair Integral Flows (2019) (6)
On a class of balanced hypergraphs (1977) (6)
Minimum Multiway Cuts in Trees (1998) (6)
Packing paths in planar graphs (1990) (6)
Supermodularity in Unweighted Graph Opitimization III: Highly-connected Digraphs (2016) (5)
A new branch and bound feature selection algorithm (2002) (5)
Discrete Decreasing Minimization, Part III: Network Flows (2019) (4)
Fair integral submodular flows (2020) (4)
Vertex-Disjoint Simple Paths of Given Homotopy in a Planar Graph (1990) (4)
Decreasing Minimization on M-convex Sets (2020) (4)
Bursting the bubbles. (2000) (3)
An Algorithm for the Unbounded Matroid Intersection Polyhedron (1984) (3)
A simple algorithm and min-max formula for the inverse arborescence problem (2021) (3)
Sink-Stable Sets of Digraphs (2012) (3)
A constrained independent set problem for matroids (2004) (3)
Packing Arborescences (Combinatorial Optimization and Discrete Algorithms) (2010) (2)
On Disjoint Homotopic Paths in the Plane (1990) (2)
Tree-compositions and orientations (2013) (2)
Fair Integral Network Flows (2019) (1)
On Multiflow Problems (1992) (1)
Combinatorial problems related to origin-destination matrices (2001) (1)
Independent arborescences in directed graphs (2013) (1)
Parity Constrained k-Edge-Connected Orientations (1999) (1)
Two Arc-Disjoint Paths in Eulerian Digraphs (1998) (1)
Decreasing minimization on base-polyhedra: relation between discrete and continuous cases (2022) (1)
Note on the path‐matching formula (2002) (1)
SUFFICIENT CONDITIONS FOR SOLVABILITY OF CHANNEL ROUTING PROBLEMS. (1984) (1)
Disjoint paths in the plane (1983) (0)
Two Arc Disjoint Paths in Eulerian Diagraphs (1995) (0)
Network Coding Algorithms and Applications (2015) (0)
Tree-representation of directed circuits (1991) (0)
Proceedings of the 10th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications (2017) (0)
A Characterization of a Family of Independent Arborescences in a Directed Graph with Convex Sets (2009) (0)
AN EFFICIENT COST SCALING ALGORITHM FOR THE INDEPENDENT ASSIGNMENT (2009) (0)
Characterizing and Recognizing Generalized Polymatroids András (2012) (0)
Rooted k-connections in digraphs András Frank November 2006 (2006) (0)
ALGORITHMS FOR EDGE-DISJOINT PATHS IN A RECTANGULAR GRID AND THEIR APPLICATIONS IN LAYOUT DESIGN. (1982) (0)
Simple push-relabel algorithms for matroids and submodular flows (2012) (0)
A New Spectral Test for Nonrandomness (1990) (0)
Non-TDI graph-optimization with supermodular functions ( extended abstract ) (2015) (0)
Report on the Hausdorff Trimester Program Combinatorial Optimization September 1 – December 18 , 2015 Organizers (2017) (0)
Edge-Connectivities of Graphs and Digraphs (2000) (0)
Tree-compositions and submodular flows András Frank ? and Csaba Király ? ? (2011) (0)
Notes and CommentsWelfare Rankings in the Presence of Contaminated Data (2002) (0)
Starmaker - the new story of stellar birth. (1996) (0)
C O ] 5 J ul 2 01 9 Discrete Decreasing Minimization , Part III : Network Flows (2019) (0)
6 A Survey on Covering Supermodular Functions (2008) (0)
Balanced list edge-colourings of bipartite graphs (2010) (0)
Characterizing and recognizing generalized polymatroids (2013) (0)

This paper list is powered by the following services:

Other Resources About András Frank

en.wikipedia.org

What Schools Are Affiliated With András Frank?

András Frank is affiliated with the following schools:

András Frank's Academic­Influence.com Rankings

András Frank's Degrees

Why Is András Frank Influential?

András Frank's Published Works

Published Works

Other Resources About András Frank

What Schools Are Affiliated With András Frank?

András Frank's AcademicInfluence.com Rankings