Dimitrios Chatzidimitriou: student profile
msc
| Enrolled in: | March 2013 |
|---|---|
| Graduated on: | Wednesday, 02 Nov 2016 |
Thesis
Title: An Alternative Proof for the NP-completeness of the Grid Subgraph Problem.
Defended: Tuesday, 04 Oct 2016.
Course participations
- Λ1. Mathematical logic (2012-2013, spring semester)
- Μ6. Set theory (2012-2013, spring semester)
- Λ13Ο. Approximation algorithms and mechanisms design (2012-2013, spring semester)
- Λ07Ν. Parameterized complexity and algorithms (2012-2013, spring semester)
- Π03Ε. Network algorithms and complexity (2012-2013, spring semester)
- Π05Β. Computation models and complexity (2012-2013, spring semester)
- Λ4. Algorithms and complexity II (2013-2014, fall semester)
- Λ2. Computability (2013-2014, fall semester)
- Λ1. Mathematical logic (2013-2014, spring semester)
- Μ6. Set theory (2013-2014, spring semester)
- Π03Ξ. Approximation algorithms (2013-2014, spring semester)
- Π09Γ. Advanced topics in algorithms and complexity (2013-2014, spring semester)
- Π05Β. Computation models and complexity (2013-2014, spring semester)
- Λ4. Algorithms and complexity II (2014-2015, fall semester)
- Λ2. Computability (2014-2015, fall semester)
- Λ1. Mathematical logic (2014-2015, spring semester)
- Μ6. Set theory (2014-2015, spring semester)
- Π12. Algorithmic Issues of Social Networks (2014-2015, spring semester)
- Λ2. Computability (2015-2016, fall semester)
- Μ6. Set theory (2015-2016, fall semester)
- Λ5. Research methodology (2015-2016, spring semester)
- ΛΔΕ. Msc thesis (2015-2016, spring semester)
Final grades
| Course | Mark | Credits | |
|---|---|---|---|
| Λ1. | mathematical logic | 8.0 | 4 |
| Λ2. | computability | 10.0 | 4 |
| Λ3. | algorithms and complexity I | 8.0 | 4 |
| Λ4. | algorithms and complexity II | 9.0 | 4 |
| Μ6. | set theory | 6.0 | 4 |
| Λ13Ο. | approximation algorithms and mechanisms design | 10.0 | 4 |
| Π09Γ. | advanced topics in algorithms and complexity | 8.0 | 4 |
| Λ07Ν. | parameterized complexity and algorithms | 10.0 | 4 |
| Π03Ε. | network algorithms and complexity | 10.0 | 4 |
| Π03Ξ. | approximation algorithms | 9.0 | 4 |
| Π05Β. | computation models and complexity | 7.0 | 4 |
| Λ05Δ. | Graph Theory | 10.0 | 4 |
| Λ12Β. | advanced topics in graph theory | 10.0 | 2 |
| Λ13Ν. | matroid theory | 10.0 | 2 |
| GPA: 8.85 | |||