Viktor Zamaraev

Publication Activity (10 Years)

Years Active: 2017-2024
Publications (10 Years): 81

Top Topics

Independent Set

Boolean Functions

Graph Representation

Top Venues

J. Comput. Syst. Sci.

Publications

Konrad K. Dabrowski, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Viktor Zamaraev
On the price of independence for vertex cover, feedback vertex set and odd cycle transversal. Eur. J. Comb. 117 (2024)
Vadim V. Lozin, Viktor Zamaraev
Union-closed sets and Horn Boolean functions. J. Comb. Theory, Ser. A 202 (2024)
Bogdan Alecu, Vadim V. Lozin, Daniel A. Quiroz, Roman Rabinovich, Igor Razgon, Viktor Zamaraev
The Treewidth and Pathwidth of Graph Unions. SIAM J. Discret. Math. 38 (1) (2024)
Jonathan Balasingham, Viktor Zamaraev, Vitaliy Kurlin
Accelerating Material Property Prediction using Generically Complete Isometry Invariants. CoRR (2024)
Maximilien Gadouleau, Nathaniel Harms, George B. Mertzios, Viktor Zamaraev
Graphs with minimum fractional domatic number. Discret. Appl. Math. 343 (2024)
Bogdan Alecu, Mamadou Moustapha Kanté, Vadim V. Lozin, Viktor Zamaraev
Lettericity of graphs: an FPT algorithm and a bound on the size of obstructions. CoRR (2024)
Arnaud Casteigts, Michael Raskin, Malte Renken, Viktor Zamaraev
Sharp Thresholds in Random Simple Temporal Graphs. SIAM J. Comput. 53 (2) (2024)
Louis Esperet, Nathaniel Harms, Viktor Zamaraev
Optimal Adjacency Labels for Subgraphs of Cartesian Products. SIAM J. Discret. Math. 38 (3) (2024)
Edouard Bonnet, Julien Duron, John Sylvester, Viktor Zamaraev, Maksim Zhukovskii
Small But Unwieldy: A Lower Bound on Adjacency Labels for Small Classes. SODA (2024)
Nathaniel Harms, Viktor Zamaraev
Randomized Communication and Implicit Representations for Matrices and Graphs of Small Sign-Rank. SODA (2024)
Édouard Bonnet, Julien Duron, John Sylvester, Viktor Zamaraev, Maksim Zhukovskii
Tight Bounds on Adjacency Labels for Monotone Graph Classes. ICALP (2024)
Édouard Bonnet, Julien Duron, John Sylvester, Viktor Zamaraev
Symmetric-Difference (Degeneracy) and Signed Tree Models. CoRR (2024)
Édouard Bonnet, Julien Duron, John Sylvester, Viktor Zamaraev
Symmetric-Difference (Degeneracy) and Signed Tree Models. MFCS (2024)
Ruben Becker, Arnaud Casteigts, Pierluigi Crescenzi, Bojana Kodric, Malte Renken, Michael Raskin, Viktor Zamaraev
Giant Components in Random Temporal Graphs. APPROX/RANDOM (2023)
Louis Esperet, Nathaniel Harms, Viktor Zamaraev
Optimal Adjacency Labels for Subgraphs of Cartesian Products. ICALP (2023)
Édouard Bonnet, Julien Duron, John Sylvester, Viktor Zamaraev, Maksim Zhukovskii
Tight bounds on adjacency labels for monotone graph classes. CoRR (2023)
Nathaniel Harms, Viktor Zamaraev
Randomized Communication and Implicit Representations for Matrices and Graphs of Small Sign-Rank. CoRR (2023)
George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Viktor Zamaraev, Philipp Zschoche
Computing maximum matchings in temporal graphs. J. Comput. Syst. Sci. 137 (2023)
Maximilien Gadouleau, Nathaniel Harms, George B. Mertzios, Viktor Zamaraev
Graphs with minimum fractional domatic number. CoRR (2023)
Konstantinos Tsakalidis, Sebastian Wild, Viktor Zamaraev
Succinct Permutation Graphs. Algorithmica 85 (2) (2023)
Bogdan Alecu, Vladimir E. Alekseev, Aistis Atminas, Vadim V. Lozin, Viktor Zamaraev
Graph parameters, implicit representations and factorial properties. CoRR (2023)
Édouard Bonnet, Julien Duron, John Sylvester, Viktor Zamaraev, Maksim Zhukovskii
Small But Unwieldy. CoRR (2023)
Clément Dallard, Vadim V. Lozin, Martin Milanic, Kenny Storgel, Viktor Zamaraev
Functionality of box intersection graphs. CoRR (2023)
Nathaniel Harms, Sebastian Wild, Viktor Zamaraev
Randomized communication and implicit graph representations. STOC (2022)
Christian Konrad, Viktor Zamaraev
Distributed minimum vertex coloring and maximum independent set in chordal graphs. Theor. Comput. Sci. 922 (2022)
Bogdan Alecu, Vladimir E. Alekseev, Aistis Atminas, Vadim V. Lozin, Viktor Zamaraev
Graph Parameters, Implicit Representations and Factorial Properties. IWOCA (2022)
Arnaud Casteigts, Michael Raskin, Malte Renken, Viktor Zamaraev
Sharp Thresholds in Random Simple Temporal Graphs. FOCS (2022)
Jonathan Balasingham, Viktor Zamaraev, Vitaliy Kurlin
Compact Graph Representation of molecular crystals using Point-wise Distance Distributions. CoRR (2022)
Bogdan Alecu, Vadim V. Lozin, Daniel A. Quiroz, Roman Rabinovich, Igor Razgon, Viktor Zamaraev
The treewidth and pathwidth of graph unions. CoRR (2022)
Vadim V. Lozin, Viktor Zamaraev, Elena Zamaraeva, Nikolai Yu. Zolotykh
On Boolean threshold functions with minimum specification number. Inf. Comput. 289 (Part) (2022)
Duncan Adamson, Vladimir V. Gusev, Dmitriy S. Malyshev, Viktor Zamaraev
Faster Exploration of Some Temporal Graphs. SAND (2022)
Ruben Becker, Arnaud Casteigts, Pierluigi Crescenzi, Bojana Kodric, Malte Renken, Michael Raskin, Viktor Zamaraev
Giant Components in Random Temporal Graphs. CoRR (2022)
Louis Esperet, Nathaniel Harms, Viktor Zamaraev
Optimal Adjacency Labels for Subgraphs of Cartesian Products. CoRR (2022)
George B. Mertzios, Hendrik Molter, Viktor Zamaraev
Sliding window temporal graph coloring. J. Comput. Syst. Sci. 120 (2021)
Nathaniel Harms, Sebastian Wild, Viktor Zamaraev
Randomized Communication and the Implicit Graph Conjecture. CoRR (2021)
Arnaud Casteigts, Michael Raskin, Malte Renken, Viktor Zamaraev
Sharp Thresholds in Random Simple Temporal Graphs. FOCS (2021)
Jessica A. Enright, Kitty Meeks, George B. Mertzios, Viktor Zamaraev
Deleting edges to restrict the size of an epidemic in temporal networks. J. Comput. Syst. Sci. 119 (2021)
Christian Konrad, Peter Robinson, Viktor Zamaraev
Robust Lower Bounds for Graph Problems in the Blackboard Model of Communication. CoRR (2021)
Bogdan Alecu, Aistis Atminas, Vadim V. Lozin, Viktor Zamaraev
Graph classes with linear Ramsey numbers. Discret. Math. 344 (4) (2021)
Eleni C. Akrida, Argyrios Deligkas, George B. Mertzios, Paul G. Spirakis, Viktor Zamaraev
Matching in Stochastically Evolving Graphs. CoRR (2020)
Eleni C. Akrida, George B. Mertzios, Paul G. Spirakis, Viktor Zamaraev
Temporal vertex cover with a sliding time window. J. Comput. Syst. Sci. 107 (2020)
Argyrios Deligkas, George B. Mertzios, Paul G. Spirakis, Viktor Zamaraev
Exact and Approximate Algorithms for Computing a Second Hamiltonian Cycle. CoRR (2020)
Argyrios Deligkas, George B. Mertzios, Paul G. Spirakis, Viktor Zamaraev
Exact and Approximate Algorithms for Computing a Second Hamiltonian Cycle. MFCS (2020)
Konstantinos Tsakalidis, Sebastian Wild, Viktor Zamaraev
Succinct Permutation Graphs. CoRR (2020)
Vadim V. Lozin, Dmitriy S. Malyshev, Raffaele Mosca, Viktor Zamaraev
Independent domination versus weighted independent domination. Inf. Process. Lett. 156 (2020)
Bogdan Alecu, Mamadou Moustapha Kanté, Vadim V. Lozin, Viktor Zamaraev
Between clique-width and linear clique-width of bipartite graphs. Discret. Math. 343 (8) (2020)
George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Viktor Zamaraev, Philipp Zschoche
Computing Maximum Matchings in Temporal Graphs. STACS (2020)
Bogdan Alecu, Vadim V. Lozin, Dominique de Werra, Viktor Zamaraev
Letter graphs and geometric grid classes of permutations: Characterization and recognition. Discret. Appl. Math. 283 (2020)
Eleni C. Akrida, George B. Mertzios, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis, Viktor Zamaraev
How fast can we reach a target vertex in stochastic temporal graphs? J. Comput. Syst. Sci. 114 (2020)
Alexandre Blanché, Konrad K. Dabrowski, Matthew Johnson, Vadim V. Lozin, Daniël Paulusma, Viktor Zamaraev
Clique-Width for Graph Classes Closed under Complementation. SIAM J. Discret. Math. 34 (2) (2020)
Arnaud Casteigts, Michael Raskin, Malte Renken, Viktor Zamaraev
Sharp Thresholds in Random Simple Temporal Graphs. CoRR (2020)
George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Viktor Zamaraev, Philipp Zschoche
Computing Maximum Matchings in Temporal Graphs. CoRR (2019)
Eleni C. Akrida, George B. Mertzios, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis, Viktor Zamaraev
How fast can we reach a target vertex in stochastic temporal graphs? CoRR (2019)
Konrad K. Dabrowski, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Viktor Zamaraev
On the Price of Independence for Vertex Cover, Feedback Vertex Set and Odd Cycle Transversal. CoRR (2019)
Eleni C. Akrida, George B. Mertzios, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis, Viktor Zamaraev
How Fast Can We Reach a Target Vertex in Stochastic Temporal Graphs? ICALP (2019)
Jessica A. Enright, Kitty Meeks, George B. Mertzios, Viktor Zamaraev
Deleting Edges to Restrict the Size of an Epidemic in Temporal Networks. MFCS (2019)
George B. Mertzios, Hendrik Molter, Viktor Zamaraev
Sliding Window Temporal Graph Coloring. AAAI (2019)
Maximilien Gadouleau, George B. Mertzios, Viktor Zamaraev
Linear Programming complementation and its application to fractional graph theory. CoRR (2019)
Christian Konrad, Viktor Zamaraev
Distributed Minimum Vertex Coloring and Maximum Independent Set in Chordal Graphs. MFCS (2019)
Eleni C. Akrida, George B. Mertzios, Paul G. Spirakis, Viktor Zamaraev
Temporal Vertex Cover with a Sliding Time Window. ICALP (2018)
Christian Konrad, Viktor Zamaraev
Brief Announcement: Distributed Minimum Vertex Coloring and Maximum Independent Set in Chordal Graphs. PODC (2018)
Aistis Atminas, Viktor Zamaraev
On Forbidden Induced Subgraphs for Unit Disk Graphs. Discret. Comput. Geom. 60 (1) (2018)
Vadim V. Lozin, Igor Razgon, Viktor Zamaraev, Elena Zamaraeva, Nikolai Yu. Zolotykh
Linear read-once and related Boolean functions. CoRR (2018)
Hassan AbouEisha, Shahid Hussain, Vadim V. Lozin, Jérôme Monnot, Bernard Ries, Viktor Zamaraev
Upper Domination: Towards a Dichotomy Through Boundary Properties. Algorithmica 80 (10) (2018)
George B. Mertzios, Hendrik Molter, Viktor Zamaraev
Sliding Window Temporal Graph Coloring. CoRR (2018)
Vadim V. Lozin, Igor Razgon, Viktor Zamaraev, Elena Zamaraeva, Nikolai Yu. Zolotykh
Linear read-once and related Boolean functions. Discret. Appl. Math. 250 (2018)
Bogdan Alecu, Vadim V. Lozin, Dominique de Werra, Viktor Zamaraev
Letter graphs and geometric grid classes of permutations: characterization and recognition. CoRR (2018)
Christian Konrad, Viktor Zamaraev
Distributed Minimum Vertex Coloring and Maximum Independent Set in Chordal Graphs. CoRR (2018)
Bogdan Alecu, Vadim V. Lozin, Viktor Zamaraev
Linear Clique-Width of Bi-complement Reducible Graphs. IWOCA (2018)
Aistis Atminas, Vadim V. Lozin, Viktor Zamaraev
Linear Ramsey Numbers. IWOCA (2018)
Vadim V. Lozin, Igor Razgon, Viktor Zamaraev
Well-quasi-ordering versus clique-width. J. Comb. Theory, Ser. B 130 (2018)
Konrad K. Dabrowski, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Viktor Zamaraev
On the Price of Independence for Vertex Cover, Feedback Vertex Set and Odd Cycle Transversal. MFCS (2018)
Eleni C. Akrida, George B. Mertzios, Paul G. Spirakis, Viktor Zamaraev
Temporal Vertex Cover with a Sliding Time Window. CoRR (2018)
Alain Hertz, Vadim V. Lozin, Bernard Ries, Viktor Zamaraev, Dominique de Werra
Dominating induced matchings in graphs containing no long claw. J. Graph Theory 88 (1) (2018)
Jessica A. Enright, Kitty Meeks, George B. Mertzios, Viktor Zamaraev
Deleting edges to restrict the size of an epidemic in temporal networks. CoRR (2018)
Vadim V. Lozin, Dmitriy S. Malyshev, Raffaele Mosca, Viktor Zamaraev
More results on weighted independent domination. Theor. Comput. Sci. 700 (2017)
Vadim V. Lozin, Viktor Zamaraev
-free bipartite graphs. Eur. J. Comb. 65 (2017)
Bogdan Alecu, Vadim V. Lozin, Viktor Zamaraev, Dominique de Werra
Letter Graphs and Geometric Grid Classes of Permutations: Characterization and Recognition. IWOCA (2017)
Alexandre Blanché, Konrad K. Dabrowski, Matthew Johnson, Vadim V. Lozin, Daniël Paulusma, Viktor Zamaraev
Clique-Width for Graph Classes Closed under Complementation. MFCS (2017)
Vadim V. Lozin, Dmitriy S. Malyshev, Raffaele Mosca, Viktor Zamaraev
New Results on Weighted Independent Domination. WG (2017)
Vadim V. Lozin, Igor Razgon, Viktor Zamaraev, Elena Zamaraeva, Nikolai Yu. Zolotykh
Specifying a positive threshold function via extremal points. ALT (2017)