Hemanshu Kaul

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