2008 |
18 | EE | Marios Mavronicolas,
Burkhard Monien,
Vicky G. Papadopoulou:
How Many Attackers Can Selfish Defenders Catch?
HICSS 2008: 470 |
17 | EE | Marios Mavronicolas,
Burkhard Monien,
Vicky G. Papadopoulou,
Florian Schoppmann:
Voronoi Games on Cycle Graphs.
MFCS 2008: 503-514 |
16 | EE | Vicky Papadopoulou:
Radiocoloring in Planar Graphs.
Encyclopedia of Algorithms 2008 |
15 | EE | Marios Mavronicolas,
Vicky Papadopoulou,
Anna Philippou,
Paul G. Spirakis:
A Network Game with Attackers and a Defender.
Algorithmica 51(3): 315-341 (2008) |
14 | EE | Marios Mavronicolas,
Burkhard Monien,
Vicky Papadopoulou:
How Many Attackers Can Selfish Defenders Catch?
CoRR abs/0812.4206: (2008) |
2006 |
13 | EE | Marios Mavronicolas,
Vicky G. Papadopoulou,
Giuseppe Persiano,
Anna Philippou,
Paul G. Spirakis:
The Price of Defense and Fractional Matchings.
ICDCN 2006: 115-126 |
12 | EE | Marina Gelastou,
Marios Mavronicolas,
Vicky G. Papadopoulou,
Anna Philippou,
Paul G. Spirakis:
The Power of the Defender.
ICDCS Workshops 2006: 37 |
11 | EE | Marios Mavronicolas,
Loizos Michael,
Vicky G. Papadopoulou,
Anna Philippou,
Paul G. Spirakis:
The Price of Defense.
MFCS 2006: 717-728 |
10 | EE | Dimitris Fotakis,
Sotiris E. Nikoletseas,
Vicky G. Papadopoulou,
Paul G. Spirakis:
Radiocolorings in periodic planar graphs: PSPACE-completeness and efficient approximations for the optimal range of frequencies.
J. Discrete Algorithms 4(3): 433-454 (2006) |
2005 |
9 | EE | Marios Mavronicolas,
Vicky G. Papadopoulou,
Anna Philippou,
Paul G. Spirakis:
Network Game with Attacker and Protector Entities.
ISAAC 2005: 288-297 |
8 | EE | Maria I. Andreou,
Vicky G. Papadopoulou,
Paul G. Spirakis,
B. Theodorides,
A. Xeros:
Generating and Radiocoloring Families of Perfect Graphs.
WEA 2005: 302-314 |
7 | EE | Marios Mavronicolas,
Vicky G. Papadopoulou,
Anna Philippou,
Paul G. Spirakis:
A Graph-Theoretic Network Security Game.
WINE 2005: 969-978 |
6 | EE | Dimitris Fotakis,
Sotiris E. Nikoletseas,
Vicky G. Papadopoulou,
Paul G. Spirakis:
Radiocoloring in planar graphs: Complexity and approximations.
Theor. Comput. Sci. 340(3): 514-538 (2005) |
2002 |
5 | EE | Maria I. Andreou,
Dimitris Fotakis,
Sotiris E. Nikoletseas,
Vicky G. Papadopoulou,
Paul G. Spirakis:
On Radiocoloring Hierarchically Specified Planar Graphs: PSPACE-Completeness and Approximations.
MFCS 2002: 81-92 |
4 | EE | Dimitris Fotakis,
Sotiris E. Nikoletseas,
Vicky G. Papadopoulou,
Paul G. Spirakis:
Radiocolorings in Periodic Planar Graphs: PSPACE-Completeness and Efficient Approximations for the Optimal Range of Frequencies.
WG 2002: 223-234 |
2001 |
3 | | Dimitris Fotakis,
Sotiris E. Nikoletseas,
Vicky G. Papadopoulou,
Paul G. Spirakis:
Hardness Results and Efficient Appromixations for Frequency Assignment Problems and the Radio Coloring Problem.
Bulletin of the EATCS 75: 152-181 (2001) |
2 | | Dimitris Fotakis,
Sotiris E. Nikoletseas,
Vicky G. Papadopoulou,
Paul G. Spirakis:
Hardness Results and Efficient Approximations for Frequency Assignment Problems: Radio Labelling and Radio Coloring.
Computers and Artificial Intelligence 20(2): (2001) |
2000 |
1 | EE | Dimitris Fotakis,
Sotiris E. Nikoletseas,
Vicky G. Papadopoulou,
Paul G. Spirakis:
NP-Completeness Results and Efficient Approximations for Radiocoloring in Planar Graphs.
MFCS 2000: 363-372 |