Author of the publication

A Characterization of Easily Testable Induced Subgraphs.

, and . Comb. Probab. Comput., 15 (6): 791-805 (2006)

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

Approximate Hypergraph Coloring., , , and . Nord. J. Comput., 3 (4): 425-439 (1996)Disjoint Directed Cycles.. J. Comb. Theory, Ser. B, 68 (2): 167-178 (1996)Regular Languages are Testable with a Constant Number of Queries, , , and . SIAM J. Comput., 30 (6): 1842-1862 (2000)The Number of Spanning Trees in Regular Graphs.. Random Struct. Algorithms, 1 (2): 175-182 (1990)Degrees and choice numbers.. Random Struct. Algorithms, 16 (4): 364-368 (2000)Admission Control to Minimize Rejections and Online Set Cover with Repetitions, , and . CoRR, (2008)Spanning directed trees with many leaves, , , , and . CoRR, (2008)On the duplication distance of binary strings., , , and . ISIT, page 260-264. IEEE, (2016)On the Exponent of the All Pairs Shortest Path Problem, , and . FOCS, page 569-575. IEEE Computer Society, (1991)Source coding and graph entropies., and . IEEE Trans. Inf. Theory, 42 (5): 1329-1339 (1996)