On the public citation graph
Fast Computation of Dense Temporal Subgraphs
0 signed · 91 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.1006/jcss.2001.1754openalex-snapshot
Sharing the Cost of Multicast Transmissions
inferredcites →https://doi.org/10.1007/978-3-642-02927-1_50openalex-snapshot
On Finding Dense Subgraphs
inferredcites →https://doi.org/10.1007/s00453-012-9714-7openalex-snapshot
On the Complexity of Time-Dependent Shortest Paths
inferredcites →https://doi.org/10.1007/s10107-005-0660-xopenalex-snapshot
An Algorithmic Framework for the Exact Solution of the Prize-Collecting Steiner Tree Problem
inferredcites →https://doi.org/10.1007/springerreference_57547openalex-snapshot
Approximation Algorithms
inferredcites →https://doi.org/10.1016/0022-0000(83)90006-5openalex-snapshot
A data structure for dynamic trees
inferredcites →https://doi.org/10.1109/icde.2016.7498269openalex-snapshot
Durable graph pattern queries on historical graphs
inferredcites →https://doi.org/10.1109/icdm.2011.101openalex-snapshot
Mining Heavy Subgraphs in Time-Evolving Networks
inferredcites →https://doi.org/10.1109/icdm.2013.106openalex-snapshot
Mining Evolving Network Processes
inferredcites →https://doi.org/10.1109/icdm.2013.32openalex-snapshot
On Anomalous Hotspot Discovery in Graph Streams
inferredcites →https://doi.org/10.1137/1.9781611972825.15openalex-snapshot
Multi-skill Collaborative Teams based on Densest Subgraphs
inferredcites →https://doi.org/10.1137/1.9781611972832.4openalex-snapshot
NetSpot: Spotting Significant Anomalous Regions on Dynamic Networks
inferredcites →https://doi.org/10.1145/1824777.1824780openalex-snapshot
A local algorithm for finding dense subgraphs
inferredcites →https://doi.org/10.1145/1989323.1989420openalex-snapshot
Incremental graph pattern matching
inferredcites →https://doi.org/10.1145/2508020.2489791openalex-snapshot
Incremental graph pattern matching
inferredcites →https://doi.org/10.1145/2684822.2685298openalex-snapshot
Finding Subgraphs with Maximum Total Density and Limited Overlap
inferredcites →https://doi.org/10.1145/2723372.2723717openalex-snapshot
Minimum Spanning Trees in Temporal Graphs
inferredcites →https://doi.org/10.1145/2736277.2741638openalex-snapshot
Efficient Densest Subgraph Computation in Evolving Graphs
inferredcites →https://doi.org/10.1145/2746539.2746592openalex-snapshot
Space- and Time-Efficient Algorithm for Maintaining Dense Subgraphs on One-Pass Dynamic Streams
inferredcites →https://doi.org/10.1145/2882903.2882933openalex-snapshot
Graph Indexing for Shortest-Path Finding over Dynamic Sub-Graphs
inferredcites →https://doi.org/10.14778/1920841.1920986openalex-snapshot
Graph homomorphism revisited for graph matching
inferredcites →https://doi.org/10.14778/2732939.2732945openalex-snapshot
Path problems in temporal graphs
inferredcites →https://doi.org/10.14778/2856318.2856320openalex-snapshot
Behavior query discovery in system-generated temporal graphs
inferredcites →https://doi.org/10.5555/338219.338637openalex-snapshot
The prize collecting Steiner tree problem: theory and practice
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-75762-5_32openalex-snapshot
Discovering Dense Correlated Subgraphs in Dynamic Networks
inferred← citeshttps://doi.org/10.1007/978-3-031-25158-0_38openalex-snapshot
Mining Periodic k-Clique from Real-World Sparse Temporal Networks
inferred← citeshttps://doi.org/10.1007/978-981-16-0171-2_58openalex-snapshot
Superimposing Periodic Subgraph Mining in Dynamic Social Network
inferred← citeshttps://doi.org/10.1007/s00778-026-00977-5openalex-snapshot
Efficiently querying connected components in large temporal graphs via scalable and maintainable indices
inferred← citeshttps://doi.org/10.1007/s10115-025-02396-4openalex-snapshot
Efficient stable community search in temporal signed graphs
inferred← citeshttps://doi.org/10.1007/s10618-018-0602-xopenalex-snapshot
Finding lasting dense subgraphs
inferred← citeshttps://doi.org/10.1007/s11227-023-05451-5openalex-snapshot
Continuous community search with attribute constraints in temporal graphs
inferred← citeshttps://doi.org/10.1007/s11280-019-00674-0openalex-snapshot
Distributed time-respecting flow graph pattern matching on temporal graphs
inferred← citeshttps://doi.org/10.1007/s11280-021-00917-zopenalex-snapshot
Efficient continual cohesive subgraph search in large temporal graphs
inferred← citeshttps://doi.org/10.1007/s11390-022-2431-zopenalex-snapshot
Discovering Cohesive Temporal Subgraphs with Temporal Density Aware Exploration
inferred← citeshttps://doi.org/10.1007/s12626-025-00187-5openalex-snapshot
A Review of Temporal Networks: Operations and Applications
inferred← citeshttps://doi.org/10.1007/s41019-019-00105-0openalex-snapshot
Time-Dependent Graphs: Definitions, Applications, and Algorithms
inferred← citeshttps://doi.org/10.1007/s41019-023-00218-7openalex-snapshot
An Efficient Keywords Search in Temporal Social Networks
inferred← citeshttps://doi.org/10.1007/s44248-025-00032-8openalex-snapshot
A powerful lens for temporal network analysis: temporal motifs
inferred← citeshttps://doi.org/10.1109/bigdata52589.2021.9671984openalex-snapshot
Efficient Scalable Temporal Web Graph Store
inferred← citeshttps://doi.org/10.1109/icde.2018.00077openalex-snapshot
Persistent Community Search in Temporal Networks
inferred← citeshttps://doi.org/10.1109/icde.2019.00075openalex-snapshot
Finding Densest Lasting Subgraphs in Dynamic Graphs: A Stochastic Approach
inferred← citeshttps://doi.org/10.1109/icde.2019.00104openalex-snapshot
Mining Periodic Cliques in Temporal Networks
inferred← citeshttps://doi.org/10.1109/icde48307.2020.00066openalex-snapshot
Updates-Aware Graph Pattern based Node Matching
inferred← citeshttps://doi.org/10.1109/icde60146.2024.00240openalex-snapshot
Efficient Maximal Temporal Plex Enumeration
inferred← citeshttps://doi.org/10.1109/icde65706.2026.00010openalex-snapshot
GeminiSketch: An Accurate and Efficient Sketch for Summarizing Temporal Graph Streams with Rolling-Out Elimination
inferred← citeshttps://doi.org/10.1109/icdis55630.2022.00062openalex-snapshot
Fuzzy Utility Mining on Temporal Data
inferred← citeshttps://doi.org/10.1109/jiot.2024.3353727openalex-snapshot
Privacy-Preserving and Secure Industrial Big Data Analytics: A Survey and the Research Framework
inferred← citeshttps://doi.org/10.1109/swc50871.2021.00044openalex-snapshot
Finding Early Bursting Cohesive Subgraphs in Large Temporal Networks
inferred← citeshttps://doi.org/10.1109/tbdata.2020.2974849openalex-snapshot
Mining Stable Communities in Temporal Networks by Density-Based Clustering
inferred← citeshttps://doi.org/10.1109/tbdata.2021.3058294openalex-snapshot
Mining Diversified Top-r Lasting Cohesive Subgraphs on Temporal Networks
inferred← citeshttps://doi.org/10.1109/tii.2019.2955144openalex-snapshot
Effective and Efficient Dense Subgraph Query in Large-Scale Social Internet of Things
inferred← citeshttps://doi.org/10.1109/tkde.2019.2891604openalex-snapshot
An Efficient Approach to Finding Dense Temporal Subgraphs
inferred← citeshttps://doi.org/10.1109/tkde.2019.2942294openalex-snapshot
Incremental Graph Pattern Based Node Matching with Multiple Updates
inferred← citeshttps://doi.org/10.1109/tkde.2020.2968901openalex-snapshot
Time-Respecting Flow Graph Pattern Matching on Temporal Graphs
inferred← citeshttps://doi.org/10.1109/tkde.2020.3025463openalex-snapshot
A Stochastic Approach to Finding Densest Temporal Subgraphs in Dynamic Graphs
inferred← citeshttps://doi.org/10.1109/tkde.2020.3028025openalex-snapshot
Periodic Communities Mining in Temporal Networks: Concepts and Algorithms
inferred← citeshttps://doi.org/10.1109/tkde.2022.3175800openalex-snapshot
Stable Subgraph Isomorphism Search in Temporal Networks
inferred← citeshttps://doi.org/10.1109/tkde.2022.3233788openalex-snapshot
Densest Periodic Subgraph Mining on Large Temporal Graphs
inferred← citeshttps://doi.org/10.1109/tkde.2023.3290295openalex-snapshot
Reliability-Driven Local Community Search in Dynamic Networks
inferred← citeshttps://doi.org/10.1109/tkde.2025.3538514openalex-snapshot
Discovery of Temporal Network Motifs
inferred← citeshttps://doi.org/10.1109/tkde.2025.3620605openalex-snapshot
Efficient $k$k-Plex Mining in Temporal Graphs
inferred← citeshttps://doi.org/10.1109/tpami.2025.3637114openalex-snapshot
Demystifying Higher-Order Graph Neural Networks
inferred← citeshttps://doi.org/10.1109/tpds.2021.3131677openalex-snapshot
Practice of Streaming Processing of Dynamic Graphs: Concepts, Models, and Systems
inferred← citeshttps://doi.org/10.1109/tsmc.2021.3071721openalex-snapshot
Mining Stable Quasi-Cliques on Temporal Networks
inferred← citeshttps://doi.org/10.1145/3243734.3243829openalex-snapshot
Threat Intelligence Computing
inferred← citeshttps://doi.org/10.1145/3340531.3412091openalex-snapshot
Seasonal-Periodic Subgraph Mining in Temporal Networks
inferred← citeshttps://doi.org/10.1145/3418226openalex-snapshot
Span-core Decomposition for Temporal Networks
inferred← citeshttps://doi.org/10.1145/3589315openalex-snapshot
On Querying Connected Components in Large Temporal Graphs
inferred← citeshttps://doi.org/10.1145/3589334.3645438openalex-snapshot
Efficient Exact and Approximate Betweenness Centrality Computation for Temporal Graphs
inferred← citeshttps://doi.org/10.1145/3711896.3737149openalex-snapshot
TempASD: Temporal Anomalous Subgraph Discovery in Large-Scale Dynamic Financial Networks
inferred← citeshttps://doi.org/10.1155/2023/1974161openalex-snapshot
An Efficient Dynamic Programming Algorithm for Finding Group Steiner Trees in Temporal Graphs
inferred← citeshttps://doi.org/10.1177/1088467x251401352openalex-snapshot
Uncovering periodic group behaviors in temporal bipartite social graphs
inferred← citeshttps://doi.org/10.14778/3358701.3358704openalex-snapshot
Online density bursting subgraph detection from temporal graphs
inferred← citeshttps://doi.org/10.14778/3551793.3551834openalex-snapshot
Reliable community search in dynamic networks
inferred← citeshttps://doi.org/10.14778/3648160.3648163openalex-snapshot
QTCS: Efficient Query-Centered Temporal Community Search
inferred← citeshttps://doi.org/10.14778/3681954.3681997openalex-snapshot
Efficient Maximal Frequent Group Enumeration in Temporal Bipartite Graphs
inferred← citeshttps://doi.org/10.21203/rs.3.rs-1700121/v1openalex-snapshot
An Efficient Keyword Search on Temporal Graphs
inferred← citeshttps://doi.org/10.26599/tst.2021.9010090openalex-snapshot
Discovering Association Rules with Graph Patterns in Temporal Networks
inferred← citeshttps://doi.org/10.3929/ethz-b-000462546openalex-snapshot
Practice of Streaming and Dynamic Graphs: Concepts, Models, Systems, and Parallelism
inferred← citeshttps://doi.org/10.48550/arxiv.1910.03645openalex-snapshot
Span-core Decomposition for Temporal Networks: Algorithms and Applications
inferred← citeshttps://doi.org/10.48550/arxiv.1911.02780openalex-snapshot
Mining Bursting Communities in Temporal 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.