On the public citation graph

Rubber bands, convex embeddings and graph connectivity

https://doi.org/10.1007/bf02122557
0 signed · 91 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bf01404753openalex-snapshot
Rigidity and energy
inferredcites →https://doi.org/10.1016/0020-0190(84)90018-8openalex-snapshot
On computing the determinant in small parallel time using a small number of processors
inferredcites →https://doi.org/10.1016/0095-8956(73)90031-2openalex-snapshot
Gammoids and transversal matroids
inferredcites →https://doi.org/10.1016/0304-3975(76)90086-4openalex-snapshot
Computing an st-numbering
inferredcites →https://doi.org/10.1016/c2009-0-09109-0openalex-snapshot
Combinatorial Problems and Exercises
inferredcites →https://doi.org/10.1093/qmath/17.1.303openalex-snapshot
SYMMETRIZED FORM OF P. HALL'S THEOREM ON DISTINCT REPRESENTATIVES
inferredcites →https://doi.org/10.1112/plms/s3-13.1.743openalex-snapshot
How to Draw a Graph
inferredcites →https://doi.org/10.1137/0209016openalex-snapshot
Finding the Vertex Connectivity of Graphs
inferredcites →https://doi.org/10.1137/0211038openalex-snapshot
On the Asymptotic Complexity of Matrix Multiplication
inferredcites →https://doi.org/10.1145/322217.322225openalex-snapshot
Fast Probabilistic Algorithms for Verification of Polynomial Identities
inferredcites →https://doi.org/10.2307/1907363openalex-snapshot
A Survey of Modern Algebra

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/9780470396360.ch8openalex-snapshot
Position‐Based Routing for Sensor Networks: Approaches and Obstacles
inferred← citeshttps://doi.org/10.1002/9780470396384.ch2openalex-snapshot
Establishing a Communication Infrastructure in Ad Hoc Networks
inferred← citeshttps://doi.org/10.1006/jagm.1999.1055openalex-snapshot
Computing Vertex Connectivity: New Bounds from Old Techniques
inferred← citeshttps://doi.org/10.1007/0-387-22444-0_6openalex-snapshot
Semidefinite Programs and Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/3-540-17179-7_24openalex-snapshot
Connectivity algorithms using rubber bands
inferred← citeshttps://doi.org/10.1007/3-540-46632-0_43openalex-snapshot
Bisecting Two Subsets in 3-Connected Graphs
inferred← citeshttps://doi.org/10.1007/978-1-84882-218-4_5openalex-snapshot
Geometric Routing in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1007/978-3-030-92931-2_8openalex-snapshot
From Tutte to Floater and Gotsman: On the Resolution of Planar Straight-Line Drawings and Morphs
inferred← citeshttps://doi.org/10.1007/978-3-030-95018-7_15openalex-snapshot
Bounds and Algorithms for Geodetic Hulls
inferred← citeshttps://doi.org/10.1007/978-3-540-24595-7_7openalex-snapshot
Stretching of Jordan Arc Contact Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-27820-7_3openalex-snapshot
On a Conjecture Related to Geometric Routing
inferred← citeshttps://doi.org/10.1007/978-3-540-85221-6openalex-snapshot
Building Bridges
inferred← citeshttps://doi.org/10.1007/978-3-540-85238-4_5openalex-snapshot
Algebraic Graph Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-11269-0_7openalex-snapshot
On Finding Directed Trees with Many Leaves
inferred← citeshttps://doi.org/10.1007/978-3-642-32278-5_8openalex-snapshot
Connectivity and Depth First Search
inferred← citeshttps://doi.org/10.1007/978-3-642-45043-3_31openalex-snapshot
Certifying 3-Edge-Connectivity
inferred← citeshttps://doi.org/10.1007/bf01097528openalex-snapshot
Representations of graphs and networks (coding, layouts and embeddings)
inferred← citeshttps://doi.org/10.1007/bf01200757openalex-snapshot
The geometry of graphs and some of its algorithmic applications
inferred← citeshttps://doi.org/10.1007/bf01302965openalex-snapshot
Directeds-t numberings, Rubber bands, and testing digraphk-vertex connectivity
inferred← citeshttps://doi.org/10.1007/bf02585470openalex-snapshot
Singular spaces of matrices and their application in combinatorics
inferred← citeshttps://doi.org/10.1007/bfb0093761openalex-snapshot
Realization Spaces of Polytopes
inferred← citeshttps://doi.org/10.1007/s00453-010-9481-2openalex-snapshot
An O(n+m) Certifying Triconnnectivity Algorithm for Hamiltonian Graphs
inferred← citeshttps://doi.org/10.1007/s00453-015-0075-xopenalex-snapshot
Certifying 3-Edge-Connectivity
inferred← citeshttps://doi.org/10.1007/s00453-019-00608-2openalex-snapshot
Computing Vertex-Disjoint Paths in Large Graphs Using MAOs
inferred← citeshttps://doi.org/10.1007/s00454-009-9235-6openalex-snapshot
Greedy Drawings of Triangulations
inferred← citeshttps://doi.org/10.1007/s00454-013-9530-0openalex-snapshot
Solution of the Propeller Conjecture in $$\mathbb R ^3$$ R 3
inferred← citeshttps://doi.org/10.1007/s10665-025-10496-xopenalex-snapshot
Equilibrium stresses in frameworks via symmetric averaging
inferred← citeshttps://doi.org/10.1007/s11856-023-2515-7openalex-snapshot
Connections between graphs and matrix spaces
inferred← citeshttps://doi.org/10.1016/0024-3795(89)90475-8openalex-snapshot
Orthogonal representations and connectivity of graphs
inferred← citeshttps://doi.org/10.1016/b978-044488002-4/50030-0openalex-snapshot
10.1016/b978-044488002-4/50030-0
inferred← citeshttps://doi.org/10.1016/j.cagd.2005.05.002openalex-snapshot
Discrete one-forms on meshes and applications to 3D mesh parameterization
inferred← citeshttps://doi.org/10.1016/j.cosrev.2010.09.009openalex-snapshot
Certifying algorithms
inferred← citeshttps://doi.org/10.1016/j.dam.2021.08.032openalex-snapshot
Finding densest k -connected subgraphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.06.022openalex-snapshot
On a conjecture related to geometric routing
inferred← citeshttps://doi.org/10.1016/s0921-8890(99)00004-4openalex-snapshot
Social potential fields: A distributed behavioral control for autonomous robots
inferred← citeshttps://doi.org/10.1016/s0925-7721(02)00174-8openalex-snapshot
Tutte's barycenter method applied to isotopies
inferred← citeshttps://doi.org/10.1098/rsta.2011.0215openalex-snapshot
Geometric algorithms for sensor networks
inferred← citeshttps://doi.org/10.1109/cdc.2004.1429543openalex-snapshot
On geographic routing without location information
inferred← citeshttps://doi.org/10.1109/focs54457.2022.00080openalex-snapshot
Deterministic Small Vertex Connectivity in Almost Linear Time
inferred← citeshttps://doi.org/10.1109/pdcat.2009.68openalex-snapshot
Greedy Convex Embeddings for Ad-Hoc Networks
inferred← citeshttps://doi.org/10.1109/pdcat.2009.86openalex-snapshot
Greedy Convex Embeddings for Sensor Networks
inferred← citeshttps://doi.org/10.1109/sfcs.1994.365733openalex-snapshot
The geometry of graphs and some of its algorithmic applications
inferred← citeshttps://doi.org/10.1109/sfcs.1996.548505openalex-snapshot
Computing vertex connectivity: new bounds from old techniques
inferred← citeshttps://doi.org/10.1137/060670158openalex-snapshot
Locating Servers for Reliability and Affine Embeddings
inferred← citeshttps://doi.org/10.1137/1.9781611974782.126openalex-snapshot
Doubly Balanced Connected Graph Partitioning
inferred← citeshttps://doi.org/10.1137/1.9781611975994.126openalex-snapshot
Computing and Testing Small Connectivity in Near-Linear Time and Queries via Fast Local Cut Algorithms
inferred← citeshttps://doi.org/10.1137/1.9781611977585.ch20openalex-snapshot
Tight Bounds for Vertex Connectivity in Dynamic Streams
inferred← citeshttps://doi.org/10.1137/s0097539793256223openalex-snapshot
Randomized $\tilde{O}(M(|V|))$ Algorithms for Problems in Matching Theory
inferred← citeshttps://doi.org/10.1137/s0895480198333290openalex-snapshot
Directional Routing via Generalized st -Numberings
inferred← citeshttps://doi.org/10.1145/103418.103460openalex-snapshot
Algorithms for parallel k -vertex connectivity and sparse certificates
inferred← citeshttps://doi.org/10.1145/174666.174667openalex-snapshot
On randomization in sequential and distributed algorithms
inferred← citeshttps://doi.org/10.1145/2213977.2214003openalex-snapshot
Solution of the propeller conjecture in R 3
inferred← citeshttps://doi.org/10.1145/3313276.3316394openalex-snapshot
Breaking quadratic time for small vertex connectivity and an approximation scheme
inferred← citeshttps://doi.org/10.1145/3381419openalex-snapshot
Doubly Balanced Connected Graph Partitioning
inferred← citeshttps://doi.org/10.1145/3406325.3451088openalex-snapshot
Vertex connectivity in poly-logarithmic max-flows
inferred← citeshttps://doi.org/10.1145/3564246.3585201openalex-snapshot
Finding a Small Vertex Cut on Distributed Networks
inferred← citeshttps://doi.org/10.1145/3564246.3585223openalex-snapshot
Tight Conditional Lower Bounds for Vertex Connectivity Problems
inferred← citeshttps://doi.org/10.1145/3564822openalex-snapshot
Engineering Nearly Linear-time Algorithms for Small Vertex Connectivity
inferred← citeshttps://doi.org/10.1145/3717823.3718123openalex-snapshot
Linear-Time Algorithms for k-Edge-Connected Components, k-Lean Tree Decompositions, and More
inferred← citeshttps://doi.org/10.1145/3717823.3718185openalex-snapshot
Breaking the 𝑂(𝑚𝑛)-Time Barrier for Vertex-Weighted Global Minimum Cut
inferred← citeshttps://doi.org/10.1145/3717823.3718304openalex-snapshot
Deterministic Vertex Connectivity via Common-Neighborhood Clustering and Pseudorandomness
inferred← citeshttps://doi.org/10.1145/3717823.3718316openalex-snapshot
Global vs. s-t Vertex Connectivity Beyond Sequential: Almost-Perfect Reductions and Near-Optimal Separations
inferred← citeshttps://doi.org/10.1145/3743670openalex-snapshot
Vertex Connectivity in Poly-logarithmic Max-Flows
inferred← citeshttps://doi.org/10.1145/938985.938996openalex-snapshot
Geographic routing without location information
inferred← citeshttps://doi.org/10.1214/23-aap2039openalex-snapshot
Maximum likelihood thresholds via graph rigidity
inferred← citeshttps://doi.org/10.1365/s13291-022-00251-xopenalex-snapshot
L. Lovász: “Graphs and Geometry”
inferred← citeshttps://doi.org/10.20381/ruor-19824openalex-snapshot
Simple geometric constructs for routing and boundary detection in sensor networks
inferred← citeshttps://doi.org/10.20382/jocg.v4i1a7openalex-snapshot
On affine rigidity
inferred← citeshttps://doi.org/10.4171/jfg/73openalex-snapshot
Non-degeneracy of the harmonic structure on Sierpiński gaskets
inferred← citeshttps://doi.org/10.4324/9780203362464-11openalex-snapshot
Three Dimensional Drawings
inferred← citeshttps://doi.org/10.4324/9780203362464_chapter_threeopenalex-snapshot
Three Dimensional Drawings
inferred← citeshttps://doi.org/10.48550/arxiv.1112.2993openalex-snapshot
Solution of the propeller conjecture in $\mathbb{R}^3$
inferred← citeshttps://doi.org/10.48550/arxiv.1703.01544openalex-snapshot
L-Graphs and Monotone L-Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1904.08382openalex-snapshot
A Faster Local Algorithm for Detecting Bounded-Size Cuts with Applications to Higher-Connectivity Problems
inferred← citeshttps://doi.org/10.48550/arxiv.1905.05329openalex-snapshot
Computing and Testing Small Vertex Connectivity in Near-Linear Time and Queries
inferred← citeshttps://doi.org/10.48550/arxiv.1910.07950openalex-snapshot
Deterministic Graph Cuts in Subquadratic Time: Sparse, Balanced, and k-Vertex
inferred← citeshttps://doi.org/10.5555/1283383.1283397openalex-snapshot
Faster dynamic matchings and vertex connectivity
inferred← citeshttps://doi.org/10.5555/1602165.1602178openalex-snapshot
Greedy routing with guaranteed delivery using Ricci flows
inferred← citeshttps://doi.org/10.5555/313559.313607openalex-snapshot
Random Weighted Laplacians, Lovász minimum digraphs and finding minimum separators
inferred← citeshttps://doi.org/10.70675/590b759bz2692z4c7az8269zc41deeabe325openalex-snapshot
Combinatorial Techniques for Parameterized Algorithms and Kernels, with Applications to Multicut.
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.