MSc-students
Presently (co)supervising:
- P. Huijnen
- P. van 't Hof
- H. Baarsma
- L. Marchal
Already completed:
- 2004: B.S. ten Broeke
Topic: Vulnerability of road networks
- 2003: T. Coenen
Topic: Performance analysis of ad hoc networks
- 2003: S.P. van der Horn
Topic: Optimization of scan testing asynchronous circuits
- 2002: B. Hesse
Topic: Mapping algorithms on reconfigurable architectures
- 2002: M.S. Visser
Topic: Balanced cuts in graphs
- 2001: R.B.G. ten Voorde
Topic: Two vulnerability measures for graphs: tenacity and integrity
- 2000: N.S. den Braber
Topic: Graphs with minimum distance and edge loads
- 2000: P.S. Bonsma
Topic: Algorithms for routing and wavelength assignment in all optical
wide area networks
- 1999: N.S. Apte
Topic: A model for QoS aware mobile computing systems
- 1999: T. de Rooij
Topic: Lattices and geographical information systems
- 1999: S.H. van der Laag
Topic: Long cycles in claw-free graphs
- 1999: R.A. Sitters
Topic: T-choosability in graphs
- 1999: J.W. Weenink
Topic: Frequency management for radionets
- 1998: H. Wrekenhorst
Topic: On the existence of P3-factors in graphs
- 1997: O.R. Koppius
Topic: Degree-preserving spanning trees
- 1997: E.J. Kuipers
Topic: Hamiltonicity in claw-free graphs
- 1996: H. Tuinstra
Topic: Independency trees in graphs
- 1996: E.A. Engbers
Topic: On the toughness of graphs
- 1996: A. Verschut
Topic: Pancyclicity of claw-free hamiltonian graphs
- 1994: E.J.W. Korsten
Topic: The optimal structure of a search tree
- 1994: E.L. Homminga
Topic: Hamiltonian results for claw-free graphs
- 1991: H.M. Verhoeven
Topic: Location problems for assigning facilities
- 1992: G.M. Meinen
Topic: Kristallization and tabu search for fragmentation problems
- 1992: S. van der Wal (Computer Science)
Topic: Drawing planar graphs with many straight paths
- 1991: H.G. Rooijakkers (Computer Science)
Topic: A natural approach to drawing planar graphs
- 1990: P.G. Feij (Computer Science)
Topic: Comprehensive drawing of 3-connected plane graphs
- 1988: W. Bos (Computer Science)
Topic: How to draw a graph
- 1988: H. Miedema
Topic: Heuristics for the independent det problem
Graduation committee member for:
- 2002: A.M. van Duin
Topic: Quality assessment of environmental studies
- 2001: C.N. Groenouwe
Topic: Clearing opstructions! On solving operator/constructor
ambiguities.
- 2000: T.H. Althuis
Topic: Mathematical structures in atonal music
- 1999: B. Peeters
Topic: Bargaining models
- 1997: B. Hondebrink
Topic: On edge-transitive regular graphs
- 1997: S. Keizer
Topic: Knowledge graphs and the approach of LILOG
- 1997: R.H.T. van de Steeg
Topic: Perfect matchings in regular bipartite graphs
- 1993: E.J. Reitsma
Topic: The theory of scripts
- 1992: J.P. van den Berg
Topic: Algorithms for the maximum clique problem
- 1992: H. Trommel
Topic: Graph homomorphisms
- 1992: E.D. van Blanken
Topic: Degree conditions for hamiltonian line graphs to be pancyclic
- 1988: K.M. Duursma
Topic: Uniform emulations from the shuffle-exchange graph to the
hypercube