default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDeepmala
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
2020 – today
- 2026
[j13]Sukanta Halder
, Deepmala, Ravi P. Agarwal:
Solvability and iterative approximation of an infinite system of two-variable Hadamard-type fractional integral equations in ℓp space. J. Comput. Appl. Math. 475: 117050 (2026)- [j12]Bharat Kumar, Deepmala, A. K. Das:
New relaxation modulus-based iterative method for large and sparse implicit complementarity problem. J. Comput. Appl. Math. 485: 117506 (2026) - [j11]Sukanta Halder, Chinedu Nwaigwe, Deepmala:
Solvability and numerical discretization of generalized nonlinear functional mixed integral equations. J. Comput. Appl. Math. 488: 117800 (2026) - 2024
- [j10]Shubham Kumar, Deepmala, Milan Hladík, Hossein Moosaei:
Characterization of unique solvability of absolute value equations: an overview, extensions, and future directions. Optim. Lett. 18(4): 889-907 (2024) - 2023
- [j9]Deepmala, Sanjay Kumar Singh, Umesh Singh:
Inferences based on a balanced joint progressive type-II censoring scheme for Lindley distributed lifetimes. Commun. Stat. Simul. Comput. 52(9): 4119-4133 (2023) - 2022
- [j8]Tanmay Kundu, Deepmala, Pramod K. Jain:
A hybrid salp swarm algorithm based on TLBO for reliability redundancy allocation problems. Appl. Intell. 52(11): 12630-12667 (2022) - 2021
- [j7]Amar Deep, Deepmala, Reza Ezzati:
Application of Petryshyn's fixed point theorem to solvability for functional integral equations. Appl. Math. Comput. 395: 125878 (2021) - [j6]Amar Deep, Deepmala, Mohsen Rabbani:
A numerical method for solvability of some non-linear functional integral equations. Appl. Math. Comput. 402: 125637 (2021)
2010 – 2019
- 2017
- [c1]A. K. Das, R. Jana, Deepmala:
Finiteness of Criss-Cross Method in Complementarity Problem. ICMC 2017: 170-180 - 2014
- [j5]Lakshmi Narayan Mishra, Vishnu Narayan Mishra, Kejal Khatri, Deepmala:
On the trigonometric approximation of signals belonging to generalized weighted Lipschitz W(Lr, ξ(t))(r ⩾ 1)-class by matrix (C1 ⋅ Np) operator of conjugate series of its Fourier series. Appl. Math. Comput. 237: 252-263 (2014) - [j4]Deepmala:
Existence Theorems for Solvability of a Functional Equation Arising in Dynamic Programming. Int. J. Math. Math. Sci. 2014: 706585:1-706585:9 (2014) - 2013
- [j3]H. K. Pathak, Deepmala:
Common fixed point theorems for PD-operator pairs under relaxed conditions with applications. J. Comput. Appl. Math. 239: 103-113 (2013) - 2012
- [j2]H. K. Pathak, Deepmala:
Existence and uniqueness of solutions of functional equations arising in dynamic programming. Appl. Math. Comput. 218(13): 7221-7230 (2012) - [j1]H. K. Pathak, Deepmala:
Remarks on some fixed point theorems of Dhage. Appl. Math. Lett. 25(11): 1969-1975 (2012)
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-17 01:32 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.
