Lyuben Lichev

28 papers A* 1Journal 27
YearRankTypeTitle / Venue / Authors
2026 J jnl
Random spanning trees and forests: a geometric focus.
Comput. Sci. Rev.
Lyuben Lichev, Dieter Mitsche, Xavier Pérez-Giménez
2025 J jnl
$d$ -connectivity of the random graph with restricted budget.
J. Graph Theory
Lyuben Lichev
2025 J jnl
Random Zero-Sum Dynamic Games on Infinite Directed Graphs.
Dyn. Games Appl.
Luc Attia, Lyuben Lichev, Dieter Mitsche, Raimundo Saona, Bruno Ziliotto
2025 J jnl
The semi-random tree process.
Eur. J. Comb.
Sofiya Burova, Lyuben Lichev
2024 J jnl
Annulus Graphs in ℝ
Discret. Comput. Geom.
Lyuben Lichev, Tsvetomir Mihaylov
2024 J jnl
Color-avoiding percolation of random graphs: Between the subcritical and the intermediate regime.
Discret. Math.
Lyuben Lichev
2024 J jnl
Large monochromatic components in colorings of complete hypergraphs.
J. Comb. Theory, Ser. A
Lyuben Lichev, Sammy Luo
2024 J jnl
Percolation on dense random graphs with given degrees.
J. Comb. Theory B
Lyuben Lichev, Dieter Mitsche, Guillem Perarnau
2024 J jnl
Sharp threshold for embedding balanced spanning trees in random geometric graphs.
J. Graph Theory
Alberto Espuny Díaz, Lyuben Lichev, Dieter Mitsche, Alexandra Wesolek
2024 J jnl
The Maximal Running Time of Hypergraph Bootstrap Percolation.
SIAM J. Discret. Math.
Ivailo Hartarsky, Lyuben Lichev
2023 A* conf
Conflict-free hypergraph matchings.
SODA
Stefan Glock, Felix Joos, Jaehoon Kim, Marcus Kühn, Lyuben Lichev
2023 J jnl
Label propagation on binomial random graphs.
CoRR
Marcos Kiwi, Lyuben Lichev, Dieter Mitsche, Pawel Pralat
2023 J jnl
Localization game for random geometric graphs.
Eur. J. Comb.
Lyuben Lichev, Dieter Mitsche, Pawel Pralat
2023 J jnl
On the Minimum Bisection of Random 3-Regular Graphs.
Electron. J. Comb.
Lyuben Lichev, Dieter Mitsche
2023 J jnl
On the boxicity of Kneser graphs and complements of line graphs.
Discret. Math.
Marco Caoduro, Lyuben Lichev
2023 J jnl
Sharp threshold for embedding balanced spanning trees in random geometric graphs.
CoRR
Alberto Espuny Díaz, Lyuben Lichev, Dieter Mitsche, Alexandra Wesolek
2023 J jnl
The jump of the clique chromatic number of random graphs.
Random Struct. Algorithms
Lyuben Lichev, Dieter Mitsche, Lutz Warnke
2022 J jnl
Dynamic random graphs with vertex removal.
CoRR
Josep Díaz, Lyuben Lichev, Bas Lodewijks
2022 J jnl
Local boxicity.
Eur. J. Comb.
Louis Esperet, Lyuben Lichev
2022 J jnl
Lower bound on the running time of Pop-Stack Sorting on a random permutation.
CoRR
Lyuben Lichev
2022 J jnl
New Constructions Related to the Polynomial Sphere Recognition Problem.
Discret. Comput. Geom.
Johannes Carmesin, Lyuben Lichev
2022 J jnl
On the Power of Choice for Boolean Functions.
SIAM J. Discret. Math.
Nicolas Fraiman, Lyuben Lichev, Dieter Mitsche
2022 J jnl
On the modularity of 3-regular random graphs and random graphs with given degree sequences.
Random Struct. Algorithms
Lyuben Lichev, Dieter Mitsche
2022 J jnl
The giant component after percolation of product graphs.
J. Graph Theory
Lyuben Lichev
2021 J jnl
A Note on the Erdős-Szekeres Theorem in Two Dimensions.
Electron. J. Comb.
Lyuben Lichev
2021 J jnl
On the chromatic number of the preferential attachment graph.
Eur. J. Comb.
Lyuben Lichev
2021 J jnl
On the power of choice for Boolean functions.
CoRR
Nicolas Fraiman, Lyuben Lichev, Dieter Mitsche
2021 J jnl
The jump of the clique chromatic number of random graphs.
CoRR
Lyuben Lichev, Dieter Mitsche, Lutz Warnke