E-LIB Suche - Ergebnisse für: van der Zanden, Tom C

1

Efficiently computing the Shapley value of connectivity gam..:

van der Zanden, Tom C. ; Bodlaender, Hans L. ; Hamers, Herbert J. M.
Operational Research. 23 (2023) 1 - p. , 2023

2

On the complexity of Nurse Rostering problems:

den Hartog, Steven J.M. ; Hoogeveen, Han ; van der Zanden, Tom C.
Operations Research Letters. 51 (2023) 5 - p. 483-487 , 2023

Link: https://doi.org/10.1016/..

3

Stable Divisorial Gonality is in NP:

Bodlaender, Hans L. ; van der Wegen, Marieke ; van der Zanden, Tom C.
Theory of Computing Systems. 65 (2020) 2 - p. 428-440 , 2020

Link: https://doi.org/10.1007/..

4

Games, Puzzles and Treewidth:

, In: Treewidth, Kernels, and Algorithms; Lecture Notes in Computer Science,

van der Zanden, Tom C. - p. 247-261 , 2020

Link: https://doi.org/10.1007/..

5

Hedonic Seat Arrangement Problems:

, In: Proceedings of the 19th International Conference on Autonomous Agents and MultiAgent Systems,

Bodlaender, Hans L. ; Hanaka, Tesshu ; Jaffke, Lars... - p. 1777-1779 , 2020

Link: https://dl.acm.org/doi/1..

6

Subgraph Isomorphism on Graph Classes that Exclude a Substr..:

Bodlaender, Hans L. ; Hanaka, Tesshu ; Kobayashi, Yasuaki...
Algorithmica. 82 (2020) 12 - p. 3566-3587 , 2020

Link: https://doi.org/10.1007/..

7

Complexity of the Maximum k-Path Vertex Cover Problem:

MIYANO, Eiji ; SAITOH, Toshiki ; UEHARA, Ryuhei..
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences. E103.A (2020) 10 - p. 1193-1201 , 2020

Link: https://doi.org/10.1587/..

8

A Framework for Exponential-Time-Hypothesis--Tight Algorith..:

de Berg, Mark ; Bodlaender, Hans L. ; Kisfaludi-Bak, Sándor..
SIAM Journal on Computing. 49 (2020) 6 - p. 1291-1331 , 2020

Link: https://doi.org/10.1137/..

9

On the exact complexity of polyomino packing:

Bodlaender, Hans L. ; van der Zanden, Tom C.
Theoretical Computer Science. 839 (2020) - p. 13-20 , 2020

Link: https://doi.org/10.1016/..

10

On exploring always-connected temporal graphs of small path..:

Bodlaender, Hans L. ; van der Zanden, Tom C.
Information Processing Letters. 142 (2019) - p. 68-71 , 2019

Link: https://doi.org/10.1016/..

11

Flower power: Finding optimal plant cutting strategies thro..:

Hoogeveen, Han ; Tomczyk, Jakub ; van der Zanden, Tom C.
Computers & Industrial Engineering. 127 (2019) - p. 39-44 , 2019

Link: https://doi.org/10.1016/..

12

Stable Divisorial Gonality is in NP:

, In: SOFSEM 2019: Theory and Practice of Computer Science; Lecture Notes in Computer Science,

Bodlaender, Hans L. ; van der Wegen, Marieke ; van der Zanden, Tom C. - p. 81-93 , 2019

Link: https://doi.org/10.1007/..

13

On the maximum weight minimal separator:

Hanaka, Tesshu ; Bodlaender, Hans L. ; van der Zanden, Tom C..
Theoretical Computer Science. 796 (2019) - p. 294-308 , 2019

Link: https://doi.org/10.1016/..

14

Subgraph Isomorphism on Graph Classes that Exclude a Substr..:

, In: Lecture Notes in Computer Science; Algorithms and Complexity,

Bodlaender, Hans L. ; Hanaka, Tesshu ; Okamoto, Yoshio.. - p. 87-98 , 2019

Link: https://doi.org/10.1007/..

15

A framework for ETH-tight algorithms and lower bounds in ge..:

, In: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing,

de Berg, Mark ; Bodlaender, Hans L. ; Kisfaludi-Bak, Sándor.. - p. 574-586 , 2018

Link: https://dl.acm.org/doi/1..