Следене
Peleg Michaeli
Заглавие
Позовавания
Позовавания
Година
Color‐biased Hamilton cycles in random graphs
L Gishboliner, M Krivelevich, P Michaeli
Random Structures & Algorithms 60 (3), 289-307, 2022
192022
Discrepancies of spanning trees and Hamilton cycles
L Gishboliner, M Krivelevich, P Michaeli
Journal of Combinatorial Theory, Series B 154, 262-291, 2022
172022
Greedy maximal independent sets via local limits
M Krivelevich, T Mészáros, P Michaeli, C Shikhelman
Random Structures & Algorithms 64 (4), 986-1015, 2024
112024
The diameter of uniform spanning trees in high dimensions
P Michaeli, A Nachmias, M Shalev
Probability Theory and Related Fields 179, 261-294, 2021
92021
On the trace of random walks on random graphs
A Frieze, M Krivelevich, P Michaeli, R Peled
Proceedings of the London Mathematical Society 116 (4), 847-877, 2018
92018
Oriented discrepancy of Hamilton cycles
L Gishboliner, M Krivelevich, P Michaeli
Journal of Graph Theory 103 (4), 780-792, 2023
52023
Thresholds in random motif graphs
M Anastos, P Michaeli, S Petti
arXiv preprint arXiv:1907.12043, 2019
42019
Rigid partitions: from high connectivity to random graphs
M Krivelevich, A Lew, P Michaeli
arXiv preprint arXiv:2311.14451, 2023
32023
Discrepancies of subtrees
T Krishna, P Michaeli, M Sarantis, F Wang, Y Wang
Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 81-93, 2023
32023
Fast construction on a restricted budget
A Frieze, M Krivelevich, P Michaeli
arXiv preprint arXiv:2207.07251, 2022
32022
Small subgraphs in the trace of a random walk
M Krivelevich, P Michaeli
arXiv preprint arXiv:1605.04585, 2016
12016
Minimum degree conditions for graph rigidity
M Krivelevich, A Lew, P Michaeli
arXiv preprint arXiv:2412.14364, 2024
2024
Karp's patching algorithm on random perturbations of dense digraphs
A Frieze, P Michaeli
arXiv preprint arXiv:2209.06279, 2022
2022
Spanning trees at the connectivity threshold
Y Alon, M Krivelevich, P Michaeli
SIAM Journal on Discrete Mathematics 36 (3), 1612-1626, 2022
2022
31st International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2020)
A Asinowski, C Banderier, ML Lackner, M Wallner, F Bassino, ...
Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, 2020
2020
Системата не може да изпълни операцията сега. Опитайте отново по-късно.
Статии 1–15