Tom C. van der Zanden

From MaRDI portal
Person:1628691

Available identifiers

zbMath Open van-der-zanden.tom-cDBLP154/6686WikidataQ60574276 ScholiaQ60574276MaRDI QIDQ1628691

List of research outcomes

PublicationDate of PublicationType
https://portal.mardi4nfdi.de/entity/Q60654362023-11-14Paper
Minimum Separator Reconfiguration2023-07-15Paper
How Does Object Fatness Impact the Complexity of Packing in d Dimensions2023-02-03Paper
Games, Puzzles and Treewidth2022-10-19Paper
Stable divisorial gonality is in NP2021-06-24Paper
A Framework for Exponential-Time-Hypothesis--Tight Algorithms and Lower Bounds in Geometric Intersection Graphs2021-01-13Paper
Subgraph isomorphism on graph classes that exclude a substructure2020-11-11Paper
Stable divisorial gonality is in NP2020-10-22Paper
On the exact complexity of polyomino packing2020-09-03Paper
On the Exact Complexity of Polyomino Packing2020-08-11Paper
Computing treewidth on the GPU2020-05-27Paper
Subgraph isomorphism on graph classes that exclude a substructure2020-02-06Paper
On the maximum weight minimal separator2019-11-13Paper
A framework for ETH-tight algorithms and lower bounds in geometric intersection graphs2019-08-22Paper
On exploring always-connected temporal graphs of small pathwidth2018-12-05Paper
Complexity of the maximum \(k\)-path vertex cover problem2018-06-15Paper
Subexponential Time Algorithms for Embedding H-Minor Free Graphs2017-12-19Paper
Parameterized Complexity of Graph Constraint Logic2017-09-29Paper
Improved Lower Bounds for Graph Embedding Problems2017-07-21Paper
On the Exact Complexity of Hamiltonian Cycle and q-Colouring in Disk Graphs2017-07-21Paper
On the Maximum Weight Minimal Separator2017-05-19Paper
PSPACE-Completeness of Bloxorz and of Games with 2-Buttons2015-09-21Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Tom C. van der Zanden