Automated Organization ProfileJohann Radon Institute for Computational and Applied Mathematics (RICAM), Austrian Academy of Sciences
Johann Radon Institute for Computational and Applied Mathematics (RICAM), Austrian Academy of Sciences
Current S-Index
Sum of Dataset Indices for all datasets
Average Dataset Index per Dataset
Average Dataset Index per dataset
Total Datasets
Total datasets in this organization
Average FAIR Score
Average FAIR Score per dataset
Total Citations
Total citations to the organization's datasets
Total Mentions
Total mentions of the organization's datasets
S-Index Interpretation
The S-Index (Sharing Index) is a comprehensive metric that represents the cumulative impact of all your datasets. It is calculated as the sum of Dataset Index scores across all your claimed datasets.
What it means:
- A higher S-index indicates greater overall impact of your datasets relative to typical datasets in their fields of research
- The S-Index grows as you add more datasets or as existing datasets gain more citations and mentions
- It provides a single number to track your research data impact over time
Current S-Index: 15.6 (sum of 10 datasets Dataset Index scores)
More information here.
S-Index Over Time
Cumulative Citations Over Time
Cumulative Mentions Over Time
Datasets
This data set collectes all redundantly rigid graphs for dimension d<=25 with at most d+k vertices, where k might be different.
The graphs are collected in a zip file with respect to the dimension. Graphs are stored in graph6 data format.
Authors
- Grasegger, Georg
This data set collectes all redundantly rigid graphs for dimension d<=25 with at most d+k vertices, where k might be different.
The graphs are collected in a zip file with respect to the dimension. Graphs are stored in graph6 data format.
Authors
- Grasegger, Georg
This data set collectes all globally rigid graphs for dimension d<=25 with at most d+k vertices, where k might be different.
The graphs are collected in a zip file with respect to the dimension. Graphs are stored in graph6 data format.
Authors
- Grasegger, Georg
This data set collectes all globally rigid graphs for dimension d<=25 with at most d+k vertices, where k might be different.
The graphs are collected in a zip file with respect to the dimension. Graphs are stored in graph6 data format.
Authors
- Grasegger, Georg
This data set collects all 4-regular Ramanujan graphs with at most 16 vertices grouped by their rigidity properties: Rigid Non-rigid Globally rigid Rigid but not globally rigid All files are in Graph6 data format. If a file for a given order does not exist, there are no graphs with that order and the respective property.
Authors
- Cioabă, Sebastian M. ;
- Dewar, Sean ;
- Grasegger, Georg ;
- Gu, Xiaofeng
This data set collects all Ramanujan graphs 3-regular with at most 20 vertices 4-regular with at most 16 vertices 5-, 6-, 7-regular with at most 14 vertices Bipartite Ramanujan graphs 4-regular with at most 22 vertices 5-, 6-, 7-regular with at most 20 vertices Vertex-transitive Ramanujan graphs 4-, 5-, 6-, 7-regular with at most 47 vertices All files are in Graph6 data format. If a file for a given order does not exist, there are no graphs with that order and the respective property.
Authors
- Cioabă, Sebastian M. ;
- Dewar, Sean ;
- Grasegger, Georg ;
- Gu, Xiaofeng
This data set collects all Ramanujan graphs 3-regular with at most 20 vertices 4-regular with at most 16 vertices 5-, 6-, 7-regular with at most 14 vertices Bipartite Ramanujan graphs 4-regular with at most 22 vertices 5-, 6-, 7-regular with at most 20 vertices Vertex-transitive Ramanujan graphs 4-, 5-, 6-, 7-regular with at most 47 vertices All files are in Graph6 data format. If a file for a given order does not exist, there are no graphs with that order and the respective property.
Authors
- Cioabă, Sebastian M. ;
- Dewar, Sean ;
- Grasegger, Georg ;
- Gu, Xiaofeng
This data set collects all 4-regular Ramanujan graphs with at most 16 vertices grouped by their rigidity properties: Rigid Non-rigid Globally rigid Rigid but not globally rigid All files are in Graph6 data format. If a file for a given order does not exist, there are no graphs with that order and the respective property.
Authors
- Cioabă, Sebastian M. ;
- Dewar, Sean ;
- Grasegger, Georg ;
- Gu, Xiaofeng
This data set consists of files for all Laman graphs (minimally rigid graphs) with at most 12 vertices and files for their Laman numbers (number of complex relaizations).The data is computed by a combinatorial algorithm of Capco, Gallet, Grasegger, Koutschan, Lubbes and Schicho (see 10.1137/17M1118312 for a description and 10.5281/zenodo.1245506 for an implementation).
Authors
- Capco, Jose ;
- Gallet, Matteo ;
- Grasegger, Georg ;
- Koutschan, Christoph ;
- Lubbes, Niels ;
- Schicho, Josef
This data set consists of files for all Laman graphs (minimally rigid graphs) with at most 12 vertices and files for their Laman numbers (number of complex relaizations).The data is computed by a combinatorial algorithm of Capco, Gallet, Grasegger, Koutschan, Lubbes and Schicho (see 10.1137/17M1118312 for a description and 10.5281/zenodo.1245506 for an implementation).
Authors
- Capco, Jose ;
- Gallet, Matteo ;
- Grasegger, Georg ;
- Koutschan, Christoph ;
- Lubbes, Niels ;
- Schicho, Josef