Tom C. van der Zanden
Scholar

Tom C. van der Zanden

Google Scholar ID: g4Sfb9IAAAAJ
Maastricht University
AlgorithmsComputational Complexity
Citations & Impact
All-time
Citations
265
 
H-index
8
 
i10-index
8
 
Publications
20
 
Co-authors
22
list available
Resume (English only)
Academic Achievements
  • Published multiple peer-reviewed conference papers such as 'On Exploring Always-Connected Temporal Graphs of Small Pathwidth', 'Flower power: Finding Optimal Flower Cutting Strategies Through a Combination of Optimization and Data Mining', and more; received Best Paper Award at CIAC 2017; Google Scholar H-index is 5; Erdős number is 3; developed several software projects including PartStacker, SteinerTreeTW, GPGPU Treewidth, and BZTreewidth.
Research Experience
  • Since October 2019, has been an Assistant Professor in Algorithms and Optimisation at the Department of Data Analytics and Digitalisation of Maastricht University.
Education
  • Completed PhD at Utrecht University under the supervision of Hans Bodlaender, with the thesis titled 'Theory and Practical Applications of Treewidth'.
Background
  • Research interests include the theory and applications of graph algorithms (specifically those involving treewidth), parameterized and exact complexity. As a hobby, designs and makes 3D printed puzzles and other 3D printed and electronic gadgets.
Miscellany
  • Hobby includes designing and making 3D printed puzzles and other 3D printed and electronic gadgets.