On the public citation graph
Counting facets and incidences
0 signed · 46 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-3-642-61568-9openalex-snapshot
Algorithms in Combinatorial Geometry
inferredcites →https://doi.org/10.1007/bf02123007openalex-snapshot
Triangles in space or building (and analyzing) castles in the air
inferredcites →https://doi.org/10.1007/bf02187732openalex-snapshot
The upper envelope of piecewise linear functions and the boundary of a region enclosed by convex plates: Combinatorial analysis
inferredcites →https://doi.org/10.1007/bf02187783openalex-snapshot
Combinatorial complexity bounds for arrangements of curves and spheres
inferredcites →https://doi.org/10.1007/bf02187785openalex-snapshot
The complexity of many cells in arrangements of planes and related problems
inferredcites →https://doi.org/10.1007/bf02579184openalex-snapshot
On the lattice property of the plane and some problems of Dirac, Motzkin and Erdős in combinatorial geometry
inferredcites →https://doi.org/10.1007/bf02579194openalex-snapshot
Extremal problems in discrete geometry
inferredcites →https://doi.org/10.1016/0012-365x(86)90008-7openalex-snapshot
The complexity of cells in three-dimensional arrangements
inferredcites →https://doi.org/10.1016/0097-3165(86)90078-6openalex-snapshot
On the maximal number of edges of many faces in an arrangement
inferredcites →https://doi.org/10.1109/sfcs.1988.21973openalex-snapshot
Combinatorial complexity bounds for arrangements of curves and surfaces
inferredcites →https://doi.org/10.1145/109648.109682openalex-snapshot
On the sum of squares of cell complexities in hyperplane arrangements
inferredcites →https://doi.org/10.2307/2325168openalex-snapshot
Algorithms in Combinatorial Geometry.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/0-387-29929-7_8openalex-snapshot
Incidence and Arrangement Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-58043-7_2openalex-snapshot
Combinatorics and Algorithms of Arrangements
inferred← citeshttps://doi.org/10.1007/bf01258293openalex-snapshot
Robot motion planning and the single cell problem in arrangements
inferred← citeshttps://doi.org/10.1007/bf02573992openalex-snapshot
On the complexity of a single cell in certain arrangements of surfaces related to motion planning
inferred← citeshttps://doi.org/10.1007/bf02712877openalex-snapshot
A new technique for analyzing substructures in arrangements of piecewise linear surfaces
inferred← citeshttps://doi.org/10.1007/s00454-003-0854-zopenalex-snapshot
Cell Complexities in Hyperplane Arrangements
inferred← citeshttps://doi.org/10.1007/s00454-006-1232-4openalex-snapshot
Distinct Distances in Homogeneous Sets in Euclidean Space
inferred← citeshttps://doi.org/10.1007/s00454-006-1279-2openalex-snapshot
Incidence Theorems for Pseudoflats
inferred← citeshttps://doi.org/10.1007/s00454-011-9367-3openalex-snapshot
A Bichromatic Incidence Bound and an Application
inferred← citeshttps://doi.org/10.1007/s00454-021-00366-5openalex-snapshot
Nondegenerate Spheres in Four Dimensions
inferred← citeshttps://doi.org/10.1016/0020-0190(94)00098-0openalex-snapshot
Many-face complexity in incremental convex arrangements
inferred← citeshttps://doi.org/10.1016/0097-3165(94)90027-2openalex-snapshot
On the sum of squares of cell complexities in hyperplane arrangements
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50003-6openalex-snapshot
Arrangements and Their Applications**Work by PA. was supported by Army Research Office MURI grant DAAH04-96-1-0013, by a Sloan fellowship, by an NYI award, and by a grant from the U.S.–Israeli Binational Science Foundation. Work by M.S. was supported by NSF Grants CCR-91-22103 and CCR-93-11127, by…
inferred← citeshttps://doi.org/10.1016/j.comgeo.2020.101681openalex-snapshot
Two theorems on point-flat incidences
inferred← citeshttps://doi.org/10.1017/s0963548308009127openalex-snapshot
On a Question of Bourgain about Geometric Incidences
inferred← citeshttps://doi.org/10.1137/0221001openalex-snapshot
Efficient Motion Planning for an L -Shaped Object
inferred← citeshttps://doi.org/10.1137/050641375openalex-snapshot
Large Complete Bipartite Subgraphs In Incidence Graphs Of Points And Hyperplanes
inferred← citeshttps://doi.org/10.1137/24m1640732openalex-snapshot
Covering Points by Hyperplanes and Related Problems
inferred← citeshttps://doi.org/10.1145/1064092.1064098openalex-snapshot
Incidences of not-too-degenerate hyperplanes
inferred← citeshttps://doi.org/10.1145/109648.109682openalex-snapshot
On the sum of squares of cell complexities in hyperplane arrangements
inferred← citeshttps://doi.org/10.1145/109648.109683openalex-snapshot
On the complexity of a single cell in certain arrangements of surfaces in 3-space (extended abstract)
inferred← citeshttps://doi.org/10.1145/220279.220301openalex-snapshot
A new technique for analyzing substructures in arrangements
inferred← citeshttps://doi.org/10.17846/amn.2015.1.1.24-43openalex-snapshot
Some Famous Problems of Discrete Geometry
inferred← citeshttps://doi.org/10.4230/lipics.socg.2016.60openalex-snapshot
Applications of Incidence Bounds in Point Covering Problems
inferred← citeshttps://doi.org/10.48550/arxiv.1810.01043openalex-snapshot
Nondegenerate spheres in four dimensions
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.