Name
Title | Citations | PageRank | Year |
|---|---|---|---|
| Rainbow Arborescence in Random Digraphs | 0 | 0.34 | 2016 |
| A note on the random greedy independent set algorithm. | 3 | 0.41 | 2016 |
| The Total Acquisition Number of Random Graphs | 0 | 0.34 | 2016 |
| Power of k Choices and Rainbow Spanning Trees in Random Graphs. | 1 | 0.41 | 2015 |
| The t-Tone Chromatic Number of Random Graphs | 1 | 0.40 | 2014 |