{"id":91,"date":"2013-11-06T10:06:36","date_gmt":"2013-11-06T09:06:36","guid":{"rendered":"https:\/\/project.dke.maastrichtuniversity.nl\/nso\/?page_id=91"},"modified":"2017-12-20T12:56:03","modified_gmt":"2017-12-20T11:56:03","slug":"bsc-msc-projects-2","status":"publish","type":"page","link":"https:\/\/project.dke.maastrichtuniversity.nl\/nso\/?page_id=91","title":{"rendered":"BSc \/ MSc Projects"},"content":{"rendered":"<p>Here is a list of bachelor and master graduation projects from recent years that have been supervised by NSO staff members. For academic year 2015-2016 we have some suggested BSc and MSc thesis topics here: <a href=\"https:\/\/project.dke.maastrichtuniversity.nl\/nso\/wp-content\/uploads\/2016\/02\/NSO-thesis-topics-2016.pdf\">NSO-thesis-topics-2016<\/a>.<\/p>\n<p><strong>Steven Kelk<\/strong><strong><br \/>\n<\/strong><\/p>\n<ul>\n<li>Minimum Modification of Time Series to Alter Classification Outcomes under the Nearest Neighbour Algorithm (BSc)<\/li>\n<li>Pathway Analysis: a Set Cover Approach (BSc)<\/li>\n<li>Parsimony distance games on binary phylogenetic trees (BSc)<\/li>\n<li>Comparative Study on Cost Control and Cost Risk Management in<br \/>\nTelecommunication Network Sites (BSc)<\/li>\n<li>Towards an O(1) treewidth oracle (BSc)<\/li>\n<li>Improved transaction fraud detection by graph mining (MSc)<\/li>\n<li>Parsimony distance: an impoved linear bound on the number of states in optimal convex characters when the distance is two (BSc)<\/li>\n<li>Strategies for the Directed Feedback Vertex Set (DFVS) problem (BSc)<\/li>\n<li>The Pedagogy of Linear Programming (BSc)<\/li>\n<li>An Integer Linear Program for Computation of Tree Bisection and Reconnection Distance Between Two Phylogenetic Trees (BSc)<\/li>\n<li>Rooted Phylogenetic Networks: computing hybridization number via softwired clusters (MSc)<\/li>\n<li>Minimum Perfect Phylogeny Haplotyping: in Search of a New Island of Tractability (BSc)<\/li>\n<li>Travelling Repairman Problem on Caterpillar Trees (BSc)<\/li>\n<li>Minimizing the total travel distance for tournaments (BSc)<\/li>\n<li>On the complexity and solving of building a circle out of a dense set of quartets (BSc)<\/li>\n<li>Integer Linear Programming for Constructing Phylogenetic Trees from Rooted Triplets (BSc)<\/li>\n<li>An Upper Bound on Prefix Reversals applied to Ternary Strings (BSc)<\/li>\n<li>Worst case approximation ratio for the hybridization number of phylogenetic trees (BSc)<\/li>\n<li>Improving Usability of Phylogenetic Network Software through Preprocessing (MSc)<\/li>\n<li>A Hospital Ward Scheduling Case &#8211; Constraint Programming vs. Integer Linear Programming (MSc)<\/li>\n<li>5-Colourable Graphs of Degree 6 (BSc)<\/li>\n<\/ul>\n<p><strong>Frank Thuijsman<\/strong><\/p>\n<ul>\n<li><span class=\"auto-style3\">Development of a Robust and Adaptive Model for Optimizing the Detection Strategies against People-Smugglers in the Mediterranean Sea (MSc).<\/span><\/li>\n<li>Planning Anti-Submarine Warfare using Partially Observable Markov Games\u00a0(MSc).<\/li>\n<li><span class=\"auto-style3\">Topics in Defence Planning (MSc).<\/span><\/li>\n<li>Single Vehicle Routing Problem with Deliveries and Selective Pickups (MSc).<\/li>\n<li>Stable Matching with Unstable Preferences (MSc).<\/li>\n<li>Effect of Aging in Continuous Local Dynamics (MSc).<\/li>\n<li>The Music of Games (BSc).<\/li>\n<li>Fitting and Sampling of Multi-Compartment Models to Diffusion Weighted MRI Data (MSc).<\/li>\n<li>Modeling the Development of Obesity in Populations (MSc).<\/li>\n<li>A Cooperative Game Theory Application in Blackbird Broods Food Allocation (MSc).<\/li>\n<li>Oc\u00e9 Service Engineers Calculation Model (MSc).<\/li>\n<li>Experiments in Local Evolutionary Dynamics (MSc).<\/li>\n<li>Linear Programming in Secondary School (BSc).<\/li>\n<li>Local Replicator Dynamics and the Evolution of Bacterial Populations Playing a Game of Rock-Paper-Scissors (BSc).<\/li>\n<li>Searching in Networks (BSc).<\/li>\n<li>A Model of the Oviposition Behavior of\u00a0<i>Copidosoma koehleri<\/i>\u00a0Parasitoid Wasps (BSc).<\/li>\n<li>Optimal Stopping and Secretary Problems (MSc).<\/li>\n<li>The Evolution of Populations using Local Replicator Dynamics (BSc).<\/li>\n<li>A Cyber Application for Business Decision Making (BSc).<\/li>\n<li>Auctions and Evolutionary Games (MSc).<\/li>\n<li>Optimizing the Arrangement of the Storage Yard of a Brickworks (MSc).<\/li>\n<li>Hide and Seek Games (MSc).<\/li>\n<li>Beehaviour (MSc).<\/li>\n<li>Search Strategies (BSc).<\/li>\n<li>Correlated Equilibria (MSc).<\/li>\n<li>\u201cGet Connected!\u201d (MSc).<\/li>\n<li>Cake Division (MSc).<\/li>\n<li>\u03b2-Rationality, a Study on Ungreedy Equilibria (MSc).<\/li>\n<li>Modelling of Call Forecasting for a Call Center (MSc).<\/li>\n<li>Equilibria in Polytope Games (MSc).<\/li>\n<li>Sets of Equilibria in Stochastic Games (MSc).<\/li>\n<li>Recursive Games (MSc).<\/li>\n<\/ul>\n","protected":false},"excerpt":{"rendered":"<p>Here is a list of bachelor and master graduation projects from recent years that have been supervised by NSO staff members. For academic year 2015-2016 we have some suggested BSc and MSc thesis topics here: NSO-thesis-topics-2016. Steven Kelk Minimum Modification &hellip; <a href=\"https:\/\/project.dke.maastrichtuniversity.nl\/nso\/?page_id=91\">Continue reading <span class=\"meta-nav\">&rarr;<\/span><\/a><\/p>\n","protected":false},"author":2,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-91","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/project.dke.maastrichtuniversity.nl\/nso\/index.php?rest_route=\/wp\/v2\/pages\/91","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/project.dke.maastrichtuniversity.nl\/nso\/index.php?rest_route=\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/project.dke.maastrichtuniversity.nl\/nso\/index.php?rest_route=\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/project.dke.maastrichtuniversity.nl\/nso\/index.php?rest_route=\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/project.dke.maastrichtuniversity.nl\/nso\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=91"}],"version-history":[{"count":25,"href":"https:\/\/project.dke.maastrichtuniversity.nl\/nso\/index.php?rest_route=\/wp\/v2\/pages\/91\/revisions"}],"predecessor-version":[{"id":450,"href":"https:\/\/project.dke.maastrichtuniversity.nl\/nso\/index.php?rest_route=\/wp\/v2\/pages\/91\/revisions\/450"}],"wp:attachment":[{"href":"https:\/\/project.dke.maastrichtuniversity.nl\/nso\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=91"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}