Vassilis Zissimopoulos

According to our database, Vassilis Zissimopoulos authored at least 42 papers between 1991 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

A Semi Brute-Force Search Approach for (Balanced) Clustering.

Yicheng Xu, Vincent Chau, Chenchen Wu, Yong Zhang, Vassilis Zissimopoulos, Yifei Zou

Algorithmica, January, 2024

2022

Fault-Tolerant Total Domination via Submodular Function Approximation.

Ioannis Lamprou, Ioannis Sigalas, Ioannis Vaxevanakis, Vassilis Zissimopoulos

Proceedings of the Theory and Applications of Models of Computation, 2022

2021

Improved Budgeted Connected Domination and Budgeted Edge-Vertex Domination.

Ioannis Lamprou, Ioannis Sigalas, Vassilis Zissimopoulos

Theor. Comput. Sci., 2021

Maximum rooted connected expansion.

Ioannis Lamprou, Russell Martin, Sven Schewe, Ioannis Sigalas, Vassilis Zissimopoulos

Theor. Comput. Sci., 2021

Calibrations scheduling with arbitrary lengths and activation length.

Eric Angel, Evripidis Bampis, Vincent Chau, Vassilis Zissimopoulos

J. Sched., 2021

An iterative algorithm for the Max-Min knapsack problem with multiple scenarios.

Thekra Al Douri, Mhand Hifi, Vassilis Zissimopoulos

Oper. Res., 2021

2020

Too Much Information Kills Information: A Clustering Perspective.

Yicheng Xu, Vincent Chau, Chenchen Wu, Yong Zhang, Vassilis Zissimopoulos, Yifei Zou

CoRR, 2020

2017

On the Complexity of Minimizing the Total Calibration Cost.

Eric Angel, Evripidis Bampis, Vincent Chau, Vassilis Zissimopoulos

Proceedings of the Frontiers in Algorithmics - 11th International Workshop, 2017

2016

Clustering on k-edge-colored graphs.

Eric Angel, Evripidis Bampis, Alexander V. Kononov, Dimitris Paparas, Emmanouil Pountourakis, Vassilis Zissimopoulos

Discret. Appl. Math., 2016

Bin Packing with Colocations.

Jean-Claude Bermond, Nathann Cohen, David Coudert, Dimitrios Letsios, Ioannis Milis, Stéphane Pérennes, Vassilis Zissimopoulos

Proceedings of the Approximation and Online Algorithms - 14th International Workshop, 2016

2015

Minimizing Total Calibration Cost.

Eric Angel, Evripidis Bampis, Vincent Chau, Vassilis Zissimopoulos

CoRR, 2015

2014

Optimal data placement on networks with a constant number of clients.

Eric Angel, Evripidis Bampis, Gerasimos G. Pollatos, Vassilis Zissimopoulos

Theor. Comput. Sci., 2014

2010

Probabilistic models for the Steiner Tree problem.

Vangelis Th. Paschos, Orestis Telelis, Vassilis Zissimopoulos

Networks, 2010

2008

Dynamic bottleneck optimization for k-edge and 2-vertex connectivity.

Orestis Telelis, Vassilis Zissimopoulos

Inf. Process. Lett., 2008

A constant approximation algorithm for the densest k.

Maria Liazi, Ioannis Milis, Vassilis Zissimopoulos

Inf. Process. Lett., 2008

On the Social Cost of Distributed Selfish Content Replication.

Gerasimos G. Pollatos, Orestis Telelis, Vassilis Zissimopoulos

Proceedings of the NETWORKING 2008, Ad Hoc and Sensor Networks, Wireless Networks, 2008

2007

The densest <i>k</i>-subgraph problem on clique graphs.

Maria Liazi, Ioannis Milis, Fanny Pascual, Vassilis Zissimopoulos

J. Comb. Optim., 2007

Steiner Forests on Stochastic Metric Graphs.

Vangelis Th. Paschos, Orestis Telelis, Vassilis Zissimopoulos

Proceedings of the Combinatorial Optimization and Applications, 2007

2006

Distributed Selfish Replication.

Nikolaos Laoutaris, Orestis Telelis, Vassilis Zissimopoulos, Ioannis Stavrakakis

IEEE Trans. Parallel Distributed Syst., 2006

Updating Directed Minimum Cost Spanning Trees.

Gerasimos G. Pollatos, Orestis Telelis, Vassilis Zissimopoulos

Proceedings of the Experimental Algorithms, 5th International Workshop, 2006

