Tree-representation of directed circuits. - András Frank; Tibor Jordán (Graph Structure Theory, 1991)

Incresing the Vertex-Connectivity in Directed Graphs. - Tibor Jordán (ESA, 1993)

Optimal and almost optimal algorithms for connectivity augmentation problems. - Tibor Jordán (IPCO, 1993)

How to Make a Strongly Connected Digraph Two-Connected. - András Frank; Tibor Jordán (IPCO, 1995)

Minimal Edge-Coverings of Pairs of Sets. - András Frank; Tibor Jordán (J. Comb. Theory B, 1995)

On the Optimal Vertex-Connectivity Augmentation. - Tibor Jordán (J. Comb. Theory B, 1995)

A Note on the Vertex-Connectivity Augmentation Problem. - Tibor Jordán (J. Comb. Theory B, 1997)

Approximating k-outconnected Subgraph Problems. - Joseph Cheriyan; Tibor Jordán; Zeev Nutov (APPROX, 1998)

Adding and Reversing Arcs in Semicomplete Digraphs. - Jørgen Bang-Jensen; Tibor Jordán (Comb. Probab. Comput., 1998)

On the existence of (k, l)-critical graphs. - Tibor Jordán (Discret. Math., 1998)

Edge-Connectivity Augmentation Preserving Simplicity. - Jørgen Bang-Jensen; Tibor Jordán (SIAM J. Discret. Math., 1998)

On 2-Coverings and 2-Packings of Laminar Families. - Joseph Cheriyan; Tibor Jordán; R. Ravi 001 (ESA, 1999)

An Orientation Theorem with Parity Conditions. - András Frank; Tibor Jordán; Zoltán Szigeti (IPCO, 1999)

Edge-Splitting Problems with Demands. - Tibor Jordán (IPCO, 1999)

Bisecting Two Subsets in 3-Connected Graphs. - Hiroshi Nagamochi; Tibor Jordán; Yoshitaka Nakao; Toshihide Ibaraki (ISAAC, 1999)

Extremal graphs in connectivity augmentation. - Tibor Jordán (J. Graph Theory, 1999)

On the number of shredders. - Tibor Jordán (J. Graph Theory, 1999)

Successive edge-connectivity augmentation problems. - Eddie Cheng 001; Tibor Jordán (Math. Program., 1999)

Coverings and structure of crossing families. - Tamás Fleiner; Tibor Jordán (Math. Program., 1999)

Directed vertex-connectivity augmentation. - András Frank; Tibor Jordán (Math. Program., 1999)

How to make a graph four-connected. - Ervin Györi; Tibor Jordán (Math. Program., 1999)

Edge-Connectivity Augmentation with Partition Constraints. - Jørgen Bang-Jensen; Harold N. Gabow; Tibor Jordán; Zoltán Szigeti (SIAM J. Discret. Math., 1999)

A Near Optimal Algorithm for Vertex Connectivity Augmentation. - Bill Jackson; Tibor Jordán (ISAAC, 2000)

Connectivity Augmentation of Graphs. - Bill Jackson; Tibor Jordán (Electron. Notes Discret. Math., 2000)

Splitting Off Edges within a Specified Subset Preserving the Edge-Connectivity of the Graph. - Jørgen Bang-Jensen; Tibor Jordán (J. Algorithms, 2000)

Incrementing Bipartite Digraph Edge-Connectivity. - Harold N. Gabow; Tibor Jordán (J. Comb. Optim., 2000)

How to Make a Square Grid Framework with Cables Rigid. - Harold N. Gabow; Tibor Jordán (SIAM J. Comput., 2000)

On Rooted Node-Connectivity Problems. - Joseph Cheriyan; Tibor Jordán; Zeev Nutov (Algorithmica, 2001)

Combinatorial problems related to origin-destination matrices. - András Frank; Tibor Jordán; Zoltán Szigeti (Discret. Appl. Math., 2001)

Bipartition constrained edge-splitting in directed graphs. - Harold N. Gabow; Tibor Jordán (Discret. Appl. Math., 2001)

Convex Embeddings and Bisections of 3-Connected Graphs 1. - Hiroshi Nagamochi; Tibor Jordán; Yoshitaka Nakao; Toshihide Ibaraki (Comb., 2002)

Preface. - Tibor Jordán; Alessandro Panconesi (Random Struct. Algorithms, 2002)

Algorithms for Graph Rigidity and Scene Analysis. - Alex R. Berg; Tibor Jordán (ESA, 2003)

On minimally k-edge-connected graphs and shortest k-edge-connected Steiner networks. - Tibor Jordán (Discret. Appl. Math., 2003)

Edge splitting and connectivity augmentation in directed hypergraphs. - Alex R. Berg; Bill Jackson; Tibor Jordán (Discret. Math., 2003)

A proof of Connelly's conjecture on 3-connected circuits of the rigidity matroid. - Alex R. Berg; Tibor Jordán (J. Comb. Theory B, 2003)

Non-separable detachments of graphs. - Bill Jackson; Tibor Jordán (J. Comb. Theory B, 2003)

