Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Hans L. Bodlaender

Known as: Hans Bodlaender 
Hans Leo Bodlaender (born April 21, 1960) is a Dutch computer scientist, a professor of computer science at Utrecht University. Bodlaender is known… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2020
2020
2020
  • Danny Hermelin
  • Treewidth, Kernels, and Algorithms
  • 2020
  • Corpus ID: 216045217
 
Is this relevant?
2018
2018
Cutwidth is one of the classic layout parameters for graphs. It measures how well one can order the vertices of a graph in a… Expand
  • figure 1
  • figure 2
Is this relevant?
2016
2016
Cutwidth is one of the classic layout parameters for graphs. It measures how well one can order the vertices of a graph in a… Expand
  • figure 1
  • figure 2
Is this relevant?
2014
2014
The parameterized complexity of a problem is generally considered “settled” once it has been shown to be fixed-parameter… Expand
  • figure 2.1
  • figure 2.2
  • figure 3.1
  • figure 4.1
Is this relevant?
2006
2006
While quantitative probabilistic networks (QPNs) allow experts to state influences between nodes in the network as influence… Expand
  • figure 1
  • figure 5
  • figure 7
  • figure 6
  • figure 8
Is this relevant?
Review
2006
Review
2006
The main focus of this workshop was on mathematical techniques needed for the development of efficient solutions and algorithms… Expand
  • figure 2
  • table 2
Is this relevant?
Review
2002
Review
2002
• A submitted manuscript is the version of the article upon submission and before peer-review. There can be important differences… Expand
  • table 2.1
  • table 2.5
  • table 2.4
  • table 2.6
  • table 2.7
Is this relevant?
Highly Cited
2001
Highly Cited
2001
This dissertation describes research into the effective application of model checkers, smart computer programs which can be used… Expand
  • figure 1.1
  • figure 1.2
  • figure 1.3
  • figure 2.1
  • figure 2.2
Is this relevant?
2000
2000
Abstract The linear-width of a graph G is defined to be the smallest integer k such that the edges of G can be arranged in a… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?