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