| 2020 | IWOCA | The Steiner Problem for Count Matroids. | Tibor Jordn, Yusuke Kobayashi, Ryoga Mahara, Kazuhisa Makino |
| 2006 | Algosensors | Uniquely Localizable Networks with Few Anchors. | Zsolt Fekete, Tibor Jordn |
| 2004 | ESA | An Inductive Construction for Plane Laman Graphs via Vertex Splitting. | Zsolt Fekete, Tibor Jordn, Walter Whiteley |
| 2003 | ESA | Algorithms for Graph Rigidity and Scene Analysis. | Alex R. Berg, Tibor Jordn |
| 2001 | IPCO | Independence Free Graphs and Vertex Connectivity Augmentation. | Bill Jackson, Tibor Jordn |
| 2000 | ISAAC | A Near Optimal Algorithm for Vertex Connectivity Augmentation. | Bill Jackson, Tibor Jordn |
| 1999 | ESA | On 2-Coverings and 2-Packings of Laminar Families. | Joseph Cheriyan, Tibor Jordn, R. Ravi |
| 1999 | IPCO | An Orientation Theorem with Parity Conditions. | Andrs Frank, Tibor Jordn, Zoltn Szigeti |
| 1999 | IPCO | Edge-Splitting Problems with Demands. | Tibor Jordn |
| 1999 | ISAAC | Bisecting Two Subsets in 3-Connected Graphs. | Hiroshi Nagamochi, Tibor Jordn, Yoshitaka Nakao, Toshihide Ibaraki |
| 1999 | SODA | How to Make a Square Grid Framework with Cables Rigid. | Harold N. Gabow, Tibor Jordn |
| 1998 | SODA | Edge-Connectivity Augmentation with Partition Constraints. | Jrgen Bang-Jensen, Harold N. Gabow, Tibor Jordn, Zoltn Szigeti |
| 1997 | FOCS | Edge-Connectivity Augmentation Preserving Simplicity. | Jrgen Bang-Jensen, Tibor Jordn |
| 1995 | IPCO | How to Make a Strongly Connected Digraph Two-Connected. | Andrs Frank, Tibor Jordn |
| 1993 | ESA | Incresing the Vertex-Connectivity in Directed Graphs. | Tibor Jordn |
| 1993 | IPCO | Optimal and almost optimal algorithms for connectivity augmentation problems. | Tibor Jordn |