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

1

Complexity Framework for Forbidden Subgraphs IV: The Steine..:

, In: Lecture Notes in Computer Science; Combinatorial Algorithms,

Bodlaender, Hans L. ; Johnson, Matthew ; Martin, Barnaby... - p. 206-217 , 2024

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

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

From the W-hierarchy to XNLP: Classes of Fixed Parameter In..:

, In: WALCOM: Algorithms and Computation; Lecture Notes in Computer Science,

Bodlaender, Hans L. - p. 15-25 , 2022

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

5

Problems Hard for Treewidth but Easy for Stable Gonality:

, In: Graph-Theoretic Concepts in Computer Science; Lecture Notes in Computer Science,

Bodlaender, Hans L. ; Cornelissen, Gunther ; van der Wegen, Marieke - p. 84-97 , 2022

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

6

Parameterized Problems Complete for Nondeterministic FPT ti..:

, In: 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS),

Bodlaender, Hans L. ; Groenland, Carla ; Nederlof, Jesper. - p. 193-204 , 2022

Link: https://doi.org/10.1109/..

7

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

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

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

10

Fixed-Treewidth-Efficient Algorithms for Edge-Deletion to I..:

, In: WALCOM: Algorithms and Computation; Lecture Notes in Computer Science,

Saitoh, Toshiki ; Yoshinaka, Ryo ; Bodlaender, Hans L. - p. 142-153 , 2021

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

11

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

12

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

13

Parameterized Complexity of Bandwidth of Caterpillars and W..:

, In: Graph-Theoretic Concepts in Computer Science; Lecture Notes in Computer Science,

Bodlaender, Hans L. - p. 15-27 , 2021

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

14

Knot Diagrams of Treewidth Two:

, In: Graph-Theoretic Concepts in Computer Science; Lecture Notes in Computer Science,

Bodlaender, Hans L. ; Burton, Benjamin ; Fomin, Fedor V.. - p. 80-91 , 2020

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

15

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