Hemanshu Kaul

Orcid: 0000-0002-6691-0176

According to our database1, Hemanshu Kaul authored at least 32 papers between 2006 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
On the list color function threshold.
J. Graph Theory, March, 2024

An improved algorithm for finding maximum outerplanar subgraphs.
Discret. Appl. Math., January, 2024

2023
DP-coloring Cartesian products of graphs.
J. Graph Theory, June, 2023

Non-chromatic-Adherence of the DP Color Function via Generalized Theta Graphs.
Graphs Comb., June, 2023

2022
A Generalization of the Graph Packing Theorems of Sauer-Spencer and Brandt.
Comb., December, 2022

On the Equitable Choosability of the Disjoint Union of Stars.
Graphs Comb., 2022

A linear input dependence model for interdependent networks.
Eur. J. Oper. Res., 2022

The DP color function of joins and vertex-gluings of graphs.
Discret. Math., 2022

2021
Partial DP-coloring of graphs.
Discret. Math., 2021

On the chromatic polynomial and counting DP-colorings of graphs.
Adv. Appl. Math., 2021

A Public Transit Network Optimization Model for Equitable Access to Social Services.
Proceedings of the EAAMO 2021: ACM Conference on Equity and Access in Algorithms, Mechanisms, and Optimization, Virtual Event, USA, October 5, 2021

2020
A Simple Characterization of Proportionally 2-choosable Graphs.
Graphs Comb., 2020

Combinatorial Nullstellensatz and DP-coloring of graphs.
Discret. Math., 2020

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

2019
On Graph Fall-Coloring: Existence and Constructions.
Graphs Comb., 2019

List Coloring a Cartesian Product with a Complete Bipartite Factor.
Graphs Comb., 2019

Proportional choosability: A new list analogue of equitable coloring.
Discret. Math., 2019

On the Chromatic Polynomial and Counting DP-Colorings.
CoRR, 2019

On the Alon-Tarsi Number and Chromatic-Choosability of Cartesian Products of Graphs.
Electron. J. Comb., 2019

2018
Total Equitable List Coloring.
Graphs Comb., 2018

2013
Approximating Quadratic 0-1 Programming via SOCP.
CoRR, 2013

2012
Packing of graphic <i>n</i>-tuples.
J. Graph Theory, 2012

Maximum Series-Parallel Subgraph.
Algorithmica, 2012

2011
Reductions for the Stable Set Problem.
Algorithmic Oper. Res., 2011

2010
Distinguishing Chromatic Number of Cartesian Products of Graphs.
SIAM J. Discret. Math., 2010

2009
Maximum Series-Parallel Subgraph.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2009

2008
Long Local Searches for Maximal Bipartite Subgraphs.
SIAM J. Discret. Math., 2008

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

2007
Extremal Graphs for a Graph Packing Theorem of Sauer and Spencer.
Comb. Probab. Comput., 2007

Analyzing the performance of simultaneous generalized hill climbing algorithms.
Comput. Optim. Appl., 2007

2006
New global optima results for the Kauffman <i>NK</i> model: handling dependency.
Math. Program., 2006

Global optima results for the Kauffman <i>NK</i> model.
Math. Program., 2006


  Loading...