From post

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.

 

Другие публикации лиц с тем же именем

Hamilton cycles in 3-out., и . Random Struct. Algorithms, 35 (4): 393-417 (2009)Counting the Number of Hamilton Cycles in Random Digraphs., и . Random Struct. Algorithms, 3 (3): 235-242 (1992)The game chromatic number of random graphs., , и . Random Struct. Algorithms, 32 (2): 223-235 (2008)Almost universal graphs., и . Random Struct. Algorithms, 28 (4): 499-510 (2006)Randomized Greedy Matching II., , , и . Random Struct. Algorithms, 6 (1): 55-74 (1995)Coloring H-free hypergraphs., , и . Random Struct. Algorithms, 36 (1): 11-25 (2010)Efficient communication in an ad-hoc network., , и . J. Algorithms, 52 (1): 1-7 (2004)On the Best Case of Heapsort., , и . J. Algorithms, 20 (2): 205-217 (1996)A new rounding procedure for the assignment problem with applications to dense graph arrangement problems., , и . Math. Program., 92 (1): 1-36 (2002)Shortest path algorithms for knapsack type problems.. Math. Program., 11 (1): 150-157 (1976)