Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Bodlaender, Hans L
368  Ergebnisse:
englisch X
?
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

Parameterized Problems Complete for Nondeterministic FPT Ti..:

Bodlaender, Hans L. ; Groenland, Carla ; Nederlof, Jesper.
Information and Computation.  , 2024
Link: https://doi.org/10.1016/..
 
?
3

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

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

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

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

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

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

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

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

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

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..
 
?
13

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

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

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