Hemanshu Kaul

Publication Activity (10 Years)

Years Active: 2006-2024
Publications (10 Years): 25

Top Topics

Figure Of Merit

University Campus

Cartesian Product

Subgraph Isomorphism

Top Venues

J. Graph Theory

Publications

Hemanshu Kaul, Akash Kumar, Jeffrey A. Mudrock, Patrick Rewers, Paul Shin, Khue To
On the list color function threshold. J. Graph Theory 105 (3) (2024)
Gruia Calinescu, Hemanshu Kaul, Bahareh Kudarzi
An improved algorithm for finding maximum outerplanar subgraphs. Discret. Appl. Math. 342 (2024)
Daniel Dominik, Hemanshu Kaul, Jeffrey A. Mudrock
A note on fractional DP-coloring of graphs. Discret. Math. 347 (10) (2024)
Samantha L. Dahlberg, Hemanshu Kaul, Jeffrey A. Mudrock
An algebraic approach for counting DP-3-colorings of sparse graphs. Eur. J. Comb. 118 (2024)
Gruia Calinescu, Hemanshu Kaul, Bahareh Kudarzi
An Improved Algorithm for Finding Maximum Outerplanar Subgraphs. CoRR (2023)
Manh Vu Bui, Hemanshu Kaul, Michael Maxfield, Jeffrey A. Mudrock, Paul Shin, Seth Thomason
Non-chromatic-Adherence of the DP Color Function via Generalized Theta Graphs. Graphs Comb. 39 (3) (2023)
Hemanshu Kaul, Jeffrey A. Mudrock, Gunjan Sharma, Quinn Stratton
DP-coloring Cartesian products of graphs. J. Graph Theory 103 (2) (2023)
Hemanshu Kaul, Benjamin Reiniger
A Generalization of the Graph Packing Theorems of Sauer-Spencer and Brandt. Comb. 42 (Supplement 2) (2022)
Hemanshu Kaul, Jeffrey A. Mudrock, Tim Wagstrom
On the Equitable Choosability of the Disjoint Union of Stars. Graphs Comb. 38 (5) (2022)
Hemanshu Kaul, Adam Rumpf
A linear input dependence model for interdependent networks. Eur. J. Oper. Res. 302 (2) (2022)
Jack Becker, Jade Hewitt, Hemanshu Kaul, Michael Maxfield, Jeffrey A. Mudrock, David Spivey, Seth Thomason, Tim Wagstrom
The DP color function of joins and vertex-gluings of graphs. Discret. Math. 345 (11) (2022)
Hemanshu Kaul, Jeffrey A. Mudrock
On the chromatic polynomial and counting DP-colorings of graphs. Adv. Appl. Math. 123 (2021)
Hemanshu Kaul, Jeffrey A. Mudrock, Michael J. Pelsmajer
Partial DP-coloring of graphs. Discret. Math. 344 (4) (2021)
Adam Rumpf, Hemanshu Kaul
A Public Transit Network Optimization Model for Equitable Access to Social Services. EAAMO (2021)
Hemanshu Kaul, Adam Rumpf
A linear input dependence model for interdependent networks. CoRR (2021)
Adam Rumpf, Hemanshu Kaul
A public transit network optimization model for equitable access to social services. CoRR (2021)
Hemanshu Kaul, Jeffrey A. Mudrock
Combinatorial Nullstellensatz and DP-coloring of graphs. Discret. Math. 343 (12) (2020)
Jeong-Hyun Kang, Hemanshu Kaul
A note on the chromatic number of the square of Kneser graph K(2k+1, k). Discret. Math. 343 (1) (2020)
Hemanshu Kaul, Jeffrey A. Mudrock, Michael J. Pelsmajer, Benjamin Reiniger
A Simple Characterization of Proportionally 2-choosable Graphs. Graphs Comb. 36 (3) (2020)
Hemanshu Kaul, Jeffrey A. Mudrock
On the Chromatic Polynomial and Counting DP-Colorings. CoRR (2019)
Hemanshu Kaul, Jeffrey A. Mudrock
List Coloring a Cartesian Product with a Complete Bipartite Factor. Graphs Comb. 35 (6) (2019)
Hemanshu Kaul, Jeffrey A. Mudrock, Michael J. Pelsmajer, Benjamin Reiniger
Proportional choosability: A new list analogue of equitable coloring. Discret. Math. 342 (8) (2019)
Hemanshu Kaul, Christodoulos Mitillos
On Graph Fall-Coloring: Existence and Constructions. Graphs Comb. 35 (6) (2019)
Hemanshu Kaul, Jeffrey A. Mudrock
On the Alon-Tarsi Number and Chromatic-Choosability of Cartesian Products of Graphs. Electron. J. Comb. 26 (1) (2019)
Hemanshu Kaul, Jeffrey A. Mudrock, Michael J. Pelsmajer
Total Equitable List Coloring. Graphs Comb. 34 (6) (2018)
Sanjiv Kapoor, Hemanshu Kaul
Approximating Quadratic 0-1 Programming via SOCP. CoRR (2013)
Arthur H. Busch, Michael J. Ferrara, Stephen G. Hartke, Michael S. Jacobson, Hemanshu Kaul, Douglas B. West
-tuples. J. Graph Theory 70 (1) (2012)
Gruia Calinescu, Cristina G. Fernandes, Hemanshu Kaul, Alexander Zelikovsky
Maximum Series-Parallel Subgraph. Algorithmica 63 (1-2) (2012)
Edward C. Sewell, Sheldon H. Jacobson, Hemanshu Kaul
Reductions for the Stable Set Problem. Algorithmic Oper. Res. 6 (1) (2011)
Jeong Ok Choi, Stephen G. Hartke, Hemanshu Kaul
Distinguishing Chromatic Number of Cartesian Products of Graphs. SIAM J. Discret. Math. 24 (1) (2010)
Gruia Calinescu, Cristina G. Fernandes, Hemanshu Kaul
Maximum Series-Parallel Subgraph. WG (2009)
Hemanshu Kaul, Douglas B. West
Long Local Searches for Maximal Bipartite Subgraphs. SIAM J. Discret. Math. 22 (3) (2008)
Hemanshu Kaul, Alexandr V. Kostochka, Gexin Yu
On a graph packing conjecture by Bollobás, Eldridge and Catlin. Comb. 28 (4) (2008)
Hemanshu Kaul, Alexandr V. Kostochka
Extremal Graphs for a Graph Packing Theorem of Sauer and Spencer. Comb. Probab. Comput. 16 (3) (2007)
Diane E. Vaughan, Sheldon H. Jacobson, Hemanshu Kaul
Analyzing the performance of simultaneous generalized hill climbing algorithms. Comput. Optim. Appl. 37 (1) (2007)
Hemanshu Kaul, Sheldon H. Jacobson
model. Math. Program. 106 (2) (2006)
Hemanshu Kaul, Sheldon H. Jacobson
model: handling dependency. Math. Program. 108 (2-3) (2006)