( en | de | ru )

 

Disambiguation of "Zamaraev, Viktor"

Author of the publication

copydeleteadd this publication to your clipboard
Randomized communication and implicit graph representations.

, , and . STOC, page 1220-1233. ACM, (2022)

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.

Viktor Skutschik

Viktor Bokisch

Manfred Viktor

Viktor Zepezauer

Viktor Gusowski

 

Other publications of authors with the same name

Sharp Thresholds in Random Simple Temporal Graphs, , , and . 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS), page 319-326. (February 2022)Tight bounds on adjacency labels for monotone graph classes., , , , and . CoRR, (2023)Graph Parameters, Implicit Representations and Factorial Properties., , , , and . IWOCA, volume 13270 of Lecture Notes in Computer Science, page 60-72. Springer, (2022)Linear Ramsey Numbers., , and . IWOCA, volume 10979 of Lecture Notes in Computer Science, page 26-38. Springer, (2018)On the Price of Independence for Vertex Cover, Feedback Vertex Set and Odd Cycle Transversal., , , , and . MFCS, volume 117 of LIPIcs, page 63:1-63:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Sliding window temporal graph coloring., , and . J. Comput. Syst. Sci., (2021)Succinct Permutation Graphs., , and . CoRR, (2020)Symmetric-Difference (Degeneracy) and Signed Tree Models., , , and . MFCS, volume 306 of LIPIcs, page 32:1-32:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Sharp Thresholds in Random Simple Temporal Graphs., , , and . FOCS, page 319-326. IEEE, (2021)Tight Bounds on Adjacency Labels for Monotone Graph Classes., , , , and . ICALP, volume 297 of LIPIcs, page 31:1-31:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)