On the public citation graph
Embeddings of graphs in euclidean spaces
0 signed · 22 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-349-03521-2openalex-snapshot
Graph Theory with Applications
inferredcites →https://doi.org/10.1007/bf01163285openalex-snapshot
Proof of the van der Waerden conjecture regarding the permanent of a doubly stochastic matrix
inferredcites →https://doi.org/10.1016/0012-365x(84)90169-9openalex-snapshot
On the sphericity for the join of many graphs
inferredcites →https://doi.org/10.1016/0012-365x(89)90142-8openalex-snapshot
Geometrical embeddings of graphs
inferredcites →https://doi.org/10.1016/0095-8956(88)90043-3openalex-snapshot
The Johnson-Lindenstrauss lemma and the sphericity of some graphs
inferredcites →https://doi.org/10.1016/0166-218x(84)90113-6openalex-snapshot
Space graphs and sphericity
inferredcites →https://doi.org/10.1016/s0167-5060(08)70731-3openalex-snapshot
Aggregation of Inequalities in Integer Programming
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-642-18469-7_26openalex-snapshot
Dot Product Representations of Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-45030-3_13openalex-snapshot
Algorithms to Measure Diversity and Clustering in Social Networks through Dot Product Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-58043-7_12openalex-snapshot
Recent Developments in Combinatorial Geometry
inferred← citeshttps://doi.org/10.1007/bf01195002openalex-snapshot
The Colin de Verdi�re number and sphere representations of a graph
inferred← citeshttps://doi.org/10.1007/bf01204724openalex-snapshot
A combinatorial approach to complexity
inferred← citeshttps://doi.org/10.1007/bf01864152openalex-snapshot
Embedding of trees in euclidean spaces
inferred← citeshttps://doi.org/10.1007/s00454-012-9394-8openalex-snapshot
Sphere and Dot Product Representations of Graphs
inferred← citeshttps://doi.org/10.1007/s00493-019-4113-1openalex-snapshot
On Closest Pair in Euclidean Metric: Monochromatic is as Hard as Bichromatic
inferred← citeshttps://doi.org/10.1016/0095-8956(92)90002-fopenalex-snapshot
On embedding of graphs into euclidean spaces of small dimension
inferred← citeshttps://doi.org/10.1016/j.dam.2006.01.004openalex-snapshot
Sphericity, cubicity, and edge clique covers of graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2005.04.005openalex-snapshot
Monotone maps, sphericity and bounded second eigenvalue
inferred← citeshttps://doi.org/10.1016/j.socnet.2015.01.001openalex-snapshot
Algorithms for diversity and clustering in social networks through dot product graphs
inferred← citeshttps://doi.org/10.1145/1998196.1998249openalex-snapshot
Sphere and dot product representations of graphs
inferred← citeshttps://doi.org/10.37236/703openalex-snapshot
Dot Product Representations of Planar Graphs
inferred← citeshttps://doi.org/10.4230/lipics.itcs.2019.17openalex-snapshot
On Closest Pair in Euclidean Metric: Monochromatic is as Hard as Bichromatic
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.