Restreaming graph partitioning: simple versatile algorithms for advanced balancing. - Joel Nishimura; Johan Ugander (KDD, 2013)

Uniformly sampling graphs with self-loops and a given degree sequence. - Joel Nishimura (CoRR, 2017)

The connectivity of graphs of graphs with self-loops and a given degree sequence. - Joel Nishimura (J. Complex Networks, 2018)

Configuring Random Graph Models with Fixed Degree Sequences. - Bailey K. Fosdick; Daniel B. Larremore; Joel Nishimura; Johan Ugander (SIAM Rev., 2018)

Modeling social and lunar coordination in the spawning behavior of Fundulus heteroclitus. - Oscar Goodloe; Joel Nishimura (Commun. Nonlinear Sci. Numer. Simul., 2019)

Implication Avoiding Dynamics for Externally Observed Networks. - Joel Nishimura; Oscar Goodloe (CoRR, 2019)

Consistency dynamics in accusation-endorsement networks with an external judge. - Joel Nishimura; Oscar Goodloe (J. Complex Networks, 2020)

Classically boosted network embeddings. - Joel Nishimura; Yunpeng Zhao (J. Complex Networks, 2021)

Gauging node consistency in accusation-endorsement networks. - Oscar Goodloe; Zihan Zhou 016; Joel Nishimura (J. Complex Networks, 2022)

The Emergence of League and Sub-League Structure in the Population Lotto Game. - Giovanni Artiglio; Aiden Youkhana; Joel Nishimura (CoRR, 2022)

Why You Should Be Able to Make Your Own Individualized, Digital Nano-Currency. - Wesley Sheh; Joel Nishimura (Commun. ACM, 2023)

The Population Lotto Game: how strategic resource allocation structures non-transitive outcomes in pairwise competitions. - Giovanni Artiglio; Aiden Youkhana; Joel Nishimura (Int. J. Game Theory, 2024)