3 citations · 12 across the 26 of their papers we have counts for
3 papers · 1 filter
Graph Coloring with Color Preferences
Tomohiro Koana, Yeeseok Oh, Hirotaka Yoneda
We study graph coloring with color preferences, in which each vertex ranks the available colors. In addition to assigning different colors to adjacent vertices, we require the colo…
Stable Matching with Multilayer Approval Preferences: Approvals can be Harder than Strict Preferences
Matthias Bentert, Niclas Boehmer, Klaus Heeger +1
We study stable matching problems where agents have multilayer preferences: There are layers each consisting of one preference relation for each agent. Recently, Chen et al.…
A Refined Complexity Analysis of Fair Districting over Graphs
Niclas Boehmer, Tomohiro Koana, Rolf Niedermeier
We study the NP-hard Fair Connected Districting problem recently proposed by Stoica et al. [AAMAS 2020]: Partition a vertex-colored graph into k connected components (subsequently…