2005

Absolute o(log m) error in approximating random set covering: an average case analysis.

Orestis Telelis, Vassilis Zissimopoulos

Inf. Process. Lett., 2005

On the optimization of storage capacity allocation for content distribution.

Nikolaos Laoutaris, Vassilis Zissimopoulos, Ioannis Stavrakakis

Comput. Networks, 2005

Local Utility Aware Content Replication.

Nikolaos Laoutaris, Orestis Telelis, Vassilis Zissimopoulos, Ioannis Stavrakakis

Proceedings of the NETWORKING 2005: Networking Technologies, 2005

2004

Joint object placement and node dimensioning for Internet content distribution.

Nikolaos Laoutaris, Vassilis Zissimopoulos, Ioannis Stavrakakis

Inf. Process. Lett., 2004

A simulated annealing approach for the circular cutting problem.

Mhand Hifi, Vangelis Th. Paschos, Vassilis Zissimopoulos

Eur. J. Oper. Res., 2004

Measures of Intrinsic Hardness for Constraint Satisfaction Problem Instances.

George Boukeas, Constantinos Halatsis, Vassilis Zissimopoulos, Panagiotis Stamatopoulos

Proceedings of the SOFSEM 2004: Theory and Practice of Computer Science, 2004

Inherent Choice in the Search Space of Constraint Satisfaction Problem Instances.

George Boukeas, Panagiotis Stamatopoulos, Constantinos Halatsis, Vassilis Zissimopoulos

Proceedings of the Methods and Applications of Artificial Intelligence, 2004

Storage Capacity Allocation Algorithms for Hierarchical Content Distribution.

Nikolaos Laoutaris, Vassilis Zissimopoulos, Ioannis Stavrakakis

Proceedings of the Network Control and Engineering for QoS, Security and Mobility, III, 2004

2002

On the Hardness of the Quadratic Assignment Problem with Metaheuristics.

Eric Angel, Vassilis Zissimopoulos

J. Heuristics, 2002

2001

On the landscape ruggedness of the quadratic assignment problem.

Eric Angel, Vassilis Zissimopoulos

Theor. Comput. Sci., 2001

2000

On the Classification of NP-complete Problems in Terms of Their Correlation Coefficient.

Eric Angel, Vassilis Zissimopoulos

Discret. Appl. Math., 2000

1999

Extended Hopfield models for combinatorial optimization.

A. Le Gall, Vassilis Zissimopoulos

IEEE Trans. Neural Networks, 1999

1998

Autocorrelation Coefficient for the Graph Bipartitioning Problem.

Eric Angel, Vassilis Zissimopoulos

Theor. Comput. Sci., 1998

An efficient approach for large-scale two-dimensional guillotine cutting stock problems.

Didier Fayard, Mhand Hifi, Vassilis Zissimopoulos

J. Oper. Res. Soc., 1998

An Approximation Scheme for Strip Packing of Rectangles with Bounded Dimensions.

Wenceslas Fernandez de la Vega, Vassilis Zissimopoulos

Discret. Appl. Math., 1998

On the Quality of Local Search for the Quadratic Assignment Problem.

Eric Angel, Vassilis Zissimopoulos

Discret. Appl. Math., 1998

1997

An Approximation Scheme for Scheduling Independent Jobs into Subcubes of a Hypercube of Fixed Dimension.

Y. Kopidakis, Vassilis Zissimopoulos

Theor. Comput. Sci., 1997

On the Task Assignment Problem: Two New Efficient Heuristic Algorithms.

Y. Kopidakis, M. Lamari, Vassilis Zissimopoulos

J. Parallel Distributed Comput., 1997

1996

A Competitive Activation Neural Network Model for the Weighted Minimum Vertex Covering.

A. Le Gall, Vassilis Zissimopoulos

Int. J. Neural Syst., 1996

Linear time approximation schemes for parallel processor scheduling.

Y. Kopidakis, Didier Fayard, Vassilis Zissimopoulos

Proceedings of the Eighth IEEE Symposium on Parallel and Distributed Processing, 1996

1995

On the Performance Guarantee of Neural Networks for NP-Hard Optimization Problems.

Vassilis Zissimopoulos

Inf. Process. Lett., 1995

1991

On the Approximation of NP-Complete Problems by Using the Boltzmann Machine Method: The Cases of Some Covering and Packing Problems.

Vassilis Zissimopoulos, Vangelis Th. Paschos, Ferhan Pekergin

IEEE Trans. Computers, 1991