John Lapinskas

1. Optimal covers with Hamilton cycles in random graphs
   2012/03/17 by Dan Hefetz, Daniela Kühn, Hefetz, Dan +5 · 1 citation
   Computer Science · Engineering · Mathematics · #05C45 #05C70 #05C80 #Coding theory and cryptography #Combinatorics (math.CO) #FOS: Mathematics #Limits and Structures in Graph Theory #graph theory and CDMA systems
2. Polynomial growth in degree-dependent first passage percolation on spatial random graphs
   2023/09/21 by Júlia Komjáthy, John Lapinskas, Komjáthy, Júlia +5 · 1 citation
   Mathematics · Physics and Astronomy · Social Sciences · #05C82 #60K35 #60K50 #82B43 #91D25 #91D30 #Combinatorics (math.CO) #Complex Network Analysis Techniques #FOS: Biological sciences #FOS: Computer and information sciences #FOS: Mathematics #Human Mobility and Location-Based Analysis #Populations and Evolution (q-bio.PE) #Probability (math.PR) #Social and Information Networks (cs.SI) #Stochastic processes and statistical mechanics