results  search [or]   1 hits 
ISNI: 
0000 0001 1622 4891 
Name: 
András Frank
András Frank (Hongaars wiskundige)
András Frank (Mathematician, combinatorialist)
András Frank (ungarischer Mathematiker)
Frank
Frank, A.
Frank, András

Dates: 
1949 
Creation class: 
article
cre
Language material
Text

Creation role: 
author
contributor

Related names: 
BangJensen, Jørgen (1960)
Cunningham, William H.
Eötvös Loránd Tudományegyetem (Budapest) Affiliation (see also from)
Fleischner, Herbert
Ibaraki, Toshihide
Jackson, Bill
Jordán, Tibor
Miklós, Zoltán
Nagamochi, Hiroshi
Szigeti, Zoltán
Tardos, Éva (1957)
University of Waterloo. Faculty of Mathematics

Titles: 
Applications of submodular functions
Augmenting graphs to meet edge connectivity requirements
Connections in combinatorial optimization, 2011:
Conservative weightings and eardecompositions of graphs
Disjoint paths in a rectilinear grid
EDGE connection of graphs, digraphs and hypergraphs
Finding feasible vectors of EdmondsGiles 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
primal dual algorithm for submodular flows, A
Restricted hmatchings in bipartite graphs
Sinkstable sets of digraphs
Submodular functions in graph theory
Tree representation of directed circuits

Contributed to or performed: 
DISCRETE MATHEMATICS 
Notes: 

Sources: 
BOWKER
TEL
ZETO
