2 citations · 7 across the 15 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
math.CO2017
List Supermodular Coloring with Shorter Lists
Yu Yokoi
In 1995, Galvin proved that a bipartite graph admits a list edge coloring if every edge is assigned a color list of length , the maximum degree of the graph. This result…
cs.GT2017
Envy-free Matchings with Lower Quotas
Yu Yokoi
While every instance of the Hospitals/Residents problem admits a stable matching, the problem with lower quotas (HR-LQ) has instances with no stable matching. For such an instance,…