default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLyuben Lichev
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j18]Sofiya Burova, Lyuben Lichev:
The semi-random tree process. Eur. J. Comb. 126: 104120 (2025)- [j17]Lyuben Lichev
:
$d$ -connectivity of the random graph with restricted budget. J. Graph Theory 108(2): 293-312 (2025) - 2024
- [j16]Lyuben Lichev, Tsvetomir Mihaylov:
Annulus Graphs in ℝd. Discret. Comput. Geom. 72(1): 379-401 (2024) - [j15]Lyuben Lichev:
Color-avoiding percolation of random graphs: Between the subcritical and the intermediate regime. Discret. Math. 347(1): 113713 (2024) - [j14]Lyuben Lichev, Sammy Luo:
Large monochromatic components in colorings of complete hypergraphs. J. Comb. Theory, Ser. A 205: 105867 (2024) - [j13]Lyuben Lichev, Dieter Mitsche, Guillem Perarnau:
Percolation on dense random graphs with given degrees. J. Comb. Theory B 167: 250-282 (2024) - [j12]Ivailo Hartarsky, Lyuben Lichev:
The Maximal Running Time of Hypergraph Bootstrap Percolation. SIAM J. Discret. Math. 38(2): 1462-1471 (2024) - 2023
- [j11]Lyuben Lichev, Dieter Mitsche:
On the Minimum Bisection of Random 3-Regular Graphs. Electron. J. Comb. 30(2) (2023) - [j10]Marco Caoduro, Lyuben Lichev:
On the boxicity of Kneser graphs and complements of line graphs. Discret. Math. 346(5): 113333 (2023) - [j9]Lyuben Lichev, Dieter Mitsche, Pawel Pralat:
Localization game for random geometric graphs. Eur. J. Comb. 108: 103616 (2023) - [j8]Lyuben Lichev, Dieter Mitsche, Lutz Warnke:
The jump of the clique chromatic number of random graphs. Random Struct. Algorithms 62(4): 1016-1034 (2023) - [c1]Stefan Glock, Felix Joos, Jaehoon Kim, Marcus Kühn, Lyuben Lichev:
Conflict-free hypergraph matchings. SODA 2023: 2991-3005 - [i6]Marcos Kiwi, Lyuben Lichev, Dieter Mitsche, Pawel Pralat:
Label propagation on binomial random graphs. CoRR abs/2302.03569 (2023) - [i5]Alberto Espuny Díaz, Lyuben Lichev, Dieter Mitsche, Alexandra Wesolek:
Sharp threshold for embedding balanced spanning trees in random geometric graphs. CoRR abs/2303.14229 (2023) - 2022
- [j7]Johannes Carmesin, Lyuben Lichev:
New Constructions Related to the Polynomial Sphere Recognition Problem. Discret. Comput. Geom. 67(4): 1097-1123 (2022) - [j6]Louis Esperet, Lyuben Lichev:
Local boxicity. Eur. J. Comb. 102: 103495 (2022) - [j5]Lyuben Lichev:
The giant component after percolation of product graphs. J. Graph Theory 99(4): 651-670 (2022) - [j4]Lyuben Lichev, Dieter Mitsche:
On the modularity of 3-regular random graphs and random graphs with given degree sequences. Random Struct. Algorithms 61(4): 754-802 (2022) - [j3]Nicolas Fraiman, Lyuben Lichev, Dieter Mitsche:
On the Power of Choice for Boolean Functions. SIAM J. Discret. Math. 36(3): 1943-1954 (2022) - [i4]Josep Díaz, Lyuben Lichev, Bas Lodewijks:
Dynamic random graphs with vertex removal. CoRR abs/2207.05046 (2022) - [i3]Lyuben Lichev:
Lower bound on the running time of Pop-Stack Sorting on a random permutation. CoRR abs/2212.09316 (2022) - 2021
- [j2]Lyuben Lichev:
A Note on the Erdős-Szekeres Theorem in Two Dimensions. Electron. J. Comb. 28(2): 2 (2021) - [j1]Lyuben Lichev:
On the chromatic number of the preferential attachment graph. Eur. J. Comb. 96: 103365 (2021) - [i2]Lyuben Lichev, Dieter Mitsche, Lutz Warnke:
The jump of the clique chromatic number of random graphs. CoRR abs/2105.12168 (2021) - [i1]Nicolas Fraiman, Lyuben Lichev, Dieter Mitsche:
On the power of choice for Boolean functions. CoRR abs/2109.13079 (2021)
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-03-04 21:17 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:
