| Publication | Date of Publication | Type |
|---|
| Reconstruction in one dimension from unlabeled euclidean lengths | 2025-01-14 | Paper |
| Maximum likelihood thresholds via graph rigidity | 2024-08-22 | Paper |
| Computing maximum likelihood thresholds using graph rigidity | 2024-07-25 | Paper |
| Trilateration using unlabeled path or loop lengths | 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 | 2022-11-15 | Paper |
| Computing maximum likelihood thresholds using graph rigidity | 2022-10-20 | Paper |
| Transverse rigidity is prestress stability | 2022-10-13 | Paper |
| Universal Rigidity of Ladders on the line | 2022-07-18 | Paper |
| Rigidity for sticky discs | 2021-10-29 | Paper |
| <scp>Almost‐Rigidity</scp> of Frameworks | 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 | 2020-05-22 | Paper |
| Algebraic Matroids in Action | 2020-02-25 | Paper |
| Almost-rigidity of frameworks | 2019-08-10 | Paper |
| GENERIC UNLABELED GLOBAL RIGIDITY | 2019-08-01 | Paper |
| Affine Rigidity and Conics at Infinity | 2019-02-06 | Paper |
| Algorithms for detecting dependencies and rigid subsystems for CAD | 2018-12-18 | Paper |
| Delaunay triangulations with disconnected realization spaces | 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 | 2015-12-02 | Paper |
| Universality theorems for inscribed polytopes and Delaunay triangulations | 2015-12-02 | Paper |
| Anchored boundary conditions for locally isostatic networks | 2015-08-04 | Paper |
| Generic Rigidity with Forced Symmetry and Sparse Colored Graphs | 2015-07-08 | Paper |
| Learning with Cross-Kernels and Ideal PCA | 2014-06-10 | Paper |
| Frameworks with forced symmetry. II: Orientation-preserving crystallographic groups | 2014-05-30 | Paper |
| Ultrarigid periodic frameworks | 2014-04-08 | Paper |
| Topological designs | 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 | 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 | 2012-03-07 | Paper |
| Searching in Dynamic Tree-Like Partial Orders | 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 | 2010-11-08 | Paper |
| Sparsity-certifying graph decompositions | 2009-12-09 | Paper |
| Sparse hypergraphs and pebble game algorithms | 2009-12-03 | Paper |
| Combinatorial genericity and minimal rigidity | 2009-02-12 | Paper |
| Analyzing rigidity with pebble games | 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 |
