Frank, András, 1949-
Frank, András
Frank András (1949-) magyar matematikus, egyetemi tanár, az MTA levelező tagja
VIAF ID: 37515607 ( Personal )
Permalink: http://viaf.org/viaf/37515607
Preferred Forms
- 100 0 _ ‡a Frank András ‡c (1949-) magyar matematikus, egyetemi tanár, az MTA levelező tagja
- 100 1 _ ‡a Frank, Andras
-
- 100 1 _ ‡a Frank, András ‡d 1949-
-
- 100 1 _ ‡a Frank, András, ‡d 1949-
-
-
-
- 100 1 _ ‡a Frank, András ‡d 1949-
-
4xx's: Alternate Name Forms (17)
5xx's: Related Names (4)
- 551 _ _ ‡a Budapest ‡4 ortg ‡4 https://d-nb.info/standards/elementset/gnd#placeOfBirth
- 510 2 _ ‡a Eötvös Loránd Tudományegyetem ‡4 affi ‡4 https://d-nb.info/standards/elementset/gnd#affiliation ‡e Affiliation
- 510 2 _ ‡a Eötvös Loránd Tudományegyetem (Budapest)
- 510 2 _ ‡a University of Waterloo. Faculty of Mathematics
Works
Title | Sources |
---|---|
Applications of submodular functions | |
Augmenting graphs to meet edge connectivity requirements | |
Connections in combinatorial optimization, 2011: | |
Conservative weightings and ear-decompositions of graphs | |
Disjoint paths in a rectilinear grid | |
EDGE connection of graphs, digraphs and hypergraphs | |
Finding feasible vectors of Edmonds-Giles polyhedra | |
Generalized polymatroids and submodular flows | |
Graph connectivity and network flows | |
Matroids from crossing families | |
Minimal edge coverings of pairs of sets | |
On a theorem of Mader | |
On circuit decomposition of planar Eulerian graphs | |
On disjoint homotopic paths in the plane | |
On sparse subgraphs preserving connectivity properties | |
On the bipartite travelling salesman problem | |
On weighted matroid intersection algorithm. | |
orientation theorem with parity conditions | |
Packing paths, circuits and cuts a survey | |
Packing paths in planar graphs | |
Preserving and increasing local edge connectivity in mixed graphs | |
A primal dual algorithm for submodular flows | |
Restricted h-matchings in bipartite graphs | |
Sink-stable sets of digraphs | |
Tree representation of directed circuits |