PDF) A Nearly-m log n Time Solver for SDD Linear Systems
PDF) Locating highly connected clusters in large networks with HyperLogLog counters
Ioannis Koutis's 53 research works in Medicine and Political Science
Sebastian Forster (University of Salzburg)
Ioannis Koutis's 53 research works in Medicine and Political Science
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
PDF) HOPS: Probabilistic Subtree Mining for Small and Large Graphs
Kanat Tangwongsan's 46 research works in Philosophy and Social Science
Distributed Triangle Approximately Counting Algorithms in Simple Graph Stream | ACM Transactions on Knowledge Discovery from Data
Sebastian Forster (University of Salzburg)
PDF) Two Arc-Disjoint Paths in Eulerian Digraphs
Ioannis Koutis's 53 research works in Medicine and Political Science
Fast, Accurate and Provable Triangle Counting in Fully Dynamic Graph Streams
PDF) Exact Parameterized Multilinear Monomial Counting via k-Layer Subset Convolution and k-Disjoint Sum
Spectral Algorithms for Temporal Graph Cuts
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
PDF) Towards the effective parallel computation of matrix pseudospectra.
Fast, Accurate and Provable Triangle Counting in Fully Dynamic Graph Streams | ACM Transactions on Knowledge Discovery from Data
Spectral Algorithms for Temporal Graph Cuts
lowerbounds-survey/references.bib at master · dasarpmar/lowerbounds-survey · GitHub
Michal Valko's 96 research works in Psychology
