activity
20112023
most citedAnalyzing Cascading Failures in Smart Grids under Random and Targeted Attacks

11 citations · 14 across the 13 of their papers we have counts for

collaborators

14 papers

cs.CR2023

OptimShare: A Unified Framework for Privacy Preserving Data Sharing -- Towards the Practical Utility of Data with Privacy

M. A. P. Chamikara, Seung Ick Jang, Ian Oppermann +9

Tabular data sharing serves as a common method for data exchange. However, sharing sensitive information without adequate privacy protection can compromise individual privacy. Thus…

cs.RO2022

Task Allocation using a Team of Robots

Haris Aziz, Arindam Pal, Ali Pourmiri +2

Task allocation using a team or coalition of robots is one of the most important problems in robotics, computer science, operational research, and artificial intelligence. In recen…

cs.SI2022

Cascading Failures in Smart Grids under Random, Targeted and Adaptive Attacks

Sushmita Ruj, Arindam Pal

We study cascading failures in smart grids, where an attacker selectively compromises the nodes with probabilities proportional to their degrees, betweenness, or clustering coeffic…

cs.CR2020

PhishZip: A New Compression-based Algorithm for Detecting Phishing Websites

Rizka Purwanto, Arindam Pal, Alan Blair +1

Phishing has grown significantly in the past few years and is predicted to further increase in the future. The dynamics of phishing introduce challenges in implementing a robust ph…

cs.DM2020

BB_Evac: Fast Location-Sensitive Behavior-Based Building Evacuation

Subhra Mazumdar, Arindam Pal, Francesco Parisi +1

Past work on evacuation planning assumes that evacuees will follow instructions -- however, there is ample evidence that this is not the case. While some people will follow instruc…

cs.CR2020

HushRelay: A Privacy-Preserving, Efficient, and Scalable Routing Algorithm for Off-Chain Payments

Subhra Mazumdar, Sushmita Ruj, Ram Govind Singh +1

Payment channel networks (PCN) are used in cryptocurrencies to enhance the performance and scalability of off-chain transactions. Except for opening and closing of a payment channe…

cs.DL2017★ 2 cited

A Graph Analytics Framework for Ranking Authors, Papers and Venues

Arindam Pal, Sushmita Ruj

A lot of scientific works are published in different areas of science, technology, engineering and mathematics. It is not easy, even for experts, to judge the quality of authors, p…

cs.DS2016

Improved Algorithms for the Evacuation Route Planning Problem

Gopinath Mishra, Subhra Mazumdar, Arindam Pal

Emergency evacuation is the process of movement of people away from the threat or actual occurrence of hazards such as natural disasters, terrorist attacks, fires and bombs. In thi…

cs.SI2016

Preferential Attachment Model with Degree Bound and its Application to Key Predistribution in WSN

Sushmita Ruj, Arindam Pal

Preferential attachment models have been widely studied in complex networks, because they can explain the formation of many networks like social networks, citation networks, power…

cs.DL2015

CITEX: A new citation index to measure the relative importance of authors and papers in scientific publications

Arindam Pal, Sushmita Ruj

Evaluating the performance of researchers and measuring the impact of papers written by scientists is the main objective of citation analysis. Various indices and metrics have been…

cs.SI2014★ 11 cited

Analyzing Cascading Failures in Smart Grids under Random and Targeted Attacks

Sushmita Ruj, Arindam Pal

We model smart grids as complex interdependent networks, and study targeted attacks on smart grids for the first time. A smart grid consists of two networks: the power network and…

cs.DS2014★ 1 cited

Approximation Algorithms for Covering and Packing Problems on Paths

Arindam Pal

Routing and scheduling problems are fundamental problems in combinatorial optimization, and also have many applications. Most variations of these problems are NP-Hard, so we need t…

cs.DS2012

Scheduling Resources for Executing a Partial Set of Jobs

Venkatesan Chakaravarthy, Arindam Pal, Sambuddha Roy +1

In this paper, we consider the problem of choosing a minimum cost set of resources for executing a specified set of jobs. Each input job is an interval, determined by its start-tim…

cs.DS2011

Minimum multicuts and Steiner forests for Okamura-Seymour graphs

Arindam Pal

We study the problem of finding minimum multicuts for an undirected planar graph, where all the terminal vertices are on the boundary of the outer face. This is known as an Okamura…