{"id":"https://openalex.org/W3100115795","doi":"https://doi.org/10.1007/978-3-031-06901-7_6","title":"Faster Connectivity in\u00a0Low-Rank Hypergraphs via\u00a0Expander Decomposition","display_name":"Faster Connectivity in\u00a0Low-Rank Hypergraphs via\u00a0Expander Decomposition","publication_year":2022,"publication_date":"2022-01-01","ids":{"openalex":"https://openalex.org/W3100115795","doi":"https://doi.org/10.1007/978-3-031-06901-7_6","mag":"3100115795"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-031-06901-7_6","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-031-06901-7_6","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://researchprofiles.ku.dk/da/publications/537fcc2f-4797-423e-a4cd-3e7cb8c3a9c7","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5091028458","display_name":"Calvin Beideman","orcid":"https://orcid.org/0000-0001-8053-662X"},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Calvin Beideman","raw_affiliation_strings":["University of Illinois, Urbana-Champaign, Champaign, IL, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Illinois, Urbana-Champaign, Champaign, IL, USA","institution_ids":["https://openalex.org/I157725225"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5011591780","display_name":"Karthekeyan Chandrasekaran","orcid":"https://orcid.org/0000-0002-3421-7238"},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Karthekeyan Chandrasekaran","raw_affiliation_strings":["University of Illinois, Urbana-Champaign, Champaign, IL, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Illinois, Urbana-Champaign, Champaign, IL, USA","institution_ids":["https://openalex.org/I157725225"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5050217636","display_name":"Sagnik Mukhopadhyay","orcid":"https://orcid.org/0000-0002-3722-4679"},"institutions":[{"id":"https://openalex.org/I91136226","display_name":"University of Sheffield","ror":"https://ror.org/05krs5044","country_code":"GB","type":"education","lineage":["https://openalex.org/I91136226"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Sagnik Mukhopadhyay","raw_affiliation_strings":["University of Sheffield, Sheffield, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Sheffield, Sheffield, UK","institution_ids":["https://openalex.org/I91136226"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5074369690","display_name":"Danupon Nanongkai","orcid":"https://orcid.org/0000-0003-4468-2675"},"institutions":[{"id":"https://openalex.org/I124055696","display_name":"University of Copenhagen","ror":"https://ror.org/035b05819","country_code":"DK","type":"education","lineage":["https://openalex.org/I124055696"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Danupon Nanongkai","raw_affiliation_strings":["University of Copenhagen, Copenhagen, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Copenhagen, Copenhagen, Denmark","institution_ids":["https://openalex.org/I124055696"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5091028458"],"corresponding_institution_ids":["https://openalex.org/I157725225"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.3271,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.7767679,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"70","last_page":"83"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9993000030517578,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9993000030517578,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9987999796867371,"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.9961000084877014,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/hypergraph","display_name":"Hypergraph","score":0.955811619758606},{"id":"https://openalex.org/keywords/lambda","display_name":"Lambda","score":0.7148699164390564},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6653387546539307},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.5895432829856873},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5020058155059814},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.5006022453308105},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.45486706495285034},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.40844404697418213},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4041011333465576},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.10269930958747864}],"concepts":[{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.955811619758606},{"id":"https://openalex.org/C2778113609","wikidata":"https://www.wikidata.org/wiki/Q10897","display_name":"Lambda","level":2,"score":0.7148699164390564},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6653387546539307},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.5895432829856873},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5020058155059814},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.5006022453308105},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.45486706495285034},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40844404697418213},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4041011333465576},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.10269930958747864},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C120665830","wikidata":"https://www.wikidata.org/wiki/Q14620","display_name":"Optics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-031-06901-7_6","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-031-06901-7_6","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/537fcc2f-4797-423e-a4cd-3e7cb8c3a9c7","is_oa":true,"landing_page_url":"https://researchprofiles.ku.dk/da/publications/537fcc2f-4797-423e-a4cd-3e7cb8c3a9c7","pdf_url":null,"source":{"id":"https://openalex.org/S4306401983","display_name":"Research at the University of Copenhagen (University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I124055696","host_organization_name":"University of Copenhagen","host_organization_lineage":["https://openalex.org/I124055696"],"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":"Beideman , C , Chandrasekaran , K , Mukhopadhyay , S & Nanongkai , D 2022 , Faster Connectivity in\u00a0Low-Rank Hypergraphs via\u00a0Expander Decomposition . in K Aardal & L Sanit\u00e0 (eds) , Integer Programming and Combinatorial Optimization : 23rd International Conference, IPCO 2022, Proceedings . Springer Science+Business Media , Lecture Notes in Computer Science , vol. 13265 LNCS , pp. 70-83 , 23rd International Conference on Integer Programming and Combinatorial Optimization, IPCO 2022 , Eindhoven , Netherlands , 27/06/2022 . https://doi.org/10.1007/978-3-031-06901-7_6","raw_type":"contributionToPeriodical"}],"best_oa_location":{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/537fcc2f-4797-423e-a4cd-3e7cb8c3a9c7","is_oa":true,"landing_page_url":"https://researchprofiles.ku.dk/da/publications/537fcc2f-4797-423e-a4cd-3e7cb8c3a9c7","pdf_url":null,"source":{"id":"https://openalex.org/S4306401983","display_name":"Research at the University of Copenhagen (University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I124055696","host_organization_name":"University of Copenhagen","host_organization_lineage":["https://openalex.org/I124055696"],"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":"Beideman , C , Chandrasekaran , K , Mukhopadhyay , S & Nanongkai , D 2022 , Faster Connectivity in\u00a0Low-Rank Hypergraphs via\u00a0Expander Decomposition . in K Aardal & L Sanit\u00e0 (eds) , Integer Programming and Combinatorial Optimization : 23rd International Conference, IPCO 2022, Proceedings . Springer Science+Business Media , Lecture Notes in Computer Science , vol. 13265 LNCS , pp. 70-83 , 23rd International Conference on Integer Programming and Combinatorial Optimization, IPCO 2022 , Eindhoven , Netherlands , 27/06/2022 . https://doi.org/10.1007/978-3-031-06901-7_6","raw_type":"contributionToPeriodical"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1836977259","display_name":"Distributed and Dynamic Graph Algorithms and Complexity","funder_award_id":"715672","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G1890725643","display_name":null,"funder_award_id":"2019-05622","funder_id":"https://openalex.org/F4320322581","funder_display_name":"Vetenskapsr\u00e5det"},{"id":"https://openalex.org/G1981933775","display_name":null,"funder_award_id":"2015-04659","funder_id":"https://openalex.org/F4320322581","funder_display_name":"Vetenskapsr\u00e5det"},{"id":"https://openalex.org/G5234195991","display_name":"AF: Small: Cuts, Connectivity and Partitioning in Graphs, Hypergraphs and Beyond","funder_award_id":"1907937","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5827077194","display_name":"AF: Small: Collaborative Research: Matrix Signings and Algorithms for Expanders and Combinatorial Nullstellensatz","funder_award_id":"1814613","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6250541807","display_name":null,"funder_award_id":"CCF-1814613","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G847537906","display_name":null,"funder_award_id":"CCF-1907937","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320322581","display_name":"Vetenskapsr\u00e5det","ror":"https://ror.org/03zttf063"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":46,"referenced_works":["https://openalex.org/W95318493","https://openalex.org/W1557598286","https://openalex.org/W1927738121","https://openalex.org/W1964510837","https://openalex.org/W1971680255","https://openalex.org/W1978676170","https://openalex.org/W1995027289","https://openalex.org/W2025622191","https://openalex.org/W2035228443","https://openalex.org/W2043525538","https://openalex.org/W2064493067","https://openalex.org/W2067062892","https://openalex.org/W2072027869","https://openalex.org/W2168919539","https://openalex.org/W2491454164","https://openalex.org/W2565540516","https://openalex.org/W2569104968","https://openalex.org/W2569484595","https://openalex.org/W2571471359","https://openalex.org/W2779965945","https://openalex.org/W2903204436","https://openalex.org/W2903365982","https://openalex.org/W2903538031","https://openalex.org/W2922372630","https://openalex.org/W2951903603","https://openalex.org/W2962708254","https://openalex.org/W2963702123","https://openalex.org/W2963939329","https://openalex.org/W2963972775","https://openalex.org/W2964010100","https://openalex.org/W2964121826","https://openalex.org/W2983782154","https://openalex.org/W3000941460","https://openalex.org/W3000986974","https://openalex.org/W3016564237","https://openalex.org/W3020969699","https://openalex.org/W3035645591","https://openalex.org/W3037081898","https://openalex.org/W3078970133","https://openalex.org/W3100115795","https://openalex.org/W3127776752","https://openalex.org/W3128057791","https://openalex.org/W3129188913","https://openalex.org/W3166491318","https://openalex.org/W3185907769","https://openalex.org/W4250100115"],"related_works":["https://openalex.org/W4376608589","https://openalex.org/W1537073411","https://openalex.org/W1948107826","https://openalex.org/W3138003926","https://openalex.org/W1630514295","https://openalex.org/W4300037846","https://openalex.org/W4288275998","https://openalex.org/W2963081352","https://openalex.org/W4376608938","https://openalex.org/W2472555608"],"abstract_inverted_index":null,"counts_by_year":[{"year":2022,"cited_by_count":2}],"updated_date":"2026-05-17T08:19:37.847499","created_date":"2025-10-10T00:00:00"}