On the public citation graph
Maximum k-Plex Computation: Theory and Practice
0 signed · 53 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.1002/widm.1178openalex-snapshot
Community detection in social networks
inferredcites →https://doi.org/10.1007/978-3-319-53925-6_1openalex-snapshot
Efficient Algorithms for Finding Maximum and Maximal Cliques and Their Applications
inferredcites →https://doi.org/10.1007/978-3-540-77018-3_47openalex-snapshot
A Parallel Algorithm for Enumerating All the Maximal k-Plexes
inferredcites →https://doi.org/10.1007/s00778-013-0340-zopenalex-snapshot
Dense subgraph maintenance under streaming edge weight updates for real-time story identification
inferredcites →https://doi.org/10.1007/s10878-010-9338-2openalex-snapshot
Combinatorial algorithms for the maximum k-plex problem
inferredcites →https://doi.org/10.1007/s10878-011-9391-5openalex-snapshot
Exact combinatorial algorithms and experiments for finding maximum k-plexes
inferredcites →https://doi.org/10.1016/0022-0000(80)90060-4openalex-snapshot
The node-deletion problem for hereditary properties is NP-complete
inferredcites →https://doi.org/10.1016/j.cor.2015.07.013openalex-snapshot
A new exact maximum clique algorithm for large and massive sparse graphs
inferredcites →https://doi.org/10.1016/j.cor.2017.02.017openalex-snapshot
On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem
inferredcites →https://doi.org/10.1016/j.future.2015.01.001openalex-snapshot
A survey of anomaly detection techniques in financial domain
inferredcites →https://doi.org/10.1016/j.jpdc.2017.03.003openalex-snapshot
Parallelizing maximal clique and k-plex enumeration over graph data
inferredcites →https://doi.org/10.1080/0022250x.1978.9989883openalex-snapshot
A graph‐theoretic generalization of the clique concept
inferredcites →https://doi.org/10.1145/1081870.1081898openalex-snapshot
On mining cross-graph quasi-cliques
inferredcites →https://doi.org/10.1145/2487575.2487645openalex-snapshot
Denser than the densest subgraph
inferredcites →https://doi.org/10.1145/2723372.2746478openalex-snapshot
Efficient Enumeration of Maximal k-Plexes
inferredcites →https://doi.org/10.1145/3097983.3098031openalex-snapshot
Fast Enumeration of Large k-Plexes
inferredcites →https://doi.org/10.1145/3292500.3330986openalex-snapshot
Efficient Maximum Clique Computation over Large Sparse Graphs
inferredcites →https://doi.org/10.1145/3485447.3512198openalex-snapshot
Listing Maximal k-Plexes in Large Real-World Graphs
inferredcites →https://doi.org/10.1145/3511808.3557444openalex-snapshot
Scaling Up Maximal k -plex Enumeration
inferredcites →https://doi.org/10.1145/3588729openalex-snapshot
Maximum k-Biplex Search on Bipartite Graphs: A Symmetric-BK Branching Approach
inferredcites →https://doi.org/10.1145/3589283openalex-snapshot
Hereditary Cohesive Subgraphs Enumeration on Bipartite Graphs: The Power of Pivot-based Approaches
inferredcites →https://doi.org/10.1145/362342.362367openalex-snapshot
Algorithm 457: finding all cliques of an undirected graph
inferredcites →https://doi.org/10.1287/opre.1100.0851openalex-snapshot
Clique Relaxations in Social Network Analysis: The Maximum k -Plex Problem
inferredcites →https://doi.org/10.1371/journal.pcbi.1003814openalex-snapshot
Characterizing Protein Interactions Employing a Genome-Wide siRNA Cellular Phenotyping Screen
inferredcites →https://doi.org/10.14778/2311906.2311909openalex-snapshot
Truss decomposition in massive networks
inferredcites →https://doi.org/10.14778/3137628.3137660openalex-snapshot
Finding the maximum clique in massive graphs
inferredcites →https://doi.org/10.14778/3436905.3436916openalex-snapshot
Scalable mining of maximal quasi-cliques
inferredcites →https://doi.org/10.14778/3565816.3565817openalex-snapshot
Efficient maximum k -plex computation over large sparse graphs
inferredcites →https://doi.org/10.1609/aaai.v31i1.10655openalex-snapshot
A Fast Algorithm to Compute Maximum k-Plexes in Social Network Analysis
inferredcites →https://doi.org/10.1609/aaai.v34i03.5625openalex-snapshot
Enumerating Maximal k-Plexes with Worst-Case Time Guarantee
inferredcites →https://doi.org/10.1609/aaai.v35i14.17477openalex-snapshot
Improving Maximum k-plex Solver via Second-Order Reduction and Graph Color Bounding
inferredcites →https://doi.org/10.24963/ijcai.2018/201openalex-snapshot
An Exact Algorithm for Maximum k-Plexes in Massive Graphs
inferredcites →https://doi.org/10.24963/ijcai.2021/233openalex-snapshot
A New Upper Bound Based on Vertex Partitioning for the Maximum K-plex Problem
inferredcites →https://doi.org/10.24963/ijcai.2023/627openalex-snapshot
A Fast Maximum k-Plex Algorithm Parameterized by the Degeneracy Gap
inferredcites →https://doi.org/10.7551/mitpress/8291.003.0006openalex-snapshot
Foundations of Machine Learning
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1016/j.artint.2026.104604openalex-snapshot
ParaKplex: A parallel local search algorithm for the maximum K-Plex problem
inferred← citeshttps://doi.org/10.1016/j.eswa.2026.132943openalex-snapshot
An observer-enhanced evolutionary search framework for solving the simplified diversified top-k s-plex problem
inferred← citeshttps://doi.org/10.1016/j.ins.2026.123279openalex-snapshot
Modularity community detection based on maximal K-plex
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/icde65706.2026.00190openalex-snapshot
Listing Minimal Cores in Large Real-World Graphs
inferred← citeshttps://doi.org/10.1109/tcss.2024.3462934openalex-snapshot
Efficient Detection of $k$-Plex Structures in Large Graphs Through Constraint Learning
inferred← citeshttps://doi.org/10.1109/tkde.2025.3565844openalex-snapshot
Minimum $k$k-Vertex Connected Graph Search
inferred← citeshttps://doi.org/10.1109/tkde.2025.3569755openalex-snapshot
On Searching and Querying Maximum Directed (k,ℓ)-Plex
inferred← citeshttps://doi.org/10.1109/tkde.2025.3620605openalex-snapshot
Efficient $k$k-Plex Mining in Temporal Graphs
inferred← citeshttps://doi.org/10.1145/3709687openalex-snapshot
Efficient Maximum s -Bundle Search via Local Vertex Connectivity
inferred← citeshttps://doi.org/10.1145/3711896.3737041openalex-snapshot
Maximum Degree-Based Quasi-Clique Search via an Iterative Framework
inferred← citeshttps://doi.org/10.1145/3774904.3792114openalex-snapshot
Maximum Edge-based Quasi-Clique: Novel Iterative Frameworks
inferred← citeshttps://doi.org/10.1145/3802103openalex-snapshot
Querying Cohesive Subgraphs in Temporal Graphs
inferred← citeshttps://doi.org/10.1145/3837110openalex-snapshot
Efficient Querying of Maximum Connectivity-Based Quasi-Cliques in Large Graphs
inferred← citeshttps://doi.org/10.14778/3705829.3705851openalex-snapshot
Maximum k -Plex Search: An Alternated Reduction-and-Bound Method
inferred← citeshttps://doi.org/10.14778/3746405.3746418openalex-snapshot
Maximum k -Plex Finding: Choices of Pruning Techniques Matter!
inferred← citeshttps://doi.org/10.2139/ssrn.5768076openalex-snapshot
An efficient local search algorithm with frequency based configuration checking strategy for the maximum weighted k-plex problem
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.