default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTom C. van der Zanden
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j11]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. J. Comput. Syst. Sci. 146: 103574 (2024)- 2023
- [j10]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): 6 (2023) - [j9]Steven J. M. den Hartog, Han Hoogeveen, Tom C. van der Zanden:
On the complexity of Nurse Rostering problems. Oper. Res. Lett. 51(5): 483-487 (2023) - [c17]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: 9:1-9:12 - [i13]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 abs/2307.07782 (2023) - 2022
- [i12]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 abs/2208.12868 (2022) - 2021
- [j8]Hans L. Bodlaender, Marieke van der Wegen, Tom C. van der Zanden:
Stable Divisorial Gonality is in NP. Theory Comput. Syst. 65(2): 428-440 (2021) - 2020
- [j7]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): 3566-3587 (2020) - [j6]Eiji Miyano, Toshiki Saitoh, Ryuhei Uehara, Tsuyoshi Yagita, Tom C. van der Zanden:
Complexity of the Maximum k-Path Vertex Cover Problem. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 103-A(10): 1193-1201 (2020) - [j5]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): 1291-1331 (2020) - [j4]Hans L. Bodlaender, Tom C. van der Zanden:
On the exact complexity of polyomino packing. Theor. Comput. Sci. 839: 13-20 (2020) - [c16]Hans L. Bodlaender, Tesshu Hanaka, Lars Jaffke, Hirotaka Ono, Yota Otachi, Tom C. van der Zanden:
Hedonic Seat Arrangement Problems. AAMAS 2020: 1777-1779 - [c15]Tom C. van der Zanden:
Games, Puzzles and Treewidth. Treewidth, Kernels, and Algorithms 2020: 247-261 - [c14]Joep Hamersma, Marc J. van Kreveld, Yushi Uno, Tom C. van der Zanden:
Gourds: A Sliding-Block Puzzle with Turning. ISAAC 2020: 33:1-33:16 - [i11]Hans L. Bodlaender, Tesshu Hanaka, Lars Jaffke, Hirotaka Ono, Yota Otachi, Tom C. van der Zanden:
Hedonic Seat Arrangement Problems. CoRR abs/2002.10898 (2020) - [i10]Joep Hamersma, Marc J. van Kreveld, Yushi Uno, Tom C. van der Zanden:
Gourds: a sliding-block puzzle with turning. CoRR abs/2011.00968 (2020)
2010 – 2019
- 2019
- [b1]Tom C. van der Zanden:
Theory and Practical Applications of Treewidth. Utrecht University, Netherlands, 2019 - [j3]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: 39-44 (2019) - [j2]Hans L. Bodlaender, Tom C. van der Zanden:
On exploring always-connected temporal graphs of small pathwidth. Inf. Process. Lett. 142: 68-71 (2019) - [j1]Tesshu Hanaka, Hans L. Bodlaender, Tom C. van der Zanden, Hirotaka Ono:
On the maximum weight minimal separator. Theor. Comput. Sci. 796: 294-308 (2019) - [c13]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: 87-98 - [c12]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: 36:1-36:18 - [c11]Hans L. Bodlaender, Marieke van der Wegen, Tom C. van der Zanden:
Stable Divisorial Gonality is in NP. SOFSEM 2019: 81-93 - [i9]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 abs/1905.10670 (2019) - [i8]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 abs/1909.12044 (2019) - 2018
- [c10]Hans L. Bodlaender, Tom C. van der Zanden:
On the Exact Complexity of Polyomino Packing. FUN 2018: 9:1-9:10 - [c9]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: 574-586 - [c8]Eiji Miyano, Toshiki Saitoh, Ryuhei Uehara, Tsuyoshi Yagita, Tom C. van der Zanden:
Complexity of the Maximum k-Path Vertex Cover Problem. WALCOM 2018: 240-251 - [i7]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 abs/1803.10633 (2018) - [i6]Hans L. Bodlaender, Tom C. van der Zanden:
On Exploring Temporal Graphs of Small Pathwidth. CoRR abs/1807.11869 (2018) - [i5]Hans L. Bodlaender, Marieke van der Wegen, Tom C. van der Zanden:
Stable divisorial gonality is in NP. CoRR abs/1808.06921 (2018) - 2017
- [c7]Hans L. Bodlaender, Tom C. van der Zanden:
Improved Lower Bounds for Graph Embedding Problems. CIAC 2017: 92-103 - [c6]Sándor Kisfaludi-Bak, Tom C. van der Zanden:
On the Exact Complexity of Hamiltonian Cycle and q-Colouring in Disk Graphs. CIAC 2017: 369-380 - [c5]Tom C. van der Zanden, Hans L. Bodlaender:
Computing Treewidth on the GPU. IPEC 2017: 29:1-29:13 - [c4]Tesshu Hanaka, Hans L. Bodlaender, Tom C. van der Zanden, Hirotaka Ono:
On the Maximum Weight Minimal Separator. TAMC 2017: 304-318 - [i4]Tom C. van der Zanden, Hans L. Bodlaender:
Computing Treewidth on the GPU. CoRR abs/1709.09990 (2017) - 2016
- [c3]Hans L. Bodlaender, Jesper Nederlof, Tom C. van der Zanden:
Subexponential Time Algorithms for Embedding H-Minor Free Graphs. ICALP 2016: 9:1-9:14 - [i3]Hans L. Bodlaender, Tom C. van der Zanden:
Improved Lower Bounds for Graph Embedding Problems. CoRR abs/1610.09130 (2016) - 2015
- [c2]Tom C. van der Zanden, Hans L. Bodlaender:
PSPACE-Completeness of Bloxorz and of Games with 2-Buttons. CIAC 2015: 403-415 - [c1]Tom C. van der Zanden:
Parameterized Complexity of Graph Constraint Logic. IPEC 2015: 282-293 - [i2]Tom C. van der Zanden:
Parameterized Complexity of Graph Constraint Logic. CoRR abs/1509.02683 (2015) - 2014
- [i1]Tom C. van der Zanden, Hans L. Bodlaender:
PSPACE-completeness of Bloxorz and of Games with 2-Buttons. CoRR abs/1411.5951 (2014)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:19 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
