Global optima results for the Kauffman NK model. - Hemanshu Kaul; Sheldon H. Jacobson (Math. Program., 2006)

New global optima results for the Kauffman NK model: handling dependency. - Hemanshu Kaul; Sheldon H. Jacobson (Math. Program., 2006)

Analyzing the performance of simultaneous generalized hill climbing algorithms. - Diane E. Vaughan; Sheldon H. Jacobson; Hemanshu Kaul (Comput. Optim. Appl., 2007)

Extremal Graphs for a Graph Packing Theorem of Sauer and Spencer. - Hemanshu Kaul; Alexandr V. Kostochka (Comb. Probab. Comput., 2007)

On a graph packing conjecture by Bollobás, Eldridge and Catlin. - Hemanshu Kaul; Alexandr V. Kostochka; Gexin Yu (Comb., 2008)

Long Local Searches for Maximal Bipartite Subgraphs. - Hemanshu Kaul; Douglas B. West (SIAM J. Discret. Math., 2008)

Maximum Series-Parallel Subgraph. - Gruia Calinescu; Cristina G. Fernandes; Hemanshu Kaul (WG, 2009)

Distinguishing Chromatic Number of Cartesian Products of Graphs. - Jeong Ok Choi; Stephen G. Hartke; Hemanshu Kaul (SIAM J. Discret. Math., 2010)

Reductions for the Stable Set Problem. - Edward C. Sewell; Sheldon H. Jacobson; Hemanshu Kaul (Algorithmic Oper. Res., 2011)

Maximum Series-Parallel Subgraph. - Gruia Calinescu; Cristina G. Fernandes; Hemanshu Kaul; Alexander Zelikovsky (Algorithmica, 2012)

Packing of graphic n-tuples. - Arthur H. Busch; Michael J. Ferrara; Stephen G. Hartke; Michael S. Jacobson; Hemanshu Kaul; Douglas B. West (J. Graph Theory, 2012)

Approximating Quadratic 0-1 Programming via SOCP. - Sanjiv Kapoor; Hemanshu Kaul (CoRR, 2013)

Total Equitable List Coloring. - Hemanshu Kaul; Jeffrey A. Mudrock; Michael J. Pelsmajer (Graphs Comb., 2018)

On the Alon-Tarsi Number and Chromatic-Choosability of Cartesian Products of Graphs. - Hemanshu Kaul; Jeffrey A. Mudrock (Electron. J. Comb., 2019)

On the Chromatic Polynomial and Counting DP-Colorings. - Hemanshu Kaul; Jeffrey A. Mudrock (CoRR, 2019)

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

List Coloring a Cartesian Product with a Complete Bipartite Factor. - Hemanshu Kaul; Jeffrey A. Mudrock (Graphs Comb., 2019)

On Graph Fall-Coloring: Existence and Constructions. - Hemanshu Kaul; Christodoulos Mitillos (Graphs Comb., 2019)

A note on the chromatic number of the square of Kneser graph K(2k+1, k). - Jeong-Hyun Kang; Hemanshu Kaul (Discret. Math., 2020)

Combinatorial Nullstellensatz and DP-coloring of graphs. - Hemanshu Kaul; Jeffrey A. Mudrock (Discret. Math., 2020)

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

A Public Transit Network Optimization Model for Equitable Access to Social Services. - Adam Rumpf; Hemanshu Kaul (EAAMO, 2021)

On the chromatic polynomial and counting DP-colorings of graphs. - Hemanshu Kaul; Jeffrey A. Mudrock (Adv. Appl. Math., 2021)

Partial DP-coloring of graphs. - Hemanshu Kaul; Jeffrey A. Mudrock; Michael J. Pelsmajer (Discret. Math., 2021)

The DP color function of joins and vertex-gluings of graphs. - Jack Becker; Jade Hewitt; Hemanshu Kaul; Michael Maxfield; Jeffrey A. Mudrock; David Spivey; Seth Thomason; Tim Wagstrom (Discret. Math., 2022)

A linear input dependence model for interdependent networks. - Hemanshu Kaul; Adam Rumpf (Eur. J. Oper. Res., 2022)

On the Equitable Choosability of the Disjoint Union of Stars. - Hemanshu Kaul; Jeffrey A. Mudrock; Tim Wagstrom (Graphs Comb., 2022)

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

Non-chromatic-Adherence of the DP Color Function via Generalized Theta Graphs. - Manh Vu Bui; Hemanshu Kaul; Michael Maxfield; Jeffrey A. Mudrock; Paul Shin; Seth Thomason (Graphs Comb., 2023)

DP-coloring Cartesian products of graphs. - Hemanshu Kaul; Jeffrey A. Mudrock; Gunjan Sharma; Quinn Stratton (J. Graph Theory, 2023)

A note on fractional DP-coloring of graphs. - Daniel Dominik; Hemanshu Kaul; Jeffrey A. Mudrock (Discret. Math., 2024)

An algebraic approach for counting DP-3-colorings of sparse graphs. - Samantha L. Dahlberg; Hemanshu Kaul; Jeffrey A. Mudrock (Eur. J. Comb., 2024)

Flexible list colorings: Maximizing the number of requests satisfied. - Hemanshu Kaul; Rogers Mathew; Jeffrey A. Mudrock; Michael J. Pelsmajer (J. Graph Theory, 2024)

An improved algorithm for finding maximum outerplanar subgraphs. - Gruia Calinescu; Hemanshu Kaul; Bahareh Kudarzi (Discret. Appl. Math., 2024)

On the list color function threshold. - Hemanshu Kaul; Akash Kumar 017; Jeffrey A. Mudrock; Patrick Rewers; Paul Shin; Khue To (J. Graph Theory, 2024)

DP-Coloring of Graphs From Random Covers. - Anton Bernshteyn; Daniel Dominik; Hemanshu Kaul; Jeffrey A. Mudrock (Random Struct. Algorithms, 2025)