| New results on degree sequences of uniform hypergraphs S Behrens, C Erbes, M Ferrara, SG Hartke, B Reiniger, H Spinoza, ... the electronic journal of combinatorics, P14-P14, 2013 | 44 | 2013 |
| Coloring, sparseness and girth N Alon, A Kostochka, B Reiniger, DB West, X Zhu Israel Journal of Mathematics 214 (1), 315-331, 2016 | 33 | 2016 |
| A symplectic proof of a theorem of Franks B Collier, E Kerman, BM Reiniger, B Turmunkh, A Zimmer Compositio Mathematica 148 (6), 1969-1984, 2012 | 29 | 2012 |
| Dynamic coloring parameters for graphs with given genus S Loeb, T Mahoney, B Reiniger, J Wise Discrete Applied Mathematics 235, 129-141, 2018 | 28 | 2018 |
| The saturation number of induced subposets of the Boolean lattice M Ferrara, B Kay, L Kramer, RR Martin, B Reiniger, HC Smith, E Sullivan Discrete Mathematics 340 (10), 2479-2487, 2017 | 25 | 2017 |
| The game of overprescribed cops and robbers played on graphs A Bonato, X Perez-Gimenez, P Prałat, B Reiniger Graphs and Combinatorics 33, 801-815, 2017 | 20 | 2017 |
| The game saturation number of a graph JM Carraher, WB Kinnersley, B Reiniger, DB West Journal of Graph Theory 85 (2), 481-495, 2017 | 15 | 2017 |
| Perfect matchings and Hamiltonian cycles in the preferential attachment model A Frieze, X Pérez‐Giménez, P Prałat, B Reiniger Random Structures & Algorithms 54 (2), 258-288, 2019 | 12 | 2019 |
| A note on list-coloring powers of graphs N Kosar, S Petrickova, B Reiniger, E Yeager Discrete Mathematics 332, 10-14, 2014 | 12 | 2014 |
| Subhypergraphs in non-uniform random hypergraphs M Dewar, J Healy, X Pérez-Giménez, P Prałat, J Proos, B Reiniger, ... arXiv preprint arXiv:1703.07686, 2017 | 9 | 2017 |
| Subgraphs in non-uniform random hypergraphs M Dewar, J Healy, X Pérez-Giménez, P Prałat, J Proos, B Reiniger, ... Algorithms and Models for the Web Graph: 13th International Workshop, WAW …, 2016 | 7 | 2016 |
| Proportional choosability: a new list analogue of equitable coloring H Kaul, JA Mudrock, MJ Pelsmajer, B Reiniger Discrete Mathematics 342 (8), 2371-2383, 2019 | 5 | 2019 |
| The minimum number of edges in a 4-critical graph that is bipartite plus 3 edges AV Kostochka, BM Reiniger European Journal of Combinatorics 46, 89-94, 2015 | 5 | 2015 |
| A simple characterization of proportionally 2-choosable graphs H Kaul, JA Mudrock, MJ Pelsmajer, B Reiniger Graphs and Combinatorics 36, 679-687, 2020 | 3 | 2020 |
| Large subposets with small dimension B Reiniger, E Yeager Order 33, 81-84, 2016 | 3 | 2016 |
| A Generalization of the Graph Packing Theorems of Sauer-Spencer and Brandt H Kaul, B Reiniger Combinatorica, 1-10, 2022 | 1 | 2022 |
| Chv\'{a} tal-type results for degree sequence Ramsey numbers C Cox, M Ferrara, RM Martin, B Reiniger arXiv preprint arXiv:1510.04843, 2015 | 1 | 2015 |
| Coloring and constructing (hyper) graphs with restrictions BM Reiniger University of Illinois at Urbana-Champaign, 2015 | | 2015 |
