( en | de | ru )

 

Disambiguation of "Papadopoulou, Vicky G."

Author of the publication

copydeleteadd this publication to your clipboard
The Price of Defense and Fractional Matchings.

, , , , and . ICDCN, volume 4308 of Lecture Notes in Computer Science, page 115-126. Springer, (2006)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Simira Papadopoulou

Konstadia Papadopoulou

Vicky Fasen

Vicky Fachinger

Vicky Hermet

 

Other publications of authors with the same name

How Many Attackers Can Selfish Defenders Catch?, , and . HICSS, page 470. IEEE Computer Society, (2008)Internationalising the Management Information Systems Module., , and . CSEDU (2), page 21-26. INSTICC Press, (2009)978-989-8111-82-1.Ultra High Speed SHA-256 Hashing Cryptographic Module for IPSec Hardware/Software Codesign., , , , , and . SECRYPT, page 309-313. SciTePress, (2010)Hardness Results and Efficient Appromixations for Frequency Assignment Problems and the Radio Coloring Problem., , , and . Bull. EATCS, (2001)Generating and Radiocoloring Families of Perfect Graphs., , , , and . WEA, volume 3503 of Lecture Notes in Computer Science, page 302-314. Springer, (2005)On Radiocoloring Hierarchically Specified Planar Graphs: PSPACE-Completeness and Approximations., , , , and . MFCS, volume 2420 of Lecture Notes in Computer Science, page 81-92. Springer, (2002)Voronoi Games on Cycle Graphs., , , and . MFCS, volume 5162 of Lecture Notes in Computer Science, page 503-514. Springer, (2008)Network Security Validation Using Game Theory., and . OTM Workshops, volume 5872 of Lecture Notes in Computer Science, page 259-266. Springer, (2009)NP-Completeness Results and Efficient Approximations for Radiocoloring in Planar Graphs., , , and . MFCS, volume 1893 of Lecture Notes in Computer Science, page 363-372. Springer, (2000)Radiocolorings in periodic planar graphs: PSPACE-completeness and efficient approximations for the optimal range of frequencies., , , and . J. Discrete Algorithms, 4 (3): 433-454 (2006)