Anti-coordination Games and Stable Graph Colorings. - Jeremy Kun; Brian Powers; Lev Reyzin (SAGT, 2013)

On Coloring Resilient Graphs. - Jeremy Kun; Lev Reyzin (MFCS (2), 2014)

A Boosting Approach to Learning Graph Representations. - Rajmonda Caceres; Kevin Carter; Jeremy Kun (CoRR, 2014)

Network installation and recovery: approximation lower bounds and faster exact formulations. - Alexander Gutfraind; Jeremy Kun; Ádám Dániel Lelkes; Lev Reyzin (CoRR, 2014)

Locally Boosted Graph Aggregation for Community Detection. - Jeremy Kun; Rajmonda Caceres; Kevin Carter (CoRR, 2014)

Open Problem: Learning Quantum Circuits with Queries. - Jeremy Kun; Lev Reyzin (COLT, 2015)

On the Computational Complexity of MapReduce. - Benjamin Fish; Jeremy Kun; Ádám Dániel Lelkes; Lev Reyzin; György Turán (DISC, 2015)

Information Monitoring in Routing Networks. - David Burstein; Franklin Kenter; Jeremy Kun; Feng Shi (CoRR, 2015)

A Confidence-Based Approach for Balancing Fairness and Accuracy. - Benjamin Fish; Jeremy Kun; Ádám Dániel Lelkes (SDM, 2016)

Network installation under convex costs. - Alexander Gutfraind; Jeremy Kun; Ádám Dániel Lelkes; Lev Reyzin (J. Complex Networks, 2016)

Interception in distance-vector routing networks. - David Burstein; Franklin Kenter; Jeremy Kun; Feng Shi (J. Complex Networks, 2017)

Treedepth Bounds in Linear Colorings. - Jeremy Kun; Michael P. O'Brien; Blair D. Sullivan (WG, 2018)

Polynomial Treedepth Bounds in Linear Colorings. - Jeremy Kun; Michael P. O'Brien; Marcin Pilipczuk; Blair D. Sullivan (Algorithmica, 2021)