Fast, Accurate and Provable Triangle Counting in Fully Dynamic Graph Streams
PDF) Finding and Counting Vertex-Colored Subtrees
Any-k: Anytime Top-k Tree Pattern Retrieval in Labeled Graphs
PDF) HOPS: Probabilistic Subtree Mining for Small and Large Graphs
Fast, Accurate and Provable Triangle Counting in Fully Dynamic Graph Streams
PDF) Any-k: Anytime Top-k Tree Pattern Retrieval in Labeled Graphs
Fast, Accurate and Provable Triangle Counting in Fully Dynamic Graph Streams
PDF) Isoperimetric Partitioning: A New Algorithm for Graph Partitioning
PDF) Finding effective support-tree preconditioned
Fast, Accurate and Provable Triangle Counting in Fully Dynamic Graph Streams
PDF) Any-k: Anytime Top-k Tree Pattern Retrieval in Labeled Graphs
Sebastian Forster (University of Salzburg)
Current Flow Group Closeness Centrality for Complex Networks | DeepAI
PDF) On Sampling from Multivariate Distributions
PDF) Limits and Applications of Group Algebras for Parameterized Problems
Fast, Accurate and Provable Triangle Counting in Fully Dynamic Graph Streams | ACM Transactions on Knowledge Discovery from Data
PDF) Function Matching
PDF) The Resistance Perturbation Distance: A Metric for the Analysis of Dynamic Networks
Ioannis Koutis's research works | University of Puerto Rico at Rio Piedras, San Juan (UPR-RP) and other places
PDF) Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
Publications
PDF) Parallel Graph Decomposition and Diameter Approximation in o(Diameter) Time and Linear Space
Fast, Accurate and Provable Triangle Counting in Fully Dynamic Graph Streams
Gary Miller (computer scientist) - Wikipedia
PDF) A Nearly-m log n Time Solver for SDD Linear Systems
Publications - Carnegie Mellon Database Group
