| Scalable and Memory-Efficient Algorithms for Controlling Networked Epidemic Processes Using Multiplicative Weights Update Method | 0 | 0.34 | 2022 |
| Scalable and Memory-Efficient Algorithms for Controlling Networked Epidemic Processes Using Multiplicative Weights Update Method. | 0 | 0.34 | 2022 |
| Characterizing Performance of Graph Neighborhood Communication Patterns | 0 | 0.34 | 2022 |
| Towards scaling community detection on distributed-memory heterogeneous systems | 0 | 0.34 | 2022 |
| cuTS: scaling subgraph isomorphism on distributed multi-GPU systems using trie based data structure | 0 | 0.34 | 2021 |
| EXAGRAPH: Graph and combinatorial methods for enabling exascale applications | 1 | 0.35 | 2021 |
| Single-node partitioned-memory for huge graph analytics: cost and performance trade-offs | 0 | 0.34 | 2021 |
| A Parallel Approximation Algorithm for Maximizing Submodular b-Matching. | 0 | 0.34 | 2021 |
| Message from the workshop chairs | 0 | 0.34 | 2020 |
| Vertex Reordering for Real-World Graphs and Applications: An Empirical Evaluation | 0 | 0.34 | 2020 |
| Introduction to the TOPC Special Issue on Innovations in Systems for Irregular Applications, Part 2 | 0 | 0.34 | 2020 |
| cuRipples: influence maximization on multi-GPU systems | 2 | 0.37 | 2020 |
| Direction-optimizing label propagation and its application to community detection | 0 | 0.34 | 2020 |
| PREEMPT: Scalable Epidemic Interventions Using Submodular Optimization on Multi-GPU Systems | 1 | 0.63 | 2020 |
| TriC: Distributed-memory Triangle Counting by Exploiting the Graph Structure | 5 | 0.42 | 2020 |
| Introduction to the TOPC Special Issue on Innovations in Systems for Irregular Applications, Part 1 | 0 | 0.34 | 2020 |
| Scaling and Quality of Modularity Optimization Methods for Graph Clustering | 2 | 0.35 | 2019 |
| Distributed Direction-Optimizing Label Propagation for Community Detection | 2 | 0.35 | 2019 |
| Fast and Scalable Implementations of Influence Maximization Algorithms | 1 | 0.35 | 2019 |
| A 2/3-Approximation Algorithm for Vertex Weighted Matching in Bipartite Graphs. | 0 | 0.34 | 2019 |
| Exploring MPI Communication Models for Graph Applications Using Graph Matching as a Case Study | 0 | 0.34 | 2019 |
| Mapping Arbitrarily Sparse Two-Body Interactions on One-Dimensional Quantum Circuits | 0 | 0.34 | 2019 |
| Distributed Louvain Algorithm for Graph Community Detection | 3 | 0.37 | 2018 |
| Optimizing Distributed Data-Intensive Workflows | 0 | 0.34 | 2018 |
| Scalable Distributed Memory Community Detection Using Vite | 1 | 0.34 | 2018 |
| Exploring the Role of Intrinsic Nodal Activation on the Spread of Influence in Complex Networks. | 0 | 0.34 | 2018 |
| Dynamic graphs, community detection, and Riemannian geometry. | 1 | 0.36 | 2018 |
| MiniVite: A Graph Analytics Benchmarking Tool for Massively Parallel Systems | 4 | 0.39 | 2018 |
| Guest Editorial: Advances in Parallel Graph Processing: Algorithms, Architectures, and Application Frameworks. | 0 | 0.34 | 2018 |
| Introduction to GraML 2018. | 0 | 0.34 | 2018 |
| A 2/3-Approximation Algorithm for Vertex-weighted Matching in Bipartite Graphs. | 1 | 0.36 | 2018 |
| Stochastic Programming Approach for Resource Selection Under Demand Uncertainty. | 0 | 0.34 | 2018 |
| Adaptive anonymization of data using b-edge cover. | 0 | 0.34 | 2018 |
| Approximate Computing Techniques for Iterative Graph Algorithms | 0 | 0.34 | 2017 |
| Algorithms for Balanced Graph Colorings with Applications in Parallel Computing | 2 | 0.39 | 2017 |
| A generative graph model for electrical infrastructure networks | 1 | 0.35 | 2017 |
| AMPS: An Augmented Matrix Formulation for Principal Submatrix Updates with Application to Power Grids. | 1 | 0.37 | 2017 |
| Towards Efficient Resource Allocation for Distributed Workflows Under Demand Uncertainties. | 3 | 0.42 | 2017 |
| Exploring performance and energy tradeoffs for irregular applications: A case study on the Tilera many-core architecture. | 0 | 0.34 | 2017 |
| Flipnet. Modeling Covert And Persistent Attacks On Networked Resources | 0 | 0.34 | 2017 |
| Community Detection on the GPU | 2 | 0.38 | 2017 |
| Scalable static and dynamic community detection using Grappolo | 4 | 0.37 | 2017 |
| Introduction to GraML Workshop. | 0 | 0.34 | 2017 |
| Formal Approach for Resilient Reachability based on End-System Route Agility. | 1 | 0.37 | 2016 |
| On Stable Marriages and Greedy Matchings. | 0 | 0.34 | 2016 |
| Accelerating the mining of influential nodes in complex networks through community detection. | 4 | 0.44 | 2016 |
| Designing scalable b-Matching algorithms on distributed memory multiprocessors by approximation. | 0 | 0.34 | 2016 |
| Accelerating the mining of influential nodes in complex networks through community detection | 1 | 0.36 | 2016 |
| Influence Maximization on Complex Networks with Intrinsic Nodal Activation. | 1 | 0.35 | 2016 |
| Efficient Approximation Algorithms for Weighted b-Matching. | 2 | 0.38 | 2016 |
