default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHemanshu Kaul
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j30]Gruia Calinescu
, Hemanshu Kaul, Bahareh Kudarzi:
An improved algorithm for finding maximum outerplanar subgraphs. Discret. Appl. Math. 342: 207-217 (2024)- [j29]Daniel Dominik, Hemanshu Kaul, Jeffrey A. Mudrock:
A note on fractional DP-coloring of graphs. Discret. Math. 347(10): 114123 (2024) - [j28]Samantha L. Dahlberg, Hemanshu Kaul, Jeffrey A. Mudrock:
An algebraic approach for counting DP-3-colorings of sparse graphs. Eur. J. Comb. 118: 103890 (2024) - [j27]Hemanshu Kaul, Akash Kumar, Jeffrey A. Mudrock, Patrick Rewers, Paul Shin, Khue To:
On the list color function threshold. J. Graph Theory 105(3): 386-397 (2024) - 2023
- [j26]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): 42 (2023) - [j25]Hemanshu Kaul, Jeffrey A. Mudrock, Gunjan Sharma, Quinn Stratton:
DP-coloring Cartesian products of graphs. J. Graph Theory 103(2): 285-306 (2023) - [i5]Gruia Calinescu, Hemanshu Kaul, Bahareh Kudarzi:
An Improved Algorithm for Finding Maximum Outerplanar Subgraphs. CoRR abs/2306.05588 (2023) - 2022
- [j24]Hemanshu Kaul, Benjamin Reiniger:
A Generalization of the Graph Packing Theorems of Sauer-Spencer and Brandt. Comb. 42(Supplement 2): 1347-1356 (2022) - [j23]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): 113093 (2022) - [j22]Hemanshu Kaul, Adam Rumpf:
A linear input dependence model for interdependent networks. Eur. J. Oper. Res. 302(2): 781-797 (2022) - [j21]Hemanshu Kaul, Jeffrey A. Mudrock, Tim Wagstrom:
On the Equitable Choosability of the Disjoint Union of Stars. Graphs Comb. 38(5): 163 (2022) - 2021
- [j20]Hemanshu Kaul, Jeffrey A. Mudrock:
On the chromatic polynomial and counting DP-colorings of graphs. Adv. Appl. Math. 123: 102131 (2021) - [j19]Hemanshu Kaul, Jeffrey A. Mudrock, Michael J. Pelsmajer:
Partial DP-coloring of graphs. Discret. Math. 344(4): 112306 (2021) - [c2]Adam Rumpf, Hemanshu Kaul:
A Public Transit Network Optimization Model for Equitable Access to Social Services. EAAMO 2021: 16:1-16:17 - [i4]Hemanshu Kaul, Adam Rumpf:
A linear input dependence model for interdependent networks. CoRR abs/2102.05248 (2021) - [i3]Adam Rumpf, Hemanshu Kaul:
A public transit network optimization model for equitable access to social services. CoRR abs/2106.06881 (2021) - 2020
- [j18]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): 111630 (2020) - [j17]Hemanshu Kaul, Jeffrey A. Mudrock:
Combinatorial Nullstellensatz and DP-coloring of graphs. Discret. Math. 343(12): 112115 (2020) - [j16]Hemanshu Kaul, Jeffrey A. Mudrock, Michael J. Pelsmajer, Benjamin Reiniger:
A Simple Characterization of Proportionally 2-choosable Graphs. Graphs Comb. 36(3): 679-687 (2020)
2010 – 2019
- 2019
- [j15]Hemanshu Kaul, Jeffrey A. Mudrock:
On the Alon-Tarsi Number and Chromatic-Choosability of Cartesian Products of Graphs. Electron. J. Comb. 26(1): 1 (2019) - [j14]Hemanshu Kaul, Jeffrey A. Mudrock, Michael J. Pelsmajer, Benjamin Reiniger:
Proportional choosability: A new list analogue of equitable coloring. Discret. Math. 342(8): 2371-2383 (2019) - [j13]Hemanshu Kaul, Jeffrey A. Mudrock:
List Coloring a Cartesian Product with a Complete Bipartite Factor. Graphs Comb. 35(6): 1571-1583 (2019) - [j12]Hemanshu Kaul, Christodoulos Mitillos:
On Graph Fall-Coloring: Existence and Constructions. Graphs Comb. 35(6): 1633-1646 (2019) - [i2]Hemanshu Kaul, Jeffrey A. Mudrock:
On the Chromatic Polynomial and Counting DP-Colorings. CoRR abs/1904.07697 (2019) - 2018
- [j11]Hemanshu Kaul, Jeffrey A. Mudrock, Michael J. Pelsmajer:
Total Equitable List Coloring. Graphs Comb. 34(6): 1637-1649 (2018) - 2013
- [i1]Sanjiv Kapoor, Hemanshu Kaul:
Approximating Quadratic 0-1 Programming via SOCP. CoRR abs/1312.7042 (2013) - 2012
- [j10]Gruia Calinescu, Cristina G. Fernandes, Hemanshu Kaul, Alexander Zelikovsky:
Maximum Series-Parallel Subgraph. Algorithmica 63(1-2): 137-157 (2012) - [j9]Arthur H. Busch, Michael J. Ferrara, Stephen G. Hartke, Michael S. Jacobson, Hemanshu Kaul, Douglas B. West:
Packing of graphic n-tuples. J. Graph Theory 70(1): 29-39 (2012) - 2011
- [j8]Edward C. Sewell, Sheldon H. Jacobson, Hemanshu Kaul:
Reductions for the Stable Set Problem. Algorithmic Oper. Res. 6(1): 40-55 (2011) - 2010
- [j7]Jeong Ok Choi, Stephen G. Hartke, Hemanshu Kaul:
Distinguishing Chromatic Number of Cartesian Products of Graphs. SIAM J. Discret. Math. 24(1): 82-100 (2010)
2000 – 2009
- 2009
- [c1]Gruia Calinescu, Cristina G. Fernandes, Hemanshu Kaul:
Maximum Series-Parallel Subgraph. WG 2009: 54-65 - 2008
- [j6]Hemanshu Kaul, Alexandr V. Kostochka, Gexin Yu:
On a graph packing conjecture by Bollobás, Eldridge and Catlin. Comb. 28(4): 469-485 (2008) - [j5]Hemanshu Kaul, Douglas B. West:
Long Local Searches for Maximal Bipartite Subgraphs. SIAM J. Discret. Math. 22(3): 1138-1144 (2008) - 2007
- [j4]Diane E. Vaughan, Sheldon H. Jacobson, Hemanshu Kaul:
Analyzing the performance of simultaneous generalized hill climbing algorithms. Comput. Optim. Appl. 37(1): 103-119 (2007) - [j3]Hemanshu Kaul, Alexandr V. Kostochka:
Extremal Graphs for a Graph Packing Theorem of Sauer and Spencer. Comb. Probab. Comput. 16(3): 409-416 (2007) - 2006
- [j2]Hemanshu Kaul, Sheldon H. Jacobson:
Global optima results for the Kauffman NK model. Math. Program. 106(2): 319-338 (2006) - [j1]Hemanshu Kaul, Sheldon H. Jacobson:
New global optima results for the Kauffman NK model: handling dependency. Math. Program. 108(2-3): 475-494 (2006)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-09 21:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
