- Dynamic Bottleneck Optimization for k-Edge and 2-Vertex Connectivity
- Statistics & Pro bability Letters 61 (2003) 163 --175
- The antennas preassignment problem Stratos A. Paschos a
- Journal of Heuristics, 8: 399--414, 2002 # 2002 Kluwer Academic Publishers. Manufactured in The Netherlands.
- Theoretical Computer Science 263 (2001) 159--172 www.el sevier.com/l ocate/tcs
- On the Optimization of Storage Capacity Allocation for Content Distribution #
- ONLINE MAXIMUM INDEPENDENT SET IN CHORDAL George CHRISTODOULOU # , Vassilis ZISSIMOPOULOS #
- Discrete Optimization A simulated annealing approach
- The antennas preassignment problem Stratos A. Paschos a , Vangelis Th. Paschos b, * , Vassilis Zissimopoulos c
- 72 IEEE TRANSACTIONS ON NEURAL NETWORKS, VOL. 10, NO. 1, JANUARY 1999 Extended Hopfield Models for
- ARTICLE IN PRESS S00200190(03)005 374/SCO AID:3014 Vol....(...) P.1 (17)
- Updating Directed Minimum Cost Spanning Trees
- The densest k-subgraph problem on clique graphs , I. Milis2
- On the Optimization of Storage Capacity Allocation for Content Distribution
- ARTICLE IN PRESS S0020-0190(03)00537-4/SCO AID:3014 Vol.() P.1 (1-7)
- Discrete Optimization A simulated annealing approach
- Statistics & Probability Letters 61 (2003) 163175 Evaluation of reliability bounds by set covering models
- 72 IEEE TRANSACTIONS ON NEURAL NETWORKS, VOL. 10, NO. 1, JANUARY 1999 Extended Hopfield Models for
- JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING 42, 2129 (1997) ARTICLE NO. PC971311
- ELSEVIER EuropeanJournalof OperationalResearch91 (1996) 553-564 OF OPERATIONAL
- ELSEVIER European Journal of Operational Research 84(1995)618-632 OF OPERATIONAL
- Steiner Forests on Stochastic Metric Graphs Vangelis Th. Paschos
- Local Utility Aware Content Replication Nikolaos Laoutaris, Orestis Telelis, Vassilios Zissimopoulos, and Ioannis Stavrakakis
- Dynamic Bottleneck Optimization for 2-Vertex and Strong Connectivity
- Information Processing Letters 94 (2005) 171177 www.elsevier.com/locate/ipl
- A constant approximation algorithm for the densest k-subgraph problem
- On the Social Cost of Distributed Selfish Content Replication
- BBElSEVlEK Discrete Applied Mathematlcs 82 (199X)93 101 MATHEMATICS
- ELSEVIER Theoretical Computer Science I78 (1997) 265-273 Theoretical
- JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING 42, 21--29 (1997) ARTICLE NO. PC971311
