Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Sorted by: relevance · author · university · dateNew search

You searched for +publisher:"Universiteit Utrecht" +contributor:("Bodlaender, H.L."). Showing records 1 – 13 of 13 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters

1. Boxel, M.E.R. van. Improved Algorithms for the Computation of Special Junction Trees.

Degree: 2014, Universiteit Utrecht

 Several intractable (e.g. NP-complete) graph problems can be solved efficiently with help of junction trees without large bags. Graph parameters that measure the suitability of… (more)

Subjects/Keywords: Treewidth; Treecost; Pathwidth; Triangulation; Dynamic programming; Exact algorithm; Experiments

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Boxel, M. E. R. v. (2014). Improved Algorithms for the Computation of Special Junction Trees. (Masters Thesis). Universiteit Utrecht. Retrieved from http://dspace.library.uu.nl:8080/handle/1874/296605

Chicago Manual of Style (16th Edition):

Boxel, M E R van. “Improved Algorithms for the Computation of Special Junction Trees.” 2014. Masters Thesis, Universiteit Utrecht. Accessed November 30, 2020. http://dspace.library.uu.nl:8080/handle/1874/296605.

MLA Handbook (7th Edition):

Boxel, M E R van. “Improved Algorithms for the Computation of Special Junction Trees.” 2014. Web. 30 Nov 2020.

Vancouver:

Boxel MERv. Improved Algorithms for the Computation of Special Junction Trees. [Internet] [Masters thesis]. Universiteit Utrecht; 2014. [cited 2020 Nov 30]. Available from: http://dspace.library.uu.nl:8080/handle/1874/296605.

Council of Science Editors:

Boxel MERv. Improved Algorithms for the Computation of Special Junction Trees. [Masters Thesis]. Universiteit Utrecht; 2014. Available from: http://dspace.library.uu.nl:8080/handle/1874/296605

2. Zanden, T.C. van der. Parameterized Complexity of Graph Constraint Logic.

Degree: 2015, Universiteit Utrecht

 Graph constraint logic is a framework introduced by Hearn and Demaine, which provides several problems that are often a convenient starting point for reductions. We… (more)

Subjects/Keywords: nondeterministic constraint logic; parameterized complexity; pspace; treewidth; bandwidth; rush hour; reconfiguration problems

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Zanden, T. C. v. d. (2015). Parameterized Complexity of Graph Constraint Logic. (Masters Thesis). Universiteit Utrecht. Retrieved from http://dspace.library.uu.nl:8080/handle/1874/315914

Chicago Manual of Style (16th Edition):

Zanden, T C van der. “Parameterized Complexity of Graph Constraint Logic.” 2015. Masters Thesis, Universiteit Utrecht. Accessed November 30, 2020. http://dspace.library.uu.nl:8080/handle/1874/315914.

MLA Handbook (7th Edition):

Zanden, T C van der. “Parameterized Complexity of Graph Constraint Logic.” 2015. Web. 30 Nov 2020.

Vancouver:

Zanden TCvd. Parameterized Complexity of Graph Constraint Logic. [Internet] [Masters thesis]. Universiteit Utrecht; 2015. [cited 2020 Nov 30]. Available from: http://dspace.library.uu.nl:8080/handle/1874/315914.

Council of Science Editors:

Zanden TCvd. Parameterized Complexity of Graph Constraint Logic. [Masters Thesis]. Universiteit Utrecht; 2015. Available from: http://dspace.library.uu.nl:8080/handle/1874/315914


Universiteit Utrecht

3. Timmer, S.T. Exact Algorithms for Loop Cutset.

Degree: 2012, Universiteit Utrecht

 The LOOP CUTSET problem was historically posed by Pearl as a subroutine in Pearl’s algorithm for computing inference in probabilistic networks. The efficiency of the… (more)

Subjects/Keywords: LOOP CUTSET; MAXIMUM INDUCED FOREST; Exact Algorithms; Treewidth; Cut & Count; Branch & Bound; Branch & Reduce; FEEDBACK VERTEX SET

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Timmer, S. T. (2012). Exact Algorithms for Loop Cutset. (Masters Thesis). Universiteit Utrecht. Retrieved from http://dspace.library.uu.nl:8080/handle/1874/253746

