The separability of standard cyclic N-ary Gray codes. - A. J. van Zanten; I Nengah Suparta (IEEE Trans. Inf. Theory, 2003)

A Simple Proof for the Existence of Exponentially Balanced Gray Codes. - I Nengah Suparta (Electron. J. Comb., 2005)

On the Construction of Linear q-ary Lexicodes. - A. J. van Zanten; I Nengah Suparta (Des. Codes Cryptogr., 2005)

Balanced Maximum Counting Sequences. - I Nengah Suparta; A. J. van Zanten (IEEE Trans. Inf. Theory, 2006)

Counting sequences, Gray codes and lexicodes. - I Nengah Suparta (2006)

A construction of Gray codes inducing complete graphs. - I Nengah Suparta; A. J. van Zanten (Discret. Math., 2008)

Some classes of bipartite graphs induced by Gray codes. - I Nengah Suparta (Electron. J. Graph Theory Appl., 2017)

Expanding graceful trees. - I Nengah Suparta; I Dewa M. Agus Ariawan (Electron. J. Graph Theory Appl., 2020)

On face irregular evaluations of plane graphs. - Martin Baca; Ali Ovais; Andrea Semanicová-Fenovcíková; I Nengah Suparta (Discuss. Math. Graph Theory, 2022)

Mapping of Mobile Learning Research Directions and Trends in Scopus-Indexed Journals: A Bibliometric Analysis. - Muhammad Turmuzi; I Gusti Putu Suharta; I Wayan Puja Astawa; I Nengah Suparta (Int. J. Interact. Mob. Technol., 2023)

Modular irregularity strength of dense graphs. - I Nengah Suparta; Made Candiasa; Kadek Wahyu Prasancika; Martin Baca (Electron. J. Graph Theory Appl., 2024)