Hemanshu Kaul

发表

Analyzing the performance of simultaneous generalized hill climbing algorithms

Sheldon H. Jacobson, Diane E. Vaughan, Hemanshu Kaul, 2007, Comput. Optim. Appl..

Maximum Series-Parallel Subgraph

Cristina G. Fernandes, Gruia Calinescu, Hemanshu Kaul, 2009, WG.

A note on the chromatic number of the square of Kneser graph K(2k+1, k)

Hemanshu Kaul, Jeong-Hyun Kang, 2020, Discret. Math..

A Simple Characterization of Proportionally 2-choosable Graphs

Michael J. Pelsmajer, Hemanshu Kaul, Jeffrey A. Mudrock, 2020, Graphs Comb..

Distinguishing Chromatic Number of Cartesian Products of Graphs

Stephen G. Hartke, Hemanshu Kaul, Jeong Ok Choi, 2010, SIAM J. Discret. Math..

Long Local Searches for Maximal Bipartite Subgraphs

Douglas B. West, Hemanshu Kaul, 2008, SIAM J. Discret. Math..

Combinatorial Nullstellensatz and DP-coloring of graphs

Hemanshu Kaul, Jeffrey A. Mudrock, 2020, Discret. Math..

New Methodology for Transportation Investment Decisions with Consideration of Project Interdependencies

Bei Zhou, Sang Hyuk Lee, Hemanshu Kaul, 2012 .

Global optima results for the Kauffman NK model

Sheldon H. Jacobson, Hemanshu Kaul, S. Jacobson, 2006, Math. Program..

Proportional choosability: A new list analogue of equitable coloring

Michael J. Pelsmajer, Hemanshu Kaul, Jeffrey A. Mudrock, 2018, Discret. Math..

Extremal Graphs for a Graph Packing Theorem of Sauer and Spencer

Alexandr V. Kostochka, Hemanshu Kaul, 2007, Comb. Probab. Comput..

Approximating Quadratic 0-1 Programming via SOCP pdf

Hemanshu Kaul, Sanjiv Kapoor, 2013, ArXiv.

On the Chromatic Polynomial and Counting DP-Colorings

Hemanshu Kaul, Jeffrey A. Mudrock, Hemanshu Kaul, 2019, Adv. Appl. Math..

On the Alon-Tarsi Number and Chromatic-Choosability of Cartesian Products of Graphs

Hemanshu Kaul, Jeffrey A. Mudrock, Hemanshu Kaul, 2018, Electron. J. Comb..

New global optima results for the Kauffman NK model: handling dependency

Sheldon H. Jacobson, Hemanshu Kaul, S. Jacobson, 2006, Math. Program..

On a graph packing conjecture by Bollobás, Eldridge and Catlin

Alexandr V. Kostochka, Gexin Yu, Hemanshu Kaul, 2008, Comb..

Total Equitable List Coloring

Michael J. Pelsmajer, Hemanshu Kaul, Jeffrey A. Mudrock, 2018, Graphs Comb..

Packing of graphic n-tuples

Michael S. Jacobson, Stephen G. Hartke, Douglas B. West, 2012, J. Graph Theory.

List Coloring a Cartesian Product with a Complete Bipartite Factor

Hemanshu Kaul, Jeffrey A. Mudrock, Hemanshu Kaul, 2018, Graphs and Combinatorics.

On Graph Fall-Coloring: Existence and Constructions

Christodoulos Mitillos, Hemanshu Kaul, Hemanshu Kaul, 2019, Graphs and Combinatorics.

Maximum Series-Parallel Subgraph

Cristina G. Fernandes, Gruia Calinescu, Alex Zelikovsky, 2011, Algorithmica.

Reductions for the Stable Set Problem

Sheldon H. Jacobson, Hemanshu Kaul, Edward C. Sewell, 2011, Algorithmic Oper. Res..

A linear input dependence model for interdependent networks pdf

Hemanshu Kaul, Adam Rumpf, Hemanshu Kaul, 2021, Eur. J. Oper. Res..

The DP Color Function of Joins and Vertex-Gluings of Graphs

Hemanshu Kaul, Jeffrey A. Mudrock, Jack Becker, 2021 .

A Public Transit Network Optimization Model for Equitable Access to Social Services

Hemanshu Kaul, Adam Rumpf, Hemanshu Kaul, 2021, EAAMO.

DP-Coloring Cartesian Products of Graphs

Hemanshu Kaul, Jeffrey A. Mudrock, Gunjan Sharma, 2021 .

Partial DP-coloring of graphs

Michael J. Pelsmajer, Hemanshu Kaul, Jeffrey A. Mudrock, 2021, Discret. Math..

Longitudinal network models and permutation‐uniform Markov chains

Hemanshu Kaul, William K. Schwartz, Sonja Petrovi'c, 2021, Scandinavian Journal of Statistics.

The DP Color Function of Clique-Gluings of Graphs

Hemanshu Kaul, Jeffrey A. Mudrock, Michael Maxfield, 2021, 2112.05316.

A Generalization of the Graph Packing Theorems of Sauer-Spencer and Brandt

Hemanshu Kaul, Benjamin Reiniger, Hemanshu Kaul, 2021, Combinatorica.

Non-chromatic-Adherence of the DP Color Function via Generalized Theta Graphs

Hemanshu Kaul, Jeffrey A. Mudrock, Michael Maxfield, 2021, Graphs and Combinatorics.