Viktor Zamaraev
Viktor Zamaraev
Verified email at - Homepage
Cited by
Cited by
Temporal vertex cover with a sliding time window
EC Akrida, GB Mertzios, PG Spirakis, V Zamaraev
Journal of Computer and System Sciences Volume, 108--123, 2020
Deleting edges to restrict the size of an epidemic in temporal networks
J Enright, K Meeks, GB Mertzios, V Zamaraev
Journal of Computer and System Sciences 119, 60-77, 2021
Sliding window temporal graph coloring
GB Mertzios, H Molter, V Zamaraev
Proceedings of the AAAI Conference on Artificial Intelligence 33 (01), 7667-7674, 2019
Computing maximum matchings in temporal graphs
GB Mertzios, H Molter, R Niedermeier, V Zamaraev, P Zschoche
arXiv preprint arXiv:1905.05304, 2019
Применение рыночных графов к анализу фондового рынка России
АН Визгунов, БИ Гольденгорин, ВА Замараев, ВА Калягин, ...
Журнал Новой экономической ассоциации, 66-81, 2012
Measures of uncertainty in market network analysis
VA Kalyagin, AP Koldanov, PA Koldanov, PM Pardalos, VA Zamaraev
Physica A: Statistical Mechanics and its Applications 413, 59-70, 2014
Implicit representations and factorial properties of graphs
A Atminas, A Collins, V Lozin, V Zamaraev
Discrete Mathematics 338 (2), 164-179, 2015
How fast can we reach a target vertex in stochastic temporal graphs?
EC Akrida, GB Mertzios, S Nikoletseas, C Raptopoulos, PG Spirakis, ...
Journal of computer and system sciences 114, 65-83, 2020
Dominating induced matchings in graphs containing no long claw
A Hertz, V Lozin, B Ries, V Zamaraev, D de Werra
Journal of Graph Theory 88 (1), 18-39, 2018
Well-quasi-ordering does not imply bounded clique-width
VV Lozin, I Razgon, V Zamaraev
International Workshop on Graph-Theoretic Concepts in Computer Science, 351-359, 2015
Market graph and Markowitz model
V Kalyagin, A Koldanov, P Koldanov, V Zamaraev
Optimization in Science and Engineering, 293-306, 2014
Well-quasi-ordering versus clique-width
V Lozin, I Razgon, V Zamaraev
Journal of Combinatorial Theory, Series B 130, 1-18, 2018
Letter graphs and geometric grid classes of permutations: characterization and recognition
B Alecu, V Lozin, D de Werra, V Zamaraev
Discrete Applied Mathematics 283, 482-494, 2020
Clique-width for graph classes closed under complementation
A Blanché, KK Dabrowski, M Johnson, VV Lozin, D Paulusma, ...
SIAM Journal on Discrete Mathematics 34 (2), 1107-1147, 2020
Infinitely many minimal classes of graphs of unbounded clique-width
A Collins, J Foniok, N Korpelainen, V Lozin, V Zamaraev
Discrete Applied Mathematics 248, 145-152, 2018
Locally bounded coverings and factorial properties of graphs
VV Lozin, C Mayhill, V Zamaraev
European Journal of Combinatorics 33 (4), 534-543, 2012
Upper Domination: towards a dichotomy through boundary properties
H AbouEisha, S Hussain, V Lozin, J Monnot, B Ries, V Zamaraev
Algorithmica 80 (10), 2799-2817, 2018
The structure and the number of P7-free bipartite graphs
V Lozin, V Zamaraev
European Journal of Combinatorics, 143-153, 2017
Boundary properties of factorial classes of graphs
VV Lozin, V Zamaraev
Journal of Graph Theory 78 (3), 207-218, 2015
Distributed minimum vertex coloring and maximum independent set in chordal graphs
C Konrad, V Zamaraev
Theoretical Computer Science, 2022
The system can't perform the operation now. Try again later.
Articles 1–20