A Note on the Speed of Hereditary Graph Properties. - Vadim V. Lozin; Colin Mayhill; Victor Zamaraev (Electron. J. Comb., 2011)

On factorial properties of chordal bipartite graphs. - Konrad K. Dabrowski; Vadim V. Lozin; Victor Zamaraev (Discret. Math., 2012)

Locally bounded coverings and factorial properties of graphs. - Vadim V. Lozin; Colin Mayhill; Victor Zamaraev (Eur. J. Comb., 2012)

Corrigendum to "Locally bounded coverings and factorial properties of graphs" [European J. Combin. 33(2012) 534-543]. - Vadim V. Lozin; Colin Mayhill; Victor Zamaraev (Eur. J. Comb., 2014)

Well-quasi-ordering Does Not Imply Bounded Clique-width. - Vadim V. Lozin; Igor Razgon; Victor Zamaraev (WG, 2015)

Implicit representations and factorial properties of graphs. - Aistis Atminas; Andrew Collins 004; Vadim V. Lozin; Victor Zamaraev (Discret. Math., 2015)

A tolerance-based heuristic approach for the weighted independent set problem. - Boris I. Goldengorin; Dmitriy S. Malyshev; Panos M. Pardalos; Victor Zamaraev (J. Comb. Optim., 2015)

Boundary Properties of Factorial Classes of Graphs. - Vadim V. Lozin; Victor Zamaraev (J. Graph Theory, 2015)

A Boundary Property for Upper Domination. - Hassan AbouEisha; Shahid Hussain 004; Vadim V. Lozin; Jérôme Monnot; Bernard Ries; Victor Zamaraev (IWOCA, 2016)

Independent Domination versus Weighted Independent Domination. - Vadim V. Lozin; Raffaele Mosca; Victor Zamaraev (CoRR, 2016)

Combinatorics and Algorithms for Augmenting Graphs. - Konrad Kazimierz Dabrowski; Vadim V. Lozin; Dominique de Werra; Victor Zamaraev (Graphs Comb., 2016)

Specifying a positive threshold function via extremal points. - Vadim V. Lozin; Igor Razgon; Viktor Zamaraev; Elena Zamaraeva; Nikolai Yu. Zolotykh (ALT, 2017)

New Results on Weighted Independent Domination. - Vadim V. Lozin; Dmitriy S. Malyshev; Raffaele Mosca; Viktor Zamaraev (WG, 2017)

The structure and the number of P7-free bipartite graphs. - Vadim V. Lozin; Victor Zamaraev (Electron. Notes Discret. Math., 2017)

More results on weighted independent domination. - Vadim V. Lozin; Dmitriy S. Malyshev; Raffaele Mosca; Viktor Zamaraev (Theor. Comput. Sci., 2017)

Linear Clique-Width of Bi-complement Reducible Graphs. - Bogdan Alecu; Vadim V. Lozin; Viktor Zamaraev (IWOCA, 2018)

Linear Ramsey Numbers. - Aistis Atminas; Vadim V. Lozin; Viktor Zamaraev (IWOCA, 2018)

Brief Announcement: Distributed Minimum Vertex Coloring and Maximum Independent Set in Chordal Graphs. - Christian Konrad 001; Viktor Zamaraev (PODC, 2018)

Upper Domination: Towards a Dichotomy Through Boundary Properties. - Hassan AbouEisha; Shahid Hussain 004; Vadim V. Lozin; Jérôme Monnot; Bernard Ries; Viktor Zamaraev (Algorithmica, 2018)

Infinitely many minimal classes of graphs of unbounded clique-width. - Andrew Collins 004; Jan Foniok; Nicholas Korpelainen; Vadim V. Lozin; Victor Zamaraev (Discret. Appl. Math., 2018)

Linear read-once and related Boolean functions. - Vadim V. Lozin; Igor Razgon; Viktor Zamaraev; Elena Zamaraeva; Nikolai Yu. Zolotykh (Discret. Appl. Math., 2018)

On Forbidden Induced Subgraphs for Unit Disk Graphs. - Aistis Atminas; Viktor Zamaraev (Discret. Comput. Geom., 2018)

Well-quasi-ordering versus clique-width. - Vadim V. Lozin; Igor Razgon; Viktor Zamaraev (J. Comb. Theory B, 2018)

Dominating induced matchings in graphs containing no long claw. - Alain Hertz; Vadim V. Lozin; Bernard Ries; Viktor Zamaraev; Dominique de Werra (J. Graph Theory, 2018)

