4 citations · 5 across the 3 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
cs.DS2021
Hitting Weighted Even Cycles in Planar Graphs
Alexander Göke, Jochen Koenemann, Matthias Mnich +1
A classical branch of graph algorithms is graph transversals, where one seeks a minimum-weight subset of nodes in a node-weighted graph which intersects all copies of subgraphs…
cs.GT2021★ 1 cited
On the Complexity of Nucleolus Computation for Bipartite b-Matching Games
Jochen Koenemann, Justin Toth, Felix Zhou
We explore the complexity of nucleolus computation in b-matching games on bipartite graphs. We show that computing the nucleolus of a simple b-matching game is NP-hard even on bipa…