Chicago Manual of Style (16th Edition):

Timmer, S T. “Exact Algorithms for Loop Cutset.” 2012. Masters Thesis, Universiteit Utrecht. Accessed November 30, 2020. http://dspace.library.uu.nl:8080/handle/1874/253746.

MLA Handbook (7th Edition):

Timmer, S T. “Exact Algorithms for Loop Cutset.” 2012. Web. 30 Nov 2020.

Vancouver:

Timmer ST. Exact Algorithms for Loop Cutset. [Internet] [Masters thesis]. Universiteit Utrecht; 2012. [cited 2020 Nov 30]. Available from: http://dspace.library.uu.nl:8080/handle/1874/253746.

Council of Science Editors:

Timmer ST. Exact Algorithms for Loop Cutset. [Masters Thesis]. Universiteit Utrecht; 2012. Available from: http://dspace.library.uu.nl:8080/handle/1874/253746


Universiteit Utrecht

4. Prins, S.J. Finding a winning strategy in variations of Kayles.

Degree: 2015, Universiteit Utrecht

 Kayles is a two player game played on a graph. The game can be defined as follows: both players take turns picking a node from… (more)

Subjects/Keywords: Kayles; PSPACE; exact; game

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Prins, S. J. (2015). Finding a winning strategy in variations of Kayles. (Masters Thesis). Universiteit Utrecht. Retrieved from http://dspace.library.uu.nl:8080/handle/1874/317590

Chicago Manual of Style (16th Edition):

Prins, S J. “Finding a winning strategy in variations of Kayles.” 2015. Masters Thesis, Universiteit Utrecht. Accessed November 30, 2020. http://dspace.library.uu.nl:8080/handle/1874/317590.

MLA Handbook (7th Edition):

Prins, S J. “Finding a winning strategy in variations of Kayles.” 2015. Web. 30 Nov 2020.

Vancouver:

Prins SJ. Finding a winning strategy in variations of Kayles. [Internet] [Masters thesis]. Universiteit Utrecht; 2015. [cited 2020 Nov 30]. Available from: http://dspace.library.uu.nl:8080/handle/1874/317590.

Council of Science Editors:

Prins SJ. Finding a winning strategy in variations of Kayles. [Masters Thesis]. Universiteit Utrecht; 2015. Available from: http://dspace.library.uu.nl:8080/handle/1874/317590


Universiteit Utrecht

5. Brinke, C.B. ten. Variations on Boolean-width.

Degree: 2015, Universiteit Utrecht

 This thesis is about the graph parameter boolean-width and several related parameters. In particular we investigate the restriction of boolean-width to linear decompositions, called linear… (more)

Subjects/Keywords: graph decomposition; boolean-width; heuristics; exact algorithms; vertex subset problems

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Brinke, C. B. t. (2015). Variations on Boolean-width. (Masters Thesis). Universiteit Utrecht. Retrieved from http://dspace.library.uu.nl:8080/handle/1874/319983

Chicago Manual of Style (16th Edition):

Brinke, C B ten. “Variations on Boolean-width.” 2015. Masters Thesis, Universiteit Utrecht. Accessed November 30, 2020. http://dspace.library.uu.nl:8080/handle/1874/319983.

MLA Handbook (7th Edition):

Brinke, C B ten. “Variations on Boolean-width.” 2015. Web. 30 Nov 2020.

Vancouver:

Brinke CBt. Variations on Boolean-width. [Internet] [Masters thesis]. Universiteit Utrecht; 2015. [cited 2020 Nov 30]. Available from: http://dspace.library.uu.nl:8080/handle/1874/319983.

Council of Science Editors:

Brinke CBt. Variations on Boolean-width. [Masters Thesis]. Universiteit Utrecht; 2015. Available from: http://dspace.library.uu.nl:8080/handle/1874/319983

6. Katsikarelis, I. On the rank of Directed Hamiltonicity and beyond.

Degree: 2014, Universiteit Utrecht

 Motivated by recent research making use of insights on the relationship between the optimal substructure of dynamic programming procedures and the rank of problem-specific matrices,… (more)

Subjects/Keywords: Hamiltonian cycle; path decomposition; dynamic programming; rank-based approach

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Katsikarelis, I. (2014). On the rank of Directed Hamiltonicity and beyond. (Masters Thesis). Universiteit Utrecht. Retrieved from http://dspace.library.uu.nl:8080/handle/1874/291563

Chicago Manual of Style (16th Edition):

Katsikarelis, I. “On the rank of Directed Hamiltonicity and beyond.” 2014. Masters Thesis, Universiteit Utrecht. Accessed November 30, 2020. http://dspace.library.uu.nl:8080/handle/1874/291563.

MLA Handbook (7th Edition):

Katsikarelis, I. “On the rank of Directed Hamiltonicity and beyond.” 2014. Web. 30 Nov 2020.

Vancouver:

Katsikarelis I. On the rank of Directed Hamiltonicity and beyond. [Internet] [Masters thesis]. Universiteit Utrecht; 2014. [cited 2020 Nov 30]. Available from: http://dspace.library.uu.nl:8080/handle/1874/291563.

Council of Science Editors:

Katsikarelis I. On the rank of Directed Hamiltonicity and beyond. [Masters Thesis]. Universiteit Utrecht; 2014. Available from: http://dspace.library.uu.nl:8080/handle/1874/291563


Universiteit Utrecht

7. Graaff, L.W. van der. Dynamic programming on Nice Tree Decompositions.

Degree: 2015, Universiteit Utrecht

 Connectivity problems such as the Steiner Tree Problem are NP-hard problems that are fixed parameter tractable in the treewidth of the input graph. In this… (more)

Subjects/Keywords: treewidth; Steiner tree problem; dynamic programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Graaff, L. W. v. d. (2015). Dynamic programming on Nice Tree Decompositions. (Masters Thesis). Universiteit Utrecht. Retrieved from http://dspace.library.uu.nl:8080/handle/1874/309652

Chicago Manual of Style (16th Edition):

Graaff, L W van der. “Dynamic programming on Nice Tree Decompositions.” 2015. Masters Thesis, Universiteit Utrecht. Accessed November 30, 2020. http://dspace.library.uu.nl:8080/handle/1874/309652.

MLA Handbook (7th Edition):

Graaff, L W van der. “Dynamic programming on Nice Tree Decompositions.” 2015. Web. 30 Nov 2020.

Vancouver:

Graaff LWvd. Dynamic programming on Nice Tree Decompositions. [Internet] [Masters thesis]. Universiteit Utrecht; 2015. [cited 2020 Nov 30]. Available from: http://dspace.library.uu.nl:8080/handle/1874/309652.

Council of Science Editors:

Graaff LWvd. Dynamic programming on Nice Tree Decompositions. [Masters Thesis]. Universiteit Utrecht; 2015. Available from: http://dspace.library.uu.nl:8080/handle/1874/309652


Universiteit Utrecht

8. Boers, M. Finding Geographically Separated Paths Through Fiber Networks.

Degree: 2015, Universiteit Utrecht

 The KPN fiber network is a network of fiber cables in The Netherlands. Since only a part of the capacities of the cables are used… (more)

Subjects/Keywords: flow problem; graph theory; pathfinding; MILP; simulated annealing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Boers, M. (2015). Finding Geographically Separated Paths Through Fiber Networks. (Masters Thesis). Universiteit Utrecht. Retrieved from http://dspace.library.uu.nl:8080/handle/1874/324380

Chicago Manual of Style (16th Edition):

Boers, M. “Finding Geographically Separated Paths Through Fiber Networks.” 2015. Masters Thesis, Universiteit Utrecht. Accessed November 30, 2020. http://dspace.library.uu.nl:8080/handle/1874/324380.

MLA Handbook (7th Edition):

Boers, M. “Finding Geographically Separated Paths Through Fiber Networks.” 2015. Web. 30 Nov 2020.

Vancouver:

Boers M. Finding Geographically Separated Paths Through Fiber Networks. [Internet] [Masters thesis]. Universiteit Utrecht; 2015. [cited 2020 Nov 30]. Available from: http://dspace.library.uu.nl:8080/handle/1874/324380.

Council of Science Editors:

Boers M. Finding Geographically Separated Paths Through Fiber Networks. [Masters Thesis]. Universiteit Utrecht; 2015. Available from: http://dspace.library.uu.nl:8080/handle/1874/324380

9. Vries, G.J. de. Feedback Vertex Kayles Finding a wining strategy in a two-player combinatorial game.

Degree: 2016, Universiteit Utrecht

 In this thesis Feedback Vertex Kayles is discused. Feedback Vertex Kayles is a two-player combinatorial game on graphs in which players remove nodes positioned on… (more)

Subjects/Keywords: Feedback; Vertex; Kayles; Feedback Vertex; Feedback Vertex Kayles; combinatorial game; game; PSPACE; PSPACE-complete; exact; graph; graphs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Vries, G. J. d. (2016). Feedback Vertex Kayles Finding a wining strategy in a two-player combinatorial game. (Masters Thesis). Universiteit Utrecht. Retrieved from http://dspace.library.uu.nl:8080/handle/1874/337071

Chicago Manual of Style (16th Edition):

Vries, G J de. “Feedback Vertex Kayles Finding a wining strategy in a two-player combinatorial game.” 2016. Masters Thesis, Universiteit Utrecht. Accessed November 30, 2020. http://dspace.library.uu.nl:8080/handle/1874/337071.

MLA Handbook (7th Edition):

Vries, G J de. “Feedback Vertex Kayles Finding a wining strategy in a two-player combinatorial game.” 2016. Web. 30 Nov 2020.

Vancouver:

Vries GJd. Feedback Vertex Kayles Finding a wining strategy in a two-player combinatorial game. [Internet] [Masters thesis]. Universiteit Utrecht; 2016. [cited 2020 Nov 30]. Available from: http://dspace.library.uu.nl:8080/handle/1874/337071.

Council of Science Editors:

Vries GJd. Feedback Vertex Kayles Finding a wining strategy in a two-player combinatorial game. [Masters Thesis]. Universiteit Utrecht; 2016. Available from: http://dspace.library.uu.nl:8080/handle/1874/337071


Universiteit Utrecht

10. Houten, F.J.P. van. Experimental Research and Algorithmic Improvements involving the Graph Parameter Boolean-width.

Degree: 2015, Universiteit Utrecht

 In this thesis, we investigate numerous algorithms that make use of boolean decompositions. We provide a new algorithm for computing the representatives of linear decompositions.… (more)

Subjects/Keywords: graph decomposition; boolean-width; heuristics; reduction rules; vertex subset problems

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Houten, F. J. P. v. (2015). Experimental Research and Algorithmic Improvements involving the Graph Parameter Boolean-width. (Masters Thesis). Universiteit Utrecht. Retrieved from http://dspace.library.uu.nl:8080/handle/1874/317767

Chicago Manual of Style (16th Edition):

Houten, F J P van. “Experimental Research and Algorithmic Improvements involving the Graph Parameter Boolean-width.” 2015. Masters Thesis, Universiteit Utrecht. Accessed November 30, 2020. http://dspace.library.uu.nl:8080/handle/1874/317767.

MLA Handbook (7th Edition):

Houten, F J P van. “Experimental Research and Algorithmic Improvements involving the Graph Parameter Boolean-width.” 2015. Web. 30 Nov 2020.

Vancouver:

Houten FJPv. Experimental Research and Algorithmic Improvements involving the Graph Parameter Boolean-width. [Internet] [Masters thesis]. Universiteit Utrecht; 2015. [cited 2020 Nov 30]. Available from: http://dspace.library.uu.nl:8080/handle/1874/317767.

Council of Science Editors:

Houten FJPv. Experimental Research and Algorithmic Improvements involving the Graph Parameter Boolean-width. [Masters Thesis]. Universiteit Utrecht; 2015. Available from: http://dspace.library.uu.nl:8080/handle/1874/317767


Universiteit Utrecht

11. Pino, W.J.A. Cut and Count and Representative Sets on Branch Decompositions.

Degree: 2016, Universiteit Utrecht

 Recently, new techniques have been introduced to speed up dynamic programming algorithms on tree decompositions for connectivity problems: the `Cut and Count' method and a… (more)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Pino, W. J. A. (2016). Cut and Count and Representative Sets on Branch Decompositions. (Masters Thesis). Universiteit Utrecht. Retrieved from http://dspace.library.uu.nl:8080/handle/1874/337069

Chicago Manual of Style (16th Edition):

Pino, W J A. “Cut and Count and Representative Sets on Branch Decompositions.” 2016. Masters Thesis, Universiteit Utrecht. Accessed November 30, 2020. http://dspace.library.uu.nl:8080/handle/1874/337069.

MLA Handbook (7th Edition):

Pino, W J A. “Cut and Count and Representative Sets on Branch Decompositions.” 2016. Web. 30 Nov 2020.

Vancouver:

Pino WJA. Cut and Count and Representative Sets on Branch Decompositions. [Internet] [Masters thesis]. Universiteit Utrecht; 2016. [cited 2020 Nov 30]. Available from: http://dspace.library.uu.nl:8080/handle/1874/337069.

Council of Science Editors:

Pino WJA. Cut and Count and Representative Sets on Branch Decompositions. [Masters Thesis]. Universiteit Utrecht; 2016. Available from: http://dspace.library.uu.nl:8080/handle/1874/337069


Universiteit Utrecht

12. Kreuzen, V.J.C. Kernelization Rules for Special Treewidth and Spaghetti Treewidth.

Degree: 2012, Universiteit Utrecht

Subjects/Keywords: treewidth; special treewidth; spaghetti treewidth; kreuzen; kernelization; preprocessing; graph theory; mambas; paths of cycles

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Kreuzen, V. J. C. (2012). Kernelization Rules for Special Treewidth and Spaghetti Treewidth. (Masters Thesis). Universiteit Utrecht. Retrieved from http://dspace.library.uu.nl:8080/handle/1874/253752

Chicago Manual of Style (16th Edition):

Kreuzen, V J C. “Kernelization Rules for Special Treewidth and Spaghetti Treewidth.” 2012. Masters Thesis, Universiteit Utrecht. Accessed November 30, 2020. http://dspace.library.uu.nl:8080/handle/1874/253752.

MLA Handbook (7th Edition):

Kreuzen, V J C. “Kernelization Rules for Special Treewidth and Spaghetti Treewidth.” 2012. Web. 30 Nov 2020.

Vancouver:

Kreuzen VJC. Kernelization Rules for Special Treewidth and Spaghetti Treewidth. [Internet] [Masters thesis]. Universiteit Utrecht; 2012. [cited 2020 Nov 30]. Available from: http://dspace.library.uu.nl:8080/handle/1874/253752.

Council of Science Editors:

Kreuzen VJC. Kernelization Rules for Special Treewidth and Spaghetti Treewidth. [Masters Thesis]. Universiteit Utrecht; 2012. Available from: http://dspace.library.uu.nl:8080/handle/1874/253752


Universiteit Utrecht

13. Kloks, A.J.J. Treewidth.

Degree: 1993, Universiteit Utrecht

 This thesis focuses on problems related to treewidth and pathwidth of graphs. Many problems are difficult to solve for graphs in general. The treewidth of… (more)

Subjects/Keywords: Treewidth; pathwidth; graphs; algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Kloks, A. J. J. (1993). Treewidth. (Doctoral Dissertation). Universiteit Utrecht. Retrieved from http://dspace.library.uu.nl:8080/handle/1874/330864

Chicago Manual of Style (16th Edition):

Kloks, A J J. “Treewidth.” 1993. Doctoral Dissertation, Universiteit Utrecht. Accessed November 30, 2020. http://dspace.library.uu.nl:8080/handle/1874/330864.

MLA Handbook (7th Edition):

Kloks, A J J. “Treewidth.” 1993. Web. 30 Nov 2020.

Vancouver:

Kloks AJJ. Treewidth. [Internet] [Doctoral dissertation]. Universiteit Utrecht; 1993. [cited 2020 Nov 30]. Available from: http://dspace.library.uu.nl:8080/handle/1874/330864.

Council of Science Editors:

Kloks AJJ. Treewidth. [Doctoral Dissertation]. Universiteit Utrecht; 1993. Available from: http://dspace.library.uu.nl:8080/handle/1874/330864

.