Tom C. van der Zanden

According to our database, Tom C. van der Zanden authored at least 26 papers between 2015 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

On the complexity of Nurse Rostering problems.

Steven J. M. den Hartog, Han Hoogeveen, Tom C. van der Zanden

Oper. Res. Lett., September, 2023

Efficiently computing the Shapley value of connectivity games in low-treewidth graphs.

Tom C. van der Zanden, Hans L. Bodlaender, Herbert J. M. Hamers

Oper. Res., March, 2023

Minimum Separator Reconfiguration.

Guilherme C. M. Gomes, Clément Legrand-Duchesne, Reem Mahmoud, Amer E. Mouawad, Yoshio Okamoto, Vinícius Fernandes dos Santos, Tom C. van der Zanden

Proceedings of the 18th International Symposium on Parameterized and Exact Computation, 2023

2021

Stable Divisorial Gonality is in NP.

Hans L. Bodlaender, Marieke van der Wegen, Tom C. van der Zanden

Theory Comput. Syst., 2021

2020

On the exact complexity of polyomino packing.

Hans L. Bodlaender, Tom C. van der Zanden

Theor. Comput. Sci., 2020

A Framework for Exponential-Time-Hypothesis-Tight Algorithms and Lower Bounds in Geometric Intersection Graphs.

Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak, Dániel Marx, Tom C. van der Zanden

SIAM J. Comput., 2020

Complexity of the Maximum <i>k</i>-Path Vertex Cover Problem.

Eiji Miyano, Toshiki Saitoh, Ryuhei Uehara, Tsuyoshi Yagita, Tom C. van der Zanden

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2020

Subgraph Isomorphism on Graph Classes that Exclude a Substructure.

Hans L. Bodlaender, Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi, Yoshio Okamoto, Yota Otachi, Tom C. van der Zanden

Algorithmica, 2020

Gourds: A Sliding-Block Puzzle with Turning.

Joep Hamersma, Marc J. van Kreveld, Yushi Uno, Tom C. van der Zanden

Proceedings of the 31st International Symposium on Algorithms and Computation, 2020

Games, Puzzles and Treewidth.

Tom C. van der Zanden

Proceedings of the Treewidth, Kernels, and Algorithms, 2020

Hedonic Seat Arrangement Problems.

Hans L. Bodlaender, Tesshu Hanaka, Lars Jaffke, Hirotaka Ono, Yota Otachi, Tom C. van der Zanden

Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, 2020

2019

Theory and Practical Applications of Treewidth.

Tom C. van der Zanden

PhD thesis, 2019

On the maximum weight minimal separator.

Tesshu Hanaka, Hans L. Bodlaender, Tom C. van der Zanden, Hirotaka Ono

Theor. Comput. Sci., 2019

On exploring always-connected temporal graphs of small pathwidth.

Hans L. Bodlaender, Tom C. van der Zanden

Inf. Process. Lett., 2019

Flower power: Finding optimal plant cutting strategies through a combination of optimization and data mining.

Han Hoogeveen, Jakub Tomczyk, Tom C. van der Zanden

Comput. Ind. Eng., 2019

How Does Object Fatness Impact the Complexity of Packing in d Dimensions?

Sándor Kisfaludi-Bak, Dániel Marx, Tom C. van der Zanden

Proceedings of the 30th International Symposium on Algorithms and Computation, 2019

Subgraph Isomorphism on Graph Classes that Exclude a Substructure.

Hans L. Bodlaender, Tesshu Hanaka, Yoshio Okamoto, Yota Otachi, Tom C. van der Zanden

Proceedings of the Algorithms and Complexity - 11th International Conference, 2019

2018

On Exploring Temporal Graphs of Small Pathwidth.

Hans L. Bodlaender, Tom C. van der Zanden

CoRR, 2018

Complexity of the Maximum k-Path Vertex Cover Problem.

Eiji Miyano, Toshiki Saitoh, Ryuhei Uehara, Tsuyoshi Yagita, Tom C. van der Zanden

Proceedings of the WALCOM: Algorithms and Computation - 12th International Conference, 2018

A framework for ETH-tight algorithms and lower bounds in geometric intersection graphs.

Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak, Dániel Marx, Tom C. van der Zanden

Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

2017

Computing Treewidth on the GPU.

Tom C. van der Zanden, Hans L. Bodlaender

Proceedings of the 12th International Symposium on Parameterized and Exact Computation, 2017

On the Exact Complexity of Hamiltonian Cycle and q-Colouring in Disk Graphs.

Sándor Kisfaludi-Bak, Tom C. van der Zanden

Proceedings of the Algorithms and Complexity - 10th International Conference, 2017

Improved Lower Bounds for Graph Embedding Problems.

Hans L. Bodlaender, Tom C. van der Zanden

Proceedings of the Algorithms and Complexity - 10th International Conference, 2017

2016

Subexponential Time Algorithms for Embedding H-Minor Free Graphs.

Hans L. Bodlaender, Jesper Nederlof, Tom C. van der Zanden

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

2015

Parameterized Complexity of Graph Constraint Logic.

Tom C. van der Zanden

Proceedings of the 10th International Symposium on Parameterized and Exact Computation, 2015

PSPACE-Completeness of Bloxorz and of Games with 2-Buttons.

Tom C. van der Zanden, Hans L. Bodlaender

Proceedings of the Algorithms and Complexity - 9th International Conference, 2015