Vicky Papadopoulou Lesta
According to our database1, Vicky Papadopoulou Lesta authored at least 33 papers between 2000 and 2019.
Legend:Book In proceedings Article PhD thesis Other
Modeling Probabilistic Flooding in VANETs for Optimal Rebroadcast Probabilities.
IEEE Trans. Intelligent Transportation Systems, 2019
A Decentralized Approach for Self-Coexistence Among Heterogeneous Networks in TVWS.
IEEE Trans. Vehicular Technology, 2018
Radiocoloring in Planar Graphs.
Encyclopedia of Algorithms, 2016
Analysis of probabilistic flooding in VANETs for optimal rebroadcast probabilities.
Proceedings of the 2016 IEEE/IFIP Network Operations and Management Symposium, 2016
Speed Adaptive Probabilistic Flooding for Vehicular Ad Hoc Networks.
IEEE Trans. Vehicular Technology, 2015
On Radiocoloring Hierarchically Specified Planar Graphs: PSPACE -completeness and Approximations.
Proceedings of the Algorithms, Probability, Networks, and Games, 2015
Cooperation among access points for enhanced quality of service in dense wireless environments.
Proceedings of the Proceeding of IEEE International Symposium on a World of Wireless, 2014
How many attackers can selfish defenders catch?
Discrete Applied Mathematics, 2013
Driver Behaviour Analysis through Simulation.
Proceedings of the IEEE International Conference on Systems, 2013
Adaptive information hovering in VANETs: Robustness and enhancements.
Proceedings of the International Conference on Connected Vehicles and Expo, 2013
Minimizing interference in unmanaged environments of densely deployed wireless access points using a graphical game model.
Proceedings of the 11th Annual Mediterranean Ad Hoc Networking Workshop, 2012
Project Risk Management Using Event Calculus(S).
Proceedings of the 23rd International Conference on Software Engineering & Knowledge Engineering (SEKE'2011), 2011
Cooperative user-network interactions in next generation communication networks.
Computer Networks, 2010
Ultra High Speed SHA-256 Hashing Cryptographic Module for IPSec Hardware/Software Codesign.
Proceedings of the SECRYPT 2010, 2010
A Robotic System for Home Security Enhancement.
Proceedings of the Aging Friendly Technology for Health and Independence, 2010
Network Security Validation Using Game Theory.
Proceedings of the On the Move to Meaningful Internet Systems: OTM 2009 Workshops, 2009
Internationalising the Management Information Systems Module.
Proceedings of the CSEDU 2009 - Proceedings of the First International Conference on Computer Supported Education, Lisboa, Portugal, March 23-26, 2009, 2009
Radiocoloring in Planar Graphs.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008
A graph-theoretic network security game.
A Network Game with Attackers and a Defender.
Voronoi Games on Cycle Graphs.
Proceedings of the Mathematical Foundations of Computer Science 2008, 2008
Radiocolorings in periodic planar graphs: PSPACE-completeness and efficient approximations for the optimal range of frequencies.
J. Discrete Algorithms, 2006
A Game on a Distributed Network.
Bulletin of the EATCS, 2006
The Price of Defense.
Proceedings of the Mathematical Foundations of Computer Science 2006, 2006
The Power of the Defender.
Proceedings of the 26th International Conference on Distributed Computing Systems Workshops (ICDCS 2006 Workshops), 2006
The Price of Defense and Fractional Matchings.
Proceedings of the Distributed Computing and Networking, 8th International Conference, 2006
Radiocoloring in planar graphs: Complexity and approximations.
Theor. Comput. Sci., 2005
Generating and Radiocoloring Families of Perfect Graphs.
Proceedings of the Experimental and Efficient Algorithms, 4th InternationalWorkshop, 2005
Network Game with Attacker and Protector Entities.
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005
On Radiocoloring Hierarchically Specified Planar Graphs: PSPACE-Completeness and Approximations.
Proceedings of the Mathematical Foundations of Computer Science 2002, 2002
Hardness Results and Efficient Appromixations for Frequency Assignment Problems and the Radio Coloring Problem.
Bulletin of the EATCS, 2001
Hardness Results and Efficient Approximations for Frequency Assignment Problems: Radio Labelling and Radio Coloring.
Computers and Artificial Intelligence, 2001
NP-Completeness Results and Efficient Approximations for Radiocoloring in Planar Graphs.
Proceedings of the Mathematical Foundations of Computer Science 2000, 2000