Tom C. van der Zanden

49 papers A* 2A 1B 9C 5Misc 1Journal 28Unranked 2
YearRankTypeTitle / Venue / Authors
2026 B conf
Finding Order-Preserving Subgraphs.
WALCOM
Haruya Imamura, Yasuaki Kobayashi, Yota Otachi, Toshiki Saitoh, Keita Sato, Asahi Takaoka, Ryo Yoshinaka, Tom C. van der Zanden
2025 B conf
A Polynomial Delay Algorithm Generating All Potential Maximal Cliques in Triconnected Planar Graphs.
IPEC
Alexander Grigoriev, Yasuaki Kobayashi, Hisao Tamaki, Tom C. van der Zanden
2025 J jnl
A polynomial delay algorithm generating all potential maximal cliques in triconnected planar graphs.
CoRR
Alexander Grigoriev, Yasuaki Kobayashi, Hisao Tamaki, Tom C. van der Zanden
2025 J jnl
Finding Order-Preserving Subgraphs.
CoRR
Haruya Imamura, Yasuaki Kobayashi, Yota Otachi, Toshiki Saitoh, Keita Sato, Asahi Takaoka, Ryo Yoshinaka, Tom C. van der Zanden
2025 J jnl
Hedonic seat arrangement problems.
Auton. Agents Multi Agent Syst.
Hans L. Bodlaender, Tesshu Hanaka, Lars Jaffke, Hirotaka Ono, Yota Otachi, Tom C. van der Zanden
2025 J jnl
Optimizing Periodic Operations for Efficient Inland Waterway Lock Management.
CoRR
Julian Golak, Alexander Grigoriev, Freija van Lent, Tom C. van der Zanden
2025 — conf
Puzzles are hard enough just by rotations.
CCCG
Takeshi Yamada, Tom C. van der Zanden, Ryuhei Uehara
2024 J jnl
Minimum separator reconfiguration.
J. Comput. Syst. Sci.
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
2023 J jnl
Efficiently computing the Shapley value of connectivity games in low-treewidth graphs.
Oper. Res.
Tom C. van der Zanden, Hans L. Bodlaender, Herbert J. M. Hamers
2023 B conf
Minimum Separator Reconfiguration.
IPEC
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
2023 J jnl
Minimum Separator Reconfiguration.
CoRR
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
2023 J jnl
On the complexity of Nurse Rostering problems.
Oper. Res. Lett.
Steven J. M. den Hartog, Han Hoogeveen, Tom C. van der Zanden
2022 J jnl
Efficiently Computing the Shapley Value of Connectivity Games in Low-Treewidth Graphs.
CoRR
Tom C. van der Zanden, Hans L. Bodlaender, Herbert J. M. Hamers
2021 J jnl
Stable Divisorial Gonality is in NP.
Theory Comput. Syst.
Hans L. Bodlaender, Marieke van der Wegen, Tom C. van der Zanden
2020 J jnl
A Framework for Exponential-Time-Hypothesis-Tight Algorithms and Lower Bounds in Geometric Intersection Graphs.
SIAM J. Comput.
Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak, Dániel Marx, Tom C. van der Zanden
2020 J jnl
Complexity of the Maximum
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Eiji Miyano, Toshiki Saitoh, Ryuhei Uehara, Tsuyoshi Yagita, Tom C. van der Zanden
2020 — conf
Games, Puzzles and Treewidth.
Treewidth, Kernels, and Algorithms
Tom C. van der Zanden
2020 B conf
Gourds: A Sliding-Block Puzzle with Turning.
ISAAC
Joep Hamersma, Marc J. van Kreveld, Yushi Uno, Tom C. van der Zanden
2020 J jnl
Gourds: a sliding-block puzzle with turning.
CoRR
Joep Hamersma, Marc J. van Kreveld, Yushi Uno, Tom C. van der Zanden
2020 A conf
Hedonic Seat Arrangement Problems.
AAMAS
Hans L. Bodlaender, Tesshu Hanaka, Lars Jaffke, Hirotaka Ono, Yota Otachi, Tom C. van der Zanden
2020 J jnl
Hedonic Seat Arrangement Problems.
CoRR
Hans L. Bodlaender, Tesshu Hanaka, Lars Jaffke, Hirotaka Ono, Yota Otachi, Tom C. van der Zanden
2020 J jnl
On the exact complexity of polyomino packing.
Theor. Comput. Sci.
Hans L. Bodlaender, Tom C. van der Zanden
2020 J jnl
Subgraph Isomorphism on Graph Classes that Exclude a Substructure.
Algorithmica
Hans L. Bodlaender, Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi, Yoshio Okamoto, Yota Otachi, Tom C. van der Zanden
2019 J jnl
Flower power: Finding optimal plant cutting strategies through a combination of optimization and data mining.
Comput. Ind. Eng.
Han Hoogeveen, Jakub Tomczyk, Tom C. van der Zanden
2019 B conf
How Does Object Fatness Impact the Complexity of Packing in d Dimensions?
ISAAC
Sándor Kisfaludi-Bak, Dániel Marx, Tom C. van der Zanden
2019 J jnl
How does object fatness impact the complexity of packing in d dimensions?
CoRR
Sándor Kisfaludi-Bak, Dániel Marx, Tom C. van der Zanden
2019 J jnl
On exploring always-connected temporal graphs of small pathwidth.
Inf. Process. Lett.
Hans L. Bodlaender, Tom C. van der Zanden
2019 J jnl
On the maximum weight minimal separator.
Theor. Comput. Sci.
Tesshu Hanaka, Hans L. Bodlaender, Tom C. van der Zanden, Hirotaka Ono
2019 B conf
Stable Divisorial Gonality is in NP.
SOFSEM
Hans L. Bodlaender, Marieke van der Wegen, Tom C. van der Zanden
2019 C conf
Subgraph Isomorphism on Graph Classes that Exclude a Substructure.
CIAC
Hans L. Bodlaender, Tesshu Hanaka, Yoshio Okamoto, Yota Otachi, Tom C. van der Zanden
2019 J jnl
Subgraph Isomorphism on Graph Classes that Exclude a Substructure.
CoRR
Hans L. Bodlaender, Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi, Yoshio Okamoto, Yota Otachi, Tom C. van der Zanden
2019 — —
Theory and Practical Applications of Treewidth.
Tom C. van der Zanden
2018 A* conf
A framework for ETH-tight algorithms and lower bounds in geometric intersection graphs.
STOC
Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak, Dániel Marx, Tom C. van der Zanden
2018 B conf
Complexity of the Maximum k-Path Vertex Cover Problem.
WALCOM
Eiji Miyano, Toshiki Saitoh, Ryuhei Uehara, Tsuyoshi Yagita, Tom C. van der Zanden
2018 J jnl
Framework for ETH-tight Algorithms and Lower Bounds in Geometric Intersection Graphs.
CoRR
Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak, Dániel Marx, Tom C. van der Zanden
2018 J jnl
On Exploring Temporal Graphs of Small Pathwidth.
CoRR
Hans L. Bodlaender, Tom C. van der Zanden
2018 Misc conf
On the Exact Complexity of Polyomino Packing.
FUN
Hans L. Bodlaender, Tom C. van der Zanden
2018 J jnl
Stable divisorial gonality is in NP.
CoRR
Hans L. Bodlaender, Marieke van der Wegen, Tom C. van der Zanden
2017 B conf
Computing Treewidth on the GPU.
IPEC
Tom C. van der Zanden, Hans L. Bodlaender
2017 J jnl
Computing Treewidth on the GPU.
CoRR
Tom C. van der Zanden, Hans L. Bodlaender
2017 C conf
Improved Lower Bounds for Graph Embedding Problems.
CIAC
Hans L. Bodlaender, Tom C. van der Zanden
2017 C conf
On the Exact Complexity of Hamiltonian Cycle and q-Colouring in Disk Graphs.
CIAC
Sándor Kisfaludi-Bak, Tom C. van der Zanden
2017 C conf
On the Maximum Weight Minimal Separator.
TAMC
Tesshu Hanaka, Hans L. Bodlaender, Tom C. van der Zanden, Hirotaka Ono
2016 J jnl
Improved Lower Bounds for Graph Embedding Problems.
CoRR
Hans L. Bodlaender, Tom C. van der Zanden
2016 A* conf
Subexponential Time Algorithms for Embedding H-Minor Free Graphs.
ICALP
Hans L. Bodlaender, Jesper Nederlof, Tom C. van der Zanden
2015 C conf
PSPACE-Completeness of Bloxorz and of Games with 2-Buttons.
CIAC
Tom C. van der Zanden, Hans L. Bodlaender
2015 B conf
Parameterized Complexity of Graph Constraint Logic.
IPEC
Tom C. van der Zanden
2015 J jnl
Parameterized Complexity of Graph Constraint Logic.
CoRR
Tom C. van der Zanden
2014 J jnl
PSPACE-completeness of Bloxorz and of Games with 2-Buttons.
CoRR
Tom C. van der Zanden, Hans L. Bodlaender