Optimal Packings of Hamilton Cycles in Graphs of High Minimum Degree. - Daniela Kühn; John Lapinskas; Deryk Osthus (Comb. Probab. Comput., 2013)

Optimal covers with Hamilton cycles in random graphs. - Dan Hefetz; Daniela Kühn; John Lapinskas; Deryk Osthus (Comb., 2014)

On-line Ramsey Numbers of Paths and Cycles. - Joanna Cyman; Tomasz Dzido; John Lapinskas; Allan Lo (Electron. J. Comb., 2015)

Approximately counting locally-optimal structures. - Leslie Ann Goldberg; Rob Gysel; John Lapinskas (J. Comput. Syst. Sci., 2016)

Amplifiers for the Moran Process. - Andreas Galanis; Andreas Göbel 001; Leslie Ann Goldberg; John Lapinskas; David Richerby (J. ACM, 2017)

A Fixed-Parameter Perspective on #BIS. - Radu Curticapean; Holger Dell; Fedor V. Fomin; Leslie Ann Goldberg; John Lapinskas (Algorithmica, 2019)

Asymptotically optimal amplifiers for the Moran process. - Leslie Ann Goldberg; John Lapinskas; Johannes Lengler; Florian Meier 002; Konstantinos Panagiotou; Pascal Pfister (Theor. Comput. Sci., 2019)

Approximately counting and sampling small witnesses using a colourful decision oracle. - Holger Dell; John Lapinskas; Kitty Meeks (SODA, 2020)

Stopping explosion by penalising transmission to hubs in scale-free spatial random graphs. - Júlia Komjáthy; John Lapinskas; Johannes Lengler (CoRR, 2020)

Phase transitions of the Moran process and algorithmic consequences. - Leslie Ann Goldberg; John Lapinskas; David Richerby (Random Struct. Algorithms, 2020)

Faster exponential-time algorithms for approximately counting independent sets. - Leslie Ann Goldberg; John Lapinskas; David Richerby (Theor. Comput. Sci., 2021)

Fine-Grained Reductions from Approximate Counting to Decision. - Holger Dell; John Lapinskas (ACM Trans. Comput. Theory, 2021)

Approximately Counting and Sampling Small Witnesses Using a Colorful Decision Oracle. - Holger Dell; John Lapinskas; Kitty Meeks (SIAM J. Comput., 2022)

Graph Ranking and the Cost of Sybil Defense. - Gwendolyn Farach-Colton; Martin Farach-Colton; Leslie Ann Goldberg; Hanna Komlós; John Lapinskas; Reut Levi; Moti Medina; Miguel A. Mosteiro (EC, 2023)

Four universal growth regimes in degree-dependent first passage percolation on spatial random graphs I. - Júlia Komjáthy; John Lapinskas; Johannes Lengler; Ulysse Schaller (CoRR, 2023)

Four universal growth regimes in degree-dependent first passage percolation on spatial random graphs II. - Júlia Komjáthy; John Lapinskas; Johannes Lengler; Ulysse Schaller (CoRR, 2023)

Nearly Optimal Independence Oracle Algorithms for Edge Estimation in Hypergraphs. - Holger Dell; John Lapinskas; Kitty Meeks (ICALP, 2024)

Instability of backoff protocols with arbitrary arrival rates. - Leslie Ann Goldberg; John Lapinskas (J. Comput. Syst. Sci., 2025)