default search action
Tibor Jordán
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j91]Tibor Jordán, Soma Villányi:
Globally Linked Pairs of Vertices in Generic Frameworks. Comb. 44(4): 817-838 (2024) - [j90]Tibor Jordán, Robin Huang, Henry Simmons
, Kaylee Weatherspoon, Zeyu Zheng:
Four-regular graphs with extremal rigidity properties. Discret. Math. 347(4): 113833 (2024) - [j89]Dániel Garamvölgyi
Count and cofactor matroids of highly connected graphs. J. Comb. Theory B 166: 1-29 (2024) - [j88]Tibor Jordán:
Ear-decompositions, minimally connected matroids and rigid graphs. J. Graph Theory 105(3): 451-467 (2024) - [j87]Dániel Garamvölgyi, Tibor Jordán:
Partial Reflections and Globally Linked Pairs in Rigid Graphs. SIAM J. Discret. Math. 38(3): 2005-2040 (2024) - 2023
- [j86]Qianfan Chen, Siddhant Jajodia, Tibor Jordán, Kate Perkins:
Redundantly globally rigid braced triangulations. Ars Math. Contemp. 24(1): 1 (2023) - [j85]Tibor Jordán:
Rigid block and hole graphs with a single block. Discret. Math. 346(3): 113268 (2023) - [j84]Dániel Garamvölgyi
Minimally globally rigid graphs. Eur. J. Comb. 108: 103626 (2023) - 2022
- [j83]Tibor Jordán, Christopher Poston
Extremal families of redundantly rigid graphs in three dimensions. Discret. Appl. Math. 322: 448-464 (2022) - [j82]Tibor Jordán, Shin-ichi Tanigawa:
Globally rigid powers of graphs. J. Comb. Theory B 155: 111-140 (2022) - [j81]Tibor Jordán, Shin-ichi Tanigawa:
Rigidity of Random Subgraphs and Eigenvalues of Stiffness Matrices. SIAM J. Discret. Math. 36(3): 2367-2392 (2022) - [c19]Dániel Garamvölgyi, Tibor Jordán:
Globally linked pairs in braced maximal outerplanar graphs. CCCG 2022: 162-168 - 2021
- [j80]Tibor Jordán:
A note on generic rigidity of graphs in higher dimension. Discret. Appl. Math. 297: 97-101 (2021) - [j79]Dániel Garamvölgyi
Graph Reconstruction from Unlabeled Edge Lengths. Discret. Comput. Geom. 66(1): 344-385 (2021) - [j78]Tibor Jordán:
Minimum Size Highly Redundantly Rigid Graphs in the Plane. Graphs Comb. 37(4): 1415-1431 (2021) - 2020
- [j77]Dániel Garamvölgyi
Global Rigidity of Unit Ball Graphs. SIAM J. Discret. Math. 34(1): 212-229 (2020) - [c18]Tibor Jordán, Yusuke Kobayashi, Ryoga Mahara, Kazuhisa Makino:
The Steiner Problem for Count Matroids. IWOCA 2020: 330-342
2010 – 2019
- 2019
- [j76]Botond Bertók
Editorial. Central Eur. J. Oper. Res. 27(2): 325-327 (2019) - [j75]Tibor Jordán, Shin-ichi Tanigawa:
Global rigidity of triangulations with braces. J. Comb. Theory B 136: 249-288 (2019) - 2018
- [j74]Tibor Jordán, Tamás Kis
Computational advances in combinatorial optimization. Discret. Appl. Math. 242: 1-3 (2018) - 2016
- [j73]Tibor Jordán, Viktória E. Kaszanitzky, Shin-ichi Tanigawa:
Gain-Sparsity and Symmetry-Forced Rigidity in the Plane. Discret. Comput. Geom. 55(2): 314-372 (2016) - [j72]Tibor Jordán, Csaba Király
Generic global rigidity of body-hinge frameworks. J. Comb. Theory B 117: 59-76 (2016) - [j71]Bill Jackson, Tibor Jordán, Shin-ichi Tanigawa:
Unique low rank completability of partially filled matrices. J. Comb. Theory B 121: 432-462 (2016) - 2015
- [j70]Tibor Jordán, Viet Hang Nguyen:
On universally rigid frameworks on the line. Contributions Discret. Math. 10(2) (2015) - [j69]Tibor Jordán, Viktória E. Kaszanitzky:
Sparse hypergraphs with applications in combinatorial rigidity. Discret. Appl. Math. 185: 93-101 (2015) - [j68]Zsolt Fekete, Tibor Jordán, Viktória E. Kaszanitzky:
Rigid Two-Dimensional Frameworks with Two Coincident Points. Graphs Comb. 31(3): 585-599 (2015) - [j67]Tibor Jordán, Ildikó Schlotter
Parameterized complexity of spare capacity allocation and the multicost Steiner subgraph problem. J. Discrete Algorithms 30: 29-44 (2015) - 2014
- [j66]Satoru Iwata, Tibor Jordán:
Orientations and detachments of graphs with prescribed degrees and connectivity. Discret. Optim. 12: 121-128 (2014) - [j65]Bill Jackson, Tibor Jordán, Shin-ichi Tanigawa:
Combinatorial Conditions for the Unique Completability of Low-Rank Matrices. SIAM J. Discret. Math. 28(4): 1797-1819 (2014) - 2013
- [j64]Tibor Csendes, Tibor Jordán, Tamás Szántai:
Editorial. Central Eur. J. Oper. Res. 21(4): 663-664 (2013) - [j63]Bill Jackson, Tibor Jordán, Csaba Király
Strongly rigid tensegrity graphs on the line. Discret. Appl. Math. 161(7-8): 1147-1149 (2013) - [j62]János Geleji, Tibor Jordán:
Robust Tensegrity Polygons. Discret. Comput. Geom. 50(3): 537-551 (2013) - [j61]Tibor Jordán, Viktória E. Kaszanitzky:
Highly connected rigidity matroids have unique underlying graphs. Eur. J. Comb. 34(2): 240-247 (2013) - [j60]Robert Connelly, Tibor Jordán, Walter Whiteley:
Generic global rigidity of body-bar frameworks. J. Comb. Theory B 103(6): 689-705 (2013) - [j59]Tibor Jordán, Gábor Domokos, Krisztina Tóth:
Geometric Sensitivity of Rigid Graphs. SIAM J. Discret. Math. 27(4): 1710-1726 (2013) - 2012
- [j58]Tibor Jordán:
Highly connected molecular graphs are rigid in three dimensions. Inf. Process. Lett. 112(8-9): 356-359 (2012) - 2010
- [j57]Bill Jackson, Tibor Jordán:
Brick partitions of graphs. Discret. Math. 310(2): 270-275 (2010) - [j56]Jørgen Bang-Jensen
Spanning 2-strong tournaments in 3-strong semicomplete digraphs. Discret. Math. 310(9): 1424-1428 (2010) - [j55]Bill Jackson, Tibor Jordán:
The generic rank of body-bar-and-hinge frameworks. Eur. J. Comb. 31(2): 574-588 (2010) - [j54]Bill Jackson, Tibor Jordán:
Operations Preserving Global Rigidity of Generic Direction-Length Frameworks. Int. J. Comput. Geom. Appl. 20(6): 685-706 (2010) - [j53]Tibor Jordán:
Generically globally rigid zeolites in the plane. Inf. Process. Lett. 110(18-19): 841-844 (2010) - [j52]Bill Jackson, Tibor Jordán:
Globally rigid circuits of the direction-length rigidity matroid. J. Comb. Theory B 100(1): 1-22 (2010)
2000 – 2009
- 2009
- [j51]Tibor Jordán, Zoltan Szabadka:
Operations preserving the global rigidity of graphs and frameworks in the plane. Comput. Geom. 42(6-7): 511-521 (2009) - [j50]Bill Jackson, Tibor Jordán:
A sufficient connectivity condition for generic rigidity in the plane. Discret. Appl. Math. 157(8): 1965-1968 (2009) - [j49]Tibor Jordán, András Recski, Zoltan Szabadka:
Rigid tensegrity labelings of graphs. Eur. J. Comb. 30(8): 1887-1895 (2009) - 2008
- [j48]Bill Jackson, Tibor Jordán:
On the rigidity of molecular graphs. Comb. 28(6): 645-658 (2008) - [j47]Bill Jackson, Tibor Jordán:
Pin-Collinear Body-and-Pin Frameworks and the Molecular Conjecture. Discret. Comput. Geom. 40(2): 258-278 (2008) - [j46]Jørgen Bang-Jensen
On persistent directed graphs. Networks 52(4): 271-276 (2008) - 2007
- [j45]Bill Jackson, Tibor Jordán:
Rigid Components in Molecular Graphs. Algorithmica 48(4): 399-412 (2007) - 2006
- [j44]Bill Jackson, Tibor Jordán, Zoltan Szabadka:
Globally Linked Pairs of Vertices in Equivalent Realizations of Graphs. Discret. Comput. Geom. 35(3): 493-512 (2006) - [j43]Bill Jackson, Tibor Jordán:
On the Rank Function of the 3-dimensional Rigidity Matroid. Int. J. Comput. Geom. Appl. 16(5-6): 415-430 (2006) - [j42]Tibor Jordán:
A characterization of weakly four-connected graphs. J. Graph Theory 52(3): 217-229 (2006) - [j41]Alex R. Berg, Tibor Jordán:
Two-connected orientations of Eulerian graphs. J. Graph Theory 52(3): 230-242 (2006) - [c17]Zsolt Fekete, Tibor Jordán:
Uniquely Localizable Networks with Few Anchors. ALGOSENSORS 2006: 176-183 - 2005
- [j40]Bill Jackson, Tibor Jordán:
The Dress conjectures on rank in the 3-dimensional rigidity matroid. Adv. Appl. Math. 35(4): 355-367 (2005) - [j39]Zsolt Fekete, Tibor Jordán:
Rigid realizations of graphs on small grids. Comput. Geom. 32(3): 216-222 (2005) - [j38]Alex R. Berg, Tibor Jordán:
Minimally k-Edge-Connected Directed Graphs of Maximal Size. Graphs Comb. 21(1): 39-50 (2005) - [j37]Bill Jackson, Tibor Jordán:
Rigid Two-Dimensional Frameworks with Three Collinear Points. Graphs Comb. 21(4): 427-444 (2005) - [j36]Bill Jackson, Tibor Jordán:
Connected rigidity matroids and unique realizations of graphs. J. Comb. Theory B 94(1): 1-29 (2005) - [j35]Bill Jackson, Tibor Jordán:
Independence free graphs and vertex connectivity augmentation. J. Comb. Theory B 94(1): 31-77 (2005) - [j34]Bill Jackson, Tibor Jordán:
The d-dimensional rigidity matroid of sparse graphs. J. Comb. Theory B 95(1): 118-133 (2005) - [j33]Tibor Jordán:
On the existence of k edge-disjoint 2-connected spanning subgraphs. J. Comb. Theory B 95(2): 257-262 (2005) - [j32]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) - 2004
- [j31]Jørgen Bang-Jensen
Splitting off edges between two subsets preserving the edge-connectivity of the graph. Discret. Math. 276(1-3): 5-28 (2004) - [c16]Zsolt Fekete, Tibor Jordán, Walter Whiteley:
An Inductive Construction for Plane Laman Graphs via Vertex Splitting. ESA 2004: 299-310 - 2003
- [j30]Tibor Jordán:
On minimally k-edge-connected graphs and shortest k-edge-connected Steiner networks. Discret. Appl. Math. 131(2): 421-432 (2003) - [j29]Alex R. Berg, Bill Jackson, Tibor Jordán:
Edge splitting and connectivity augmentation in directed hypergraphs. Discret. Math. 273(1-3): 71-84 (2003) - [j28]Bill Jackson, Tibor Jordán:
Non-separable detachments of graphs. J. Comb. Theory B 87(1): 17-37 (2003) - [j27]Alex R. Berg, Tibor Jordán:
A proof of Connelly's conjecture on 3-connected circuits of the rigidity matroid. J. Comb. Theory B 88(1): 77-97 (2003) - [j26]Alex R. Berg, Bill Jackson, Tibor Jordán:
Highly edge-connected detachments of graphs and digraphs. J. Graph Theory 43(1): 67-77 (2003) - [j25]Tibor Jordán, Zoltán Szigeti:
Detachments Preserving Local Edge-Connectivity of Graphs. SIAM J. Discret. Math. 17(1): 72-87 (2003) - [j24]Tibor Jordán:
Constrained Edge-Splitting Problems. SIAM J. Discret. Math. 17(1): 88-102 (2003) - [c15]Alex R. Berg, Tibor Jordán:
Algorithms for Graph Rigidity and Scene Analysis. ESA 2003: 78-89 - 2002
- [j23]Hiroshi Nagamochi, Tibor Jordán, Yoshitaka Nakao, Toshihide Ibaraki:
Convex Embeddings and Bisections of 3-Connected Graphs 1. Comb. 22(4): 537-554 (2002) - [j22]Tibor Jordán, Alessandro Panconesi:
Preface. Random Struct. Algorithms 20(3): 261 (2002) - 2001
- [j21]Joseph Cheriyan, Tibor Jordán, Zeev Nutov:
On Rooted Node-Connectivity Problems. Algorithmica 30(3): 353-375 (2001) - [j20]András Frank
Combinatorial problems related to origin-destination matrices. Discret. Appl. Math. 115(1-3): 37-47 (2001) - [j19]Harold N. Gabow, Tibor Jordán:
Bipartition constrained edge-splitting in directed graphs. Discret. Appl. Math. 115(1-3): 49-62 (2001) - [j18]Bill Jackson, Tibor Jordán:
Non-Separable Detachments of Graphs. Electron. Notes Discret. Math. 10: 151-153 (2001) - [c14]Bill Jackson, Tibor Jordán:
Independence Free Graphs and Vertex Connectivity Augmentation. IPCO 2001: 264-279 - 2000
- [j17]Bill Jackson, Tibor Jordán:
Connectivity Augmentation of Graphs. Electron. Notes Discret. Math. 5: 185-188 (2000) - [j16]Jørgen Bang-Jensen
Splitting Off Edges within a Specified Subset Preserving the Edge-Connectivity of the Graph. J. Algorithms 37(2): 326-343 (2000) - [j15]Harold N. Gabow, Tibor Jordán:
Incrementing Bipartite Digraph Edge-Connectivity. J. Comb. Optim. 4(4): 449-486 (2000) - [j14]Harold N. Gabow, Tibor Jordán:
How to Make a Square Grid Framework with Cables Rigid. SIAM J. Comput. 30(2): 649-680 (2000) - [c13]Bill Jackson, Tibor Jordán:
A Near Optimal Algorithm for Vertex Connectivity Augmentation. ISAAC 2000: 312-325
1990 – 1999
- 1999
- [j13]Tibor Jordán:
Extremal graphs in connectivity augmentation. J. Graph Theory 31(3): 179-193 (1999) - [j12]Tibor Jordán:
On the number of shredders. J. Graph Theory 31(3): 195-200 (1999) - [j11]Tamás Fleiner, Tibor Jordán:
Coverings and structure of crossing families. Math. Program. 84(3): 505-518 (1999) - [j10]András Frank, Tibor Jordán:
Directed vertex-connectivity augmentation. Math. Program. 84(3): 537-553 (1999) - [j9]Ervin Györi, Tibor Jordán:
How to make a graph four-connected. Math. Program. 84(3): 555-563 (1999) - [j8]Eddie Cheng, Tibor Jordán:
Successive edge-connectivity augmentation problems. Math. Program. 84(3): 577-593 (1999) - [j7]Jørgen Bang-Jensen
Edge-Connectivity Augmentation with Partition Constraints. SIAM J. Discret. Math. 12(2): 160-207 (1999) - [c12]Joseph Cheriyan, Tibor Jordán, R. Ravi:
On 2-Coverings and 2-Packings of Laminar Families. ESA 1999: 510-520 - [c11]András Frank, Tibor Jordán, Zoltán Szigeti:
An Orientation Theorem with Parity Conditions. IPCO 1999: 183-190 - [c10]Tibor Jordán:
Edge-Splitting Problems with Demands. IPCO 1999: 273-288 - [c9]Hiroshi Nagamochi, Tibor Jordán, Yoshitaka Nakao, Toshihide Ibaraki:
Bisecting Two Subsets in 3-Connected Graphs. ISAAC 1999: 425-434 - [c8]Harold N. Gabow, Tibor Jordán:
How to Make a Square Grid Framework with Cables Rigid. SODA 1999: 356-365 - 1998
- [j6]Jørgen Bang-Jensen, Tibor Jordán:
Adding and Reversing Arcs in Semicomplete Digraphs. Comb. Probab. Comput. 7(1): 17-25 (1998) - [j5]Tibor Jordán:
On the existence of (k, l)-critical graphs. Discret. Math. 179(1-3): 273-275 (1998) - [j4]Jørgen Bang-Jensen
Edge-Connectivity Augmentation Preserving Simplicity. SIAM J. Discret. Math. 11(4): 603-623 (1998) - [c7]Joseph Cheriyan, Tibor Jordán, Zeev Nutov:
Approximating k-outconnected Subgraph Problems. APPROX 1998: 77-88 - [c6]Jørgen Bang-Jensen, Harold N. Gabow, Tibor Jordán, Zoltán Szigeti:
Edge-Connectivity Augmentation with Partition Constraints. SODA 1998: 306-315 - 1997
- [j3]Tibor Jordán:
A Note on the Vertex-Connectivity Augmentation Problem. J. Comb. Theory B 71(2): 294-301 (1997) - [c5]Jørgen Bang-Jensen, Tibor Jordán:
Edge-Connectivity Augmentation Preserving Simplicity. FOCS 1997: 486-495 - 1995
- [j2]Tibor Jordán:
On the Optimal Vertex-Connectivity Augmentation. J. Comb. Theory B 63(1): 8-20 (1995) - [j1]András Frank
Minimal Edge-Coverings of Pairs of Sets. J. Comb. Theory B 65(1): 73-110 (1995) - [c4]András Frank, Tibor Jordán:
How to Make a Strongly Connected Digraph Two-Connected. IPCO 1995: 414-425 - 1993
- [c3]Tibor Jordán:
Incresing the Vertex-Connectivity in Directed Graphs. ESA 1993: 236-247 - [c2]Tibor Jordán:
Optimal and almost optimal algorithms for connectivity augmentation problems. IPCO 1993: 75-88 - 1991
- [c1]András Frank, Tibor Jordán:
Tree-representation of directed circuits. Graph Structure Theory 1991: 195-202
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-06 22:00 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: