Thesis title | Year of announcement | Year of defence | Thesis type | Thesis discipline | Supervisor | Author | Announced | Assigned | Department | Faculty | |
Aproximační algoritmy pro kombinatorické problémy | 2008/2009 | dissertation | 4I4 | doc. Mgr. Petr Kolman, Ph.D. | hidden | 13.06.2008 | 10.09.2008 | Katedra aplikované matematiky (32-KAM) | MFF | ||
Clustering techniques for ads monitoring | 2006/2007 | 2006/2007 | diploma thesis | IDMO | doc. Mgr. Petr Kolman, Ph.D. | hidden | 28.03.2007 | 10.07.2007 | Katedra aplikované matematiky (32-KAM) | MFF | |
Flows and cuts with restriction | 2011/2012 | 2011/2012 | diploma thesis | IDMA | doc. Mgr. Petr Kolman, Ph.D. | hidden | 07.11.2011 | 09.11.2011 | Katedra aplikované matematiky (32-KAM) | MFF | |
Algorithms for L-Bounded Flows | 2015/2016 | 2015/2016 | diploma thesis | IDMA | doc. Mgr. Petr Kolman, Ph.D. | hidden | 26.04.2016 | 26.04.2016 | Katedra aplikované matematiky (32-KAM) | MFF | |
Length bounded cuts in graphs | 2018/2019 | 2018/2019 | diploma thesis | doc. Mgr. Petr Kolman, Ph.D. | hidden | 26.03.2019 | 26.03.2019 | Katedra aplikované matematiky (32-KAM) | MFF | ||
Shortest paths when searching for travel connections | 2005/2006 | 2006/2007 | diploma thesis | ITI | doc. Mgr. Petr Kolman, Ph.D. | hidden | 06.10.2005 | 05.01.2006 | Katedra aplikované matematiky (32-KAM) | MFF | |
Flows Along Paths of Bounded Length | 2017/2018 | 2017/2018 | Bachelor's thesis | IOI | doc. Mgr. Petr Kolman, Ph.D. | hidden | 05.02.2018 | 05.02.2018 | Katedra aplikované matematiky (32-KAM) | MFF | |
Connected Cuts | 2024/2025 | diploma thesis | IDMP | doc. Mgr. Petr Kolman, Ph.D. | hidden | 21.10.2024 | 21.10.2024 | Katedra aplikované matematiky (32-KAM) | MFF | ||
Algoritmy pro kombinatorické problémy | 2006/2007 | diploma thesis | I4 | doc. Mgr. Petr Kolman, Ph.D. | 02.05.2006 | Ne | Katedra aplikované matematiky (32-KAM) | MFF | |||
Approximation algorithms for cut problems in graphs | 2018/2019 | dissertation | P4I4 | doc. Mgr. Petr Kolman, Ph.D. | hidden | 25.04.2019 | 30.09.2019 | Katedra aplikované matematiky (32-KAM) | MFF | ||
Optimization in graphs with bounded treewidth | 2010/2011 | 2010/2011 | Bachelor's thesis | doc. Mgr. Petr Kolman, Ph.D. | hidden | 24.11.2010 | 22.12.2010 | Katedra aplikované matematiky (32-KAM) | MFF | ||
Hard problems on Neighborhood Diversity | 2012/2013 | 2012/2013 | diploma thesis | IDMA | doc. Mgr. Petr Kolman, Ph.D. | hidden | 20.03.2013 | 21.03.2013 | Katedra aplikované matematiky (32-KAM) | MFF | |
Fast Algorithms for Attention Mechanism | 2023/2024 | 2023/2024 | Bachelor's thesis | doc. Mgr. Petr Kolman, Ph.D. | hidden | 03.05.2024 | 03.05.2024 | Katedra aplikované matematiky (32-KAM) | MFF | ||
Half-automatic recognition of text structure | 2008/2009 | 2009/2010 | diploma thesis | doc. Mgr. Petr Kolman, Ph.D. | hidden | 24.09.2008 | 29.09.2008 | Katedra aplikované matematiky (32-KAM) | MFF | ||
Treewidth, Extended Formulations of CSP and MSO Polytopes, and their Algorithmic Applications | 2013/2014 | 2016/2017 | dissertation | 4I4 | doc. Mgr. Petr Kolman, Ph.D. | Mgr. Martin Koutecký, Ph.D. | 25.04.2013 | 27.09.2013 | Katedra aplikované matematiky (32-KAM) | MFF | |
Heuristics for Length Bounded Cuts | 2022/2023 | 2022/2023 | diploma thesis | IDMP | doc. Mgr. Petr Kolman, Ph.D. | hidden | 30.03.2023 | 30.03.2023 | Katedra aplikované matematiky (32-KAM) | MFF | |
Algorithms for cuts in graphs | 2011/2012 | 2013/2014 | diploma thesis | IDMA | doc. Mgr. Petr Kolman, Ph.D. | hidden | 04.01.2012 | 04.01.2012 | Katedra aplikované matematiky (32-KAM) | MFF |
Results 1-17 of 17 1