van der Zanden, Tom C.

1. Parameterized Complexity of Graph Constraint Logic
   2015/09/09 by van der Zanden, Tom C. · 3 citations
   #Computational Complexity (cs.CC) #F.2.2 #FOS: Computer and information sciences
2. Hedonic Seat Arrangement Problems
   2020/02/25 by Bodlaender, Hans L., Hanaka, Tesshu, Jaffke, Lars +3 · 4 citations
   #Computational Complexity (cs.CC) #Computer Science and Game Theory (cs.GT) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
3. Subgraph Isomorphism on Graph Classes that Exclude a Substructure
   2019/05/25 by Bodlaender, Hans L., Hanaka, Tesshu, Kobayashi, Yasuaki +4 · 3 citations
   #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
4. Gourds: a sliding-block puzzle with turning
   2020/11/02 by Hamersma, Joep, van Kreveld, Marc, Uno, Yushi +1 · 1 citation
   #Computational Complexity (cs.CC) #Computational Geometry (cs.CG) #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #F.1.3 #F.2.2 #FOS: Computer and information sciences #G.2.2