On the public citation graph
TRIÈST
0 signed · 104 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/11533719_72openalex-snapshot
New Streaming Algorithms for Counting Triangles in Graphs
inferredcites →https://doi.org/10.1007/978-3-642-31585-5_53openalex-snapshot
Counting Arbitrary Subgraphs in Data Streams
inferredcites →https://doi.org/10.1007/s00453-015-0036-4openalex-snapshot
Triangle Counting in Dynamic Graph Streams
inferredcites →https://doi.org/10.1007/s00778-007-0065-yopenalex-snapshot
Maintaining bounded-size sample synopses of evolving datasets
inferredcites →https://doi.org/10.1016/j.ijforecast.2006.03.001openalex-snapshot
Another look at measures of forecast accuracy
inferredcites →https://doi.org/10.1016/j.ipl.2011.12.007openalex-snapshot
Colorful triangle counting and a MapReduce implementation
inferredcites →https://doi.org/10.1016/j.tcs.2008.07.017openalex-snapshot
Main-memory triangle computations for very large (sparse (power-law)) graphs
inferredcites →https://doi.org/10.1073/pnas.032093399openalex-snapshot
Curvature of co-links uncovers hidden thematic layers in the World Wide Web
inferredcites →https://doi.org/10.1080/15427951.2012.625260openalex-snapshot
Efficient Triangle Counting in Large Graphs via Degree-Based Vertex Partitioning
inferredcites →https://doi.org/10.1093/biomet/91.4.893openalex-snapshot
Efficient balanced sampling: The cube method
inferredcites →https://doi.org/10.1103/physreve.83.056119openalex-snapshot
Tolerating the community detection resolution limit with edge weighting
inferredcites →https://doi.org/10.1137/1.9780898716474openalex-snapshot
Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)
inferredcites →https://doi.org/10.1145/1142351.1142388openalex-snapshot
Counting triangles in data streams
inferredcites →https://doi.org/10.1145/1772690.1772751openalex-snapshot
What is Twitter, a social network or a news media?
inferredcites →https://doi.org/10.1145/1839490.1839494openalex-snapshot
Efficient algorithms for large-scale local triangle counting
inferredcites →https://doi.org/10.1145/1963405.1963491openalex-snapshot
Counting triangles and the curse of the last reducer
inferredcites →https://doi.org/10.1145/2318857.2254798openalex-snapshot
Don't let the negatives bring you down
inferredcites →https://doi.org/10.1145/2433396.2433480openalex-snapshot
On the streaming complexity of computing local clustering coefficients
inferredcites →https://doi.org/10.1145/2505515.2505563openalex-snapshot
An efficient MapReduce algorithm for counting triangles in a very large graph
inferredcites →https://doi.org/10.1145/2661829.2662017openalex-snapshot
MapReduce Triangle Enumeration With Guarantees
inferredcites →https://doi.org/10.1145/2700395openalex-snapshot
A Space-Efficient Streaming Algorithm for Estimating Transitivity and Triangle Counts Using the Birthday Paradox
inferredcites →https://doi.org/10.1145/2736277.2741638openalex-snapshot
Efficient Densest Subgraph Computation in Evolving Graphs
inferredcites →https://doi.org/10.1198/jasa.2006.s74openalex-snapshot
Probability and Computing: Randomized Algorithms and Probabilistic Analysis
inferredcites →https://doi.org/10.14778/2556549.2556569openalex-snapshot
Counting and sampling triangles from a graph stream
inferredcites →https://doi.org/10.14778/2856318.2856327openalex-snapshot
Ego-net community mining applied to friend suggestion
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-030-36683-4_17openalex-snapshot
Induced Edge Samplings and Triangle Count Distributions in Large Networks
inferred← citeshttps://doi.org/10.1007/978-3-030-46150-8_22openalex-snapshot
User-Guided Clustering in Heterogeneous Information Networks via Motif-Based Comprehensive Transcription
inferred← citeshttps://doi.org/10.1007/978-3-030-47426-3_60openalex-snapshot
Estimating Descriptors for Large Graphs
inferred← citeshttps://doi.org/10.1007/978-3-031-21131-7_23openalex-snapshot
Reconstructing Degree Distribution and Triangle Counts from Edge-Sampled Graphs
inferred← citeshttps://doi.org/10.1007/978-3-031-36027-5_50openalex-snapshot
Parallel Triangles and Squares Count for Multigraphs Using Vertex Covers
inferred← citeshttps://doi.org/10.1007/978-3-319-72150-7_22openalex-snapshot
Clustering-Structure Representative Sampling from Graph Streams
inferred← citeshttps://doi.org/10.1007/978-981-95-9877-9_9openalex-snapshot
TempoTriads: Streaming Estimation of Temporal Triadic Motifs for Social-Computing Streams
inferred← citeshttps://doi.org/10.1007/s00778-020-00624-7openalex-snapshot
Temporal locality-aware sampling for accurate triangle counting in real graph streams
inferred← citeshttps://doi.org/10.1007/s00778-022-00746-0openalex-snapshot
Accelerated butterfly counting with vertex priority on bipartite graphs
inferred← citeshttps://doi.org/10.1007/s00778-023-00783-3openalex-snapshot
Sliding window-based approximate triangle counting with bounded memory usage
inferred← citeshttps://doi.org/10.1007/s00778-025-00926-8openalex-snapshot
Efficiently Counting Four-Node Motifs in Large-Scale Temporal Graphs
inferred← citeshttps://doi.org/10.1007/s10115-021-01543-xopenalex-snapshot
Tracking triadic cardinality distributions for burst detection in high-speed graph streams
inferred← citeshttps://doi.org/10.1007/s10618-019-00630-6openalex-snapshot
FURL: Fixed-memory and uncertainty reducing local triangle counting for multigraph streams
inferred← citeshttps://doi.org/10.1007/s10619-025-07456-wopenalex-snapshot
Streaming triangle counting: the impact of a degree oracle
inferred← citeshttps://doi.org/10.1007/s11280-022-01117-zopenalex-snapshot
Top-k heavy weight triangles listing on graph stream
inferred← citeshttps://doi.org/10.1007/s41109-023-00574-3openalex-snapshot
Using a Bayesian approach to reconstruct graph statistics after edge sampling
inferred← citeshttps://doi.org/10.1016/j.array.2026.101199openalex-snapshot
When do predictions help streaming subgraph counting? A prediction-augmented algorithm and an empirical map
inferred← citeshttps://doi.org/10.1016/j.future.2019.07.047openalex-snapshot
A survey on quality-assurance approximate stream processing and applications
inferred← citeshttps://doi.org/10.1016/j.ins.2019.01.011openalex-snapshot
Cluster-preserving sampling from fully-dynamic streaming graphs
inferred← citeshttps://doi.org/10.1016/j.knosys.2023.110821openalex-snapshot
Learning node representation via Motif Coarsening
inferred← citeshttps://doi.org/10.1016/j.knosys.2023.110878openalex-snapshot
A distributed streaming framework for edge–cloud triangle counting in graph streams
inferred← citeshttps://doi.org/10.1017/nws.2021.2openalex-snapshot
Sampling methods and estimation of triangle count distributions in large networks
inferred← citeshttps://doi.org/10.1049/cit2.70184openalex-snapshot
Vertex Hashing Assignment‐Based Distributed Sampling Algorithm for Large‐Scale Dynamic Graph Stream
inferred← citeshttps://doi.org/10.1088/1742-6596/1550/3/032125openalex-snapshot
Estimate the number of triangles in real-world graph streams
inferred← citeshttps://doi.org/10.1109/hpec.2018.8547721openalex-snapshot
Estimating Edge-Local Triangle Count Heavy Hitters in Edge-Linear Time and Almost-Vertex-Linear Space
inferred← citeshttps://doi.org/10.1109/icc52391.2025.11160716openalex-snapshot
A Cloud-Edge Collaborative Framework for Distributed Triangle Counting on Graph Stream
inferred← citeshttps://doi.org/10.1109/icde.2019.00072openalex-snapshot
Discovering Maximal Motif Cliques in Large Heterogeneous Information Networks
inferred← citeshttps://doi.org/10.1109/icde.2019.00170openalex-snapshot
T-Sample: A Dual Reservoir-Based Sampling Method for Characterizing Large Graph Streams
inferred← citeshttps://doi.org/10.1109/icde55515.2023.00088openalex-snapshot
Reinforcement Learning Enhanced Weighted Sampling for Accurate Subgraph Counting on Fully Dynamic Graph Streams
inferred← citeshttps://doi.org/10.1109/icde60146.2024.00226openalex-snapshot
Counting Butterflies in Fully Dynamic Bipartite Graph Streams
inferred← citeshttps://doi.org/10.1109/icdm59182.2024.00010openalex-snapshot
Fast and Accurate Triangle Counting in Graph Streams Using Predictions
inferred← citeshttps://doi.org/10.1109/srds64841.2024.00028openalex-snapshot
DTC: Real-Time and Accurate Distributed Triangle Counting in Fully Dynamic Graph Streams
inferred← citeshttps://doi.org/10.1109/tbdata.2024.3522816openalex-snapshot
Cost-Aware Triangle Counting Over Geo-Distributed Datacenters
inferred← citeshttps://doi.org/10.1109/tkde.2021.3052938openalex-snapshot
Erasable Virtual HyperLogLog for Approximating Cumulative Distribution over Data Streams
inferred← citeshttps://doi.org/10.1109/tkde.2021.3062987openalex-snapshot
Approximately Counting Butterflies in Large Bipartite Graph Streams
inferred← citeshttps://doi.org/10.1109/tkde.2023.3236335openalex-snapshot
Efficiently Counting Triangles for Hypergraph Streams by Reservoir-Based Sampling
inferred← citeshttps://doi.org/10.1109/tkde.2024.3371228openalex-snapshot
Compact Estimator for Streaming Triangle Counting
inferred← citeshttps://doi.org/10.1142/s021819402140012xopenalex-snapshot
BSR-TC: Adaptively Sampling for Accurate Triangle Counting over Evolving Graph Streams
inferred← citeshttps://doi.org/10.1145/3200764openalex-snapshot
Interactive Visual Graph Mining and Learning
inferred← citeshttps://doi.org/10.1145/3269206.3271772openalex-snapshot
Mining Frequent Patterns in Evolving Graphs
inferred← citeshttps://doi.org/10.1145/3289600.3290988openalex-snapshot
Sampling Methods for Counting Temporal Motifs
inferred← citeshttps://doi.org/10.1145/3308558.3313534openalex-snapshot
Revisiting Wedge Sampling for Triangle Counting
inferred← citeshttps://doi.org/10.1145/3336191.3371823openalex-snapshot
Retrieving Top Weighted Triangles in Graphs
inferred← citeshttps://doi.org/10.1145/3375392openalex-snapshot
Fast, Accurate and Provable Triangle Counting in Fully Dynamic Graph Streams
inferred← citeshttps://doi.org/10.1145/3394486.3403073openalex-snapshot
How to Count Triangles, without Seeing the Whole Graph
inferred← citeshttps://doi.org/10.1145/3394486.3403136openalex-snapshot
Mining Persistent Activity in Continually Evolving Networks
inferred← citeshttps://doi.org/10.1145/3441487openalex-snapshot
CoCoS: Fast and Accurate Distributed Triangle Counting in Graph Streams
inferred← citeshttps://doi.org/10.1145/3442590openalex-snapshot
TipTap: Approximate Mining of Frequent k -Subgraph Patterns in Evolving Graphs
inferred← citeshttps://doi.org/10.1145/3465480.3468293openalex-snapshot
Tutorial on graph stream analytics
inferred← citeshttps://doi.org/10.1145/3485447.3512157openalex-snapshot
MiDaS: Representative Sampling from Real-world Hypergraphs
inferred← citeshttps://doi.org/10.1145/3494562openalex-snapshot
Distributed Triangle Approximately Counting Algorithms in Simple Graph Stream
inferred← citeshttps://doi.org/10.1145/3539597.3570438openalex-snapshot
DeMEtRIS: Counting (near)-Cliques by Crawling
inferred← citeshttps://doi.org/10.1145/3555806openalex-snapshot
Recent Advances in Fully Dynamic Graph Algorithms – A Quick Reference Guide
inferred← citeshttps://doi.org/10.1145/3627673.3679739openalex-snapshot
SGES: A General and Space-efficient Framework for Graphlet Counting in Graph Streams
inferred← citeshttps://doi.org/10.1145/3627673.3679812openalex-snapshot
FABLE: Approximate Butterfly Counting in Bipartite Graph Stream with Duplicate Edges
inferred← citeshttps://doi.org/10.1145/3653306openalex-snapshot
Representative and Back-In-Time Sampling from Real-world Hypergraphs
inferred← citeshttps://doi.org/10.1145/3699517openalex-snapshot
DeMEtRIS: Counting (near)-Cliques by Crawling
inferred← citeshttps://doi.org/10.1145/3767110.3767137openalex-snapshot
TriPIM — Exact Triangle Counting on UPMEM Processing-in-Memory for Graph Analytics
inferred← citeshttps://doi.org/10.1145/3769782openalex-snapshot
DRPQ: Distributed Evaluation of Regular Path Queries On Streaming Graphs
inferred← citeshttps://doi.org/10.1145/3769837openalex-snapshot
Triangle Counting in Hypergraph Streams: A Complete and Practical Approach
inferred← citeshttps://doi.org/10.1145/3848520openalex-snapshot
Efficient and Complete Triangle Counting in Hypergraph Streams
inferred← citeshttps://doi.org/10.14778/3339490.3339497openalex-snapshot
Vertex priority based butterfly counting for large-scale bipartite networks
inferred← citeshttps://doi.org/10.14778/3734839.3734842openalex-snapshot
GREAT: Generalized Reservoir Sampling Based Triangle Counting Estimation over Streaming Graphs
inferred← citeshttps://doi.org/10.14778/3742728.3742748openalex-snapshot
Efficient and Adaptive Estimation of Local Triadic Coefficients
inferred← citeshttps://doi.org/10.3233/ida-216169openalex-snapshot
Temporal motif-based attentional graph convolutional network for dynamic link prediction
inferred← citeshttps://doi.org/10.3390/app12147210openalex-snapshot
Mosar: Efficiently Characterizing Both Frequent and Rare Motifs in Large Graphs
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.