PDF) Estimating Current-Flow Closeness Centrality with a Multigrid Laplacian Solver
Any-k: Anytime Top-k Tree Pattern Retrieval in Labeled Graphs
Distributed Triangle Approximately Counting Algorithms in Simple Graph Stream | ACM Transactions on Knowledge Discovery from Data
Ioannis Koutis's 53 research works in Medicine and Political Science
Fast, Accurate and Provable Triangle Counting in Fully Dynamic Graph Streams | ACM Transactions on Knowledge Discovery from Data
Spectral Algorithms for Temporal Graph Cuts
Sebastian Forster (University of Salzburg)
PDF) Exact Parameterized Multilinear Monomial Counting via k-Layer Subset Convolution and k-Disjoint Sum
Ioannis Koutis's 53 research works in Medicine and Political Science
Ioannis Koutis's 53 research works in Medicine and Political Science
Dataset/DBLP_DataSet.txt at master · MAK660/Dataset · GitHub
Distributed Triangle Approximately Counting Algorithms in Simple Graph Stream | ACM Transactions on Knowledge Discovery from Data
Ioannis Koutis
PDF) HOPS: Probabilistic Subtree Mining for Small and Large Graphs
Ioannis Koutis's 53 research works in Medicine and Political Science
Ioannis Koutis's 53 research works in Medicine and Political Science
Ioannis Koutis's 53 research works in Medicine and Political Science
Distributed Triangle Approximately Counting Algorithms in Simple Graph Stream | ACM Transactions on Knowledge Discovery from Data
Spectral Algorithms for Temporal Graph Cuts
lowerbounds-survey/references.bib at master · dasarpmar/lowerbounds-survey · GitHub
Kanat Tangwongsan's 46 research works in Philosophy and Social Science
Ioannis Koutis's 53 research works in Medicine and Political Science
Michal Valko's 96 research works in Psychology
Ioannis Koutis's 53 research works in Medicine and Political Science
