74 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- A. Gasnikov4 profiles16 · h 31
- A. Beznosikov2 profiles11 · h 18
- A. M. Raigorodskii2 profiles6 · h 7
- D. Musatov5 · h 9
- K. Alfaro-Bittner2 profiles5 · h 8
- K. Kovalenko2 profiles5 · h 5
- S. Boccaletti5 · h 60
- A. Rogozin4 · h 13
- Eduard A. Gorbunov4 · h 29
- M. Perc4 · h 119
- A. Polyanskii3 · h 8
- Abdurakhmon Sadiev2 · h 11
- Moscow Institute of Physics and TechnologyRU31 papers
- Institute for Information Transmission ProblemsRU11 papers
- National Research University Higher School of EconomicsRU8 papers
- Buryat State UniversityRU7 papers
- Lomonosov Moscow State UniversityRU7 papers
- The Russian Presidential Academy of National Economy and Public AdministrationRU7 papers
- Institute for Complex SystemsIT6 papers
- Universidad Rey Juan CarlosES6 papers
- Alma Mater EuropaeaSI4 papers
- China Medical UniversityTW4 papers
- China Medical University HospitalTW4 papers
- Complexity Science HubAT4 papers
5 papers · 1 filter
On tropical knapsack-type problems
I. M. Buchinskiy, M. V. Kotov, A. V. Treier
In this paper, we investigate the computational complexity of the knapsack problem and subset sum problem for the following tropical algebraic structures. We consider the semigroup…
Constructing 5-chromatic unit distance graphs embedded in the Euclidean plane and two-dimensional spheres
Vsevolod Voronov, Anna Neopryatnaya, Eugene Dergachev
This paper is devoted to the development of algorithms for finding unit distance graphs with chromatic number greater than 4, embedded in a two-dimensional sphere or plane. Such gr…
Distribution of tree parameters by martingale approach
Mikhail Isaev, Angus Southwell, Maksim Zhukovskii
For a uniform random labelled tree, we find the limiting distribution of tree parameters which are stable (in some sense) with respect to local perturbations of the tree structure.…
Zero-one laws for k-variable first-order logic of sparse random graphs
A. S. Razafimahatratra, M. Zhukovskii
In this paper, we prove that for every positive , there exists an such that the binomial random graph does not obey 0…
Forbidden subgraphs for graphs of bounded spectral radius, with applications to equiangular lines
Zilin Jiang, Alexandr Polyanskii
The spectral radius of a graph is the largest eigenvalue of its adjacency matrix. Let be the family of connected graphs of spectral radius . We show that $\…