Tibor Jordán

Soma Villányi

SIAM J. Discret. Math., 2025

2024

Globally Linked Pairs of Vertices in Generic Frameworks.

[BibT_eX]

[DOI]

Soma Villányi

Comb., August, 2024

Four-regular graphs with extremal rigidity properties.

[BibT_eX]

[DOI]

Discret. Math., April, 2024

Ear-decompositions, minimally connected matroids and rigid graphs.

[BibT_eX]

[DOI]

J. Graph Theory, March, 2024

Partial Reflections and Globally Linked Pairs in Rigid Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2024

Count and cofactor matroids of highly connected graphs.

[BibT_eX]

[DOI]

Csaba Király

J. Comb. Theory B, 2024

2023

Minimally globally rigid graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2023

Rigid block and hole graphs with a single block.

[BibT_eX]

[DOI]

Discret. Math., 2023

Redundantly globally rigid braced triangulations.

[BibT_eX]

[DOI]

Ars Math. Contemp., 2023

2022

Rigidity of Random Subgraphs and Eigenvalues of Stiffness Matrices.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., September, 2022

Globally rigid powers of graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2022

Extremal families of redundantly rigid graphs in three dimensions.

[BibT_eX]

[DOI]

Christopher Poston

Ryan Roach

Discret. Appl. Math., 2022

Globally linked pairs in braced maximal outerplanar graphs.

[BibT_eX]

Proceedings of the 34th Canadian Conference on Computational Geometry, 2022

2021

Minimum Size Highly Redundantly Rigid Graphs in the Plane.

[BibT_eX]

[DOI]

Graphs Comb., 2021

Graph Reconstruction from Unlabeled Edge Lengths.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2021

A note on generic rigidity of graphs in higher dimension.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2021

2020

Global Rigidity of Unit Ball Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2020

The Steiner Problem for Count Matroids.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 31st International Workshop, 2020

2019

Global rigidity of triangulations with braces.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2019

Editorial.

[BibT_eX]

[DOI]

Botond Bertók

Tibor Csendes

Central Eur. J. Oper. Res., 2019

2018

Computational advances in combinatorial optimization.

[BibT_eX]

[DOI]

Tamás Kis

Silvano Martello

Discret. Appl. Math., 2018

2016

Generic global rigidity of body-hinge frameworks.

[BibT_eX]

[DOI]

Csaba Király

J. Comb. Theory B, 2016

Unique low rank completability of partially filled matrices.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2016

Gain-Sparsity and Symmetry-Forced Rigidity in the Plane.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2016

2015

Parameterized complexity of spare capacity allocation and the multicost Steiner subgraph problem.

[BibT_eX]

[DOI]

Ildikó Schlotter

J. Discrete Algorithms, 2015

Rigid Two-Dimensional Frameworks with Two Coincident Points.

[BibT_eX]

[DOI]

Graphs Comb., 2015

Sparse hypergraphs with applications in combinatorial rigidity.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2015

On universally rigid frameworks on the line.

[BibT_eX]

[DOI]

Viet Hang Nguyen

Contributions Discret. Math., 2015

2014

Combinatorial Conditions for the Unique Completability of Low-Rank Matrices.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2014

Orientations and detachments of graphs with prescribed degrees and connectivity.

[BibT_eX]

[DOI]

Satoru Iwata

Discret. Optim., 2014

2013

Geometric Sensitivity of Rigid Graphs.

[BibT_eX]

[DOI]

Gábor Domokos

Krisztina Tóth

SIAM J. Discret. Math., 2013

Generic global rigidity of body-bar frameworks.

[BibT_eX]

[DOI]

Robert Connelly

Walter Whiteley

J. Comb. Theory B, 2013

Highly connected rigidity matroids have unique underlying graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2013

Robust Tensegrity Polygons.

[BibT_eX]

[DOI]

János Geleji

Discret. Comput. Geom., 2013

Strongly rigid tensegrity graphs on the line.