Linear Programming complementation and its application to fractional graph theory. - Maximilien Gadouleau; George B. Mertzios; Viktor Zamaraev (CoRR, 2019)

Exact and Approximate Algorithms for Computing a Second Hamiltonian Cycle. - Argyrios Deligkas; George B. Mertzios; Paul G. Spirakis; Viktor Zamaraev (MFCS, 2020)

Matching in Stochastically Evolving Graphs. - Eleni C. Akrida; Argyrios Deligkas; George B. Mertzios; Paul G. Spirakis; Viktor Zamaraev (CoRR, 2020)

Letter graphs and geometric grid classes of permutations: Characterization and recognition. - Bogdan Alecu; Vadim V. Lozin; Dominique de Werra; Viktor Zamaraev (Discret. Appl. Math., 2020)

Between clique-width and linear clique-width of bipartite graphs. - Bogdan Alecu; Mamadou Moustapha Kanté; Vadim V. Lozin; Viktor Zamaraev (Discret. Math., 2020)

Independent domination versus weighted independent domination. - Vadim V. Lozin; Dmitriy S. Malyshev; Raffaele Mosca; Viktor Zamaraev (Inf. Process. Lett., 2020)

How fast can we reach a target vertex in stochastic temporal graphs? - Eleni C. Akrida; George B. Mertzios; Sotiris E. Nikoletseas; Christoforos L. Raptopoulos; Paul G. Spirakis; Viktor Zamaraev (J. Comput. Syst. Sci., 2020)

Temporal vertex cover with a sliding time window. - Eleni C. Akrida; George B. Mertzios; Paul G. Spirakis; Viktor Zamaraev (J. Comput. Syst. Sci., 2020)

Clique-Width for Graph Classes Closed under Complementation. - Alexandre Blanché; Konrad K. Dabrowski; Matthew Johnson 002; Vadim V. Lozin; Daniël Paulusma; Viktor Zamaraev (SIAM J. Discret. Math., 2020)

Robust Lower Bounds for Graph Problems in the Blackboard Model of Communication. - Christian Konrad 001; Peter Robinson 002; Viktor Zamaraev (CoRR, 2021)

Randomized Communication and the Implicit Graph Conjecture. - Nathaniel Harms; Sebastian Wild; Viktor Zamaraev (CoRR, 2021)

Graph classes with linear Ramsey numbers. - Bogdan Alecu; Aistis Atminas; Vadim V. Lozin; Viktor Zamaraev (Discret. Math., 2021)

Deleting edges to restrict the size of an epidemic in temporal networks. - Jessica A. Enright; Kitty Meeks; George B. Mertzios; Viktor Zamaraev (J. Comput. Syst. Sci., 2021)

Sliding window temporal graph coloring. - George B. Mertzios; Hendrik Molter; Viktor Zamaraev (J. Comput. Syst. Sci., 2021)

Faster Exploration of Some Temporal Graphs. - Duncan Adamson; Vladimir V. Gusev; Dmitriy S. Malyshev; Viktor Zamaraev (SAND, 2022)

Randomized communication and implicit graph representations. - Nathaniel Harms; Sebastian Wild; Viktor Zamaraev (STOC, 2022)

Compact Graph Representation of molecular crystals using Point-wise Distance Distributions. - Jonathan Balasingham; Viktor Zamaraev; Vitaliy Kurlin (CoRR, 2022)

On Boolean threshold functions with minimum specification number. - Vadim V. Lozin; Viktor Zamaraev; Elena Zamaraeva; Nikolai Yu. Zolotykh (Inf. Comput., 2022)

Distributed minimum vertex coloring and maximum independent set in chordal graphs. - Christian Konrad 001; Viktor Zamaraev (Theor. Comput. Sci., 2022)

Letter Graphs and Geometric Grid Classes of Permutations. - Bogdan Alecu; Robert Ferguson; Mamadou Moustapha Kanté; Vadim V. Lozin; Vincent Vatter; Victor Zamaraev (SIAM J. Discret. Math., 2022)

Giant Components in Random Temporal Graphs. - Ruben Becker; Arnaud Casteigts; Pierluigi Crescenzi; Bojana Kodric; Malte Renken; Michael Raskin; Viktor Zamaraev (APPROX/RANDOM, 2023)

Functionality of box intersection graphs. - Clément Dallard; Vadim V. Lozin; Martin Milanic; Kenny Storgel; Viktor Zamaraev (CoRR, 2023)

