![]() | ![]() |
2006 | ||
---|---|---|
6 | EE | Alex R. Berg, Tibor Jordán: Two-connected orientations of Eulerian graphs. Journal of Graph Theory 52(3): 230-242 (2006) |
2005 | ||
5 | EE | Alex R. Berg, Tibor Jordán: Minimally k-Edge-Connected Directed Graphs of Maximal Size. Graphs and Combinatorics 21(1): 39-50 (2005) |
4 | EE | Alex R. Berg, Tibor Jordán: Sparse certificates and removable cycles in l-mixed p-connected graphs. Oper. Res. Lett. 33(2): 111-114 (2005) |
2003 | ||
3 | EE | Alex R. Berg, Tibor Jordán: Algorithms for Graph Rigidity and Scene Analysis. ESA 2003: 78-89 |
2 | EE | Alex R. Berg, Bill Jackson, Tibor Jordán: Edge splitting and connectivity augmentation in directed hypergraphs. Discrete Mathematics 273(1-3): 71-84 (2003) |
1 | EE | Alex R. Berg, Tibor Jordán: A proof of Connelly's conjecture on 3-connected circuits of the rigidity matroid. J. Comb. Theory, Ser. B 88(1): 77-97 (2003) |
1 | Bill Jackson | [2] |
2 | Tibor Jordán | [1] [2] [3] [4] [5] [6] |