| Publication | Date of Publication | Type |
|---|
| Rigidity of symmetric simplicial complexes and the lower bound theorem | 2025-01-22 | Paper |
| Super stable tensegrities and the Colin de Verdière number \(\nu\) | 2025-01-20 | Paper |
| Nearly tight spectral sparsification of directed hypergraphs | 2024-11-14 | Paper |
| Global rigidity of triangulated manifolds | 2024-11-08 | Paper |
| Global Rigidity of Line Constrained Frameworks | 2024-02-27 | Paper |
| Maximal matroids in weak order posets | 2024-01-15 | Paper |
| Realizable Dimension of Periodic Frameworks | 2023-06-05 | Paper |
| Rigidity of Symmetric Simplicial Complexes and the Lower Bound Theorem | 2023-04-10 | Paper |
| Characterizing the universal rigidity of generic tensegrities | 2023-03-14 | Paper |
| Vertex splitting, coincident realisations, and global rigidity of braced triangulations | 2023-01-23 | Paper |
| Abstract 3-Rigidity and Bivariate $C_2^1$-Splines II: Combinatorial Characterization | 2023-01-18 | Paper |
| Abstract 3-Rigidity and Bivariate $C_2^1$-Splines I: Whiteley's Maximality Conjecture | 2023-01-18 | Paper |
| Rigidity of Random Subgraphs and Eigenvalues of Stiffness Matrices | 2022-10-06 | Paper |
| Minimizing submodular functions on diamonds via generalized fractional matroid matchings | 2022-09-23 | Paper |
| Globally rigid powers of graphs | 2022-04-27 | Paper |
| An Improved Bound for the Rigidity of Linearly Constrained Frameworks | 2021-05-28 | Paper |
| Global rigidity of periodic graphs under fixed-lattice representations | 2021-02-03 | Paper |
| Packing of arborescences with matroid constraints via matroid intersection | 2020-06-10 | Paper |
| On packing spanning arborescences with matroid constraint | 2020-05-21 | Paper |
| Characterizing the Universal Rigidity of Generic Tensegrities | 2020-04-30 | Paper |
| Perfect elimination orderings for symmetric matrices | 2020-04-27 | Paper |
| Vertex Splitting, Coincident Realisations and Global Rigidity of Braced Triangulations | 2020-02-20 | Paper |
| Abstract 3-Rigidity and Bivariate $C_2^1$-Splines I: Whiteley's Maximality Conjecture | 2019-11-01 | Paper |
| Global rigidity of triangulations with braces | 2019-06-17 | Paper |
| On reachability mixed arborescence packing | 2019-06-14 | Paper |
| Point-hyperplane frameworks, slider joints, and rigidity preserving transformations | 2019-02-08 | Paper |
| Count matroids of group-labeled graphs | 2019-02-01 | Paper |
| Cut sparsifiers for balanced digraphs | 2019-01-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4556058 | 2018-11-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4556059 | 2018-11-23 | Paper |
| Rigidity of Frameworks on Expanding Spheres | 2018-11-19 | Paper |
| Polynomial combinatorial algorithms for skew-bisubmodular function minimization | 2018-09-28 | Paper |
| Improved Approximation Algorithms for k-Submodular Function Maximization | 2018-07-16 | Paper |
| On packing spanning arborescences with matroid constraint | 2018-01-18 | Paper |
| A proof of the molecular conjecture | 2017-10-20 | Paper |
| Singularity Degree of the Positive Semidefinite Matrix Completion Problem | 2017-05-30 | Paper |
| A structural characterization for certifying Robinsonian matrices | 2017-05-18 | Paper |
| Unique low rank completability of partially filled matrices | 2016-10-12 | Paper |
| Packing non-zero \(A\)-paths via matroid matching | 2016-09-30 | Paper |
| Gain-sparsity and symmetry-forced rigidity in the plane | 2016-03-29 | Paper |
| The Signed Positive Semidefinite Matrix Completion Problem for Odd-$K_4$ Minor Free Signed Graphs | 2016-03-28 | Paper |
| Generic global rigidity of body-hinge frameworks | 2016-01-28 | Paper |
| On the edge crossing properties of Euclidean minimum weight Laman graphs | 2016-01-18 | Paper |
| Periodic Body-and-Bar Frameworks | 2015-11-27 | Paper |
| Matroids of gain graphs in applied discrete geometry | 2015-11-03 | Paper |
| Infinitesimal Rigidity of Symmetric Bar-Joint Frameworks | 2015-07-31 | Paper |
| Testing the supermodular-cut condition | 2015-06-25 | Paper |
| Sufficient conditions for the global rigidity of graphs | 2015-06-10 | Paper |
| Combinatorial Conditions for the Unique Completability of Low-Rank Matrices | 2015-04-17 | Paper |
| A Min-Max Theorem for Transversal Submodular Functions and Its Implications | 2015-04-17 | Paper |
| Generalized skew bisubmodularity: a characterization and a min-max theorem | 2015-04-09 | Paper |
| Linking rigid bodies symmetrically | 2014-09-04 | Paper |
| Periodic body-and-bar frameworks | 2014-08-07 | Paper |
| Online graph exploration algorithms for cycles and trees by multiple searchers | 2014-07-11 | Paper |
| On the edge crossing properties of Euclidean minimum weight Laman graphs | 2014-01-14 | Paper |
| Constant-time algorithms for sparsity matroids | 2013-08-12 | Paper |
| Rooted-tree decompositions with matroid constraints and the infinitesimal rigidity of frameworks with boundaries | 2013-06-27 | Paper |
| Rectilinear covering for imprecise input points (extended abstract) | 2013-03-21 | Paper |
| Generic rigidity matroids with Dilworth truncations | 2013-01-04 | Paper |
| A rooted-forest partition with uniform vertex demand | 2012-12-21 | Paper |
| Sparsity and connectivity of medial graphs: Concerning two edge-disjoint Hamiltonian paths in planar rigidity circuits | 2012-08-10 | Paper |
| Exact algorithms for the bottleneck Steiner tree problem | 2011-12-14 | Paper |
| A proof of the molecular conjecture | 2011-06-03 | Paper |
| A tight lower bound for convexly independent subsets of the Minkowski sums of planar point sets | 2010-12-16 | Paper |
| Enumerating edge-constrained triangulations and edge-constrained non-crossing geometric spanning trees | 2010-04-28 | Paper |
| A Rooted-Forest Partition with Uniform Vertex Demand | 2010-02-09 | Paper |
| Exact algorithms for the bottleneck Steiner tree problem (extended abstract) | 2009-12-17 | Paper |
| On the Infinitesimal Rigidity of Bar-and-Slider Frameworks | 2009-12-17 | Paper |
| Fast enumeration algorithms for non-crossing geometric graphs | 2009-08-27 | Paper |
| Enumerating Constrained Non-crossing Geometric Spanning Trees | 2009-03-06 | Paper |
| Fast enumeration algorithms for non-crossing geometric graphs | 2009-02-12 | Paper |
| Enumerating constrained non-crossing minimally rigid frameworks | 2008-09-24 | Paper |
| Geometric Spanner of Objects under L 1 Distance | 2008-07-10 | Paper |
| Polygonal Curve Approximation Using Grid Points with Application to a Triangular Mesh Generation with Small Number of Different Edge Lengths | 2008-01-04 | Paper |
| Enumerating Non-crossing Minimally Rigid Frameworks | 2007-09-10 | Paper |
| Enumerating non-crossing minimally rigid frameworks | 2007-07-19 | Paper |
| Global Rigidity of Triangulated Manifolds | N/A | Paper |
| Super Stable Tensegrities and the Colin de Verdi\`{e}re Number $\nu$ | N/A | Paper |
| Identifiability of Points and Rigidity of Hypergraphs under Algebraic Constraints | N/A | Paper |
| Generic Global Rigidity in $\ell_p$-Space and the Identifiability of the $p$-Cayley-Menger Varieties | N/A | Paper |
| Forced Symmetric Formation Control | N/A | Paper |
