default search action
Vassilis Zissimopoulos
Person information
- affiliation: National and Kapodistrian University of Athens, Greece
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j30]Yicheng Xu, Vincent Chau, Chenchen Wu, Yong Zhang, Vassilis Zissimopoulos, Yifei Zou:
A Semi Brute-Force Search Approach for (Balanced) Clustering. Algorithmica 86(1): 130-146 (2024) - [j29]Vassilis Zissimopoulos, Yong Zhang:
Guest Editorial-Introduction to the special section on Machine Learning and Optimization. Comput. Electr. Eng. 118: 109402 (2024) - 2022
- [c14]Ioannis Lamprou, Ioannis Sigalas, Ioannis Vaxevanakis
, Vassilis Zissimopoulos:
Fault-Tolerant Total Domination via Submodular Function Approximation. TAMC 2022: 281-292 - 2021
- [j28]Thekra Al Douri, Mhand Hifi
An iterative algorithm for the Max-Min knapsack problem with multiple scenarios. Oper. Res. 21(2): 1355-1392 (2021) - [j27]Eric Angel, Evripidis Bampis, Vincent Chau
Calibrations scheduling with arbitrary lengths and activation length. J. Sched. 24(5): 459-467 (2021) - [j26]Ioannis Lamprou, Ioannis Sigalas, Vassilis Zissimopoulos:
Improved Budgeted Connected Domination and Budgeted Edge-Vertex Domination. Theor. Comput. Sci. 858: 1-12 (2021) - [j25]Ioannis Lamprou, Russell Martin, Sven Schewe
Maximum rooted connected expansion. Theor. Comput. Sci. 873: 25-37 (2021) - 2020
- [c13]Ioannis Lamprou, Ioannis Sigalas, Vassilis Zissimopoulos:
Improved Budgeted Connected Domination and Budgeted Edge-Vertex Domination. IWOCA 2020: 368-381 - [i5]Yicheng Xu, Vincent Chau, Chenchen Wu, Yong Zhang, Vassilis Zissimopoulos, Yifei Zou:
Too Much Information Kills Information: A Clustering Perspective. CoRR abs/2009.07417 (2020)
2010 – 2019
- 2019
- [i4]Ioannis Lamprou, Ioannis Sigalas, Vassilis Zissimopoulos:
Improved Budgeted Connected Domination and Budgeted Edge-Vertex Domination. CoRR abs/1907.06576 (2019) - 2018
- [c12]Ioannis Lamprou, Russell Martin, Sven Schewe
Maximum Rooted Connected Expansion. MFCS 2018: 25:1-25:14 - [i3]Ioannis Lamprou, Russell Martin, Sven Schewe, Ioannis Sigalas, Vassilis Zissimopoulos:
Maximum Rooted Connected Expansion. CoRR abs/1806.09549 (2018) - 2017
- [c11]Eric Angel, Evripidis Bampis
On the Complexity of Minimizing the Total Calibration Cost. FAW 2017: 1-12 - 2016
- [j24]Eric Angel, Evripidis Bampis, Alexander V. Kononov, Dimitris Paparas, Emmanouil Pountourakis, Vassilis Zissimopoulos:
Clustering on k-edge-colored graphs. Discret. Appl. Math. 211: 15-22 (2016) - [c10]Jean-Claude Bermond, Nathann Cohen, David Coudert, Dimitrios Letsios, Ioannis Milis, Stéphane Pérennes, Vassilis Zissimopoulos:
Bin Packing with Colocations. WAOA 2016: 40-51 - 2015
- [i2]Eric Angel, Evripidis Bampis, Vincent Chau, Vassilis Zissimopoulos:
Minimizing Total Calibration Cost. CoRR abs/1507.02808 (2015) - 2014
- [j23]Eric Angel, Evripidis Bampis
Optimal data placement on networks with a constant number of clients. Theor. Comput. Sci. 540: 82-88 (2014) - 2013
- [c9]Eric Angel, Evripidis Bampis, Alexander V. Kononov
Clustering on k-Edge-Colored Graphs. MFCS 2013: 50-61 - 2010
- [j22]Vangelis Th. Paschos, Orestis Telelis, Vassilis Zissimopoulos:
Probabilistic models for the Steiner Tree problem. Networks 56(1): 39-49 (2010) - [i1]Eric Angel, Evripidis Bampis, Gerasimos G. Pollatos, Vassilis Zissimopoulos:
Optimal Data Placement on Networks With Constant Number of Clients. CoRR abs/1004.4420 (2010)
2000 – 2009
- 2008
- [j21]Orestis Telelis, Vassilis Zissimopoulos:
Dynamic bottleneck optimization for k-edge and 2-vertex connectivity. Inf. Process. Lett. 106(6): 251-257 (2008) - [j20]Maria Liazi, Ioannis Milis, Vassilis Zissimopoulos:
A constant approximation algorithm for the densest k. Inf. Process. Lett. 108(1): 29-32 (2008) - [c8]Gerasimos G. Pollatos, Orestis Telelis, Vassilis Zissimopoulos:
On the Social Cost of Distributed Selfish Content Replication. Networking 2008: 195-206 - 2007
- [j19]Maria Liazi, Ioannis Milis, Fanny Pascual, Vassilis Zissimopoulos:
The densest k-subgraph problem on clique graphs. J. Comb. Optim. 14(4): 465-474 (2007) - [c7]Vangelis Th. Paschos, Orestis Telelis, Vassilis Zissimopoulos:
Steiner Forests on Stochastic Metric Graphs. COCOA 2007: 112-123 - 2006
- [j18]Nikolaos Laoutaris
Distributed Selfish Replication. IEEE Trans. Parallel Distributed Syst. 17(12): 1401-1413 (2006) - [c6]Gerasimos G. Pollatos, Orestis Telelis, Vassilis Zissimopoulos:
Updating Directed Minimum Cost Spanning Trees. WEA 2006: 291-302 - 2005
- [j17]Nikolaos Laoutaris
On the optimization of storage capacity allocation for content distribution. Comput. Networks 47(3): 409-428 (2005) - [j16]Orestis Telelis, Vassilis Zissimopoulos:
Absolute o(log m) error in approximating random set covering: an average case analysis. Inf. Process. Lett. 94(4): 171-177 (2005) - [c5]Nikolaos Laoutaris, Orestis Telelis, Vassilis Zissimopoulos, Ioannis Stavrakakis:
Local Utility Aware Content Replication. NETWORKING 2005: 455-468 - 2004
- [j15]Mhand Hifi, Vangelis Th. Paschos, Vassilis Zissimopoulos:
A simulated annealing approach for the circular cutting problem. Eur. J. Oper. Res. 159(2): 430-448 (2004) - [j14]Nikolaos Laoutaris
Joint object placement and node dimensioning for Internet content distribution. Inf. Process. Lett. 89(6): 273-279 (2004) - [c4]Nikolaos Laoutaris, Vassilis Zissimopoulos, Ioannis Stavrakakis:
Storage Capacity Allocation Algorithms for Hierarchical Content Distribution. Net-Con 2004: 179-191 - [c3]George Boukeas, Panagiotis Stamatopoulos, Constantinos Halatsis, Vassilis Zissimopoulos:
Inherent Choice in the Search Space of Constraint Satisfaction Problem Instances. SETN 2004: 362-370 - [c2]George Boukeas, Constantinos Halatsis, Vassilis Zissimopoulos, Panagiotis Stamatopoulos:
Measures of Intrinsic Hardness for Constraint Satisfaction Problem Instances. SOFSEM 2004: 184-195 - 2002
- [j13]Eric Angel, Vassilis Zissimopoulos:
On the Hardness of the Quadratic Assignment Problem with Metaheuristics. J. Heuristics 8(4): 399-414 (2002) - 2001
- [j12]Eric Angel, Vassilis Zissimopoulos:
On the landscape ruggedness of the quadratic assignment problem. Theor. Comput. Sci. 263(1-2): 159-172 (2001) - 2000
- [j11]Eric Angel, Vassilis Zissimopoulos:
On the Classification of NP-complete Problems in Terms of Their Correlation Coefficient. Discret. Appl. Math. 99(1-3): 261-277 (2000)
1990 – 1999
- 1999
- [j10]A. Le Gall, Vassilis Zissimopoulos:
Extended Hopfield models for combinatorial optimization. IEEE Trans. Neural Networks 10(1): 72-80 (1999) - 1998
- [j9]Eric Angel, Vassilis Zissimopoulos:
On the Quality of Local Search for the Quadratic Assignment Problem. Discret. Appl. Math. 82(1-3): 15-25 (1998) - [j8]Wenceslas Fernandez de la Vega, Vassilis Zissimopoulos:
An Approximation Scheme for Strip Packing of Rectangles with Bounded Dimensions. Discret. Appl. Math. 82(1-3): 93-101 (1998) - [j7]Didier Fayard, Mhand Hifi, Vassilis Zissimopoulos:
An efficient approach for large-scale two-dimensional guillotine cutting stock problems. J. Oper. Res. Soc. 49(12): 1270-1277 (1998) - [j6]Eric Angel, Vassilis Zissimopoulos:
Autocorrelation Coefficient for the Graph Bipartitioning Problem. Theor. Comput. Sci. 191(1-2): 229-243 (1998) - 1997
- [j5]Y. Kopidakis, M. Lamari, Vassilis Zissimopoulos:
On the Task Assignment Problem: Two New Efficient Heuristic Algorithms. J. Parallel Distributed Comput. 42(1): 21-29 (1997) - [j4]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): 265-273 (1997) - 1996
- [j3]A. Le Gall, Vassilis Zissimopoulos:
A Competitive Activation Neural Network Model for the Weighted Minimum Vertex Covering. Int. J. Neural Syst. 7(5): 607-616 (1996) - [c1]Y. Kopidakis, Didier Fayard, Vassilis Zissimopoulos:
Linear time approximation schemes for parallel processor scheduling. SPDP 1996: 482-485 - 1995
- [j2]Vassilis Zissimopoulos:
On the Performance Guarantee of Neural Networks for NP-Hard Optimization Problems. Inf. Process. Lett. 54(6): 317-322 (1995) - 1991
- [j1]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): 1413-1418 (1991)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-01 20:43 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: