Department of Information and Computing Sciences

Departement Informatica contact intern
people education research library calendar archive services jobs

master theses

see also


Hans Bodlaender


22 theses
thesis full
author / title / supervisors
INF/SCR-2011-060 pdf 2011 Sjoerd Timmer, Exact Algorithms for Loop Cutset
prof. dr. Hans Bodlaender
INF/SCR-2011-059 pdf 2011 Vincent Kreuzen, Kernelization Rules for Special Treewidth and Spaghetti Treewidth
prof. dr. Hans Bodlaender, Stefan Kratsch
INF/SCR-2010-093 no pdf 2010 Thomas Dons, Exploring kernelization with nonstandard parameters for Clique Packing
prof. dr. Hans Bodlaender, dr. Han Hoogeveen (0:0)
INF/SCR-2010-067 no pdf 2010 Antonios Thomas, Games on Graphs
prof. dr. Hans Bodlaender, prof. dr. (em.) Jan van Leeuwen (0:0)
INF/SCR-2010-045 no pdf 2010 Marnix Kammer, Plagiarism detection in Haskell programs using call graph matching
prof. dr. Hans Bodlaender, dr. Jurriaan Hage (0:0)
INF/SCR-2009-033 pdf 2009 William van Hemert, Can cooperative systems contribute to reducing traffic congestions?
prof. dr. Hans Bodlaender, dr. Marinus Veldhorst (0:0)
INF/SCR-2009-016 no pdf 2009 Joris Borgdorff, Distributing knowledge in an organization by emergence
prof. dr. Hans Bodlaender, prof. dr. ir. Remko Helms (0:0)
INF/SCR-2008-075 no pdf 2008 Bart Jansen, Fixed Parameter Complexity of the Weighted Max Leaf Problem
prof. dr. Hans Bodlaender
INF/SCR-2008-024 no pdf 2008 G.R.J. van der Zwaan, Graph Ranking
prof. dr. Hans Bodlaender
INF/SCR-2008-020 no pdf 2008 Wouter Penard, Navigation and Flow Algorithms
prof. dr. Hans Bodlaender
INF/SCR-2007-098 no pdf 2007 Lukas Vermeer, Graph Decomposition for Bid Price Optimization in Airline Revenue Management [scriptie is confidential inzage is mogelijk via de studentenadministratie]
dr. ir. Marjan van den Akker, prof. dr. Hans Bodlaender (0:0)
INF/SCR-2007-084 no pdf 2007 Jesper Nederlof, Inclusion exclusion for hard problems
prof. dr. Hans Bodlaender
INF/SCR-2006-073 no pdf 2006 Thomas C. van Dijk, Fixed parameter complexity of feedback set problems
prof. dr. Hans Bodlaender
INF/SCR-2006-005 no pdf 2006 Rooij J. van, Design by Measure and Conquer: An O(1.5086n) algorithm for minimum dominating set and similar problems
prof. dr. Hans Bodlaender
INF/SCR-2005-035 no pdf 2005 Boer B. de, Trust Networks
prof. dr. Hans Bodlaender
INF/SCR-2004-78 no pdf 2004 Penninkx E., Exploiting Connectivity: Faster Exact Algorithms on Planar Graphs
prof. dr. Hans Bodlaender
INF/SCR-2004-66 no pdf 2004 Maes E., Development of a SUpporter for the MApping of GRAph Models for Gras/GXL
prof. dr. Hans Bodlaender
INF/SCR-2004-32 no pdf 2004 Leeuwen, E.J. van, Optimization Problems on Mobile Ad Hoc Networks Algorithms for Disk Graphs
prof. dr. Hans Bodlaender, dr. Gerard Tel (0:0)
INF/SCR-2002-27 no pdf 2003 Kuipers Th. van, An Alternative Method to Pearl's loop Cutset Conditioning in Multiply Connected Multi-parent Single-split Probabilistic networks
prof. dr. Hans Bodlaender, prof. dr. ir. Linda van der Gaag (0:0)
INF/SCR-2000-04 no pdf 2000 Bosse A., The construction of a heuristic for the Windy Postman problem
prof. dr. Hans Bodlaender
INF/SCR-1999-05 no pdf 1999 Ridder H.N. de, Graph automorphisms with maximal projection distances
prof. dr. Hans Bodlaender
INF/SCR-1998-04 no pdf 1998 Havik M.L., Partitioning a Questionnaire Graph
prof. dr. Hans Bodlaender