New Results on Degree Sequences of Uniform Hypergraphs. - Sarah Behrens; Catherine Erbes; Michael Ferrara; Stephen G. Hartke; Benjamin Reiniger; Hannah Spinoza; Charles Tomlinson (Electron. J. Comb., 2013)

A note on list-coloring powers of graphs. - Nicholas Kosar; Sárka Petrícková; Benjamin Reiniger; Elyse Yeager (Discret. Math., 2014)

The minimum number of edges in a 4-critical graph that is bipartite plus 3 edges. - Alexandr V. Kostochka; Benjamin Reiniger (Eur. J. Comb., 2015)

Subgraphs in Non-uniform Random Hypergraphs. - Megan Dewar; John Healy; Xavier Pérez-Giménez; Pawel Pralat; John Proos; Benjamin Reiniger; Kirill Ternovsky (WAW, 2016)

Large Subposets with Small Dimension. - Benjamin Reiniger; Elyse Yeager (Order, 2016)

The saturation number of induced subposets of the Boolean lattice. - Michael Ferrara; Bill Kay; Lucas Kramer; Ryan R. Martin; Benjamin Reiniger; Heather C. Smith; Eric Sullivan (Discret. Math., 2017)

The Game of Overprescribed Cops and Robbers Played on Graphs. - Anthony Bonato; Xavier Pérez-Giménez; Pawel Pralat; Benjamin Reiniger (Graphs Comb., 2017)

The Game Saturation Number of a Graph. - James M. Carraher; William B. Kinnersley; Benjamin Reiniger; Douglas B. West (J. Graph Theory, 2017)

Dynamic coloring parameters for graphs with given genus. - Sarah Loeb; Thomas Mahoney; Benjamin Reiniger; Jennifer Wise (Discret. Appl. Math., 2018)

Subhypergraphs in non-uniform random hypergraphs. - Megan Dewar; Kirill Ternovsky; Benjamin Reiniger; John Proos; Pawel Pralat; Xavier Pérez-Giménez; John Healy (Internet Math., 2018)

Proportional choosability: A new list analogue of equitable coloring. - Hemanshu Kaul; Jeffrey A. Mudrock; Michael J. Pelsmajer; Benjamin Reiniger (Discret. Math., 2019)

Perfect matchings and Hamiltonian cycles in the preferential attachment model. - Alan M. Frieze; Xavier Pérez-Giménez; Pawel Pralat; Benjamin Reiniger (Random Struct. Algorithms, 2019)

A Simple Characterization of Proportionally 2-choosable Graphs. - Hemanshu Kaul; Jeffrey A. Mudrock; Michael J. Pelsmajer; Benjamin Reiniger (Graphs Comb., 2020)

A Generalization of the Graph Packing Theorems of Sauer-Spencer and Brandt. - Hemanshu Kaul; Benjamin Reiniger (Comb., 2022)