default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAyesha Shabbir
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
[j12]Muhammad Faisal Nadeem
, Ayesha Shabbir, Muhammad Imran:
Optimal Embedding of Graphs with Nonconcurrent Longest Paths in Archimedean Tessellations. Complex. 2023: 3919389:1-3919389:7 (2023)- 2022
- [j11]Maryam Shabbir, Fahad Ahmad, Ayesha Shabbir, Saad Awadh Alanazi:
Cognitively managed multi-level authentication for security using Fuzzy Logic based Quantum Key Distribution. J. King Saud Univ. Comput. Inf. Sci. 34(4): 1468-1485 (2022) - 2021
- [j10]Maryam Shabbir, Ayesha Shabbir, Celestine Iwendi, Abdul Rehman Javed, Muhammad Rizwan, Norbert Herencsar, Jerry Chun-Wei Lin:
Enhancing Security of Health Information Using Modular Encryption Standard in Mobile Cloud Computing. IEEE Access 9: 8820-8834 (2021) - [j9]Ayesha Shabbir, Muhammad Azeem:
On the Partition Dimension of Tri-Hexagonal α-Boron Nanotube. IEEE Access 9: 55644-55653 (2021) - 2020
- [j8]Ayesha Shabbir, Muhammad Faisal Nadeem, Tudor Zamfirescu:
The Property of Hamiltonian Connectedness in Toeplitz Graphs. Complex. 2020: 5608720:1-5608720:6 (2020) - 2017
- [j7]Faraha Ashraf, Martin Baca, Andrea Semanicová-Fenovcíková, Ayesha Shabbir:
On H-irregularity strengths of G-amalgamation of graphs. Electron. J. Graph Theory Appl. 5(2): 325-334 (2017) - 2016
- [j6]Ayesha Shabbir, Tudor Zamfirescu:
Gallai's property for graphs in lattices on the torus and the Möbius strip. Period. Math. Hung. 72(1): 1-11 (2016) - 2015
- [j5]Martin Baca, Yasir Bashir, Muhammad Faisal Nadeem, Ayesha Shabbir:
On Super Edge-Antimagicness of Circulant Graphs. Graphs Comb. 31(6): 2019-2028 (2015) - 2014
- [j4]Ayesha Shabbir:
Fault-tolerant designs in lattice networks on the Klein bottle. Electron. J. Graph Theory Appl. 2(2): 99-109 (2014) - 2013
- [j3]Ayesha Shabbir, Tudor Zamfirescu:
Highly non-concurrent longest cycles in lattice graphs. Discret. Math. 313(19): 1908-1914 (2013) - [j2]Ayesha Shabbir, Carol T. Zamfirescu, Tudor I. Zamfirescu:
Intersecting longest paths and longest cycles: A survey. Electron. J. Graph Theory Appl. 1(1): 56-76 (2013) - [j1]Muhammad Faisal Nadeem, Ayesha Shabbir, Tudor Zamfirescu:
Planar Lattice Graphs with Gallai's Property. Graphs Comb. 29(5): 1523-1529 (2013)
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-04-24 22:53 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:
