Ass. Prof. Vicky Papadopoulou-Lesta (VPL) (EUC)

Ass. Prof. Vicky Papadopoulou-Lesta (VPL) (EUC)

Project Coordinator
European University Cyprus
(00) +357 22713046

Ass. Prof. Vicky Papadopoulou-Lesta (VPL) (EUC) is the Project Coordinator, leading the WP1 and WP 3 and actively participating in all WPs of the project.  VPL is currently an Assistant Professor in the Department of Computer Science and Engineering at European University Cyprus. Her research interests span the Theory of Algorithms and Complexity, with focus on Graph Theory, Computational Complexity, Algorithms (Approximation, Combinatorial, and Parallel) and Game Theory.

 

Her research work has been published in several journals of worldwide recognition in the field of Theoretical Computer Science, such as Algorithmica, Theoretical Computer Science and Computer Networks journals and top conference proceedings and has been supported by several Research and Development projects funded by the European Union and Cyprus.

 

She served as Chair of the Organizing Committee and co-editor of the Spring LNCS proceedings of the 2nd International Symposium on Algorithmic Game Theory and also as Program Committee member in one of the most prestigious international conferences in Computer Science, the 42nd International Colloquium on Automata, Languages, and Programming (ICALP 2015).  VPL is a founding member of the AHPC (Astrophysics and High Performance Computing) research group of European University Cyprus.

 

Almost all of her research results and activities utilize Graph Theory in order to model real problems of a wide range of applications in many domains, such as resource allocation, network security and network monitoring and control. The graph theoretical modeling is usually utilized in a multi-level approach together with graph theoretic tools, combinatorial, computation complexity and algorithm design tools for investigating the structural properties of the problems addressed, characterize the hardness the problem solving and finally providing algorithmic solutions for it, of guaranteed performance (through approximation algorithms).

 

Her research interests span the Theory of Algorithms and Complexity, with focus on Computational Complexity, Graph Theory, Algorithms, Approximation and Combinatorial Algorithms, Parallel Algorithms, Algorithmic Game Theory, Distributed Systems. Applications of her works include Facility Allocation problems, Topological etwork Control, Frequency Assignment, Wireless (Sensor) Networks: Communication, control and others, and Mobile Computing.

 

Her scientific results have been published in several journals of worldwide recognition, such as Algorithmica, Theoretical Computer Science and Computer Networks journals. She also published her work in numerous well known conference proceedings. Her research has been supported by several Research and Development projects funded by the European Union and the Cypriot state. She served as Chair of the Organizing Committee of the 2nd International Symposium on Algorithmic Game Theory that took place in Paphos in October 2009 and she was co-editor of the corresponding Spring LNCS volume. She also served as Scientific Program Committee in one of the most prestigious worldwide international conference in Computer Science, the 42nd International Colloquium on Automata, Languages, and Programming (ICALP 2015). She is a regular reviewer in prestigious journals of Theoretical Computer Science, such as the Theoretical Computer Science journal.

 


Education:

  • PhD degree, Department of Computer Engineering and Informatics, University of Patras, Greece (2003)
  • Master degree, Department of Computer Engineering and Informatics, University of Patras, Greece (2001)
  • Bachelor Diploma Department of Computer Engineering and Informatics, University of Patras, Greece (1998).

Publications

Refereed Book Chapters or Articles in Encyclopaedias

  1. J. Antoniou, V. G. Papadopoulou, V. Vassiliou, A. Pitsillides, “Network Selection and Handoff in Wireless Networks: a Game Theoretical Approach”, Game Theory for Wireless Communications and Networking, Yan Zhang, Mohsen Guizani, Eds., CRC Press, 9781439808894, 2011.
  2. A. Gregoriades and V. Papadopoulou Lesta, “Nonfunctional Requirements Validation Using Nash Equilibria”, Management and Services, ISBN 978-953-7619-X-X, July 2011.
  3. M. Mavronicolas, V. Papadopoulou and P. Spirakis, “Algorithmic Game Theory and Applications”, Chapter 10 in Handbook of Applied Algorithms: Solving Scientific, Engineering, and Practical Problems, A. Nayak and I. Stojmenovic eds., John Wiley and Sons, A. Nayak and I. Stojmenovic eds., John Wiley and Sons, pp 287-316, March 2008.
  4. V. Papadopoulou, “Radiocoloring in Planar Graphs”, Encyclopedia of Algorithms, Ming-Yang Kao eds., Springer, ISBN-10: 0387307702, 2008.

Journals

  1. M. Mavronicolas, B. Monien, V. G. Papadopoulou, “How Many Attackers Can Selfish Defenders Catch?”, Discrete Applied Mathematics, Vol. 161, No. 16-17, pages 2563-2586, November 2013.
  2. J. Antoniou, V. Papadopoulou, V. Vassiliou, A. Pitsillides, “Cooperative User Network Interactions in Next Generation Communication Networks”, Computer Networks, Elsevier, Volume 54, Number 13, pp. 2239-2255, September 2010.
  3. V. Papadopoulou and M. Mavronicolas, “A State-of-the-Art Catalog of Complexity Classes with Problems of Equilibrium Computation”, Bulletin of the European Association for Theoretical Computer Science, September 2009.
  4. M. Mavronicolas, V. G. Papadopoulou, A. Philippou and P. G. Spirakis, “A Graph-Theoretic Network Security Game”International Journal of Autonomous and Adaptive Communications, , Special Issue on “Algorithmic Game Theory”, R. Kannan and C. Busch eds., Vol. 1, No.4 pp. 390 – 410, 2008.
  5. M. Mavronicolas, V. G. Papadopoulou, A. Philippou and P. G. Spirakis, “A Network Game with Attacker and Protector Entities”Algorithmica, Special Issue with selected papers from the 16th Annual International Symposium on Algorithms and Computation (ISAAC 2005), X. Deng and D. Du guest eds, Vol. 51, No. 3, pp. 315-341, July 2008.
  6. D. Fotakis, S. Nikoletseas, V. G. Papadopoulou και P. G. Spirakis, “Radiocolorings in Periodic Planar Graphs: PSPACE-Completeness and Efficient Approximations for the Optimal Range of Frequencies“, Journal of Discrete Algorithms, Vol. 4, No. 3, pp. 433-454, December 2006.
  7. V. G. Papadopoulou, “A Game on a Distributed Network”Bulletin of the EATCS, No 89, pp. 97–116, June 2006.
  8. D. Fotakis, S. Nikoletseas, V. G. Papadopoulou, P. G. Spirakis, “Radiocoloring in Planar Graphs: Complexity and Approximations”, Theoretical Computer Science, Elsevier, Volume 340, pp. 514-538, 2005.
  9. D. Fotakis, S. Nikoletseas, V. G. Papadopoulou and P. G. Spirakis, “Hardness Results and Efficient Approximations for Frequency Assignment Problems: Radio Labelling and Radio Coloring”Journal of Computers and Informatics, Vol. 20, No. 2, pp. 121-180, 2001.
  10. D. Fotakis, S. Nikoletseas, V. G. Papadopoulou and P. G. Spirakis, “Hardness Results and Efficient Approximations for Frequency Assignment Problems and the Radio Coloring Problem”, Bulletin of the EATCS, Vol. 75, pp. 152-181, October 2001.

