default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShyam Sundar 0001
Person information
- affiliation: National Institute of Technology Raipur, India
Other persons with the same name
- Shyam Sundar 0002
![[0000-0002-9090-6775]](https://dblp.dagstuhl.de/img/orcid-mark.12x12.png "0000-0002-9090-6775")
— Department of Mathematics, H. B. Technological Institute, Kanpur, India - Shyam Sundar 0003 — PA Semi, Inc., Santa Clara, CA, USA
- Shyam Sundar 0004 — Sri Sathya Sai Institute of Higher Learning, Department of Physics, Prasanthi Nilayam, India
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j24]Manisha Israni, Shyam Sundar:
An artificial bee colony algorithm for the minimum edge-dilation K-center problem. Soft Comput. 28(13-14): 8497-8511 (2024)- 2023
- [j23]Punit Kumar Chaubey, Shyam Sundar:
Two phases of metaheuristic techniques for the minimum conflict weighted spanning tree problem. Appl. Soft Comput. 138: 110205 (2023) - [j22]Sudishna Ghoshal, Shyam Sundar:
A Steady-State Grouping Genetic Algorithm for the Rainbow Spanning Forest Problem. SN Comput. Sci. 4(4): 321 (2023) - [j21]Punit Kumar Chaubey, Shyam Sundar:
A Steady-State Genetic Algorithm for the Single Machine Scheduling Problem with Periodic Machine Availability. SN Comput. Sci. 4(5): 651 (2023) - [j20]Manisha Israni, Shyam Sundar:
An Iterated Local Search for the Minimum Edge-Dilation K-Center Problem. SN Comput. Sci. 4(6): 781 (2023) - [c9]Punit Kumar Chaubey, Shyam Sundar:
A Hybrid Steady-State Genetic Algorithm for the Minimum Conflict Spanning Tree Problem. LOD (2) 2023: 192-205 - 2021
- [j19]Sudishna Ghoshal, Shyam Sundar:
Two approaches for the min-degree constrained minimum spanning tree problem. Appl. Soft Comput. 111: 107715 (2021) - [j18]Kavita Singh, Shyam Sundar:
Artificial bee colony algorithm using permutation encoding for the bounded diameter minimum spanning tree problem. Soft Comput. 25(16): 11289-11305 (2021) - 2020
- [j17]Sudishna Ghoshal, Shyam Sundar:
Two heuristics for the rainbow spanning forest problem. Eur. J. Oper. Res. 285(3): 853-864 (2020) - [j16]Kavita Singh, Shyam Sundar:
A hybrid genetic algorithm for the degree-constrained minimum spanning tree problem. Soft Comput. 24(3): 2169-2186 (2020)
2010 – 2019
- 2019
- [j15]Kavita Singh, Shyam Sundar:
A hybrid steady-state genetic algorithm for the min-degree constrained minimum spanning tree problem. Eur. J. Oper. Res. 276(1): 88-105 (2019) - [j14]Kavita Singh, Shyam Sundar:
A new hybrid genetic algorithm for the maximally diverse grouping problem. Int. J. Mach. Learn. Cybern. 10(10): 2921-2940 (2019) - [c8]Shyam Sundar:
A Hybrid Ant Colony Optimization Approach for the Cyclic Antibandwidth Problem. CoDIT 2019: 1289-1294 - 2018
- [j13]Kavita Singh, Shyam Sundar:
Two new heuristics for the dominating tree problem. Appl. Intell. 48(8): 2247-2267 (2018) - [j12]Kavita Singh, Shyam Sundar:
Artifical bee colony algorithm using problem-specific neighborhood strategies for the tree t-spanner problem. Appl. Soft Comput. 62: 110-118 (2018) - [c7]André Rossi, Alok Singh, Shyam Sundar:
Properties and Exact Solution Approaches for the Minimum Cost Dominating Tree Problem. ICDCIT 2018: 3-26 - 2017
- [j11]Shyam Sundar, Alok Singh:
Two grouping-based metaheuristics for clique partitioning problem. Appl. Intell. 47(2): 430-442 (2017) - [j10]Sachchida Nand Chaurasia, Shyam Sundar, Alok Singh:
Hybrid metaheuristic approaches for the single machine total stepwise tardiness problem with release dates. Oper. Res. 17(1): 275-295 (2017) - [j9]Shyam Sundar, Ponnuthurai N. Suganthan, Tay Jin Chua, Tian Xiang Cai, Chong Chin Soon:
A hybrid artificial bee colony algorithm for the job-shop scheduling problem with no-wait constraint. Soft Comput. 21(5): 1193-1202 (2017) - [c6]Manisha Israni, Shyam Sundar:
Ant Colony Optimization Approaches for the Tree t-Spanner Problem. IJCCI 2017: 200-206 - 2015
- [j8]Avanthika Meenakshi, Shyam Sundar, Silviya Nancy:
An Interactive Mobile Application for the Visually Impaired to Have Access to Listening Audio Books with Handy Books Portal. Int. J. Interact. Mob. Technol. 9(1): 64-66 (2015) - [j7]Shyam Sundar, Alok Singh:
Metaheuristic Approaches for the Blockmodel Problem. IEEE Syst. J. 9(4): 1237-1247 (2015) - [c5]Shyam Sundar, Sachchida Nand Chaurasia, Alok Singh:
An Ant Colony Optimization Approach for the Dominating Tree Problem. SEMCCO 2015: 143-153 - 2014
- [c4]Shyam Sundar:
A Steady-State Genetic Algorithm for the Dominating Tree Problem. SEAL 2014: 48-57 - 2013
- [j6]Shyam Sundar, Alok Singh:
New heuristic approaches for the dominating tree problem. Appl. Soft Comput. 13(12): 4695-4703 (2013) - [c3]Shyam Sundar, Ponnuthurai N. Suganthan, Tay Jin Chua:
A Swarm Intelligence Approach to Flexible Job-Shop Scheduling Problem with No-Wait Constraint in Remanufacturing. ICAISC (2) 2013: 593-602 - 2012
- [j5]Shyam Sundar, Alok Singh, André Rossi:
New heuristics for two bounded-degree spanning tree problems. Inf. Sci. 195: 226-240 (2012) - [j4]Shyam Sundar, Alok Singh:
A hybrid heuristic for the set covering problem. Oper. Res. 12(3): 345-365 (2012) - [j3]Shyam Sundar, Alok Singh:
A swarm intelligence approach to the early/tardy scheduling problem. Swarm Evol. Comput. 4: 25-32 (2012) - 2011
- [j2]Alok Singh, Shyam Sundar:
An artificial bee colony algorithm for the minimum routing cost spanning tree problem. Soft Comput. 15(12): 2489-2499 (2011) - 2010
- [j1]Shyam Sundar, Alok Singh:
A swarm intelligence approach to the quadratic minimum spanning tree problem. Inf. Sci. 180(17): 3182-3191 (2010) - [c2]Shyam Sundar, Alok Singh, André Rossi:
An Artificial Bee Colony Algorithm for the 0-1 Multidimensional Knapsack Problem. IC3 (1) 2010: 141-151 - [c1]Shyam Sundar, Alok Singh:
A Swarm Intelligence Approach to the Quadratic Multiple Knapsack Problem. ICONIP (1) 2010: 626-633
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-09-10 01:15 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:
