Követés
Tom C. van der Zanden
Tom C. van der Zanden
Maastricht University
E-mail megerősítve itt: maastrichtuniversity.nl - Kezdőlap
Cím
Hivatkozott rá
Hivatkozott rá
Év
A Framework for Exponential-Time-Hypothesis--Tight Algorithms and Lower Bounds in Geometric Intersection Graphs
M De Berg, HL Bodlaender, S Kisfaludi-Bak, D Marx, TC Van Der Zanden
SIAM Journal on Computing 49 (6), 1291-1331, 2020
77*2020
Parameterized Complexity of Graph Constraint Logic
TC van der Zanden
10th International Symposium on Parameterized and Exact Computation (IPEC …, 2015
422015
On exploring always-connected temporal graphs of small pathwidth
HL Bodlaender, TC van der Zanden
Information Processing Letters 142, 68-71, 2019
19*2019
Hedonic seat arrangement problems
HL Bodlaender, T Hanaka, L Jaffke, H Ono, Y Otachi, TC van der Zanden
arXiv preprint arXiv:2002.10898, 2020
182020
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
172016
Subgraph isomorphism on graph classes that exclude a substructure
HL Bodlaender, T Hanaka, Y Kobayashi, Y Kobayashi, Y Okamoto, ...
Algorithmica 82 (12), 3566-3587, 2020
162020
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
142015
On the maximum weight minimal separator
T Hanaka, HL Bodlaender, TC van der Zanden, H Ono
Theoretical Computer Science 796, 294-308, 2019
122019
Computing Treewidth on the GPU
TC van der Zanden, HL Bodlaender
LIPIcs-Leibniz International Proceedings in Informatics 89, 29:1--29:13, 2017
122017
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
82017
On the complexity of nurse rostering problems
SJM den Hartog, H Hoogeveen, TC van der Zanden
Operations Research Letters 51 (5), 483-487, 2023
72023
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
62018
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
6*2016
Theory and practical applications of treewidth
T van der Zanden
52019
Stable divisorial gonality is in NP
HL Bodlaender, M van der Wegen, TC van der Zanden
Theory of Computing Systems 65, 428-440, 2021
42021
Efficiently computing the Shapley value of connectivity games in low-treewidth graphs
TC van der Zanden, HL Bodlaender, HJM Hamers
Operational Research 23 (1), 6, 2023
32023
On the exact complexity of polyomino packing
HL Bodlaender, TC Van Der Zanden
Theoretical Computer Science 839, 13-20, 2020
32020
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
32019
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
32019
Improved lower bounds for graph embedding problems
HL Bodlaender, TC van der Zanden
International Conference on Algorithms and Complexity, 92-103, 2017
32017
A rendszer jelenleg nem tudja elvégezni a műveletet. Próbálkozzon újra később.
Cikkek 1–20