Author of the publication

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

Efficient communication in an ad-hoc network., , and . J. Algorithms, 52 (1): 1-7 (2004)On the Best Case of Heapsort., , and . J. Algorithms, 20 (2): 205-217 (1996)An Analysis of Random-Walk Cuckoo Hashing., , and . SIAM J. Comput., 40 (2): 291-308 (2011)Shortest path algorithms for knapsack type problems.. Math. Program., 11 (1): 150-157 (1976)A new rounding procedure for the assignment problem with applications to dense graph arrangement problems., , and . Math. Program., 92 (1): 1-36 (2002)Hypergraphs with independent neighborhoods., , , and . Combinatorica, 30 (3): 277-293 (2010)Random Minimum Length Spanning Trees in Regular Graphs., , and . Combinatorica, 18 (3): 311-333 (1998)Hamilton cycles in 3-out., and . Random Struct. Algorithms, 35 (4): 393-417 (2009)Counting the Number of Hamilton Cycles in Random Digraphs., and . Random Struct. Algorithms, 3 (3): 235-242 (1992)Almost universal graphs., and . Random Struct. Algorithms, 28 (4): 499-510 (2006)