default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndrei M. Raigorodskii
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j30]Mikhail M. Ipatov, Mikhail M. Koshelev, Andrei M. Raigorodskii:
Modularity of some distance graphs. Eur. J. Comb. 117: 103833 (2024)- 2023
- [j29]Michael Th. Rassias, Bicheng Yang
, Andrei M. Raigorodskii:
An Equivalent Form Related to a Hilbert-Type Integral Inequality. Axioms 12(7): 677 (2023) - [j28]Ekaterina Vasilyeva, Miguel Romance, Ivan Samoylenko, Kirill D. Kovalenko, Daniil Musatov, Andrei M. Raigorodskii, Stefano Boccaletti:
Distances in Higher-Order Networks and the Metric Structure of Hypergraphs. Entropy 25(6): 923 (2023) - [j27]Pierre Miasnikof, Alexander Y. Shestopaloff, Andrei M. Raigorodskii:
Statistical power, accuracy, reproducibility and robustness of a graph clusterability test. Int. J. Data Sci. Anal. 15(4): 379-390 (2023) - [j26]S. I. Sadykov, Aleksandr V. Lobanov, Andrei M. Raigorodskii:
Gradient-Free Algorithms for Solving Stochastic Saddle Optimization Problems with the Polyak-Łojasiewicz Condition. Program. Comput. Softw. 49(6): 535-547 (2023) - [j25]Michael Th. Rassias, Bicheng Yang, Andrei M. Raigorodskii:
Equivalent Conditions of the Reverse Hardy-Type Integral Inequalities. Symmetry 15(2): 463 (2023) - 2022
- [j24]Vladislav Kozhevnikov, Andrei M. Raigorodskii, Maksim Zhukovskii:
Large cycles in random generalized Johnson graphs. Discret. Math. 345(3): 112721 (2022) - [i5]Ivan Samoylenko, David Aleja, Eva Primo, Karin Alfaro-Bittner, Ekaterina Vasilyeva, Kirill D. Kovalenko, Daniil Musatov, Andrei M. Raigorodskii, Regino Criado, Miguel Romance, David Papo, Matjaz Perc, Baruch Barzel, Stefano Boccaletti:
Why are there six degrees of separation in a social network? CoRR abs/2211.09463 (2022) - 2021
- [j23]A. V. Berdnikov, Andrei M. Raigorodskii:
Bounds on Borsuk Numbers in Distance Graphs of a Special Type. Probl. Inf. Transm. 57(2): 136-142 (2021) - [j22]Michael Th. Rassias, Bicheng Yang, Andrei M. Raigorodskii:
A Hilbert-Type Integral Inequality in the Whole Plane Related to the Arc Tangent Function. Symmetry 13(2): 351 (2021) - [j21]Michael Th. Rassias, Bicheng Yang, Andrei M. Raigorodskii:
Equivalent Properties of Two Kinds of Hardy-Type Integral Inequalities. Symmetry 13(6): 1006 (2021) - 2020
- [j20]Gyula O. H. Katona, Andrei M. Raigorodskii, Máté Vizer:
Preface: 2nd Russian-Hungarian Combinatorial Workshop. Discret. Appl. Math. 276: 1 (2020) - [j19]Andrei M. Raigorodskii, Mikhail M. Koshelev:
New bounds on clique-chromatic numbers of Johnson graphs. Discret. Appl. Math. 283: 724-729 (2020) - [j18]P. A. Ogarok, Andrei M. Raigorodskii:
On Stability of the Independence Number of a Certain Distance Graph. Probl. Inf. Transm. 56(4): 345-357 (2020)
2010 – 2019
- 2019
- [c8]Pierre Miasnikof, Liudmila Prokhorenkova, Alexander Y. Shestopaloff, Andrei M. Raigorodskii:
A Statistical Test of Heterogeneous Subgraph Densities to Assess Clusterability. LION 2019: 17-29 - 2018
- [j17]Danila D. Cherkashin, Anatoly Kulikov, Andrei M. Raigorodskii:
On the chromatic numbers of small-dimensional Euclidean spaces. Discret. Appl. Math. 243: 125-131 (2018) - [e1]Anthony Bonato, Pawel Pralat, Andrei M. Raigorodskii:
Algorithms and Models for the Web Graph - 15th International Workshop, WAW 2018, Moscow, Russia, May 17-18, 2018, Proceedings. Lecture Notes in Computer Science 10836, Springer 2018, ISBN 978-3-319-92870-8 [contents] - 2017
- [j16]Chuanqi Xiao, Haiyan Chen, Andrei M. Raigorodskii:
A connection between the Kekulé structures of pentagonal chains and the Hosoya index of caterpillar trees. Discret. Appl. Math. 232: 230-234 (2017) - [j15]Liudmila Ostroumova Prokhorenkova, Pawel Pralat, Andrei M. Raigorodskii:
Modularity in several random graph models. Electron. Notes Discret. Math. 61: 947-953 (2017) - [j14]Andrei M. Raigorodskii:
Small subgraphs in preferential attachment networks. Optim. Lett. 11(2): 249-257 (2017) - [j13]A. V. Bobu, A. E. Kupriyanov, Andrei M. Raigorodskii:
On the Number of Edges of a Uniform Hypergraph with a Range of Allowed Intersections. Probl. Inf. Transm. 53(4): 319-342 (2017) - 2016
- [j12]Lev E. Shabanov, Andrei M. Raigorodskii:
Turán Type Results for Distance Graphs. Discret. Comput. Geom. 56(3): 814-832 (2016) - [j11]Andrei M. Raigorodskii:
Combinatorial Geometry and Coding Theory. Fundam. Informaticae 145(3): 359-369 (2016) - [j10]Béla Bollobás, Bhargav P. Narayanan, Andrei M. Raigorodskii:
On the stability of the Erdős-Ko-Rado theorem. J. Comb. Theory A 137: 64-78 (2016) - [c7]Lev Bogolubsky, Pavel E. Dvurechensky, Alexander V. Gasnikov, Gleb Gusev, Yurii E. Nesterov, Andrei M. Raigorodskii, Aleksey Tikhonov, Maksim Zhukovskii:
Learning Supervised PageRank with Gradient-Based and Gradient-Free Optimization Methods. NIPS 2016: 4907-4915 - [c6]Liudmila Ostroumova Prokhorenkova, Pawel Pralat, Andrei M. Raigorodskii:
Modularity of Complex Networks Models. WAW 2016: 115-126 - 2015
- [c5]Andrei M. Raigorodskii:
Models of Random Graphs and Their Applications to the Web-Graph Analysis. RuSSIR 2015: 101-118 - [c4]Konstantin Avrachenkov, Arun Kadavankandy, Liudmila Ostroumova Prokhorenkova, Andrei M. Raigorodskii:
PageRank in Undirected Random Graphs. WAW 2015: 151-163 - [i4]Arun Kadavankandy, Konstantin Avrachenkov, Liudmila Ostroumova Prokhorenkova, Andrei M. Raigorodskii:
PageRank in undirected random graphs. CoRR abs/1511.04925 (2015) - 2013
- [j9]Andrey B. Kupavskii, Andrei M. Raigorodskii, Maria V. Titova:
New bounds for the distance Ramsey number. Discret. Math. 313(22): 2566-2574 (2013) - [j8]József Balogh, Alexandr V. Kostochka, Andrei M. Raigorodskii:
Coloring some finite sets in Rn . Discuss. Math. Graph Theory 33(1): 25-31 (2013) - [j7]Ekaterina I. Ponomarenko, Andrei M. Raigorodskii:
A new intersection theorem and its applications to bounding the chromatic numbers of spaces. Electron. Notes Discret. Math. 43: 241-245 (2013) - [j6]Ekaterina I. Ponomarenko, Andrei M. Raigorodskii:
New estimates in the problem of the number of edges in a hypergraph with forbidden intersections. Probl. Inf. Transm. 49(4): 384-390 (2013) - [c3]Andrei M. Raigorodskii:
Cliques and cycles in distance graphs and graphs of diameters. Discrete Geometry and Algebraic Combinatorics 2013 - [i3]Andrey B. Kupavskii, Andrei M. Raigorodskii, Maria V. Titova:
New bounds for the distance Ramsey number. CoRR abs/1307.0843 (2013) - 2012
- [j5]Andrei M. Raigorodskii:
On the chromatic numbers of spheres in ℝ n. Comb. 32(1): 111-123 (2012) - [c2]Maxim Zhukovskiy, Dmitry Vinogradov, Yuri Pritykin, Liudmila Ostroumova, Evgeny Grechnikov, Gleb Gusev, Pavel Serdyukov, Andrei M. Raigorodskii:
Empirical validation of the buckley-osthus model for the web host graph: degree and edge distributions. CIKM 2012: 1577-1581 - [c1]Maxim Zhukovskiy, Dmitry Vinogradov, Gleb Gusev, Pavel Serdyukov, Andrei M. Raigorodskii:
Recency-sensitive model of web page authority. CIKM 2012: 2627-2630 - [i2]Maxim Zhukovskiy, Dmitry Vinogradov, Yuri Pritykin, Liudmila Ostroumova, Evgeny Grechnikov, Gleb Gusev, Pavel Serdyukov, Andrei M. Raigorodskii:
Empirical Validation of the Buckley--Osthus Model for the Web Host Graph: Degree and Edge Distributions. CoRR abs/1208.2355 (2012) - 2010
- [i1]Andrei Kupavskii, Andrei M. Raigorodskii:
Counterexamples to Borsuk's conjecture on spheres of small radii. CoRR abs/1010.0383 (2010)
2000 – 2009
- 2009
- [j4]Andrey B. Kupavskii, Andrei M. Raigorodskii:
On the chromatic numbers of small-dimensional Euclidean spaces. Electron. Notes Discret. Math. 34: 435-439 (2009) - [j3]Andrei M. Raigorodskii, O. I. Rubanov:
Small clique and large chromatic number. Electron. Notes Discret. Math. 34: 441-445 (2009) - 2007
- [j2]Andrei M. Raigorodskii:
Borsuk's problem and the chromatic numbers of metric spaces. Electron. Notes Discret. Math. 28: 273-280 (2007) - [j1]Andrei M. Raigorodskii:
On Ramsey Type Problems in Combinatorial Geometry. Electron. Notes Discret. Math. 29: 153-157 (2007)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
