| Amplifiers for the Moran process A Galanis, A Göbel, LA Goldberg, J Lapinskas, D Richerby Journal of the ACM (JACM) 64 (1), 1-90, 2017 | 37 | 2017 |
| Approximately counting and sampling small witnesses using a colourful decision oracle H Dell, J Lapinskas, K Meeks Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020 | 34 | 2020 |
| 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 | 33 | 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 | 27 | 2014 |
| 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 | 26 | 2018 |
| On-line Ramsey numbers of paths and cycles J Cyman, T Dzido, J Lapinskas, A Lo Electronic Journal of Combinatorics 22 (1), 2015 | 25 | 2015 |
| 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 | 21 | 2018 |
| 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 | 12 | 2017 |
| Approximately counting locally-optimal structures LA Goldberg, R Gysel, J Lapinskas Journal of Computer and System Sciences 82 (6), 1144-1160, 2016 | 12 | 2016 |
| Optimal covers with Hamilton cycles in random graphs D Hefetz, D Kühn, J Lapinskas, D Osthus Combinatorica 34 (5), 573-596, 2014 | 12 | 2014 |
| Phase Transitions of the Moran Process and Algorithmic Consequences LA Goldberg, J Lapinskas, D Richerby arXiv preprint arXiv:1804.02293, 2018 | 10* | 2018 |
| Phase transitions of the Moran process and algorithmic consequences L Ann Goldberg, J Lapinskas, D Richerby Random Structures & Algorithms, 0 | 10 | |
| Stopping explosion by penalising transmission to hubs in scale-free spatial random graphs J Komjáthy, J Lapinskas, J Lengler arXiv preprint arXiv:2004.01149, 2020 | 5 | 2020 |
| Improved Distortion and Spam Resistance for PageRank L Farach-Colton, M Farach-Colton, LA Goldberg, J Lapinskas, R Levi, ... arXiv preprint arXiv:1803.05001, 2018 | | 2018 |
| Packings and coverings with Hamilton cycles and on-line Ramsey theory JA Lapinskas University of Birmingham, 2014 | | 2014 |