[BibT_eX]

[DOI]

Csaba Király

Discret. Appl. Math., 2013

Editorial.

[BibT_eX]

[DOI]

Tibor Csendes

Tamás Szántai

Central Eur. J. Oper. Res., 2013

2012

Highly connected molecular graphs are rigid in three dimensions.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2012

2010

Globally rigid circuits of the direction-length rigidity matroid.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2010

Generically globally rigid zeolites in the plane.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2010

Operations Preserving Global Rigidity of Generic Direction-Length Frameworks.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2010

The generic rank of body-bar-and-hinge frameworks.

[BibT_eX]

[DOI]

Eur. J. Comb., 2010

Brick partitions of graphs.

[BibT_eX]

[DOI]

Discret. Math., 2010

Spanning 2-strong tournaments in 3-strong semicomplete digraphs.

[BibT_eX]

[DOI]

Discret. Math., 2010

2009

Rigid tensegrity labelings of graphs.

[BibT_eX]

[DOI]

András Recski

Zoltan Szabadka

Eur. J. Comb., 2009

A sufficient connectivity condition for generic rigidity in the plane.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2009

Operations preserving the global rigidity of graphs and frameworks in the plane.

[BibT_eX]

[DOI]

Zoltan Szabadka

Comput. Geom., 2009

2008

On persistent directed graphs.

[BibT_eX]

[DOI]

Networks, 2008

Pin-Collinear Body-and-Pin Frameworks and the Molecular Conjecture.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2008

On the rigidity of molecular graphs.

[BibT_eX]

[DOI]

Comb., 2008

2007

Rigid Components in Molecular Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2007

2006

A characterization of weakly four-connected graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2006

Two-connected orientations of Eulerian graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2006

On the Rank Function of the 3-dimensional Rigidity Matroid.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2006

Globally Linked Pairs of Vertices in Equivalent Realizations of Graphs.

[BibT_eX]

[DOI]

Zoltan Szabadka

Discret. Comput. Geom., 2006

Uniquely Localizable Networks with Few Anchors.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects of Wireless Sensor Networks, 2006

2005

Sparse certificates and removable cycles in l-mixed p-connected graphs.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2005

On the existence of k edge-disjoint 2-connected spanning subgraphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2005

The d-dimensional rigidity matroid of sparse graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2005

Connected rigidity matroids and unique realizations of graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2005

Rigid Two-Dimensional Frameworks with Three Collinear Points.

[BibT_eX]

[DOI]

Graphs Comb., 2005

Minimally k-Edge-Connected Directed Graphs of Maximal Size.

[BibT_eX]

[DOI]

Graphs Comb., 2005

Rigid realizations of graphs on small grids.

[BibT_eX]

[DOI]

Comput. Geom., 2005

The Dress conjectures on rank in the 3-dimensional rigidity matroid.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2005

2004

Splitting off edges between two subsets preserving the edge-connectivity of the graph.

[BibT_eX]

[DOI]

Discret. Math., 2004

An Inductive Construction for Plane Laman Graphs via Vertex Splitting.

[BibT_eX]

[DOI]

Walter Whiteley

Proceedings of the Algorithms, 2004

2003

Detachments Preserving Local Edge-Connectivity of Graphs.

[BibT_eX]

[DOI]

Zoltán Szigeti

SIAM J. Discret. Math., 2003

Constrained Edge-Splitting Problems.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2003

Highly edge-connected detachments of graphs and digraphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2003

A proof of Connelly's conjecture on 3-connected circuits of the rigidity matroid.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2003

Edge splitting and connectivity augmentation in directed hypergraphs.

[BibT_eX]

[DOI]

Discret. Math., 2003

On minimally k-edge-connected graphs and shortest k-edge-connected Steiner networks.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2003

Algorithms for Graph Rigidity and Scene Analysis.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2003

2002

Preface.

[BibT_eX]

[DOI]

Alessandro Panconesi

Random Struct. Algorithms, 2002

