Остановите войну!
for scientists:
default search action
Tibor Jordán
- > Home > Persons > Tibor Jordán
Publications
- 2016
- [j71]Bill Jackson, Tibor Jordán, Shin-ichi Tanigawa:
Unique low rank completability of partially filled matrices. J. Comb. Theory, Ser. B 121: 432-462 (2016) - 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
- [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) - 2010
- [j57]Bill Jackson, Tibor Jordán:
Brick partitions of graphs. Discret. Math. 310(2): 270-275 (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) - [j52]Bill Jackson, Tibor Jordán:
Globally rigid circuits of the direction-length rigidity matroid. J. Comb. Theory, Ser. B 100(1): 1-22 (2010) - 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) - 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) - 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) - 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) - [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, Ser. B 94(1): 1-29 (2005) - [j35]Bill Jackson, Tibor Jordán:
Independence free graphs and vertex connectivity augmentation. J. Comb. Theory, Ser. B 94(1): 31-77 (2005) - [j34]Bill Jackson, Tibor Jordán:
The d-dimensional rigidity matroid of sparse graphs. J. Comb. Theory, Ser. B 95(1): 118-133 (2005) - 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, Ser. B 87(1): 17-37 (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) - 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) - [c13]Bill Jackson, Tibor Jordán:
A Near Optimal Algorithm for Vertex Connectivity Augmentation. ISAAC 2000: 312-325
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-03-21 20:22 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint