Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Bodlaender, Hans L
21  Ergebnisse:
Buchkapitel (Online) X
Personensuche 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

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

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

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

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

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

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

Constructing Tree Decompositions of Graphs with Bounded Gon..:

, In: Lecture Notes in Computer Science; Computing and Combinatorics,
Bodlaender, Hans L. ; van Dobben de Bruyn, Josse ; Gijswijt, Dion. - p. 384-396 , 2020
Link: https://doi.org/10.1007/..
 
?
9

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

Steiner Trees for Hereditary Graph Classes:

, In: LATIN 2020: Theoretical Informatics; Lecture Notes in Computer Science,
Bodlaender, Hans L. ; Brettell, Nick ; Johnson, Matthew... - p. 613-624 , 2020
Link: https://doi.org/10.1007/..
 
?
11

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

Parameterized Complexity of Conflict-Free Graph Coloring:

, In: Lecture Notes in Computer Science; Algorithms and Data Structures,
Bodlaender, Hans L. ; Kolay, Sudeshna ; Pieterse, Astrid - p. 168-180 , 2019
Link: https://doi.org/10.1007/..
 
?
14

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

Recognizing Hyperelliptic Graphs in Polynomial Time:

, In: Graph-Theoretic Concepts in Computer Science; Lecture Notes in Computer Science,
Bodewes, Jelco M. ; Bodlaender, Hans L. ; Cornelissen, Gunther. - p. 52-64 , 2018
Link: https://doi.org/10.1007/..
 
1-15