3 citations · 13 across the 8 of their papers we have counts for
Showing 2018Show all
3 papers · 1 filter
cs.GT2018
Simple Games versus Weighted Voting Games: Bounding the Critical Threshold Value
Frits Hof, Walter Kern, Sascha Kurz +2
A simple game is given by a set of players and a partition of~ into a set~ of losing coalitions~ with value that is closed under takin…
cs.DS2018
Contracting to a Longest Path in H-Free Graphs
Walter Kern, Daniel Paulusma
We prove two dichotomy results for detecting long paths as patterns in a given graph. The NP-hard problem Longest Induced Path is to determine the longest induced path in a graph.…
cs.GT2018★ 3 cited
Simple Games versus Weighted Voting Games
Frits Hof, Walter Kern, Sascha Kurz +1
A simple game is given by a set of players and a partition of into a set of losing coalitions with value that is closed under takin…