List of Publications

 

  • V. Zissimopoulos, "Combinatorial Optimization: Towards massively parallel algorithms", Habilitation, LRI, University of Paris-Sud, 1996.
  • V. Zissimopoulos, "Cutting Stock Problems in two dimensions: approximation algorithms, Ph.D., LRI, University of Paris-Sud, 1984.

Journal Publications

  • M. Liazi, I. Milis, V. Zissimopoulos, "A constant approximation algorithm for the densest k-subgraph problem on chordal graphs", Information Processing Letters, 108 (2008) 29-32. [pdf]
  • O. Telelis, V. Zissimopoulos "Dynamic Bottleneck Optimization for k-Edge and 2-Vertex Connectivity", Information Processing Letters, 106(6):251-257, 2008 [pdf]
  • M. Liazi, I. Milis, F. Pascual, V. Zissimopoulos, "The densest k-subgraph problem on clique graphs", Journal of Combinatorial Optimization, Vol. 14, No 4, pages 465-474, 2007 [pdf]
  • Nikolaos Laoutaris, Orestis Telelis, Vassilios Zissimopoulos, Ioannis Stavrakakis, "Distributed Selfish Replication," IEEE Transactions on Parallel and Distributed Systems, 17(12), pages 1401-1413, 2006 [pdf]
  • G.Christodoulou, V. Zissimopoulos, "On-line Maximum Independent Set in Chordal Graphs", Foundations of Computing and Decision Sciences, Vol. 30, No 4, 2005. [ps]
  • O. Telelis,V. Zissimopoulos, "Absolute o(log m) Error in Approximating Random Set Covering: An average Case Analysis", Information Processing Letters, vol. 94, issue 4, pages 171-177, 2005. [pdf,ps]
  • N. Laoutaris, V. Zissimopoulos, I. Stavrakakis, "On the Optimization of Storage Capacity Allocation for Content Distribution", Computer Networks, 47(3): 409-428, 2005. [pdf,ps]
  • N. Lautaris, V. Zissimopoulos, I. Stayrakakis, "Joint object placement and node dimensioning for Internet content distribution", Information Processing Letters, 89(6): 273 - 279, 2004. [pdf,ps]
  • M. Hifi, V. Th. Paschos and V. Zissimopoulos, "The circular cutting problem: A simulated annealing approach", European Journal of Operations Research, Vol. 159, pp. 430-448, 2004. [pdf,ps]
  • S. A. Paschos, V. Th. Paschos, V. Zissimopoulos, "The antennas pre-assignment problem", Chaos, Solitons and Fractals, Vol. 22, 2004. [pdf,ps]
  • S. Tsitmidelis, M.V. Koutras, V. Zissimopoulos, "Evaluation of reliability bounds by set covering models", Statistics and probability letters, Vol. 61, pp. 163-175, 2003. [pdf,ps]
  • E. Angel and V. Zissimopoulos, "On the hardness of the Quadratic Assignment problem with meta-heuristics", Journal of Heuristics, Vol. 8(4), pp. 399-414, 2002.[ps]
  • E. Angel and V. Zissimopoulos, "On the landscape ruggedness of the quadratic assignment problem", Journal of Theoretical Computer Science,Vol. 263, Number 1-2, pp. 159-172, 2001. [ps]
  • E. Angel and V. Zissimopoulos, "On the classification of NP-complete problems in terms of their correlation coefficient", Discrete Applied Mathematics, Vol. 99, pp. 261-277, 2000. [ps]
  • E. Angel et V. Zissimopoulos, "On the quality of local search for the quadratic assignment problem", Discrete Applied Mathematics, Vol. 82, PP. 15-25, 1998. [ps]
  • E. Angel and V. Zissimopoulos, "Autocorrelation coefficient for the graph bipartitioning problem with applications to local search", Theoretical Computer Science, Vol. 191, pp. 229-243,1998. [pdf, ps]
  • A. Le Gall and V. Zissimopoulos, "Extended Hopfield models for combinatorial optimization", IEEE Transactions on Neural Networks, Vol. 10, No 1, pp. 72-80, 1999. [pdf, ps]
  • M. Hifi, V. Paschos and V. Zissimopoulos, "A Boltzmann Machine approach of the set covering problem", Chaos, Solitons and Fractals No 11, pp. 2079-2089, 2000.
  • W. Fernandez de la Vega et V. Zissimopoulos, "An Approximation scheme For Strip-Packing of Rectangles With Bounded Dimensions", Discrete Applied Mathematics, Vol. 82, PP. 93-101, 1998. [pdf, ps]
  • D. Fayard, M. Hifi et V. Zissimopoulos, "A general efficient approach for large-scale two-dimensional cutting stock problems", Journal of the Operational Research Society, Vol. 49, n0 12, pp.1270-1280, 1998.
  • Y. Kopidakis et V. Zissimopoulos, "An approximation scheme for scheduling independent jobs into subcubes of a hypercube of fixed dimension", Theoretical Computer Science,Vol. 178, Number 1-2, pp. 265-273, 1997. [pdf, ps]
  • Y. Kopidakis, M. Lamari and V. Zissimopoulos, "On the task assignment problem: two new efficient heuristic algorithms", Journal of Parallel and Distributed Computing,Vol. 42, pp. 21-29, 1997. [pdf,ps]
  • M. Hifi et V. Zissimopoulos,"Constrained two-dimensional cutting: An improvement of Christofides and Whitlock's exact algorithm", Journal of the Operational Research Society, Vol. 48, pp. 324-331, 1997. [pdf]
  • M. Hifi et V. Zissimopoulos, "A recursive exact algorithm for weighted two-dimensional cutting", European Journal of Operations Research, Vol. 91, pp. 553-564,1996. [pdf, ps]
  • A. Le Gall and V. Zissimopoulos, "A competitive activation neural network model for the weighted minimum vertex covering", International Journal of Neural Systems, Vol. 7, No 5, pp. 607-616,1996.
  • D. Fayard et V. Zissimopoulos, "An approximation Algorithm For Solving Unconstrained Two-Space Knapsack problems", European Journal of Operations Research,Vol. 84, pp. 618-632, 1995. [pdf, ps]
  • V. Zissimopoulos,"On the performance guarantee of neural networks for NP-hard optimization problems",Information Processing Letters, No 54, pp. 317-322, 1995. [pdf]
  • M. Hifi et V. Zissimopoulos,"Une Amelioration de l'Algorithme Recursif de Herz pour le Probleme de Decoupe a Deux Dimensions", RAIRO, Recherche Operationnelle, Vol. 30, no 2, pp. 111-125, 1995.
  • M. Afif, M. Hifi, V. Paschos et V. Zissimopoulos,"A new efficient heuristic for minimum set covering problem", Journal of the Operational Research Society, Vol. 46, pp. 1260-1268,1995. [pdf, ps]
  • V. Paschos, F. Pekergin et V. Zissimopoulos, "Approximating the Optimal Solutions of some Hard Graph Problems by a Boltzmann Machine", Belgian Journal of Operations Research, Statistics and Computer Science, Vol. 33, No 2, pp. 119-132, 1994.
  • V. Zissimopoulos et G. Karagiorgos, "Performance Study of a Neural Network Method with Set Partitioning", Journal of Chaos, Soliton and Fractals, Vol. 2, No 4, pp. 421-435, 1992.
  • V. Zissimopoulos, V. Paschos et F. Pekergin, "On the Approximation of NP-complete Problems by Using Boltzmann Machine Method: The Cases of Some Covering and Packing Problems", IEEE Transactions on Computers, Vol. 40, No 12, pp. 1413-1419, 1991. [pdf, ps]]
  • V. Zissimopoulos, "Heuristic Methods For Solving (Un)Constrained two Dimensional Cutting Stock Problems", Methods of Operations Research, Vol. 49, pp. 345-357, 1984.
  • International Conferences

    • G. Pollatos, O. Telelis, V. Zissimopoulos " On the Social Cost of Distributed Selfish Content Replication " 7th IFIP-TC6 International Conference on Networking, 2008, [pdf]
    • V. Th. Paschos, O. Telelis, V. Zissimopoulos " Steiner Forests on Stochastic Metric Graphs, " 1st International Conference on Combinatorial Optimization and Applications COCOA'07, Springer LNCS 4616, pp. 112-123, 2007 [pdf]
    • G. Pollatos, O. Telelis, V. Zissimopoulos, "Updating Directed Minimum Cost Spanning Trees", 5th Workshop on Experimental Algorithms, WEA'06, Springer, LNCS 4007, pp. 291-302, 2006. [pdf]
    • M. Liazi, I. Milis, F. Pascual, V. Zissimopoulos, "The densest k-subgraph problem on clique graphs", International Combinatorics, Geometry and Computer Science Conference, Marseille, 2007.
    • N. Laoutaris, O. Telelis, V. Zissimopoulos, I. Stavrakakis, "Local Utility Aware Content Replication", In Proceedings of the Fourth IFIP International Conference on Networking, NETWORKING'05, 2005, Waterloo, Canada, May 2005. [pdf]
    • O. A. Telelis, V. Zissimopoulos, "Dynamic Bottleneck Optimization for 2-Vertex and Strong Connectivity" Proceedings of the 2nd Balkan Conference in Informatics (Algorithms and Complexity), pp. 52-59, 2005. [pdf]
    • M. Liazi, I. Milis, V. Zissimopoulos, "Polynomial Variants of the Densest/Heaviest k-Subgraph Problem", 20th British Combinatorial Conference, Durham, 2005.
    • O. Telelis,V. Zissimopoulos, "Dynamic Maintenance of Approximate Set Covers", EURO XX, 2004.
    • G. Boukeas, C. Halatsis, V. Zissimopoulos, P. Stamatopoulos, "Measures of Intrinsic Hardness for Constraint Satisfaction Problem Instances", Proceedings of the 30th Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2004, LNCS 2932, pp. 184-195, Prague, 2004. [pdf]
    • N. Laoutaris, V. Zissimopoulos, I. Stavrakakis, "Storage Capacity Allocation Algorithms for Hierarchical Content Distribution", IFIP Net-Con 2004, Palma de Mallorca, Spain , November 2004.
    • G. Boukeas, P. Stamatopoulos, C. Halatsis, V. Zissimopoulos, "Inherent Choice in the Search Space of Constraint Satisfaction Problem Instances", Proceedings of the 3rd Hellenic Conference on Artificial Intelligence, SETN-2004, LNAI 3025, pp. 362-370, Samos, 2004. [pdf]
    • S. Tsitmidelis, M.V. Koutras, V. Zissimopoulos, "An application of the set covering problem to fault tree analysis", Proceedings of EUROGEN:Evolutionary Methods for Design, Optimization, and Control with Applications to Industrial Problems Athens, 2001, (CIMNE Handbook 2002, pp. 179-183).
    • M.V. Koutras, S. Tsitmidelis, V. Zissimopoulos, "Evaluation of reliability bounds by the aid of set covering problem algorithms", HERCMA-01: Proceedings of the Fifth Hellenic-European conference on computer mathematics and its applications, (HERCMA '01 Vol. 2), pp. 501-504, Athens, 2001.
    • E. Angel et V. Zissimopoulos,"On the ruggedness of the graph bipartitioning problem",it International Symposium on Combinatorial Optimization (CO98), Bruxelles, 1998.
    • A. Le Gall and V. Zissimopoulos,"Adaptability of neural networks for combinatorial optimization",International Conference on Intelligent Systems (ICIS-98),Fontainebleau, France,July, 1-3, pp. 102-105, 1998.
    • E. Angel et V. Zissimopoulos,"On the hardness of some combinatorial optimization problems with local search",it European Symposium on Operations Research,EURO XVI, Brussels, Belgium, July 12-15, Proc., pp. 121, 1998.
    • A. Le Gall et V. Zissimopoulos,"Solving incrementally task allocation problems",it European Symposium on Operations Research,EURO XVI, EURO XVI, Brussels, Belgium, July 12-15, Proc., pp. 45, 1998.
    • E. Angel et V. Zissimopoulos, "Towards a classification of combinatorial optimization problems relatively to their difficulty for generalized local search algorithms", 5th TWENTE Workshop on graphs and combinatorial optimization, Enschede, The Netherlands, 20-22 mai, 1997.
    • E. Angel et V. Zissimopoulos, "On the landscape ruggedness and local search solvability of quadratic assignment problem", it International Workshop on Combinatorics and Computer science, LIX-CNRS Ecole Polytechnique, Palaiseau, Sept. 15-18, 1997.
    • Y. Kopidakis, D. Fayard and V. Zissimopoulos, "Linear time approximation schemes for parallel processor scheduling" Eighth IEEE Symposium on Parallel and Distributed Processing (SPDP'96), New Orleans, pp. 482-487, IEEE Computer Society, October 1996. [pdf]
    • Y. Kopidakis et V. Zissimopoulos, "An approximation scheme for scheduling on the hypercube using the strip-packing model", it International Symposium on Combinatorial Optimization (CO96), London, 27-29 March, 1996.
    • E. Angel et V. Zissimopoulos, "On the quality of local search for the quadratic assignment problem", it International Symposium on Mathematical Programming, Lausanne, August 24-29, 1997.
    • Y. Kopidakis et V. Zissimopoulos, "Task allocation for load balancing in heterogeneous distributed systems", IFORS, Vancouver, June, 1996.
    • A. Le Gall et V. Zissimopoulos, "R\'esolution de prob\`emes d'Optimisation combinatoire par une m\'ethode neuronale d'activation comp\'etitive, FRANCORO, Mons, Belgique, June, 1995.
    • Y. Kopidakis, M. Lamari et V. Zissimopoulos,"Heuristiques pour le probl\`eme d'allocation de t\^aches dans les syst\`emes distribu\'es: une \'etude comparative", FRANCORO, Mons, Belgique, June, 1995.
    • D. Fayard et V. Zissimopoulos, "Massively Parallel Algorithms for Combinatorial Optimization Problems", EURO XIII/OR 36, Glasgow, Scotland, 19-22 July 1994.
    • R. Charpentier, M. Lamari et V. Zissimopoulos, "Genetic and Neural Network Algorithms for the 3-Satisfiability Problem", EURO XIII/OR 36, Glasgow, Scotland, 19-22 July 1994.
    • D. Fayard et V. Zissimopoulos, "An approximation Algorithm For Solving Unconstrained Two-Space Knapsack problems", Joint Intern. Conf. Opern. Res.and Manag. Sci. EURO XII/TIMS XXXI, Helsinki, Finland, June, 1992.
    • V. Paschos, F. Pekergin et V. Zissimopoulos,"Solving Vertex Cover and Independent Set Problem by a Boltzmann Machine", ˆEuropean Joint Conference on Engineering Systems Design and Analysis(ESDA), Istanbul, Turkey, June 1992, Proc. "The American Society of Mechanical Engineers".
    • V. Zissimopoulos, V. Paschos et F. Pekergin, "On the Approximation of NP-complete Problems by Using Boltzmann Machine Method. The Cases of Some Covering and Packing Problems", Intern. Conf. on Novel Methods In Optimization, Copenhagen, Denmark, Fev. 1991.
    • V. Zissimopoulos, "Heuristic Methods For Solving (Un)Constrained two Dimensional Cutting Stock Problems", 9th Symposium of Operations Research, Osnabr\"uck, Allemagne, August, 1984.
    • A. Stafilopatis et V. Zissimopoulos, "On Discrete Nonlinear Associative Memories", Proc. of 4th International Symposium on Computer and Information Sciences, ISCIS, \c Cesme, Turkey, pp. 625-634, 1989.

    National Conferences

    • M. Ben Dhaou, D. Fayard and V. Zissimopoulos,"Placement de t\^aches communicantes sur des processeurs h\'et\'erog\`enes avec minimisation du temps de compl\'etude", Actes JNPC, pp. 953-964, 2001.
    • E. Angel et V. Zissimopoulos, "Sur la difficult\'e du probl\`eme de l'affectation quadratique pour les metaheuristiques", Premier Congres Fran\c cais de Recherche Op\'erationnelle,Paris, Janvier 1998.
    • A. Le Gall et V. Zissimopoulos, "Updating incrementaly arborescences in evolutive graphs", it 4\`emes Journ\'ees sur la r\'esolution Pratique de Probl\`emes NP-complets, Nantes, May, 27-29, 1998.
    • E. Angel et V. Zissimopoulos, "Une \'evaluation polynomiale et a priori de la performance des m\'eta-heuristiques pour certains probl\`emes d'optimisation combinatoire", Sixi\`emes Journ\'ees Du Groupe MODE: Math\'ematiques de l'optimisation et de la d\'ecision, Poitiers, 19-21 mars 1998.
    • A. Le Gall et V. Zissimopoulos,"R\'esolution incr\'ementale du probl\`eme de placement de t\^aches", it 2\`emes Journ\'ees de Recherche sur Le Placement Dynamique et la R\'epartition de Charge (JRPRC2), Lille, France, May, 19-20, 1998.
    • E. Angel et V. Zissimopoulos, "Recherche locale pour l'affectation quadratique ", Cinqui\`emes Journ\'ees Du Groupe MODE: Math\'ematiques de l'optimisation et de la d\'ecision, Paris, 19-21 mars 1997.
    • V. Zissimopoulos, "M\'ethodes Neuronales pour des probl\`emes d'Optimisation Combinatoire", Journ\'ee d'Enseignement de la Recherche Op\'erationnelle, AFCET, Paris, France, Febr. 12, 1993.
    • V. Zissimopoulos et G. Karagiorgos, "A Neural Network Approach for Solving Set Partitioning Problems", 3rd Symposium of Computer Sciences, Athens, Greece, pp. 352-368, June 1991.

    Technical Reports

    • D. Fayard et V. Zissimopoulos, "Les Probl\`emes de d\'ecoupe: Les difficult\'es - les m\'ethodes", Rapport de recherche no 186, LRI, Universit\'e de Paris-Sud.
    • V. Zissimopoulos,"M\'ethodes Heuristiques pour les Probl\`emes de d\'ecoupe \`a Deux Dimensions", Rapport de recherche no 184, LRI, Universit\'e de Paris-Sud.
    • V. Zissimopoulos, "Probl\`emes de d\'ecoupe",M\'emoire DEA, Laboratoire de Recherche en Informatique, Universit\'e de Paris-Sud, Juin 1982, Directeur~: D. Fayard.
    • V. Zissimopoulos et G. Karagiorgos, "The Counterpropagation Neural Network model", Chapter 6 dans "A short Review of Neural Network Architectures and their Applications", Editor Harwell Laboratory, United Kingdom Atomic Energy Authority, Oxford shire, OX11 ORA, ANNIE, ESPRIT II, May 1989.
    • V. Zissimopoulos et G. Karagiorgos, "The Airline Crew Scheduling Problem: A Neural Network Approach", \\ Chapter 7 dans ANN90R04, ANNIE-ESPRIT II, 1990.
    • V. Zissimopoulos et G. Karagiorgos, "The performance of a Neural Network Model in the resolution of the Set Partitioning Problem arising in the Airline Crew Scheduling Application", ANN90R011, ANNIE, ESPRIT II, 1990.
    • V. Zissimopoulos, "Neural networks for combinatorial optimization: the case of the Spot Problem", Chapter 4 dans ANN90R04, ANNIE-ESPRIT II, 1989.
    • N. Ioannidis, G. Karagiorgos et V. Zissimopoulos, "Artificial Neural Networks Software Simulators", ANN89R, ANNIE-ESPRIT II, 1989.
    • A. Stafilopatis, G. Papageorgiou et V. Zissimopoulos, "Neural Network Methods in Combinatorial Optimization", Chapter 3, 6 et 7 dans ANN90R04, ANNIE-ESPRIT II.