Author of the publication

Almost Spanning Subgraphs of Random Graphs After Adversarial Edge Removal.

, , and . Comb. Probab. Comput., 22 (5): 639-683 (2013)

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

Almost Spanning Subgraphs of Random Graphs After Adversarial Edge Removal., , and . Comb. Probab. Comput., 22 (5): 639-683 (2013)Querying priced information in databases: The conjunctive case., , , , , , , and . ACM Trans. Algorithms, 3 (1): 9:1-9:22 (2007)Near-perfect clique-factors in sparse pseudorandom graphs., , and . Electron. Notes Discret. Math., (2018)A note on the Size-Ramsey number of long subdivisions of graphs., , and . RAIRO Theor. Informatics Appl., 39 (1): 191-206 (2005)Threshold functions for asymmetric Ramsey properties involving cycles., and . Random Struct. Algorithms, 11 (3): 245-276 (1997)An Extension of the Erdös-Stone Theorem., and . Combinatorica, 14 (3): 279-286 (1994)A note on induced cycles in Kneser graphs.. Combinatorica, 11 (3): 245-251 (1991)Searching in Random Partially Ordered Sets., , , and . LATIN, volume 2286 of Lecture Notes in Computer Science, page 278-292. Springer, (2002)Special Issue on Ramsey Theory., , , , and . Comb. Probab. Comput., 12 (5-6): 467-468 (2003)Measures of Pseudorandomness for Finite Sequences: Minimal Values., , , , and . Comb. Probab. Comput., 15 (1-2): 1-29 (2006)