{"id":"https://openalex.org/W2172154692","doi":null,"title":"Enumerating Minimal Transversals of Geometric Hypergraphs","display_name":"Enumerating Minimal Transversals of Geometric Hypergraphs","publication_year":2011,"publication_date":"2011-01-01","ids":{"openalex":"https://openalex.org/W2172154692","mag":"2172154692"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.363.7221","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.363.7221","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.mpi-inf.mpg.de/~saurabh/Papers/geomtrans-parallel.pdf","raw_type":"text"},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5000070192","display_name":"Khaled Elbassioni","orcid":"https://orcid.org/0000-0001-7021-5400","observed_orcids":["https://orcid.org/0000-0001-7021-5400"]},"institutions":[{"id":"https://openalex.org/I149899117","display_name":"Max Planck Society","ror":"https://ror.org/01hhn8329","country_code":"DE","type":"nonprofit","lineage":["https://openalex.org/I149899117"]},{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Khaled Elbassioni","raw_affiliation_strings":["Algorithms and Complexity, MPI for Informatics, Max Planck Society"],"raw_orcid":"https://orcid.org/0000-0001-7021-5400","affiliations":[{"raw_affiliation_string":"Algorithms and Complexity, MPI for Informatics, Max Planck Society","institution_ids":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5090489459","display_name":"Imran Rauf","orcid":"https://orcid.org/0000-0001-9704-3362","observed_orcids":["https://orcid.org/0000-0001-9704-3362"]},"institutions":[{"id":"https://openalex.org/I149899117","display_name":"Max Planck Society","ror":"https://ror.org/01hhn8329","country_code":"DE","type":"nonprofit","lineage":["https://openalex.org/I149899117"]},{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Imran Rauf","raw_affiliation_strings":["Algorithms and Complexity, MPI for Informatics, Max Planck Society"],"raw_orcid":"https://orcid.org/0000-0001-9704-3362","affiliations":[{"raw_affiliation_string":"Algorithms and Complexity, MPI for Informatics, Max Planck Society","institution_ids":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5111453426","display_name":"Saurabh Ray","orcid":"https://orcid.org/0009-0005-6708-125X","observed_orcids":["https://orcid.org/0009-0005-6708-125X"]},"institutions":[{"id":"https://openalex.org/I149899117","display_name":"Max Planck Society","ror":"https://ror.org/01hhn8329","country_code":"DE","type":"nonprofit","lineage":["https://openalex.org/I149899117"]},{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Saurabh Ray","raw_affiliation_strings":["Algorithms and Complexity, MPI for Informatics, Max Planck Society"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Algorithms and Complexity, MPI for Informatics, Max Planck Society","institution_ids":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.4658,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.71857923,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":93},"biblio":{"volume":null,"issue":null,"first_page":"437","last_page":"442"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.47850000858306885,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.47850000858306885,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.2705000042915344,"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.14249999821186066,"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/minimal-transversals","display_name":"minimal transversals","score":0.8849999904632568},{"id":"https://openalex.org/keywords/minimal-hitting-sets","display_name":"minimal hitting sets","score":0.9850000143051147},{"id":"https://openalex.org/keywords/hypergraphs","display_name":"hypergraphs","score":0.6959999799728394},{"id":"https://openalex.org/keywords/geometric-hypergraphs","display_name":"geometric hypergraphs","score":0.8299999833106995},{"id":"https://openalex.org/keywords/recursive-decomposition","display_name":"recursive decomposition","score":0.8849999904632568},{"id":"https://openalex.org/keywords/half-space","display_name":"half-space","score":0.8939999938011169},{"id":"https://openalex.org/keywords/hyperrectangles","display_name":"hyperrectangles","score":0.8379999995231628},{"id":"https://openalex.org/keywords/balls","display_name":"balls","score":0.9259999990463257},{"id":"https://openalex.org/keywords/incremental-algorithms","display_name":"incremental algorithms","score":0.5040000081062317}],"concepts":[{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.9177216291427612},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7463269829750061},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7102891206741333},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5947181582450867},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.5893198847770691},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5503820180892944},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4869123697280884},{"id":"https://openalex.org/C143392562","wikidata":"https://www.wikidata.org/wiki/Q449111","display_name":"Subdivision","level":2,"score":0.47222140431404114},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.45201995968818665},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.4395342469215393},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.22857731580734253},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.13949686288833618},{"id":"https://openalex.org/C95457728","wikidata":"https://www.wikidata.org/wiki/Q309","display_name":"History","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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","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/C166957645","wikidata":"https://www.wikidata.org/wiki/Q23498","display_name":"Archaeology","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.363.7221","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.363.7221","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.mpi-inf.mpg.de/~saurabh/Papers/geomtrans-parallel.pdf","raw_type":"text"},{"id":"pmh:oai:edoc.mpg.de:618737","doi":null,"is_oa":false,"landing_page_url":"http://edoc.mpg.de/618737","pdf_url":null,"source":{"id":"https://openalex.org/S4406922265","display_name":"Max Planck Institute for Plasma Physics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Collette, Sebastien: 23rd Canadian Conference on Computational Geometry (CCCG 2011), CCCG, 437-442 (2011)","raw_type":"Conference-Paper"},{"id":"pmh:oai:pure.mpg.de:item_1562382","doi":null,"is_oa":false,"landing_page_url":"https://hdl.handle.net/11858/00-001M-0000-0010-1225-4","pdf_url":null,"source":{"id":"https://openalex.org/S4306400654","display_name":"MPG.PuRe (Max Planck Society)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I149899117","host_organization_name":"Max Planck Society","host_organization_lineage":["https://openalex.org/I149899117"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"23rd Canadian Conference on Computational Geometry","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"mag:2172154692","doi":null,"is_oa":false,"landing_page_url":"http://pubman.mpdl.mpg.de/pubman/item/escidoc:1562382","pdf_url":null,"source":{"id":"https://openalex.org/S4306417878","display_name":"Canadian Conference on Computational Geometry","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Canadian Conference on Computational Geometry","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W89605379","https://openalex.org/W1500050811","https://openalex.org/W1513731467","https://openalex.org/W1534621335","https://openalex.org/W1541296345","https://openalex.org/W1542486035","https://openalex.org/W1569588123","https://openalex.org/W1584379478","https://openalex.org/W1964691748","https://openalex.org/W1972004026","https://openalex.org/W1976127067","https://openalex.org/W2005389099","https://openalex.org/W2005390858","https://openalex.org/W2008756825","https://openalex.org/W2039904196","https://openalex.org/W2058509996","https://openalex.org/W2059155916","https://openalex.org/W2059378124","https://openalex.org/W2065895258","https://openalex.org/W2080947358","https://openalex.org/W2087134747","https://openalex.org/W2149906774","https://openalex.org/W2152927719"],"related_works":["https://openalex.org/W2892384318","https://openalex.org/W7100099205","https://openalex.org/W1569588123","https://openalex.org/W4327524431","https://openalex.org/W1590020939","https://openalex.org/W89605379","https://openalex.org/W7223146802","https://openalex.org/W2049703189","https://openalex.org/W1977514877","https://openalex.org/W7099208065"],"abstract_inverted_index":{"We":[0,38,65],"consider":[1],"the":[2,23,36,42,63,118,132,151],"problem":[3],"of":[4,10,31,33,62,87,93,98,103,117,154,162],"enumerating":[5],"all":[6,58,135],"minimal":[7,59,77,81,136,155],"hitting":[8,60,78,137],"sets":[9,61,79,138],"a":[11,19,29,45,49,85,91,96,159],"given":[12],"hypergraph":[13,43],"(V,":[14],"R),":[15],"where":[16],"V":[17,34],"is":[18,28,122],"finite":[20],"set,":[21],"called":[22,35],"vertex":[24],"set":[25,30,82,92,97,102],"and":[26,80,95,109,150],"R":[27],"subsets":[32],"hyperedges.":[37],"show":[39],"that,":[40],"when":[41],"admits":[44],"balanced":[46],"subdivision,":[47],"then":[48],"recursive":[50],"decomposition":[51,68],"can":[52,139],"be":[53,140],"used":[54],"to":[55,70],"obtain":[56,121],"efficiently":[57],"hypergraph.":[64],"apply":[66],"this":[67],"framework":[69],"get":[71],"incremental":[72],"polynomial-time":[73],"algorithms":[74,119],"for":[75,84],"finding":[76],"covers":[83],"number":[86,153,161],"hypergraphs":[88],"induced":[89],"by":[90],"points":[94],"geometric":[99,104],"objects.":[100],"The":[101],"objects":[105],"includes":[106],"half-spaces,":[107],"hyper-rectangles":[108],"balls,":[110],"in":[111,131,142,145],"fixed":[112],"dimension.":[113],"A":[114],"distinguishing":[115],"feature":[116],"we":[120],"that":[123,134],"they":[124],"admit":[125],"an":[126],"efficient":[127],"global":[128],"parallel":[129],"implementation,":[130],"sense":[133],"generated":[141],"polylogarithmic":[143],"time":[144],"|V":[146],"|,":[147],"|R":[148],"|":[149],"total":[152],"transversals":[156],"T,":[157],"using":[158],"polynomial":[160],"processors.":[163],"1":[164]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-09-21T07:43:02.447757","created_date":"2016-06-24T00:00:00"}