On the public citation graph
An exact algorithm for the maximum quasi‐clique problem
0 signed · 35 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/978-1-4684-2001-2_9openalex-snapshot
Reducibility among Combinatorial Problems
inferredcites →https://doi.org/10.1007/978-3-031-32726-1openalex-snapshot
Integer Programming and Combinatorial Optimization
inferredcites →https://doi.org/10.1007/s10479-012-1242-yopenalex-snapshot
A branch-and-bound approach for maximum quasi-cliques
inferredcites →https://doi.org/10.1007/s10589-015-9804-yopenalex-snapshot
Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs
inferredcites →https://doi.org/10.1016/j.dam.2012.07.019openalex-snapshot
On the maximum quasi-clique problem
inferredcites →https://doi.org/10.1090/dimacs/026openalex-snapshot
Cliques, Coloring, and Satisfiability
inferredcites →https://doi.org/10.1090/dimacs/050/06openalex-snapshot
On maximum clique problems in very large graphs
inferredcites →https://doi.org/10.1145/2049662.2049663openalex-snapshot
The university of Florida sparse matrix collection
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-030-62696-9_8openalex-snapshot
Graph Mining Meets Fake News Detection
inferred← citeshttps://doi.org/10.1007/s10479-023-05609-7openalex-snapshot
A biased random-key genetic algorithm for the minimum quasi-clique partitioning problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2020.03.019openalex-snapshot
An opposition-based memetic algorithm for the maximum quasi-clique problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2024.12.018openalex-snapshot
Solving the Multiobjective Quasi-clique Problem
inferred← citeshttps://doi.org/10.1016/j.eswa.2023.121816openalex-snapshot
DeepDense: Enabling node embedding to dense subgraph mining
inferred← citeshttps://doi.org/10.1016/j.ins.2021.06.094openalex-snapshot
Solving maximum quasi-clique problem by a hybrid artificial bee colony approach
inferred← citeshttps://doi.org/10.1016/j.ins.2022.08.073openalex-snapshot
The minimum quasi-clique partitioning problem: Complexity, formulations, and a computational study
inferred← citeshttps://doi.org/10.1016/j.knosys.2026.116522openalex-snapshot
A branch-and-bound approach for maximum low-diameter dense subgraph problems
inferred← citeshttps://doi.org/10.1049/ell2.12685openalex-snapshot
A local search algorithm with hybrid strategies for the maximum weighted quasi‐clique problem
inferred← citeshttps://doi.org/10.1051/ro/2020003openalex-snapshot
A BRKGA-based matheuristic for the maximum quasi-clique problem with an exact local search strategy
inferred← citeshttps://doi.org/10.1111/itor.12854openalex-snapshot
Polarization reduction by minimum‐cardinality edge additions: Complexity and integer programming approaches
inferred← citeshttps://doi.org/10.1111/itor.13172openalex-snapshot
Exact algorithms for the product configuration problem
inferred← citeshttps://doi.org/10.1111/itor.13299openalex-snapshot
MIP formulations for induced graph optimization problems: a tutorial
inferred← citeshttps://doi.org/10.1111/itor.70184openalex-snapshot
Ensuring connectedness for the maximum quasi‐clique and densest k ‐subgraph problems
inferred← citeshttps://doi.org/10.1145/3396474.3396486openalex-snapshot
Reducing Network Polarization by Edge Additions
inferred← citeshttps://doi.org/10.1145/3589334.3645374openalex-snapshot
A Similarity-based Approach for Efficient Large Quasi-clique Detection
inferred← citeshttps://doi.org/10.1145/3677142openalex-snapshot
Theoretically and Practically Efficient Maximum Defective Clique Search
inferred← citeshttps://doi.org/10.1145/3774904.3792114openalex-snapshot
Maximum Edge-based Quasi-Clique: Novel Iterative Frameworks
inferred← citeshttps://doi.org/10.1145/3805712.3809542openalex-snapshot
Cohesive Group Discovery in Interaction Graphs under Explicit Density Constraints
inferred← citeshttps://doi.org/10.1145/3837110openalex-snapshot
Efficient Querying of Maximum Connectivity-Based Quasi-Cliques in Large Graphs
inferred← citeshttps://doi.org/10.1609/aaai.v35i14.17455openalex-snapshot
NuQClq: An Effective Local Search Algorithm for Maximum Quasi-Clique Problem
inferred← citeshttps://doi.org/10.2139/ssrn.7330469openalex-snapshot
Vertex Partitions under Size-Adaptive Degree Constraints
inferred← citeshttps://doi.org/10.3390/math14081298openalex-snapshot
Split-and-Reduce: A New Exact Algorithm with Tight Multi-Order Intersection Bounds for the Quasi-Clique Enumeration Problem
inferred← citeshttps://doi.org/10.70675/da7b772aza572z4b78z89c4zbce8fd9f8095openalex-snapshot
Anomaly Detection in Graph Streams
inferred← citeshttps://doi.org/10.7717/peerj-cs.2173openalex-snapshot
An optimization algorithm for maximum quasi-clique problem based on information feedback model
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.