On the public citation graph

Span-core Decomposition for Temporal Networks

0 signed · 98 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/pmic.200400962openalex-snapshot
Peeling the yeast protein network
inferredcites →https://doi.org/10.1006/jagm.1994.1032openalex-snapshot
Generating Sparse 2-Spanners
inferredcites →https://doi.org/10.1007/3-540-44436-x_10openalex-snapshot
Greedy Approximation Algorithms for Finding Dense Components in a Graph
inferredcites →https://doi.org/10.1007/3-540-46648-7_9openalex-snapshot
Partitioning Approach to Visualization of Large Graphs
inferredcites →https://doi.org/10.1007/978-1-4939-7131-2openalex-snapshot
Encyclopedia of Social Network Analysis and Mining
inferredcites →https://doi.org/10.1007/978-3-319-23525-7_39openalex-snapshot
Finding Dense Subgraphs in Relational Graphs
inferredcites →https://doi.org/10.1007/978-3-540-95995-3_3openalex-snapshot
Finding Dense Subgraphs with Size Bounds
inferredcites →https://doi.org/10.1007/978-3-642-04180-8_25openalex-snapshot
Mining Graph Evolution Rules
inferredcites →https://doi.org/10.1007/978-3-642-17517-6_36openalex-snapshot
Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time
inferredcites →https://doi.org/10.1007/978-3-642-33492-4_11openalex-snapshot
Cohesive Co-evolution Patterns in Dynamic Attributed Graphs
inferredcites →https://doi.org/10.1007/s00778-017-0482-5openalex-snapshot
Effective and efficient attributed community search
inferredcites →https://doi.org/10.1007/s00778-019-00556-xopenalex-snapshot
A survey of community search over big graphs
inferredcites →https://doi.org/10.1007/s00778-019-00587-4openalex-snapshot
The core decomposition of networks: theory, algorithms and applications
inferredcites →https://doi.org/10.1007/s10115-012-0539-0openalex-snapshot
D-cores: measuring collaboration of directed graphs based on degeneracy
inferredcites →https://doi.org/10.1007/s10618-015-0422-1openalex-snapshot
Efficient and effective community search
inferredcites →https://doi.org/10.1007/s10618-017-0528-8openalex-snapshot
Ensemble-based community detection in multilayer networks
inferredcites →https://doi.org/10.1007/s10618-018-0602-xopenalex-snapshot
Finding lasting dense subgraphs
inferredcites →https://doi.org/10.1007/s11192-012-0796-4openalex-snapshot
Prediction of emerging technologies based on analysis of the US patent citation network
inferredcites →https://doi.org/10.1007/s11227-009-0299-0openalex-snapshot
Using the k-core decomposition to analyze the static structure of large-scale software systems
inferredcites →https://doi.org/10.1007/s11634-010-0079-yopenalex-snapshot
Fast algorithms for determining (generalized) core groups in social networks
inferredcites →https://doi.org/10.1016/b978-0-12-813677-5.00025-0openalex-snapshot
Multilayer Social Networks
inferredcites →https://doi.org/10.1016/j.jcss.2019.07.006openalex-snapshot
The complexity of finding small separators in temporal graphs
inferredcites →https://doi.org/10.1016/j.knosys.2018.03.022openalex-snapshot
Graph embedding techniques, applications, and performance: A survey
inferredcites →https://doi.org/10.1016/j.socnet.2013.08.003openalex-snapshot
Gender homophily from spatial behavior in a primary school: A sociometric study
inferredcites →https://doi.org/10.1016/j.tcs.2015.09.030openalex-snapshot
Computing maximal cliques in link streams
inferredcites →https://doi.org/10.1038/nphys1746openalex-snapshot
Identification of influential spreaders in complex networks
inferredcites →https://doi.org/10.1088/1367-2630/14/8/083030openalex-snapshot
A k -shell decomposition method for weighted networks
inferredcites →https://doi.org/10.1088/1742-5468/2011/11/p11005openalex-snapshot
Temporal motifs in time-dependent networks
inferredcites →https://doi.org/10.1103/physreve.88.062819openalex-snapshot
s -core network decomposition: A generalization of k -core analysis to weighted networks
inferredcites →https://doi.org/10.1109/asonam.2016.7752255openalex-snapshot
Enumerating maximal cliques in temporal graphs
inferredcites →https://doi.org/10.1109/bigdata.2015.7363809openalex-snapshot
Core decomposition in large temporal graphs
inferredcites →https://doi.org/10.1109/icde.2011.5767911openalex-snapshot
Efficient core decomposition in massive networks
inferredcites →https://doi.org/10.1109/icde.2017.211openalex-snapshot
Community Search over Big Graphs: Models, Algorithms, and Opportunities
inferredcites →https://doi.org/10.1109/icde.2017.95openalex-snapshot
Fast Computation of Dense Temporal Subgraphs
inferredcites →https://doi.org/10.1109/icde.2018.00077openalex-snapshot
Persistent Community Search in Temporal Networks
inferredcites →https://doi.org/10.1109/icdm.2011.101openalex-snapshot
Mining Heavy Subgraphs in Time-Evolving Networks
inferredcites →https://doi.org/10.1109/icdm.2018.00016openalex-snapshot
On Multi-query Local Community Detection
inferredcites →https://doi.org/10.1109/icdm.2018.00055openalex-snapshot
Finding Events in Temporal Networks: Segmentation Meets Densest-Subgraph Discovery
inferredcites →https://doi.org/10.1109/icdmw.2015.128openalex-snapshot
Detecting Anomalies in Time-Varying Networks Using Tensor Decomposition
inferredcites →https://doi.org/10.1109/mis.2010.91openalex-snapshot
Learning and Predicting the Evolution of Social Networks
inferredcites →https://doi.org/10.1109/tkde.2013.158openalex-snapshot
Efficient Core Maintenance in Large Dynamic Graphs
inferredcites →https://doi.org/10.1109/tpds.2012.124openalex-snapshot
Distributed k-Core Decomposition
inferredcites →https://doi.org/10.1109/wi.2016.0032openalex-snapshot
Identifying Buzzing Stories via Anomalous Temporal Subgraph Discovery
inferredcites →https://doi.org/10.1137/1.9781611972801.41openalex-snapshot
Mining Frequent Graph Sequence Patterns Induced by Vertices
inferredcites →https://doi.org/10.1137/1.9781611972832.5openalex-snapshot
Mining Connection Pathways for Marked Nodes in Large Graphs
inferredcites →https://doi.org/10.1145/1014052.1014068openalex-snapshot
Fast discovery of connection subgraphs
inferredcites →https://doi.org/10.1145/1150402.1150448openalex-snapshot
Center-piece subgraphs
inferredcites →https://doi.org/10.1145/1835804.1835923openalex-snapshot
The community-search problem and how to plan a successful cocktail party
inferredcites →https://doi.org/10.1145/1871437.1871468openalex-snapshot
Mining interesting link formation rules in social networks
inferredcites →https://doi.org/10.1145/1935826.1935867openalex-snapshot
Dynamic relationship and event discovery
inferredcites →https://doi.org/10.1145/2402.322385openalex-snapshot
Smallest-last ordering and clustering and graph coloring algorithms
inferredcites →https://doi.org/10.1145/2512938.2512946openalex-snapshot
Social resilience in online communities
inferredcites →https://doi.org/10.1145/2588555.2610495openalex-snapshot
Querying k-truss community in large and dynamic graphs
inferredcites →https://doi.org/10.1145/2588555.2612179openalex-snapshot
Local search of communities in large graphs
inferredcites →https://doi.org/10.1145/2623330.2623655openalex-snapshot
Core decomposition of uncertain graphs
inferredcites →https://doi.org/10.1145/2623330.2623732openalex-snapshot
DeepWalk
inferredcites →https://doi.org/10.1145/2723372.2749449openalex-snapshot
The Minimum Wiener Connector Problem
inferredcites →https://doi.org/10.1145/2736277openalex-snapshot
Proceedings of the 24th International Conference on World Wide Web - WWW '15
inferredcites →https://doi.org/10.1145/2736277.2741093openalex-snapshot
LINE
inferredcites →https://doi.org/10.1145/2736277.2741638openalex-snapshot
Efficient Densest Subgraph Computation in Evolving Graphs
inferredcites →https://doi.org/10.1145/2939672.2939754openalex-snapshot
node2vec
inferredcites →https://doi.org/10.1145/3132847.3132991openalex-snapshot
To Be Connected, or Not to Be Connected
inferredcites →https://doi.org/10.1145/3132847.3132993openalex-snapshot
Core Decomposition and Densest Subgraph in Multilayer Networks
inferredcites →https://doi.org/10.1145/3269206.3271767openalex-snapshot
Mining (maximal) Span-cores from Temporal Networks
inferredcites →https://doi.org/10.1145/3289600.3290988openalex-snapshot
Sampling Methods for Counting Temporal Motifs
inferredcites →https://doi.org/10.1145/3308558.3313660openalex-snapshot
Is a Single Embedding Enough? Learning Node Representations that Capture Multiple Social Contexts
inferredcites →https://doi.org/10.1145/3308558.3313719openalex-snapshot
Constrained Local Graph Clustering by Colored Random Walk
inferredcites →https://doi.org/10.1145/3369872openalex-snapshot
Core Decomposition in Multilayer Networks
inferredcites →https://doi.org/10.1145/366573.366611openalex-snapshot
On the approximation of curves by line segments using dynamic programming
inferredcites →https://doi.org/10.1371/journal.pone.0023176openalex-snapshot
High-Resolution Measurements of Face-to-Face Contact Patterns in a Primary School
inferredcites →https://doi.org/10.1371/journal.pone.0086028openalex-snapshot
Detecting the Community Structure and Activity Patterns of Temporal Networks: A Non-Negative Tensor Factorization Approach
inferredcites →https://doi.org/10.14778/2168651.2168658openalex-snapshot
Dense subgraph maintenance under streaming edge weight updates for real-time story identification
inferredcites →https://doi.org/10.14778/2536336.2536344openalex-snapshot
Streaming algorithms for k-core decomposition
inferredcites →https://doi.org/10.14778/3055330.3055337openalex-snapshot
Effective community search over large spatial graphs
inferredcites →https://doi.org/10.14778/3099622.3099626openalex-snapshot
Attribute-driven community search
inferredcites →https://doi.org/10.14778/3115404.3115406openalex-snapshot
When engagement meets similarity
inferredcites →https://doi.org/10.3233/web-190412openalex-snapshot
The importance of unexpectedness: Discovering buzzing stories in anomalous temporal graphs
inferredcites →https://doi.org/10.3929/ethz-b-000055291openalex-snapshot
A k-shell decomposition method for weighted networks

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-032-13513-1_28openalex-snapshot
Decentralized and Self-adaptive Core Maintenance on 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/s13278-024-01314-wopenalex-snapshot
General-purpose query processing on summary graphs
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.1007/s44443-025-00391-xopenalex-snapshot
Mining Interaction-intensive cores in temporal graphs
inferred← citeshttps://doi.org/10.1016/j.ins.2025.122930openalex-snapshot
Segmentation of temporal graphs
inferred← citeshttps://doi.org/10.1038/s42005-025-02075-4openalex-snapshot
Generating surrogate temporal networks from mesoscale building blocks
inferred← citeshttps://doi.org/10.1109/icde65448.2025.00058openalex-snapshot
Accelerating D-Core Maintenance over Dynamic Directed Graphs
inferred← citeshttps://doi.org/10.1109/icde65448.2025.00179openalex-snapshot
Efficient Frequency-Aware k-Core Query on Temporal Graphs
inferred← citeshttps://doi.org/10.1109/wiiat50758.2020.00019openalex-snapshot
Better Fewer but Better: Community Search with Outliers
inferred← citeshttps://doi.org/10.1145/3485447.3512205openalex-snapshot
FirmCore Decomposition of Multilayer Networks
inferred← citeshttps://doi.org/10.1145/3589335.3641245openalex-snapshot
Mining Temporal Networks
inferred← citeshttps://doi.org/10.1145/3637528.3671889openalex-snapshot
Scalable Temporal Motif Densest Subnetwork Discovery
inferred← citeshttps://doi.org/10.1145/3644077openalex-snapshot
On Breaking Truss-based and Core-based Communities
inferred← citeshttps://doi.org/10.1145/3701551.3703556openalex-snapshot
An Edge-Based Decomposition Framework for Temporal Networks
inferred← citeshttps://doi.org/10.14778/3461535.3461542openalex-snapshot
Local algorithms for distance-generalized core decomposition over large dynamic graphs
inferred← citeshttps://doi.org/10.14778/3529337.3529340openalex-snapshot
Distributed D-core decomposition over large directed graphs
inferred← citeshttps://doi.org/10.14778/3648160.3648163openalex-snapshot
QTCS: Efficient Query-Centered Temporal Community Search
inferred← citeshttps://doi.org/10.14778/3681954.3681965openalex-snapshot
Efficient Index for Temporal Core Queries over Bipartite Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.2104.05982openalex-snapshot
Clustering of temporal nodes profiles in dynamic networks of contacts
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.