PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Frank, András"

Author of the publication

copydeleteadd this publication to your clipboard
Covering symmetric supermodular functions by graphs.

, and . Math. Program., 84 (3): 483-503 (1999)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Univ. -Prof. Dr. -Ing. Dr. Andras Bardossy University of Stuttgart

Juhan Frank

Dr. rer. nat. Bettina Frank University of Stuttgart

Lukas Frank University of Stuttgart

Daniel Frank University of Stuttgart

 

Other publications of authors with the same name

On sparse subgraphs preserving connectivity properties., , and . Journal of Graph Theory, 17 (3): 275-281 (1993)Finding Minimum Generators of Path Systems'.. J. Comb. Theory, Ser. B, 75 (2): 237-244 (1999)Edge-disjoint paths in planar graphs.. J. Comb. Theory, Ser. B, 39 (2): 164-178 (1985)On chain and antichain families of a partially ordered set.. J. Comb. Theory, Ser. B, 29 (2): 176-184 (1980)Edge-disjoint circuits in graphs on the torus., and . J. Comb. Theory, Ser. B, 55 (1): 9-17 (1992)Preserving and Increasing Local Edge-Connectivity in Mixed Graphs., , and . SIAM J. Discrete Math., 8 (2): 155-178 (1995)Rooted k-connections in digraphs.. Discrete Applied Mathematics, 157 (6): 1242-1254 (2009)On decomposing a hypergraph into k connected sub-hypergraphs., , and . Discrete Applied Mathematics, 131 (2): 373-383 (2003)Augmenting Graphs to Meet Edge-Connectivity Requirements.. SIAM J. Discrete Math., 5 (1): 25-53 (1992)On Integer Multiflow Maximization., , and . SIAM J. Discrete Math., 10 (1): 158-170 (1997)