default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDmitry A. Shabanov
Person information
- affiliation: Lomonosov Moscow State University, Russia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j28]Aliaksei Semchankau, Dmitry A. Shabanov, Ilya D. Shkredov
:
Number of A+B≠C solutions in abelian groups and application to counting independent sets in hypergraphs. Eur. J. Comb. 100: 103453 (2022)- [j27]A. S. Semenov, Dmitry A. Shabanov:
Bounds on Threshold Probabilities for Coloring Properties of Random Hypergraphs. Probl. Inf. Transm. 58(1): 72-101 (2022) - 2021
- [j26]Arseniy E. Balobanov, Dmitry A. Shabanov:
On the strong chromatic number of a random 3-uniform hypergraph. Discret. Math. 344(3): 112231 (2021) - [j25]Lech Duraj, Jakub Kozik, Dmitry A. Shabanov:
Random hypergraphs and property B. Eur. J. Comb. 91: 103205 (2021) - [i4]Lech Duraj, Jakub Kozik, Dmitry A. Shabanov:
Random hypergraphs and property B. CoRR abs/2102.12968 (2021) - 2020
- [j24]Margarita Akhmejanova, Dmitry A. Shabanov:
Equitable colorings of hypergraphs with few edges. Discret. Appl. Math. 276: 2-12 (2020) - [j23]Alexander Semenov, Dmitry A. Shabanov:
On the weak chromatic number of random hypergraphs. Discret. Appl. Math. 276: 134-154 (2020) - [j22]Dmitry A. Shabanov:
Estimating the r-colorability threshold for a random hypergraph. Discret. Appl. Math. 282: 168-183 (2020) - [j21]Margarita Akhmejanova, Dmitry A. Shabanov:
Coloring hypergraphs with bounded cardinalities of edge intersections. Discret. Math. 343(4): 111692 (2020)
2010 – 2019
- 2019
- [j20]Dmitry Kravstov, Nikolay Krokhmal, Dmitry A. Shabanov:
Panchromatic 3-colorings of random hypergraphs. Eur. J. Comb. 78: 28-43 (2019) - 2018
- [j19]Andrey Kupavskii, Dmitry A. Shabanov:
Colourings of Uniform Hypergraphs with Large Girth and Applications. Comb. Probab. Comput. 27(2): 245-273 (2018) - [j18]A. S. Semenov, Dmitry A. Shabanov:
General Independence Sets in Random Strongly Sparse Hypergraphs. Probl. Inf. Transm. 54(1): 56-69 (2018) - 2017
- [j17]Margarita Akhmejanova, Dmitry A. Shabanov:
Colorings of b-simple hypergraphs. Electron. Notes Discret. Math. 61: 29-35 (2017) - [j16]Dmitry Kravtsov, Nikolay Krokhmal, Dmitry A. Shabanov:
Panchromatic 3-coloring of a random hypergraph. Electron. Notes Discret. Math. 61: 781-787 (2017) - 2016
- [j15]Ilia Akolzin, Dmitry A. Shabanov:
Colorings of hypergraphs with large number of colors. Discret. Math. 339(12): 3020-3031 (2016) - [j14]Jakub Kozik, Dmitry A. Shabanov:
Improved algorithms for colorings of simple hypergraphs and applications. J. Comb. Theory B 116: 312-332 (2016) - 2015
- [j13]Dmitry A. Shabanov:
Around Erdős-Lovász problem on colorings of non-uniform hypergraphs. Discret. Math. 338(11): 1976-1981 (2015) - [j12]Dmitry A. Shabanov:
Equitable two-colorings of uniform hypergraphs. Eur. J. Comb. 43: 185-203 (2015) - [j11]Ilia Akolzin, Dmitry A. Shabanov:
Colorings of hypergraphs with large number of colors. Electron. Notes Discret. Math. 49: 407-411 (2015) - [j10]Jakub Kozik, Dmitry A. Shabanov:
Extremal problems for colorings of simple hypergraphs and applications. Electron. Notes Discret. Math. 49: 441-445 (2015) - 2014
- [j9]Dmitry A. Shabanov:
Coloring Non-uniform Hypergraphs Without Short Cycles. Graphs Comb. 30(5): 1249-1260 (2014) - [j8]Larisa Afanasyeva, Dmitry Korshunov, Dmitry A. Shabanov:
A special issue on the Boris V. Gnedenko Centennial. Queueing Syst. Theory Appl. 76(2): 111-112 (2014) - [i3]Jakub Kozik, Dmitry A. Shabanov:
Improved algorithms for colorings of simple hypergraphs and applications. CoRR abs/1409.6921 (2014) - 2013
- [j7]Andrey Kupavskii, Liudmila Ostroumova, Dmitry A. Shabanov, Prasad Tetali:
The Distribution of Second Degrees in the Buckley-Osthus Random Graph Model. Internet Math. 9(4): 297-335 (2013) - [i2]Andrey Kupavskii, Liudmila Ostroumova, Dmitry A. Shabanov, Prasad Tetali:
The distribution of second degrees in the Buckley-Osthus random graph model. CoRR abs/1304.5715 (2013) - 2012
- [j6]Dmitry A. Shabanov:
On r-chromatic hypergraphs. Discret. Math. 312(2): 441-458 (2012) - [j5]Dmitry A. Shabanov:
Random coloring method in the combinatorial problem of Erdős and Lovász. Random Struct. Algorithms 40(2): 227-253 (2012) - 2011
- [j4]Anastasia P. Rozovskaya, Dmitry A. Shabanov:
On colorings of non-uniform hypergraphs without short cycles. Electron. Notes Discret. Math. 38: 749-754 (2011) - [j3]Dmitry A. Shabanov:
On a generalization of Rubin's theorem. J. Graph Theory 67(3): 226-234 (2011) - [i1]Andrei Kupavskii, Dmitry A. Shabanov:
On r-colorability of random hypergraphs. CoRR abs/1110.1249 (2011)
2000 – 2009
- 2009
- [j2]Anastasia P. Rozovskaya, Dmitry A. Shabanov:
On the Problem of Erdos and Hajnal in the Case of List Colorings. Electron. Notes Discret. Math. 34: 387-391 (2009) - 2007
- [j1]Dmitry A. Shabanov:
On Some Extremal Properties of Hypergraph Colorings. Electron. Notes Discret. Math. 29: 97-100 (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 2025-01-21 00:07 CET 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:
