Bodlaender, Hans L.
- Kernelization Lower Bounds By Cross-Composition
2012/06/26 by Hans L. Bodlaender, Bodlaender, Hans L., Bart M. P. Jansen +3 · 6 citations
Computer Science · Biochemistry, Genetics and Molecular Biology · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Protein Degradation and Inhibitors
- (Meta) Kernelization
2009/04/04 by Hans L. Bodlaender, Fedor V. Fomin, Bodlaender, Hans L. +9 · 7 citations
Computer Science · #Complexity and Algorithms in Graphs #Advanced Graph Theory Research #Computational Geometry and Mesh Generation
- Parameterized Problems Complete for Nondeterministic FPT time and Logarithmic Space
2021/05/31 by Hans L. Bodlaender, Bodlaender, Hans L., Carla Groenland +5 · 5 citations
Computer Science · Engineering · #Advanced Graph Theory Research #Scheduling and Optimization Algorithms #Complexity and Algorithms in Graphs
- Hedonic Seat Arrangement Problems
2020/02/25 by Bodlaender, Hans L., Hanaka, Tesshu, Jaffke, Lars +3 · 4 citations
#Computational Complexity (cs.CC) #Computer Science and Game Theory (cs.GT) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
- XNLP-completeness for Parameterized Problems on Graphs with a Linear Structure
2022/01/31 by Bodlaender, Hans L., Groenland, Carla, Jacob, Hugo +2 · 4 citations
#Computational Complexity (cs.CC) #FOS: Computer and information sciences
- Subgraph Isomorphism on Graph Classes that Exclude a Substructure
2019/05/25 by Bodlaender, Hans L., Hanaka, Tesshu, Kobayashi, Yasuaki +4 · 3 citations
#Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
- List Colouring Trees in Logarithmic Space
2022/06/20 by Bodlaender, Hans L., Groenland, Carla, Jacob, Hugo · 2 citations
#Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences
- Cross-Composition: A New Technique for Kernelization Lower Bounds
2010/11/18 by Bodlaender, Hans L., Jansen, Bart M. P., Kratsch, Stefan · 1 citation
#Computational Complexity (cs.CC) #F.2.2 #FOS: Computer and information sciences
- Kernel Bounds for Path and Cycle Problems
2011/06/21 by Bodlaender, Hans L., Jansen, Bart M. P., Kratsch, Stefan · 1 citation
#68Q25 #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #F.2.2 #FOS: Computer and information sciences #G.2.2
- An ETH-Tight Exact Algorithm for Euclidean TSP
2018/07/18 by de Berg, Mark, Bodlaender, Hans L., Kisfaludi-Bak, Sándor +1 · 1 citation
#Computational Complexity (cs.CC) #Computational Geometry (cs.CG) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
- Typical Sequences Revisited --- Computing Width Parameters of Graphs
2019/05/09 by Bodlaender, Hans L., Jaffke, Lars, Telle, Jan Arne · 1 citation
#Combinatorics (math.CO) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #FOS: Mathematics
- Parameterized Complexities of Dominating and Independent Set Reconfiguration
2021/06/30 by Bodlaender, Hans L., Groenland, Carla, Swennenhuis, Céline M. F. · 1 citation
#68Q25 #68Q27 #Computational Complexity (cs.CC) #FOS: Computer and information sciences
- On the Complexity of Problems on Tree-structured Graphs
2022/06/23 by Bodlaender, Hans L., Groenland, Carla, Jacob, Hugo +2 · 1 citation
#Computational Complexity (cs.CC) #FOS: Computer and information sciences
- XALP-completeness of Parameterized Problems on Planar Graphs
2024/02/05 by Bodlaender, Hans L., Szilágyi, Krisztina · 1 citation
#05C10 #68Q15 #Computational Complexity (cs.CC) #FOS: Computer and information sciences #G.2.2
- Finding sparse induced subgraphs on graphs of bounded induced matching treewidth
2025/07/10 by Bodlaender, Hans L., Fomin, Fedor V., Korhonen, Tuukka · 2 citations
#Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences