Author of the publication

Efficient Removal Lemmas for Matrices.

, and . APPROX-RANDOM, volume 81 of LIPIcs, page 25:1-25:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)

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)The 123 Theorem and Its Extensions., and . J. Comb. Theory, Ser. A, 72 (2): 322-331 (1995)Regular Languages are Testable with a Constant Number of Queries, , , and . SIAM J. Comput., 30 (6): 1842-1862 (2000)Efficient Removal Lemmas for Matrices., and . Order, 37 (1): 83-101 (2020)On a Hypergraph Matching Problem., and . Graphs Comb., 21 (4): 377-384 (2005)Size and Degree Anti-Ramsey Numbers.. Graphs Comb., 31 (6): 1833-1839 (2015)Traces of hypergraphs., , and . J. Lond. Math. Soc., 100 (2): 498-517 (2019)A general approach to online network optimization problems., , , , and . ACM Trans. Algorithms, 2 (4): 640-660 (2006)Admission control to minimize rejections and online set cover with repetitions., , and . ACM Trans. Algorithms, 6 (1): 11:1-11:13 (2009)