| Publication | Date of Publication | Type |
|---|
Globally linked pairs of vertices in generic frameworks
Combinatorica | 2024-09-19 | Paper |
Partial reflections and globally linked pairs in rigid graphs
SIAM Journal on Discrete Mathematics | 2024-07-16 | Paper |
Count and cofactor matroids of highly connected graphs
Journal of Combinatorial Theory. Series B | 2024-03-14 | Paper |
Four-regular graphs with extremal rigidity properties
Discrete Mathematics | 2024-02-19 | Paper |
Ear‐decompositions, minimally connected matroids and rigid graphs
Journal of Graph Theory | 2024-01-30 | Paper |
Redundantly globally rigid braced triangulations
Ars Mathematica Contemporanea | 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
Discrete Mathematics | 2023-01-17 | Paper |
Minimally globally rigid graphs
European Journal of Combinatorics | 2022-12-01 | Paper |
The Steiner Problem for Count Matroids
Lecture Notes in Computer Science | 2022-10-13 | Paper |
Extremal families of redundantly rigid graphs in three dimensions
Discrete Applied Mathematics | 2022-10-13 | Paper |
Rigidity of random subgraphs and eigenvalues of stiffness matrices
SIAM Journal on Discrete Mathematics | 2022-10-06 | Paper |
Globally rigid graphs are fully reconstructible
Forum of Mathematics, Sigma | 2022-08-01 | Paper |
Globally rigid powers of graphs
Journal of Combinatorial Theory. Series B | 2022-04-27 | Paper |
Minimum size highly redundantly rigid graphs in the plane
Graphs and Combinatorics | 2021-07-28 | Paper |
Graph reconstruction from unlabeled edge lengths
Discrete & Computational Geometry | 2021-07-02 | Paper |
A note on generic rigidity of graphs in higher dimension
Discrete Applied Mathematics | 2021-04-29 | Paper |
Minimum cost globally rigid subgraphs
Bolyai Society Mathematical Studies | 2020-07-08 | Paper |
Global Rigidity of Unit Ball Graphs
SIAM Journal on Discrete Mathematics | 2020-01-16 | Paper |
Global rigidity of triangulations with braces
Journal of Combinatorial Theory. Series B | 2019-06-17 | Paper |
| Global rigidity of two-dimensional framework | 2018-11-23 | Paper |
| scientific article; zbMATH DE number 6863587 (Why is no real title available?) | 2018-04-23 | Paper |
Unique low rank completability of partially filled matrices
Journal of Combinatorial Theory. Series B | 2016-10-12 | Paper |
| Combinatorial rigidity. Graphs and matroids in the theory of rigid frameworks | 2016-07-29 | Paper |
| scientific article; zbMATH DE number 6606168 (Why is no real title available?) | 2016-07-26 | Paper |
| Connectivity augmentation of graphs | 2016-07-01 | Paper |
Discrete geometric analysis
MSJ Memoirs | 2016-06-01 | Paper |
Gain-sparsity and symmetry-forced rigidity in the plane
Discrete & Computational Geometry | 2016-03-29 | Paper |
Generic global rigidity of body-hinge frameworks
Journal of Combinatorial Theory. Series B | 2016-01-28 | Paper |
Henneberg moves on mechanisms
Beiträge zur Algebra und Geometrie | 2015-10-16 | Paper |
Globally linked pairs of vertices in rigid frameworks
Rigidity and Symmetry | 2015-07-08 | Paper |
Rigid two-dimensional frameworks with two coincident points
Graphs and Combinatorics | 2015-05-22 | Paper |
Sparse hypergraphs with applications in combinatorial rigidity
Discrete Applied Mathematics | 2015-04-28 | Paper |
Combinatorial conditions for the unique completability of low-rank matrices
SIAM Journal on Discrete Mathematics | 2015-04-17 | Paper |
Orientations and detachments of graphs with prescribed degrees and connectivity
Discrete Optimization | 2015-04-09 | Paper |
Parameterized complexity of spare capacity allocation and the multicost Steiner subgraph problem
Journal of Discrete Algorithms | 2015-02-13 | Paper |
Geometric sensitivity of rigid graphs
SIAM Journal on Discrete Mathematics | 2014-04-10 | Paper |
Robust tensegrity polygons
Discrete & Computational Geometry | 2013-11-06 | Paper |
Strongly rigid tensegrity graphs on the line
Discrete Applied Mathematics | 2013-04-25 | Paper |
Highly connected rigidity matroids have unique underlying graphs
European Journal of Combinatorics | 2012-12-03 | Paper |
Highly connected molecular graphs are rigid in three dimensions
Information Processing Letters | 2012-07-20 | Paper |
Generically globally rigid zeolites in the plane
Information Processing Letters | 2012-03-27 | Paper |
Operations preserving global rigidity of generic direction-length frameworks
International Journal of Computational Geometry & Applications | 2011-02-02 | Paper |
| Rigid and globally rigid graphs with pinned vertices | 2010-12-13 | Paper |
Globally rigid circuits of the direction-length rigidity matroid
Journal of Combinatorial Theory. Series B | 2010-05-05 | Paper |
Spanning 2-strong tournaments in 3-strong semicomplete digraphs
Discrete Mathematics | 2010-05-05 | Paper |
The generic rank of body-bar-and-hinge frameworks
European Journal of Combinatorics | 2010-04-27 | Paper |
Brick partitions of graphs
Discrete Mathematics | 2010-03-29 | Paper |
Algorithms for graph rigidity and scene analysis
Lecture Notes in Computer Science | 2010-03-03 | Paper |
On the rigidity of molecular graphs
Combinatorica | 2009-12-28 | Paper |
Rigid tensegrity labelings of graphs
European Journal of Combinatorics | 2009-12-03 | Paper |
Operations preserving the global rigidity of graphs and frameworks in the plane
Computational Geometry | 2009-07-27 | Paper |
A sufficient connectivity condition for generic rigidity in the plane
Discrete Applied Mathematics | 2009-06-24 | Paper |
On persistent directed graphs
Networks | 2008-12-17 | Paper |
Pin-collinear body-and-pin frameworks and the molecular conjecture
Discrete & Computational Geometry | 2008-12-02 | Paper |
Rigid components in molecular graphs
Algorithmica | 2007-09-10 | Paper |
Non-Separable Detachments of Graphs
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
ON THE RANK FUNCTION OF THE 3-DIMENSIONAL RIGIDITY MATROID
International Journal of Computational Geometry & Applications | 2007-02-09 | Paper |
Two‐connected orientations of Eulerian graphs
Journal of Graph Theory | 2006-09-06 | Paper |
A characterization of weakly four‐connected graphs
Journal of Graph Theory | 2006-09-06 | Paper |
Rigid two-dimensional frameworks with three collinear points
Graphs and Combinatorics | 2006-06-16 | Paper |
Globally linked pairs of vertices in equivalent realizations of graphs
Discrete & Computational Geometry | 2006-06-14 | Paper |
The Dress conjectures on rank in the 3-dimensional rigidity matroid
Advances in Applied Mathematics | 2006-04-28 | Paper |
On the existence of \(k\) edge-disjoint 2-connected spanning subgraphs
Journal of Combinatorial Theory. Series B | 2005-11-22 | Paper |
Rigid realizations of graphs on small grids
Computational Geometry | 2005-11-01 | Paper |
The \(d\)-dimensional rigidity matroid of sparse graphs
Journal of Combinatorial Theory. Series B | 2005-09-28 | Paper |
Sparse certificates and removable cycles in \(l\)-mixed \(p\)-connected graphs
Operations Research Letters | 2005-08-25 | Paper |
Algorithms – ESA 2004
Lecture Notes in Computer Science | 2005-08-18 | Paper |
Minimally \(k\)-edge-connected directed graphs of maximal size
Graphs and Combinatorics | 2005-05-12 | Paper |
Connected rigidity matroids and unique realizations of graphs
Journal of Combinatorial Theory. Series B | 2005-05-04 | Paper |
Independence free graphs and vertex connectivity augmentation
Journal of Combinatorial Theory. Series B | 2005-05-04 | Paper |
| scientific article; zbMATH DE number 2080256 (Why is no real title available?) | 2004-08-04 | Paper |
Splitting off edges between two subsets preserving the edge-connectivity of the graph.
Discrete Mathematics | 2004-02-14 | Paper |
Constrained Edge-Splitting Problems
SIAM Journal on Discrete Mathematics | 2004-01-08 | Paper |
Detachments Preserving Local Edge-Connectivity of Graphs
SIAM Journal on Discrete Mathematics | 2004-01-08 | Paper |
Edge splitting and connectivity augmentation in directed hypergraphs.
Discrete Mathematics | 2004-01-05 | Paper |
Convex embeddings and bisections of 3-connected graphs
Combinatorica | 2003-10-14 | Paper |
On minimally \(k\)-edge-connected graphs and shortest \(k\)-edge-connected Steiner networks
Discrete Applied Mathematics | 2003-10-14 | Paper |
A proof of Connelly's conjecture on 3-connected circuits of the rigidity matroid.
Journal of Combinatorial Theory. Series B | 2003-08-25 | Paper |
Non-separable detachments of graphs
Journal of Combinatorial Theory. Series B | 2003-08-20 | Paper |
Highly edge-connected detachments of graphs and digraphs
Journal of Graph Theory | 2003-05-22 | Paper |
| scientific article; zbMATH DE number 1757961 (Why is no real title available?) | 2002-06-20 | Paper |
| scientific article; zbMATH DE number 1522947 (Why is no real title available?) | 2001-11-28 | Paper |
Incrementing bipartite digraph edge-connectivity
Journal of Combinatorial Optimization | 2001-11-16 | Paper |
Splitting Off Edges within a Specified Subset Preserving the Edge-Connectivity of the Graph
Journal of Algorithms | 2001-11-01 | Paper |
On rooted node-connectivity problems
Algorithmica | 2001-10-14 | Paper |
| scientific article; zbMATH DE number 1342136 (Why is no real title available?) | 2001-03-04 | Paper |
An orientation theorem with parity conditions
Discrete Applied Mathematics | 2001-01-01 | Paper |
Bipartition constrained edge-splitting in directed graphs
Discrete Applied Mathematics | 2001-01-01 | Paper |
| scientific article; zbMATH DE number 1342129 (Why is no real title available?) | 2000-11-27 | Paper |
How to Make a Square Grid Framework with Cables Rigid
SIAM Journal on Computing | 2000-10-18 | Paper |
| scientific article; zbMATH DE number 1303570 (Why is no real title available?) | 2000-10-17 | Paper |
| scientific article; zbMATH DE number 1405806 (Why is no real title available?) | 2000-09-27 | Paper |
A note on the vertex-connectivity augmentation problem
Journal of Combinatorial Theory. Series B | 2000-07-19 | Paper |
Successive edge-connectivity augmentation problems
Mathematical Programming. Series A. Series B | 2000-07-10 | Paper |
Directed vertex-connectivity augmentation
Mathematical Programming. Series A. Series B | 2000-04-10 | Paper |
| On the number of shredders | 2000-03-22 | Paper |
| Extremal graphs in connectivity augmentation | 2000-03-22 | Paper |
How to make a graph four-connected
Mathematical Programming. Series A. Series B | 2000-02-16 | Paper |
Coverings and structure of crossing families
Mathematical Programming. Series A. Series B | 1999-12-05 | Paper |
Edge-Connectivity Augmentation with Partition Constraints
SIAM Journal on Discrete Mathematics | 1999-06-27 | Paper |
| scientific article; zbMATH DE number 1305425 (Why is no real title available?) | 1999-06-17 | Paper |
| scientific article; zbMATH DE number 1263261 (Why is no real title available?) | 1999-03-16 | Paper |
Edge-Connectivity Augmentation Preserving Simplicity
SIAM Journal on Discrete Mathematics | 1998-09-21 | Paper |
| scientific article; zbMATH DE number 1182763 (Why is no real title available?) | 1998-08-02 | Paper |
On the existence of \((k,l)\)-critical graphs
Discrete Mathematics | 1998-07-08 | Paper |
Adding and Reversing Arcs in Semicomplete Digraphs
Combinatorics, Probability and Computing | 1998-04-02 | Paper |
Minimal edge-coverings of pairs of sets
Journal of Combinatorial Theory. Series B | 1995-09-20 | Paper |
On the optimal vertex-connectivity augmentation
Journal of Combinatorial Theory. Series B | 1995-07-02 | Paper |
| scientific article; zbMATH DE number 475590 (Why is no real title available?) | 1994-06-12 | Paper |
Globally linked pairs and cheapest globally rigid supergraphs
(available as arXiv preprint) | N/A | Paper |
Highly connected orientations from edge-disjoint rigid subgraphs
(available as arXiv preprint) | N/A | Paper |
