EUC Colloquium on Mathematics, Computer Science and Engineering

The EUC Colloquium on Mathematics, Computer Science and Engineering  was established in November 2011 and is organized by the Department of Computer Science of the European University Cyprus. The purpose of Colloquium is to provide a forum to our colleagues, our current and potentially future collaborators as well as known scientists to meet, present research findings, and discuss developments on a variety of topics spanning all important fields of Computer Science and Engineering. It also aims to provide an environment in which graduate students can gain experience in presenting their work, and benefit from contact with established researchers. The scope of the colloquium includes all aspects of Computer science, including Networks, Software Engineering, Databases, Algorithms, Theoretical Computer Science, Human Computer Interaction, High Performance Computing, and Operational Research, as well as aspects of Mathematics and Engineering.

If you are interested in giving at talk at the Colloquium, please contact the coordinator Dr. Vicky Papadopoulou by filling out the Colloquium Form.

Next Talk


Dr. Christos Dimopoulos


Scheduling Decision Support Systems in small-sized SME environments: the i-DESME framework







Speaker Mr. George Tziazas
Title The Art Gallery Problem
Date 22/05/2015
Time 13:00-13:30
Room 309


The art gallery problem or museum problem is the problem of guarding an art gallery with the minimum number of guards who together can observe the whole gallery. The talk is an overview on current modellings and algorithms for the art gallery problem and its relations to known fundamental problems in Computer Science.

Speaker Dr Charalambos Evripidou
Title Lehmer's Problem
Date 21/05/2015
Time 15:00
Room 305


For a polynomial f(x) ∈ Z[x] we denote by M(f) the product of the absolute values of those roots of f that lie outside the unit circle and we call that number the Mahler measure of f. We can verify that the Mahler measure of the polynomial L(x) = x10 + x9 - x7 - x6 - x5 - x4 - x3 + x + 1 is M(L) = 1:17628 …. The subject of our talk will be about the question "Are there any polynomials with 1 < M(f) < M(L)?" known as Lehmer's problem and its relation to Coxeter polynomials.

Speaker Vasiliki Paraskeva
Title Spectrally tuned solar cells for improved energy harvesting
Date 06/05/15
Time 12:00-13:00
Room 224


Photovoltaic cells that incorporate several active junctions in electrical series are exhibiting ever higher laboratory efficiencies. However, due to the presence of only two terminals in multi-junction PV cells, Spectral Response (SR) or External Quantum Efficiency (EQE) measurements on these cells present additional challenges compared to single-junction devices. Furthermore, optical interactions between such junctions are more likely to occur due to their series connection.

Jan 18
1 2 3 4 5 6 7
8 9 10 11 12 13 14
15 16 17 18 19 20 21
22 23 24 25 26 27 28
29 30 31 1 2 3 4


Go to top