{"id":"https://openalex.org/W7164839524","doi":"https://doi.org/10.4230/lipics.sea.2026.5","title":"BuffCut: Prioritized Buffered Streaming Graph Partitioning","display_name":"BuffCut: Prioritized Buffered Streaming Graph Partitioning","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7164839524","doi":"https://doi.org/10.4230/lipics.sea.2026.5"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:26009","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2026.5","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol371-sea2026/LIPIcs.SEA.2026.5/LIPIcs.SEA.2026.5.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},"type":"article","indexed_in":["datacite","doaj"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol371-sea2026/LIPIcs.SEA.2026.5/LIPIcs.SEA.2026.5.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5126919116","display_name":"Linus Baumg\u00e4rtner","orcid":null},"institutions":[{"id":"https://openalex.org/I223822909","display_name":"Heidelberg University","ror":"https://ror.org/038t36y30","country_code":"DE","type":"education","lineage":["https://openalex.org/I223822909"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Baumg\u00e4rtner, Linus","raw_affiliation_strings":["Heidelberg University, Germany"],"raw_orcid":"https://orcid.org/0009-0002-1488-4663","affiliations":[{"raw_affiliation_string":"Heidelberg University, Germany","institution_ids":["https://openalex.org/I223822909"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5065760924","display_name":"Adil Chhabra","orcid":null},"institutions":[{"id":"https://openalex.org/I223822909","display_name":"Heidelberg University","ror":"https://ror.org/038t36y30","country_code":"DE","type":"education","lineage":["https://openalex.org/I223822909"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Chhabra, Adil","raw_affiliation_strings":["Heidelberg University, Germany"],"raw_orcid":"https://orcid.org/0009-0009-5726-9389","affiliations":[{"raw_affiliation_string":"Heidelberg University, Germany","institution_ids":["https://openalex.org/I223822909"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5007475511","display_name":"Marcelo Fonseca Faraj","orcid":"https://orcid.org/0000-0001-7100-236X"},"institutions":[{"id":"https://openalex.org/I97750245","display_name":"Software (Spain)","ror":"https://ror.org/02ethns06","country_code":"ES","type":"company","lineage":["https://openalex.org/I4210087817","https://openalex.org/I97750245"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"Faraj, Marcelo Fonseca","raw_affiliation_strings":["A+W Software, Fenwald, Germany"],"raw_orcid":"https://orcid.org/0000-0001-7100-236X","affiliations":[{"raw_affiliation_string":"A+W Software, Fenwald, Germany","institution_ids":["https://openalex.org/I97750245"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5059665527","display_name":"Christian Schulz","orcid":"https://orcid.org/0000-0002-2823-3506"},"institutions":[{"id":"https://openalex.org/I223822909","display_name":"Heidelberg University","ror":"https://ror.org/038t36y30","country_code":"DE","type":"education","lineage":["https://openalex.org/I223822909"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Schulz, Christian","raw_affiliation_strings":["Heidelberg University, Germany"],"raw_orcid":"https://orcid.org/0000-0002-2823-3506","affiliations":[{"raw_affiliation_string":"Heidelberg University, Germany","institution_ids":["https://openalex.org/I223822909"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.61537281,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.7343000173568726,"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"}},"topics":[{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.7343000173568726,"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.1582999974489212,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.019200000911951065,"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/scalability","display_name":"Scalability","score":0.7405999898910522},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.696399986743927},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.5849999785423279},{"id":"https://openalex.org/keywords/locality","display_name":"Locality","score":0.5784000158309937},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5335000157356262},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4514999985694885},{"id":"https://openalex.org/keywords/buffer","display_name":"Buffer (optical fiber)","score":0.4180000126361847}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8222000002861023},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.7405999898910522},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.696399986743927},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.5849999785423279},{"id":"https://openalex.org/C2779808786","wikidata":"https://www.wikidata.org/wiki/Q6664603","display_name":"Locality","level":2,"score":0.5784000158309937},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5335000157356262},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4684000015258789},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.46630001068115234},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4514999985694885},{"id":"https://openalex.org/C145018004","wikidata":"https://www.wikidata.org/wiki/Q4985944","display_name":"Buffer (optical fiber)","level":2,"score":0.4180000126361847},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.3815999925136566},{"id":"https://openalex.org/C187166803","wikidata":"https://www.wikidata.org/wiki/Q2835831","display_name":"Streaming algorithm","level":3,"score":0.3508000075817108},{"id":"https://openalex.org/C107027933","wikidata":"https://www.wikidata.org/wiki/Q2006448","display_name":"Stream processing","level":2,"score":0.3391000032424927},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.32420000433921814},{"id":"https://openalex.org/C2989134064","wikidata":"https://www.wikidata.org/wiki/Q288510","display_name":"Execution time","level":2,"score":0.32350000739097595},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2921999990940094},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.2822999954223633},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.2782000005245209},{"id":"https://openalex.org/C48903430","wikidata":"https://www.wikidata.org/wiki/Q491370","display_name":"Graph partition","level":3,"score":0.2768999934196472},{"id":"https://openalex.org/C138236772","wikidata":"https://www.wikidata.org/wiki/Q25098575","display_name":"Edge device","level":3,"score":0.27570000290870667},{"id":"https://openalex.org/C2778456923","wikidata":"https://www.wikidata.org/wiki/Q5337692","display_name":"Edge computing","level":3,"score":0.2574000060558319}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:26009","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2026.5","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol371-sea2026/LIPIcs.SEA.2026.5/LIPIcs.SEA.2026.5.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},{"id":"doi:10.4230/lipics.sea.2026.5","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.sea.2026.5","pdf_url":null,"source":{"id":"https://openalex.org/S4393917817","display_name":"Leibniz international proceedings in informatics","issn_l":"1868-8969","issn":["1868-8969"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"ConferencePaper"}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:26009","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2026.5","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol371-sea2026/LIPIcs.SEA.2026.5/LIPIcs.SEA.2026.5.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7164839524.pdf","grobid_xml":"https://content.openalex.org/works/W7164839524.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Streaming":[0],"graph":[1],"partitioners":[2],"enable":[3],"resource-efficient":[4],"and":[5,19,66,118,147,170],"massively":[6],"scalable":[7],"partitioning,":[8],"but":[9],"one-pass":[10],"assignment":[11],"heuristics":[12],"are":[13,73],"highly":[14],"sensitive":[15],"to":[16,61,131],"stream":[17,43],"order":[18,69],"often":[20],"yield":[21],"substantially":[22],"higher":[23],"edge":[24,141,159],"cuts":[25,142],"than":[26],"in-memory":[27],"methods.":[28,129],"We":[29],"present":[30],"BuffCut,":[31],"a":[32,57,110],"buffered":[33,127],"streaming":[34,128],"partitioner":[35],"that":[36,122],"narrows":[37],"this":[38],"quality":[39],"gap,":[40],"particularly":[41],"when":[42],"ordering":[44],"is":[45,106],"adversarial,":[46],"by":[47,85,161],"combining":[48],"prioritized":[49,134],"buffering":[50,135],"with":[51,163],"batch-wise":[52],"multilevel":[53,111],"assignment.":[54,76],"BuffCut":[55,123,137],"maintains":[56],"bounded":[58],"priority":[59],"buffer":[60,93],"delay":[62],"poorly":[63],"informed":[64],"decisions":[65],"regulate":[67],"the":[68,88,92,95,102,132,153],"in":[70],"which":[71],"nodes":[72,90],"considered":[74],"for":[75],"It":[77],"incrementally":[78],"constructs":[79],"high-locality":[80],"batches":[81],"of":[82,167],"configurable":[83],"size":[84],"iteratively":[86],"inserting":[87],"highest-priority":[89],"from":[91,101],"into":[94],"batch,":[96],"effectively":[97],"recovering":[98],"locality":[99],"structure":[100],"stream.":[103],"Each":[104],"batch":[105],"then":[107],"assigned":[108],"via":[109],"partitioning":[112],"algorithm.":[113],"Experiments":[114],"on":[115],"diverse":[116],"real-world":[117],"synthetic":[119],"graphs":[120],"show":[121],"consistently":[124],"outperforms":[125],"state-of-the-art":[126],"Compared":[130],"strongest":[133],"baseline,":[136],"achieves":[138],"20.8%":[139],"fewer":[140],"while":[143],"running":[144],"2.9\u00d7":[145],"faster":[146],"using":[148],"11.3\u00d7":[149],"less":[150],"memory.":[151,172],"Against":[152],"next-best":[154],"batched":[155],"method,":[156],"it":[157],"reduces":[158],"cut":[160],"15.8%":[162],"only":[164],"modest":[165],"overheads":[166],"1.8\u00d7":[168],"runtime":[169],"1.09\u00d7":[171]},"counts_by_year":[],"updated_date":"2026-08-18T07:49:30.821534","created_date":"2026-06-16T00:00:00"}