NewEvery arXiv paper, its researchers & institutions — mapped.
papers

Publications (39)

cs.SI2013

Dynamics of Trust Reciprocation in Heterogenous MMOG Networks

Ayush Singhal, Karthik Subbian, Jaideep Srivastava +2

cs.DS2011

Hypergraph Partitioning through Vertex Separators on Graphs

Enver Kayaaslan, Ali Pinar, Umit V. Catalyurek +1

cs.SI2017

Active Betweenness Cardinality: Algorithms and Applications

Yusuf Ozkaya, A. Erdem Sariyuce, Umit V. Catalyurek +1

math.OC2012

N-k-e Survivable Power System Design

Richard Li-Yang Chen, Amy Cohn, Neng Fan +1

cs.SI2011

Computing an Aggregate Edge-Weight Function for Clustering Graphs with Multiple Edge Types

Matthew Rocklin, Ali Pinar

cs.SI2016

ESCAPE: Efficiently Counting All 5-Vertex Subgraphs

Ali Pinar, C. Seshadhri, V. Vishal

cs.CE2015

Efficient Representation of Uncertainty for Stochastic Economic Dispatch

Cosmin Safta, Richard L. -Y. Chen, Habib N. Najm +2

cs.SI2018

Local Algorithms for Hierarchical Dense Subgraph Discovery

Ahmet Erdem Sariyuce, C. Seshadhri, Ali Pinar

cs.DS2014

Path Sampling: A Fast and Provable Method for Estimating 4-Vertex Subgraph Counts

Madhav Jha, C. Seshadhri, Ali Pinar

cs.SI2013

A Scalable Null Model for Directed Graphs Matching All Degree Distributions: In, Out, and Reciprocal

Nurcan Durak, Tamara G. Kolda, Ali Pinar +1

physics.soc-ph2014

Accelerating Community Detection by Using K-core Subgraphs

Chengbin Peng, Tamara G. Kolda, Ali Pinar

math.OC2014

Contingency-Constrained Unit Commitment with Post-Contingency Corrective Recourse

Richard Li-Yang Chen, Neng Fan, Ali Pinar +1

cs.SI2013

An In-Depth Analysis of Stochastic Kronecker Graphs

C. Seshadhri, Ali Pinar, Tamara G. Kolda

math.OC2013

Contingency-Risk Informed Power System Design

Richard Li-Yang Chen, Amy Cohn, Neng Fan +1

cs.SI2014

Directed closure measures for networks with reciprocity

C. Seshadhri, Ali Pinar, Nurcan Durak +1

cs.CE2015

Trigger detection for adaptive scientific workflows using percentile sampling

Janine C. Bennett, Ankit Bhagatwala, Jacqueline H. Chen +3

cs.SI2017

Peeling Bipartite Networks for Dense Subgraph Discovery

A. Erdem Sariyuce, Ali Pinar

cs.SI2011

Community structure and scale-free collections of Erdös-Rényi graphs

C. Seshadhri, Tamara G. Kolda, Ali Pinar

cs.DS2011

Constructing and Sampling Graphs with a Prescribed Joint Degree Distribution

Isabelle Stanton, Ali Pinar

cs.DS2014

Counting Triangles in Real-World Graph Streams: Dealing with Repeated Edges and Time Windows

Madhav Jha, C. Seshadhri, Ali Pinar

cs.SI2016

Fast Hierarchy Construction for Dense Subgraphs

A. Erdem Sariyuce, Ali Pinar

cs.SI2018

Provable and practical approximations for the degree distribution using sublinear graph samples

Talya Eden, Shweta Jain, Ali Pinar +2

cs.DS2011

A Linear Approximation Algorithm for 2-Dimensional Vector Packing

Ekow Otoo, Ali Pinar, Doron Rotem

cs.SI2013

Counting Triangles in Massive Graphs with MapReduce

Tamara G. Kolda, Ali Pinar, Todd Plantenga +2

math.OC2011

An Implicit Optimization Approach for Survivable Network Design

Richard Chen, Amy Cohn, Ali Pinar

cs.SI2012

Triadic Measures on Graphs: The Power of Wedge Sampling

C. Seshadhri, Ali Pinar, Tamara G. Kolda

cs.SI2015

Diamond Sampling for Approximate Maximum All-pairs Dot-product (MAD) Search

Grey Ballard, Ali Pinar, Tamara G. Kolda +1

cs.SI2012

Are we there yet? When to stop a Markov chain while generating random graphs

Jaideep Ray, Ali Pinar, C. Seshadhri

cs.DS2013

A space efficient streaming algorithm for triangle counting using the birthday paradox

Madhav Jha, C. Seshadhri, Ali Pinar

cs.SI2011

The Similarity between Stochastic Kronecker and Chung-Lu Graph Models

Ali Pinar, C. Seshadhri, Tamara G. Kolda

cs.SI2016

Measuring and Modeling Bipartite Graphs with Community Structure

Sinan Aksoy, Tamara G. Kolda, Ali Pinar

cs.SI2015

MaxOutProbe: An Algorithm for Increasing the Size of Partially Observed Networks

Sucheta Soundarajan, Tina Eliassi-Rad, Brian Gallagher +1

cs.IT2015

Bounded Degree Approximations of Stochastic Networks

Christopher J. Quinn, Ali Pinar, Negar Kiyavash

cs.SI2011

On Clustering on Graphs with Multiple Edge Types

Matthew Rocklin, Ali Pinar

cs.SI2015

Finding the Hierarchy of Dense Subgraphs using Nucleus Decompositions

Ahmet Erdem Sariyuce, C. Seshadhri, Ali Pinar +1

cs.CE2015

Enabling adaptive scientific workflows via trigger detection

Maher Salloum, Janine C. Bennett, Ali Pinar +2

cs.SI2012

Degree Relations of Triangles in Real-world Networks and Models

Nurcan Durak, Ali Pinar, Tamara G. Kolda +1

cs.SI2013

A Scalable Generative Graph Model with Community Structure

Tamara G. Kolda, Ali Pinar, Todd Plantenga +1

cs.SI2014

Wedge Sampling for Computing Clustering Coefficients and Triangle Counts on Large Graphs

C. Seshadhri, Ali Pinar, Tamara G. Kolda