Viktor Zamaraev
Viktor Zamaraev
Verifisert e-postadresse på liverpool.ac.uk - Startside
Tittel
Sitert av
Sitert av
År
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
372020
Применение рыночных графов к анализу фондового рынка России
АН Визгунов, БИ Гольденгорин, ВА Замараев, ВА Калягин, ...
Zhournal Novoi Ekonomicheskoi Associacii, 66-81, 2012
29*2012
Deleting edges to restrict the size of an epidemic in temporal networks
J Enright, K Meeks, GB Mertzios, V Zamaraev
44th International Symposium on Mathematical Foundations of Computer Science …, 2019
282019
Sliding window temporal graph coloring
GB Mertzios, H Molter, V Zamaraev
Proceedings of the AAAI Conference on Artificial Intelligence 33 (01), 7667-7674, 2019
232019
Computing maximum matchings in temporal graphs
GB Mertzios, H Molter, R Niedermeier, V Zamaraev, P Zschoche
arXiv preprint arXiv:1905.05304, 2019
222019
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
222014
Market graph and Markowitz model
V Kalyagin, A Koldanov, P Koldanov, V Zamaraev
Optimization in Science and Engineering, 293-306, 2014
15*2014
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
142018
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
132020
Well-quasi-ordering versus clique-width
V Lozin, I Razgon, V Zamaraev
Journal of Combinatorial Theory, Series B 130, 1-18, 2018
132018
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
132015
Implicit representations and factorial properties of graphs
A Atminas, A Collins, V Lozin, V Zamaraev
Discrete Mathematics 338 (2), 164-179, 2015
122015
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
112020
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
92018
Locally bounded coverings and factorial properties of graphs
VV Lozin, C Mayhill, V Zamaraev
European Journal of Combinatorics 33 (4), 534-543, 2012
92012
A boundary property for upper domination
H AbouEisha, S Hussain, V Lozin, J Monnot, B Ries, V Zamaraev
International Workshop on Combinatorial Algorithms, 229-240, 2016
82016
Boundary properties of factorial classes of graphs
VV Lozin, V Zamaraev
Journal of Graph Theory 78 (3), 207-218, 2015
82015
A note on the speed of hereditary graph properties
VV Lozin, C Mayhill, V Zamaraev
The Electronic Journal of Combinatorics 18 (1), P 157, 2011
72011
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
62018
On forbidden induced subgraphs for unit disk graphs
A Atminas, V Zamaraev
Discrete & Computational Geometry 60 (1), 57-97, 2018
62018
Systemet kan ikke utføre handlingen. Prøv igjen senere.
Artikler 1–20