Tibor Jordán

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