On the public citation graph
A combinatorial approach for Keller's conjecture
0 signed · 48 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.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.1002/net.20088openalex-snapshot
A branch-and-price approach for the maximum weight independent set problem
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-4757-3023-4_1openalex-snapshot
The Maximum Clique Problem
inferred← citeshttps://doi.org/10.1007/978-3-030-51074-9_4openalex-snapshot
The Resolution of Keller’s Conjecture
inferred← citeshttps://doi.org/10.1007/978-3-540-24854-5_3openalex-snapshot
Finding Maximum Cliques with Distributed Ants
inferred← citeshttps://doi.org/10.1007/978-3-540-87477-5_18openalex-snapshot
On Importance of a Special Sorting in the Maximum-Weight Clique Algorithm Based on Colour Classes
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/bf01096415openalex-snapshot
Test case generators and computational results for the maximum clique problem
inferred← citeshttps://doi.org/10.1007/bf02574014openalex-snapshot
Cube-tilings of ℝn and nonlinear codesand nonlinear codes
inferred← citeshttps://doi.org/10.1007/s00454-002-2801-9openalex-snapshot
A Cube Tiling of Dimension Eight with No Facesharing
inferred← citeshttps://doi.org/10.1007/s00454-012-9438-0openalex-snapshot
The Structure of Cube Tilings Under Symmetry Conditions
inferred← citeshttps://doi.org/10.1007/s10817-022-09623-5openalex-snapshot
The Resolution of Keller’s Conjecture
inferred← citeshttps://doi.org/10.1016/j.ejc.2006.01.008openalex-snapshot
Cube packings, second moment and holes
inferred← citeshttps://doi.org/10.1016/j.ejc.2011.07.003openalex-snapshot
On the structure of cube tilings and unextendible systems of cubes in low dimensions
inferred← citeshttps://doi.org/10.1016/j.ejc.2012.01.006openalex-snapshot
Rigidity and the chessboard theorem for cube packings
inferred← citeshttps://doi.org/10.1016/j.ejc.2014.02.005openalex-snapshot
Partitions and balanced matchings of an n -dimensional cube
inferred← citeshttps://doi.org/10.1016/j.ejc.2020.103168openalex-snapshot
On the structure of cube tiling codes
inferred← citeshttps://doi.org/10.1016/j.jcta.2012.06.007openalex-snapshot
On the structure of cube tilings of R3 and R4
inferred← citeshttps://doi.org/10.1038/s42005-026-02606-7openalex-snapshot
A short review on the maximum clique problem algorithms with classical, AI, and quantum methods
inferred← citeshttps://doi.org/10.1090/s0273-0979-05-01050-5openalex-snapshot
What is known about unit cubes
inferred← citeshttps://doi.org/10.1090/s0273-0979-1992-00318-xopenalex-snapshot
Keller’s cube-tiling conjecture is false in high dimensions
inferred← citeshttps://doi.org/10.1109/icec.1998.700116openalex-snapshot
A hard problem for genetic algorithms: finding cliques in Keller graphs
inferred← citeshttps://doi.org/10.1109/tcbb.2014.2325014openalex-snapshot
Network-Based Methods to Identify Highly Discriminating Subsets of Biomarkers
inferred← citeshttps://doi.org/10.1134/s0081543815010186openalex-snapshot
New results on torus cube packings and tilings
inferred← citeshttps://doi.org/10.1134/s0371968515010185openalex-snapshot
New Results on Torus Cube Packings and Tilings
inferred← citeshttps://doi.org/10.1137/1.9781611973082.11openalex-snapshot
A complete resolution of the Keller maximum clique problem
inferred← citeshttps://doi.org/10.1137/s1052623400381413openalex-snapshot
A Complementary Pivoting Approach to the Maximum Weight Clique Problem
inferred← citeshttps://doi.org/10.1145/3573105.3575669openalex-snapshot
A Formalized Reduction of Keller’s Conjecture
inferred← citeshttps://doi.org/10.1515/advgeom-2017-0004openalex-snapshot
Rigid polyboxes and keller's conjecture
inferred← citeshttps://doi.org/10.1515/advgeom-2022-0001openalex-snapshot
Towards resolving Keller’s cube tiling conjecture in dimension seven
inferred← citeshttps://doi.org/10.21711/231766362015/rmc4417openalex-snapshot
An Experimental Analysis of Exact Algorithms for the Maximum Clique Problem
inferred← citeshttps://doi.org/10.2989/16073606.2018.1462865openalex-snapshot
Extended Keller graph and its properties
inferred← citeshttps://doi.org/10.3233/mgs-200323openalex-snapshot
A multiagent reinforcement learning algorithm to solve the maximum independent set problem
inferred← citeshttps://doi.org/10.3390/math10050697openalex-snapshot
Clique Search in Graphs of Special Class and Job Shop Scheduling
inferred← citeshttps://doi.org/10.3390/sym14081574openalex-snapshot
Graph Coloring via Clique Search with Symmetry Breaking
inferred← citeshttps://doi.org/10.37236/2251openalex-snapshot
The Coin Exchange Problem and the Structure of Cube Tilings
inferred← citeshttps://doi.org/10.47749/t/unicamp.2015.959438openalex-snapshot
Códigos perfeitos nas métricas de Lee e Chebyshev e iterações de funções de Rédei
inferred← citeshttps://doi.org/10.48550/arxiv.1512.05908openalex-snapshot
On Cube Tilings of Tori and Classification of Perfect Codes in the Maximum Metric
inferred← citeshttps://doi.org/10.48550/arxiv.1804.07499openalex-snapshot
A general inequality for packings of boxes
inferred← citeshttps://doi.org/10.48550/arxiv.math/0104093openalex-snapshot
Spectral and Tiling properties of the Unit Cube
inferred← citeshttps://doi.org/10.48550/arxiv.math/9210222openalex-snapshot
Keller's cube-tiling conjecture is false in high dimensions
inferred← citeshttps://doi.org/10.59849/2218-6816.2023.2.110openalex-snapshot
Generalized Keller graph
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.