On the public citation graph
Truss decomposition in massive networks
0 signed · 438 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/3-540-45995-2_51openalex-snapshot
Massive Quasi-Clique Detection
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/bf02289146openalex-snapshot
A Method of Matrix Analysis of Group Structure
inferredcites →https://doi.org/10.1007/bf02289199openalex-snapshot
Connectivity and Generalized Cliques in Sociometric Group Structure
inferredcites →https://doi.org/10.1016/0378-8733(83)90028-xopenalex-snapshot
Network structure and minimum degree
inferredcites →https://doi.org/10.1016/0378-8733(87)90009-8openalex-snapshot
Cognitive social structures
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.1016/s0304-3975(98)00091-7openalex-snapshot
Classifying molecular sequences using a linkage graph with their pairwise similarities
inferredcites →https://doi.org/10.1038/30918openalex-snapshot
Collective dynamics of ‘small-world’ networks
inferredcites →https://doi.org/10.1073/pnas.012582999openalex-snapshot
Random graph models of social networks
inferredcites →https://doi.org/10.1073/pnas.0701175104openalex-snapshot
A model of Internet topology using k -shell decomposition
inferredcites →https://doi.org/10.1080/0022250x.1978.9989883openalex-snapshot
A graph‐theoretic generalization of the clique concept
inferredcites →https://doi.org/10.1109/icde.2011.5767911openalex-snapshot
Efficient core decomposition in massive networks
inferredcites →https://doi.org/10.1109/mcse.2009.120openalex-snapshot
Graph Twiddling in a MapReduce World
inferredcites →https://doi.org/10.1145/1081870.1081898openalex-snapshot
On mining cross-graph quasi-cliques
inferredcites →https://doi.org/10.1145/1807167.1807217openalex-snapshot
Finding maximal cliques in massive networks by H*-graph
inferredcites →https://doi.org/10.1145/1963405.1963491openalex-snapshot
Counting triangles and the curse of the last reducer
inferredcites →https://doi.org/10.1145/2020408.2020513openalex-snapshot
Triangle listing in massive networks and its applications
inferredcites →https://doi.org/10.1145/2043652.2043654openalex-snapshot
Finding maximal cliques in massive networks
inferredcites →https://doi.org/10.1145/2339530.2339724openalex-snapshot
Fast algorithms for maximal clique enumeration with limited memory
inferredcites →https://doi.org/10.1145/2382577.2382581openalex-snapshot
Triangle listing in massive networks
inferredcites →https://doi.org/10.1145/362342.362367openalex-snapshot
Algorithm 457: finding all cliques of an undirected graph
inferredcites →https://doi.org/10.1145/48529.48535openalex-snapshot
The input/output complexity of sorting and related problems
inferredcites →https://doi.org/10.14778/1921071.1921073openalex-snapshot
On triangulation-based dense neighborhood graph discovery
inferredcites →https://doi.org/10.48550/arxiv.cs/0310049openalex-snapshot
An O(m) Algorithm for Cores Decomposition of Networks
inferredcites →https://doi.org/10.5445/ir/1000007159openalex-snapshot
Algorithmic Aspects of Triangle-Based Network Analysis
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.2139/ssrn.4673938openalex-extracted
Random Walk-Based Community Key-Members Search Over Large Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-01768-2_13openalex-snapshot
Pushing the Envelope in Overlapping Communities Detection
inferred← citeshttps://doi.org/10.1007/978-3-030-03599-0_5openalex-snapshot
Higher-Order Structure-Based Graph Decomposition
inferred← citeshttps://doi.org/10.1007/978-3-030-06222-4_7openalex-snapshot
Business Network Analytics: From Graphs to Supernetworks
inferred← citeshttps://doi.org/10.1007/978-3-030-18576-3_36openalex-snapshot
Towards Efficient k-TriPeak Decomposition on Large Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-18590-9_69openalex-snapshot
GScan: Exploiting Sequential Scans for Subgraph Matching
inferred← citeshttps://doi.org/10.1007/978-3-030-29035-1_30openalex-snapshot
Effects of Truss Structure of Social Network on Information Diffusion Among Twitter Users
inferred← citeshttps://doi.org/10.1007/978-3-030-30796-7_11openalex-snapshot
BTC-2019: The 2019 Billion Triple Challenge Dataset
inferred← citeshttps://doi.org/10.1007/978-3-030-34223-4_46openalex-snapshot
Fast Algorithms for Intimate-Core Group Search in Weighted Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-59416-9_27openalex-snapshot
Efficient Graph Hierarchical Decomposition with User Engagement and Tie Strength
inferred← citeshttps://doi.org/10.1007/978-3-030-65347-7_5openalex-snapshot
Effects of Community Structure in Social Networks on Speed of Information Diffusion
inferred← citeshttps://doi.org/10.1007/978-3-030-69244-5_9openalex-snapshot
Distributed Algorithm for Truss Maintenance in Dynamic Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-73216-5_23openalex-snapshot
Maximum (L, K)-Lasting Cores in Temporal Social Networks
inferred← citeshttps://doi.org/10.1007/978-3-030-95388-1_13openalex-snapshot
A NUMA-Aware Parallel Truss Decomposition Algorithm for Large Scale Graphs
inferred← citeshttps://doi.org/10.1007/978-3-031-01874-9openalex-snapshot
Community Search over Big Graphs
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-031-46671-7_19openalex-snapshot
Common-Truss-Based Community Search on Multilayer Graphs
inferred← citeshttps://doi.org/10.1007/978-3-031-47546-7_27openalex-snapshot
Clique-TF-IDF: A New Partitioning Framework Based on Dense Substructures
inferred← citeshttps://doi.org/10.1007/978-3-031-70371-3_10openalex-snapshot
Tackling Oversmoothing in GNN via Graph Sparsification
inferred← citeshttps://doi.org/10.1007/978-3-031-99872-0_1openalex-snapshot
Wedge-Parallel Triangle Counting for GPUs
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/978-3-319-00372-6_7openalex-snapshot
Pattern Extraction from Graphs and Beyond
inferred← citeshttps://doi.org/10.1007/978-3-319-06608-0_26openalex-snapshot
Fast Triangle Core Decomposition for Mining Large Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-32049-6_14openalex-snapshot
Bitruss Decomposition of Bipartite Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-44403-1_18openalex-snapshot
Leveraging Structural Hierarchy for Scalable Network Comparison
inferred← citeshttps://doi.org/10.1007/978-3-319-55699-4_25openalex-snapshot
Effective k-Vertex Connected Component Detection in Large-Scale Networks
inferred← citeshttps://doi.org/10.1007/978-3-319-64283-3_28openalex-snapshot
Leveraging Hierarchy and Community Structure for Determining Influencers in Networks
inferred← citeshttps://doi.org/10.1007/978-3-319-68783-4_30openalex-snapshot
Discovering Hierarchical Subgraphs of K-Core-Truss
inferred← citeshttps://doi.org/10.1007/978-3-319-68783-4_9openalex-snapshot
Incremental Structural Clustering for Dynamic Networks
inferred← citeshttps://doi.org/10.1007/978-3-319-72395-2_64openalex-snapshot
Fast Truss Decomposition in Memory
inferred← citeshttps://doi.org/10.1007/978-3-319-91452-7_12openalex-snapshot
K-Connected Cores Computation in Large Dual Networks
inferred← citeshttps://doi.org/10.1007/978-3-319-91452-7_14openalex-snapshot
External Topological Sorting in Large Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-91452-7_28openalex-snapshot
Discovering Strong Communities with User Engagement and Tie Strength
inferred← citeshttps://doi.org/10.1007/978-3-319-93040-4_51openalex-snapshot
Tri-Fly: Distributed Estimation of Global and Local Triangle Counts in Graph Streams
inferred← citeshttps://doi.org/10.1007/978-3-319-96983-1_50openalex-snapshot
Improved Distributed Algorithm for Graph Truss Decomposition
inferred← citeshttps://doi.org/10.1007/978-981-15-3928-2_6openalex-snapshot
Efficient Parallel Cohesive Subgraph Detection
inferred← citeshttps://doi.org/10.1007/978-981-16-1342-5_68openalex-snapshot
Graph-Based Keyword Extraction for Twitter Data
inferred← citeshttps://doi.org/10.1007/978-981-95-3830-0_48openalex-snapshot
Durable Community Search on Temporal Graphs
inferred← citeshttps://doi.org/10.1007/978-981-95-7996-9_7openalex-snapshot
CXL Powered Memory Intensive Graph Processing: A Comprehensive Survey
inferred← citeshttps://doi.org/10.1007/978-981-97-7707-5_18openalex-snapshot
Efficient p-Biclique Query on Large Bipartite Networks
inferred← citeshttps://doi.org/10.1007/978-981-99-6222-8_14openalex-snapshot
Finding Introverted Cores in Bipartite Graphs
inferred← citeshttps://doi.org/10.1007/s00500-021-06468-9openalex-snapshot
Truss decomposition using triangle graphs
inferred← citeshttps://doi.org/10.1007/s00778-015-0408-zopenalex-snapshot
Diversified top-k clique search
inferred← citeshttps://doi.org/10.1007/s00778-016-0451-4openalex-snapshot
I/O efficient ECC graph decomposition via graph reduction
inferred← citeshttps://doi.org/10.1007/s00778-017-0459-4openalex-snapshot
Scalable subgraph enumeration in MapReduce: a cost-oriented approach
inferred← citeshttps://doi.org/10.1007/s00778-017-0467-4openalex-snapshot
Finding influential communities in massive networks
inferred← citeshttps://doi.org/10.1007/s00778-019-00541-4openalex-snapshot
Efficient structural graph clustering: an index-based approach
inferred← citeshttps://doi.org/10.1007/s00778-019-00556-xopenalex-snapshot
A survey of community search over big graphs
inferred← citeshttps://doi.org/10.1007/s00778-019-00587-4openalex-snapshot
The core decomposition of networks: theory, algorithms and applications
inferred← citeshttps://doi.org/10.1007/s00778-020-00618-5openalex-snapshot
Finding skyline communities in multi-valued networks
inferred← citeshttps://doi.org/10.1007/s00778-020-00649-yopenalex-snapshot
I/O efficient k-truss community search in massive graphs
inferred← citeshttps://doi.org/10.1007/s00778-021-00658-5openalex-snapshot
Towards efficient solutions of bitruss decomposition for large-scale bipartite graphs
inferred← citeshttps://doi.org/10.1007/s00778-021-00673-6openalex-snapshot
Anchored coreness: efficient reinforcement of social networks
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-025-00915-xopenalex-snapshot
Efficient indexing and searching of constrained core in hypergraphs
inferred← citeshttps://doi.org/10.1007/s00778-025-00938-4openalex-snapshot
Distributed Truss Decomposition over Large Directed Graphs
inferred← citeshttps://doi.org/10.1007/s00778-025-00942-8openalex-snapshot
Density decomposition on large static and dynamic graphs: algorithms and applications
inferred← citeshttps://doi.org/10.1007/s00778-025-00958-0openalex-snapshot
Finding Locally Densest Subgraphs: Convex Programming with Edge and Triangle Density
inferred← citeshttps://doi.org/10.1007/s00778-026-00985-5openalex-snapshot
Hypergraph decomposition with intersection bounds
inferred← citeshttps://doi.org/10.1007/s10115-016-0943-yopenalex-snapshot
Truss decomposition of uncertain graphs
inferred← citeshttps://doi.org/10.1007/s10115-017-1077-6openalex-snapshot
Patterns and anomalies in k-cores of real-world graphs with applications
inferred← citeshttps://doi.org/10.1007/s10115-021-01624-xopenalex-snapshot
Discovering fortress-like cohesive subgraphs
inferred← citeshttps://doi.org/10.1007/s10115-022-01654-zopenalex-snapshot
Attributed community search considering community focusing and latent relationship
inferred← citeshttps://doi.org/10.1007/s10115-023-01830-9openalex-snapshot
Fast computation of distance-generalized cores using sampling
inferred← citeshttps://doi.org/10.1007/s10115-024-02084-9openalex-snapshot
Influential users identification under the non-progressive LTIRS model
inferred← citeshttps://doi.org/10.1007/s10115-024-02215-2openalex-snapshot
Truss community search in uncertain graphs
inferred← citeshttps://doi.org/10.1007/s10618-018-0582-xopenalex-snapshot
Social centrality using network hierarchy and community structure
inferred← citeshttps://doi.org/10.1007/s10619-017-7193-1openalex-snapshot
Efficient MapReduce algorithms for triangle listing in billion-scale graphs
inferred← citeshttps://doi.org/10.1007/s10619-022-07416-8openalex-snapshot
Four node graphlet and triad enumeration on distributed platforms
inferred← citeshttps://doi.org/10.1007/s10732-020-09465-7openalex-snapshot
Augmented intuition: a bridge between theory and practice
inferred← citeshttps://doi.org/10.1007/s11227-017-1976-zopenalex-snapshot
An attribute-based community search method with graph refining
inferred← citeshttps://doi.org/10.1007/s11280-019-00725-6openalex-snapshot
Towards k-vertex connected component discovery from large networks
inferred← citeshttps://doi.org/10.1007/s11280-021-00905-3openalex-snapshot
Discovering key users for defending network structural stability
inferred← citeshttps://doi.org/10.1007/s11280-021-00907-1openalex-snapshot
VEK: a vertex-oriented approach for edge k-core problem
inferred← citeshttps://doi.org/10.1007/s11280-021-00933-zopenalex-snapshot
Locating pivotal connections: the K-Truss minimization and maximization problems
inferred← citeshttps://doi.org/10.1007/s11280-021-00947-7openalex-snapshot
K-truss community most favorites query based on top-t
inferred← citeshttps://doi.org/10.1007/s11280-023-01205-8openalex-snapshot
FPGN: follower prediction framework for infectious disease prevention
inferred← citeshttps://doi.org/10.1007/s11390-019-1905-0openalex-snapshot
Who Should Be Invited to My Party: A Size-Constrained k-Core Problem in Social Networks
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/s12046-023-02125-zopenalex-snapshot
Peer recommendation by using pattern mining to generate candidate keywords in attributed graphs
inferred← citeshttps://doi.org/10.1007/s12065-025-01079-xopenalex-snapshot
Datastreams and beyond, from traditional approaches to quantum: a comprehensive survey
inferred← citeshttps://doi.org/10.1007/s41019-018-0068-2openalex-snapshot
Discovering Hierarchical Subgraphs of K-Core-Truss
inferred← citeshttps://doi.org/10.1007/s41019-018-0078-0openalex-snapshot
K-Connected Cores Computation in Large Dual Networks
inferred← citeshttps://doi.org/10.1007/s43674-022-00041-zopenalex-snapshot
Attributed community search based on seed replacement and joint random walk
inferred← citeshttps://doi.org/10.1016/bs.adcom.2021.10.003openalex-snapshot
Fast exact triangle counting in large graphs using SIMD acceleration
inferred← citeshttps://doi.org/10.1016/j.chaos.2026.119191openalex-snapshot
An α-triangle eigenvector centrality of graphs
inferred← citeshttps://doi.org/10.1016/j.cor.2023.106187openalex-snapshot
On solving simplified diversified top-k s-plex problem
inferred← citeshttps://doi.org/10.1016/j.engappai.2024.108947openalex-snapshot
Improving semantic similarity computation via subgraph feature fusion based on semantic awareness
inferred← citeshttps://doi.org/10.1016/j.eswa.2023.119775openalex-snapshot
A novel network core structure extraction algorithm utilized variational autoencoder for community detection
inferred← citeshttps://doi.org/10.1016/j.eswa.2023.121153openalex-snapshot
Attribute-sensitive community search over attributed heterogeneous information networks
inferred← citeshttps://doi.org/10.1016/j.ins.2017.07.012openalex-snapshot
Finding weighted k-truss communities in large networks
inferred← citeshttps://doi.org/10.1016/j.ins.2022.06.023openalex-snapshot
Personalized query techniques in graphs: A survey
inferred← citeshttps://doi.org/10.1016/j.ins.2025.122775openalex-snapshot
Efficient order-based algorithms for core maintenance in weighted graph
inferred← citeshttps://doi.org/10.1016/j.ipm.2024.104014openalex-snapshot
Efficient querying k-trusses on temporal graphs
inferred← citeshttps://doi.org/10.1016/j.is.2019.03.014openalex-snapshot
KTMiner: Distributed k-truss detection in big graphs
inferred← citeshttps://doi.org/10.1016/j.is.2021.101914openalex-snapshot
Keyword aware influential community search in large attributed graphs
inferred← citeshttps://doi.org/10.1016/j.jocs.2025.102530openalex-snapshot
Finding top- r weighted k -wing communities in bipartite graphs
inferred← citeshttps://doi.org/10.1016/j.joi.2026.101881openalex-snapshot
Characterizing patent thickets by patent triples via the multiplex network of standard essential patents
inferred← citeshttps://doi.org/10.1016/j.knosys.2016.07.027openalex-snapshot
A local dynamic method for tracking communities and their evolution in dynamic networks
inferred← citeshttps://doi.org/10.1016/j.knosys.2026.116672openalex-snapshot
KTR: Structure-aware replay for continual learning on hypergraphs
inferred← citeshttps://doi.org/10.1016/j.neunet.2024.106155openalex-snapshot
PSA-GNN: An augmented GNN framework with priori subgraph knowledge
inferred← citeshttps://doi.org/10.1016/j.physa.2019.04.265openalex-snapshot
Identifying similar networks using structural hierarchy
inferred← citeshttps://doi.org/10.1016/j.physa.2023.128710openalex-snapshot
ASN: A method of optimality for seed identification in the influence diffusion process
inferred← citeshttps://doi.org/10.1016/j.procs.2026.08.011openalex-snapshot
HSE-KTruss: A Hybrid Semi-External Algorithm for Memory-Budgeted Max-Truss Computation
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.11.008openalex-snapshot
Order based algorithms for the core maintenance problem on edge-weighted graphs
inferred← citeshttps://doi.org/10.1038/s41598-025-99948-zopenalex-snapshot
Maximum independent set in multiplex social networks and its application to influence maximization
inferred← citeshttps://doi.org/10.1038/srep19307openalex-snapshot
Locating influential nodes in complex networks
inferred← citeshttps://doi.org/10.1080/15710882.2025.2555334openalex-snapshot
Exploring an ANT-inspired mapping approach for embedded design practitioners: a case-informed process
inferred← citeshttps://doi.org/10.1093/comnet/cnt016openalex-snapshot
Structure and dynamics of core/periphery networks
inferred← citeshttps://doi.org/10.1098/rsos.160270openalex-snapshot
Cycle and flow trusses in directed networks
inferred← citeshttps://doi.org/10.1109/access.2020.3009525openalex-snapshot
Interplay Between Hierarchy and Centrality in Complex Networks
inferred← citeshttps://doi.org/10.1109/access.2020.3011667openalex-snapshot
Truly Scalable K-Truss and Max-Truss Algorithms for Community Detection in Graphs
inferred← citeshttps://doi.org/10.1109/access.2020.3016214openalex-snapshot
Weight-Based K-Truss Community Search via Edge Attachment
inferred← citeshttps://doi.org/10.1109/access.2020.3032987openalex-snapshot
SGEQ: A New Social Group Enlarging Query With Size Constraints
inferred← citeshttps://doi.org/10.1109/access.2023.3268797openalex-snapshot
A Network Science Perspective of Graph Convolutional Networks: A Survey
inferred← citeshttps://doi.org/10.1109/asonam.2016.7752211openalex-snapshot
Tradeoffs between density and size in extracting dense subgraphs: A unified framework
inferred← citeshttps://doi.org/10.1109/asonam.2018.8508642openalex-snapshot
K-Truss Decomposition of Large Networks on a Single Consumer-Grade Machine
inferred← citeshttps://doi.org/10.1109/asonam49781.2020.9381328openalex-snapshot
k-Truss Network Community Detection
inferred← citeshttps://doi.org/10.1109/bigcomp.2018.00092openalex-snapshot
An Efficient Triangle Enumeration on Parallel and Distributed Frameworks
inferred← citeshttps://doi.org/10.1109/bigdata.2014.7004264openalex-snapshot
Distributed algorithms for k-truss decomposition
inferred← citeshttps://doi.org/10.1109/bigdata.2015.7363809openalex-snapshot
Core decomposition in large temporal graphs
inferred← citeshttps://doi.org/10.1109/bigdata.2016.7840674openalex-snapshot
Efficient triangle listing for billion-scale graphs
inferred← citeshttps://doi.org/10.1109/bigdata.congress.2014.13openalex-snapshot
Rectangle Counting in Large Bipartite Graphs
inferred← citeshttps://doi.org/10.1109/bigdata.congress.2014.31openalex-snapshot
Distributed Maximal Clique Computation
inferred← citeshttps://doi.org/10.1109/bigdata47090.2019.9005956openalex-snapshot
Index Based Efficient Algorithms For Closest Community Search
inferred← citeshttps://doi.org/10.1109/bigdata52589.2021.9671831openalex-snapshot
Truss Decomposition on Multilayer Graphs
inferred← citeshttps://doi.org/10.1109/cbd.2017.49openalex-snapshot
K-Truss Based Top-Communities Search in Large Graphs
inferred← citeshttps://doi.org/10.1109/cbd58033.2022.00025openalex-snapshot
Efficient and Effective Expert Finding based on Community Search: A Demonstration
inferred← citeshttps://doi.org/10.1109/gc46384.2019.00016openalex-snapshot
Streaming and Batch Algorithms for Truss Decomposition
inferred← citeshttps://doi.org/10.1109/globecom38437.2019.9013837openalex-snapshot
Two-Level Index for Truss Community Query in Large-Scale Graphs
inferred← citeshttps://doi.org/10.1109/glocom.2013.6831543openalex-snapshot
Searching for truss alpha users in mobile telecommunications social networks
inferred← citeshttps://doi.org/10.1109/hipc.2017.00011openalex-snapshot
Exact and Parallel Triangle Counting in Dynamic Graphs
inferred← citeshttps://doi.org/10.1109/hipc.2017.00012openalex-snapshot
Shared-Memory Graph Truss Decomposition
inferred← citeshttps://doi.org/10.1109/hipc56025.2022.00026openalex-snapshot
High-Performance Truss Analytics in Arkouda
inferred← citeshttps://doi.org/10.1109/hpcc-dss-smartcity-dependsys57074.2022.00263openalex-snapshot
Efficiently Conditional Community Search in Dynamic Graphs
inferred← citeshttps://doi.org/10.1109/hpec.2016.7761577openalex-snapshot
From NoSQL Accumulo to NewSQL Graphulo: Design and utility of graph algorithms inside a BigTable database
inferred← citeshttps://doi.org/10.1109/hpec.2017.8091038openalex-snapshot
Quickly finding a truss in a haystack
inferred← citeshttps://doi.org/10.1109/hpec.2017.8091039openalex-snapshot
Static graph challenge: Subgraph isomorphism
inferred← citeshttps://doi.org/10.1109/hpec.2017.8091042openalex-snapshot
Collaborative (CPU + GPU) algorithms for triangle counting and truss decomposition on the Minsky architecture: Static graph challenge: Subgraph isomorphism
inferred← citeshttps://doi.org/10.1109/hpec.2017.8091049openalex-snapshot
Truss decomposition on shared-memory parallel systems
inferred← citeshttps://doi.org/10.1109/hpec.2017.8091052openalex-snapshot
Parallel k-truss decomposition on multicore systems
inferred← citeshttps://doi.org/10.1109/hpec.2018.8547572openalex-snapshot
K-truss decomposition for Scale-Free Graphs at Scale in Distributed Memory
inferred← citeshttps://doi.org/10.1109/hpec.2018.8547581openalex-snapshot
Logarithmic Radix Binning and Vectorized Triangle Counting
inferred← citeshttps://doi.org/10.1109/hpec.2018.8547718openalex-snapshot
Linear Algebraic Formulation of Edge-centric K-truss Algorithms with Adjacency Matrices
inferred← citeshttps://doi.org/10.1109/hpec.2018.8547759openalex-snapshot
Fast and Adaptive List Intersections on the GPU
inferred← citeshttps://doi.org/10.1109/icceic54227.2021.00019openalex-snapshot
Toponym Based Community Search in Large Social Network
inferred← citeshttps://doi.org/10.1109/icde.2013.6544815openalex-snapshot
Scalable maximum clique computation using MapReduce
inferred← citeshttps://doi.org/10.1109/icde.2015.7113300openalex-snapshot
Diversified top-k clique search
inferred← citeshttps://doi.org/10.1109/icde.2017.211openalex-snapshot
Community Search over Big Graphs: Models, Algorithms, and Opportunities
inferred← citeshttps://doi.org/10.1109/icde.2017.93openalex-snapshot
A Fast Order-Based Approach for Core Maintenance
inferred← citeshttps://doi.org/10.1109/icde.2018.00031openalex-snapshot
Efficient Signed Clique Search in Signed Networks
inferred← citeshttps://doi.org/10.1109/icde.2018.00057openalex-snapshot
Efficiently Reinforcing Social Networks over User Engagement and Tie Strength
inferred← citeshttps://doi.org/10.1109/icde.2018.00077openalex-snapshot
Persistent Community Search in Temporal Networks
inferred← citeshttps://doi.org/10.1109/icde.2018.00141openalex-snapshot
Querying Cohesive Subgraphs by Keywords
inferred← citeshttps://doi.org/10.1109/icde.2019.00014openalex-snapshot
Enumerating k-Vertex Connected Components in Large Graphs
inferred← citeshttps://doi.org/10.1109/icde.2019.00240openalex-snapshot
Hierarchical Decomposition of Big Graphs
inferred← citeshttps://doi.org/10.1109/icde.2019.00241openalex-snapshot
Cohesive Subgraph Computation Over Large Sparse Graphs
inferred← citeshttps://doi.org/10.1109/icde48307.2020.00025openalex-snapshot
Efficient Top-k Edge Structural Diversity Search
inferred← citeshttps://doi.org/10.1109/icde48307.2020.00042openalex-snapshot
Anchored Vertex Exploration for Community Engagement in Social Networks
inferred← citeshttps://doi.org/10.1109/icde48307.2020.00063openalex-snapshot
Efficient Bitruss Decomposition for Large-scale Bipartite Graphs
inferred← citeshttps://doi.org/10.1109/icde48307.2020.00065openalex-snapshot
Finding the Best k in Core Decomposition: A Time and Space Optimal Solution
inferred← citeshttps://doi.org/10.1109/icde48307.2020.00083openalex-snapshot
Effective and Efficient Truss Computation over Large Heterogeneous Information Networks
inferred← citeshttps://doi.org/10.1109/icde51399.2021.00016openalex-snapshot
Efficient Community Search with Size Constraint
inferred← citeshttps://doi.org/10.1109/icde53745.2022.00021openalex-snapshot
Nucleus Decomposition in Probabilistic Graphs: Hardness and Algorithms
inferred← citeshttps://doi.org/10.1109/icde53745.2022.00028openalex-snapshot
Continuous Geo-Social Group Monitoring over Moving Users
inferred← citeshttps://doi.org/10.1109/icde53745.2022.00033openalex-snapshot
Efficient Top-k Ego-Betweenness Search
inferred← citeshttps://doi.org/10.1109/icde53745.2022.00090openalex-snapshot
Hierarchical Core Decomposition in Parallel: From Construction to Subgraph Search
inferred← citeshttps://doi.org/10.1109/icde53745.2022.00109openalex-snapshot
On Time-optimal (k, p)-core Community Search in Dynamic Graphs
inferred← citeshttps://doi.org/10.1109/icde53745.2022.00191openalex-snapshot
Finding Top-r Influential Communities under Aggregation Functions
inferred← citeshttps://doi.org/10.1109/icde53745.2022.00217openalex-snapshot
Discovering Hierarchy of Bipartite Graphs with Cohesive Subgraphs
inferred← citeshttps://doi.org/10.1109/icde53745.2022.00239openalex-snapshot
Colorful h-star Core Decomposition
inferred← citeshttps://doi.org/10.1109/icde55515.2023.00008openalex-snapshot
Verification-Free Approaches to Efficient Locally Densest Subgraph Discovery
inferred← citeshttps://doi.org/10.1109/icde55515.2023.00029openalex-snapshot
Scalable Algorithms for Densest Subgraph Discovery
inferred← citeshttps://doi.org/10.1109/icde55515.2023.00130openalex-snapshot
Top-r keyword-based community search in attributed graphs
inferred← citeshttps://doi.org/10.1109/icde55515.2023.00163openalex-snapshot
FASI: FPGA-friendly Subgraph Isomorphism on Massive Graphs
inferred← citeshttps://doi.org/10.1109/icde55515.2023.00266openalex-snapshot
Decision Support System for Chronic Diseases Based on Drug-Drug Interactions
inferred← citeshttps://doi.org/10.1109/icde55515.2023.00309openalex-snapshot
Exploiting Reuse for GPU Subgraph Enumeration (Extended Abstract)
inferred← citeshttps://doi.org/10.1109/icde60146.2024.00199openalex-snapshot
Positive Communities on Signed Graphs That Are Not Echo Chambers: A Clique-Based Approach
inferred← citeshttps://doi.org/10.1109/icde60146.2024.00202openalex-snapshot
On Searching Maximum Directed $(k, \ell)$-Plex
inferred← citeshttps://doi.org/10.1109/icde60146.2024.00245openalex-snapshot
G2-AIMD: A Memory-Efficient Subgraph-Centric Framework for Efficient Subgraph Finding on GPUs
inferred← citeshttps://doi.org/10.1109/icde60146.2024.00249openalex-snapshot
I/O Efficient Max-Truss Computation in Large Static and Dynamic Graphs
inferred← citeshttps://doi.org/10.1109/icde60146.2024.00253openalex-snapshot
Adaptive Truss Maximization on Large Graphs: A Minimum Cut Approach
inferred← citeshttps://doi.org/10.1109/icde60146.2024.00258openalex-snapshot
Querying Cohesive Subgraph Regarding Span-Constrained Triangles on Temporal Graphs
inferred← citeshttps://doi.org/10.1109/icde60146.2024.00479openalex-snapshot
Higher-Order Truss Decomposition in Graphs (Extended Abstract)
inferred← citeshttps://doi.org/10.1109/icde65448.2025.00055openalex-snapshot
StructRide: A Framework to Exploit the Structure Information of Shareability Graph in Ridesharing
inferred← citeshttps://doi.org/10.1109/icde65448.2025.00140openalex-snapshot
TDT: Tensor Based Directed Truss Decomposition
inferred← citeshttps://doi.org/10.1109/icde65448.2025.00198openalex-snapshot
Efficient $k$-Truss Breaking and Minimization
inferred← citeshttps://doi.org/10.1109/icde65448.2025.00201openalex-snapshot
Truss Decomposition Under Edge Local Differential Privacy
inferred← citeshttps://doi.org/10.1109/icde65448.2025.00232openalex-snapshot
Efficient Maximum Balanced k-biplex Search Over Bipartite Graphs
inferred← citeshttps://doi.org/10.1109/icde65448.2025.00253openalex-snapshot
Enhance Stability of Network by Edge Anchor
inferred← citeshttps://doi.org/10.1109/icde65448.2025.00296openalex-snapshot
With Anchors or Not: Fairness-Aware Truss-Based Community Search on Attributed Graphs
inferred← citeshttps://doi.org/10.1109/icde65706.2026.00039openalex-snapshot
Keyword-Aware Skyline Community Search on Semantics and Structure
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/icdm.2018.00100openalex-snapshot
Fast Rectangle Counting on Massive Networks
inferred← citeshttps://doi.org/10.1109/icdm51629.2021.00072openalex-snapshot
Fast computation of distance-generalized cores using sampling
inferred← citeshttps://doi.org/10.1109/icdmw69685.2025.00127openalex-snapshot
Robustness of Truss Decomposition and Implications for GNN-Based Edge Classification
inferred← citeshttps://doi.org/10.1109/icip42928.2021.9506581openalex-snapshot
Identifying Coherent Subgraphs In Dynamic Brain Networks
showing the first 200 of 409 · page through all 409
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.