
Robert Connelly
· ProfessorCornell University · Mathematics
Active 1970–2025
Academic metrics are sourced from OpenAlex and public funding records; values may differ from Google Scholar.
Research topics
- Mathematical analysis
- Algorithm
- Mathematics
- Combinatorics
Selected publications
Generically globally rigid graphs have generic universally rigid\n frameworks
COMBINATORICA · 2016 · 11 citations
1st authorCorrespondingWe show that any graph that is generically globally rigid in $\\mathbb{R}^d$\nhas a realization in $\\mathbb{R}^d$ that is both generic and universally rigid.\nThis also implies that the graph also must have a realization in $\\mathbb{R}^d$\nthat is both infinitesimally rigid and universally rigid; such a realization\nserves as a certificate of generic global rigidity.\n Our approach involves an algorithm by Lov\\'asz, Saks and Schrijver that, for\na sufficiently connected graph, constructs a ge…
Reconstruction in One Dimension from Unlabeled Euclidean Lengths
COMBINATORICA · 2024-07-11 · 2 citations
articleOpen access1st authorCorrespondingAbstract Let G be a 3-connected ordered graph with n vertices and m edges. Let $$\textbf{p}$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mi>p</mml:mi> </mml:math> be a randomly chosen mapping of these n vertices to the integer range $$\{1, 2,3, \ldots , 2^b\}$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mo>{</mml:mo> <mml:mn>1</mml:mn> <mml:mo>,</mml:mo> <mml:mn>2</mml:mn> <mml:mo>,</mml:mo> <mml:mn>3</mml:mn> <mml:mo>,</mml:mo> <mml:mo>…</mml:m…
Rigidity of Circle Packings with Flexible Radii
arXiv (Cornell University) · 2022-06-14 · 1 citations
preprintOpen access1st authorCorrespondingCircle packings are arrangement of circles satisfying specified tangency requirements. Many problems about packing of circles and spheres occur in nature particularly in material design and protein structure. Surprisingly, little is known about the stability and rigidity of circle packings. In this paper, we study the rigidity of circle packings representing a given planar graph. The radii of circles are flexible with equality and inequality constraints. We provide a dual condition for the packi…
Spiderwebs on the Sphere and an Isoperimetric Theorem
ArXiv.org · 2025-05-28
preprintOpen access1st authorCorrespondingHere we present a rigidity result in a global (semi-global, homotopy) setting for a restrictive class of polytopes, those that can be inscribed in a unit sphere, with some additional conditions. The proof of the rigidity result for cabled frameworks on the surface of the sphere uses classical isoperimetric ideas.
Cambridge University Press eBooks · 2025-05-03
book-chapter1st authorCorresponding
Recent grants
Computational Ridgidity and Motion Planning
NSF · $198k · 2002–2007
Theoretical and Applied Discrete Geometry
NSF · $280k · 2005–2009
NSF · $312k · 2008–2012
Frequent coauthors
- 34 shared
Steven J. Gortler
Harvard University Press
- 26 shared
Arcangela S. Wood
Cleveland Clinic
- 26 shared
Neil G. Harris
University of California, Los Angeles
- 26 shared
David Skarupa
- 26 shared
Mark G. Luciano
Johns Hopkins Medicine
- 26 shared
Michelle Secic
Statistical Research (United States)
- 26 shared
Hazel C. Jones
- 25 shared
Martha J. Johnson
Similar researchers at Cornell University
- Resume-aware match score
- Save to shortlist
- AI-drafted outreach
See your match with Robert Connelly
PhdFit ranks faculty by your research interests, methods, and publications — grounded in their actual work, not templates.
- Free to start
- No credit card
- 30-second signup
