{"id":"https://openalex.org/W2761985283","doi":"https://doi.org/10.1007/s00453-016-0207-y","title":"Building Efficient and Compact Data Structures for Simplicial Complexes","display_name":"Building Efficient and Compact Data Structures for Simplicial Complexes","publication_year":2016,"publication_date":"2016-09-08","ids":{"openalex":"https://openalex.org/W2761985283","doi":"https://doi.org/10.1007/s00453-016-0207-y","mag":"2761985283"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-016-0207-y","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-016-0207-y","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1503.07444","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Jean-Daniel Boissonnat","orcid":null},"institutions":[{"id":"https://openalex.org/I4210106545","display_name":"Centre Inria d'Universit\u00e9 C\u00f4te d'Azur","ror":"https://ror.org/01nzkaw91","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1326498283","https://openalex.org/I201841394","https://openalex.org/I4210106545"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Jean-Daniel Boissonnat","raw_affiliation_strings":["Geometrica, INRIA Sophia Antipolis-M\u00e9diterran\u00e9e, 2004 route des Lucioles, BP 93, 06902, Sophia Antipolis, France"],"affiliations":[{"raw_affiliation_string":"Geometrica, INRIA Sophia Antipolis-M\u00e9diterran\u00e9e, 2004 route des Lucioles, BP 93, 06902, Sophia Antipolis, France","institution_ids":["https://openalex.org/I4210106545"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Karthik C. S.","orcid":"https://orcid.org/0000-0001-9105-364X"},"institutions":[{"id":"https://openalex.org/I53964585","display_name":"Weizmann Institute of Science","ror":"https://ror.org/0316ej306","country_code":"IL","type":"education","lineage":["https://openalex.org/I53964585"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Karthik C. S.","raw_affiliation_strings":["Department of Computer Science and Applied Mathematics, Weizmann Institute of Science, Rehovot, Israel"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Applied Mathematics, Weizmann Institute of Science, Rehovot, Israel","institution_ids":["https://openalex.org/I53964585"]}]},{"author_position":"last","author":{"id":null,"display_name":"S\u00e9bastien Tavenas","orcid":null},"institutions":[{"id":"https://openalex.org/I4210124949","display_name":"Microsoft Research (India)","ror":"https://ror.org/02w7f3w92","country_code":"IN","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4210124949"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"S\u00e9bastien Tavenas","raw_affiliation_strings":["Microsoft Research India, Bangalore, India"],"affiliations":[{"raw_affiliation_string":"Microsoft Research India, Bangalore, India","institution_ids":["https://openalex.org/I4210124949"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I4210106545"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":6.8281,"has_fulltext":false,"cited_by_count":26,"citation_normalized_percentile":{"value":0.97008183,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":"79","issue":"2","first_page":"530","last_page":"567"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12536","display_name":"Topological and Geometric Data Analysis","score":0.4302999973297119,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12536","display_name":"Topological and Geometric Data Analysis","score":0.4302999973297119,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.0544000007212162,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11435","display_name":"Polynomial and algebraic computation","score":0.04960000142455101,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/simplex","display_name":"Simplex","score":0.9225999712944031},{"id":"https://openalex.org/keywords/simplicial-approximation-theorem","display_name":"Simplicial approximation theorem","score":0.6773999929428101},{"id":"https://openalex.org/keywords/simplicial-complex","display_name":"Simplicial complex","score":0.656000018119812},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.6373999714851379},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.5807999968528748},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.5350000262260437},{"id":"https://openalex.org/keywords/simplicial-homology","display_name":"Simplicial homology","score":0.47429999709129333},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.46549999713897705}],"concepts":[{"id":"https://openalex.org/C62438384","wikidata":"https://www.wikidata.org/wiki/Q331350","display_name":"Simplex","level":2,"score":0.9225999712944031},{"id":"https://openalex.org/C64245159","wikidata":"https://www.wikidata.org/wiki/Q3983972","display_name":"Simplicial approximation theorem","level":5,"score":0.6773999929428101},{"id":"https://openalex.org/C187929450","wikidata":"https://www.wikidata.org/wiki/Q994399","display_name":"Simplicial complex","level":2,"score":0.656000018119812},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.6373999714851379},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5940999984741211},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.5807999968528748},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.5350000262260437},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.48890000581741333},{"id":"https://openalex.org/C3469331","wikidata":"https://www.wikidata.org/wiki/Q7520902","display_name":"Simplicial homology","level":3,"score":0.47429999709129333},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.46549999713897705},{"id":"https://openalex.org/C144521790","wikidata":"https://www.wikidata.org/wiki/Q134164","display_name":"Simplex algorithm","level":3,"score":0.4433000087738037},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.43479999899864197},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3889999985694885},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.382999986410141},{"id":"https://openalex.org/C146867743","wikidata":"https://www.wikidata.org/wiki/Q4669959","display_name":"Abstract simplicial complex","level":3,"score":0.3659000098705292},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3337000012397766},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.296999990940094},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2946999967098236},{"id":"https://openalex.org/C97172818","wikidata":"https://www.wikidata.org/wiki/Q7520904","display_name":"Simplicial manifold","level":5,"score":0.2773999869823456},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.2624000012874603},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.2614000141620636},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.2506999969482422}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1007/s00453-016-0207-y","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-016-0207-y","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1503.07444","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1503.07444","pdf_url":"https://arxiv.org/pdf/1503.07444","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:HAL:hal-01364648v1","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-01364648","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithmica, 2016, ⟨10.1007/s00453-016-0207-y⟩","raw_type":"Journal articles"},{"id":"pmh:oai:alma.01RUT_INST:11739998450004646","is_oa":false,"landing_page_url":"https://scholarship.libraries.rutgers.edu/esploro/outputs/journalArticle/Building-efficient-and-compact-data-structures/991031913591904646","pdf_url":null,"source":{"id":"https://openalex.org/S4210197018","display_name":"View","issn_l":"2688-268X","issn":["2688-268X","2688-3988"],"is_oa":false,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1503.07444","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1503.07444","pdf_url":"https://arxiv.org/pdf/1503.07444","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3216667337","display_name":null,"funder_award_id":"339025","funder_id":"https://openalex.org/F4320334678","funder_display_name":"European Research Council"},{"id":"https://openalex.org/G3250529209","display_name":null,"funder_award_id":"239985","funder_id":"https://openalex.org/F4320334678","funder_display_name":"European Research Council"}],"funders":[{"id":"https://openalex.org/F4320334678","display_name":"European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W46010928","https://openalex.org/W1567562836","https://openalex.org/W1938991448","https://openalex.org/W1976776761","https://openalex.org/W1993179765","https://openalex.org/W2012912284","https://openalex.org/W2033740195","https://openalex.org/W2037872771","https://openalex.org/W2059637144","https://openalex.org/W2070830131","https://openalex.org/W2088432971","https://openalex.org/W2107822224","https://openalex.org/W2111868903","https://openalex.org/W2122493035","https://openalex.org/W2123135686","https://openalex.org/W2154478838","https://openalex.org/W2224115673","https://openalex.org/W2401610261","https://openalex.org/W3103629626","https://openalex.org/W4252017042"],"related_works":[],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":16},{"year":2017,"cited_by_count":2}],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2017-10-20T00:00:00"}