92 citations · 612 across the 42 of their papers we have counts for
8 papers · 1 filter
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…
ELRUNA: Elimination Rule-based Network Alignment
Zirou Qiu, Ruslan Shaydulin, Xiaoyuan Liu +3
Networks model a variety of complex phenomena across different domains. In many applications, one of the most essential tasks is to align two or more networks to infer the similari…
Multilevel Combinatorial Optimization Across Quantum Architectures
Hayato Ushijima-Mwesigwa, Ruslan Shaydulin, Christian F. A. Negre +3
Emerging quantum processors provide an opportunity to explore new approaches for solving traditional problems in the post Moore's law supercomputing era. However, the limited numbe…
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…
Multistart Methods for Quantum Approximate Optimization
Ruslan Shaydulin, Ilya Safro, Jeffrey Larson
Hybrid quantum-classical algorithms such as the quantum approximate optimization algorithm (QAOA) are considered one of the most promising approaches for leveraging near-term quant…
FOBE and HOBE: First- and High-Order Bipartite Embeddings
Justin Sybrandt, Ilya Safro
Typical graph embeddings may not capture type-specific bipartite graph features that arise in such areas as recommender systems, data visualization, and drug discovery. Machine lea…