Highly edge-connected detachments of graphs and digraphs. - Alex R. Berg; Bill Jackson; Tibor Jordán (J. Graph Theory, 2003)

Constrained Edge-Splitting Problems. - Tibor Jordán (SIAM J. Discret. Math., 2003)

Detachments Preserving Local Edge-Connectivity of Graphs. - Tibor Jordán; Zoltán Szigeti (SIAM J. Discret. Math., 2003)

An Inductive Construction for Plane Laman Graphs via Vertex Splitting. - Zsolt Fekete; Tibor Jordán; Walter Whiteley (ESA, 2004)

Splitting off edges between two subsets preserving the edge-connectivity of the graph. - Jørgen Bang-Jensen; Tibor Jordán (Discret. Math., 2004)

The Dress conjectures on rank in the 3-dimensional rigidity matroid. - Bill Jackson; Tibor Jordán (Adv. Appl. Math., 2005)

Rigid realizations of graphs on small grids. - Zsolt Fekete; Tibor Jordán (Comput. Geom., 2005)

Minimally k-Edge-Connected Directed Graphs of Maximal Size. - Alex R. Berg; Tibor Jordán (Graphs Comb., 2005)

Rigid Two-Dimensional Frameworks with Three Collinear Points. - Bill Jackson; Tibor Jordán (Graphs Comb., 2005)

Connected rigidity matroids and unique realizations of graphs. - Bill Jackson; Tibor Jordán (J. Comb. Theory B, 2005)

Independence free graphs and vertex connectivity augmentation. - Bill Jackson; Tibor Jordán (J. Comb. Theory B, 2005)

The d-dimensional rigidity matroid of sparse graphs. - Bill Jackson; Tibor Jordán (J. Comb. Theory B, 2005)

On the existence of k edge-disjoint 2-connected spanning subgraphs. - Tibor Jordán (J. Comb. Theory B, 2005)

Sparse certificates and removable cycles in l-mixed p-connected graphs. - Alex R. Berg; Tibor Jordán (Oper. Res. Lett., 2005)

Uniquely Localizable Networks with Few Anchors. - Zsolt Fekete; Tibor Jordán (ALGOSENSORS, 2006)

Globally Linked Pairs of Vertices in Equivalent Realizations of Graphs. - Bill Jackson; Tibor Jordán; Zoltan Szabadka (Discret. Comput. Geom., 2006)

On the Rank Function of the 3-dimensional Rigidity Matroid. - Bill Jackson; Tibor Jordán (Int. J. Comput. Geom. Appl., 2006)

Two-connected orientations of Eulerian graphs. - Alex R. Berg; Tibor Jordán (J. Graph Theory, 2006)

A characterization of weakly four-connected graphs. - Tibor Jordán (J. Graph Theory, 2006)

Rigid Components in Molecular Graphs. - Bill Jackson; Tibor Jordán (Algorithmica, 2007)

On the rigidity of molecular graphs. - Bill Jackson; Tibor Jordán (Comb., 2008)

Pin-Collinear Body-and-Pin Frameworks and the Molecular Conjecture. - Bill Jackson; Tibor Jordán (Discret. Comput. Geom., 2008)

On persistent directed graphs. - Jørgen Bang-Jensen; Tibor Jordán (Networks, 2008)

Operations preserving the global rigidity of graphs and frameworks in the plane. - Tibor Jordán; Zoltan Szabadka (Comput. Geom., 2009)

A sufficient connectivity condition for generic rigidity in the plane. - Bill Jackson; Tibor Jordán (Discret. Appl. Math., 2009)

Rigid tensegrity labelings of graphs. - Tibor Jordán; András Recski; Zoltan Szabadka (Eur. J. Comb., 2009)

Spanning 2-strong tournaments in 3-strong semicomplete digraphs. - Jørgen Bang-Jensen; Tibor Jordán (Discret. Math., 2010)

Brick partitions of graphs. - Bill Jackson; Tibor Jordán (Discret. Math., 2010)

The generic rank of body-bar-and-hinge frameworks. - Bill Jackson; Tibor Jordán (Eur. J. Comb., 2010)

Operations Preserving Global Rigidity of Generic Direction-Length Frameworks. - Bill Jackson; Tibor Jordán (Int. J. Comput. Geom. Appl., 2010)

Generically globally rigid zeolites in the plane. - Tibor Jordán (Inf. Process. Lett., 2010)

Globally rigid circuits of the direction-length rigidity matroid. - Bill Jackson; Tibor Jordán (J. Comb. Theory B, 2010)

Highly connected molecular graphs are rigid in three dimensions. - Tibor Jordán (Inf. Process. Lett., 2012)

Editorial. - Tibor Csendes; Tibor Jordán; Tamás Szántai (Central Eur. J. Oper. Res., 2013)

Strongly rigid tensegrity graphs on the line. - Bill Jackson; Tibor Jordán; Csaba Király 001 (Discret. Appl. Math., 2013)

Robust Tensegrity Polygons. - János Geleji; Tibor Jordán (Discret. Comput. Geom., 2013)

Highly connected rigidity matroids have unique underlying graphs. - Tibor Jordán; Viktória E. Kaszanitzky (Eur. J. Comb., 2013)

