Hans L. Bodlaender
Hans Leo Bodlaender (born April 21, 1960) is a Dutch computer scientist, a professor of computer science at Utrecht University and professor Network Algorithms at the Eindhoven University of Technology. Bodlaender is known for his work on graph algorithms and in particular for algorithms relating to tree decomposition of graphs.
Wikipage redirect
AlfilAmazon (chess)Andernach chessBalbo's gameBaroque chessBerolina chessBishop (chess)Bughouse chessCapablanca chessChad (chess variant)Chancellor chessChaturajiChaturangaChristian FreelingCirce chessCourier chessDabbaba (chess)Double chessDragonchessDragonfly (chess variant)Dunsany's chessDynamo chessEde,_NetherlandsEmpress (chess)Extinction chessFour-player chessGrand chessGrasshopper (chess)Grasshopper chessHans BodlaenderHexagonal chessHippogonalInternational Symposium on Mathematical Foundations of Computer ScienceJan van LeeuwenJanus ChessJungle (board game)King (chess)Knight (chess)Kriegspiel (chess)List of people associated with Utrecht University
Link from a Wikipage to another Wikipage
primaryTopic
Hans L. Bodlaender
Hans Leo Bodlaender (born April 21, 1960) is a Dutch computer scientist, a professor of computer science at Utrecht University and professor Network Algorithms at the Eindhoven University of Technology. Bodlaender is known for his work on graph algorithms and in particular for algorithms relating to tree decomposition of graphs.
has abstract
Hans Leo Bodlaender (born Apri ...... tree decomposition of graphs.
@en
Link from a Wikipage to an external page
Wikipage page ID
34,792,544
page length (characters) of wiki page
Wikipage revision ID
1,011,073,829
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
subject
hypernym
sameAs
comment
Hans Leo Bodlaender (born Apri ...... tree decomposition of graphs.
@en
label
Hans L. Bodlaender
@en