The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Vassilis Zissimopoulos: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  22. On the Social Cost of Distributed Selfish Content Replication. [Citation Graph (, )][DBLP]


  23. Optimal Data Placement on Networks With Constant Number of Clients [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.005secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002