Algorithms for Graph Rigidity and Scene Analysis. - Alex R. Berg; Tibor Jordán (ESA, 2003)

Edge splitting and connectivity augmentation in directed hypergraphs. - Alex R. Berg; Bill Jackson; Tibor Jordán (Discret. Math., 2003)

A proof of Connelly's conjecture on 3-connected circuits of the rigidity matroid. - Alex R. Berg; Tibor Jordán (J. Comb. Theory B, 2003)

Highly edge-connected detachments of graphs and digraphs. - Alex R. Berg; Bill Jackson; Tibor Jordán (J. Graph Theory, 2003)

Minimally k-Edge-Connected Directed Graphs of Maximal Size. - Alex R. Berg; Tibor Jordán (Graphs Comb., 2005)

Sparse certificates and removable cycles in l-mixed p-connected graphs. - Alex R. Berg; Tibor Jordán (Oper. Res. Lett., 2005)

Two-connected orientations of Eulerian graphs. - Alex R. Berg; Tibor Jordán (J. Graph Theory, 2006)