Vassilis Zissimopoulos

Publication Activity (10 Years)

Years Active: 1991-2024
Publications (10 Years): 15

Top Topics

Arbitrary Length

Top Venues

Theor. Comput. Sci.

Discret. Appl. Math.

Publications

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