{"id":"https://openalex.org/W2963869326","doi":"https://doi.org/10.1145/3355502","title":"Scalable Kernelization for Maximum Independent Sets","display_name":"Scalable Kernelization for Maximum Independent Sets","publication_year":2019,"publication_date":"2019-09-23","ids":{"openalex":"https://openalex.org/W2963869326","doi":"https://doi.org/10.1145/3355502","mag":"2963869326"},"language":"en","primary_location":{"id":"doi:10.1145/3355502","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3355502","pdf_url":null,"source":{"id":"https://openalex.org/S201104086","display_name":"ACM Journal of Experimental Algorithmics","issn_l":"1084-6654","issn":["1084-6654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Journal of Experimental Algorithmics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"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/A5088448220","display_name":"Demian Hespe","orcid":"https://orcid.org/0000-0001-6232-2951"},"institutions":[{"id":"https://openalex.org/I102335020","display_name":"Karlsruhe Institute of Technology","ror":"https://ror.org/04t3en479","country_code":"DE","type":"education","lineage":["https://openalex.org/I102335020","https://openalex.org/I1305996414"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Demian Hespe","raw_affiliation_strings":["Karlsruhe Institute of Technology, Karlsruhe, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Karlsruhe Institute of Technology, Karlsruhe, Germany","institution_ids":["https://openalex.org/I102335020"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5059665527","display_name":"Christian Schulz","orcid":"https://orcid.org/0000-0002-2823-3506"},"institutions":[{"id":"https://openalex.org/I129774422","display_name":"University of Vienna","ror":"https://ror.org/03prydq77","country_code":"AT","type":"education","lineage":["https://openalex.org/I129774422"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Christian Schulz","raw_affiliation_strings":["University of Vienna, Vienna, Austria"],"raw_orcid":"https://orcid.org/0000-0002-2823-3506","affiliations":[{"raw_affiliation_string":"University of Vienna, Vienna, Austria","institution_ids":["https://openalex.org/I129774422"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5066225806","display_name":"Darren Strash","orcid":"https://orcid.org/0000-0001-7095-8749"},"institutions":[{"id":"https://openalex.org/I188592606","display_name":"Hamilton College","ror":"https://ror.org/05709zb94","country_code":"US","type":"education","lineage":["https://openalex.org/I188592606"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Darren Strash","raw_affiliation_strings":["Hamilton College, Clinton, NY, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Hamilton College, Clinton, NY, USA","institution_ids":["https://openalex.org/I188592606"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.6494,"has_fulltext":false,"cited_by_count":42,"citation_normalized_percentile":{"value":0.95250787,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"24","issue":null,"first_page":"1","last_page":"22"},"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.9991999864578247,"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.9991999864578247,"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.9984999895095825,"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.9980999827384949,"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/kernelization","display_name":"Kernelization","score":0.9926916360855103},{"id":"https://openalex.org/keywords/kernel","display_name":"Kernel (algebra)","score":0.6267446279525757},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6132874488830566},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.6093348264694214},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.5466908812522888},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5202566385269165},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.49269989132881165},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4825100898742676},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.4805484414100647},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.39824438095092773},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3522131145000458},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3178500235080719},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.14697062969207764},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.09751403331756592}],"concepts":[{"id":"https://openalex.org/C207225210","wikidata":"https://www.wikidata.org/wiki/Q1759539","display_name":"Kernelization","level":3,"score":0.9926916360855103},{"id":"https://openalex.org/C74193536","wikidata":"https://www.wikidata.org/wiki/Q574844","display_name":"Kernel (algebra)","level":2,"score":0.6267446279525757},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6132874488830566},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.6093348264694214},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.5466908812522888},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5202566385269165},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.49269989132881165},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4825100898742676},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.4805484414100647},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.39824438095092773},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3522131145000458},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3178500235080719},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.14697062969207764},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.09751403331756592},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3355502","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3355502","pdf_url":null,"source":{"id":"https://openalex.org/S201104086","display_name":"ACM Journal of Experimental Algorithmics","issn_l":"1084-6654","issn":["1084-6654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Journal of Experimental Algorithmics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4594401354","display_name":null,"funder_award_id":"SCHU 2567/1-2","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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":47,"referenced_works":["https://openalex.org/W91900014","https://openalex.org/W125936143","https://openalex.org/W324754135","https://openalex.org/W1442132175","https://openalex.org/W1518653692","https://openalex.org/W1592025499","https://openalex.org/W1594785451","https://openalex.org/W1779781738","https://openalex.org/W1971393213","https://openalex.org/W1974692335","https://openalex.org/W1983402337","https://openalex.org/W1992539276","https://openalex.org/W2000273502","https://openalex.org/W2003579987","https://openalex.org/W2008362324","https://openalex.org/W2011039300","https://openalex.org/W2013415302","https://openalex.org/W2015963099","https://openalex.org/W2026771935","https://openalex.org/W2068617151","https://openalex.org/W2083748805","https://openalex.org/W2096592688","https://openalex.org/W2097844290","https://openalex.org/W2098667053","https://openalex.org/W2103112216","https://openalex.org/W2116450608","https://openalex.org/W2117942072","https://openalex.org/W2159308691","https://openalex.org/W2289173650","https://openalex.org/W2330997992","https://openalex.org/W2462938652","https://openalex.org/W2496359038","https://openalex.org/W2513955757","https://openalex.org/W2529573338","https://openalex.org/W2531503199","https://openalex.org/W2561675875","https://openalex.org/W2591291103","https://openalex.org/W2609578772","https://openalex.org/W2612032746","https://openalex.org/W2644409602","https://openalex.org/W2732288815","https://openalex.org/W2742477721","https://openalex.org/W2749469150","https://openalex.org/W2952587811","https://openalex.org/W2962800229","https://openalex.org/W2963017687","https://openalex.org/W4242903830"],"related_works":["https://openalex.org/W3020640542","https://openalex.org/W2476602023","https://openalex.org/W4245720151","https://openalex.org/W2381408042","https://openalex.org/W1606657688","https://openalex.org/W4318567365","https://openalex.org/W2909144890","https://openalex.org/W17508780","https://openalex.org/W4312723892","https://openalex.org/W2783065147"],"abstract_inverted_index":{"The":[0,28],"most":[1],"efficient":[2,95],"algorithms":[3,49,73],"for":[4,71],"finding":[5],"maximum":[6,106],"independent":[7,212],"sets":[8,213],"in":[9,44],"both":[10,87],"theory":[11],"and":[12,60,78,103,129,219],"practice":[13],"use":[14],"reduction":[15,130],"rules":[16],"to":[17,85,116,135,169,175,182,201,209],"obtain":[18],"a":[19,25,55,62,80,160],"much":[20],"smaller":[21,152],"problem":[22],"instance":[23],"called":[24],"kernel":[26,29,57],".":[27],"can":[30,198],"then":[31],"be":[32,127,199],"solved":[33],"quickly":[34],"using":[35],"exact":[36],"or":[37,58],"heuristic":[38,205],"algorithms\u2014or":[39],"by":[40,92],"repeatedly":[41],"kernelizing":[42],"recursively":[43],"the":[45,154,176],"branch-and-reduce":[46],"paradigm.":[47],"Current":[48],"are":[50,148],"either":[51],"slow":[52],"but":[53,180],"produce":[54],"small":[56,81],"fast":[59,77],"give":[61],"large":[63,216],"kernel.":[64,82],"Yet":[65],"it":[66],"is":[67,76,167],"of":[68,88,150,185],"critical":[69],"importance":[70],"these":[72,89],"that":[74,122,125,132,147,194],"kernelization":[75,97,118,137,156,196],"returns":[79],"We":[83,108],"attempt":[84],"accomplish":[86],"goals":[90],"simultaneously":[91],"giving":[93],"an":[94],"parallel":[96,104],"algorithm":[98,144,166,197],"based":[99],"on":[100,215],"graph":[101],"partitioning":[102],"bipartite":[105],"matching.":[107],"combine":[109],"our":[110,165,195],"parallelization":[111],"techniques":[112,115],"with":[113,172],"two":[114,183],"accelerate":[117,202],"further:":[119],"dependency":[120],"checking":[121],"prunes":[123],"reductions":[124,139],"cannot":[126],"applied,":[128],"tracking":[131],"allows":[133],"us":[134,208],"stop":[136],"when":[138],"become":[140],"less":[141],"fruitful.":[142],"Our":[143],"produces":[145],"kernels":[146,171,179],"orders":[149,184],"magnitude":[151,186],"than":[153,188],"fastest":[155],"methods":[157],"while":[158],"having":[159],"similar":[161],"execution":[162],"time.":[163],"Furthermore,":[164],"able":[168],"compute":[170],"size":[173],"comparable":[174],"smallest":[177],"known":[178],"up":[181],"faster":[187,214],"possible":[189],"previously.":[190],"Finally,":[191],"we":[192],"show":[193],"used":[200],"existing":[203],"state-of-the-art":[204],"algorithms,":[206],"allowing":[207],"find":[210],"larger":[211],"real-world":[217],"networks":[218],"synthetic":[220],"instances.":[221]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":7},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":9},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}