Department of Information & Communication Systems Engineering
University of the Aegean

Department of Information
& Communication Systems Engineering

Information & Communication Systems Security
Information Systems
Artificial Intelligence
Computer & Communication Systems
Geometry, Dynamical Systems & Cosmology
Αλγόριθμοι και Πολυπλοκότητα

Title: Αλγόριθμοι και Πολυπλοκότητα
Lesson Code: 321-4201
Semester: 4
Theory Hours: 4
Lab Hours: 2
Faculty: Kaporis Alexios
External Website
Content outline

Combinatorial optimization problems. Divide-conquer algorithms. FFT. Dynamic programming. Greedy algorithms. Graph algorithms. Minimal spanning trees & algorithms. Maximum flow. Randomized algorithms. Approximation algorithms.

Learning outcomes

Knowledge of the most important algorithms of the theory of computation and experimental validation of their performance.


Introduction to Programming, Discrete Mathematics.

Basic Textbooks

1. Algorithm Design, Jon Kleinberg, Eva Tardos.
2. Algorithms, Sanjou Dasgupta, Christos Papadimitriou, Umesh Vazirani.
3. Introduction to Algorithms by Cormen , Leiserson, Rivest and Stein.

Additional References

Algorithmica, Springer

Learning Activities and Teaching Methods

Lectures with slides. Use of optimization software as maple. The lectures are written in videos to help the understanding. Experimental validation of all algorithms in the lab areas.

Assessment/Grading Methods

Theoretical and experimental (with use of C, C++) training and exercises in weekly basis. Final exams.

Language of Instruction
Greek, English (for Erasmus students)
Μode of delivery


  • Σημειώσεις μαθήματος

  • Home | Contact

    University Of The Aegean

    Department of Information & & Communications Systems Engineering

    © Copyright ICSD :: 2008 - 2017