Generic global rigidity of body-bar frameworks. - Robert Connelly; Tibor Jordán; Walter Whiteley (J. Comb. Theory B, 2013)

Geometric Sensitivity of Rigid Graphs. - Tibor Jordán; Gábor Domokos; Krisztina Tóth (SIAM J. Discret. Math., 2013)

Orientations and detachments of graphs with prescribed degrees and connectivity. - Satoru Iwata 001; Tibor Jordán (Discret. Optim., 2014)

Combinatorial Conditions for the Unique Completability of Low-Rank Matrices. - Bill Jackson; Tibor Jordán; Shin-ichi Tanigawa (SIAM J. Discret. Math., 2014)

On universally rigid frameworks on the line. - Tibor Jordán; Viet Hang Nguyen (Contributions Discret. Math., 2015)

Sparse hypergraphs with applications in combinatorial rigidity. - Tibor Jordán; Viktória E. Kaszanitzky (Discret. Appl. Math., 2015)

Rigid Two-Dimensional Frameworks with Two Coincident Points. - Zsolt Fekete; Tibor Jordán; Viktória E. Kaszanitzky (Graphs Comb., 2015)

Parameterized complexity of spare capacity allocation and the multicost Steiner subgraph problem. - Tibor Jordán; Ildikó Schlotter (J. Discrete Algorithms, 2015)

Gain-Sparsity and Symmetry-Forced Rigidity in the Plane. - Tibor Jordán; Viktória E. Kaszanitzky; Shin-ichi Tanigawa (Discret. Comput. Geom., 2016)

Unique low rank completability of partially filled matrices. - Bill Jackson; Tibor Jordán; Shin-ichi Tanigawa (J. Comb. Theory B, 2016)

Generic global rigidity of body-hinge frameworks. - Tibor Jordán; Csaba Király 001; Shin-ichi Tanigawa (J. Comb. Theory B, 2016)

Computational advances in combinatorial optimization. - Tibor Jordán; Tamás Kis; Silvano Martello (Discret. Appl. Math., 2018)

Editorial. - Botond Bertók; Tibor Csendes; Tibor Jordán (Central Eur. J. Oper. Res., 2019)

Global rigidity of triangulations with braces. - Tibor Jordán; Shin-ichi Tanigawa (J. Comb. Theory B, 2019)

The Steiner Problem for Count Matroids. - Tibor Jordán; Yusuke Kobayashi 001; Ryoga Mahara; Kazuhisa Makino (IWOCA, 2020)

Global Rigidity of Unit Ball Graphs. - Dániel Garamvölgyi; Tibor Jordán (SIAM J. Discret. Math., 2020)

A note on generic rigidity of graphs in higher dimension. - Tibor Jordán (Discret. Appl. Math., 2021)

Graph Reconstruction from Unlabeled Edge Lengths. - Dániel Garamvölgyi; Tibor Jordán (Discret. Comput. Geom., 2021)

Minimum Size Highly Redundantly Rigid Graphs in the Plane. - Tibor Jordán (Graphs Comb., 2021)

Globally linked pairs in braced maximal outerplanar graphs. - Dániel Garamvölgyi; Tibor Jordán (CCCG, 2022)

Extremal families of redundantly rigid graphs in three dimensions. - Tibor Jordán; Christopher Poston; Ryan Roach (Discret. Appl. Math., 2022)

Globally rigid powers of graphs. - Tibor Jordán; Shin-ichi Tanigawa (J. Comb. Theory B, 2022)

Rigidity of Random Subgraphs and Eigenvalues of Stiffness Matrices. - Tibor Jordán; Shin-ichi Tanigawa (SIAM J. Discret. Math., 2022)

Redundantly globally rigid braced triangulations. - Qianfan Chen; Siddhant Jajodia; Tibor Jordán; Kate Perkins (Ars Math. Contemp., 2023)

Rigid block and hole graphs with a single block. - Tibor Jordán (Discret. Math., 2023)

Minimally globally rigid graphs. - Dániel Garamvölgyi; Tibor Jordán (Eur. J. Comb., 2023)

Count and cofactor matroids of highly connected graphs. - Dániel Garamvölgyi; Tibor Jordán; Csaba Király 001 (J. Comb. Theory B, 2024)

Partial Reflections and Globally Linked Pairs in Rigid Graphs. - Dániel Garamvölgyi; Tibor Jordán (SIAM J. Discret. Math., 2024)

Ear-decompositions, minimally connected matroids and rigid graphs. - Tibor Jordán (J. Graph Theory, 2024)

Four-regular graphs with extremal rigidity properties. - Tibor Jordán; Robin Huang; Henry Simmons; Kaylee Weatherspoon; Zeyu Zheng 001 (Discret. Math., 2024)

Globally Linked Pairs of Vertices in Generic Frameworks. - Tibor Jordán; Soma Villányi (Comb., 2024)

Globally Linked Pairs and Cheapest Globally Rigid Supergraphs. - Tibor Jordán; Soma Villányi (SIAM J. Discret. Math., 2025)