25 citations · 79 across the 15 of their papers we have counts for
Showing 2022Show all
2 papers · 1 filter
math.CO2022★ 1 cited
Complexity Framework For Forbidden Subgraphs I: The Framework
Matthew Johnson, Barnaby Martin, Jelle J. Oostveen +4
For any particular class of graphs, algorithms for computational problems restricted to the class often rely on structural properties that depend on the specific problem at hand. T…
cs.GT2022★ 10 cited
The Complexity of Matching Games: A Survey
Márton Benedek, Péter Biró, Matthew Johnson +2
Matching games naturally generalize assignment games, a well-known class of cooperative games. Interest in matching games has grown recently due to some breakthrough results and ne…