Small But Unwieldy. - Édouard Bonnet; Julien Duron; John Sylvester 001; Viktor Zamaraev; Maksim Zhukovskii (CoRR, 2023)

Graph parameters, implicit representations and factorial properties. - Bogdan Alecu; Vladimir E. Alekseev; Aistis Atminas; Vadim V. Lozin; Victor Zamaraev (Discret. Math., 2023)

Succinct Permutation Graphs. - Konstantinos Tsakalidis; Sebastian Wild; Viktor Zamaraev (Algorithmica, 2023)

Computing maximum matchings in temporal graphs. - George B. Mertzios; Hendrik Molter; Rolf Niedermeier; Viktor Zamaraev; Philipp Zschoche (J. Comput. Syst. Sci., 2023)

Tight Bounds on Adjacency Labels for Monotone Graph Classes. - Édouard Bonnet; Julien Duron; John Sylvester 001; Viktor Zamaraev; Maksim Zhukovskii (ICALP, 2024)

Symmetric-Difference (Degeneracy) and Signed Tree Models. - Édouard Bonnet; Julien Duron; John Sylvester 001; Viktor Zamaraev (MFCS, 2024)

Randomized Communication and Implicit Representations for Matrices and Graphs of Small Sign-Rank. - Nathaniel Harms; Viktor Zamaraev (SODA, 2024)

Accelerating Material Property Prediction using Generically Complete Isometry Invariants. - Jonathan Balasingham; Viktor Zamaraev; Vitaliy Kurlin (CoRR, 2024)

Lettericity of graphs: an FPT algorithm and a bound on the size of obstructions. - Bogdan Alecu; Mamadou Moustapha Kanté; Vadim V. Lozin; Viktor Zamaraev (CoRR, 2024)

Boolean combinations of graphs. - Sarosh Adenwalla; Samuel Braunfeld; John Sylvester 001; Viktor Zamaraev (CoRR, 2024)

Functionality of Random Graphs. - John Sylvester 001; Viktor Zamaraev; Maksim Zhukovskii (CoRR, 2024)

Small but Unwieldy: A Lower Bound on Adjacency Labels for Small Classes. - Édouard Bonnet; Julien Duron; John Sylvester 001; Viktor Zamaraev; Maksim Zhukovskii (SIAM J. Comput., 2024)

Sharp Thresholds in Random Simple Temporal Graphs. - Arnaud Casteigts; Michael Raskin; Malte Renken; Viktor Zamaraev (SIAM J. Comput., 2024)

Optimal Adjacency Labels for Subgraphs of Cartesian Products. - Louis Esperet; Nathaniel Harms; Viktor Zamaraev (SIAM J. Discret. Math., 2024)

Graphs with minimum fractional domatic number. - Maximilien Gadouleau; Nathaniel Harms; George B. Mertzios; Viktor Zamaraev (Discret. Appl. Math., 2024)

Union-closed sets and Horn Boolean functions. - Vadim V. Lozin; Viktor Zamaraev (J. Comb. Theory A, 2024)

On the price of independence for vertex cover, feedback vertex set and odd cycle transversal. - Konrad K. Dabrowski; Matthew Johnson 002; Giacomo Paesani; Daniël Paulusma; Viktor Zamaraev (Eur. J. Comb., 2024)

The Treewidth and Pathwidth of Graph Unions. - Bogdan Alecu; Vadim V. Lozin; Daniel A. Quiroz; Roman Rabinovich 001; Igor Razgon; Viktor Zamaraev (SIAM J. Discret. Math., 2024)

Approximate and Randomized Algorithms for Computing a Second Hamiltonian Cycle. - Argyrios Deligkas; George B. Mertzios; Paul G. Spirakis; Viktor Zamaraev (Algorithmica, 2024)

Adjacency Labeling Schemes for Small Classes. - Édouard Bonnet; Julien Duron; John Sylvester 001; Viktor Zamaraev (ITCS, 2025)

Linear Programming complementation. - Maximilien Gadouleau; George B. Mertzios; Viktor Zamaraev (Theor. Comput. Sci., 2025)

Complexity of learning matchings and half graphs via edge queries. - Nikhil S. Mande; Swagato Sanyal; Viktor Zamaraev (CoRR, 2025)

Temporal Exploration of Random Spanning Tree Models. - Samuel Baguley; Andreas Göbel 001; Nicolas Klodt; George Skretas; John Sylvester 001; Viktor Zamaraev (CoRR, 2025)