output
20122022
most citedPerformance Analysis of an Unreliable Retrial Queue with Two-way Communication

12 citations

10 papers

math.CO2022★ 2 cited

Monitoring edge-geodetic sets in graphs

Subhadeep R. Dev, Sanjana Dey, Florent Foucaud +2

We introduce a new graph-theoretic concept in the area of network monitoring. In this area, one wishes to monitor the vertices and/or the edges of a network (viewed as a graph) in…

cs.SI2021★ 9 cited

Co-evolution of Viral Processes and Structural Stability in Signed Social Networks

Temirlan Kalimzhanov, Amir Haji Ali Khamseh'i, Aresh Dadlani +2

Prediction and control of spreading processes in social networks (SNs) are closely tied to the underlying connectivity patterns. Contrary to most existing efforts that exclusively…

math.CO2020

The Number of Perfect Matchings in Möbius Ladders and Prisms

R. S. Lekshmi, Douglas B. West

The 1970s conjecture of Lovász and Plummer that the number of perfect matchings in any -regular graph is exponential in the number of vertices was proved in 2011 by Esperet, Kar…

cs.DM2019★ 6 cited

Forman-Ricci curvature and Persistent homology of unweighted complex networks

Indrava Roy, Sudharsan Vijayaraghavan, Sarath Jyotsna Ramaia +1

We present the application of topological data analysis (TDA) to study unweighted complex networks via their persistent homology. By endowing appropriate weights that capture the i…

q-fin.ST2019★ 4 cited

Stylized facts of the Indian Stock Market

Rituparna Sen, Manavthi S

Historical daily data for eleven years of the fifty constituent stocks of the NIFTY index traded on the National Stock Exchange have been analyzed to check for the stylized facts i…

cs.DS2018

Tractability of Konig Edge Deletion Problems

Diptapriyo Majumdar, Rian Neogi, Venkatesh Raman +1

A graph is said to be a Konig graph if the size of its maximum matching is equal to the size of its minimum vertex cover. The Konig Edge Deletion problem asks if in a given graph t…

cs.PF2016★ 1 cited

Overlay Secondary Spectrum Sharing with Independent Re-attempts in Cognitive Radios

Muthukrishnan Senthil Kumar, Aresh Dadlani, Kiseon Kim +1

Opportunistic spectrum access (OSA) is a promising reform paradigm envisioned to address the issue of spectrum scarcity in cognitive radio networks (CRNs). While current models con…

eess.SY2016★ 2 cited

Transient Analysis of a Resource-limited Recovery Policy for Epidemics: a Retrial Queueing Approach

Aresh Dadlani, Muthukrishnan Senthil Kumar, Kiseon Kim +1

Knowledge on the dynamics of standard epidemic models and their variants over complex networks has been well-established primarily in the stationary regime, with relatively little…

cs.NI2015★ 12 cited

Performance Analysis of an Unreliable Retrial Queue with Two-way Communication

Muthukrishnan Senthil Kumar, Aresh Dadlani, Kiseon Kim

Efficient use of call center operators through technological innovations more often come at the expense of added operation management issues. In this paper, the stationary characte…

cs.AR2012★ 8 cited

An efficient FPGA implementation of MRI image filtering and tumor characterization using Xilinx system generator

S. Allin Christe, M. Vignesh, A. Kandaswamy

This paper presents an efficient architecture for various image filtering algorithms and tumor characterization using Xilinx System Generator (XSG). This architecture offers an alt…