Vassilis Zissimopoulos

51 papers B 6C 3Misc 1Journal 37Unranked 4
YearRankTypeTitle / Venue / Authors
2026 J jnl
Approximations for Fault-Tolerant Total and Partial Positive Influence Domination.
Discret. Math. Theor. Comput. Sci.
Ioannis Lamprou, Ioannis Sigalas, Ioannis Vaxevanakis, Vassilis Zissimopoulos
2025 J jnl
Approximations for Fault-Tolerant Total and Partial Positive Influence Domination.
CoRR
Ioannis Lamprou, Ioannis Sigalas, Ioannis Vaxevanakis, Vassilis Zissimopoulos
2024 J jnl
A Semi Brute-Force Search Approach for (Balanced) Clustering.
Algorithmica
Yicheng Xu, Vincent Chau, Chenchen Wu, Yong Zhang, Vassilis Zissimopoulos, Yifei Zou
2024 J jnl
Guest Editorial-Introduction to the special section on Machine Learning and Optimization.
Comput. Electr. Eng.
Vassilis Zissimopoulos, Yong Zhang
2022 C conf
Fault-Tolerant Total Domination via Submodular Function Approximation.
TAMC
Ioannis Lamprou, Ioannis Sigalas, Ioannis Vaxevanakis, Vassilis Zissimopoulos
2021 J jnl
An iterative algorithm for the Max-Min knapsack problem with multiple scenarios.
Oper. Res.
Thekra Al Douri, Mhand Hifi, Vassilis Zissimopoulos
2021 J jnl
Calibrations scheduling with arbitrary lengths and activation length.
J. Sched.
Eric Angel, Evripidis Bampis, Vincent Chau, Vassilis Zissimopoulos
2021 J jnl
Improved Budgeted Connected Domination and Budgeted Edge-Vertex Domination.
Theor. Comput. Sci.
Ioannis Lamprou, Ioannis Sigalas, Vassilis Zissimopoulos
2021 J jnl
Maximum rooted connected expansion.
Theor. Comput. Sci.
Ioannis Lamprou, Russell Martin, Sven Schewe, Ioannis Sigalas, Vassilis Zissimopoulos
2020 C conf
Improved Budgeted Connected Domination and Budgeted Edge-Vertex Domination.
IWOCA
Ioannis Lamprou, Ioannis Sigalas, Vassilis Zissimopoulos
2020 J jnl
Too Much Information Kills Information: A Clustering Perspective.
CoRR
Yicheng Xu, Vincent Chau, Chenchen Wu, Yong Zhang, Vassilis Zissimopoulos, Yifei Zou
2019 J jnl
Improved Budgeted Connected Domination and Budgeted Edge-Vertex Domination.
CoRR
Ioannis Lamprou, Ioannis Sigalas, Vassilis Zissimopoulos
2018 B conf
Maximum Rooted Connected Expansion.
MFCS
Ioannis Lamprou, Russell Martin, Sven Schewe, Ioannis Sigalas, Vassilis Zissimopoulos
2018 J jnl
Maximum Rooted Connected Expansion.
CoRR
Ioannis Lamprou, Russell Martin, Sven Schewe, Ioannis Sigalas, Vassilis Zissimopoulos
2017 Misc conf
On the Complexity of Minimizing the Total Calibration Cost.
FAW
Eric Angel, Evripidis Bampis, Vincent Chau, Vassilis Zissimopoulos
2016 B conf
Bin Packing with Colocations.
WAOA
Jean-Claude Bermond, Nathann Cohen, David Coudert, Dimitrios Letsios, Ioannis Milis, Stéphane Pérennes, Vassilis Zissimopoulos
2016 J jnl
Clustering on k-edge-colored graphs.
Discret. Appl. Math.
Eric Angel, Evripidis Bampis, Alexander V. Kononov, Dimitris Paparas, Emmanouil Pountourakis, Vassilis Zissimopoulos
2015 J jnl
Minimizing Total Calibration Cost.
CoRR
Eric Angel, Evripidis Bampis, Vincent Chau, Vassilis Zissimopoulos
2014 J jnl
Optimal data placement on networks with a constant number of clients.
Theor. Comput. Sci.
Eric Angel, Evripidis Bampis, Gerasimos G. Pollatos, Vassilis Zissimopoulos
2013 B conf
Clustering on k-Edge-Colored Graphs.
MFCS
Eric Angel, Evripidis Bampis, Alexander V. Kononov, Dimitris Paparas, Emmanouil Pountourakis, Vassilis Zissimopoulos
2010 J jnl
Optimal Data Placement on Networks With Constant Number of Clients
CoRR
Eric Angel, Evripidis Bampis, Gerasimos G. Pollatos, Vassilis Zissimopoulos
2010 J jnl
Probabilistic models for the Steiner Tree problem.
Networks
Vangelis Th. Paschos, Orestis Telelis, Vassilis Zissimopoulos
2008 J jnl
A constant approximation algorithm for the densest k.
Inf. Process. Lett.
Maria Liazi, Ioannis Milis, Vassilis Zissimopoulos
2008 J jnl
Dynamic bottleneck optimization for k-edge and 2-vertex connectivity.
Inf. Process. Lett.
Orestis Telelis, Vassilis Zissimopoulos
2008 B conf
On the Social Cost of Distributed Selfish Content Replication.
Networking
Gerasimos G. Pollatos, Orestis Telelis, Vassilis Zissimopoulos
2007 C conf
Steiner Forests on Stochastic Metric Graphs.
COCOA
Vangelis Th. Paschos, Orestis Telelis, Vassilis Zissimopoulos
2007 J jnl
The densest
J. Comb. Optim.
Maria Liazi, Ioannis Milis, Fanny Pascual, Vassilis Zissimopoulos
2006 J jnl
Distributed Selfish Replication.
IEEE Trans. Parallel Distributed Syst.
Nikolaos Laoutaris, Orestis Telelis, Vassilis Zissimopoulos, Ioannis Stavrakakis
2006 — conf
Updating Directed Minimum Cost Spanning Trees.
WEA
Gerasimos G. Pollatos, Orestis Telelis, Vassilis Zissimopoulos
2005 J jnl
Absolute o(log m) error in approximating random set covering: an average case analysis.
Inf. Process. Lett.
Orestis Telelis, Vassilis Zissimopoulos
2005 B conf
Local Utility Aware Content Replication.
NETWORKING
Nikolaos Laoutaris, Orestis Telelis, Vassilis Zissimopoulos, Ioannis Stavrakakis
2005 J jnl
On the optimization of storage capacity allocation for content distribution.
Comput. Networks
Nikolaos Laoutaris, Vassilis Zissimopoulos, Ioannis Stavrakakis
2004 J jnl
A simulated annealing approach for the circular cutting problem.
Eur. J. Oper. Res.
Mhand Hifi, Vangelis Th. Paschos, Vassilis Zissimopoulos
2004 — conf
Inherent Choice in the Search Space of Constraint Satisfaction Problem Instances.
SETN
George Boukeas, Panagiotis Stamatopoulos, Constantinos Halatsis, Vassilis Zissimopoulos
2004 J jnl
Joint object placement and node dimensioning for Internet content distribution.
Inf. Process. Lett.
Nikolaos Laoutaris, Vassilis Zissimopoulos, Ioannis Stavrakakis
2004 B conf
Measures of Intrinsic Hardness for Constraint Satisfaction Problem Instances.
SOFSEM
George Boukeas, Constantinos Halatsis, Vassilis Zissimopoulos, Panagiotis Stamatopoulos
2004 — conf
Storage Capacity Allocation Algorithms for Hierarchical Content Distribution.
Net-Con
Nikolaos Laoutaris, Vassilis Zissimopoulos, Ioannis Stavrakakis
2002 J jnl
On the Hardness of the Quadratic Assignment Problem with Metaheuristics.
J. Heuristics
Eric Angel, Vassilis Zissimopoulos
2001 J jnl
On the landscape ruggedness of the quadratic assignment problem.
Theor. Comput. Sci.
Eric Angel, Vassilis Zissimopoulos
2000 J jnl
On the Classification of NP-complete Problems in Terms of Their Correlation Coefficient.
Discret. Appl. Math.
Eric Angel, Vassilis Zissimopoulos
1999 J jnl
Extended Hopfield models for combinatorial optimization.
IEEE Trans. Neural Networks
A. Le Gall, Vassilis Zissimopoulos
1998 J jnl
An Approximation Scheme for Strip Packing of Rectangles with Bounded Dimensions.
Discret. Appl. Math.
Wenceslas Fernandez de la Vega, Vassilis Zissimopoulos
1998 J jnl
An efficient approach for large-scale two-dimensional guillotine cutting stock problems.
J. Oper. Res. Soc.
Didier Fayard, Mhand Hifi, Vassilis Zissimopoulos
1998 J jnl
Autocorrelation Coefficient for the Graph Bipartitioning Problem.
Theor. Comput. Sci.
Eric Angel, Vassilis Zissimopoulos
1998 J jnl
On the Quality of Local Search for the Quadratic Assignment Problem.
Discret. Appl. Math.
Eric Angel, Vassilis Zissimopoulos
1997 J jnl
An Approximation Scheme for Scheduling Independent Jobs into Subcubes of a Hypercube of Fixed Dimension.
Theor. Comput. Sci.
Y. Kopidakis, Vassilis Zissimopoulos
1997 J jnl
On the Task Assignment Problem: Two New Efficient Heuristic Algorithms.
J. Parallel Distributed Comput.
Y. Kopidakis, M. Lamari, Vassilis Zissimopoulos
1996 J jnl
A Competitive Activation Neural Network Model for the Weighted Minimum Vertex Covering.
Int. J. Neural Syst.
A. Le Gall, Vassilis Zissimopoulos
1996 — conf
Linear time approximation schemes for parallel processor scheduling.
SPDP
Y. Kopidakis, Didier Fayard, Vassilis Zissimopoulos
1995 J jnl
On the Performance Guarantee of Neural Networks for NP-Hard Optimization Problems.
Inf. Process. Lett.
Vassilis Zissimopoulos
1991 J jnl
On the Approximation of NP-Complete Problems by Using the Boltzmann Machine Method: The Cases of Some Covering and Packing Problems.
IEEE Trans. Computers
Vassilis Zissimopoulos, Vangelis Th. Paschos, Ferhan Pekergin