| 2008 |
|---|
| 26 | EE | Gerasimos G. Pollatos,
Orestis Telelis,
Vassilis Zissimopoulos:
On the Social Cost of Distributed Selfish Content Replication.
Networking 2008: 195-206 |
| 25 | EE | Orestis Telelis,
Vassilis Zissimopoulos:
Dynamic bottleneck optimization for k-edge and 2-vertex connectivity.
Inf. Process. Lett. 106(6): 251-257 (2008) |
| 24 | EE | Maria Liazi,
Ioannis Milis,
Vassilis Zissimopoulos:
A constant approximation algorithm for the densest k.
Inf. Process. Lett. 108(1): 29-32 (2008) |
| 2007 |
|---|
| 23 | EE | Vangelis Th. Paschos,
Orestis Telelis,
Vassilis Zissimopoulos:
Steiner Forests on Stochastic Metric Graphs.
COCOA 2007: 112-123 |
| 22 | EE | Maria Liazi,
Ioannis Milis,
Fanny Pascual,
Vassilis Zissimopoulos:
The densest k-subgraph problem on clique graphs.
J. Comb. Optim. 14(4): 465-474 (2007) |
| 2006 |
|---|
| 21 | EE | Gerasimos G. Pollatos,
Orestis Telelis,
Vassilis Zissimopoulos:
Updating Directed Minimum Cost Spanning Trees.
WEA 2006: 291-302 |
| 20 | EE | Nikolaos Laoutaris,
Orestis Telelis,
Vassilis Zissimopoulos,
Ioannis Stavrakakis:
Distributed Selfish Replication.
IEEE Trans. Parallel Distrib. Syst. 17(12): 1401-1413 (2006) |
| 2005 |
|---|
| 19 | EE | Nikolaos Laoutaris,
Orestis Telelis,
Vassilis Zissimopoulos,
Ioannis Stavrakakis:
Local Utility Aware Content Replication.
NETWORKING 2005: 455-468 |
| 18 | EE | Nikolaos Laoutaris,
Vassilis Zissimopoulos,
Ioannis Stavrakakis:
On the optimization of storage capacity allocation for content distribution.
Computer Networks 47(3): 409-428 (2005) |
| 17 | EE | Orestis Telelis,
Vassilis Zissimopoulos:
Absolute o(log m) error in approximating random set covering: an average case analysis.
Inf. Process. Lett. 94(4): 171-177 (2005) |
| 2004 |
|---|
| 16 | EE | George Boukeas,
Panagiotis Stamatopoulos,
Constantinos Halatsis,
Vassilis Zissimopoulos:
Inherent Choice in the Search Space of Constraint Satisfaction Problem Instances.
SETN 2004: 362-370 |
| 15 | EE | George Boukeas,
Constantinos Halatsis,
Vassilis Zissimopoulos,
Panagiotis Stamatopoulos:
Measures of Intrinsic Hardness for Constraint Satisfaction Problem Instances.
SOFSEM 2004: 184-195 |
| 14 | EE | Mhand Hifi,
Vangelis Th. Paschos,
Vassilis Zissimopoulos:
A simulated annealing approach for the circular cutting problem.
European Journal of Operational Research 159(2): 430-448 (2004) |
| 13 | EE | Nikolaos Laoutaris,
Vassilis Zissimopoulos,
Ioannis Stavrakakis:
Joint object placement and node dimensioning for Internet content distribution.
Inf. Process. Lett. 89(6): 273-279 (2004) |
| 2002 |
|---|
| 12 | | Eric Angel,
Vassilis Zissimopoulos:
On the Hardness of the Quadratic Assignment Problem with Metaheuristics.
J. Heuristics 8(4): 399-414 (2002) |
| 2001 |
|---|
| 11 | EE | Eric Angel,
Vassilis Zissimopoulos:
On the landscape ruggedness of the quadratic assignment problem.
Theor. Comput. Sci. 263(1-2): 159-172 (2001) |
| 2000 |
|---|
| 10 | EE | Eric Angel,
Vassilis Zissimopoulos:
On the Classification of NP-complete Problems in Terms of Their Correlation Coefficient.
Discrete Applied Mathematics 99(1-3): 261-277 (2000) |
| 1999 |
|---|
| 9 | EE | A. Le Gall,
Vassilis Zissimopoulos:
Extended Hopfield models for combinatorial optimization.
IEEE Transactions on Neural Networks 10(1): 72-80 (1999) |
| 1998 |
|---|
| 8 | EE | Eric Angel,
Vassilis Zissimopoulos:
On the Quality of Local Search for the Quadratic Assignment Problem.
Discrete Applied Mathematics 82(1-3): 15-25 (1998) |
| 7 | EE | Wenceslas Fernandez de la Vega,
Vassilis Zissimopoulos:
An Approximation Scheme for Strip Packing of Rectangles with Bounded Dimensions.
Discrete Applied Mathematics 82(1-3): 93-101 (1998) |
| 6 | EE | Eric Angel,
Vassilis Zissimopoulos:
Autocorrelation Coefficient for the Graph Bipartitioning Problem.
Theor. Comput. Sci. 191(1-2): 229-243 (1998) |
| 1997 |
|---|
| 5 | | Y. Kopidakis,
M. Lamari,
Vassilis Zissimopoulos:
On the Task Assignment Problem: Two New Efficient Heuristic Algorithms.
J. Parallel Distrib. Comput. 42(1): 21-29 (1997) |
| 4 | EE | Y. Kopidakis,
Vassilis Zissimopoulos:
An Approximation Scheme for Scheduling Independent Jobs into Subcubes of a Hypercube of Fixed Dimension.
Theor. Comput. Sci. 178(1-2): 265-273 (1997) |
| 1996 |
|---|
| 3 | EE | A. Le Gall,
Vassilis Zissimopoulos:
A Competitive Activation Neural Network Model for the Weighted Minimum Vertex Covering.
Int. J. Neural Syst. 7(5): 607-616 (1996) |
| 1995 |
|---|
| 2 | EE | Vassilis Zissimopoulos:
On the Performance Guarantee of Neural Networks for NP-Hard Optimization Problems.
Inf. Process. Lett. 54(6): 317-322 (1995) |
| 1991 |
|---|
| 1 | | Vassilis Zissimopoulos,
Vangelis Th. Paschos,
Ferhan Pekergin:
On the Approximation of NP-Complete Problems by Using the Boltzmann Machine Method: The Cases of Some Covering and Packing Problems.
IEEE Trans. Computers 40(12): 1413-1418 (1991) |
