PDF) A Nearly-m log n Time Solver for SDD Linear Systems
PDF) HOPS: Probabilistic Subtree Mining for Small and Large Graphs
PDF) Function Matching
Publications - Carnegie Mellon Database Group
PDF) Parallel Graph Decomposition and Diameter Approximation in o(Diameter) Time and Linear Space
PDF) On the Discrete Unit Disk Cover Problem
Fast, Accurate and Provable Triangle Counting in Fully Dynamic Graph Streams
PDF) Towards the effective parallel computation of matrix pseudospectra.
Publications
Sebastian Forster (University of Salzburg)
Ioannis Koutis
Current Flow Group Closeness Centrality for Complex Networks | DeepAI
Ioannis Koutis's research works | University of Puerto Rico at Rio Piedras, San Juan (UPR-RP) and other places
Gary Miller (computer scientist) - Wikipedia
crosstex-dbgen/focs.xtx at master · el33th4x0r/crosstex-dbgen · GitHub
PDF) Limits and Applications of Group Algebras for Parameterized Problems
PDF) Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
Publications - Carnegie Mellon Database Group
PDF) Isoperimetric Partitioning: A New Algorithm for Graph Partitioning
Fast, Accurate and Provable Triangle Counting in Fully Dynamic Graph Streams
PDF) Stable Transductive Learning
PDF) Finding and Counting Vertex-Colored Subtrees
PDF) Any-k: Anytime Top-k Tree Pattern Retrieval in Labeled Graphs
PDF) Large Scale Spectral Clustering Using Approximate Commute Time Embedding
Fast, Accurate and Provable Triangle Counting in Fully Dynamic Graph Streams
Fast, Accurate and Provable Triangle Counting in Fully Dynamic Graph Streams
Any-k: Anytime Top-k Tree Pattern Retrieval in Labeled Graphs
