{"id":"https://openalex.org/W2003529351","doi":"https://doi.org/10.1137/s0097539797323716","title":"The Algorithmic Aspects of Uncrowded Hypergraphs","display_name":"The Algorithmic Aspects of Uncrowded Hypergraphs","publication_year":1999,"publication_date":"1999-01-01","ids":{"openalex":"https://openalex.org/W2003529351","doi":"https://doi.org/10.1137/s0097539797323716","mag":"2003529351"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539797323716","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539797323716","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.17877/de290r-14502","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5061412461","display_name":"Claudia Bertram\u2010Kretzberg","orcid":null},"institutions":[{"id":"https://openalex.org/I200332995","display_name":"TU Dortmund University","ror":"https://ror.org/01k97gp34","country_code":"DE","type":"education","lineage":["https://openalex.org/I200332995"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Claudia Bertram-Kretzberg","raw_affiliation_strings":["Lehrstuhl Informatik II, Universit at Dortmund, D-44221 Dortmund, Germany"],"affiliations":[{"raw_affiliation_string":"Lehrstuhl Informatik II, Universit at Dortmund, D-44221 Dortmund, Germany","institution_ids":["https://openalex.org/I200332995"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5111723650","display_name":"Hanno Lefmann","orcid":null},"institutions":[{"id":"https://openalex.org/I200332995","display_name":"TU Dortmund University","ror":"https://ror.org/01k97gp34","country_code":"DE","type":"education","lineage":["https://openalex.org/I200332995"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Hanno Lefmann","raw_affiliation_strings":["Lehrstuhl Informatik II, Universit at Dortmund, D-44221 Dortmund, Germany"],"affiliations":[{"raw_affiliation_string":"Lehrstuhl Informatik II, Universit at Dortmund, D-44221 Dortmund, Germany","institution_ids":["https://openalex.org/I200332995"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5061412461"],"corresponding_institution_ids":["https://openalex.org/I200332995"],"apc_list":null,"apc_paid":null,"fwci":2.4426,"has_fulltext":false,"cited_by_count":29,"citation_normalized_percentile":{"value":0.88183974,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"29","issue":"1","first_page":"201","last_page":"230"},"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.9998999834060669,"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.9998999834060669,"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.9998000264167786,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9988999962806702,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/hypergraph","display_name":"Hypergraph","score":0.92780601978302},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6237133145332336},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6193878650665283},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6108654737472534},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.579643726348877},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5687968730926514},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.47442692518234253},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.446170449256897},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4362286925315857},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.26402318477630615},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.22000953555107117}],"concepts":[{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.92780601978302},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6237133145332336},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6193878650665283},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6108654737472534},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.579643726348877},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5687968730926514},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.47442692518234253},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.446170449256897},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4362286925315857},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.26402318477630615},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.22000953555107117},{"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1137/s0097539797323716","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539797323716","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.36.4296","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.36.4296","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://sfbci.informatik.uni-dortmund.de/home/English/Publications/Reference/Downloads/BKL97b.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.48.1795","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.48.1795","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.tcs.mu-luebeck.de/Forschung/A9710.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.91.748","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.91.748","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://dspace.hrz.uni-dortmund.de:8080/bitstream/2003/5318/2/ci0797doc.pdf","raw_type":"text"},{"id":"pmh:oai:eldorado.tu-dortmund.de:2003/5318","is_oa":false,"landing_page_url":"http://hdl.handle.net/2003/5318","pdf_url":null,"source":{"id":"https://openalex.org/S4306400811","display_name":"Technische Universit\u00e4t Dortmund Eldorado (Technische Universit\u00e4t Dortmund)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210148506","host_organization_name":"Erich-Brost-Institut","host_organization_lineage":["https://openalex.org/I4210148506"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"doc-type:Text"},{"id":"doi:10.17877/de290r-14502","is_oa":true,"landing_page_url":"https://doi.org/10.17877/de290r-14502","pdf_url":null,"source":{"id":"https://openalex.org/S4306400811","display_name":"Technische Universit\u00e4t Dortmund Eldorado (Technische Universit\u00e4t Dortmund)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210148506","host_organization_name":"Erich-Brost-Institut","host_organization_lineage":["https://openalex.org/I4210148506"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"report"}],"best_oa_location":{"id":"doi:10.17877/de290r-14502","is_oa":true,"landing_page_url":"https://doi.org/10.17877/de290r-14502","pdf_url":null,"source":{"id":"https://openalex.org/S4306400811","display_name":"Technische Universit\u00e4t Dortmund Eldorado (Technische Universit\u00e4t Dortmund)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210148506","host_organization_name":"Erich-Brost-Institut","host_organization_lineage":["https://openalex.org/I4210148506"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"report"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3171094092","display_name":null,"funder_award_id":"SFB 531","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"}],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W1570328429","https://openalex.org/W1964089073","https://openalex.org/W1974136796","https://openalex.org/W1981515128","https://openalex.org/W1987254493","https://openalex.org/W1987432133","https://openalex.org/W1995077491","https://openalex.org/W2003665833","https://openalex.org/W2010583864","https://openalex.org/W2010961669","https://openalex.org/W2011164326","https://openalex.org/W2011343037","https://openalex.org/W2026207439","https://openalex.org/W2030243808","https://openalex.org/W2062230178","https://openalex.org/W2071474047","https://openalex.org/W2074920973","https://openalex.org/W2076597612","https://openalex.org/W2083187124","https://openalex.org/W2089247135","https://openalex.org/W2093784222","https://openalex.org/W2097022377","https://openalex.org/W2124088817","https://openalex.org/W2128452148","https://openalex.org/W2143386956","https://openalex.org/W2987732947","https://openalex.org/W3011766368","https://openalex.org/W4235946010"],"related_works":["https://openalex.org/W4376608589","https://openalex.org/W3138003926","https://openalex.org/W4300037846","https://openalex.org/W1630514295","https://openalex.org/W1537073411","https://openalex.org/W2963081352","https://openalex.org/W4376608938","https://openalex.org/W4288275998","https://openalex.org/W2472555608","https://openalex.org/W4319874546"],"abstract_inverted_index":{"We":[0],"consider":[1],"the":[2,27,30,49,75,77,80,84,88,94,112,119,124],"problem":[3],"of":[4,11,32,63,107],"finding":[5],"deterministically":[6],"a":[7,15,45,60],"large":[8],"independent":[9],"set":[10],"guaranteed":[12],"size":[13,51],"in":[14,48],"hypergraph":[16],"on":[17],"n":[18,71],"vertices":[19],"and":[20],"with":[21,38,103],"m":[22,66],"edges.":[23],"With":[24],"respect":[25],"to":[26,87,128],"Turan":[28],"bound,":[29],"quality":[31],"our":[33],"solutions":[34,102,106],"is":[35],"for":[36,93,97],"hypergraphs":[37,78],"not":[39],"too":[40],"many":[41],"small":[42],"cycles":[43],"by":[44],"logarithmic":[46],"factor":[47],"input":[50],"better.":[52],"The":[53,131],"algorithms":[54],"are":[55,79,83,134],"fast;":[56],"they":[57],"often":[58],"have":[59],"running":[61,85],"time":[62,96],"O":[64],"(":[65,70],")":[67],"+":[68],"o":[69],"3":[72],").":[73],"Indeed,":[74],"denser":[76],"more":[81],"close":[82],"times":[86],"linear":[89],"ones.":[90],"This":[91],"gives":[92],"first":[95],"some":[98,117],"combinatorial":[99],"problems":[100],"algorithmic":[101],"state-of-the-art":[104],"quality,":[105],"which":[108],"so":[109],"far":[110],"only":[111],"existence":[113],"was":[114],"known.":[115],"In":[116],"cases,":[118],"corresponding":[120],"upper":[121],"bounds":[122,126],"match":[123],"lower":[125],"up":[127],"constant":[129],"factors.":[130],"involved":[132],"concepts":[133],"uncrowded":[135],"hypergraphs.":[136]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":2}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}