| Packing of graphic n‐tuples AH Busch, MJ Ferrara, SG Hartke, MS Jacobson, H Kaul, DB West Journal of Graph Theory 70 (1), 29-39, 2012 | 39 | 2012 |
| Distinguishing chromatic number of Cartesian products of graphs JO Choi, SG Hartke, H Kaul SIAM Journal on Discrete Mathematics 24 (1), 82-100, 2010 | 27 | 2010 |
| Global optima results for the Kauffman NK model H Kaul, SH Jacobson Mathematical programming 106, 319-338, 2006 | 27 | 2006 |
| New global optima results for the Kauffman NK model: handling dependency H Kaul, SH Jacobson Mathematical programming 108, 475-494, 2006 | 26 | 2006 |
| On the chromatic polynomial and counting DP-colorings of graphs H Kaul, JA Mudrock Advances in Applied Mathematics 123, 102131, 2021 | 25 | 2021 |
| On a graph packing conjecture by Bollobás, Eldridge and Catlin H Kaul, A Kostochka, G Yu Combinatorica 28, 469-485, 2008 | 21 | 2008 |
| Extremal graphs for a graph packing theorem of Sauer and Spencer H Kaul, A Kostochka Combinatorics, Probability and Computing 16 (3), 409-416, 2007 | 19 | 2007 |
| Combinatorial Nullstellensatz and DP-coloring of Graphs H Kaul, JA Mudrock Discrete Mathematics 343 (12), 112115, 2020 | 16 | 2020 |
| Criticality, the list color function, and list coloring the Cartesian product of graphs H Kaul, JA Mudrock arXiv preprint arXiv:1805.02147, 2018 | 15 | 2018 |
| DP‐coloring Cartesian products of graphs H Kaul, JA Mudrock, G Sharma, Q Stratton Journal of Graph Theory 103 (2), 285-306, 2023 | 14 | 2023 |
| The DP color function of joins and vertex-gluings of graphs J Becker, J Hewitt, H Kaul, M Maxfield, JA Mudrock, D Spivey, ... Discrete Mathematics 345 (11), 113093, 2022 | 14 | 2022 |
| On the Alon-Tarsi Number and Chromatic-Choosability of Cartesian Products of Graphs H Kaul, JA Mudrock arXiv preprint arXiv:1803.07455, 2018 | 14 | 2018 |
| New methodology for transportation investment decisions with consideration of project interdependencies Z Li, H Kaul, S Kapoor, E Veliou, B Zhou, SH Lee Transportation research record 2285 (1), 36-46, 2012 | 14 | 2012 |
| On polynomial representations of the DP color function: theta graphs and their generalizations C Halberg, H Kaul, A Liu, JA Mudrock, P Shin, S Thomason arXiv preprint arXiv:2012.12897, 2020 | 11 | 2020 |
| Maximum series-parallel subgraph G Călinescu, CG Fernandes, H Kaul, A Zelikovsky Algorithmica 63 (1), 137-157, 2012 | 10 | 2012 |
| On graph fall-coloring: Existence and constructions H Kaul, C Mitillos Graphs and Combinatorics 35 (6), 1633-1646, 2019 | 8 | 2019 |
| Analyzing the performance of simultaneous generalized hill climbing algorithms DE Vaughan, SH Jacobson, H Kaul Computational Optimization and Applications 37, 103-119, 2007 | 7 | 2007 |
| On the list color function threshold H Kaul, A Kumar, JA Mudrock, P Rewers, P Shin, K To Journal of Graph Theory 105 (3), 386-397, 2024 | 6 | 2024 |
| Total equitable list coloring H Kaul, JA Mudrock, MJ Pelsmajer Graphs and Combinatorics 34, 1637-1649, 2018 | 6 | 2018 |
| An algebraic approach for counting DP-3-colorings of sparse graphs SL Dahlberg, H Kaul, JA Mudrock European Journal of Combinatorics 118, 103890, 2024 | 5 | 2024 |
