My research interests | My Publications | Experiments | Course | Projects



My name is Maria Andreou. I am a graduate student at the Department of Computer Engineering and Informatics of the University of Patras and member of the Research Unit 1 of the Computer Technology Institute (CTI).
My supervisor is Mr. Paul G. Spirakis and the subject of me thesis is
"Special Algorithmic Issues on Graphs"

email:mandreou@ceid.upatras.gr

Tel: ++30 2610 960325

  1. Design and analysis of algorithms with emphasis on
    • approximation algorithms
    • randomized algorithms
    • online computations and
    • parallel algorithms
    for problems come from the graph theory. More specific I am especially interested for the following classes of graphs:
    • Planar graphs
    • Random graphs and
    • Perfect graphs like permutation, chordal, split and interval graphs.
  2. Graph Colouring Problem
  3. Data structures for maintenance future events in a discrete event simulation system
  4. Optimisation methods



  1. JOURNALS
    • M.I.Andreou and S.D.Nikolopoulos: "NC Colouring Algorithms for Permutation Graphs", Nordic Journal of Computing Vol. 6 (4) pp. 422, 445, 1999.
  2. CONFERENCES
    • Maria Andreou and Stavros D. Nikolopoulos, "Efficient EREW-PRAM Parallel Colouring of Permutation Graphs", 6th Hellenic Conference on Informatics, pp. 563-577, 1997.
    • M.I.Andreou and S.D.Nikolopoulos: "A Data Structure for Maintaining Future Events in a Discrete-Event Simulation System" in Proc. of the 2nd IMACS International Conference on Circuits, Systems and Computers, 1998.
    • M.I.Andreou and P.G.Spirakis: "Experimental Analysis of Approximation Algorithms, for the Maximum Independent Set Problem on Planar Graphs", in Proc. of Hellenic Conference on Informatics, 2001
    • M.Andreou, D.Fotakis, V.Papadopoulou, S.Nikoletseas and P.Spirakis: "The radiocoloring problem for hierarchical planar graphs: Hardness and efficient approximations" in Proc. of Conference of Mathematical Foundations in Computer Science 2002.
    • M.Andreou, S.Nikoletseas and P.Spirakis: "Algorithms and Experiments on Colouring squares of Planar Graphs" To appear in WEA 2003. ps, gz

  3. Technical Reports
    • M.I.Andreou and P.G.Spirakis: "Experimental Colouring of Random and Semi-Random k-colourable graphs" TR2000/12/01 CTI Greece.
    • Maria Andreou and Paul G. Spirakis: "Colouring Random and Semi-random K-colourable Graphs", TR2000/12/02 CTI Greece.
    • Maria Andreou and Paul G. Spirakis: "Efficient Colouring Squares of Planar Graphs" TR2003/03 CTI Greece. ps, gz

  4. Submitted
    • Maria Andreou and Paul G. Spirakis: "Efficient Colouring Squares of Planar Graphs" Submitted to ESA 2003 ps, gz




 

  • The programs that are used for the experiments in my work with mr. Spirakis in EPY 2001:

    "Experimental Analysis of Approximation Algorithms, for the Maximum Independent Set Problem on Planar Graphs" are here.

  • The programs that are used for the experiments in my work with mrs Nikoletsea and Spirakis which is to appear in WEA 2003:

    "Algorithms and Experiments on Colouring squares of Planar Graphs"

    • are here.

    The planar graph instances that are used in our experiments are here.

  • Operating Systems


  • Brite-Euram Project BE96-3046 CE2: Computer Experiments for Concurrent Engineering
  • ALCOM-IT ESPRIT LTR - Project no. 20244, ALCOM
  • EPEAEK Project: Course of study of the department of Computer Engineering and Informatics of the University of Patras.
  • ALCOM-FT ESPRIT LTR
  • CRESCCO