Остановите войну!
for scientists:
default search action
Tibor Jordán
- > Home > Persons > Tibor Jordán
Publications
- 2024
- [j86]Tibor Jordán:
Ear-decompositions, minimally connected matroids and rigid graphs. J. Graph Theory 105(3): 451-467 (2024) - 2023
- [j85]Tibor Jordán:
Rigid block and hole graphs with a single block. Discret. Math. 346(3): 113268 (2023) - 2021
- [j80]Tibor Jordán:
A note on generic rigidity of graphs in higher dimension. Discret. Appl. Math. 297: 97-101 (2021) - [j78]Tibor Jordán:
Minimum Size Highly Redundantly Rigid Graphs in the Plane. Graphs Comb. 37(4): 1415-1431 (2021) - 2012
- [j58]Tibor Jordán:
Highly connected molecular graphs are rigid in three dimensions. Inf. Process. Lett. 112(8-9): 356-359 (2012) - 2010
- [j53]Tibor Jordán:
Generically globally rigid zeolites in the plane. Inf. Process. Lett. 110(18-19): 841-844 (2010) - 2006
- [j42]Tibor Jordán:
A characterization of weakly four-connected graphs. J. Graph Theory 52(3): 217-229 (2006) - 2005
- [j33]Tibor Jordán:
On the existence of k edge-disjoint 2-connected spanning subgraphs. J. Comb. Theory, Ser. B 95(2): 257-262 (2005) - 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) - [j24]Tibor Jordán:
Constrained Edge-Splitting Problems. SIAM J. Discret. Math. 17(1): 88-102 (2003) - 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) - [c10]Tibor Jordán:
Edge-Splitting Problems with Demands. IPCO 1999: 273-288 - 1998
- [j5]Tibor Jordán:
On the existence of (k, l)-critical graphs. Discret. Math. 179(1-3): 273-275 (1998) - 1997
- [j3]Tibor Jordán:
A Note on the Vertex-Connectivity Augmentation Problem. J. Comb. Theory, Ser. B 71(2): 294-301 (1997) - 1995
- [j2]Tibor Jordán:
On the Optimal Vertex-Connectivity Augmentation. J. Comb. Theory, Ser. B 63(1): 8-20 (1995) - 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
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-04-21 16:55 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint