121 citations · 149 across the 8 of their papers we have counts for
8 papers
The Class Edge-Reconstruction Number of a Maximal Planar Graph Is One or Two
Sergey Ivanov
An edge card of a graph is obtained by deleting one edge, and a class edge-reconstruction number asks for the fewest carefully selected cards that identify the graph when its class…
Graphs with Long Pseudosimilarity Chains under Consecutive Vertex Deletions
Sergey Ivanov
Pseudosimilar vertices are vertices in distinct automorphism orbits whose deletions produce isomorphic graphs. Classical work has studied the existence, group-theoretic origin, and…
Nonisomorphic Graphs Can Share an Arbitrarily Large Fraction of Their Vertex-Deleted Cards
Sergey Ivanov
For a graph , its vertex deck is the multiset of graphs obtained by deleting one vertex. Bowler, Brown, and Fenner (BBF) proposed as the maximum possibl…
Reinforcement Learning Textbook
Sergey Ivanov
This textbook covers principles behind main modern deep reinforcement learning algorithms that achieved breakthrough results in many domains from game AI to robotics. All required…
Are Hyperbolic Representations in Graphs Created Equal?
Max Kochurov, Sergey Ivanov, Eugeny Burnaev
Recently there was an increasing interest in applications of graph neural networks in non-Euclidean geometry; however, are non-Euclidean representations always useful for graph lea…
Modern Deep Reinforcement Learning Algorithms
Sergey Ivanov, Alexander D'yakonov
Recent advances in Reinforcement Learning, grounded on combining classical theoretical results with Deep Learning paradigm, led to breakthroughs in many artificial intelligence tas…