Online Ramsey games for triangles in random graphs. - József Balogh; Jane Butterfield (Discret. Math., 2010)

On-line Ramsey Theory for Bounded Degree Graphs. - Jane Butterfield; Tracy Grauman; William B. Kinnersley; Kevin G. Milans; Christopher J. Stocker; Douglas B. West (Electron. J. Comb., 2011)

Excluding induced subgraphs: Critical graphs. - József Balogh; Jane Butterfield (Random Struct. Algorithms, 2011)

Revolutionaries and spies: Spy-good and spy-bad graphs. - Jane Butterfield; Daniel W. Cranston; Gregory J. Puleo; Douglas B. West; Reza Zamani (Theor. Comput. Sci., 2012)

Line-of-Sight Pursuit in Strictly Sweepable Polygons. - Lindsay Berry; Andrew Beveridge; Jane Butterfield; Volkan Isler; Zachary Keller; Alana Shine; Junyi Wang (CoRR, 2015)

On the Chromatic Thresholds of Hypergraphs. - József Balogh; Jane Butterfield; Ping Hu 004; John Lenz; Dhruv Mubayi (Comb. Probab. Comput., 2016)

Mantel's theorem for random hypergraphs. - József Balogh; Jane Butterfield; Ping Hu 004; John Lenz (Random Struct. Algorithms, 2016)

Line-of-Sight Pursuit in Monotone and Scallop Polygons. - Lindsay Berry; Andrew Beveridge; Jane Butterfield; Volkan Isler; Zachary Keller; Alana Shine; Junyi Wang (Int. J. Comput. Geom. Appl., 2019)