252 citations · 1.1k across the 38 of their papers we have counts for
42 papers
Batch Dynamic Algorithm to Find k-Cores and Hierarchies
Kasimir Gabert, Ali Pınar, Ümit V. Çatalyürek
Finding -cores in graphs is a valuable and effective strategy for extracting dense regions of otherwise sparse graphs. We focus on the important problem of maintaining cores on…
Data-Driven Robust Optimization Using Scenario-Induced Uncertainty Sets
Meysam Cheramin, Richard Li-Yang Chen, Jianqiang Cheng +1
Uncertainty sets are at the heart of robust optimization (RO) because they play a key role in determining the RO models' tractability, robustness, and conservativeness. Different t…
Defender Policy Evaluation and Resource Allocation Using MITRE ATT&CK Evaluations Data
Alexander V. Outkin, Patricia V. Schulz, Timothy Schulz +2
Protecting against multi-step attacks of uncertain duration and timing forces defenders into an indefinite, always ongoing, resource-intensive response. To effectively allocate res…
Provable and practical approximations for the degree distribution using sublinear graph samples
Talya Eden, Shweta Jain, Ali Pinar +2
The degree distribution is one of the most fundamental properties used in the analysis of massive graphs. There is a large literature on graph sampling, where the goal is to estima…
Local Algorithms for Hierarchical Dense Subgraph Discovery
Ahmet Erdem Sariyuce, C. Seshadhri, Ali Pinar
Finding the dense regions of a graph and relations among them is a fundamental problem in network analysis. Core and truss decompositions reveal dense subgraphs with hierarchical r…
Peeling Bipartite Networks for Dense Subgraph Discovery
A. Erdem Sariyuce, Ali Pinar
Finding dense bipartite subgraphs and detecting the relations among them is an important problem for affiliation networks that arise in a range of domains, such as social network a…