E-LIB Suche - Ergebnisse für: Bodlaender, Hans L

1

Parameterized Problems Complete for Nondeterministic FPT Ti..:

Bodlaender, Hans L. ; Groenland, Carla ; Nederlof, Jesper.
Information and Computation. , 2024

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

2

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

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

3

An ETH-Tight Exact Algorithm for Euclidean TSP:

de Berg, Mark ; Bodlaender, Hans L. ; Kisfaludi-Bak, Sándor.
SIAM Journal on Computing. 52 (2023) 3 - p. 740-760 , 2023

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

4

Steiner trees for hereditary graph classes: A treewidth per..:

Bodlaender, Hans L. ; Brettell, Nick ; Johnson, Matthew...
Theoretical Computer Science. 867 (2021) - p. 30-39 , 2021

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

5

Dynamic sampling from a discrete probability distribution w..:

D'Ambrosio, Federico ; Bodlaender, Hans L. ; Barkema, Gerard T.
Computational Statistics. 37 (2021) 3 - p. 1203-1228 , 2021

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

6

Constructing tree decompositions of graphs with bounded gon..:

Bodlaender, Hans L. ; van Dobben de Bruyn, Josse ; Gijswijt, Dion.
Journal of Combinatorial Optimization. 44 (2021) 4 - p. 2681-2699 , 2021

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

7

Parameterized Complexity of Conflict-Free Graph Coloring:

Bodlaender, Hans L. ; Kolay, Sudeshna ; Pieterse, Astrid
SIAM Journal on Discrete Mathematics. 35 (2021) 3 - p. 2003-2038 , 2021

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

8

Typical Sequences Revisited — Computing Width Parameters of..:

Bodlaender, Hans L. ; Jaffke, Lars ; Telle, Jan Arne
Theory of Computing Systems. 67 (2021) 1 - p. 52-88 , 2021

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

9

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/..

10

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/..

11

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/..

12

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/..

13

Recognizing hyperelliptic graphs in polynomial time:

Bodewes, Jelco M. ; Bodlaender, Hans L. ; Cornelissen, Gunther.
Theoretical Computer Science. 815 (2020) - p. 121-146 , 2020

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

14

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/..

15

The Homogeneous Broadcast Problem in Narrow and Wide Strips..:

de Berg, Mark ; Bodlaender, Hans L. ; Kisfaludi-Bak, Sándor
Algorithmica. 81 (2019) 7 - p. 2963-2990 , 2019

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