jedbib/jedbib.bib at master · jedbrown/jedbib · GitHub
Sebastian Forster - Paris Lodron Universität Salzburg
arXiv:2101.04610v1 [cs.SI] 10 Jan 2021
CSrankings-Graph/dblp-aliases.csv at gh-pages-qt · tete1030/CSrankings-Graph · GitHub
PDF) HOPS: Probabilistic Subtree Mining for Small and Large Graphs
PDF) DiSLR: Distributed Sampling with Limited Redundancy For Triangle Counting in Graph Streams
Gary Miller - Wikidata
Parallel Five-cycle Counting Algorithms
crosstex-dbgen/xtx/focs.xtx at master · el33th4x0r/crosstex-dbgen · GitHub
Spectral Algorithms for Temporal Graph Cuts
Dataset statistics. We count the number of unique hyper- edges and the... | Download Scientific Diagram
Spectral Algorithms for Temporal Graph Cuts
arXiv:2101.04610v1 [cs.SI] 10 Jan 2021
PDF) Computing Full Disjunctions
Triangle-aware Spectral Sparsifiers and Community Detection
Spectral Algorithms for Temporal Graph Cuts
Dataset statistics. We count the number of unique hyper- edges and the... | Download Scientific Diagram
David Tolliver's research works | Carnegie Mellon University, PA (CMU) and other places
LIPIcs,Vol.20,STACS'13] 30th International Symposium on Theoretical Aspects of Computer Science
arXiv:2101.04610v1 [cs.SI] 10 Jan 2021
PDF) Limits and Applications of Group Algebras for Parameterized Problems
David Tolliver's research works | Carnegie Mellon University, PA (CMU) and other places
Spectral Algorithms for Temporal Graph Cuts
