×

zbMATH — the first resource for mathematics

Kaul, Hemanshu

Compute Distance To:
Author ID: kaul.hemanshu Recent zbMATH articles by "Kaul, Hemanshu"
Published as: Kaul, H.; Kaul, Hemanshu
External Links: MGP · Wikidata
Documents Indexed: 21 Publications since 2004

Publications by Year

Citations contained in zbMATH

12 Publications have been cited 44 times in 37 Documents Cited by Year
Packing of graphic \(n\)-tuples. Zbl 1243.05191
Busch, Arthur H.; Ferrara, Michael J.; Hartke, Stephen G.; Jacobson, Michael S.; Kaul, Hemanshu; West, Douglas B.
8
2012
Distinguishing chromatic number of Cartesian products of graphs. Zbl 1216.05030
Choi, Jeong Ok; Hartke, Stephen G.; Kaul, Hemanshu
8
2010
Extremal graphs for a graph packing theorem of Sauer and Spencer. Zbl 1117.05057
Kaul, Hemanshu; Kostochka, Alexandr
8
2007
On a graph packing conjecture by Bollobás, Eldridge and Catlin. Zbl 1212.05132
Kaul, Hemanshu; Kostochka, Alexandr; Yu, Gexin
5
2008
New global optima results for the Kauffman \(NK\) model: Handling dependency. Zbl 1130.90376
Kaul, Hemanshu; Jacobson, Sheldon H.
5
2006
On graph fall-coloring – operators and heredity. Zbl 1403.05119
Kaul, Hemanshu; Mitillos, Christodoulos
2
2018
Maximum series-parallel subgraph. Zbl 1236.68293
Călinescu, Gruia; Fernandes, Cristina G.; Kaul, Hemanshu; Zelikovsky, Alexander
2
2012
Global optima results for the Kauffman \(NK\) model. Zbl 1134.90473
Kaul, Hemanshu; Jacobson, Sheldon H.
2
2006
Proportional choosability: a new list analogue of equitable coloring. Zbl 1418.05064
Kaul, Hemanshu; Mudrock, Jeffrey A.; Pelsmajer, Michael J.; Reiniger, Benjamin
1
2019
On the Alon-Tarsi number and chromatic-choosability of Cartesian products of graphs. Zbl 1409.05110
Kaul, Hemanshu; Mudrock, Jeffrey A.
1
2019
Reductions for the stable set problem. Zbl 1277.05128
Sewell, E. C.; Jacobson, S. H.; Kaul, Hemanshu
1
2011
Analyzing the performance of simultaneous generalized hill climbing algorithms. Zbl 1161.90537
Vaughan, Diane E.; Jacobson, Sheldon H.; Kaul, Hemanshu
1
2007
Proportional choosability: a new list analogue of equitable coloring. Zbl 1418.05064
Kaul, Hemanshu; Mudrock, Jeffrey A.; Pelsmajer, Michael J.; Reiniger, Benjamin
1
2019
On the Alon-Tarsi number and chromatic-choosability of Cartesian products of graphs. Zbl 1409.05110
Kaul, Hemanshu; Mudrock, Jeffrey A.
1
2019
On graph fall-coloring – operators and heredity. Zbl 1403.05119
Kaul, Hemanshu; Mitillos, Christodoulos
2
2018
Packing of graphic \(n\)-tuples. Zbl 1243.05191
Busch, Arthur H.; Ferrara, Michael J.; Hartke, Stephen G.; Jacobson, Michael S.; Kaul, Hemanshu; West, Douglas B.
8
2012
Maximum series-parallel subgraph. Zbl 1236.68293
Călinescu, Gruia; Fernandes, Cristina G.; Kaul, Hemanshu; Zelikovsky, Alexander
2
2012
Reductions for the stable set problem. Zbl 1277.05128
Sewell, E. C.; Jacobson, S. H.; Kaul, Hemanshu
1
2011
Distinguishing chromatic number of Cartesian products of graphs. Zbl 1216.05030
Choi, Jeong Ok; Hartke, Stephen G.; Kaul, Hemanshu
8
2010
On a graph packing conjecture by Bollobás, Eldridge and Catlin. Zbl 1212.05132
Kaul, Hemanshu; Kostochka, Alexandr; Yu, Gexin
5
2008
Extremal graphs for a graph packing theorem of Sauer and Spencer. Zbl 1117.05057
Kaul, Hemanshu; Kostochka, Alexandr
8
2007
Analyzing the performance of simultaneous generalized hill climbing algorithms. Zbl 1161.90537
Vaughan, Diane E.; Jacobson, Sheldon H.; Kaul, Hemanshu
1
2007
New global optima results for the Kauffman \(NK\) model: Handling dependency. Zbl 1130.90376
Kaul, Hemanshu; Jacobson, Sheldon H.
5
2006
Global optima results for the Kauffman \(NK\) model. Zbl 1134.90473
Kaul, Hemanshu; Jacobson, Sheldon H.
2
2006

Citations by Year

Wikidata Timeline