
Search the dblp DataBase
Orestis Telelis:
[Publications]
[Author Rank by year]
[Coauthors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
 Orestis Telelis, Panagiotis Stamatopoulos
Combinatorial Optimization through Statistical InstanceBased Learning. [Citation Graph (0, 0)][DBLP] ICTAI, 2001, pp:203209 [Conf]
 Nikolaos Laoutaris, Orestis Telelis, Vassilis Zissimopoulos, Ioannis Stavrakakis
Local Utility Aware Content Replication. [Citation Graph (0, 0)][DBLP] NETWORKING, 2005, pp:455468 [Conf]
 Gerasimos G. Pollatos, Orestis Telelis, Vassilis Zissimopoulos
Updating Directed Minimum Cost Spanning Trees. [Citation Graph (0, 0)][DBLP] WEA, 2006, pp:291302 [Conf]
 Orestis Telelis, Panagiotis Stamatopoulos
Guiding Constructive Search with Statistical InstanceBased Learning. [Citation Graph (0, 0)][DBLP] International Journal on Artificial Intelligence Tools, 2002, v:11, n:2, pp:247266 [Journal]
 Orestis Telelis, Vassilis Zissimopoulos
Absolute o(log m) error in approximating random set covering: an average case analysis. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2005, v:94, n:4, pp:171177 [Journal]
 Nikolaos Laoutaris, Orestis Telelis, Vassilis Zissimopoulos, Ioannis Stavrakakis
Distributed Selfish Replication. [Citation Graph (0, 0)][DBLP] IEEE Trans. Parallel Distrib. Syst., 2006, v:17, n:12, pp:14011413 [Journal]
 Vangelis Th. Paschos, Orestis Telelis, Vassilis Zissimopoulos
Steiner Forests on Stochastic Metric Graphs. [Citation Graph (0, 0)][DBLP] COCOA, 2007, pp:112123 [Conf]
On Labeled Traveling Salesman Problems. [Citation Graph (, )][DBLP]
On the Social Cost of Distributed Selfish Content Replication. [Citation Graph (, )][DBLP]
Selfish Scheduling with Setup Times. [Citation Graph (, )][DBLP]
On Pure and (Approximate) Strong Equilibria of Facility Location Games. [Citation Graph (, )][DBLP]
Improved Bounds for Facility Location Games with Fair Cost Allocation. [Citation Graph (, )][DBLP]
On Pure and (approximate) Strong Equilibria of Facility Location Games [Citation Graph (, )][DBLP]
Search in 0.005secs, Finished in 0.006secs
