default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNaveed Ahmed Azam
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j23]Takreem Haider
, Naveed Ahmed Azam, Umar Hayat:
Substitution box generator with enhanced cryptographic properties and minimal computation time. Expert Syst. Appl. 241: 122779 (2024)- [j22]Naveed Ahmed Azam, Takreem Haider, Umar Hayat:
An optimized watermarking scheme based on genetic algorithm and elliptic curve. Swarm Evol. Comput. 91: 101723 (2024) - [j21]Jianshen Zhu, Naveed Ahmed Azam, Kazuya Haraguchi, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu:
Molecular Design Based on Integer Programming and Splitting Data Sets by Hyperplanes. IEEE ACM Trans. Comput. Biol. Bioinform. 21(5): 1529-1541 (2024) - [i11]Bowen Song, Jianshen Zhu, Naveed Ahmed Azam, Kazuya Haraguchi, Liang Zhao, Tatsuya Akutsu:
Cycle-Configuration: A Novel Graph-theoretic Descriptor Set for Molecular Inference. CoRR abs/2408.05136 (2024) - [i10]Muniba Batool, Naveed Ahmed Azam, Jianshen Zhu, Kazuya Haraguchi, Liang Zhao, Tatsuya Akutsu:
A Unified Approach to Inferring Chemical Compounds with the Desired Aqueous Solubility. CoRR abs/2409.04301 (2024) - [i9]Seemab Hayat, Naveed Ahmed Azam:
A Method to Generate Multi-interval Pairwise Compatibility Graphs. CoRR abs/2410.10525 (2024) - 2023
- [j20]Naveed Ahmed Azam, Jianshen Zhu, Umar Hayat, Aleksandar Shurbevski:
Towards provably secure asymmetric image encryption schemes. Inf. Sci. 631: 164-184 (2023) - [j19]Mohammad Abdul Mujeeb Khan, Naveed Ahmed Azam, Umar Hayat, Hailiza Kamarulhaili:
A novel deterministic substitution box generator over elliptic curves for real-time applications. J. King Saud Univ. Comput. Inf. Sci. 35(1): 219-236 (2023) - [i8]Jianshen Zhu, Naveed Ahmed Azam, Kazuya Haraguchi, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu:
Molecular Design Based on Integer Programming and Splitting Data Sets by Hyperplanes. CoRR abs/2305.00801 (2023) - 2022
- [j18]Umar Hayat, Ikram Ullah, Naveed Ahmed Azam, Sumaira Azhar:
A Novel Image Encryption Scheme Based on Elliptic Curves over Finite Rings. Entropy 24(5): 571 (2022) - [j17]Naveed Ahmed Azam, Aleksandar Shurbevski, Hiroshi Nagamochi:
On the enumeration of minimal non-pairwise compatibility graphs. J. Comb. Optim. 44(4): 2871-2892 (2022) - [j16]Jianshen Zhu, Naveed Ahmed Azam, Fan Zhang, Aleksandar Shurbevski, Kazuya Haraguchi, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu:
A Novel Method for Inferring Chemical Compounds With Prescribed Topological Substructures Based on Integer Programming. IEEE ACM Trans. Comput. Biol. Bioinform. 19(6): 3233-3245 (2022) - [c6]Jianshen Zhu, Naveed Ahmed Azam, Kazuya Haraguchi, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu:
A Method for Molecular Design Based on Linear Regression and Integer Programming. ICBBB 2022: 21-28 - [i7]Jianshen Zhu, Naveed Ahmed Azam, Shengjuan Cao, Ryota Ido, Kazuya Haraguchi, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu:
Molecular Design Based on Integer Programming and Quadratic Descriptors in a Two-layered Model. CoRR abs/2209.13527 (2022) - 2021
- [b1]Naveed Ahmed Azam:
On Enumeration of Tree-Like Graphs and Pairwise Compatibility Graphs. Kyoto University, Japan, 2021 - [j15]Naveed Ahmed Azam, Jianshen Zhu, Yanming Sun, Yu Shi, Aleksandar Shurbevski, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu:
A novel method for inference of acyclic chemical compounds with bounded branch-height based on artificial neural networks and integer programming. Algorithms Mol. Biol. 16(1): 18 (2021) - [j14]Naveed Ahmed Azam, Aleksandar Shurbevski, Hiroshi Nagamochi:
A method for enumerating pairwise compatibility graphs with a given number of vertices. Discret. Appl. Math. 303: 171-185 (2021) - [j13]Ikram Ullah, Naveed Ahmed Azam, Umar Hayat:
Efficient and secure substitution box and random number generators over Mordell elliptic curves. J. Inf. Secur. Appl. 56: 102619 (2021) - [j12]Naveed Ahmed Azam, Umar Hayat, Maria Ayub:
A substitution box generator, its analysis, and applications in image encryption. Signal Process. 187: 108144 (2021) - [c5]Naveed Ahmed Azam, Jianshen Zhu, Kazuya Haraguchi, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu:
Molecular Design Based on Artificial Neural Networks, Integer Programming and Grid Neighbor Search. BIBM 2021: 360-363 - [c4]Kouki Tanaka, Jianshen Zhu, Naveed Ahmed Azam, Kazuya Haraguchi, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu:
An Inverse QSAR Method Based on Decision Tree and Integer Programming. ICIC (2) 2021: 628-644 - [c3]Jianshen Zhu, Naveed Ahmed Azam, Kazuya Haraguchi, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu:
An Improved Integer Programming Formulation for Inferring Chemical Compounds with Prescribed Topological Structures. IEA/AIE (1) 2021: 197-209 - [i6]Jianshen Zhu, Naveed Ahmed Azam, Kazuya Haraguchi, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu:
An Inverse QSAR Method Based on Linear Regression and Integer Programming. CoRR abs/2107.02381 (2021) - [i5]Naveed Ahmed Azam, Jianshen Zhu, Kazuya Haraguchi, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu:
Molecular Design Based on Artificial Neural Networks, Integer Programming and Grid Neighbor Search. CoRR abs/2108.10266 (2021) - [i4]Ryota Ido, Shengjuan Cao, Jianshen Zhu, Naveed Ahmed Azam, Kazuya Haraguchi, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu:
A Method for Inferring Polymers Based on Linear Regression and Integer Programming. CoRR abs/2109.02628 (2021) - 2020
- [j11]Naveed Ahmed Azam, Aleksandar Shurbevski, Hiroshi Nagamochi:
An Efficient Algorithm to Count Tree-Like Graphs with a Given Number of Vertices and Self-Loops. Entropy 22(9): 923 (2020) - [j10]Naveed Ahmed Azam, Aleksandar Shurbevski, Hiroshi Nagamochi:
Enumerating Tree-Like Graphs and Polymer Topologies with a Given Cycle Rank. Entropy 22(11): 1295 (2020) - [c2]Naveed Ahmed Azam, Rachaya Chiewvanichakorn, Fan Zhang, Aleksandar Shurbevski, Hiroshi Nagamochi, Tatsuya Akutsu:
A Novel Method for the Inverse QSAR/QSPR based on Artificial Neural Networks and Mixed Integer Linear Programming with Guaranteed Admissibility. BIOINFORMATICS 2020: 101-108 - [c1]Naveed Ahmed Azam, Aleksandar Shurbevski, Hiroshi Nagamochi:
On the Enumeration of Minimal Non-pairwise Compatibility Graphs. COCOON 2020: 372-383 - [i3]Naveed Ahmed Azam, Jianshen Zhu, Yanming Sun, Yu Shi, Aleksandar Shurbevski, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu:
A Novel Method for Inference of Acyclic Chemical Compounds with Bounded Branch-height Based on Artificial Neural Networks and Integer Programming. CoRR abs/2009.09646 (2020)
2010 – 2019
- 2019
- [j9]Naveed Ahmed Azam, Umar Hayat, Ikram Ullah:
Efficient construction of a substitution box based on a Mordell elliptic curve over a finite field. Frontiers Inf. Technol. Electron. Eng. 20(10): 1378-1389 (2019) - [j8]Umar Hayat, Naveed Ahmed Azam:
A novel image encryption scheme based on an elliptic curve. Signal Process. 155: 391-402 (2019) - [i2]Ikram Ullah, Naveed Ahmed Azam, Umar Hayat:
Efficient and Secure Substitution Box and Random Number Generators Over Mordell Elliptic Curves. CoRR abs/1910.05576 (2019) - 2018
- [j7]Naveed Ahmed Azam, Umar Hayat, Ikram Ullah:
An Injective S-Box Design Scheme over an Ordered Isomorphic Elliptic Curve and Its Characterization. Secur. Commun. Networks 2018: 3421725:1-3421725:9 (2018) - [j6]Umar Hayat, Naveed Ahmed Azam, Muhammad Asif:
A Method of Generating 8 × 8 Substitution Boxes Based on Elliptic Curves. Wirel. Pers. Commun. 101(1): 439-451 (2018) - [i1]Naveed Ahmed Azam, Umar Hayat, Ikram Ullah:
Efficient Construction of S-boxes Based on a Mordell Elliptic Curve Over a Finite Field. CoRR abs/1809.11057 (2018) - 2017
- [j5]Tariq Shah, Naveed Ahmed Azam:
Characterization of cyclic codes over {ℬ[X;(1/m)Z0]}m > 1 and efficient encoding decoding algorithm for cyclic codes. Int. J. Comput. Math. 94(5): 1015-1027 (2017) - [j4]Naveed Ahmed Azam:
A Novel Fuzzy Encryption Technique Based on Multiple Right Translated AES Gray S-Boxes and Phase Embedding. Secur. Commun. Networks 2017: 5790189:1-5790189:9 (2017) - 2015
- [j3]Mubashar Khan, Naveed Ahmed Azam:
Right translated AES gray S-boxes. Secur. Commun. Networks 8(9): 1627-1635 (2015) - 2014
- [j2]Naveed Ahmed Azam, Tariq Shah, Antonio Aparecido de Andrade:
A new transmission model in cognitive radio based on cyclic generalized polynomial codes for bandwidth reduction. Discret. Math. Algorithms Appl. 6(4) (2014) - [j1]Syed Azmat Hussain, Tariq Shah, Naveed Ahmed Azam, Antonio Aparecido de Andrade, Aqdas Naveed Malik:
Spectrum Distribution in Cognitive Radio: Error Correcting Codes Perspective. Int. J. Distributed Sens. Networks 10 (2014)
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-11-26 21:39 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:
