On the public citation graph
Sphere and dot product representations of graphs
0 signed · 39 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.1006/jctb.1994.1071openalex-snapshot
Intersection Graphs of Segments
inferredcites →https://doi.org/10.1007/978-3-322-80303-0openalex-snapshot
Geometric Graphs and Arrangements: Some Chapters from Combinatorial Geometry
inferredcites →https://doi.org/10.1007/978-3-642-11805-0_32openalex-snapshot
Complexity of Some Geometric and Topological Problems
inferredcites →https://doi.org/10.1007/978-3-642-16926-7_29openalex-snapshot
The Number of Bits Needed to Represent a Unit Disk Graph
inferredcites →https://doi.org/10.1007/978-3-662-05355-3openalex-snapshot
Algorithms in Real Algebraic Geometry
inferredcites →https://doi.org/10.1007/bf02104991openalex-snapshot
Realizability of combinatorial types of convex polyhedra over fields
inferredcites →https://doi.org/10.1007/bf02187736openalex-snapshot
Embeddings of graphs in euclidean spaces
inferredcites →https://doi.org/10.1007/bfb0082792openalex-snapshot
The universality theorems on the classification problem of configuration varieties and convex polytopes varieties
inferredcites →https://doi.org/10.1016/0012-365x(89)90142-8openalex-snapshot
Geometrical embeddings of graphs
inferredcites →https://doi.org/10.1016/0095-8956(92)90002-fopenalex-snapshot
On embedding of graphs into euclidean spaces of small dimension
inferredcites →https://doi.org/10.1016/0166-218x(84)90113-6openalex-snapshot
Space graphs and sphericity
inferredcites →https://doi.org/10.1016/0898-1221(93)90308-iopenalex-snapshot
Optimal greedy algorithms for indifference graphs
inferredcites →https://doi.org/10.1016/s0012-365x(97)00049-6openalex-snapshot
Dot product representations of graphs
inferredcites →https://doi.org/10.1016/s0167-5060(06)x8001-9openalex-snapshot
Threshold Graphs and Related Topics
inferredcites →https://doi.org/10.1016/s0167-5060(13)71062-8openalex-snapshot
Annals of Discrete Mathematics 56
inferredcites →https://doi.org/10.1016/s0747-7171(88)80005-1openalex-snapshot
Solving systems of polynomial inequalities in subexponential time
inferredcites →https://doi.org/10.1016/s0925-7721(97)00014-xopenalex-snapshot
Unit disk graph recognition is NP-hard
inferredcites →https://doi.org/10.1057/jors.1987.94openalex-snapshot
Theory of Linear and Integer Programming
inferredcites →https://doi.org/10.1090/dimacs/004/41openalex-snapshot
Stretchability of pseudolines is NP-hard
inferredcites →https://doi.org/10.1145/235809.235813openalex-snapshot
On the combinatorial and algebraic complexity of quantifier elimination
inferredcites →https://doi.org/10.2307/253980openalex-snapshot
Theory of Linear and 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.1016/j.dam.2013.01.020openalex-snapshot
On the number of realizations of certain Henneberg graphs arising in protein conformation
inferred← citeshttps://doi.org/10.1093/comjnl/bxu157openalex-snapshot
Dynamic Task Allocation for Heterogeneous Agents in Disaster Environments Under Time, Space and Communication Constraints
inferred← citeshttps://doi.org/10.1109/focs46700.2020.00098openalex-snapshot
Framework for ER-Completeness of Two-Dimensional Packing Problems
inferred← citeshttps://doi.org/10.1109/focs46700.2020.00099openalex-snapshot
Smoothing the gap between NP and ER
inferred← citeshttps://doi.org/10.1109/focs52979.2021.00081openalex-snapshot
On Classifying Continuous Constraint Satisfaction problems
inferred← citeshttps://doi.org/10.1137/20m1385287openalex-snapshot
Smoothing the Gap Between NP and ER
inferred← citeshttps://doi.org/10.1214/24-ejs2331openalex-snapshot
A note on estimating the dimension from a random geometric graph
inferred← citeshttps://doi.org/10.1609/aaai.v31i1.10616openalex-snapshot
Recognising Multidimensional Euclidean Preferences
inferred← citeshttps://doi.org/10.1609/aaai.v37i7.26055openalex-snapshot
On the Expressive Flexibility of Self-Attention Matrices
inferred← citeshttps://doi.org/10.46298/dmtcs.9225openalex-snapshot
A Practical Algorithm with Performance Guarantees for the Art Gallery Problem
inferred← citeshttps://doi.org/10.46298/theoretics.24.10openalex-snapshot
On Classifying Continuous Constraint Satisfaction Problems
inferred← citeshttps://doi.org/10.46298/theoretics.24.11openalex-snapshot
Framework for $\exists \mathbb{R}$-Completeness of Two-Dimensional Packing Problems
inferred← citeshttps://doi.org/10.48550/arxiv.1811.01177openalex-snapshot
Smoothed Analysis of the Art Gallery Problem
inferred← citeshttps://doi.org/10.48550/arxiv.1907.04645openalex-snapshot
Smoothed Analysis of Order Types
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.