Tibor Jordán

Tibor Jordán

Eötvös Loránd Tudományegyetem

H-index: 29

Europe-Hungary

About Tibor Jordán

Tibor Jordán, With an exceptional h-index of 29 and a recent h-index of 14 (since 2020), a distinguished researcher at Eötvös Loránd Tudományegyetem, specializes in the field of combinatorial optimization, graph theory, combinatorial rigidity.

His recent articles reflect a diverse array of research interests and contributions to the field:

Ear‐decompositions, minimally connected matroids and rigid graphs

Highly connected orientations from edge-disjoint rigid subgraphs

Globally linked pairs and cheapest globally rigid supergraphs

Count and cofactor matroids of highly connected graphs

Globally linked pairs of vertices in generic frameworks

Four-regular graphs with extremal rigidity properties

Rigid block and hole graphs with a single block

Minimally globally rigid graphs

Tibor Jordán Information

University

Position

Professor of mathematics

Citations(all)

3013

Citations(since 2020)

777

Cited By

2615

hIndex(all)

29

hIndex(since 2020)

14

i10Index(all)

72

i10Index(since 2020)

17

Email

University Profile Page

Eötvös Loránd Tudományegyetem

Google Scholar

View Google Scholar Profile

Tibor Jordán Skills & Research Interests

combinatorial optimization

graph theory

combinatorial rigidity

Top articles of Tibor Jordán

Title

Journal

Author(s)

Publication Date

Ear‐decompositions, minimally connected matroids and rigid graphs

Journal of Graph Theory

Tibor Jordán

2024/3

Highly connected orientations from edge-disjoint rigid subgraphs

arXiv preprint arXiv:2401.12670

Dániel Garamvölgyi

Tibor Jordán

Csaba Király

Soma Villányi

2024/1/23

Globally linked pairs and cheapest globally rigid supergraphs

arXiv preprint arXiv:2401.09568

Tibor Jordán

Soma Villányi

2024/1/17

Count and cofactor matroids of highly connected graphs

Journal of Combinatorial Theory, Series B

Dániel Garamvölgyi

Tibor Jordán

Csaba Király

2024/5/1

Globally linked pairs of vertices in generic frameworks

Combinatorica

Tibor Jordán

Soma Villányi

2024/4/8

Four-regular graphs with extremal rigidity properties

Discrete Mathematics

Tibor Jordán

Robin Huang

Henry Simmons

Kaylee Weatherspoon

Zeyu Zheng

2024/4/1

Rigid block and hole graphs with a single block

Discrete Mathematics

Tibor Jordán

2023/3/1

Minimally globally rigid graphs

European Journal of Combinatorics

Dániel Garamvölgyi

Tibor Jordán

2023/2

On generic universal rigidity on the line

arXiv preprint arXiv:2305.14027

Tibor Jordán

Corwin Silverman

2023/5/23

Partial reflections and globally linked pairs in rigid graphs

arXiv preprint arXiv:2305.03412

Dániel Garamvölgyi

Tibor Jordán

2023/5/5

Globally linked pairs in braced maximal outerplanar graphs.

Dániel Garamvölgyi

Tibor Jordán

2022

Globally rigid graphs are fully reconstructible

Forum of Mathematics, Sigma

Dániel Garamvölgyi

Steven J Gortler

Tibor Jordán

2022/1

Rigidity of random subgraphs and eigenvalues of stiffness matrices

SIAM Journal on Discrete Mathematics

Tibor Jordán

Shin-ichi Tanigawa

2022

Extremal families of redundantly rigid graphs in three dimensions

Discrete Applied Mathematics

Tibor Jordán

Christopher Poston

Ryan Roach

2022/12/15

The globally rigid complete bipartite graphs

EGRES Quick-Proofs, QP-2022-02

Tibor Jordán

2022/9/9

Globally rigid powers of graphs

Journal of Combinatorial Theory, Series B

Tibor Jordán

Shin-ichi Tanigawa

2022/7/1

A note on generic rigidity of graphs in higher dimension

Discrete Applied Mathematics

Tibor Jordán

2021/7/15

Minimum size highly redundantly rigid graphs in the plane

Graphs and Combinatorics

Tibor Jordán

2021/7

Graph reconstruction from unlabeled edge lengths

Discrete & Computational Geometry

Dániel Garamvölgyi

Tibor Jordán

2021/2/26

Redundantly globally rigid braced triangulations

Qianfan Chen

Siddhant Jajodia

Tibor Jordán

Kate Perkins

2021/12/8

See List of Professors in Tibor Jordán University(Eötvös Loránd Tudományegyetem)