activity
20232026
most citedQAOA with fewer qubits: a coupling framework to solve larger-scale Max-Cut problem

2 citations · 2 across the 2 of their papers we have counts for

collaborators
Showing cs.DSShow all

2 papers · 1 filter

cs.DS2026

Pure Nash Equilibria in Graphical Games of Bounded Width Revisited

Michael Lampis, Yiren Lu

We revisit the complexity of deciding whether a graphical game admits a pure Nash equilibrium (PNE) parameterized by standard measures of the input graph, such as treewidth. The na…

cs.DS2025

Forcing a unique minimum spanning tree and a unique shortest path

Tatsuya Gima, Andreas Grigorjew, Yasuaki Kobayashi +7

A forcing set in a combinatorial problem is a set of elements such that there is a unique solution that contains all the elements in . An anti-forcing set is the symmetric c…