dblp.uni-trier.dewww.uni-trier.de

Tibor Jordán Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

*2009
57EEBill Jackson, Tibor Jordán: A sufficient connectivity condition for generic rigidity in the plane. Discrete Applied Mathematics 157(8): 1965-1968 (2009)
2008
56EEBill Jackson, Tibor Jordán: Pin-Collinear Body-and-Pin Frameworks and the Molecular Conjecture. Discrete & Computational Geometry 40(2): 258-278 (2008)
55EEJørgen Bang-Jensen, Tibor Jordán: On persistent directed graphs. Networks 52(4): 271-276 (2008)
2007
54EEBill Jackson, Tibor Jordán: Rigid Components in Molecular Graphs. Algorithmica 48(4): 399-412 (2007)
2006
53EEZsolt Fekete, Tibor Jordán: Uniquely Localizable Networks with Few Anchors. ALGOSENSORS 2006: 176-183
52EEBill Jackson, Tibor Jordán, Zoltan Szabadka: Globally Linked Pairs of Vertices in Equivalent Realizations of Graphs. Discrete & Computational Geometry 35(3): 493-512 (2006)
51EEBill Jackson, Tibor Jordán: On the Rank Function of the 3-dimensional Rigidity Matroid. Int. J. Comput. Geometry Appl. 16(5-6): 415-430 (2006)
50EETibor Jordán: A characterization of weakly four-connected graphs. Journal of Graph Theory 52(3): 217-229 (2006)
49EEAlex R. Berg, Tibor Jordán: Two-connected orientations of Eulerian graphs. Journal of Graph Theory 52(3): 230-242 (2006)
2005
48EEZsolt Fekete, Tibor Jordán: Rigid realizations of graphs on small grids. Comput. Geom. 32(3): 216-222 (2005)
47EEAlex R. Berg, Tibor Jordán: Minimally k-Edge-Connected Directed Graphs of Maximal Size. Graphs and Combinatorics 21(1): 39-50 (2005)
46EEBill Jackson, Tibor Jordán: Rigid Two-Dimensional Frameworks with Three Collinear Points. Graphs and Combinatorics 21(4): 427-444 (2005)
45EEBill Jackson, Tibor Jordán: Connected rigidity matroids and unique realizations of graphs. J. Comb. Theory, Ser. B 94(1): 1-29 (2005)
44EEBill Jackson, Tibor Jordán: Independence free graphs and vertex connectivity augmentation. J. Comb. Theory, Ser. B 94(1): 31-77 (2005)
43EEBill Jackson, Tibor Jordán: The d-dimensional rigidity matroid of sparse graphs. J. Comb. Theory, Ser. B 95(1): 118-133 (2005)
42EETibor Jordán: On the existence of k edge-disjoint 2-connected spanning subgraphs. J. Comb. Theory, Ser. B 95(2): 257-262 (2005)
41EEAlex R. Berg, Tibor Jordán: Sparse certificates and removable cycles in l-mixed p-connected graphs. Oper. Res. Lett. 33(2): 111-114 (2005)
2004
40EEZsolt Fekete, Tibor Jordán, Walter Whiteley: An Inductive Construction for Plane Laman Graphs via Vertex Splitting. ESA 2004: 299-310
39EEJørgen Bang-Jensen, Tibor Jordán: Splitting off edges between two subsets preserving the edge-connectivity of the graph. Discrete Mathematics 276(1-3): 5-28 (2004)
2003
38EEAlex R. Berg, Tibor Jordán: Algorithms for Graph Rigidity and Scene Analysis. ESA 2003: 78-89
37EETibor Jordán: On minimally k-edge-connected graphs and shortest k-edge-connected Steiner networks. Discrete Applied Mathematics 131(2): 421-432 (2003)
36EEAlex R. Berg, Bill Jackson, Tibor Jordán: Edge splitting and connectivity augmentation in directed hypergraphs. Discrete Mathematics 273(1-3): 71-84 (2003)
35EEBill Jackson, Tibor Jordán: Non-separable detachments of graphs. J. Comb. Theory, Ser. B 87(1): 17-37 (2003)
34EEAlex 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)
33EETibor Jordán, Zoltán Szigeti: Detachments Preserving Local Edge-Connectivity of Graphs. SIAM J. Discrete Math. 17(1): 72-87 (2003)
32EETibor Jordán: Constrained Edge-Splitting Problems. SIAM J. Discrete Math. 17(1): 88-102 (2003)
2002
31EEHiroshi Nagamochi, Tibor Jordán, Yoshitaka Nakao, Toshihide Ibaraki: Convex Embeddings and Bisections of 3-Connected Graphs 1. Combinatorica 22(4): 537-554 (2002)
30EETibor Jordán, Alessandro Panconesi: Preface. Random Struct. Algorithms 20(3): 261 (2002)
2001
29EEBill Jackson, Tibor Jordán: Independence Free Graphs and Vertex Connectivity Augmentation. IPCO 2001: 264-279
28EEJoseph Cheriyan, Tibor Jordán, Zeev Nutov: On Rooted Node-Connectivity Problems. Algorithmica 30(3): 353-375 (2001)
27 András Frank, Tibor Jordán, Zoltán Szigeti: Combinatorial problems related to origin-destination matrices. Discrete Applied Mathematics 115(1-3): 37-47 (2001)
26 Harold N. Gabow, Tibor Jordán: Bipartition constrained edge-splitting in directed graphs. Discrete Applied Mathematics 115(1-3): 49-62 (2001)
25EEBill Jackson, Tibor Jordán: Non-Separable Detachments of Graphs. Electronic Notes in Discrete Mathematics 10: 151-153 (2001)
2000
24EEBill Jackson, Tibor Jordán: A Near Optimal Algorithm for Vertex Connectivity Augmentation. ISAAC 2000: 312-325
23EEBill Jackson, Tibor Jordán: Connectivity Augmentation of Graphs. Electronic Notes in Discrete Mathematics 5: 185-188 (2000)
22 Jørgen Bang-Jensen, Tibor Jordán: Splitting Off Edges within a Specified Subset Preserving the Edge-Connectivity of the Graph. J. Algorithms 37(2): 326-343 (2000)
21 Harold N. Gabow, Tibor Jordán: Incrementing Bipartite Digraph Edge-Connectivity. J. Comb. Optim. 4(4): 449-486 (2000)
20 Harold N. Gabow, Tibor Jordán: How to Make a Square Grid Framework with Cables Rigid. SIAM J. Comput. 30(2): 649-680 (2000)
1999
19EEJoseph Cheriyan, Tibor Jordán, R. Ravi: On 2-Coverings and 2-Packings of Laminar Families. ESA 1999: 510-520
18EEAndrás Frank, Tibor Jordán, Zoltán Szigeti: An Orientation Theorem with Parity Conditions. IPCO 1999: 183-190
17EETibor Jordán: Edge-Splitting Problems with Demands. IPCO 1999: 273-288
16EEHiroshi Nagamochi, Tibor Jordán, Yoshitaka Nakao, Toshihide Ibaraki: Bisecting Two Subsets in 3-Connected Graphs. ISAAC 1999: 425-434
15EEHarold N. Gabow, Tibor Jordán: How to Make a Square Grid Framework with Cables Rigid. SODA 1999: 356-365
14EEJørgen Bang-Jensen, Harold N. Gabow, Tibor Jordán, Zoltán Szigeti: Edge-Connectivity Augmentation with Partition Constraints. SIAM J. Discrete Math. 12(2): 160-207 (1999)
1998
13EEJoseph Cheriyan, Tibor Jordán, Zeev Nutov: Approximating k-outconnected Subgraph Problems. APPROX 1998: 77-88
12 Jørgen Bang-Jensen, Harold N. Gabow, Tibor Jordán, Zoltán Szigeti: Edge-Connectivity Augmentation with Partition Constraints. SODA 1998: 306-315
11 Jørgen Bang-Jensen, Tibor Jordán: Adding and Reversing Arcs in Semicomplete Digraphs. Combinatorics, Probability & Computing 7(1): 17-25 (1998)
10EETibor Jordán: On the existence of (k, l)-critical graphs. Discrete Mathematics 179(1-3): 273-275 (1998)
9EEJørgen Bang-Jensen, Tibor Jordán: Edge-Connectivity Augmentation Preserving Simplicity. SIAM J. Discrete Math. 11(4): 603-623 (1998)
1997
8EEJørgen Bang-Jensen, Tibor Jordán: Edge-Connectivity Augmentation Preserving Simplicity. FOCS 1997: 486-495
7EETibor Jordán: A Note on the Vertex-Connectivity Augmentation Problem. J. Comb. Theory, Ser. B 71(2): 294-301 (1997)
1995
6EEAndrás Frank, Tibor Jordán: How to Make a Strongly Connected Digraph Two-Connected. IPCO 1995: 414-425
5EETibor Jordán: On the Optimal Vertex-Connectivity Augmentation. J. Comb. Theory, Ser. B 63(1): 8-20 (1995)
4EEAndrás Frank, Tibor Jordán: Minimal Edge-Coverings of Pairs of Sets. J. Comb. Theory, Ser. B 65(1): 73-110 (1995)
1993
3EETibor Jordán: Incresing the Vertex-Connectivity in Directed Graphs. ESA 1993: 236-247
2 Tibor Jordán: Optimal and almost optimal algorithms for connectivity augmentation problems. IPCO 1993: 75-88
1991
1 András Frank, Tibor Jordán: Tree-representation of directed circuits. Graph Structure Theory 1991: 195-202

Coauthor Index

1Jørgen Bang-Jensen [8] [9] [11] [12] [14] [22] [39] [55]
2Alex R. Berg [34] [36] [38] [41] [47] [49]
3Joseph Cheriyan [13] [19] [28]
4Zsolt Fekete [40] [48] [53]
5András Frank [1] [4] [6] [18] [27]
6Harold N. Gabow [12] [14] [15] [20] [21] [26]
7Toshihide Ibaraki [16] [31]
8Bill Jackson [23] [24] [25] [29] [35] [36] [43] [44] [45] [46] [51] [52] [54] [56] [57]
9Hiroshi Nagamochi [16] [31]
10Yoshitaka Nakao [16] [31]
11Zeev Nutov [13] [28]
12Alessandro Panconesi [30]
13R. Ravi [19]
14Zoltan Szabadka [52]
15Zoltán Szigeti [12] [14] [18] [27] [33]
16Walter Whiteley [40]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)