BEGIN:VCALENDAR
VERSION:2.0
PRODID:Linklings LLC
BEGIN:VTIMEZONE
TZID:Europe/Stockholm
X-LIC-LOCATION:Europe/Stockholm
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:19700308T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=-1SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:19701101T020000
RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=-1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20260625T133336Z
LOCATION:Bldg. 8 - Entrance Hall
DTSTART;TZID=Europe/Stockholm:20260630T173000
DTEND;TZID=Europe/Stockholm:20260630T194500
UID:submissions.pasc-conference.org_PASC26_sess135_posC114@linklings.com
SUMMARY:ACMP05 - Hypergraph Partitioning for Sparse Matrix Reordering
DESCRIPTION:Ritvik Ranjan (ETH Zurich)\n\nFill-in during sparse matrix fac
 torization remains a critical bottleneck in scientific computing. We prese
 nt an efficient hypergraph partitioning approach for sparse matrix reorder
 ing based on the Clique-Node Hypergraph (CNH) representation, building on 
 prior work by Çatalyurek et al. and Selvitopi et al. Our method transforms
  the sparsity pattern through an edge-clique cover, creating a hypergraph 
 where cliques become nodes and original vertices become nets. Using a hype
 rgraph partitioner, we generate a symmetric diagonal block form with a sep
 arator, then apply established ordering methods to each block. Across a be
 nchmark suite of SuiteSparse matrices, our approach achieves fill-in reduc
 tions competitive with METIS, often outperforming it. This work demonstrat
 es that hypergraph partitioning is a practical alternative for fill-in min
 imization.\n\n
END:VEVENT
END:VCALENDAR