On the public citation graph
A story of diameter, radius, and (almost) Helly property
0 signed · 81 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.1002/jgt.10120openalex-snapshot
On constructible graphs, locally Helly graphs, and convexity
inferredcites →https://doi.org/10.1002/net.10098openalex-snapshot
On the power of BFS to determine a graph's diameter
inferredcites →https://doi.org/10.1007/3-540-62559-3_15openalex-snapshot
LexBFS-orderings and powers of graphs
inferredcites →https://doi.org/10.1007/978-1-4613-8369-7_1openalex-snapshot
An Introduction to Chordal Graphs and Clique Trees
inferredcites →https://doi.org/10.1007/978-3-030-36412-0_13openalex-snapshot
Fast Diameter Computation Within Split Graphs
inferredcites →https://doi.org/10.1007/978-3-540-74208-1_5openalex-snapshot
Packing and Covering δ-Hyperbolic Spaces by Balls
inferredcites →https://doi.org/10.1007/978-3-642-11440-3_21openalex-snapshot
The Covert Set-Cover Problem with Application to Network Discovery
inferredcites →https://doi.org/10.1007/bf01122734openalex-snapshot
Domination in quadrangle-free helly graphs
inferredcites →https://doi.org/10.1007/bf02566944openalex-snapshot
Six theorems about injective metric spaces
inferredcites →https://doi.org/10.1007/bfb0049406openalex-snapshot
A linear-time algorithm for finding a central vertex of a chordal graph
inferredcites →https://doi.org/10.1007/s004530010020openalex-snapshot
Diameter and Treewidth in Minor-Closed Graph Families
inferredcites →https://doi.org/10.1007/s00454-003-2859-zopenalex-snapshot
Bounded VC-Dimension Implies a Fractional Helly Theorem
inferredcites →https://doi.org/10.1007/s00454-006-1260-0openalex-snapshot
Covering Planar Graphs with a Fixed Number of Balls
inferredcites →https://doi.org/10.1007/s00454-014-9594-5openalex-snapshot
Covering Nearly Surface-Embedded Graphs with a Fixed Number of Balls
inferredcites →https://doi.org/10.1016/0001-8708(84)90029-xopenalex-snapshot
Trees, tight extensions of metric spaces, and the cohomological dimension of certain groups: A note on combinatorial properties of metric spaces
inferredcites →https://doi.org/10.1016/0012-365x(74)90002-8openalex-snapshot
A characterisation of rigid circuit graphs
inferredcites →https://doi.org/10.1016/0012-365x(95)00277-4openalex-snapshot
r-Dominating cliques in graphs with hypertree structure
inferredcites →https://doi.org/10.1016/0095-8956(74)90094-xopenalex-snapshot
The intersection graphs of subtrees in trees are exactly the chordal graphs
inferredcites →https://doi.org/10.1016/0095-8956(91)90004-4openalex-snapshot
Clique graphs and Helly graphs
inferredcites →https://doi.org/10.1016/0097-3165(72)90019-2openalex-snapshot
On the density of families of sets
inferredcites →https://doi.org/10.1016/0166-218x(80)90039-6openalex-snapshot
Computation of the center and diameter of outerplanar graphs
inferredcites →https://doi.org/10.1016/j.comgeo.2009.02.001openalex-snapshot
Algorithms for graphs of bounded treewidth via orthogonal range searching
inferredcites →https://doi.org/10.1016/j.disc.2015.05.026openalex-snapshot
VC-dimension and Erdős–Pósa property
inferredcites →https://doi.org/10.1016/j.entcs.2016.03.005openalex-snapshot
Into the Square: On the Complexity of Some Quadratic-time Solvable Problems
inferredcites →https://doi.org/10.1016/j.ipl.2007.02.017openalex-snapshot
Faster recognition of clique-Helly and hereditary clique-Helly graphs
inferredcites →https://doi.org/10.1016/j.ipl.2019.105873openalex-snapshot
An eccentricity 2-approximating spanning tree of a chordal graph is computable in linear time
inferredcites →https://doi.org/10.1016/j.tcs.2005.09.023openalex-snapshot
A new algorithm for optimal 2-constraint satisfaction and its implications
inferredcites →https://doi.org/10.1016/j.tcs.2016.07.037openalex-snapshot
A unified approach to recognize squares of split graphs
inferredcites →https://doi.org/10.1016/s0012-365x(00)00127-8openalex-snapshot
On constructible graphs, infinite bridged graphs and weakly cop-win graphs
inferredcites →https://doi.org/10.1016/s0012-365x(00)00210-7openalex-snapshot
Convexity and fixed-point properties in Helly graphs
inferredcites →https://doi.org/10.1016/s0166-218x(00)00281-xopenalex-snapshot
Diameter determination on restricted graph families
inferredcites →https://doi.org/10.1016/s0166-218x(02)00419-5openalex-snapshot
Finding a central vertex in an HHD-free graph
inferredcites →https://doi.org/10.1016/s0166-218x(97)00125-xopenalex-snapshot
The algorithmic use of hypertree structure and maximum neighbourhood orderings
inferredcites →https://doi.org/10.1016/s0166-218x(99)00157-2openalex-snapshot
LexBFS-orderings of distance-hereditary graphs with application to the diametral pair problem
inferredcites →https://doi.org/10.1016/s0167-5060(04)x8001-8openalex-snapshot
Algorithmic Graph Theory and Perfect Graphs
inferredcites →https://doi.org/10.1016/s0195-6698(89)80053-8openalex-snapshot
DismantlinG Absolute Retracts of Reflexive Graphs
inferredcites →https://doi.org/10.1016/s0304-3975(97)00241-7openalex-snapshot
Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing
inferredcites →https://doi.org/10.1080/00207169008803870openalex-snapshot
A simple linear-time algorithm for computing the center of an interval graph
inferredcites →https://doi.org/10.1090/conm/453/08795openalex-snapshot
Metric graph theory and geometry: a survey
inferredcites →https://doi.org/10.1137/0205021openalex-snapshot
Algorithmic Aspects of Vertex Elimination on Graphs
inferredcites →https://doi.org/10.1137/0213035openalex-snapshot
Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
inferredcites →https://doi.org/10.1137/1.9781611974331.ch28openalex-snapshot
Approximation and Fixed Parameter Subquadratic Algorithms for Radius and Diameter in Sparse Graphs
inferredcites →https://doi.org/10.1137/1.9781611975031.33openalex-snapshot
Voronoi Diagrams on Planar Graphs, and Computing the Diameter in Deterministic Õ ( n 5/3 ) Time
inferredcites →https://doi.org/10.1137/1.9781611975994.117openalex-snapshot
Diameter computation on H -minor free graphs and graphs of bounded (distance) VC-dimension
inferredcites →https://doi.org/10.1137/14097879xopenalex-snapshot
Identifying Codes in Hereditary Classes of Graphs and VC-Dimension
inferredcites →https://doi.org/10.1137/s0895480103431046openalex-snapshot
Sparse Distance Preservers and Additive Spanners
inferredcites →https://doi.org/10.1145/1377676.1377687openalex-snapshot
Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs
inferredcites →https://doi.org/10.1145/2488608.2488673openalex-snapshot
Fast approximation algorithms for the diameter and radius of sparse graphs
inferredcites →https://doi.org/10.1145/3218821openalex-snapshot
Subquadratic Algorithms for the Diameter and the Sum of Pairwise Distances in Planar Graphs
inferredcites →https://doi.org/10.1145/3310228openalex-snapshot
Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs
inferredcites →https://doi.org/10.1201/b19163openalex-snapshot
Handbook of Graph Theory, Combinatorial Optimization, and Algorithms
inferredcites →https://doi.org/10.1287/trsc.5.2.212openalex-snapshot
Optimal Center Location in Simple Networks
inferredcites →https://doi.org/10.2140/pjm.1972.41.247openalex-snapshot
A combinatorial problem; stability and order for models and theories in infinitary languages
inferredcites →https://doi.org/10.37236/38openalex-snapshot
Complexity Aspects of the Helly Property: Graphs and Hypergraphs
inferredcites →https://doi.org/10.4230/oasics.sosa.2019.12openalex-snapshot
A New Application of Orthogonal Range Searching for Computing Giant Graph Diameters
inferredcites →https://doi.org/10.5555/2884435.2884463openalex-snapshot
Approximation and fixed parameter subquadratic algorithms for radius and diameter in sparse graphs
inferredcites →https://doi.org/10.5555/3039686.3039825openalex-snapshot
Subquadratic algorithms for the diameter and the sum of pairwise distances in planar graphs
inferredcites →https://doi.org/10.5555/545381.545427openalex-snapshot
Center and diameter problems in plane triangulations and quadrangulations
inferredcites →https://doi.org/10.7155/jgaa.00496openalex-snapshot
Fast approximation of eccentricities and distances in hyperbolic graphs
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-82199-9_49openalex-snapshot
Detecting CAN Bus Intrusion by Applying Machine Learning Method to Graph Based Features
inferred← citeshttps://doi.org/10.1007/978-3-030-83508-8_22openalex-snapshot
Fast Deterministic Algorithms for Computing All Eccentricities in (Hyperbolic) Helly Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-86838-3_25openalex-snapshot
Beyond Helly Graphs: The Diameter Problem on Absolute Retracts
inferred← citeshttps://doi.org/10.1007/978-3-031-43380-1_20openalex-snapshot
$$\alpha _i$$-Metric Graphs: Radius, Diameter and all Eccentricities
inferred← citeshttps://doi.org/10.1007/978-3-031-75409-8_31openalex-snapshot
The Complexity of Diameter on H-free Graphs
inferred← citeshttps://doi.org/10.1007/s00373-022-02512-zopenalex-snapshot
Injective Hulls of Various Graph Classes
inferred← citeshttps://doi.org/10.1007/s00453-024-01223-6openalex-snapshot
$$\alpha _i$$-Metric Graphs: Radius, Diameter and all Eccentricities
inferred← citeshttps://doi.org/10.1007/s00453-024-01246-zopenalex-snapshot
Parameterized Complexity of Streaming Diameter and Connectivity Problems
inferred← citeshttps://doi.org/10.1007/s00453-025-01344-6openalex-snapshot
Certificates in P and Subquadratic-Time Computation of Radius, Diameter, and all Eccentricities in Graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2021.112326openalex-snapshot
A faster diameter problem algorithm for a chordal graph, with a connection to its center problem
inferred← citeshttps://doi.org/10.1016/j.jcss.2024.103606openalex-snapshot
Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.07.017openalex-snapshot
Eccentricity queries and beyond using hub labels
inferred← citeshttps://doi.org/10.1016/j.tcs.2023.113690openalex-snapshot
Distance problems within Helly graphs and k-Helly graphs
inferred← citeshttps://doi.org/10.1109/tcsi.2024.3383450openalex-snapshot
Quantification of Cascading Failure Propagation in Power Systems
inferred← citeshttps://doi.org/10.1137/24m1677885openalex-snapshot
The Complexity of Diameter on \({H}\)-Free Graphs
inferred← citeshttps://doi.org/10.1142/s0218488525500126openalex-snapshot
Fuzzy Median Graph and its Application in the Deployment of Wireless Sensor Networks
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.