default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNibedan Panda
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
2020 – today
- 2026
[j10]Umang Kumar Agrawal, Nibedan Panda, Rajanikanth Aluvalu, Ghanshyam G. Tejani:
Yellow Banded Wasp Algorithm: A Competition-driven Territorial Search Optimizer for Reliable Alignment of Point Cloud Registration. Int. J. Comput. Intell. Syst. 19(1): 212 (2026)- 2025
- [j9]Ajit Kumar Mahapatra
, Nibedan Panda, Madhumita Mahapatra, Tarakanta Jena, Arup Kumar Mohanty:
A fast-flying particle swarm optimization for resolving constrained optimization and feature selection problems. Clust. Comput. 28(2): 91 (2025) - [j8]Ajit Kumar Mahapatra, Nibedan Panda, Binod Kumar Pattanayak:
Adaptive dimensional search-based orthogonal experimentation SSA (ADOX-SSA) for training RBF neural network and optimal feature selection. J. Supercomput. 81(1): 212 (2025) - [j7]Umang Kumar Agrawal, Nibedan Panda:
Quantum-inspired adaptive mutation operator enabled PSO (QAMO-PSO) for parallel optimization and tailoring parameters of Kolmogorov-Arnold network. J. Supercomput. 81(14): 1310 (2025) - 2024
- [j6]Umang Kumar Agrawal, B. V. Ramana, Debabrata Singh, Nibedan Panda:
Leveraging LSTM and Multinomial Naive Bayes for Nuanced Textual-Based Sentiment Analysis. SN Comput. Sci. 5(8): 1090 (2024) - [c2]Jyotiranjan Swain, Shrabanee Swagatika, Karisma Mohapatra, Debabrata Singh, Nibedan Panda:
Droplet Routing in the Presence of Blockages: Challenges in Digital Microfluidics Biochip. ISED 2024: 1-6 - 2023
- [j5]Ajit Kumar Mahapatra, Nibedan Panda, Binod Kumar Pattanayak:
An improved pathfinder algorithm (ASDR-PFA) based on adaptation of search dimensional ratio for solving global optimization problems and optimal feature selection. Prog. Artif. Intell. 12(4): 323-348 (2023) - 2021
- [j4]Madugula Murali Krishna, Nibedan Panda, Santosh Kumar Majhi:
Solving traveling salesman problem using hybridization of rider optimization and spotted hyena optimization algorithm. Expert Syst. Appl. 183: 115353 (2021) - [j3]Nibedan Panda, Santosh Kumar Majhi:
Oppositional salp swarm algorithm with mutation operator for global optimization and application in training higher order neural networks. Multim. Tools Appl. 80(28-29): 35415-35439 (2021) - 2020
- [j2]Nibedan Panda, Santosh Kumar Majhi:
Improved spotted hyena optimizer with space transformational search for training pi-sigma higher order neural network. Comput. Intell. 36(1): 320-350 (2020) - [j1]Nibedan Panda, Santosh Kumar Majhi, Sarishma Singh, Abhirup Khanna:
Oppositional spotted hyena optimizer with mutation operator for global optimization and application in training wavelet neural network. J. Intell. Fuzzy Syst. 38(5): 6677-6690 (2020)
2010 – 2019
- 2019
- [c1]Nibedan Panda, Santosh Kumar Majhi:
Effectiveness of Swarm-Based Metaheuristic Algorithm in Data Classification Using Pi-Sigma Higher Order Neural Network. ICACIE (2) 2019: 77-88
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 2026-07-06 02:55 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
