Concepedia
Statistics
Publications
43
Citations
1.6K
H-Index
22
Active since
1995
Affiliations
Eötvös Loránd University(Current)
Queen Mary University of London
Centrum Wiskunde & Informatica
Sorbonne Université
Kyoto University
Tibor Jordán is an author at Eötvös Loránd University specializing in graph theory, natural sciences, and graph algorithms.
Publications per year
1995–2022
Connected rigidity matroids and unique realizations of graphs
Bill Jackson, Tibor Jordán · Journal of Combinatorial Theory Series B · 2004 · 405 citations
Natural Sciences, Computer Science, Mathematics +11
A proof of Connelly's conjecture on 3-connected circuits of the rigidity matroid
Tibor Jordán · Journal of Combinatorial Theory Series B · 2003 · 107 citations
Minimal Edge-Coverings of Pairs of Sets
András Frank, Tibor Jordán · Journal of Combinatorial Theory Series B · 1995 · 101 citations
Natural Sciences, Computer Science, Mathematics +10
On the Optimal Vertex-Connectivity Augmentation
Tibor Jordán · Journal of Combinatorial Theory Series B · 1995 · 96 citations
Natural Sciences, Computer Science, Mathematics +8
Independence free graphs and vertex connectivity augmentation
Bill Jackson, Tibor Jordán · Journal of Combinatorial Theory Series B · 2005 · 66 citations
Natural Sciences, Computer Science, Mathematics +7
1–5 of 43