( 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 Mandryka

Viktor Malec

Viktor Magdolen

Viktor Krozer

Viktor Geringer

 

Other publications of authors with the same name

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)On the Price of Independence for Vertex Cover, Feedback Vertex Set and Odd Cycle Transversal., , , , and . CoRR, (2019)Sliding Window Temporal Graph Coloring., , and . CoRR, (2018)How fast can we reach a target vertex in stochastic temporal graphs?, , , , , and . CoRR, (2019)Letter Graphs and Geometric Grid Classes of Permutations: Characterization and Recognition., , , and . IWOCA, volume 10765 of Lecture Notes in Computer Science, page 195-205. Springer, (2017)Sharp Thresholds in Random Simple Temporal Graphs., , , and . FOCS, page 319-326. IEEE, (2021)Small But Unwieldy., , , , and . CoRR, (2023)Graphs with minimum fractional domatic number., , , and . Discret. Appl. Math., (January 2024)Faster Exploration of Some Temporal Graphs., , , and . SAND, volume 221 of LIPIcs, page 5:1-5:10. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Distributed Minimum Vertex Coloring and Maximum Independent Set in Chordal Graphs., and . MFCS, volume 138 of LIPIcs, page 21:1-21:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)