The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Tibor Jordán: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  53. On the rigidity of molecular graphs. [Citation Graph (, )][DBLP]


  54. Operations preserving the global rigidity of graphs and frameworks in the plane. [Citation Graph (, )][DBLP]


  55. A sufficient connectivity condition for generic rigidity in the plane. [Citation Graph (, )][DBLP]


  56. Pin-Collinear Body-and-Pin Frameworks and the Molecular Conjecture. [Citation Graph (, )][DBLP]


  57. Spanning 2-strong tournaments in 3-strong semicomplete digraphs. [Citation Graph (, )][DBLP]


  58. Brick partitions of graphs. [Citation Graph (, )][DBLP]


  59. The generic rank of body-bar-and-hinge frameworks. [Citation Graph (, )][DBLP]


  60. Rigid tensegrity labelings of graphs. [Citation Graph (, )][DBLP]


Search in 0.005secs, Finished in 0.008secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002