| Νοέμβριος 2008 |
| 2008-11-28 |
I. Valls (Finding Small Subgraphs of Given Minimum Degree) |
| 2008-11-14 |
S. Saurabh (Exact Algorithms for Counting Subgraphs via Homomorphisms) |
| Οκτώβριος 2008 |
| 2008-10-31 |
E. Tsigaridas (Real solving polynomials and continued fractions: algorithms and complexity) |
| 2008-10-10 |
L. Stacho (Closure for the Property of Having a Hamiltonian Prism) |
| 2008-10-01 |
MSc defense of A. Petsi |
| Σεπτέμβριος 2008 |
| 2008-09-01 |
MSc defense of Ιωάννη Γιαννακόπουλου |
| 2008-09-01 |
MSc defense of D. Kostopoulos |
| Ιούλιος 2008 |
| 2008-07-15 |
graduation ceremony |
| 2008-07-01 |
MSc defense of Ρίζου Σκλήνου |
| 2008-07-01 |
MSc defense of Γρηγορίου Γαλιατσάτου |
| Ιούνιος 2008 |
| 2008-06-13 |
Α. Κεχρής (Classification problems in ergodic theory: A descriptive set-theoretic point of view) |
| 2008-06-06 |
Κ. Γεωργίου (Vertex Cover Resists SDPs Tightened by Local Hypermetric Inequalities) |
| 2008-06-01 |
MSc defense of Δημητρίου Δούδη |
| Μάιος 2008 |
| 2008-05-30 |
M. Kaminski (Coloring graphs with no long induced paths) |
| 2008-05-23 |
P. Peppas (Conflicts between Relevance and Iteration in Belief Revision) |
| 2008-05-16 |
N. Foo (Experience and trust: a systems-theoretic approach) |
| 2008-05-09 |
Α. Βενέτη (A logical foundation for the intersection and union type assignment system: Towards an intersection and union logic) |
| 2008-05-01 |
MSc defense of K. Papanikolaou |
| Απρίλιος 2008 |
| 2008-04-18 |
E. Kranakis (Locality sensitive topology control in ad hoc networks) |
| 2008-04-11 |
C. Kornaros (Weak forms of the principle of regularity) |
| 2008-04-04 |
Κ. Δημητρακόπουλος (Ramsey's theorem and the incompleteness of arithmetic II) |
| Μάρτιος 2008 |
| 2008-03-28 |
Κ. Δημητρακόπουλος (Ramsey's theorem and the incompleteness of arithmetic I) |
| 2008-03-21 |
Π. Ελευθερίου (Definable groups in linear d-minimal structures) |
| 2008-03-01 |
MSc defense of G. Zois |
| 2008-03-01 |
MSc defense of Αθανάσιου Κουτσώνα |
| Ιανουάριος 2008 |
| 2008-01-18 |
M. Serna (Problems on non co-operative games: complexity versus succinctness) |