( en | de | ru )

 

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.

András Fehér

András Bárdossy

András Frankó

András Ozsváth

András Csögör

 

Other publications of authors with the same name

An algorithm for node-capacitated ring routing., , and . Oper. Res. Lett., 35 (3): 385-391 (2007)Supermodularity in Unweighted Graph Optimization I: Branchings and Matchings., and . Math. Oper. Res., 43 (3): 726-753 (2018)On Integer Multiflow Maximization., , and . SIAM J. Discret. Math., 10 (1): 158-170 (1997)Preserving and Increasing Local Edge-Connectivity in Mixed Graphs., , and . SIAM J. Discret. Math., 8 (2): 155-178 (1995)Augmenting Graphs to Meet Edge-Connectivity Requirements.. SIAM J. Discret. Math., 5 (1): 25-53 (1992)On sparse subgraphs preserving connectivity properties., , and . J. Graph Theory, 17 (3): 275-281 (1993)An algorithm for source location in directed graphs., , and . Oper. Res. Lett., 33 (3): 221-230 (2005)Finding Minimum Generators of Path Systems'.. J. Comb. Theory, Ser. B, 75 (2): 237-244 (1999)On chain and antichain families of a partially ordered set.. J. Comb. Theory, Ser. B, 29 (2): 176-184 (1980)Edge-disjoint paths in planar graphs.. J. Comb. Theory, Ser. B, 39 (2): 164-178 (1985)