Old Web
English
Sign In
Acemap
>
authorDetail
>
Tom C. van der Zanden
Tom C. van der Zanden
Maastricht University
Mathematics
Combinatorics
Parameterized complexity
Upper and lower bounds
Discrete mathematics
5
Papers
3
Citations
0
KQI
Citation Trend
Filter By
Interval:
1900~2024
1900
2024
Author
Papers (5)
Sort By
Default
Most Recent
Most Early
Most Citation
No data
Journal
Conference
Others
Gourds: A Sliding-Block Puzzle with Turning.
2020
ISAAC | International Symposium on Algorithms and Computation
Joep Hamersma
Marc van Kreveld
Yushi Uno
Tom C. van der Zanden
Show All
Source
Cite
Save
Citations (0)
Subgraph Isomorphism on Graph Classes that Exclude a Substructure
2020
Algorithmica
Hans L. Bodlaender
Tesshu Hanaka
Yasuaki Kobayashi
Yusuke Kobayashi
Yoshio Okamoto
Yota Otachi
Tom C. van der Zanden
Show All
Source
Cite
Save
Citations (1)
Hedonic Seat Arrangement Problems
2020
arXiv: Computer Science and Game Theory
Hans L. Bodlaender
Tesshu Hanaka
Lars Jaffke
Hirotaka Ono
Yota Otachi
Tom C. van der Zanden
Show All
Source
Cite
Save
Citations (2)
Complexity of the Maximum k -Path Vertex Cover Problem
2020
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Eiji Miyano
Toshiki Saitoh
Ryuhei Uehara
Tsuyoshi Yagita
Tom C. van der Zanden
Show All
Source
Cite
Save
Citations (0)
How does object fatness impact the complexity of packing in d dimensions
2019
arXiv: Computational Geometry
Sándor Kisfaludi-Bak
Dániel Marx
Tom C. van der Zanden
Show All
Source
Cite
Save
Citations (0)
1