| Publication | Date of Publication | Type |
|---|
| Count and cofactor matroids of highly connected graphs | 2024-03-14 | Paper |
| Four-regular graphs with extremal rigidity properties | 2024-02-19 | Paper |
| Ear‐decompositions, minimally connected matroids and rigid graphs | 2024-01-30 | Paper |
| Redundantly globally rigid braced triangulations | 2023-09-13 | Paper |
| Globally linked pairs of vertices in generic frameworks | 2023-07-10 | Paper |
| On generic universal rigidity on the line | 2023-05-23 | Paper |
| Partial reflections and globally linked pairs in rigid graphs | 2023-05-05 | Paper |
| Rigid block and hole graphs with a single block | 2023-01-17 | Paper |
| Minimally globally rigid graphs | 2022-12-01 | Paper |
| Extremal families of redundantly rigid graphs in three dimensions | 2022-10-13 | Paper |
| The Steiner Problem for Count Matroids | 2022-10-13 | Paper |
| Rigidity of Random Subgraphs and Eigenvalues of Stiffness Matrices | 2022-10-06 | Paper |
| Globally rigid graphs are fully reconstructible | 2022-08-01 | Paper |
| Globally rigid powers of graphs | 2022-04-27 | Paper |
| Minimum size highly redundantly rigid graphs in the plane | 2021-07-28 | Paper |
| Graph reconstruction from unlabeled edge lengths | 2021-07-02 | Paper |
| A note on generic rigidity of graphs in higher dimension | 2021-04-29 | Paper |
| Minimum Cost Globally Rigid Subgraphs | 2020-07-08 | Paper |
| Global Rigidity of Unit Ball Graphs | 2020-01-16 | Paper |
| Global rigidity of triangulations with braces | 2019-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4556059 | 2018-11-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4635969 | 2018-04-23 | Paper |
| Unique low rank completability of partially filled matrices | 2016-10-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2990097 | 2016-07-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5740310 | 2016-07-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2816106 | 2016-07-01 | Paper |
| Discrete geometric analysis | 2016-06-01 | Paper |
| Gain-sparsity and symmetry-forced rigidity in the plane | 2016-03-29 | Paper |
| Generic global rigidity of body-hinge frameworks | 2016-01-28 | Paper |
| Henneberg moves on mechanisms | 2015-10-16 | Paper |
| Globally Linked Pairs of Vertices in Rigid Frameworks | 2015-07-08 | Paper |
| Rigid two-dimensional frameworks with two coincident points | 2015-05-22 | Paper |
| Sparse hypergraphs with applications in combinatorial rigidity | 2015-04-28 | Paper |
| Combinatorial Conditions for the Unique Completability of Low-Rank Matrices | 2015-04-17 | Paper |
| Orientations and detachments of graphs with prescribed degrees and connectivity | 2015-04-09 | Paper |
| Parameterized complexity of spare capacity allocation and the multicost Steiner subgraph problem | 2015-02-13 | Paper |
| Geometric Sensitivity of Rigid Graphs | 2014-04-10 | Paper |
| Robust tensegrity polygons | 2013-11-06 | Paper |
| Strongly rigid tensegrity graphs on the line | 2013-04-25 | Paper |
| Highly connected rigidity matroids have unique underlying graphs | 2012-12-03 | Paper |
| Highly connected molecular graphs are rigid in three dimensions | 2012-07-20 | Paper |
| Generically globally rigid zeolites in the plane | 2012-03-27 | Paper |
| OPERATIONS PRESERVING GLOBAL RIGIDITY OF GENERIC DIRECTION-LENGTH FRAMEWORKS | 2011-02-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3060861 | 2010-12-13 | Paper |
| Spanning 2-strong tournaments in 3-strong semicomplete digraphs | 2010-05-05 | Paper |
| Globally rigid circuits of the direction-length rigidity matroid | 2010-05-05 | Paper |
| The generic rank of body-bar-and-hinge frameworks | 2010-04-27 | Paper |
| Brick partitions of graphs | 2010-03-29 | Paper |
| Algorithms - ESA 2003 | 2010-03-03 | Paper |
| On the rigidity of molecular graphs | 2009-12-28 | Paper |
| Rigid tensegrity labelings of graphs | 2009-12-03 | Paper |
| Operations preserving the global rigidity of graphs and frameworks in the plane | 2009-07-27 | Paper |
| A sufficient connectivity condition for generic rigidity in the plane | 2009-06-24 | Paper |
| On persistent directed graphs | 2008-12-17 | Paper |
| Pin-collinear body-and-pin frameworks and the molecular conjecture | 2008-12-02 | Paper |
| Rigid components in molecular graphs | 2007-09-10 | Paper |
| Non-Separable Detachments of Graphs | 2007-05-29 | Paper |
| ON THE RANK FUNCTION OF THE 3-DIMENSIONAL RIGIDITY MATROID | 2007-02-09 | Paper |
| A characterization of weakly four‐connected graphs | 2006-09-06 | Paper |
| Two‐connected orientations of Eulerian graphs | 2006-09-06 | Paper |
| Rigid two-dimensional frameworks with three collinear points | 2006-06-16 | Paper |
| Globally linked pairs of vertices in equivalent realizations of graphs | 2006-06-14 | Paper |
| The Dress conjectures on rank in the 3-dimensional rigidity matroid | 2006-04-28 | Paper |
| On the existence of \(k\) edge-disjoint 2-connected spanning subgraphs | 2005-11-22 | Paper |
| Rigid realizations of graphs on small grids | 2005-11-01 | Paper |
| The \(d\)-dimensional rigidity matroid of sparse graphs | 2005-09-28 | Paper |
| Sparse certificates and removable cycles in \(l\)-mixed \(p\)-connected graphs | 2005-08-25 | Paper |
| Algorithms – ESA 2004 | 2005-08-18 | Paper |
| Minimally \(k\)-edge-connected directed graphs of maximal size | 2005-05-12 | Paper |
| Connected rigidity matroids and unique realizations of graphs | 2005-05-04 | Paper |
| Independence free graphs and vertex connectivity augmentation | 2005-05-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472504 | 2004-08-04 | Paper |
| Splitting off edges between two subsets preserving the edge-connectivity of the graph. | 2004-02-14 | Paper |
| Detachments Preserving Local Edge-Connectivity of Graphs | 2004-01-08 | Paper |
| Constrained Edge-Splitting Problems | 2004-01-08 | Paper |
| Edge splitting and connectivity augmentation in directed hypergraphs. | 2004-01-05 | Paper |
| Convex embeddings and bisections of 3-connected graphs | 2003-10-14 | Paper |
| On minimally \(k\)-edge-connected graphs and shortest \(k\)-edge-connected Steiner networks | 2003-10-14 | Paper |
| A proof of Connelly's conjecture on 3-connected circuits of the rigidity matroid. | 2003-08-25 | Paper |
| Non-separable detachments of graphs | 2003-08-20 | Paper |
| Highly edge-connected detachments of graphs and digraphs | 2003-05-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4537749 | 2002-06-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4511243 | 2001-11-28 | Paper |
| Incrementing bipartite digraph edge-connectivity | 2001-11-16 | Paper |
| Splitting Off Edges within a Specified Subset Preserving the Edge-Connectivity of the Graph | 2001-11-01 | Paper |
| On rooted node-connectivity problems | 2001-10-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4263718 | 2001-03-04 | Paper |
| An orientation theorem with parity conditions | 2001-01-01 | Paper |
| Bipartition constrained edge-splitting in directed graphs | 2001-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4263711 | 2000-11-27 | Paper |
| How to Make a Square Grid Framework with Cables Rigid | 2000-10-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250196 | 2000-10-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4938792 | 2000-09-27 | Paper |
| A note on the vertex-connectivity augmentation problem | 2000-07-19 | Paper |
| Successive edge-connectivity augmentation problems | 2000-07-10 | Paper |
| Directed vertex-connectivity augmentation | 2000-04-10 | Paper |
| Extremal graphs in connectivity augmentation | 2000-03-22 | Paper |
| On the number of shredders | 2000-03-22 | Paper |
| How to make a graph four-connected | 2000-02-16 | Paper |
| Coverings and structure of crossing families | 1999-12-05 | Paper |
| Edge-Connectivity Augmentation with Partition Constraints | 1999-06-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252308 | 1999-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234133 | 1999-03-16 | Paper |
| Edge-Connectivity Augmentation Preserving Simplicity | 1998-09-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4400846 | 1998-08-02 | Paper |
| On the existence of \((k,l)\)-critical graphs | 1998-07-08 | Paper |
| Adding and Reversing Arcs in Semicomplete Digraphs | 1998-04-02 | Paper |
| Minimal edge-coverings of pairs of sets | 1995-09-20 | Paper |
| On the optimal vertex-connectivity augmentation | 1995-07-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4273846 | 1994-06-12 | Paper |
| Globally linked pairs and cheapest globally rigid supergraphs | 0001-01-03 | Paper |
| Highly connected orientations from edge-disjoint rigid subgraphs | 0001-01-03 | Paper |
