On the public citation graph
Can visibility graphs Be represented compactly?
0 signed · 65 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/jagm.1994.1038openalex-snapshot
Applications of Parametric Searching in Geometric Optimization
inferredcites →https://doi.org/10.1007/bf01182771openalex-snapshot
Algorithms for bichromatic line-segment problems and polyhedral terrains
inferredcites →https://doi.org/10.1007/bf02187747openalex-snapshot
Visibility and intersection problems in plane geometry
inferredcites →https://doi.org/10.1007/bf02579163openalex-snapshot
Covering of graphs by complete bipartite subgraphs; Complexity of 0–1 matrices
inferredcites →https://doi.org/10.1016/0016-0032(60)90676-1openalex-snapshot
An introduction to the theory of numbers
inferredcites →https://doi.org/10.1016/0020-0190(85)90044-4openalex-snapshot
Constructing the visibility graph for n-line segments in O(n2) time
inferredcites →https://doi.org/10.1016/0020-0190(90)90167-vopenalex-snapshot
Computing the longest diagonal of a simple polygon
inferredcites →https://doi.org/10.1017/s0025557200071461openalex-snapshot
An Introduction to the Theory of Numbers. By G. H. Hardy and E. M. Wright. 2nd edition. Pp. xvi, 407 25s. 1945. (Oxford)
inferredcites →https://doi.org/10.1090/s0002-9947-1938-1501951-4openalex-snapshot
A theorem in finite projective geometry and some applications to number theory
inferredcites →https://doi.org/10.1090/s0894-0347-1989-1001852-0openalex-snapshot
Lower Bounds on the Complexity of Polytope Range Searching
inferredcites →https://doi.org/10.1109/sfcs.1982.58openalex-snapshot
A theorem on polygon cutting with applications
inferredcites →https://doi.org/10.1112/jlms/s1-16.4.212openalex-snapshot
On a Problem of Sidon in Additive Number Theory, and on some Related Problems
inferredcites →https://doi.org/10.1137/0220055openalex-snapshot
An Output-Sensitive Algorithm for Computing Visibility Graphs
inferredcites →https://doi.org/10.1142/s0218195991000049openalex-snapshot
THE COMPLEXITY OF COMPUTING PARTIAL SUMS OFF-LINE
inferredcites →https://doi.org/10.1145/322276.322281openalex-snapshot
A Lower Bound on the Complexity of Orthogonal Range Queries
inferredcites →https://doi.org/10.1145/79147.79149openalex-snapshot
Lower bounds for orthogonal range searching: part II. The arithmetic model
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-030-05755-8_21openalex-snapshot
An Optimized MBE Algorithm on Sparse Bipartite Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-34029-2_28openalex-snapshot
Faster Biclique Mining in Near-Bipartite Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-59271-8_6openalex-snapshot
FCA in a Logical Programming Setting for Visualization-Oriented Graph Compression
inferred← citeshttps://doi.org/10.1007/978-3-319-62127-2_22openalex-snapshot
All-Pairs Shortest Paths in Geometric Intersection Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-48413-4_15openalex-snapshot
Probabilistic Construction of Small Strongly Sum-Free Sets via Large Sidon Sets
inferred← citeshttps://doi.org/10.1007/978-3-642-31594-7_22openalex-snapshot
Clique Cover and Graph Separation: New Incompressibility Results
inferred← citeshttps://doi.org/10.1007/bf02712876openalex-snapshot
Topologically sweeping visibility complexes via pseudotriangulations
inferred← citeshttps://doi.org/10.1007/pl00009500openalex-snapshot
Efficient Algorithms for Approximating Polygonal Chains
inferred← citeshttps://doi.org/10.1007/s00373-006-0669-9openalex-snapshot
Alternating Paths along Axis-Parallel Segments
inferred← citeshttps://doi.org/10.1007/s00454-002-2886-1openalex-snapshot
New Similarity Measures between Polylines with Applications to Morphing and Polygon Sweeping
inferred← citeshttps://doi.org/10.1007/s00454-003-2773-4openalex-snapshot
A General Notion of Visibility Graphs
inferred← citeshttps://doi.org/10.1007/s00454-024-00648-8openalex-snapshot
On the Number of Incidences When Avoiding an Induced Biclique in Geometric Settings
inferred← citeshttps://doi.org/10.1007/s00454-025-00792-9openalex-snapshot
Semi-Algebraic Off-line Range Searching and Biclique Partitions in the Plane
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50020-6openalex-snapshot
Visibility in the Plane
inferred← citeshttps://doi.org/10.1016/j.dam.2007.10.031openalex-snapshot
An algorithm for the difference between set covers
inferred← citeshttps://doi.org/10.1016/j.dam.2017.04.004openalex-snapshot
On computing the Galois lattice of bipartite distance hereditary graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2015.12.009openalex-snapshot
Extractors in Paley graphs: A random model
inferred← citeshttps://doi.org/10.1016/j.ic.2019.104464openalex-snapshot
Large-scale clique cover of real-world networks
inferred← citeshttps://doi.org/10.1016/j.ins.2020.05.078openalex-snapshot
Bi-objective optimization of biclustering with binary data
inferred← citeshttps://doi.org/10.1016/j.jda.2015.05.014openalex-snapshot
On the kernel size of clique cover reductions for random intersection graphs
inferred← citeshttps://doi.org/10.1016/s0020-0190(97)00048-3openalex-snapshot
Area requirement of visibility representations of trees
inferred← citeshttps://doi.org/10.1016/s0925-7721(02)00127-xopenalex-snapshot
On counting point-hyperplane incidences
inferred← citeshttps://doi.org/10.1016/s0925-7721(02)00172-4openalex-snapshot
Segment endpoint visibility graphs are Hamiltonian
inferred← citeshttps://doi.org/10.1017/s0963548316000304openalex-snapshot
On the Chromatic Number of Random Cayley Graphs
inferred← citeshttps://doi.org/10.1051/ro/2024229openalex-snapshot
Conceptual clique sampling frameworks to design solution algorithms for the Edge Clique Cover Problem
inferred← citeshttps://doi.org/10.1109/18.412676openalex-snapshot
Repeated communication and Ramsey graphs
inferred← citeshttps://doi.org/10.1109/bigdata.congress.2014.105openalex-snapshot
Enumerating Maximal Bicliques from a Large Graph Using MapReduce
inferred← citeshttps://doi.org/10.1109/tsc.2016.2523997openalex-snapshot
Enumerating Maximal Bicliques from a Large Graph Using MapReduce
inferred← citeshttps://doi.org/10.1137/1.9781611972863.9openalex-snapshot
Data Reduction, Exact, and Heuristic Algorithms for Clique Cover
inferred← citeshttps://doi.org/10.1137/1.9781611975673.37openalex-snapshot
Mining Maximal Induced Bicliques using Odd Cycle Transversals
inferred← citeshttps://doi.org/10.1137/130947076openalex-snapshot
Known Algorithms for Edge Clique Cover are Probably Optimal
inferred← citeshttps://doi.org/10.1137/18m1221606openalex-snapshot
Representation Complexities of SemiAlgebraic Graphs
inferred← citeshttps://doi.org/10.1137/s009753970343912xopenalex-snapshot
Dynamic Subgraph Connectivity with Geometric Applications
inferred← citeshttps://doi.org/10.1145/1218556.1218557openalex-snapshot
Segmenting object space by geometric reference structures
inferred← citeshttps://doi.org/10.1145/1341531.1341550openalex-snapshot
Connectivity structure of bipartite graphs via the KNC-plot
inferred← citeshttps://doi.org/10.1145/1412228.1412236openalex-snapshot
Data reduction and exact algorithms for clique cover
inferred← citeshttps://doi.org/10.1145/2133803.2275596openalex-snapshot
Assignment-minimum clique coverings
inferred← citeshttps://doi.org/10.1145/237218.237400openalex-snapshot
Approximating monotone polygonal curves using the uniform metric
inferred← citeshttps://doi.org/10.1145/2543581.2543589openalex-snapshot
Unsolved problems in visibility graphs of points, segments, and polygons
inferred← citeshttps://doi.org/10.1145/509907.509911openalex-snapshot
Dynamic subgraph connectivity with geometric applications
inferred← citeshttps://doi.org/10.1145/997817.997825openalex-snapshot
Computing the visibility graph of points within a polygon
inferred← citeshttps://doi.org/10.48550/arxiv.1012.5187openalex-snapshot
Unsolved Problems in Visibility Graphs of Points, Segments and Polygons
inferred← citeshttps://doi.org/10.48550/arxiv.1510.05998openalex-snapshot
Extractors in Paley graphs: a random model
inferred← citeshttps://doi.org/10.48550/arxiv.1909.04611openalex-snapshot
Approximating Vertex Cover using Structural Rounding
inferred← citeshttps://doi.org/10.48550/arxiv.2002.04711openalex-snapshot
Bi-objective Optimization of Biclustering with Binary Data
inferred← citeshttps://doi.org/10.70675/5360ed10zdefbz4796zba1bz3341b7546384openalex-snapshot
A search space of graph motifs for graph compression : from Powergraphs to triplet concepts
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.