On the public citation graph
Hereditary Cohesive Subgraphs Enumeration on Bipartite Graphs: The Power of Pivot-based Approaches
0 signed · 58 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/11823728_42openalex-snapshot
Efficient Mining of Large Maximal Bicliques
inferredcites →https://doi.org/10.1007/3-540-45735-6_1openalex-snapshot
The DBLP Computer Science Bibliography: Evolution, Research Issues, Perspectives
inferredcites →https://doi.org/10.1007/978-3-319-32049-6_14openalex-snapshot
Bitruss Decomposition of Bipartite Graphs
inferredcites →https://doi.org/10.1007/978-3-540-87481-2_3openalex-snapshot
Effective Pruning Techniques for Mining Quasi-Cliques
inferredcites →https://doi.org/10.1007/978-3-642-14031-0_44openalex-snapshot
Near Optimal Solutions for Maximum Quasi-bicliques
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-662-49192-8_46openalex-snapshot
Summarizing Online User Reviews Using Bicliques
inferredcites →https://doi.org/10.1007/s00453-012-9632-8openalex-snapshot
Fast Maximal Cliques Enumeration in Sparse Graphs
inferredcites →https://doi.org/10.1007/s00778-020-00606-9openalex-snapshot
Efficient ($$\alpha $$, $$\beta $$)-core computation in bipartite graphs
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.ipl.2014.02.001openalex-snapshot
Enumerating maximal bicliques in bipartite graphs with favorable degree sequences
inferredcites →https://doi.org/10.1016/j.jcss.2008.04.003openalex-snapshot
Generating all maximal induced subgraphs for hereditary and connected-hereditary graph properties
inferredcites →https://doi.org/10.1016/j.socnet.2015.04.001openalex-snapshot
Generalized two-mode cores
inferredcites →https://doi.org/10.1016/j.tcs.2006.06.015openalex-snapshot
The worst-case time complexity for generating all maximal cliques and computational experiments
inferredcites →https://doi.org/10.1016/j.tcs.2015.11.016openalex-snapshot
Refined pivot selection for maximal clique enumeration in graphs
inferredcites →https://doi.org/10.1016/s0166-218x(03)00333-0openalex-snapshot
The maximum edge biclique problem is NP-complete
inferredcites →https://doi.org/10.1093/bioinformatics/btl020openalex-snapshot
Discovering motif pairs at interaction sites from protein sequences on a proteome-wide scale
inferredcites →https://doi.org/10.1093/nar/gkg340openalex-snapshot
Topological structure analysis of the protein-protein interaction network in budding yeast
inferredcites →https://doi.org/10.1109/hipc.2019.00016openalex-snapshot
Shared-Memory Parallel Maximal Biclique Enumeration
inferredcites →https://doi.org/10.1109/icde48307.2020.00063openalex-snapshot
Efficient Bitruss Decomposition for Large-scale Bipartite Graphs
inferredcites →https://doi.org/10.1109/icdm.2018.00072openalex-snapshot
Deep Structure Learning for Fraud Detection
inferredcites →https://doi.org/10.1109/tkde.2007.190660openalex-snapshot
Maximal Biclique Subgraphs and Closed Pattern Pairs of the Adjacency Matrix: A One-to-One Correspondence and Mining Algorithms
inferredcites →https://doi.org/10.1109/tkde.2020.3021484openalex-snapshot
I/O-Efficient Algorithms for Degeneracy Computation on Massive Networks
inferredcites →https://doi.org/10.1109/tkde.2021.3077071openalex-snapshot
On Efficient Large Maximal Biplex Discovery
inferredcites →https://doi.org/10.1137/1.9781611974348.36openalex-snapshot
On finding the maximum edge biclique in a bipartite graph: a subspace clustering approach
inferredcites →https://doi.org/10.1145/1081870.1081898openalex-snapshot
On mining cross-graph quasi-cliques
inferredcites →https://doi.org/10.1145/1557019.1557097openalex-snapshot
Towards efficient mining of proportional fault-tolerant frequent itemsets
inferredcites →https://doi.org/10.1145/2723372.2746478openalex-snapshot
Efficient Enumeration of Maximal k-Plexes
inferredcites →https://doi.org/10.1145/3514221.3517847openalex-snapshot
Efficient Algorithms for Maximal k-Biplex Enumeration
inferredcites →https://doi.org/10.1145/362342.362367openalex-snapshot
Algorithm 457: finding all cliques of an undirected graph
inferredcites →https://doi.org/10.1186/1471-2105-13-s18-a10openalex-snapshot
Exact biclustering algorithm for the analysis of large gene expression data sets
inferredcites →https://doi.org/10.1186/1471-2105-15-110openalex-snapshot
On finding bicliques in bipartite graphs: a novel algorithm and its application to the integration of diverse biological data types
inferredcites →https://doi.org/10.14778/3529337.3529341openalex-snapshot
Efficient maximal biclique enumeration for large sparse bipartite graphs
inferredcites →https://doi.org/10.1609/aaai.v34i03.5625openalex-snapshot
Enumerating Maximal k-Plexes with Worst-Case Time Guarantee
inferredcites →https://doi.org/10.24963/ijcai.2020/492openalex-snapshot
Pivot-based Maximal Biclique Enumeration
inferredcites →https://doi.org/10.5555/1656479.1656483openalex-snapshot
Mining maximal quasi-bicliques: Novel algorithm and applications in the stock market and protein 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-981-95-3906-2_7openalex-snapshot
Efficient Maximum $$(\alpha ,\beta )$$-Quasi Biclique Computation on Bipartite Graphs
inferred← citeshttps://doi.org/10.1109/bigdata62323.2024.10825721openalex-snapshot
Monarch: Distributed Butterfly Counting for Large-scale Bipartite Graph
inferred← citeshttps://doi.org/10.1109/icde60146.2024.00202openalex-snapshot
On Searching Maximum Directed $(k, \ell)$-Plex
inferred← citeshttps://doi.org/10.1109/icde65448.2025.00051openalex-snapshot
Maximal Clique Enumeration with Hybrid Branching and Early Termination
inferred← citeshttps://doi.org/10.1109/icde65448.2025.00086openalex-snapshot
Maximal Similar-Weight Biclique Enumeration for Large Bipartite Graphs
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.00277openalex-snapshot
Identifying Maximum Defective Bicliques in Large 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/tkde.2025.3569755openalex-snapshot
On Searching and Querying Maximum Directed (k,ℓ)-Plex
inferred← citeshttps://doi.org/10.1145/3639318openalex-snapshot
Maximum k-Plex Computation: Theory and Practice
inferred← citeshttps://doi.org/10.1145/3654938openalex-snapshot
Efficient Maximal Biplex Enumerations with Improved Worst-Case Time Guarantee
inferred← citeshttps://doi.org/10.1145/3709666openalex-snapshot
BCviz: A Linear-Space Index for Mining and Visualizing Cohesive Bipartite Subgraphs
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/3749187openalex-snapshot
The Power of Core Clique Removal for Exact Clique Enumeration
inferred← citeshttps://doi.org/10.1145/3769833openalex-snapshot
Theoretically and Practically Efficient Maximum Biclique Search
inferred← citeshttps://doi.org/10.1145/3802086openalex-snapshot
Maximal Biclique Enumeration with Improved Worst-Case Time Complexity Guarantee: A Partition-Oriented Strategy
inferred← citeshttps://doi.org/10.14778/3836663.3836687openalex-snapshot
Maximum Defective Biclique Search in Large Bipartite Graphs
inferred← citeshttps://doi.org/10.32657/10356/176240openalex-snapshot
Efficient algorithms for subgraph counting and enumeration on large 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.