Tom C. van der Zanden
Tom C. van der Zanden
Verified email at maastrichtuniversity.nl - Homepage
Title
Cited by
Cited by
Year
Parameterized Complexity of Graph Constraint Logic
TC van der Zanden
10th International Symposium on Parameterized and Exact Computation (IPEC …, 2015
202015
A framework for ETH-tight algorithms and lower bounds in geometric intersection graphs
M de Berg, HL Bodlaender, S Kisfaludi-Bak, D Marx, TC van der Zanden
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018
162018
Subexponential time algorithms for embedding H-minor free graphs
HL Bodlaender, J Nederlof, TC van der Zanden
43rd International Colloquium on Automata, Languages, and Programming (ICALP …, 2016
122016
PSPACE-Completeness of Bloxorz and of Games with 2-Buttons
TC van der Zanden, HL Bodlaender
International Conference on Algorithms and Complexity, 403-415, 2015
92015
On exploring always-connected temporal graphs of small pathwidth
HL Bodlaender, TC van der Zanden
Information Processing Letters 142, 68-71, 2019
6*2019
Computing Treewidth on the GPU
TC van der Zanden, HL Bodlaender
LIPIcs-Leibniz International Proceedings in Informatics 89, 29:1--29:13, 2017
62017
On the exact complexity of Hamiltonian cycle and q-colouring in disk graphs
S Kisfaludi-Bak, TC van der Zanden
International Conference on Algorithms and Complexity, 369-380, 2017
42017
On the exact complexity of polyomino packing
HL Bodlaender, TC Van Der Zanden
Theoretical Computer Science, 2020
32020
Improved lower bounds for graph embedding problems
HL Bodlaender, TC van der Zanden
International Conference on Algorithms and Complexity, 92-103, 2017
32017
Subgraph isomorphism on graph classes that exclude a substructure
HL Bodlaender, T Hanaka, Y Kobayashi, Y Kobayashi, Y Okamoto, ...
Algorithmica, 1-22, 2020
22020
On the maximum weight minimal separator
T Hanaka, HL Bodlaender, TC van der Zanden, H Ono
Theoretical Computer Science 796, 294-308, 2019
22019
On the maximum weight minimal separator
T Hanaka, HL Bodlaender, TC van der Zanden, H Ono
International Conference on Theory and Applications of Models of Computation …, 2017
22017
Hedonic Seat Arrangement Problems
HL Bodlaender, T Hanaka, L Jaffke, H Ono, Y Otachi, TC van der Zanden
arXiv preprint arXiv:2002.10898, 2020
12020
How does object fatness impact the complexity of packing in d dimensions?
S Kisfaludi-Bak, D Marx, TC van der Zanden
arXiv preprint arXiv:1909.12044, 2019
12019
Theory and Practical Applications of Treewidth
TC van der Zanden
Utrecht University, 2019
12019
Stable divisorial gonality is in NP
HL Bodlaender, M van der Wegen, TC van der Zanden
International Conference on Current Trends in Theory and Practice of …, 2019
12019
Complexity of the Maximum k-Path Vertex Cover Problem
E Miyano, T Saitoh, R Uehara, T Yagita, TC van der Zanden
International Workshop on Algorithms and Computation, 240-251, 2018
12018
Flower power: Finding optimal flower cutting strategies through a combination of optimization and data mining
H Hoogeveen, J Tomczyk, TC van der Zanden
Proceedings of the 114th European Study Group Mathematics with Industry, 3-11, 2016
1*2016
Complexity of the Maximum k-Path Vertex Cover Problem
E MIYANO, T SAITOH, R UEHARA, T YAGITA, TC van der ZANDEN
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and …, 2020
2020
Games, Puzzles and Treewidth
TC van der Zanden
Treewidth, Kernels, and Algorithms, 247-261, 2020
2020
The system can't perform the operation now. Try again later.
Articles 1–20