Tibor Jordán
professor, member
Address: | Department of Operations Research |
| Eötvös Loránd University |
| 1117 Budapest |
| Pázmány Péter sétány, 1/C, 3-504 |
Tel: | (+36-1) 372-2500/8579 |
Email: | jordan_at_cs.elte.hu |
Home page: | |
Publication list: | jordanpub.pdf |
|
|
Interests
- graph theory
- combinatorial rigidity
- graph algorithms
- combinatorial optimization
List of EGRES technical reports
- Highly connected orientations from edge-disjoint rigid subgraphs (Dániel Garamvölgyi, Tibor Jordán, Csaba Király, Soma Villányi)
- Globally linked pairs and cheapest globally rigid supergraphs (Tibor Jordán, Soma Villányi)
- Globally linked pairs of vertices in generic frameworks (Tibor Jordán, Soma Villányi)
- On generic universal rigidity on the line (Guilherme Zeus Dantas e Moura, Tibor Jordán, Corwin Silverman)
- Partial reflections and globally linked pairs in rigid graphs (Dániel Garamvölgyi, Tibor Jordán)
- Four-regular graphs with extremal rigidity properties (Tibor Jordán, Robin Huang, Henry Simmons, Kaylee Weatherspoon, Zeyu Zheng)
- Count and cofactor matroids of highly connected graphs (Dániel Garamvölgyi, Tibor Jordán, Csaba Király)
- Ear-decompositions, minimally connected matroids, and rigid graphs (Tibor Jordán)
- Minimally globally rigid graphs (Dániel Garamvölgyi, Tibor Jordán)
- Redundantly globally rigid braced triangulations (Qianfan Chen, Siddhant Jajodia, Tibor Jordán, Kate Perkins)
- Rigid block and hole graphs with a single block (Tibor Jordán)
- Globally rigid powers of graphs (Tibor Jordán, Shin-ichi Tanigawa)
- Globally rigid graphs are fully reconstructible (Dániel Garamvölgyi, Steven J. Gortler, Tibor Jordán)
- Extremal families of redundantly rigid graphs in three dimensions (Tibor Jordán, Christopher Poston, Ryan Roach)
- Minimum size highly redundantly rigid graphs in the plane (Tibor Jordán)
- Rigidity of Random Subgraphs and Eigenvalues of Stiffness Matrices (Tibor Jordán, Shin-ichi Tanigawa)
- The Steiner problem for count matroids (Tibor Jordán, Yusuke Kobayashi, Ryoga Mahara, Kazuhisa Makino)
- A note on generic rigidity of graphs in higher dimension (Tibor Jordán)
- On the vertex splitting operation in globally rigid body-hinge graphs (Tibor Jordán, Csaba Király, Shin-ichi Tanigawa)
- Compressed frameworks and compressible graphs (Tibor Jordán, Jialin Zhang)
- Graph reconstruction from unlabeled edge lengths (Dániel Garamvölgyi, Tibor Jordán)
- Minimum Cost Globally Rigid Subgraphs (Tibor Jordán, András Mihálykó)
- Global Rigidity of Unit Ball Graphs (Dániel Garamvölgyi, Tibor Jordán)
- Global Rigidity of Triangulations with Braces (Tibor Jordán, Shin-ichi Tanigawa)
- Unique low rank completability of partially filled matrices (Bill Jackson, Tibor Jordán, Shin-ichi Tanigawa)
- Combinatorial rigidity: graphs and matroids in the theory of rigid frameworks (Tibor Jordán)
- Generic global rigidity of body-hinge frameworks (Tibor Jordán, Csaba Király, Shin-ichi Tanigawa)
- Henneberg moves on mechanisms (Bill Jackson, Tibor Jordán, Brigitte Servatius, Herman Servatius)
- Combinatorial Conditions for the Unique Completability of Low Rank Matrices (Bill Jackson, Tibor Jordán, Shin-ichi Tanigawa)
- Sparse hypergraphs with applications in combinatorial rigidity (Tibor Jordán, Viktória Kaszanitzky)
- Orientations and Detachments of Graphs with Prescribed Degrees and Connectivity (Satoru Iwata, Tibor Jordán)
- Globally linked pairs of vertices in rigid frameworks (Bill Jackson, Tibor Jordán, Zoltán Szabadka)
- Gain-sparsity and Symmetry-forced Rigidity in the Plane (Tibor Jordán, Viktória Kaszanitzky, Shin-ichi Tanigawa)
- Parameterized Complexity of Spare Capacity Allocation and the Multicost Steiner Subgraph Problem (Tibor Jordán, Ildikó Schlotter)
- Robust tensegrity polygons (János Geleji, Tibor Jordán)
- Minimax Theorems in Graph Connectivity Augmentation (Tibor Jordán)
- On universally rigid frameworks on the line (Tibor Jordán, Viet-Hang Nguyen)
- Rigid two-dimensional frameworks with two coincident points (Zsolt Fekete, Tibor Jordán, Viktória Kaszanitzky)
- Strongly Rigid Tensegrity Graphs on the Line (Bill Jackson, Tibor Jordán, Csaba Király)
- Geometric Sensitivity of Rigid Graphs (Tibor Jordán, Gábor Domokos, Krisztina Tóth)
- Highly connected molecular graphs are rigid in three dimensions (Tibor Jordán)
- Highly connected rigidity matroids have unique underlying graphs (Tibor Jordán, Viktória Kaszanitzky)
- Generic global rigidity of body-bar frameworks (Robert Connelly, Tibor Jordán, Walter Whiteley)
- Inductive Constructions in the Analysis of Two-Dimensional Rigid Structures (Bill Jackson, Tibor Jordán)
- Generically globally rigid zeolites in the plane (Tibor Jordán)
- Rigid and Globally Rigid Graphs with Pinned Vertices (Tibor Jordán)
- Globally Rigid Circuits of the Direction-Length Rigidity Matroid (Bill Jackson, Tibor Jordán)
- Operations Preserving Global Rigidity of Generic Direction-Length Frameworks (Bill Jackson, Tibor Jordán)
- A sufficient connectivity condition for generic rigidity in the plane (Bill Jackson, Tibor Jordán)
- Rigid Tensegrity Labellings of Graphs (Tibor Jordán, András Recski, Zoltán Szabadka)
- The generic rank of body-bar-and-hinge frameworks (Bill Jackson, Tibor Jordán)
- Brick Partitions of Graphs (Bill Jackson, Tibor Jordán)
- Operations preserving the global rigidity of graphs and frameworks in the plane (Tibor Jordán, Zoltán Szabadka)
- Uniquely localizable networks with few anchors (Zsolt Fekete, Tibor Jordán)
- Pin-collinear Body-and-Pin Frameworks and the Molecular Conjecture (Bill Jackson, Tibor Jordán)
- Rigid components in molecular graphs (Bill Jackson, Tibor Jordán)
- Rank and independence in the rigidity matroid of molecular graphs (Bill Jackson, Tibor Jordán)
- On the rank function of the 3-dimensional rigidity matroid (Bill Jackson, Tibor Jordán)
- Globally linked pairs of vertices in equivalent realizations of graphs (Bill Jackson, Tibor Jordán, Zoltán Szabadka)
- Rigid realizations of graphs on small grids (Zsolt Fekete, Tibor Jordán)
- On the existence of k edge-disjoint 2-connected spanning subgraphs (Tibor Jordán)
- Sparse certificates and removable cycles in l-mixed p-connected graphs (Alex Berg, Tibor Jordán)
- Two-connected orientations of Eulerian graphs (Alex Berg, Tibor Jordán)
- Rigid two-dimensional frameworks with three collinear points (Bill Jackson, Tibor Jordán)
- A characterisation of weakly four-connected graphs (Tibor Jordán)
- The d-dimensional rigidity matroid of sparse graphs (Bill Jackson, Tibor Jordán)
- The Dress conjectures on rank in the 3-dimensional rigidity matroid (Bill Jackson, Tibor Jordán)
- Connected rigidity matroids and unique realizations of graphs (Bill Jackson, Tibor Jordán)
- Minimally k-edge-connected directed graphs of maximal size (Alex Berg, Tibor Jordán)
- Edge splitting and connectivity augmentation in directed hypergraphs (Alex Berg, Bill Jackson, Tibor Jordán)
- Highly edge-connected detachments of graphs and digraphs (Alex Berg, Bill Jackson, Tibor Jordán)
- Non-separable detachments of graphs (Bill Jackson, Tibor Jordán)
- A proof of Connelly's conjecture on 3-connected generic cycles (Alex Berg, Tibor Jordán)
- Independence free graphs and vertex connectivity augmentation (Bill Jackson, Tibor Jordán)
List of EGRES quick proofs
Last modification: 25.4.2024. Please email your comments to Tamás Király!
|