2024
Four-regular graphs with extremal rigidity properties.
Discret. Math., April, 2024
Ear-decompositions, minimally connected matroids and rigid graphs.
J. Graph Theory, March, 2024
2023
Minimally globally rigid graphs.
Eur. J. Comb., 2023
Rigid block and hole graphs with a single block.
Discret. Math., 2023
2022
Rigidity of Random Subgraphs and Eigenvalues of Stiffness Matrices.
SIAM J. Discret. Math., September, 2022
Globally rigid powers of graphs.
J. Comb. Theory, Ser. B, 2022
Extremal families of redundantly rigid graphs in three dimensions.
Discret. Appl. Math., 2022
Globally linked pairs in braced maximal outerplanar graphs.
Proceedings of the 34th Canadian Conference on Computational Geometry, 2022
2021
Minimum Size Highly Redundantly Rigid Graphs in the Plane.
Graphs Comb., 2021
Graph Reconstruction from Unlabeled Edge Lengths.
Discret. Comput. Geom., 2021
A note on generic rigidity of graphs in higher dimension.
Discret. Appl. Math., 2021
2020
Global Rigidity of Unit Ball Graphs.
SIAM J. Discret. Math., 2020
The Steiner Problem for Count Matroids.
Proceedings of the Combinatorial Algorithms - 31st International Workshop, 2020
2019
Global rigidity of triangulations with braces.
J. Comb. Theory, Ser. B, 2019
Central Eur. J. Oper. Res., 2019
2018
Computational advances in combinatorial optimization.
Discret. Appl. Math., 2018
2016
Generic global rigidity of body-hinge frameworks.
J. Comb. Theory, Ser. B, 2016
Unique low rank completability of partially filled matrices.
J. Comb. Theory, Ser. B, 2016
Gain-Sparsity and Symmetry-Forced Rigidity in the Plane.
Discret. Comput. Geom., 2016
2015
Parameterized complexity of spare capacity allocation and the multicost Steiner subgraph problem.
J. Discrete Algorithms, 2015
Rigid Two-Dimensional Frameworks with Two Coincident Points.
Graphs Comb., 2015
Sparse hypergraphs with applications in combinatorial rigidity.
Discret. Appl. Math., 2015
On universally rigid frameworks on the line.
Contributions Discret. Math., 2015
2014
Combinatorial Conditions for the Unique Completability of Low-Rank Matrices.
SIAM J. Discret. Math., 2014
Orientations and detachments of graphs with prescribed degrees and connectivity.
Discret. Optim., 2014
2013
Geometric Sensitivity of Rigid Graphs.
SIAM J. Discret. Math., 2013
Generic global rigidity of body-bar frameworks.
J. Comb. Theory, Ser. B, 2013
Highly connected rigidity matroids have unique underlying graphs.
Eur. J. Comb., 2013
Robust Tensegrity Polygons.
Discret. Comput. Geom., 2013
Strongly rigid tensegrity graphs on the line.
Discret. Appl. Math., 2013
Central Eur. J. Oper. Res., 2013
2012
Highly connected molecular graphs are rigid in three dimensions.
Inf. Process. Lett., 2012
2010
Globally rigid circuits of the direction-length rigidity matroid.
J. Comb. Theory, Ser. B, 2010
Generically globally rigid zeolites in the plane.
Inf. Process. Lett., 2010
Operations Preserving Global Rigidity of Generic Direction-Length Frameworks.
Int. J. Comput. Geom. Appl., 2010
The generic rank of body-bar-and-hinge frameworks.
Eur. J. Comb., 2010
Brick partitions of graphs.
Discret. Math., 2010
Spanning 2-strong tournaments in 3-strong semicomplete digraphs.
Discret. Math., 2010
2009
Rigid tensegrity labelings of graphs.
Eur. J. Comb., 2009
A sufficient connectivity condition for generic rigidity in the plane.
Discret. Appl. Math., 2009
Operations preserving the global rigidity of graphs and frameworks in the plane.
Comput. Geom., 2009
2008
On persistent directed graphs.
Networks, 2008
Pin-Collinear Body-and-Pin Frameworks and the Molecular Conjecture.
Discret. Comput. Geom., 2008
On the rigidity of molecular graphs.
Comb., 2008
2007
Rigid Components in Molecular Graphs.
Algorithmica, 2007
2006
A characterization of weakly four-connected graphs.
J. Graph Theory, 2006
Two-connected orientations of Eulerian graphs.
J. Graph Theory, 2006
On the Rank Function of the 3-dimensional Rigidity Matroid.
Int. J. Comput. Geom. Appl., 2006
Globally Linked Pairs of Vertices in Equivalent Realizations of Graphs.
Discret. Comput. Geom., 2006
Uniquely Localizable Networks with Few Anchors.
Proceedings of the Algorithmic Aspects of Wireless Sensor Networks, 2006
2005
Sparse certificates and removable cycles in <i>l</i>-mixed <i>p</i>-connected graphs.
Oper. Res. Lett., 2005
On the existence of <i>k</i> edge-disjoint 2-connected spanning subgraphs.
J. Comb. Theory, Ser. B, 2005
The <i>d</i>-dimensional rigidity matroid of sparse graphs.
J. Comb. Theory, Ser. B, 2005
Independence free graphs and vertex connectivity augmentation.
J. Comb. Theory, Ser. B, 2005
Connected rigidity matroids and unique realizations of graphs.
J. Comb. Theory, Ser. B, 2005
Rigid Two-Dimensional Frameworks with Three Collinear Points.
Graphs Comb., 2005
Minimally <i>k</i>-Edge-Connected Directed Graphs of Maximal Size.
Graphs Comb., 2005
Rigid realizations of graphs on small grids.
Comput. Geom., 2005
The Dress conjectures on rank in the 3-dimensional rigidity matroid.
Adv. Appl. Math., 2005
2004
Splitting off edges between two subsets preserving the edge-connectivity of the graph.
Discret. Math., 2004
An Inductive Construction for Plane Laman Graphs via Vertex Splitting.
Proceedings of the Algorithms, 2004
2003
Detachments Preserving Local Edge-Connectivity of Graphs.
SIAM J. Discret. Math., 2003
Constrained Edge-Splitting Problems.
SIAM J. Discret. Math., 2003
Highly edge-connected detachments of graphs and digraphs.
J. Graph Theory, 2003
A proof of Connelly's conjecture on 3-connected circuits of the rigidity matroid.
J. Comb. Theory, Ser. B, 2003
Edge splitting and connectivity augmentation in directed hypergraphs.
Discret. Math., 2003
On minimally k-edge-connected graphs and shortest k-edge-connected Steiner networks.
Discret. Appl. Math., 2003
Algorithms for Graph Rigidity and Scene Analysis.
Proceedings of the Algorithms, 2003
2002
Random Struct. Algorithms, 2002
Convex Embeddings and Bisections of 3-Connected Graphs 1.
Comb., 2002
2001
Non-Separable Detachments of Graphs.
Electron. Notes Discret. Math., 2001
Bipartition constrained edge-splitting in directed graphs.
Discret. Appl. Math., 2001
Combinatorial problems related to origin-destination matrices.
Discret. Appl. Math., 2001
On Rooted Node-Connectivity Problems.
Algorithmica, 2001
2000
How to Make a Square Grid Framework with Cables Rigid.
SIAM J. Comput., 2000
Incrementing Bipartite Digraph Edge-Connectivity.
J. Comb. Optim., 2000
Splitting Off Edges within a Specified Subset Preserving the Edge-Connectivity of the Graph.
J. Algorithms, 2000
Connectivity Augmentation of Graphs.
Electron. Notes Discret. Math., 2000
A Near Optimal Algorithm for Vertex Connectivity Augmentation.
Proceedings of the Algorithms and Computation, 11th International Conference, 2000
1999
Edge-Connectivity Augmentation with Partition Constraints.
SIAM J. Discret. Math., 1999
How to make a graph four-connected.
Math. Program., 1999
Directed vertex-connectivity augmentation.
Math. Program., 1999
Coverings and structure of crossing families.
Math. Program., 1999
Successive edge-connectivity augmentation problems.
Math. Program., 1999
On the number of shredders.
J. Graph Theory, 1999
Extremal graphs in connectivity augmentation.
J. Graph Theory, 1999
Bisecting Two Subsets in 3-Connected Graphs.
Proceedings of the Algorithms and Computation, 10th International Symposium, 1999
Edge-Splitting Problems with Demands.
Proceedings of the Integer Programming and Combinatorial Optimization, 1999
An Orientation Theorem with Parity Conditions.
Proceedings of the Integer Programming and Combinatorial Optimization, 1999
On 2-Coverings and 2-Packings of Laminar Families.
Proceedings of the Algorithms, 1999
1998
Edge-Connectivity Augmentation Preserving Simplicity.
SIAM J. Discret. Math., 1998
On the existence of (k, l)-critical graphs.
Discret. Math., 1998
Adding and Reversing Arcs in Semicomplete Digraphs.
Comb. Probab. Comput., 1998
Approximating <i>k</i>-outconnected Subgraph Problems.
Proceedings of the Approximation Algorithms for Combinatorial Optimization, 1998
1997
A Note on the Vertex-Connectivity Augmentation Problem.
J. Comb. Theory, Ser. B, 1997
1995
On the Optimal Vertex-Connectivity Augmentation.
J. Comb. Theory, Ser. B, 1995
Minimal Edge-Coverings of Pairs of Sets.
J. Comb. Theory, Ser. B, 1995
How to Make a Strongly Connected Digraph Two-Connected.
Proceedings of the Integer Programming and Combinatorial Optimization, 1995
1993
Optimal and almost optimal algorithms for connectivity augmentation problems.
Proceedings of the 3rd Integer Programming and Combinatorial Optimization Conference, Erice, Italy, April 29, 1993
Incresing the Vertex-Connectivity in Directed Graphs.
Proceedings of the Algorithms - ESA '93, First Annual European Symposium, Bad Honnef, Germany, September 30, 1993
1991
Tree-representation of directed circuits.
Proceedings of the Graph Structure Theory, 1991
