Connected rigidity matroids and unique realizations of graphs B Jackson, T Jordán Journal of Combinatorial Theory, Series B 94 (1), 1-29, 2005 | 479 | 2005 |

Minimal edge-coverings of pairs of sets A Frank, T Jordán Journal of Combinatorial Theory, Series B 65 (1), 73-110, 1995 | 185 | 1995 |

Algorithms for graph rigidity and scene analysis AR Berg, T Jordán Algorithms-ESA 2003: 11th Annual European Symposium, Budapest, Hungary …, 2003 | 133 | 2003 |

A proof of Connelly's conjecture on 3-connected circuits of the rigidity matroid AR Berg, T Jordán Journal of Combinatorial Theory, Series B 88 (1), 77-97, 2003 | 121 | 2003 |

On the optimal vertex-connectivity augmentation T Jordán Journal of Combinatorial Theory, Series B 63 (1), 8-20, 1995 | 118 | 1995 |

Globally linked pairs of vertices in equivalent realizations of graphs B Jackson, T Jordán, Z Szabadka Discrete & Computational Geometry 35, 493-512, 2006 | 83 | 2006 |

On 2-coverings and 2-packings of laminar families J Cheriyan, T Jordán, R Ravi Algorithms-ESA’99: 7th Annual European Symposium Prague, Czech Republic …, 1999 | 83 | 1999 |

Independence free graphs and vertex connectivity augmentation B Jackson, T Jordán Journal of Combinatorial Theory, Series B 94 (1), 31-77, 2005 | 76 | 2005 |

Edge-connectivity augmentation with partition constraints J Bang-Jensen, HN Gabow, T Jordán, Z Szigeti SIAM Journal on Discrete Mathematics 12 (2), 160-207, 1999 | 70 | 1999 |

II–Combinatorial Rigidity: Graphs and Matroids in the Theory of Rigid Frameworks T Jordán Discrete geometric analysis 34, 33-113, 2016 | 55 | 2016 |

Graph theoretic techniques in the analysis of uniquely localizable sensor networks B Jackson, T Jordán Localization Algorithms and Strategies for Wireless Sensor Networks …, 2009 | 49 | 2009 |

Generic global rigidity of body–bar frameworks R Connelly, T Jordán, W Whiteley Journal of Combinatorial Theory, Series B 103 (6), 689-705, 2013 | 47 | 2013 |

On rooted node-connectivity problems J Cheriyan, T Jordán, Z Nutov Algorithmica 30, 353-375, 2001 | 43 | 2001 |

A near optimal algorithm for vertex connectivity augmentation B Jackson, T Jordán International Symposium on Algorithms and Computation, 313-325, 2000 | 40 | 2000 |

A note on the vertex-connectivity augmentation problem T Jordán Journal of Combinatorial Theory, Series B 71 (2), 294-301, 1997 | 40 | 1997 |

Operations preserving the global rigidity of graphs and frameworks in the plane T Jordán, Z Szabadka Computational Geometry 42 (6-7), 511-521, 2009 | 39 | 2009 |

Edge-connectivity augmentation preserving simplicity J Bang-Jensen, T Jordán SIAM Journal on Discrete Mathematics 11 (4), 603-623, 1998 | 39 | 1998 |

A sufficient connectivity condition for generic rigidity in the plane B Jackson, T Jordán Discrete Applied Mathematics 157 (8), 1965-1968, 2009 | 38 | 2009 |

Global rigidity T Jordán, W Whiteley Handbook of Discrete and Computational Geometry, 1661-1694, 2017 | 37 | 2017 |

Generic global rigidity of body-hinge frameworks T Jordán, C Király, S Tanigawa Journal of Combinatorial Theory, Series B 117, 59-76, 2016 | 37 | 2016 |