default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSafeer Hussain Khan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j14]Talat Nazir, Mujahid Abbas, Safeer Hussain Khan:
Fixed Point Results of Fuzzy Multivalued Graphic Contractive Mappings in Generalized Parametric Metric Spaces. Axioms 13(10): 690 (2024)- 2023
- [j13]Safeer Hussain Khan
, Abdullah Eqal Al-Mazrooei, Abdul Latif:
Banach Contraction Principle-Type Results for Some Enriched Mappings in Modular Function Spaces. Axioms 12(6): 549 (2023) - 2022
- [j12]Professer Vogani Ndlovu, Lateef Olakunle Jolaoso, Maggie Aphane, Safeer Hussain Khan:
Approximating a Common Solution of Monotone Inclusion Problems and Fixed Point of Quasi-Pseudocontractive Mappings in CAT(0) Spaces. Axioms 11(10): 545 (2022) - [j11]Safeer Hussain Khan, Lateef Olakunle Jolaoso, Maggie Aphane:
Visual Analysis of Mixed Algorithms with Newton and Abbasbandy Methods Using Periodic Parameters. Symmetry 14(12): 2484 (2022) - 2020
- [j10]Lateef Olakunle Jolaoso, Maggie Aphane, Safeer Hussain Khan:
Two Bregman Projection Methods for Solving Variational Inequality Problems in Hilbert Spaces with Applications to Signal Processing. Symmetry 12(12): 2007 (2020) - 2012
- [j9]Isa Yildirim, Safeer Hussain Khan:
Convergence theorems for common fixed points of asymptotically quasi-nonexpansive mappings in convex metric spaces. Appl. Math. Comput. 218(9): 4860-4866 (2012) - 2011
- [j8]Mujahid Abbas, Safeer Hussain Khan, Abdul Rahim Khan, Ravi P. Agarwal:
Common fixed points of two multivalued nonexpansive mappings by one-step iterative scheme. Appl. Math. Lett. 24(2): 97-102 (2011) - [j7]Safeer Hussain Khan, Isa Yildirim:
On strong convergence in real Banach spaces obtained by dropping the Lipshitz condition. Appl. Math. Lett. 24(7): 1170-1175 (2011) - [j6]Safeer Hussain Khan, Mujahid Abbas:
Strong and -convergence of some iterative schemes in CAT(0) spaces. Comput. Math. Appl. 61(1): 109-116 (2011) - [j5]Safeer Hussain Khan, Isa Yildirim, Murat Emin Özdemir:
Convergence of a generalized iteration process for two finite families of Lipschitzian pseudocontractive mappings. Math. Comput. Model. 53(5-6): 707-715 (2011) - 2010
- [j4]Safeer Hussain Khan, Isa Yildirim, Murat Emin Özdemir:
Convergence of an implicit algorithm for two families of nonexpansive mappings. Comput. Math. Appl. 59(9): 3084-3091 (2010) - 2008
- [j3]Mujahid Abbas, Safeer Hussain Khan, B. E. Rhoades:
Simpler is also better in approximating fixed points. Appl. Math. Comput. 205(1): 428-431 (2008) - [j2]Safeer Hussain Khan, Nawab Hussain:
Convergence theorems for nonself asymptotically nonexpansive mappings. Comput. Math. Appl. 55(11): 2544-2553 (2008) - 2004
- [j1]Hafiz Fukhar-ud-din, Safeer Hussain Khan:
Convergence of two-step iterative scheme with errors for two asymptotically nonexpansive mappings. Int. J. Math. Math. Sci. 2004(37): 1965-1971 (2004)
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-30 21:30 CET 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:
