On the public citation graph

Fully Dynamic Approximate k-Core Decomposition in Hypergraphs

0 signed · 63 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.1007/3-540-44436-x_10openalex-snapshot
Greedy Approximation Algorithms for Finding Dense Components in a Graph
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.1016/0378-8733(83)90028-xopenalex-snapshot
Network structure and minimum degree
inferredcites →https://doi.org/10.1093/bioinformatics/bti688openalex-snapshot
Interactome-transcriptome analysis reveals the high centrality of genes differentially expressed in lung cancer tissues
inferredcites →https://doi.org/10.1109/asonam.2011.65openalex-snapshot
Evaluating Cooperation in Communities with the k-Core Structure
inferredcites →https://doi.org/10.1109/icde.2011.5767911openalex-snapshot
Efficient core decomposition in massive networks
inferredcites →https://doi.org/10.1109/icde.2012.35openalex-snapshot
Extracting Analyzing and Visualizing Triangle K-Core Motifs within Networks
inferredcites →https://doi.org/10.1109/icde.2016.7498235openalex-snapshot
I/O efficient Core Graph Decomposition at web scale
inferredcites →https://doi.org/10.1109/icde.2017.93openalex-snapshot
A Fast Order-Based Approach for Core Maintenance
inferredcites →https://doi.org/10.1109/icdm.2011.46openalex-snapshot
D-cores: Measuring Collaboration of Directed Graphs Based on Degeneracy
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.1145/2504730.2504747openalex-snapshot
A fistful of bitcoins
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/2933267.2933299openalex-snapshot
Distributed k-core decomposition and maintenance in large dynamic graphs
inferredcites →https://doi.org/10.1145/3038912.3052619openalex-snapshot
Large Scale Density-friendly Graph Decomposition via Convex Programming
inferredcites →https://doi.org/10.1145/3132847.3132907openalex-snapshot
Maintaining Densest Subsets Efficiently in Evolving Hypergraphs
inferredcites →https://doi.org/10.1145/3178123openalex-snapshot
Spectral Properties of Hypergraph Laplacian and Approximation Algorithms
inferredcites →https://doi.org/10.1186/s13336-015-0016-6openalex-snapshot
K-core decomposition of a protein domain co-occurrence network reveals lower cancer mutation rates for interior cores
inferredcites →https://doi.org/10.1371/journal.pbio.0060159openalex-snapshot
Mapping the Structural Core of Human Cerebral Cortex
inferredcites →https://doi.org/10.14778/2140436.2140442openalex-snapshot
Densest subgraph in streaming and MapReduce
inferredcites →https://doi.org/10.14778/2311906.2311909openalex-snapshot
Truss decomposition in massive networks
inferredcites →https://doi.org/10.14778/2536336.2536344openalex-snapshot
Streaming algorithms for k-core decomposition
inferredcites →https://doi.org/10.14778/2850469.2850471openalex-snapshot
K-core decomposition of large networks on a single PC

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-031-20891-1_21openalex-snapshot
Efficient Truss Computation for Large Hypergraphs
inferred← citeshttps://doi.org/10.1007/978-3-032-06706-7_5openalex-snapshot
Hardness of Dynamic Core and Truss Decompositions
inferred← citeshttps://doi.org/10.1007/s00778-022-00763-zopenalex-snapshot
Toward maintenance of hypercores in large-scale dynamic hypergraphs
inferred← citeshttps://doi.org/10.1007/s00778-024-00851-2openalex-snapshot
Hyper-distance oracles in hypergraphs
inferred← citeshttps://doi.org/10.1007/s00778-025-00915-xopenalex-snapshot
Efficient indexing and searching of constrained core in hypergraphs
inferred← citeshttps://doi.org/10.1007/s00778-026-00985-5openalex-snapshot
Hypergraph decomposition with intersection bounds
inferred← citeshttps://doi.org/10.1007/s10618-023-00956-2openalex-snapshot
Hypercore decomposition for non-fragile hyperedges: concepts, algorithms, observations, and applications
inferred← citeshttps://doi.org/10.1007/s10618-023-00958-0openalex-snapshot
Improving the core resilience of real-world hypergraphs
inferred← citeshttps://doi.org/10.1007/s11227-024-06190-xopenalex-snapshot
Simplified algorithms for order-based core maintenance
inferred← citeshttps://doi.org/10.1007/s11280-023-01196-6openalex-snapshot
Core maintenance for hypergraph streams
inferred← citeshttps://doi.org/10.1007/s11280-025-01356-wopenalex-snapshot
Efficient traversal for core maintenance in large-scale dynamic hypergraphs
inferred← citeshttps://doi.org/10.1016/j.ins.2023.03.009openalex-snapshot
A fast approximate method for k-edge connected component detection in graphs with high accuracy
inferred← citeshttps://doi.org/10.1109/focs54457.2022.00077openalex-snapshot
Differential Privacy from Locally Adjustable Graph Algorithms: k-Core Decomposition, Low Out-Degree Ordering, and Densest Subgraphs
inferred← citeshttps://doi.org/10.1109/icde51399.2021.00199openalex-snapshot
Hypercore Maintenance in Dynamic Hypergraphs
inferred← citeshttps://doi.org/10.1109/icde55515.2023.00039openalex-snapshot
Finer-Grained Engagement in Hypergraphs
inferred← citeshttps://doi.org/10.1109/icde65706.2026.00189openalex-snapshot
SQAC: Scalable Querying of Attribute-Constrained (α, β)-Cores over Large Bipartite Graphs
inferred← citeshttps://doi.org/10.1109/icdm65498.2025.00116openalex-snapshot
Identifying Group Anchors in Real-World Group Interactions Under Label Scarcity
inferred← citeshttps://doi.org/10.1109/ipdpsw52791.2021.00158openalex-snapshot
Shared-Memory Scalable k-Core Maintenance on Dynamic Graphs and Hypergraphs
inferred← citeshttps://doi.org/10.1109/tbdata.2024.3352973openalex-snapshot
Core Maintenance on Dynamic Graphs: A Distributed Approach Built on H-Index
inferred← citeshttps://doi.org/10.1109/tkde.2023.3332638openalex-snapshot
Maintaining Top-$t$ Cores in Dynamic Graphs
inferred← citeshttps://doi.org/10.1109/tkde.2026.3725754openalex-snapshot
The s -Hypercore: A Cohesive Subhypergraph Model Based on Decayed Engagement Strength
inferred← citeshttps://doi.org/10.1109/tpds.2023.3236669openalex-snapshot
Revisiting Core Maintenance for Dynamic Hypergraphs
inferred← citeshttps://doi.org/10.1145/3437963.3441790openalex-snapshot
A Unifying Framework to Identify Dense Subgraphs on Streams: Graph Nuclei to Hypergraph Cores
inferred← citeshttps://doi.org/10.1145/3490148.3538569openalex-snapshot
Parallel Batch-Dynamic Algorithms for k-Core Decomposition and Related Graph Problems
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/3627535.3638508openalex-snapshot
Parallel k-Core Decomposition with Batched Updates and Asynchronous Reads
inferred← citeshttps://doi.org/10.1145/3627673.3679765openalex-snapshot
Hierarchical Structure Construction on Hypergraphs
inferred← citeshttps://doi.org/10.1145/3639287openalex-snapshot
Parallel Algorithms for Hierarchical Nucleus Decomposition
inferred← citeshttps://doi.org/10.1145/3694906.3743328openalex-snapshot
Parallel Batch-Dynamic Coreness Decomposition with Worst-Case Guarantees
inferred← citeshttps://doi.org/10.1145/3709656openalex-snapshot
Accelerating Core Decomposition in Billion-Scale Hypergraphs
inferred← citeshttps://doi.org/10.1145/3719205openalex-snapshot
OTM : Efficient k -Order-Based Core Maintenance in Large-Scale Dynamic Hypergraphs
inferred← citeshttps://doi.org/10.14778/3494124.3494140openalex-snapshot
Theoretically and practically efficient parallel nucleus decomposition
inferred← citeshttps://doi.org/10.14778/3598581.3598582openalex-snapshot
Neighborhood-Based Hypergraph Core Decomposition
inferred← citeshttps://doi.org/10.14778/3598581.3598592openalex-snapshot
Maximal D-Truss Search in Dynamic Directed Graphs
inferred← citeshttps://doi.org/10.14778/3681954.3681965openalex-snapshot
Efficient Index for Temporal Core Queries over Bipartite Graphs
inferred← citeshttps://doi.org/10.21203/rs.3.rs-3040379/v1openalex-snapshot
Simplified Algorithms for Order-Based CoreMaintenance
inferred← citeshttps://doi.org/10.48550/arxiv.2102.11169openalex-snapshot
Recent Advances in Fully Dynamic Graph Algorithms
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.