On the public citation graph

Maximum k-Biplex Search on Bipartite Graphs: A Symmetric-BK Branching Approach

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.
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.1006/jagm.2001.1199openalex-snapshot
On Bipartite and Multipartite Clique Problems
inferredcites →https://doi.org/10.1007/s00778-020-00606-9openalex-snapshot
Efficient ($$\alpha $$, $$\beta $$)-core computation in bipartite graphs
inferredcites →https://doi.org/10.1007/s10878-011-9392-4openalex-snapshot
Near optimal solutions for maximum quasi-bicliques
inferredcites →https://doi.org/10.1016/j.ejor.2018.03.010openalex-snapshot
Towards effective exact methods for the Maximum Balanced Biclique Problem in bipartite graphs
inferredcites →https://doi.org/10.1016/j.ins.2017.12.012openalex-snapshot
New heuristic approaches for maximum balanced biclique problem
inferredcites →https://doi.org/10.1016/j.ipm.2019.03.004openalex-snapshot
An overview of online fake news: Characterization, detection, and discussion
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.jpdc.2017.03.003openalex-snapshot
Parallelizing maximal clique and k-plex enumeration over graph data
inferredcites →https://doi.org/10.1109/cse.2018.00025openalex-snapshot
Finding Maximum Edge Biclique in Bipartite Networks by Integer Programming
inferredcites →https://doi.org/10.1109/icde48307.2020.00063openalex-snapshot
Efficient Bitruss Decomposition for Large-scale Bipartite Graphs
inferredcites →https://doi.org/10.1109/icde51399.2021.00015openalex-snapshot
Efficient and Effective Community Search on Large-scale Bipartite Graphs
inferredcites →https://doi.org/10.1109/icde53745.2022.00072openalex-snapshot
Maximum Biplex Search over Bipartite Graphs
inferredcites →https://doi.org/10.1109/tcsi.2007.907875openalex-snapshot
A Defect Tolerance Scheme for Nanotechnology Circuits
inferredcites →https://doi.org/10.1109/tcyb.2014.2343966openalex-snapshot
A New Evolutionary Algorithm with Structure Mutation for the Maximum Balanced Biclique Problem
inferredcites →https://doi.org/10.1109/tkde.2021.3077071openalex-snapshot
On Efficient Large Maximal Biplex Discovery
inferredcites →https://doi.org/10.1109/tsc.2016.2523997openalex-snapshot
Enumerating Maximal Bicliques from a Large Graph Using MapReduce
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/1148170.1148257openalex-snapshot
Unifying user-based and item-based collaborative filtering approaches by similarity fusion
inferredcites →https://doi.org/10.1145/1167943.1167945openalex-snapshot
Application-independent defect tolerance of reconfigurable nanoarchitectures
inferredcites →https://doi.org/10.1145/1557019.1557097openalex-snapshot
Towards efficient mining of proportional fault-tolerant frequent itemsets
inferredcites →https://doi.org/10.1145/2488388.2488400openalex-snapshot
CopyCatch
inferredcites →https://doi.org/10.1145/2783258.2783385openalex-snapshot
Scalable Large Near-Clique Detection in Large-Scale Networks via Sampling
inferredcites →https://doi.org/10.1145/2939672.2939747openalex-snapshot
FRAUDAR
inferredcites →https://doi.org/10.1145/3132847.3133130openalex-snapshot
Efficient Fault-Tolerant Group Recommendation Using alpha-beta-core
inferredcites →https://doi.org/10.1145/3219819.3220093openalex-snapshot
D2K
inferredcites →https://doi.org/10.1145/3372923.3404783openalex-snapshot
Unsupervised Fake News Detection
inferredcites →https://doi.org/10.1145/3448016.3459241openalex-snapshot
Efficient Exact Algorithms for Maximum Balanced Biclique Search in Bipartite 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/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.14778/3339490.3339497openalex-snapshot
Vertex priority based butterfly counting for large-scale bipartite networks
inferredcites →https://doi.org/10.14778/3397230.3397234openalex-snapshot
Maximum biclique search at billion scale
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.1007/s00778-024-00882-9openalex-snapshot
Accelerating maximum biplex search over large bipartite graphs
inferred← citeshttps://doi.org/10.1007/s00778-025-00939-3openalex-snapshot
Efficient maximum signed biclique and biplex identification in signed bipartite graphs
inferred← citeshttps://doi.org/10.1016/j.eswa.2025.128380openalex-snapshot
Efficient top- k s -biplexes search over large bipartite graphs with time complexity guarantees
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.1109/icde55515.2023.00105openalex-snapshot
Efficient Maximum Signed Biclique Identification
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.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.00276openalex-snapshot
TopK-BC: Efficient Maintenance of Top k (p,q)-bicliques over Streaming 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.2024.3373654openalex-snapshot
Efficient Maximal Biclique Enumeration on Large Signed Bipartite 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/3617331openalex-snapshot
Fast Maximal Quasi-clique Enumeration: A Pruning and Branching Co-Design Approach
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/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/3746252.3760927openalex-snapshot
From Bicliques to BiFlexi Cliques: A New Era of Bipartite Subgraph Discovery
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.26599/tst.2024.9010009openalex-snapshot
Efficient Maximum Vertex (k,ℓ)-Biplex Computation on 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.