Tibor Jordán

Publication Activity (10 Years)

Years Active: 1991-2024
Publications (10 Years): 23

Top Venues

SIAM J. Discret. Math.

Discret. Appl. Math.

J. Comb. Theory, Ser. B

Discret. Math.

Publications

Dániel Garamvölgyi, Tibor Jordán, Csaba Király
Count and cofactor matroids of highly connected graphs. J. Comb. Theory B 166 (2024)
Tibor Jordán
Ear-decompositions, minimally connected matroids and rigid graphs. J. Graph Theory 105 (3) (2024)
Dániel Garamvölgyi, Tibor Jordán
Partial Reflections and Globally Linked Pairs in Rigid Graphs. SIAM J. Discret. Math. 38 (3) (2024)
Tibor Jordán, Robin Huang, Henry Simmons, Kaylee Weatherspoon, Zeyu Zheng
Four-regular graphs with extremal rigidity properties. Discret. Math. 347 (4) (2024)
Tibor Jordán, Soma Villányi
Globally Linked Pairs of Vertices in Generic Frameworks. Comb. 44 (4) (2024)
Qianfan Chen, Siddhant Jajodia, Tibor Jordán, Kate Perkins
Redundantly globally rigid braced triangulations. Ars Math. Contemp. 24 (1) (2023)
Tibor Jordán
Rigid block and hole graphs with a single block. Discret. Math. 346 (3) (2023)
Dániel Garamvölgyi, Tibor Jordán
Minimally globally rigid graphs. Eur. J. Comb. 108 (2023)
Dániel Garamvölgyi, Tibor Jordán
Globally linked pairs in braced maximal outerplanar graphs. CCCG (2022)
Tibor Jordán, Shin-ichi Tanigawa
Globally rigid powers of graphs. J. Comb. Theory, Ser. B 155 (2022)
Tibor Jordán, Christopher Poston, Ryan Roach
Extremal families of redundantly rigid graphs in three dimensions. Discret. Appl. Math. 322 (2022)
Tibor Jordán, Shin-ichi Tanigawa
Rigidity of Random Subgraphs and Eigenvalues of Stiffness Matrices. SIAM J. Discret. Math. 36 (3) (2022)
Tibor Jordán
Minimum Size Highly Redundantly Rigid Graphs in the Plane. Graphs Comb. 37 (4) (2021)
Dániel Garamvölgyi, Tibor Jordán
Graph Reconstruction from Unlabeled Edge Lengths. Discret. Comput. Geom. 66 (1) (2021)
Tibor Jordán
A note on generic rigidity of graphs in higher dimension. Discret. Appl. Math. 297 (2021)
Dániel Garamvölgyi, Tibor Jordán
Global Rigidity of Unit Ball Graphs. SIAM J. Discret. Math. 34 (1) (2020)
Tibor Jordán, Yusuke Kobayashi, Ryoga Mahara, Kazuhisa Makino
The Steiner Problem for Count Matroids. IWOCA (2020)
Tibor Jordán, Shin-ichi Tanigawa
Global rigidity of triangulations with braces. J. Comb. Theory, Ser. B 136 (2019)
Botond Bertók, Tibor Csendes, Tibor Jordán
Editorial. Central Eur. J. Oper. Res. 27 (2) (2019)
Tibor Jordán, Tamás Kis, Silvano Martello
Computational advances in combinatorial optimization. Discret. Appl. Math. 242 (2018)
Tibor Jordán, Viktória E. Kaszanitzky, Shin-ichi Tanigawa
Gain-Sparsity and Symmetry-Forced Rigidity in the Plane. Discret. Comput. Geom. 55 (2) (2016)
Tibor Jordán, Csaba Király, Shin-ichi Tanigawa
Generic global rigidity of body-hinge frameworks. J. Comb. Theory, Ser. B 117 (2016)
Bill Jackson, Tibor Jordán, Shin-ichi Tanigawa
Unique low rank completability of partially filled matrices. J. Comb. Theory, Ser. B 121 (2016)
Zsolt Fekete, Tibor Jordán, Viktória E. Kaszanitzky
Rigid Two-Dimensional Frameworks with Two Coincident Points. Graphs Comb. 31 (3) (2015)
Tibor Jordán, Viktória E. Kaszanitzky
Sparse hypergraphs with applications in combinatorial rigidity. Discret. Appl. Math. 185 (2015)
Tibor Jordán, Viet Hang Nguyen
On universally rigid frameworks on the line. Contributions Discret. Math. 10 (2) (2015)
Tibor Jordán, Ildikó Schlotter
Parameterized complexity of spare capacity allocation and the multicost Steiner subgraph problem. J. Discrete Algorithms 30 (2015)
Bill Jackson, Tibor Jordán, Shin-ichi Tanigawa
Combinatorial Conditions for the Unique Completability of Low-Rank Matrices. SIAM J. Discret. Math. 28 (4) (2014)
Satoru Iwata, Tibor Jordán
Orientations and detachments of graphs with prescribed degrees and connectivity. Discret. Optim. 12 (2014)
Robert Connelly, Tibor Jordán, Walter Whiteley
Generic global rigidity of body-bar frameworks. J. Comb. Theory, Ser. B 103 (6) (2013)
János Geleji, Tibor Jordán
Robust Tensegrity Polygons. Discret. Comput. Geom. 50 (3) (2013)
Tibor Csendes, Tibor Jordán, Tamás Szántai
Editorial. Central Eur. J. Oper. Res. 21 (4) (2013)
Tibor Jordán, Gábor Domokos, Krisztina Tóth
Geometric Sensitivity of Rigid Graphs. SIAM J. Discret. Math. 27 (4) (2013)
Tibor Jordán, Viktória E. Kaszanitzky
Highly connected rigidity matroids have unique underlying graphs. Eur. J. Comb. 34 (2) (2013)
Bill Jackson, Tibor Jordán, Csaba Király
Strongly rigid tensegrity graphs on the line. Discret. Appl. Math. 161 (7-8) (2013)
Tibor Jordán
Highly connected molecular graphs are rigid in three dimensions. Inf. Process. Lett. 112 (8-9) (2012)
Bill Jackson, Tibor Jordán
Globally rigid circuits of the direction-length rigidity matroid. J. Comb. Theory, Ser. B 100 (1) (2010)
Jørgen Bang-Jensen, Tibor Jordán
Spanning 2-strong tournaments in 3-strong semicomplete digraphs. Discret. Math. 310 (9) (2010)
Bill Jackson, Tibor Jordán
Operations Preserving Global Rigidity of Generic Direction-Length Frameworks. Int. J. Comput. Geom. Appl. 20 (6) (2010)
Bill Jackson, Tibor Jordán
Brick partitions of graphs. Discret. Math. 310 (2) (2010)
Tibor Jordán
Generically globally rigid zeolites in the plane. Inf. Process. Lett. 110 (18-19) (2010)
Bill Jackson, Tibor Jordán
The generic rank of body-bar-and-hinge frameworks. Eur. J. Comb. 31 (2) (2010)
Tibor Jordán, András Recski, Zoltan Szabadka
Rigid tensegrity labelings of graphs. Eur. J. Comb. 30 (8) (2009)
Tibor Jordán, Zoltan Szabadka
Operations preserving the global rigidity of graphs and frameworks in the plane. Comput. Geom. 42 (6-7) (2009)
Bill Jackson, Tibor Jordán
A sufficient connectivity condition for generic rigidity in the plane. Discret. Appl. Math. 157 (8) (2009)
Jørgen Bang-Jensen, Tibor Jordán
On persistent directed graphs. Networks 52 (4) (2008)
Bill Jackson, Tibor Jordán
Pin-Collinear Body-and-Pin Frameworks and the Molecular Conjecture. Discret. Comput. Geom. 40 (2) (2008)
Bill Jackson, Tibor Jordán
On the rigidity of molecular graphs. Comb. 28 (6) (2008)
Bill Jackson, Tibor Jordán
Rigid Components in Molecular Graphs. Algorithmica 48 (4) (2007)
Zsolt Fekete, Tibor Jordán
Uniquely Localizable Networks with Few Anchors. ALGOSENSORS (2006)
Bill Jackson, Tibor Jordán
On the Rank Function of the 3-dimensional Rigidity Matroid. Int. J. Comput. Geom. Appl. 16 (5-6) (2006)
Bill Jackson, Tibor Jordán, Zoltan Szabadka
Globally Linked Pairs of Vertices in Equivalent Realizations of Graphs. Discret. Comput. Geom. 35 (3) (2006)
Alex R. Berg, Tibor Jordán
Two-connected orientations of Eulerian graphs. J. Graph Theory 52 (3) (2006)
Tibor Jordán
A characterization of weakly four-connected graphs. J. Graph Theory 52 (3) (2006)
Bill Jackson, Tibor Jordán
Connected rigidity matroids and unique realizations of graphs. J. Comb. Theory, Ser. B 94 (1) (2005)
Alex R. Berg, Tibor Jordán
-connected graphs. Oper. Res. Lett. 33 (2) (2005)
Alex R. Berg, Tibor Jordán
-Edge-Connected Directed Graphs of Maximal Size. Graphs Comb. 21 (1) (2005)
Zsolt Fekete, Tibor Jordán
Rigid realizations of graphs on small grids. Comput. Geom. 32 (3) (2005)
Bill Jackson, Tibor Jordán
Rigid Two-Dimensional Frameworks with Three Collinear Points. Graphs Comb. 21 (4) (2005)
Tibor Jordán
edge-disjoint 2-connected spanning subgraphs. J. Comb. Theory, Ser. B 95 (2) (2005)
Bill Jackson, Tibor Jordán
-dimensional rigidity matroid of sparse graphs. J. Comb. Theory, Ser. B 95 (1) (2005)
Bill Jackson, Tibor Jordán
Independence free graphs and vertex connectivity augmentation. J. Comb. Theory, Ser. B 94 (1) (2005)
Bill Jackson, Tibor Jordán
The Dress conjectures on rank in the 3-dimensional rigidity matroid. Adv. Appl. Math. 35 (4) (2005)
Jørgen Bang-Jensen, Tibor Jordán
Splitting off edges between two subsets preserving the edge-connectivity of the graph. Discret. Math. 276 (1-3) (2004)
Zsolt Fekete, Tibor Jordán, Walter Whiteley
An Inductive Construction for Plane Laman Graphs via Vertex Splitting. ESA (2004)
Alex R. Berg, Bill Jackson, Tibor Jordán
Edge splitting and connectivity augmentation in directed hypergraphs. Discret. Math. 273 (1-3) (2003)
Tibor Jordán
Constrained Edge-Splitting Problems. SIAM J. Discret. Math. 17 (1) (2003)
Alex R. Berg, Tibor Jordán
A proof of Connelly's conjecture on 3-connected circuits of the rigidity matroid. J. Comb. Theory, Ser. B 88 (1) (2003)
Tibor Jordán, Zoltán Szigeti
Detachments Preserving Local Edge-Connectivity of Graphs. SIAM J. Discret. Math. 17 (1) (2003)
Alex R. Berg, Bill Jackson, Tibor Jordán
Highly edge-connected detachments of graphs and digraphs. J. Graph Theory 43 (1) (2003)
Bill Jackson, Tibor Jordán
Non-separable detachments of graphs. J. Comb. Theory, Ser. B 87 (1) (2003)
Alex R. Berg, Tibor Jordán
Algorithms for Graph Rigidity and Scene Analysis. ESA (2003)
Tibor Jordán
On minimally k-edge-connected graphs and shortest k-edge-connected Steiner networks. Discret. Appl. Math. 131 (2) (2003)
Hiroshi Nagamochi, Tibor Jordán, Yoshitaka Nakao, Toshihide Ibaraki
Convex Embeddings and Bisections of 3-Connected Graphs 1. Comb. 22 (4) (2002)
Tibor Jordán, Alessandro Panconesi
Preface. Random Struct. Algorithms 20 (3) (2002)
Joseph Cheriyan, Tibor Jordán, Zeev Nutov
On Rooted Node-Connectivity Problems. Algorithmica 30 (3) (2001)
Bill Jackson, Tibor Jordán
Independence Free Graphs and Vertex Connectivity Augmentation. IPCO (2001)
Bill Jackson, Tibor Jordán
Non-Separable Detachments of Graphs. Electron. Notes Discret. Math. 10 (2001)
András Frank, Tibor Jordán, Zoltán Szigeti
Combinatorial problems related to origin-destination matrices. Discret. Appl. Math. 115 (1-3) (2001)
Harold N. Gabow, Tibor Jordán
Bipartition constrained edge-splitting in directed graphs. Discret. Appl. Math. 115 (1-3) (2001)
Jørgen Bang-Jensen, Tibor Jordán
Splitting Off Edges within a Specified Subset Preserving the Edge-Connectivity of the Graph. J. Algorithms 37 (2) (2000)
Harold N. Gabow, Tibor Jordán
How to Make a Square Grid Framework with Cables Rigid. SIAM J. Comput. 30 (2) (2000)
Bill Jackson, Tibor Jordán
Connectivity Augmentation of Graphs. Electron. Notes Discret. Math. 5 (2000)
Bill Jackson, Tibor Jordán
A Near Optimal Algorithm for Vertex Connectivity Augmentation. ISAAC (2000)
Harold N. Gabow, Tibor Jordán
Incrementing Bipartite Digraph Edge-Connectivity. J. Comb. Optim. 4 (4) (2000)
Tibor Jordán
On the number of shredders. J. Graph Theory 31 (3) (1999)
Harold N. Gabow, Tibor Jordán
How to Make a Square Grid Framework with Cables Rigid. SODA (1999)
Jørgen Bang-Jensen, Harold N. Gabow, Tibor Jordán, Zoltán Szigeti
Edge-Connectivity Augmentation with Partition Constraints. SIAM J. Discret. Math. 12 (2) (1999)
Eddie Cheng, Tibor Jordán
Successive edge-connectivity augmentation problems. Math. Program. 84 (3) (1999)
András Frank, Tibor Jordán, Zoltán Szigeti
An Orientation Theorem with Parity Conditions. IPCO (1999)
Ervin Györi, Tibor Jordán
How to make a graph four-connected. Math. Program. 84 (3) (1999)
András Frank, Tibor Jordán
Directed vertex-connectivity augmentation. Math. Program. 84 (3) (1999)
Tibor Jordán
Extremal graphs in connectivity augmentation. J. Graph Theory 31 (3) (1999)
Hiroshi Nagamochi, Tibor Jordán, Yoshitaka Nakao, Toshihide Ibaraki
Bisecting Two Subsets in 3-Connected Graphs. ISAAC (1999)
Tibor Jordán
Edge-Splitting Problems with Demands. IPCO (1999)
Joseph Cheriyan, Tibor Jordán, R. Ravi
On 2-Coverings and 2-Packings of Laminar Families. ESA (1999)
Tamás Fleiner, Tibor Jordán
Coverings and structure of crossing families. Math. Program. 84 (3) (1999)
Jørgen Bang-Jensen, Tibor Jordán
Adding and Reversing Arcs in Semicomplete Digraphs. Comb. Probab. Comput. 7 (1) (1998)
Jørgen Bang-Jensen, Tibor Jordán
Edge-Connectivity Augmentation Preserving Simplicity. SIAM J. Discret. Math. 11 (4) (1998)
Jørgen Bang-Jensen, Harold N. Gabow, Tibor Jordán, Zoltán Szigeti
Edge-Connectivity Augmentation with Partition Constraints. SODA (1998)

Tibor Jordán.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Tibor Jordán