default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKamal Srivastava
Person information
Other persons with a similar name
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
[j10]Yogita Singh Kardam, Kamal Srivastava, Rafael Martí:
General variable neighborhood search for the minimum stretch spanning tree problem. Optim. Lett. 17(9): 2005-2031 (2023)- 2022
- [j9]Yogita Singh Kardam, Kamal Srivastava, Pallavi Jain, Rafael Martí
:
Scatter search for the minimum leaf spanning tree problem. Comput. Oper. Res. 145: 105858 (2022) - 2017
- [j8]Pallavi Jain, Gur Saran, Kamal Srivastava:
Polynomial Time Efficient Construction Heuristics for Vertex Separation Minimization Problem. Electron. Notes Discret. Math. 63: 353-360 (2017) - [j7]Yogita Singh Kardam, Kamal Srivastava, Reeti Sharma:
Minimizing Profile of Graphs Using a Hybrid Simulating Annealing Algorithm. Electron. Notes Discret. Math. 63: 381-388 (2017) - 2016
- [j6]Pallavi Jain, Kamal Srivastava, Gur Saran:
Minimizing cyclic cutwidth of graphs using a memetic algorithm. J. Heuristics 22(6): 815-848 (2016) - [j5]Pallavi Jain, Gur Saran, Kamal Srivastava:
On minimizing vertex bisection using a memetic algorithm. Inf. Sci. 369: 765-787 (2016) - [j4]Pallavi Jain, Gur Saran, Kamal Srivastava:
A new Integer Linear Programming and Quadratically Constrained Quadratic Programming Formulation for Vertex Bisection Minimization Problem. J. Autom. Mob. Robotics Intell. Syst. 10(1): 69-73 (2016) - 2013
- [j3]Dharna Satsangi, Kamal Srivastava, Gursaran Srivastava:
$$K$$ -page crossing number minimization problem: An evaluation of heuristics and its solution using GESAKP. Memetic Comput. 5(4): 255-274 (2013) - 2011
- [j2]Richa Bansal, Kamal Srivastava:
Memetic algorithm for the antibandwidth maximization problem. J. Heuristics 17(1): 39-60 (2011) - [j1]Richa Bansal, Kamal Srivastava:
A memetic algorithm for the cyclic antibandwidth maximization problem. Soft Comput. 15(2): 397-412 (2011)
Conference and Workshop Papers
- 2012
- [c5]Richa Bansal, Kamal Srivastava, Sanjay Srivastava:
A hybrid evolutionary algorithm for the cutwidth minimization problem. IEEE Congress on Evolutionary Computation 2012: 1-8 - 2010
- [c4]Yogesh K. Anand, Sanjay Srivastava, Kamal Srivastava:
Optimizing the Risk of Occupational Health Hazard in a Multiobjective Decision Environment using NSGA-II. SEAL 2010: 476-484 - 2008
- [c3]Richa Bansal, Kamal Srivastava, Shweta Chaurasia, Kirti Varshney, Nidhi Sharma:
An evolutionary algorithm for the 2-page crossing number problem. IEEE Congress on Evolutionary Computation 2008: 1095-1102 - [c2]Kamal Srivastava, Reeti Sharma:
A hybrid simulated annealing algorithm for the Bipartite Crossing Number Minimization Problem. IEEE Congress on Evolutionary Computation 2008: 2948-2954 - [c1]Kamal Srivastava, Sanjay Srivastava, Bhupendra Kumar Pathak, Kalyanmoy Deb:
Discrete Time-Cost Tradeoff with a Novel Hybrid Meta-Heuristic. MCDM 2008: 177-188
Informal and Other Publications
- 2017
- [i1]Pallavi Jain, Gur Saran, Kamal Srivastava:
Polynomial Time Efficient Construction Heuristics for Vertex Separation Minimization Problem. CoRR abs/1702.05710 (2017)
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-07 22:17 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:
