Theses on a related topic (having the same keywords):
line segments, tree-depth, l-shapes, vertex cover, low tree-depthKeywords ordered alphabetically | Keywords ordered by occurrence rate
1.
Ganian, Robert
Faculty: Faculty of Informatics
Year: 2012, studies completed, degree conferred: Ph.D.
Programme/field: Informatics (4-years) / Informatics
Doctoral thesis defence: Parameterized Algorithms on Width Parameters of Graphs | Theses on a related topic
Faculty: Faculty of Informatics
Year: 2012, studies completed, degree conferred: Ph.D.
Programme/field: Informatics (4-years) / Informatics
Doctoral thesis defence: Parameterized Algorithms on Width Parameters of Graphs | Theses on a related topic
2.
Pekárková, Kristýna
Faculty: Faculty of Informatics
Year: 2021, studies completed, degree conferred: Mgr.
Programme/field: Theoretical computer science / Principles of programming languages
Master's thesis defence: Matroid Based Approach to Matrix Sparsification | Theses on a related topic
Faculty: Faculty of Informatics
Year: 2021, studies completed, degree conferred: Mgr.
Programme/field: Theoretical computer science / Principles of programming languages
Master's thesis defence: Matroid Based Approach to Matrix Sparsification | Theses on a related topic
3.
Pekárková, Kristýna
Faculty: Faculty of Informatics
Year: 2023, studies completed, degree conferred: Mgr.
Programme/field: Theoretical computer science / Theoretical computer science
Master's thesis defence: Matroid Algorithms and Their Applications in Optimization | Theses on a related topic
Faculty: Faculty of Informatics
Year: 2023, studies completed, degree conferred: Mgr.
Programme/field: Theoretical computer science / Theoretical computer science
Master's thesis defence: Matroid Algorithms and Their Applications in Optimization | Theses on a related topic