publications
- A Powerful Lens for Temporal Network Analysis: Temporal MotifsDiscoverData 2025 - Discover Data
- Curated and Asymmetric Exposure: A Case Study of Partisan Talk during COVID on TwitterICWSM 2024 - International Conference on Web and Social Media
- Using Large Cliques for Hierarchical Dense Subgraph DiscoveryCSoNET 2020 - International Conference on Computational Data and Social Networks
- Analysis of Core and Truss Decompositions on Real-world NetworksMLG 2019 - International Workshop on Mining and Learning with Graphs, in conjunction with SIGKDD
- Local Detection of Critical Nodes in Active GraphsASONAM 2018 - IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining
-
- Graph Manipulations for Fast Centrality ComputationTKDD 2017 - ACM Transactions on Knowledge Discovery from Data
- SONIC: Streaming Overlapping Community DetectionDAMI 2016 - Data Mining and Knowledge Discovery
- Consistent Regions: Guaranteed Tuple Processing in IBM StreamsVLDB 2016 - International Conference on Very Large Data Bases, Industrial Track
-
- Finding the Hierarchy of Dense Subgraphs using Nucleus DecompositionsWWW 2015 - International Conference on World Wide Web
- Regularizing Graph Centrality ComputationsJPDC 2015 - Journal of Parallel and Distributed Computing
- Hardware/Software Vectorization for Closeness Centrality on Multi-/Many-core ArchitecturesMTAAP 2014 - Workshop on Multithreaded Architectures and Applications, in conjunction with IPDPS
- Incremental Algorithms for Closeness CentralityBigData 2013 - IEEE International Conference on Big Data
- STREAMER: A Distributed Framework for Incremental Closeness Centrality ComputationCluster 2013 - IEEE International Conference on Cluster Computing
- Scalable Hybrid Implementation of Graph Coloring using MPI and OpenMPPCO 2012 - Workshop on Parallel Computing and Optimization, in conjunction with IPDPS
- Improving Graph Coloring on Distributed-memory Parallel ComputersHiPC 2011 - International Conference on High Performance Computing