Name
Title | Citations | PageRank | Year |
|---|---|---|---|
| Covering cycles in sparse graphs | 0 | 0.34 | 2022 |
| Bootstrap percolation with inhibition | 0 | 0.34 | 2019 |
| Vertex Covering with Monochromatic Pieces of few Colours. | 0 | 0.34 | 2018 |
| Monochromatic cycle covers in random graphs. | 0 | 0.34 | 2018 |
| The Minrank of Random Graphs over Arbitrary Fields. | 0 | 0.34 | 2018 |
| Smaller Subgraphs of Minimum Degree $k$. | 0 | 0.34 | 2017 |
| A tight Erdős-Pósa function for long cycles. | 2 | 0.42 | 2017 |
| Stability for Vertex Cycle Covers. | 0 | 0.34 | 2017 |
| A general lower bound for collaborative tree exploration. | 0 | 0.34 | 2016 |
| On the Number of Graphs Without Large Cliques. | 3 | 0.46 | 2014 |