On the public citation graph
Test case generators and computational results for the maximum clique problem
0 signed · 81 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/bf01181421openalex-snapshot
�ber l�ckenlose Ausf�llung desn-dimensionalen Raumes durch kongruente W�rfel
inferredcites →https://doi.org/10.1007/bf01181436openalex-snapshot
�ber l�ckenlose Ausf�llung desn-dimensionalen Raumes durch kongruente W�rfel. II
inferredcites →https://doi.org/10.1007/bf01848388openalex-snapshot
A reduction of Keller's conjecture
inferredcites →https://doi.org/10.1007/bf01946848openalex-snapshot
A combinatorial approach for Keller's conjecture
inferredcites →https://doi.org/10.1007/bf02021311openalex-snapshot
Sur le problème de factorisation des groupes cycliques
inferredcites →https://doi.org/10.1016/0041-5553(80)90340-7openalex-snapshot
The theory of error-correcting codes
inferredcites →https://doi.org/10.1016/0167-6377(90)90057-copenalex-snapshot
An exact algorithm for the maximum clique problem
inferredcites →https://doi.org/10.1016/0305-0548(92)90067-fopenalex-snapshot
A branch and bound algorithm for the maximum clique problem
inferredcites →https://doi.org/10.1016/s0924-6509(08)x7030-8openalex-snapshot
The Theory of Error-Correcting Codes
inferredcites →https://doi.org/10.1090/s0273-0979-1992-00318-xopenalex-snapshot
Keller’s cube-tiling conjecture is false in high dimensions
inferredcites →https://doi.org/10.1109/18.59932openalex-snapshot
A new table of constant weight codes
inferredcites →https://doi.org/10.1109/pgec.1967.264748openalex-snapshot
On the Connection Assignment Problem of Diagnosable Systems
inferredcites →https://doi.org/10.1137/0215075openalex-snapshot
Finding a Maximum Clique in an Arbitrary Graph
inferredcites →https://doi.org/10.1137/0220012openalex-snapshot
Minimum Weighted Coloring of Triangulated Graphs, with Application to Maximum Weight Vertex Packing and Clique Finding in Arbitrary Graphs
inferredcites →https://doi.org/10.1137/0221058openalex-snapshot
Addendum: Minimum Weighted Coloring of Triangulated Graphs, with Application to Maximum Weight Vertex Packing and Clique Finding in Arbitrary Graphs
inferredcites →https://doi.org/10.1145/103147.103156openalex-snapshot
Construction of test problems in quadratic bivalent programming
inferredcites →https://doi.org/10.1515/crll.1930.163.231openalex-snapshot
Über die lückenlose Erfüllung des Raumes mit Würfeln.
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-0-387-74759-0_634openalex-snapshot
Stable Set Problem: Branch & Cut Algorithms
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_71openalex-snapshot
Combinatorial Test Problems and Problem Generators
inferred← citeshttps://doi.org/10.1007/978-1-4613-0303-9_16openalex-snapshot
The Graph Coloring Problem: A Bibliographic Survey
inferred← citeshttps://doi.org/10.1007/978-1-4613-3279-4_18openalex-snapshot
An Exact Parallel Algorithm for the Maximum Clique Problem
inferred← citeshttps://doi.org/10.1007/978-1-4613-3279-4_4openalex-snapshot
Replicator Dynamics for Evolution Towards the Maximum Clique: Variations and Experiments
inferred← citeshttps://doi.org/10.1007/978-1-4757-2600-8_6openalex-snapshot
Evolutionary Approach to the Maximum Clique Problem: Empirical Evidence on a Larger Scale
inferred← citeshttps://doi.org/10.1007/978-1-4757-3023-4_1openalex-snapshot
The Maximum Clique Problem
inferred← citeshttps://doi.org/10.1007/978-3-030-54621-2_634-1openalex-snapshot
Stable Set Problem: Branch & Cut Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-13193-6_2openalex-snapshot
Computational Challenges with Cliques, Quasi-cliques and Clique Partitions in Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-58300-1_13openalex-snapshot
Approximating Stable Sets Using the ϑ-function and Cutting Planes
inferred← citeshttps://doi.org/10.1007/bf01299447openalex-snapshot
An exact algorithm for the maximum stable set problem
inferred← citeshttps://doi.org/10.1007/s004530010074openalex-snapshot
Reactive Local Search for the Maximum Clique Problem1
inferred← citeshttps://doi.org/10.1007/s10100-021-00776-zopenalex-snapshot
Numerical experiments with LP formulations of the maximum clique problem
inferred← citeshttps://doi.org/10.1007/s10589-013-9548-5openalex-snapshot
Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations
inferred← citeshttps://doi.org/10.1007/s10732-012-9207-5openalex-snapshot
Subgraph extraction and metaheuristics for the maximum clique problem
inferred← citeshttps://doi.org/10.1007/s10898-011-9816-9openalex-snapshot
Monotonic optimization based decoding for linear codes
inferred← citeshttps://doi.org/10.1007/s11265-018-1357-8openalex-snapshot
Finding Maximum Cliques on the D-Wave Quantum Annealer
inferred← citeshttps://doi.org/10.1007/s11590-012-0585-2openalex-snapshot
Error-tolerance pooling designs based on Johnson graphs
inferred← citeshttps://doi.org/10.1007/s43069-021-00111-xopenalex-snapshot
A Clique Search Problem and its Application to Machine Scheduling
inferred← citeshttps://doi.org/10.1016/0004-3702(95)00044-5openalex-snapshot
Phase transitions and the search problem
inferred← citeshttps://doi.org/10.1016/j.dam.2018.01.006openalex-snapshot
Decomposing clique search problems into smaller instances based on node and edge colorings
inferred← citeshttps://doi.org/10.1016/j.orl.2006.07.004openalex-snapshot
Using critical sets to solve the maximum independent set problem
inferred← citeshttps://doi.org/10.1016/s0166-218x(01)00290-6openalex-snapshot
A fast algorithm for the maximum clique problem
inferred← citeshttps://doi.org/10.1016/s0166-218x(99)00249-8openalex-snapshot
A coloring problem on the n-cube
inferred← citeshttps://doi.org/10.1023/a:1008303023616openalex-snapshot
Generating Hard Test Instances with Known Optimal Solution for the Rectilinear Quadratic Assignment Problem
inferred← citeshttps://doi.org/10.1023/a:1009646528813openalex-snapshot
Optimized Crossover-Based Genetic Algorithms for the Maximum Cardinality and Maximum Weight Clique Problems
inferred← citeshttps://doi.org/10.1023/a:1017557620292openalex-snapshot
On the Chromatic Number of Graphs
inferred← citeshttps://doi.org/10.1023/a:1018965309522openalex-snapshot
A generalization of the Hoffman - Lovász upper boundon the independence number of a regular graph
inferred← citeshttps://doi.org/10.1023/b:jogo.0000006654.34226.feopenalex-snapshot
Ellipsoidal Approach to Box-Constrained Quadratic Problems
inferred← citeshttps://doi.org/10.1080/10556780500139641openalex-snapshot
Constructing test functions for global optimization using continuous formulations of graph problems
inferred← citeshttps://doi.org/10.1080/10556788.2010.544310openalex-snapshot
Depth-first simplicial partition for copositivity detection, with an application to MaxClique
inferred← citeshttps://doi.org/10.1080/10556788.2014.916287openalex-snapshot
Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2
inferred← citeshttps://doi.org/10.1088/1742-6596/268/1/012030openalex-snapshot
Parallel algorithms for finding cliques in a graph
inferred← citeshttps://doi.org/10.1090/dimacs/050/06openalex-snapshot
On maximum clique problems in very large graphs
inferred← citeshttps://doi.org/10.1093/jcde/qwac010openalex-snapshot
Cellular goore game with application to finding maximum clique in social networks
inferred← citeshttps://doi.org/10.1109/icrc.2017.8123654openalex-snapshot
Reducing Binary Quadratic Forms for More Scalable Quantum Annealing
inferred← citeshttps://doi.org/10.1109/icsmc.1997.625791openalex-snapshot
A test problem generation methodology for nonlinear goal programming
inferred← citeshttps://doi.org/10.1109/indicon.2017.8488050openalex-snapshot
A Fast Algorithm for Enumerating Maximal Cliques in Large Scale Network
inferred← citeshttps://doi.org/10.1109/synasc.2018.00055openalex-snapshot
A Different Approach to Maximum Clique Search
inferred← citeshttps://doi.org/10.1111/j.1475-3995.2011.00805.xopenalex-snapshot
A tutorial on branch and cut algorithms for the maximum stable set problem
inferred← citeshttps://doi.org/10.1137/s1052623401394092openalex-snapshot
Computational Experience with Stable Set Relaxations
inferred← citeshttps://doi.org/10.1201/9781420009712.ch11openalex-snapshot
Complexity and Large-Scale Networks
inferred← citeshttps://doi.org/10.1201/9781420091830.ch11openalex-snapshot
Complexity and Large-Scale Networks
inferred← citeshttps://doi.org/10.1287/opre.1100.0851openalex-snapshot
Clique Relaxations in Social Network Analysis: The Maximum k -Plex Problem
inferred← citeshttps://doi.org/10.14232/phd.10444openalex-snapshot
The k-Clique Problem Usage, Modeling Expressivity, Serial and Massively Parallel Algorithms
inferred← citeshttps://doi.org/10.1515/ausi-2016-0004openalex-snapshot
Edge coloring of graphs, uses, limitation, complexity
inferred← citeshttps://doi.org/10.15388/informatica.2011.345openalex-snapshot
Copositive Programming by Simplicial Partition
inferred← citeshttps://doi.org/10.1556/314.2020.00005openalex-snapshot
Some Zero-One Linear Programming Reformulations for the Maximum Clique Problem
inferred← citeshttps://doi.org/10.1556/314.2023.00002openalex-snapshot
Splitting Edge Partitions of Graphs
inferred← citeshttps://doi.org/10.1556/314.2023.00004openalex-snapshot
Batch Scheduling with Time Restriction and Clique Search
inferred← citeshttps://doi.org/10.22215/etd/2007-06323openalex-snapshot
On improving FPT K-VERTEX COVER with applications to some combinatorial problems
inferred← citeshttps://doi.org/10.2478/ausi-2018-0008openalex-snapshot
Estimating clique size by coloring the nodes of auxiliary graphs
inferred← citeshttps://doi.org/10.2478/ausi-2021-0006openalex-snapshot
Estimating the fractional chromatic number of a graph
inferred← citeshttps://doi.org/10.26552/com.c.2015.3.108-112openalex-snapshot
On the Optimal Pin Set Generation
inferred← citeshttps://doi.org/10.28924/apjm/8-1openalex-snapshot
Exact Cover with Color Codes and Intersection Graphs
inferred← citeshttps://doi.org/10.31449/inf.v43i2.2678openalex-snapshot
Benchmark Problems for Exhaustive Exact Maximum Clique Search Algorithms
inferred← citeshttps://doi.org/10.31449/inf.v45i2.3107openalex-snapshot
Estimating clique size via discarding subgraphs
inferred← citeshttps://doi.org/10.3390/math10050697openalex-snapshot
Clique Search in Graphs of Special Class and Job Shop Scheduling
inferred← citeshttps://doi.org/10.48550/arxiv.1801.08649openalex-snapshot
Finding Maximum Cliques on the D-Wave Quantum Annealer
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.