Author of the publication

A new rounding procedure for the assignment problem with applications to dense graph arrangement problems.

, , and . Math. Program., 92 (1): 1-36 (2002)

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.

 

Other publications of authors with the same name

Random graphs.. SODA, page 960. ACM Press, (2006)An efficient sparse regularity concept., , and . SODA, page 207-216. SIAM, (2009)The satisfiability threshold for randomly generated binary constraint satisfaction problems., and . Random Struct. Algorithms, 28 (3): 323-339 (2006)Rainbow matchings and Hamilton cycles in random graphs., and . Random Struct. Algorithms, 48 (3): 503-523 (2016)Finding maximum matchings in random regular graphs in linear expected time., and . Random Struct. Algorithms, 58 (3): 390-429 (2021)Traveling in randomly embedded random graphs., and . Random Struct. Algorithms, 55 (3): 649-676 (2019)Partitioning random graphs into large cycles.. Discret. Math., 70 (2): 149-158 (1988)Hamilton cycles in random subgraphs of pseudo-random graphs., and . Discret. Math., 256 (1-2): 137-150 (2002)On-line List Colouring of Random Graphs., , , and . Electron. J. Comb., 22 (2): 2 (2015)A Note on Log-Concave Random Graphs., and . Electron. J. Comb., 26 (3): 3 (2019)