5 citations · 5 across the 8 of their papers we have counts for
8 papers
An \(O(\log n)\)-Approximation for Three-Terminal Reachability-Preserving Minimum Edge Cut
Qi Duan
In the three-terminal Reachability-Preserving Minimum Edge Cut problem, the input is an undirected edge-weighted graph with terminals \(s_1,s_2,t\). The objective is to delete a mi…
Threshold Minimum Cut with Terminal Quotas: Logarithmic and Planar Approximation Algorithms
Qi Duan
We study threshold minimum cut problems with a distinguished root vertex, a set of terminals, and a quota. In the threshold minimum edge cut problem (\TMEC), the goal is to find a…
Three-Terminal Reachability-Preserving Minimum Node Cut: Planar Hardness and a General-Graph \(O(\sqrt n)\)-Approximation
Qi Duan
We study the three-terminal reachability-preserving minimum node cut problem (\RPMNC). The input is an undirected graph \(G=(V,E)\), nonnegative vertex weights on nonterminal verti…
A Polynomial-Time -Approximation for Undirected Three-Terminal Reachability-Preserving Minimum Edge Cut
Qi Duan
We study the undirected three-terminal reachability-preserving minimum edge cut problem. The input is an undirected graph with nonnegative edge costs, two protected termi…
Range and Topology Mutation Based Wireless Agility
Qi Duan, Ehab Al-Shae, Jiang Xie
In this paper, we present formal foundations for two wireless agility techniques: (1) Random Range Mutation (RNM) that allows for periodic changes of AP coverage range randomly, an…
The Panacea Threat Intelligence and Active Defense Platform
Adam Dalton, Ehsan Aghaei, Ehab Al-Shaer +13
We describe Panacea, a system that supports natural language processing (NLP) components for active defenses against social engineering attacks. We deploy a pipeline of human langu…
On DDoS Attack Related Minimum Cut Problems
Qi Duan, Haadi Jafarian, Ehab Al-Shaer +1
In this paper, we study two important extensions of the classical minimum cut problem, called {\em Connectivity Preserving Minimum Cut (CPMC)} problem and {\em Threshold Minimum Cu…
On the Connectivity Preserving Minimum Cut Problem
Qi Duan, Jinhui Xu
In this paper, we study a generalization of the classical minimum cut prob- lem, called Connectivity Preserving Minimum Cut (CPMC) problem, which seeks a minimum cut to separate a…