pith. sign in

Hans L. Bodlaender

Identifiers

  • name variant Hans L. Bodlaender 0.60 · backfill

Papers (29)

  1. The Parameterized Complexity of Scheduling with Precedence Delays: Shuffle Product and Directed Bandwidth cs.DS · 2026 · author #1
  2. Subgraph Isomorphism on Graph Classes that Exclude a Substructure cs.DS · 2019 · author #1
  3. Parameterized Complexity of Conflict-free Graph Coloring cs.CC · 2019 · author #1
  4. Knot Diagrams of Treewidth Two cs.DS · 2019 · author #1
  5. Stable divisorial gonality is in NP cs.CC · 2018 · author #1
  6. On Exploring Temporal Graphs of Small Pathwidth cs.DS · 2018 · author #1
  7. Fast Dynamic Programming on Graph Decompositions cs.DS · 2018 · author #2
  8. Computing Treewidth on the GPU cs.DC · 2017 · author #2
  9. The Homogeneous Broadcast Problem in Narrow and Wide Strips cs.CG · 2017 · author #2
  10. Improved Lower Bounds for Graph Embedding Problems cs.CC · 2016 · author #1
  11. Subexponential time algorithms for finding small tree and path decompositions cs.DS · 2016 · author #1
  12. Definability Equals Recognizability for $k$-Outerplanar Graphs cs.LO · 2015 · author #2
  13. Practical Algorithms for Linear Boolean-width cs.CC · 2015 · author #3
  14. MSOL-Definability Equals Recognizability for Halin Graphs and Bounded Degree $k$-Outerplanar Graphs cs.LO · 2015 · author #2
  15. PSPACE-completeness of Bloxorz and of Games with 2-Buttons cs.CC · 2014 · author #2
  16. Google Scholar makes it Hard - the complexity of organizing one's publications cs.DL · 2014 · author #1
  17. Characterizing width two for variants of treewidth math.CO · 2014 · author #1
  18. Speeding-up Dynamic Programming with Representative Sets - An Experimental Evaluation of Algorithms for Steiner Tree on Tree Decompositions cs.DS · 2013 · author #2
  19. Pre-processing for Triangulation of Probabilistic Networks cs.AI · 2013 · author #1
  20. Solving weighted and counting variants of connectivity problems parameterized by treewidth deterministically in single exponential time cs.DS · 2012 · author #1
  21. Kernel Bounds for Structural Parameterizations of Pathwidth cs.DS · 2012 · author #1
  22. Monotonicity in Bayesian Networks cs.AI · 2012 · author #2
  23. Kernelization Lower Bounds By Cross-Composition cs.CC · 2012 · author #1
  24. Kernel Bounds for Path and Cycle Problems cs.DS · 2011 · author #1
  25. Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization cs.DS · 2011 · author #1
  26. Vertex Cover Kernelization Revisited: Upper and Lower Bounds for a Refined Parameter cs.DS · 2010 · author #2
  27. Cross-Composition: A New Technique for Kernelization Lower Bounds cs.CC · 2010 · author #1
  28. (Meta) Kernelization cs.DM · 2009 · author #1
  29. Design by Measure and Conquer, A Faster Exact Algorithm for Dominating Set cs.DS · 2008 · author #2

Mentions

  • 1305.7448 #2 · backfill · confidence 0.70 Hans L. Bodlaender
  • 1301.2256 #1 · backfill · confidence 0.70 Hans L. Bodlaender
  • 1211.1505 #1 · backfill · confidence 0.70 Hans L. Bodlaender
  • 1207.4900 #1 · backfill · confidence 0.70 Hans L. Bodlaender
  • 1207.4160 #2 · backfill · confidence 0.70 Hans L. Bodlaender
  • 1206.5941 #1 · backfill · confidence 0.70 Hans L. Bodlaender
  • 1106.4141 #1 · backfill · confidence 0.70 Hans L. Bodlaender
  • 1104.4217 #1 · backfill · confidence 0.70 Hans L. Bodlaender
  • 1012.4701 #2 · backfill · confidence 0.70 Hans L. Bodlaender
  • 1011.4224 #1 · backfill · confidence 0.70 Hans L. Bodlaender
  • 0904.0727 #1 · backfill · confidence 0.70 Hans L. Bodlaender
  • 0802.2827 #2 · backfill · confidence 0.70 Hans L. Bodlaender

Frequent Coauthors