Large Engagement Networks for Classifying Coordinated Campaigns and Organic Twitter Trends

Fast Counting and Utilizing Induced 6-Cycles in Bipartite Networks

Density-aware Walks for Coordinated Campaign Detection

A Powerful Lens for Temporal Network Analysis: Temporal Motifs

Curated and Asymmetric Exposure: A Case Study of Partisan Talk during COVID on Twitter

From Words to Actions: A Comprehensive Approach to Identifying Incel Behavior on Reddit

Retrieving Top-k Hyperedge Triplets: Models and Applications

Skeletal Cores and Graph Resilience

Quantifying Node-Based Core Resilience

Using Motif Transitions for Temporal Graph Generation

On Cohesively Polarized Communities in Signed Networks

Counting Induced 6-Cycles in Bipartite Graphs

Temporal Motifs in Patent Opposition and Collaboration Networks

Identifying Taxonomic Units in Metagenomic DNA Streams on Mobile Devices

Motif-driven Dense Subgraph Discovery in Directed and Labeled Networks

Temporal network motifs: Models, Limitations, Evaluation

Using Large Cliques for Hierarchical Dense Subgraph Discovery

Characterizing and Utilizing the Interplay Between Core and Truss Decompositions

Residual Core Maximization: An Efficient Algorithm for Maximizing the Size of the k-Core

Identifying Taxonomic Units in Metagenomic DNA Streams

FLEET: Butterfly Estimation from a Bipartite Graph Stream

Analysis of Core and Truss Decompositions on Real-world Networks

Local Algorithms for Hierarchical Dense Subgraph Discovery

Butterfly Counting in Bipartite Networks

Local Detection of Critical Nodes in Active Graphs

Measuring and Improving the Core Resilience of Networks

Peeling Bipartite Networks for Dense Subgraph Discovery

Fast Hierarchy Construction for Dense Subgraphs

Nucleus Decompositions for Identifying Hierarchy of Dense Subgraphs

Graph Manipulations for Fast Centrality Computation

SONIC: Streaming Overlapping Community Detection

Incremental k-core Decomposition: Algorithms and Evaluation

Consistent Regions: Guaranteed Tuple Processing in IBM Streams

Incremental Closeness Centrality in Distributed Memory

Finding the Hierarchy of Dense Subgraphs using Nucleus Decompositions

Regularizing Graph Centrality Computations

Hardware/software Vectorization for Closeness Centrality on Multi-/many-core Architectures

Incremental Algorithms for Closeness Centrality

STREAMER: A Distributed Framework for Incremental Closeness Centrality Computation

Streaming algorithms for k-core decomposition

Shattering and Compressing Networks for Betweenness Centrality

Betweenness Centrality on GPUs and Heterogeneous Architectures

Scalable Hybrid Implementation of Graph Coloring using MPI and OpenMP

Improving Graph Coloring on Distributed-memory Parallel Computers