The Hardness and Approximation of the Densest k-Subgraph Problem in Parameterized Metric Graphs Article Swipe
Shih‐Chia Chang
,
Li-Hsuan Chen
,
Ling-Ju Hung
,
Shih-Shun Kao
,
Ralf Klasing
·
YOU?
·
· 2020
· Open Access
·
· DOI: https://doi.org/10.1109/ics51289.2020.00034
YOU?
·
· 2020
· Open Access
·
· DOI: https://doi.org/10.1109/ics51289.2020.00034
International audience
Related Topics
Concepts
Metadata
- Type
- preprint
- Language
- en
- Landing Page
- https://doi.org/10.1109/ics51289.2020.00034
- OA Status
- green
- Cited By
- 2
- References
- 41
- Related Works
- 10
- OpenAlex ID
- https://openalex.org/W3132397175
All OpenAlex metadata
Raw OpenAlex JSON
- OpenAlex ID
-
https://openalex.org/W3132397175Canonical identifier for this work in OpenAlex
- DOI
-
https://doi.org/10.1109/ics51289.2020.00034Digital Object Identifier
- Title
-
The Hardness and Approximation of the Densest k-Subgraph Problem in Parameterized Metric GraphsWork title
- Type
-
preprintOpenAlex work type
- Language
-
enPrimary language
- Publication year
-
2020Year of publication
- Publication date
-
2020-12-01Full publication date if available
- Authors
-
Shih‐Chia Chang, Li-Hsuan Chen, Ling-Ju Hung, Shih-Shun Kao, Ralf KlasingList of authors in order
- Landing page
-
https://doi.org/10.1109/ics51289.2020.00034Publisher landing page
- Open access
-
YesWhether a free full text is available
- OA status
-
greenOpen access status per OpenAlex
- OA URL
-
https://hal.science/hal-03441672/documentDirect OA link when available
- Concepts
-
Combinatorics, Parameterized complexity, Metric (unit), Graph, Mathematics, Approximation algorithm, Discrete mathematics, Algorithm, Computer science, Economics, Operations managementTop concepts (fields/topics) attached by OpenAlex
- Cited by
-
2Total citation count in OpenAlex
- Citations by year (recent)
-
2024: 1, 2023: 1Per-year citation counts (last 5 years)
- References (count)
-
41Number of works referenced by this work
- Related works (count)
-
10Other works algorithmically related by OpenAlex
Full payload
| id | https://openalex.org/W3132397175 |
|---|---|
| doi | https://doi.org/10.1109/ics51289.2020.00034 |
| ids.doi | https://doi.org/10.1109/ics51289.2020.00034 |
| ids.mag | 3132397175 |
| ids.openalex | https://openalex.org/W3132397175 |
| fwci | 0.14708811 |
| type | preprint |
| title | The Hardness and Approximation of the Densest k-Subgraph Problem in Parameterized Metric Graphs |
| biblio.issue | |
| biblio.volume | |
| biblio.last_page | |
| biblio.first_page | |
| topics[0].id | https://openalex.org/T10374 |
| topics[0].field.id | https://openalex.org/fields/17 |
| topics[0].field.display_name | Computer Science |
| topics[0].score | 0.9968000054359436 |
| topics[0].domain.id | https://openalex.org/domains/3 |
| topics[0].domain.display_name | Physical Sciences |
| topics[0].subfield.id | https://openalex.org/subfields/1703 |
| topics[0].subfield.display_name | Computational Theory and Mathematics |
| topics[0].display_name | Advanced Graph Theory Research |
| topics[1].id | https://openalex.org/T10720 |
| topics[1].field.id | https://openalex.org/fields/17 |
| topics[1].field.display_name | Computer Science |
| topics[1].score | 0.9948999881744385 |
| topics[1].domain.id | https://openalex.org/domains/3 |
| topics[1].domain.display_name | Physical Sciences |
| topics[1].subfield.id | https://openalex.org/subfields/1703 |
| topics[1].subfield.display_name | Computational Theory and Mathematics |
| topics[1].display_name | Complexity and Algorithms in Graphs |
| topics[2].id | https://openalex.org/T12546 |
| topics[2].field.id | https://openalex.org/fields/22 |
| topics[2].field.display_name | Engineering |
| topics[2].score | 0.9886000156402588 |
| topics[2].domain.id | https://openalex.org/domains/3 |
| topics[2].domain.display_name | Physical Sciences |
| topics[2].subfield.id | https://openalex.org/subfields/2215 |
| topics[2].subfield.display_name | Building and Construction |
| topics[2].display_name | Smart Parking Systems Research |
| is_xpac | False |
| apc_list | |
| apc_paid | |
| concepts[0].id | https://openalex.org/C114614502 |
| concepts[0].level | 1 |
| concepts[0].score | 0.6667299270629883 |
| concepts[0].wikidata | https://www.wikidata.org/wiki/Q76592 |
| concepts[0].display_name | Combinatorics |
| concepts[1].id | https://openalex.org/C165464430 |
| concepts[1].level | 2 |
| concepts[1].score | 0.6384468078613281 |
| concepts[1].wikidata | https://www.wikidata.org/wiki/Q1570441 |
| concepts[1].display_name | Parameterized complexity |
| concepts[2].id | https://openalex.org/C176217482 |
| concepts[2].level | 2 |
| concepts[2].score | 0.5720820426940918 |
| concepts[2].wikidata | https://www.wikidata.org/wiki/Q860554 |
| concepts[2].display_name | Metric (unit) |
| concepts[3].id | https://openalex.org/C132525143 |
| concepts[3].level | 2 |
| concepts[3].score | 0.41975945234298706 |
| concepts[3].wikidata | https://www.wikidata.org/wiki/Q141488 |
| concepts[3].display_name | Graph |
| concepts[4].id | https://openalex.org/C33923547 |
| concepts[4].level | 0 |
| concepts[4].score | 0.41354215145111084 |
| concepts[4].wikidata | https://www.wikidata.org/wiki/Q395 |
| concepts[4].display_name | Mathematics |
| concepts[5].id | https://openalex.org/C148764684 |
| concepts[5].level | 2 |
| concepts[5].score | 0.4120326340198517 |
| concepts[5].wikidata | https://www.wikidata.org/wiki/Q621751 |
| concepts[5].display_name | Approximation algorithm |
| concepts[6].id | https://openalex.org/C118615104 |
| concepts[6].level | 1 |
| concepts[6].score | 0.4088980555534363 |
| concepts[6].wikidata | https://www.wikidata.org/wiki/Q121416 |
| concepts[6].display_name | Discrete mathematics |
| concepts[7].id | https://openalex.org/C11413529 |
| concepts[7].level | 1 |
| concepts[7].score | 0.38266780972480774 |
| concepts[7].wikidata | https://www.wikidata.org/wiki/Q8366 |
| concepts[7].display_name | Algorithm |
| concepts[8].id | https://openalex.org/C41008148 |
| concepts[8].level | 0 |
| concepts[8].score | 0.3643929362297058 |
| concepts[8].wikidata | https://www.wikidata.org/wiki/Q21198 |
| concepts[8].display_name | Computer science |
| concepts[9].id | https://openalex.org/C162324750 |
| concepts[9].level | 0 |
| concepts[9].score | 0.0 |
| concepts[9].wikidata | https://www.wikidata.org/wiki/Q8134 |
| concepts[9].display_name | Economics |
| concepts[10].id | https://openalex.org/C21547014 |
| concepts[10].level | 1 |
| concepts[10].score | 0.0 |
| concepts[10].wikidata | https://www.wikidata.org/wiki/Q1423657 |
| concepts[10].display_name | Operations management |
| keywords[0].id | https://openalex.org/keywords/combinatorics |
| keywords[0].score | 0.6667299270629883 |
| keywords[0].display_name | Combinatorics |
| keywords[1].id | https://openalex.org/keywords/parameterized-complexity |
| keywords[1].score | 0.6384468078613281 |
| keywords[1].display_name | Parameterized complexity |
| keywords[2].id | https://openalex.org/keywords/metric |
| keywords[2].score | 0.5720820426940918 |
| keywords[2].display_name | Metric (unit) |
| keywords[3].id | https://openalex.org/keywords/graph |
| keywords[3].score | 0.41975945234298706 |
| keywords[3].display_name | Graph |
| keywords[4].id | https://openalex.org/keywords/mathematics |
| keywords[4].score | 0.41354215145111084 |
| keywords[4].display_name | Mathematics |
| keywords[5].id | https://openalex.org/keywords/approximation-algorithm |
| keywords[5].score | 0.4120326340198517 |
| keywords[5].display_name | Approximation algorithm |
| keywords[6].id | https://openalex.org/keywords/discrete-mathematics |
| keywords[6].score | 0.4088980555534363 |
| keywords[6].display_name | Discrete mathematics |
| keywords[7].id | https://openalex.org/keywords/algorithm |
| keywords[7].score | 0.38266780972480774 |
| keywords[7].display_name | Algorithm |
| keywords[8].id | https://openalex.org/keywords/computer-science |
| keywords[8].score | 0.3643929362297058 |
| keywords[8].display_name | Computer science |
| language | en |
| locations[0].id | doi:10.1109/ics51289.2020.00034 |
| locations[0].is_oa | False |
| locations[0].source | |
| locations[0].license | |
| locations[0].pdf_url | |
| locations[0].version | publishedVersion |
| locations[0].raw_type | proceedings-article |
| locations[0].license_id | |
| locations[0].is_accepted | True |
| locations[0].is_published | True |
| locations[0].raw_source_name | 2020 International Computer Symposium (ICS) |
| locations[0].landing_page_url | https://doi.org/10.1109/ics51289.2020.00034 |
| locations[1].id | pmh:oai:HAL:hal-03441672v1 |
| locations[1].is_oa | True |
| locations[1].source.id | https://openalex.org/S4306402512 |
| locations[1].source.issn | |
| locations[1].source.type | repository |
| locations[1].source.is_oa | False |
| locations[1].source.issn_l | |
| locations[1].source.is_core | False |
| locations[1].source.is_in_doaj | False |
| locations[1].source.display_name | HAL (Le Centre pour la Communication Scientifique Directe) |
| locations[1].source.host_organization | https://openalex.org/I1294671590 |
| locations[1].source.host_organization_name | Centre National de la Recherche Scientifique |
| locations[1].source.host_organization_lineage | https://openalex.org/I1294671590 |
| locations[1].license | other-oa |
| locations[1].pdf_url | https://hal.science/hal-03441672/document |
| locations[1].version | submittedVersion |
| locations[1].raw_type | Conference papers |
| locations[1].license_id | https://openalex.org/licenses/other-oa |
| locations[1].is_accepted | False |
| locations[1].is_published | False |
| locations[1].raw_source_name | 2020 International Computer Symposium (ICS), Dec 2020, Tainan, Taiwan. pp.126-130, ⟨10.1109/ICS51289.2020.00034⟩ |
| locations[1].landing_page_url | https://hal.science/hal-03441672 |
| indexed_in | crossref |
| authorships[0].author.id | https://openalex.org/A5066205594 |
| authorships[0].author.orcid | |
| authorships[0].author.display_name | Shih‐Chia Chang |
| authorships[0].countries | TW |
| authorships[0].affiliations[0].institution_ids | https://openalex.org/I43566213 |
| authorships[0].affiliations[0].raw_affiliation_string | Department of Business Administration, College of Management, National Taipei University of Business, Taipei, Taiwan |
| authorships[0].institutions[0].id | https://openalex.org/I43566213 |
| authorships[0].institutions[0].ror | https://ror.org/029hrv109 |
| authorships[0].institutions[0].type | education |
| authorships[0].institutions[0].lineage | https://openalex.org/I43566213 |
| authorships[0].institutions[0].country_code | TW |
| authorships[0].institutions[0].display_name | National Taipei University of Business |
| authorships[0].author_position | first |
| authorships[0].raw_author_name | Shih-Chia Chang |
| authorships[0].is_corresponding | False |
| authorships[0].raw_affiliation_strings | Department of Business Administration, College of Management, National Taipei University of Business, Taipei, Taiwan |
| authorships[1].author.id | https://openalex.org/A5055424928 |
| authorships[1].author.orcid | https://orcid.org/0009-0007-6528-7064 |
| authorships[1].author.display_name | Li-Hsuan Chen |
| authorships[1].affiliations[0].raw_affiliation_string | ProBrand Technology, Inc., Taoyuan City, Taiwan |
| authorships[1].author_position | middle |
| authorships[1].raw_author_name | Li-Hsuan Chen |
| authorships[1].is_corresponding | False |
| authorships[1].raw_affiliation_strings | ProBrand Technology, Inc., Taoyuan City, Taiwan |
| authorships[2].author.id | https://openalex.org/A5007511094 |
| authorships[2].author.orcid | https://orcid.org/0000-0001-5659-5507 |
| authorships[2].author.display_name | Ling-Ju Hung |
| authorships[2].countries | TW |
| authorships[2].affiliations[0].institution_ids | https://openalex.org/I43566213 |
| authorships[2].affiliations[0].raw_affiliation_string | Department of Business Administration, College of Management, National Taipei University of Business, Taipei, Taiwan |
| authorships[2].institutions[0].id | https://openalex.org/I43566213 |
| authorships[2].institutions[0].ror | https://ror.org/029hrv109 |
| authorships[2].institutions[0].type | education |
| authorships[2].institutions[0].lineage | https://openalex.org/I43566213 |
| authorships[2].institutions[0].country_code | TW |
| authorships[2].institutions[0].display_name | National Taipei University of Business |
| authorships[2].author_position | middle |
| authorships[2].raw_author_name | Ling-Ju Hung |
| authorships[2].is_corresponding | False |
| authorships[2].raw_affiliation_strings | Department of Business Administration, College of Management, National Taipei University of Business, Taipei, Taiwan |
| authorships[3].author.id | https://openalex.org/A5045206789 |
| authorships[3].author.orcid | https://orcid.org/0000-0001-7695-3535 |
| authorships[3].author.display_name | Shih-Shun Kao |
| authorships[3].countries | FR, TW |
| authorships[3].affiliations[0].institution_ids | https://openalex.org/I91807558 |
| authorships[3].affiliations[0].raw_affiliation_string | Department of Computer Science and Information Engineering, National Cheng Kung University, Tainan, Taiwan |
| authorships[3].affiliations[1].institution_ids | https://openalex.org/I1294671590, https://openalex.org/I15057530, https://openalex.org/I4210142254, https://openalex.org/I4210160189 |
| authorships[3].affiliations[1].raw_affiliation_string | CNRS, LaBRI, Université de Bordeaux, Talence, France |
| authorships[3].institutions[0].id | https://openalex.org/I1294671590 |
| authorships[3].institutions[0].ror | https://ror.org/02feahw73 |
| authorships[3].institutions[0].type | government |
| authorships[3].institutions[0].lineage | https://openalex.org/I1294671590 |
| authorships[3].institutions[0].country_code | FR |
| authorships[3].institutions[0].display_name | Centre National de la Recherche Scientifique |
| authorships[3].institutions[1].id | https://openalex.org/I4210160189 |
| authorships[3].institutions[1].ror | https://ror.org/054qv7y42 |
| authorships[3].institutions[1].type | education |
| authorships[3].institutions[1].lineage | https://openalex.org/I4210160189 |
| authorships[3].institutions[1].country_code | FR |
| authorships[3].institutions[1].display_name | Institut Polytechnique de Bordeaux |
| authorships[3].institutions[2].id | https://openalex.org/I4210142254 |
| authorships[3].institutions[2].ror | https://ror.org/03adqg323 |
| authorships[3].institutions[2].type | facility |
| authorships[3].institutions[2].lineage | https://openalex.org/I1294671590, https://openalex.org/I1294671590, https://openalex.org/I15057530, https://openalex.org/I4210142254, https://openalex.org/I4210159245, https://openalex.org/I4210160189 |
| authorships[3].institutions[2].country_code | FR |
| authorships[3].institutions[2].display_name | Laboratoire Bordelais de Recherche en Informatique |
| authorships[3].institutions[3].id | https://openalex.org/I15057530 |
| authorships[3].institutions[3].ror | https://ror.org/057qpr032 |
| authorships[3].institutions[3].type | education |
| authorships[3].institutions[3].lineage | https://openalex.org/I15057530 |
| authorships[3].institutions[3].country_code | FR |
| authorships[3].institutions[3].display_name | Université de Bordeaux |
| authorships[3].institutions[4].id | https://openalex.org/I91807558 |
| authorships[3].institutions[4].ror | https://ror.org/01b8kcc49 |
| authorships[3].institutions[4].type | education |
| authorships[3].institutions[4].lineage | https://openalex.org/I91807558 |
| authorships[3].institutions[4].country_code | TW |
| authorships[3].institutions[4].display_name | National Cheng Kung University |
| authorships[3].author_position | middle |
| authorships[3].raw_author_name | Shih-Shun Kao |
| authorships[3].is_corresponding | False |
| authorships[3].raw_affiliation_strings | CNRS, LaBRI, Université de Bordeaux, Talence, France, Department of Computer Science and Information Engineering, National Cheng Kung University, Tainan, Taiwan |
| authorships[4].author.id | https://openalex.org/A5112786437 |
| authorships[4].author.orcid | |
| authorships[4].author.display_name | Ralf Klasing |
| authorships[4].countries | FR |
| authorships[4].affiliations[0].institution_ids | https://openalex.org/I1294671590, https://openalex.org/I15057530, https://openalex.org/I4210142254, https://openalex.org/I4210160189 |
| authorships[4].affiliations[0].raw_affiliation_string | CNRS, LaBRI, Université de Bordeaux, Talence, France |
| authorships[4].institutions[0].id | https://openalex.org/I1294671590 |
| authorships[4].institutions[0].ror | https://ror.org/02feahw73 |
| authorships[4].institutions[0].type | government |
| authorships[4].institutions[0].lineage | https://openalex.org/I1294671590 |
| authorships[4].institutions[0].country_code | FR |
| authorships[4].institutions[0].display_name | Centre National de la Recherche Scientifique |
| authorships[4].institutions[1].id | https://openalex.org/I4210160189 |
| authorships[4].institutions[1].ror | https://ror.org/054qv7y42 |
| authorships[4].institutions[1].type | education |
| authorships[4].institutions[1].lineage | https://openalex.org/I4210160189 |
| authorships[4].institutions[1].country_code | FR |
| authorships[4].institutions[1].display_name | Institut Polytechnique de Bordeaux |
| authorships[4].institutions[2].id | https://openalex.org/I4210142254 |
| authorships[4].institutions[2].ror | https://ror.org/03adqg323 |
| authorships[4].institutions[2].type | facility |
| authorships[4].institutions[2].lineage | https://openalex.org/I1294671590, https://openalex.org/I1294671590, https://openalex.org/I15057530, https://openalex.org/I4210142254, https://openalex.org/I4210159245, https://openalex.org/I4210160189 |
| authorships[4].institutions[2].country_code | FR |
| authorships[4].institutions[2].display_name | Laboratoire Bordelais de Recherche en Informatique |
| authorships[4].institutions[3].id | https://openalex.org/I15057530 |
| authorships[4].institutions[3].ror | https://ror.org/057qpr032 |
| authorships[4].institutions[3].type | education |
| authorships[4].institutions[3].lineage | https://openalex.org/I15057530 |
| authorships[4].institutions[3].country_code | FR |
| authorships[4].institutions[3].display_name | Université de Bordeaux |
| authorships[4].author_position | last |
| authorships[4].raw_author_name | Ralf Klasing |
| authorships[4].is_corresponding | False |
| authorships[4].raw_affiliation_strings | CNRS, LaBRI, Université de Bordeaux, Talence, France |
| has_content.pdf | True |
| has_content.grobid_xml | True |
| is_paratext | False |
| open_access.is_oa | True |
| open_access.oa_url | https://hal.science/hal-03441672/document |
| open_access.oa_status | green |
| open_access.any_repository_has_fulltext | False |
| created_date | 2025-10-10T00:00:00 |
| display_name | The Hardness and Approximation of the Densest k-Subgraph Problem in Parameterized Metric Graphs |
| has_fulltext | False |
| is_retracted | False |
| updated_date | 2025-11-06T03:46:38.306776 |
| primary_topic.id | https://openalex.org/T10374 |
| primary_topic.field.id | https://openalex.org/fields/17 |
| primary_topic.field.display_name | Computer Science |
| primary_topic.score | 0.9968000054359436 |
| primary_topic.domain.id | https://openalex.org/domains/3 |
| primary_topic.domain.display_name | Physical Sciences |
| primary_topic.subfield.id | https://openalex.org/subfields/1703 |
| primary_topic.subfield.display_name | Computational Theory and Mathematics |
| primary_topic.display_name | Advanced Graph Theory Research |
| related_works | https://openalex.org/W2051058708, https://openalex.org/W154868527, https://openalex.org/W1494268238, https://openalex.org/W1034070228, https://openalex.org/W4288277589, https://openalex.org/W2998616538, https://openalex.org/W2173621488, https://openalex.org/W2964749573, https://openalex.org/W2401679980, https://openalex.org/W4245692971 |
| cited_by_count | 2 |
| counts_by_year[0].year | 2024 |
| counts_by_year[0].cited_by_count | 1 |
| counts_by_year[1].year | 2023 |
| counts_by_year[1].cited_by_count | 1 |
| locations_count | 2 |
| best_oa_location.id | pmh:oai:HAL:hal-03441672v1 |
| best_oa_location.is_oa | True |
| best_oa_location.source.id | https://openalex.org/S4306402512 |
| best_oa_location.source.issn | |
| best_oa_location.source.type | repository |
| best_oa_location.source.is_oa | False |
| best_oa_location.source.issn_l | |
| best_oa_location.source.is_core | False |
| best_oa_location.source.is_in_doaj | False |
| best_oa_location.source.display_name | HAL (Le Centre pour la Communication Scientifique Directe) |
| best_oa_location.source.host_organization | https://openalex.org/I1294671590 |
| best_oa_location.source.host_organization_name | Centre National de la Recherche Scientifique |
| best_oa_location.source.host_organization_lineage | https://openalex.org/I1294671590 |
| best_oa_location.license | other-oa |
| best_oa_location.pdf_url | https://hal.science/hal-03441672/document |
| best_oa_location.version | submittedVersion |
| best_oa_location.raw_type | Conference papers |
| best_oa_location.license_id | https://openalex.org/licenses/other-oa |
| best_oa_location.is_accepted | False |
| best_oa_location.is_published | False |
| best_oa_location.raw_source_name | 2020 International Computer Symposium (ICS), Dec 2020, Tainan, Taiwan. pp.126-130, ⟨10.1109/ICS51289.2020.00034⟩ |
| best_oa_location.landing_page_url | https://hal.science/hal-03441672 |
| primary_location.id | doi:10.1109/ics51289.2020.00034 |
| primary_location.is_oa | False |
| primary_location.source | |
| primary_location.license | |
| primary_location.pdf_url | |
| primary_location.version | publishedVersion |
| primary_location.raw_type | proceedings-article |
| primary_location.license_id | |
| primary_location.is_accepted | True |
| primary_location.is_published | True |
| primary_location.raw_source_name | 2020 International Computer Symposium (ICS) |
| primary_location.landing_page_url | https://doi.org/10.1109/ics51289.2020.00034 |
| publication_date | 2020-12-01 |
| publication_year | 2020 |
| referenced_works | https://openalex.org/W1887950748, https://openalex.org/W1480102953, https://openalex.org/W2091602684, https://openalex.org/W2099459744, https://openalex.org/W1508890431, https://openalex.org/W1970871468, https://openalex.org/W2021294212, https://openalex.org/W2007362596, https://openalex.org/W2885465588, https://openalex.org/W2160111458, https://openalex.org/W1965734368, https://openalex.org/W1481223916, https://openalex.org/W2153849284, https://openalex.org/W1548489374, https://openalex.org/W4255030025, https://openalex.org/W2057017626, https://openalex.org/W2606334169, https://openalex.org/W1970964752, https://openalex.org/W6630985558, https://openalex.org/W2036836182, https://openalex.org/W2032279394, https://openalex.org/W6659733666, https://openalex.org/W2065766818, https://openalex.org/W1990605847, https://openalex.org/W2063494850, https://openalex.org/W1996641400, https://openalex.org/W2043097561, https://openalex.org/W2025698306, https://openalex.org/W1977056448, https://openalex.org/W6740630065, https://openalex.org/W2764084197, https://openalex.org/W2606457256, https://openalex.org/W2891069083, https://openalex.org/W2946735198, https://openalex.org/W2964670465, https://openalex.org/W2006278018, https://openalex.org/W1519679194, https://openalex.org/W2027048490, https://openalex.org/W3145128584, https://openalex.org/W2728689850, https://openalex.org/W4246219036 |
| referenced_works_count | 41 |
| abstract_inverted_index.audience | 1 |
| abstract_inverted_index.International | 0 |
| cited_by_percentile_year.max | 94 |
| cited_by_percentile_year.min | 89 |
| countries_distinct_count | 2 |
| institutions_distinct_count | 5 |
| citation_normalized_percentile.value | 0.57193771 |
| citation_normalized_percentile.is_in_top_1_percent | False |
| citation_normalized_percentile.is_in_top_10_percent | False |