Tom C. van der Zanden

Publication Activity (10 Years)

Years Active: 2014-2023
Publications (10 Years): 36

Top Topics

Subgraph Isomorphism

Efficiently Computing

Top Venues

Publications

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
Minimum Separator Reconfiguration. CoRR (2023)
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
Minimum Separator Reconfiguration. IPEC (2023)
Tom C. van der Zanden, Hans L. Bodlaender, Herbert J. M. Hamers
Efficiently computing the Shapley value of connectivity games in low-treewidth graphs. Oper. Res. 23 (1) (2023)
Steven J. M. den Hartog, Han Hoogeveen, Tom C. van der Zanden
On the complexity of Nurse Rostering problems. Oper. Res. Lett. 51 (5) (2023)
Tom C. van der Zanden, Hans L. Bodlaender, Herbert J. M. Hamers
Efficiently Computing the Shapley Value of Connectivity Games in Low-Treewidth Graphs. CoRR (2022)
Hans L. Bodlaender, Marieke van der Wegen, Tom C. van der Zanden
Stable Divisorial Gonality is in NP. Theory Comput. Syst. 65 (2) (2021)
Hans L. Bodlaender, Tesshu Hanaka, Lars Jaffke, Hirotaka Ono, Yota Otachi, Tom C. van der Zanden
Hedonic Seat Arrangement Problems. AAMAS (2020)
Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak, Dániel Marx, Tom C. van der Zanden
A Framework for Exponential-Time-Hypothesis-Tight Algorithms and Lower Bounds in Geometric Intersection Graphs. SIAM J. Comput. 49 (6) (2020)
Tom C. van der Zanden
Games, Puzzles and Treewidth. Treewidth, Kernels, and Algorithms (2020)
Eiji Miyano, Toshiki Saitoh, Ryuhei Uehara, Tsuyoshi Yagita, Tom C. van der Zanden
-Path Vertex Cover Problem. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (10) (2020)
Hans L. Bodlaender, Tom C. van der Zanden
On the exact complexity of polyomino packing. Theor. Comput. Sci. 839 (2020)
Joep Hamersma, Marc J. van Kreveld, Yushi Uno, Tom C. van der Zanden
Gourds: a sliding-block puzzle with turning. CoRR (2020)
Hans L. Bodlaender, Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi, Yoshio Okamoto, Yota Otachi, Tom C. van der Zanden
Subgraph Isomorphism on Graph Classes that Exclude a Substructure. Algorithmica 82 (12) (2020)
Hans L. Bodlaender, Tesshu Hanaka, Lars Jaffke, Hirotaka Ono, Yota Otachi, Tom C. van der Zanden
Hedonic Seat Arrangement Problems. CoRR (2020)
Joep Hamersma, Marc J. van Kreveld, Yushi Uno, Tom C. van der Zanden
Gourds: A Sliding-Block Puzzle with Turning. ISAAC (2020)
Sándor Kisfaludi-Bak, Dániel Marx, Tom C. van der Zanden
How does object fatness impact the complexity of packing in d dimensions? CoRR (2019)
Tesshu Hanaka, Hans L. Bodlaender, Tom C. van der Zanden, Hirotaka Ono
On the maximum weight minimal separator. Theor. Comput. Sci. 796 (2019)
Hans L. Bodlaender, Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi, Yoshio Okamoto, Yota Otachi, Tom C. van der Zanden
Subgraph Isomorphism on Graph Classes that Exclude a Substructure. CoRR (2019)
Hans L. Bodlaender, Marieke van der Wegen, Tom C. van der Zanden
Stable Divisorial Gonality is in NP. SOFSEM (2019)
Hans L. Bodlaender, Tom C. van der Zanden
On exploring always-connected temporal graphs of small pathwidth. Inf. Process. Lett. 142 (2019)
Hans L. Bodlaender, Tesshu Hanaka, Yoshio Okamoto, Yota Otachi, Tom C. van der Zanden
Subgraph Isomorphism on Graph Classes that Exclude a Substructure. CIAC (2019)
Sándor Kisfaludi-Bak, Dániel Marx, Tom C. van der Zanden
How Does Object Fatness Impact the Complexity of Packing in d Dimensions? ISAAC (2019)
Han Hoogeveen, Jakub Tomczyk, Tom C. van der Zanden
Flower power: Finding optimal plant cutting strategies through a combination of optimization and data mining. Comput. Ind. Eng. 127 (2019)
Eiji Miyano, Toshiki Saitoh, Ryuhei Uehara, Tsuyoshi Yagita, Tom C. van der Zanden
Complexity of the Maximum k-Path Vertex Cover Problem. WALCOM (2018)
Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak, Dániel Marx, Tom C. van der Zanden
A framework for ETH-tight algorithms and lower bounds in geometric intersection graphs. STOC (2018)
Hans L. Bodlaender, Marieke van der Wegen, Tom C. van der Zanden
Stable divisorial gonality is in NP. CoRR (2018)
Hans L. Bodlaender, Tom C. van der Zanden
On the Exact Complexity of Polyomino Packing. FUN (2018)
Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak, Dániel Marx, Tom C. van der Zanden
Framework for ETH-tight Algorithms and Lower Bounds in Geometric Intersection Graphs. CoRR (2018)
Hans L. Bodlaender, Tom C. van der Zanden
On Exploring Temporal Graphs of Small Pathwidth. CoRR (2018)
Tom C. van der Zanden, Hans L. Bodlaender
Computing Treewidth on the GPU. CoRR (2017)
Hans L. Bodlaender, Tom C. van der Zanden
Improved Lower Bounds for Graph Embedding Problems. CIAC (2017)
Tesshu Hanaka, Hans L. Bodlaender, Tom C. van der Zanden, Hirotaka Ono
On the Maximum Weight Minimal Separator. TAMC (2017)
Sándor Kisfaludi-Bak, Tom C. van der Zanden
On the Exact Complexity of Hamiltonian Cycle and q-Colouring in Disk Graphs. CIAC (2017)
Tom C. van der Zanden, Hans L. Bodlaender
Computing Treewidth on the GPU. IPEC (2017)
Hans L. Bodlaender, Jesper Nederlof, Tom C. van der Zanden
Subexponential Time Algorithms for Embedding H-Minor Free Graphs. ICALP (2016)
Hans L. Bodlaender, Tom C. van der Zanden
Improved Lower Bounds for Graph Embedding Problems. CoRR (2016)
Tom C. van der Zanden, Hans L. Bodlaender
PSPACE-Completeness of Bloxorz and of Games with 2-Buttons. CIAC (2015)
Tom C. van der Zanden
Parameterized Complexity of Graph Constraint Logic. IPEC (2015)
Tom C. van der Zanden
Parameterized Complexity of Graph Constraint Logic. CoRR (2015)
Tom C. van der Zanden, Hans L. Bodlaender
PSPACE-completeness of Bloxorz and of Games with 2-Buttons. CoRR (2014)