92 citations · 612 across the 42 of their papers we have counts for
12 papers · 1 filter
Open Problems in (Hyper)Graph Decomposition
Deepak Ajwani, Rob H. Bisseling, Katrin Casel +26
Large networks are useful in a wide range of applications. Sometimes problem instances are composed of billions of entities. Decomposing and analyzing these structures helps us gai…
Recent Advances in Scalable Network Generation
Manuel Penschuck, Ulrik Brandes, Michael Hamann +5
Random graph models are frequently used as a controllable and versatile data source for experimental campaigns in various research fields. Generating such data-sets at scale is a n…
Leveraging Special-Purpose Hardware for Local Search Heuristics
Xiaoyuan Liu, Hayato Ushijima-Mwesigwa, Avradip Mandal +3
As we approach the physical limits predicted by Moore's law, a variety of specialized hardware is emerging to tackle specialized tasks in different domains. Within combinatorial op…
Hypergraph Partitioning With Embeddings
Justin Sybrandt, Ruslan Shaydulin, Ilya Safro
Problems in scientific computing, such as distributing large sparse matrix operations, have analogous formulations as hypergraph partitioning problems. A hypergraph is a generaliza…
Aggregative Coarsening for Multilevel Hypergraph Partitioning
Ruslan Shaydulin, Ilya Safro
Algorithms for many hypergraph problems, including partitioning, utilize multilevel frameworks to achieve a good trade-off between the performance and the quality of results. In th…
A Multilevel Bilinear Programming Algorithm For the Vertex Separator Problem
William W. Hager, James T. Hungerford, Ilya Safro
The Vertex Separator Problem for a graph is to find the smallest collection of vertices whose removal breaks the graph into two disconnected subsets that satisfy specified size con…