Convex Embeddings and Bisections of 3-Connected Graphs 1.

[BibT_eX]

[DOI]

Comb., 2002

2001

Non-Separable Detachments of Graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2001

Bipartition constrained edge-splitting in directed graphs.

[BibT_eX]

[DOI]

Harold N. Gabow

Discret. Appl. Math., 2001

Combinatorial problems related to origin-destination matrices.

[BibT_eX]

[DOI]

Zoltán Szigeti

Discret. Appl. Math., 2001

On Rooted Node-Connectivity Problems.

[BibT_eX]

[DOI]

Joseph Cheriyan

Zeev Nutov

Algorithmica, 2001

Independence Free Graphs and Vertex Connectivity Augmentation.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2001

2000

Incrementing Bipartite Digraph Edge-Connectivity.

[BibT_eX]

[DOI]

Harold N. Gabow

J. Comb. Optim., 2000

Splitting Off Edges within a Specified Subset Preserving the Edge-Connectivity of the Graph.

[BibT_eX]

[DOI]

J. Algorithms, 2000

Connectivity Augmentation of Graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2000

A Near Optimal Algorithm for Vertex Connectivity Augmentation.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 11th International Conference, 2000

1999

How to make a graph four-connected.

[BibT_eX]

[DOI]

Ervin Györi

Math. Program., 1999

Directed vertex-connectivity augmentation.

[BibT_eX]

[DOI]

Math. Program., 1999

Coverings and structure of crossing families.

[BibT_eX]

[DOI]

Tamás Fleiner

Math. Program., 1999

Successive edge-connectivity augmentation problems.

[BibT_eX]

[DOI]

Eddie Cheng

Math. Program., 1999

On the number of shredders.

[BibT_eX]

[DOI]

J. Graph Theory, 1999

Extremal graphs in connectivity augmentation.

[BibT_eX]

[DOI]

J. Graph Theory, 1999

How to Make a Square Grid Framework with Cables Rigid.

[BibT_eX]

[DOI]

Harold N. Gabow

Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

Bisecting Two Subsets in 3-Connected Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 10th International Symposium, 1999

Edge-Splitting Problems with Demands.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 1999

An Orientation Theorem with Parity Conditions.

[BibT_eX]

[DOI]

Zoltán Szigeti

Proceedings of the Integer Programming and Combinatorial Optimization, 1999

On 2-Coverings and 2-Packings of Laminar Families.

[BibT_eX]

[DOI]

Joseph Cheriyan

R. Ravi

Proceedings of the Algorithms, 1999

1998

On the existence of (k, l)-critical graphs.

[BibT_eX]

[DOI]

Discret. Math., 1998

Adding and Reversing Arcs in Semicomplete Digraphs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 1998

Edge-Connectivity Augmentation with Partition Constraints.

[BibT_eX]

[DOI]

Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 1998

Approximating k-outconnected Subgraph Problems.

[BibT_eX]

[DOI]

Joseph Cheriyan

Zeev Nutov

Proceedings of the Approximation Algorithms for Combinatorial Optimization, 1998

1997

A Note on the Vertex-Connectivity Augmentation Problem.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1997

Edge-Connectivity Augmentation Preserving Simplicity.

[BibT_eX]

[DOI]

Proceedings of the 38th Annual Symposium on Foundations of Computer Science, 1997

1995

On the Optimal Vertex-Connectivity Augmentation.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1995

Minimal Edge-Coverings of Pairs of Sets.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1995

How to Make a Strongly Connected Digraph Two-Connected.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 1995

1993

Optimal and almost optimal algorithms for connectivity augmentation problems.

[BibT_eX]

Proceedings of the 3rd Integer Programming and Combinatorial Optimization Conference, Erice, Italy, April 29, 1993

Incresing the Vertex-Connectivity in Directed Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA '93, First Annual European Symposium, Bad Honnef, Germany, September 30, 1993

1991

Tree-representation of directed circuits.

[BibT_eX]