Amplifiers for the Moran process A Galanis, A Göbel, LA Goldberg, J Lapinskas, D Richerby Journal of the ACM (JACM) 64 (1), 5, 2017 | 26 | 2017 |

Optimal packings of Hamilton cycles in graphs of high minimum degree D Kühn, J Lapinskas, D Osthus Combinatorics, Probability and Computing 22 (3), 394-416, 2013 | 26 | 2013 |

Proof of a conjecture of Thomassen on Hamilton cycles in highly connected tournaments D Kühn, J Lapinskas, D Osthus, V Patel Proceedings of the London Mathematical Society 109 (3), 733-762, 2014 | 21 | 2014 |

Optimal covers with Hamilton cycles in random graphs D Hefetz, D Kühn, J Lapinskas, D Osthus Combinatorica 34 (5), 573-596, 2014 | 13 | 2014 |

Asymptotically optimal amplifiers for the Moran process LA Goldberg, J Lapinskas, J Lengler, F Meier, K Panagiotou, P Pfister Theoretical Computer Science 58, 73-93, 2018 | 12 | 2018 |

Fine-grained reductions from approximate counting to decision H Dell, J Lapinskas Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018 | 9 | 2018 |

Approximately counting locally-optimal structures LA Goldberg, R Gysel, J Lapinskas Journal of Computer and System Sciences 82 (6), 1144-1160, 2016 | 9 | 2016 |

On-line Ramsey numbers of paths and cycles J Cyman, T Dzido, J Lapinskas, A Lo Electronic Journal of Combinatorics 22 (1), 2015 | 9 | 2015 |

A fixed-parameter perspective on# BIS R Curticapean, H Dell, F Fomin, LA Goldberg, J Lapinskas The 12th International Symposium on Parameterized and Exact Computation …, 2017 | 4 | 2017 |

Phase Transitions of the Moran Process and Algorithmic Consequences LA Goldberg, J Lapinskas, D Richerby arXiv preprint arXiv:1804.02293, 2018 | | 2018 |

Packings and coverings with Hamilton cycles and on-line Ramsey theory JA Lapinskas University of Birmingham, 2014 | | 2014 |