Author of the publication

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

Even the Easiest(?) Graph Coloring Problem Is Not Easy in Streaming!, , , and . ITCS, volume 185 of LIPIcs, page 15:1-15:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Exploring the Gap between Tolerant and Non-tolerant Distribution Testing., , , , and . CoRR, (2021)Triangle Estimation Using Tripartite Independent Set Queries., , , and . ISAAC, volume 149 of LIPIcs, page 19:1-19:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Query Complexity of Global Minimum Cut., , , and . APPROX-RANDOM, volume 207 of LIPIcs, page 6:1-6:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Exploring the Gap Between Tolerant and Non-Tolerant Distribution Testing., , , , and . APPROX/RANDOM, volume 245 of LIPIcs, page 27:1-27:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)On Parallel k-Center Clustering., , and . SPAA, page 65-75. ACM, (2023)Faster Counting and Sampling Algorithms Using Colorful Decision Oracle., , , and . STACS, volume 219 of LIPIcs, page 10:1-10:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Existence of planar support for geometric hypergraphs using elementary techniques., , , , and . Discret. Math., 343 (6): 111853 (2020)Fast Parallel Degree+1 List Coloring., , , and . CoRR, (2023)Grid obstacle representation of graphs., , , , and . Discret. Appl. Math., (2021)