Swati Nayak

According to our database, Swati Nayak authored at least 6 papers between 2020 and 2026.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2026

A Graph-Based Public-Key Cryptosystem Using the NP-Complete Problem of Partitioning Into Perfect Matchings.

Jane Shonon Cutinha, Swati Nayak, Sabitha D'Souza

IEEE Access, 2026

2025

Stress in Directed Graphs: A Generalization of Graph Stress.

K. V. Madhumitha, A. Harshitha, Swati Nayak, Sabitha D'Souza

J. Appl. Math., 2025

On the minimum reformulated Albertson Index of fixed-order trees and unicyclic graphs with a given maximum degree.

Jane Shonon Cutinha, Sabitha D'Souza, Swati Nayak

AKCE Int. J. Graphs Comb., 2025

2023

Hamming distance between the strings generated by adjacency matrix of a subgraph complementary graph and their sum.

Swati Nayak, Shankar N. Upadhyay, Sabitha D'Souza, Pradeep G. Bhat

Discret. Math. Algorithms Appl., May, 2023

2021

Digital innovation for strengthening seed market and augmenting targeted business in agriculture.

Swati Nayak, Ritesh Dwivedi, Anjani Kumar Singh

Int. J. Electron. Bus., 2021

2020

On Efficient Candidate Path Selection for Dynamic Routing in Elastic Optical Networks.

Bijal Patel, Haiyang Ji, Swati Nayak, Ting Ding, Yue Pan, Michal Aibin

Proceedings of the 11th IEEE Annual Ubiquitous Computing, 2020