( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Packing tight Hamilton cycles in 3-uniform hypergraphs.

, , и . SODA, стр. 913-932. SIAM, (2011)

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.

Safwat Alani

Maia Alandjiyska

Yilmaz Alan

Viola Alanku

Bertold Aland

 

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

Probabilistic Analysis of the Generalised Assignment Problem., и . IPCO, стр. 189-200. University of Waterloo Press, (1990)Spanning Maximal Planar Subgraphs of Random Graphs., и . Random Struct. Algorithms, 2 (2): 225-232 (1991)Design and Analysis of Randomized and Approximation Algorithms (Dagstuhl Seminar 11241)., , , и . Dagstuhl Reports, 1 (6): 24-53 (2011)The cover time of two classes of random graphs., и . SODA, стр. 961-970. SIAM, (2005)Edge-disjoint paths in expander graphs.. SODA, стр. 717-725. ACM/SIAM, (2000)The probabilistic relationship between the assignment and asymmetric traveling salesman problems., и . SODA, стр. 652-660. ACM/SIAM, (2001)Random Walks on Random Graphs., и . NanoNet, том 3 из Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, стр. 95-106. Springer, (2008)Min-Wise Independent Permutations, , , и . Journal of Computer and System Sciences, 60 (3): 630--659 (2000)Separating subadditive euclidean functionals., и . STOC, стр. 22-35. ACM, (2016)Logconcave random graphs., , и . STOC, стр. 779-788. ACM, (2008)