Viсtor Zamaraev
Viсtor Zamaraev
Подтвержден адрес электронной почты в домене liverpool.ac.uk - Главная страница
НазваниеПроцитированоГод
Применение рыночных графов к анализу фондового рынка России
АН Визгунов, БИ Гольденгорин, ВА Замараев, ВА Калягин, ...
Журнал новой экономической ассоциации, 66, 2012
22*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
172014
Temporal vertex cover with a sliding time window
EC Akrida, GB Mertzios, PG Spirakis, V Zamaraev
Journal of Computer and System Sciences, 2019
132019
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
112015
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
102018
Market graph and markowitz model
V Kalyagin, A Koldanov, P Koldanov, V Zamaraev
Optimization in Science and Engineering, 293-306, 2014
9*2014
Locally bounded coverings and factorial properties of graphs
VV Lozin, C Mayhill, V Zamaraev
European Journal of Combinatorics 33 (4), 534-543, 2012
92012
Sliding window temporal graph coloring
GB Mertzios, H Molter, V Zamaraev
Proceedings of the AAAI Conference on Artificial Intelligence 33, 7667-7674, 2019
72019
Boundary properties of factorial classes of graphs
VV Lozin, V Zamaraev
Journal of Graph Theory 78 (3), 207-218, 2015
72015
Implicit representations and factorial properties of graphs
A Atminas, A Collins, V Lozin, V Zamaraev
Discrete Mathematics 338 (2), 164-179, 2015
72015
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
Deleting edges to restrict the size of an epidemic in temporal networks
J Enright, K Meeks, GB Mertzios, V Zamaraev
arXiv preprint arXiv:1805.06836, 2018
62018
Well-quasi-ordering versus clique-width
V Lozin, I Razgon, V Zamaraev
Journal of Combinatorial Theory, Series B 130, 1-18, 2018
62018
Clique-width for graph classes closed under complementation
A Blanché, KK Dabrowski, M Johnson, VV Lozin, D Paulusma, ...
arXiv preprint arXiv:1705.07681, 2017
62017
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
62016
On forbidden induced subgraphs for unit disk graphs
A Atminas, V Zamaraev
Discrete & Computational Geometry 60 (1), 57-97, 2018
52018
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
42018
How fast can we reach a target vertex in stochastic temporal graphs?
EC Akrida, GB Mertzios, S Nikoletseas, C Raptopoulos, PG Spirakis, ...
arXiv preprint arXiv:1903.03636, 2019
32019
Combinatorics and algorithms for augmenting graphs
KK Dabrowski, VV Lozin, D De Werra, V Zamaraev
Graphs and Combinatorics 32 (4), 1339-1352, 2016
32016
On factorial properties of chordal bipartite graphs
K Dabrowski, VV Lozin, V Zamaraev
Discrete Mathematics 312 (16), 2457–2465, 2012
32012
В данный момент система не может выполнить эту операцию. Повторите попытку позднее.
Статьи 1–20