| Publication | Date of Publication | Type |
|---|
Reconstruction in one dimension from unlabeled euclidean lengths
Combinatorica | 2025-01-14 | Paper |
Maximum likelihood thresholds via graph rigidity
The Annals of Applied Probability | 2024-08-22 | Paper |
Computing maximum likelihood thresholds using graph rigidity
Algebraic Statistics | 2024-07-25 | Paper |
Trilateration using unlabeled path or loop lengths
Discrete \& Computational Geometry | 2024-02-09 | Paper |
Proving the Existence of a GOR Without Probability
| 2023-10-17 | Paper |
General position stresses
| 2023-05-21 | Paper |
Maximum likelihood thresholds of generic linear concentration models
| 2023-05-10 | Paper |
Frameworks with Coordinated Edge Motions
SIAM Journal on Discrete Mathematics | 2022-11-15 | Paper |
Computing maximum likelihood thresholds using graph rigidity
| 2022-10-20 | Paper |
Transverse rigidity is prestress stability
Discrete Applied Mathematics | 2022-10-13 | Paper |
Universal Rigidity of Ladders on the line
| 2022-07-18 | Paper |
Rigidity for sticky discs
Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences | 2021-10-29 | Paper |
<scp>Almost‐Rigidity</scp> of Frameworks
Communications on Pure and Applied Mathematics | 2021-10-01 | Paper |
Maximum likelihood thresholds via graph rigidity
| 2021-08-04 | Paper |
Global rigidity of complete bipartite graphs
| 2021-05-04 | Paper |
Universal rigidity on the line, point order
| 2021-04-05 | Paper |
Linear Symmetries of the Unsquared Measurement Variety
| 2020-07-24 | Paper |
Reconstruction in one dimension from unlabeled Euclidean lengths
| 2020-07-13 | Paper |
Generically globally rigid graphs have generic universally rigid frameworks
Combinatorica | 2020-05-22 | Paper |
Algebraic matroids in action
The American Mathematical Monthly | 2020-02-25 | Paper |
Almost-rigidity of frameworks
| 2019-08-10 | Paper |
Generic unlabeled global rigidity
Forum of Mathematics, Sigma | 2019-08-01 | Paper |
Affine rigidity and conics at infinity
IMRN. International Mathematics Research Notices | 2019-02-06 | Paper |
Algorithms for detecting dependencies and rigid subsystems for CAD
Computer Aided Geometric Design | 2018-12-18 | Paper |
Delaunay triangulations with disconnected realization spaces
Proceedings of the thirtieth annual symposium on Computational geometry | 2018-04-23 | Paper |
The rigidity transition in random graphs
| 2017-09-29 | Paper |
Determining Generic Point Configurations From Unlabeled Path or Loop Lengths
| 2017-09-12 | Paper |
The algebraic combinatorial approach for low-rank matrix completion
| 2016-02-19 | Paper |
Frameworks with forced symmetry. I: Reflections and rotations
Discrete \& Computational Geometry | 2015-12-02 | Paper |
Universality theorems for inscribed polytopes and Delaunay triangulations
Discrete \& Computational Geometry | 2015-12-02 | Paper |
Anchored boundary conditions for locally isostatic networks
| 2015-08-04 | Paper |
Generic rigidity with forced symmetry and sparse colored graphs
Rigidity and Symmetry | 2015-07-08 | Paper |
Learning with Cross-Kernels and Ideal PCA
| 2014-06-10 | Paper |
Frameworks with forced symmetry. II: Orientation-preserving crystallographic groups
Geometriae Dedicata | 2014-05-30 | Paper |
Ultrarigid periodic frameworks
| 2014-04-08 | Paper |
Topological designs
Geometriae Dedicata | 2014-03-14 | Paper |
Dual-to-kernel learning with ideals
| 2014-02-01 | Paper |
Algebraic matroids with graph symmetry
| 2013-12-13 | Paper |
Obtaining error-minimizing estimates and universal entry-wise error bounds for low-rank matrix completion
| 2013-02-21 | Paper |
Coherence and sufficient sampling densities for reconstruction in compressed sensing
| 2013-02-12 | Paper |
Generic combinatorial rigidity of periodic frameworks
Advances in Mathematics | 2013-01-16 | Paper |
Henneberg constructions and covers of cone-Laman graphs
| 2012-04-02 | Paper |
Generic rigidity of reflection frameworks
| 2012-03-10 | Paper |
Natural realizations of sparsity matroids
Ars Mathematica Contemporanea | 2012-03-07 | Paper |
Searching in dynamic tree-like partial orders
Lecture Notes in Computer Science | 2011-08-12 | Paper |
Generic rigidity of frameworks with orientation-preserving crystallographic symmetry
| 2011-08-11 | Paper |
Lines induced by bichromatic point sets
| 2011-01-07 | Paper |
Slider-pinning rigidity: a Maxwell-Laman-type theorem
Discrete \& Computational Geometry | 2010-11-08 | Paper |
Sparsity-certifying graph decompositions
Graphs and Combinatorics | 2009-12-09 | Paper |
Sparse hypergraphs and pebble game algorithms
European Journal of Combinatorics | 2009-12-03 | Paper |
Combinatorial genericity and minimal rigidity
Proceedings of the twenty-fourth annual symposium on Computational geometry | 2009-02-12 | Paper |
Analyzing rigidity with pebble games
Proceedings of the twenty-fourth annual symposium on Computational geometry | 2009-02-12 | Paper |
Graded Sparse Graphs and Matroids
| 2007-11-18 | Paper |
Characterizing Sparse Graphs by Map Decompositions
| 2007-10-30 | Paper |
The Stress-Flex Conjecture
| N/A | Paper |