Conference Publications

  1. J. Antoniou, V. Papadopoulou Lesta, L. Libman and A. Pitsillides, ‘Minimizing Interference in Unmanaged Environments of Densely Deployed Wireless Access Points Using a Graphical Game Model’, Proceedings of the 11th IEEE Annual Mediterranean Ad Hoc Networking Workshop (Med-Hoc-Net 2012), pages 55-82, June 2012.
  2. P. Petrides, A. Gregoriades and V. Papadopoulou Lesta, “Project Risk Management Using Event Calculus”, The 23rd International Conference on Software Engineering and Knowledge Engineering, Miami, USA, July 7 – July 9, 2011, pp 335-338.
  3. P. Petrides, A. Gregoriades and V. Papadopoulou Lesta, “Software Project Change Management Using Event Calculus”2011 International Conference on Software Engineering Research and Practice, Las Vegas, USA, July 18-21, 2011.
  4. A. Gregoriades, K. Mouskos and V. Papadopoulou Lesta, “A Computational Approach to Traffic Safety Analysis”, International Conference on Computational Intelligence and Industrial Application (PACIIA 2010), Wuhan, China, November 2010.
  5. A. Gregoriades, S. Obadan, H. Michail, V. Papadopoulou, D. Michael, “A Robotic System for Home Security Enhancement”, Proceedings of the 8th International Conference on Smart Homes and Health Telematics (ICOST), Lecture Notes in Computer Science, Vol. 6159, Springer, pp. 43-52, 2010.
  6. V. Papadopoulou, A. Gregoriades, Nonfunctional Requirements Validation-A Game Theoretic Approach, CD-ROM Proceedings of the International Conference on Engineering Management and Service Sciences (EMS 2009), September 2009.
  7. V. Papadopoulou, A. Gregoriades, Network Security Validation Using Game Theory, Proceedings of the Workshop on Information System in Distributed Environment (ISDE 2009), OnTheMove Federated Conferences & Workshops, Lecture Notes in Computer Science, 5872, Springer Verlag, pp. 259-266, November 2009.
  8. A. Gregoriades, M. Pampaka and V. Papadopoulou, Internationalising The Management Information Systems Module, Proceedings of the First International Conference on Computer Supported Education (CSEDU 2009), Vol. 2, pp. 21-26, INSTICC Press, March 2009.
  9. M. Mavronicolas, B. Monien and V. Papadopoulou, F. Schoppmann, “Voronoi Games on Cycle Graphs”, Proceedings of the 33rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2008), pp. 503-514, Vol. 5162, Lecture Notes in Computer Science, Springer, August 2008.
  10. M. Mavronicolas, B. Monien and V. G. Papadopoulou, “How Many Attackers Can Selfish Defenders Catch? ” CD-ROM Proceedings of the 41st Hawaii International Conference on System Sciences (HICSS41), January 2008.
  11. M. Mavronicolas, V. G. Papadopoulou, G. Persiano, A. Philippou and P. G. Spirakis, “The Price of Defense and Fractional Matchings“, Proceedings of the 8th International Conference on Distributed Computing and Networking (ICDCN 2006), pp. 115-126, Vol. 4308, Lecture Notes in Computer Science, Springer, December 2006.
  12. M. Mavronicolas, V. G. Papadopoulou, A. Philippou and P. G. Spirakis, “A Network Game with Attackers and a Defender: A Survey”, CD ROM Proceedings of the 2nd European Conference on Complex Systems 2006 (ECCS 2006), September 2006.
  13. M. Mavronicolas, L. Michael, V. G. Papadopoulou, A. Philippou and P. G. Spirakis, “The Price of Defense”, Proceedings of the 31st International Symposium on Mathematical Foundations of Computer Science (MFCS 2006), pp. 717-728, Vol. 4162, Lecture Notes in Computer Science, Springer, August 2006.
  14. M. Gelastou, M. Mavronicolas, V. G. Papadopoulou, A. Philippou and P. G. Spirakis, “The Power of the Defender”, CD-ROM Proceedings of the 2nd International Workshop on Incentive-Based Computing (IBC 2006), in conjunction with the 26th IEEE International Conference on Distributed Computing Systems Workshops (ICDCSW’06), pp. 37, July 2006.
  15. M. Mavronicolas, V. G. Papadopoulou, A. Philippou and P. G. Spirakis, “A Network Game with Attacker and Protector Entities“, Proceedings of the 16th Annual International Symposium on Algorithms and Computation (ISAAC 2005), pp. 288-297, Vol. 3827, Lecture Notes in Computer Science, Springer-Verlag, December 2005.
  16. M. Mavronicolas, V. G. Papadopoulou, A. Philippou and P. G. Spirakis, “A Graph-Theoretic Network Security Game“, Proceedings of the First Workshop on Internet and Network Economics (WINE 2005), pp. 969-978, Vol. 3828, Lecture Notes in Computer Science, Springer-Verlag, December 2005.
  17. M. Andreou, V. G. Papadopoulou, P. G. Spirakis, B. Theodorides and A. Xeros, “Generating and Radiocoloring Families of Perfect Graphs”,Proceedings of the 4th International Workshop on Efficient and Experimental Algorithms (WEA 2005), Vol. 3503, pp. 302-314, Lecture Notes in Computer Science, Springer-Verlag, May 2005.
  18. D. Fotakis, S. Nikoletseas, V. G. Papadopoulou and P. G. Spιrakis, “Radiocolorings in Periodic Planar Graphs: PSPACE-Completeness and Efficient Approximations for the Optimal Number of Frequencies”, Proceedings of the 1st International Conference “From Scientific Computing to Computational Engineering”, Mini-Symposium Computational Mathematics & Applications, September 2004.
  19. S. Nikoletseas, V. G. Papadopoulou and P. G. Spirakis, “Radiocoloring Graphs via the Probabilistic Method“, Proceedings of the 4th Panhellenic Logic Symposium, 2003.
  20. M. Andreou, D. Fotakis, S. Nikoletseas, V. G. Papadopoulou and P. G. Spirakis, “On Radiocoloring Hierarchically Specified Planar Graphs: PSPACE-Completeness and Approximations“, Proceedings of the 27th International Symposium of Mathematical Foundations of Computer Science (MFCS 2002), Vol. 2420, pp. 81-92, Lecture Notes in Computer Science, Springer-Verlag, August 2002.
  21. D. Fotakis, S. Nikoletseas, V. G. Papadopoulou and P. G. Spirakis, “Radiocolorings in Periodic Planar Graphs: PSPACE-Completeness and Efficient Approximations for the Optimal Range of Frequencies“, Proceedings of the 28th International Workshop on Graph Theoretic Concepts in Computer Science (WG 2002), Vol. 2573, pp. 223-234, Lecture Notes in Computer Science, Springer-Verlag, June 2002.
  22. D. Fotakis, S. Nikoletseas, V. G. Papadopoulou and P. G. Spirakis, “NP-completeness Results and Efficient Approximations for Radiocoloring in Planar Graphs” , Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science (MFCS 2000), pp. 363-372, Lecture Notes in Computer Science, Springer-Verlag, August 2000.
  23. V. G. Papadopoulou, P. Spirakis, “Algorithmic Issues in Mobile Environments with Fixed Hosts“, Proceedings of the 6h Panhellenic Conference on Informatics 1999.

Technical Reports

  1. M. I. Andreou M. Karpinski, V. G. Papadopoulou and P. G. Spirakis. Radiocoloring Succinct Graphs and its relation to MIS on squares of ordinary Graphs. Project CRESCCO (IST-2001-33135) Technical Report, 2004.