Combinatorial Optimization through Statistical Instance-Based Learning. - Orestis Telelis; Panagiotis Stamatopoulos (ICTAI, 2001)

Guiding Constructive Search with Statistical Instance-Based Learning. - Orestis Telelis; Panagiotis Stamatopoulos (Int. J. Artif. Intell. Tools, 2002)

Local Utility Aware Content Replication. - Nikolaos Laoutaris; Orestis Telelis; Vassilis Zissimopoulos; Ioannis Stavrakakis (NETWORKING, 2005)

Absolute o(log m) error in approximating random set covering: an average case analysis. - Orestis Telelis; Vassilis Zissimopoulos (Inf. Process. Lett., 2005)

Updating Directed Minimum Cost Spanning Trees. - Gerasimos G. Pollatos; Orestis Telelis; Vassilis Zissimopoulos (WEA, 2006)

Distributed Selfish Replication. - Nikolaos Laoutaris; Orestis Telelis; Vassilis Zissimopoulos; Ioannis Stavrakakis (IEEE Trans. Parallel Distributed Syst., 2006)

Κάλυψη συνόλου και βελτιστοποίηση δικτύων: δυναμικοί και προσεγγιστικοί αλγόριθμοι - Orestis Telelis (2006)

Steiner Forests on Stochastic Metric Graphs. - Vangelis Th. Paschos; Orestis Telelis; Vassilis Zissimopoulos (COCOA, 2007)

On Labeled Traveling Salesman Problems. - Basile Couëtoux; Laurent Gourvès; Jérôme Monnot; Orestis Telelis (ISAAC, 2008)

On the Social Cost of Distributed Selfish Content Replication. - Gerasimos G. Pollatos; Orestis Telelis; Vassilis Zissimopoulos (Networking, 2008)

On Pure and (Approximate) Strong Equilibria of Facility Location Games. - Thomas Dueholm Hansen; Orestis Telelis (WINE, 2008)

Dynamic bottleneck optimization for k-edge and 2-vertex connectivity. - Orestis Telelis; Vassilis Zissimopoulos (Inf. Process. Lett., 2008)

Improved Bounds for Facility Location Games with Fair Cost Allocation. - Thomas Dueholm Hansen; Orestis Telelis (COCOA, 2009)

Selfish Scheduling with Setup Times. - Laurent Gourvès; Jérôme Monnot; Orestis Telelis (WINE, 2009)

On the Inefficiency of Equilibria in Linear Bottleneck Congestion Games. - Bart de Keijzer; Guido Schäfer; Orestis Telelis (SAGT, 2010)

Discrete Strategies in Keyword Auctions and Their Inefficiency for Locally Aware Bidders. - Evangelos Markakis; Orestis Telelis (WINE, 2010)

Labeled Traveling Salesman Problems: Complexity and approximation. - Basile Couëtoux; Laurent Gourvès; Jérôme Monnot; Orestis Telelis (Discret. Optim., 2010)

Probabilistic models for the Steiner Tree problem. - Vangelis Th. Paschos; Orestis Telelis; Vassilis Zissimopoulos (Networks, 2010)

Externalities among Advertisers in Sponsored Search. - Dimitris Fotakis 001; Piotr Krysta; Orestis Telelis (SAGT, 2011)

Limited Supply Online Auctions for Revenue Maximization. - Piotr Krysta; Orestis Telelis (WINE, 2012)

On the Inefficiency of the Uniform Price Auction - Evangelos Markakis; Orestis Telelis (CoRR, 2012)

Inefficiency of Standard Multi-unit Auctions. - Bart de Keijzer; Evangelos Markakis; Guido Schäfer; Orestis Telelis (ESA, 2013)

Near-Optimal Approximation Mechanisms for Multi-Unit Combinatorial Auctions. - Piotr Krysta; Orestis Telelis; Carmine Ventre (IJCAI, 2015)

User recruitment for mobile crowdsensing over opportunistic networks. - Merkourios Karaliopoulos; Orestis Telelis; Iordanis Koutsopoulos (INFOCOM, 2015)

Mechanisms for Multi-unit Combinatorial Auctions with a Few Distinct Goods. - Piotr Krysta; Orestis Telelis; Carmine Ventre (J. Artif. Intell. Res., 2015)

The Strong Price of Anarchy of Linear Bottleneck Congestion Games. - Bart de Keijzer; Guido Schäfer; Orestis Telelis (Theory Comput. Syst., 2015)

Uniform Price Auctions: Equilibria and Efficiency. - Evangelos Markakis; Orestis Telelis (Theory Comput. Syst., 2015)

Item Pricing for Combinatorial Public Projects. - Evangelos Markakis; Orestis Telelis (AAIM, 2016)

Envy-Free Revenue Approximation for Asymmetric Buyers with Budgets. - Evangelos Markakis; Orestis Telelis (SAGT, 2016)

Item bidding for combinatorial public projects. - Evangelos Markakis; Orestis Telelis (Theor. Comput. Sci., 2017)

Parallel and Distributed Processing of Reverse Top-k Queries. - Panagiotis Nikitopoulos; Georgios A. Sfyris; Akrivi Vlachou; Christos Doulkeridis; Orestis Telelis (ICDE, 2019)

Tight Welfare Guarantees for Pure Nash Equilibria of the Uniform Price Auction. - Georgios Birmpas; Evangelos Markakis; Orestis Telelis; Artem Tsikiridis (Theory Comput. Syst., 2019)

On Envy-Free Revenue Approximation for Combinatorial Buyers with Budgets. - Evangelos Markakis; Apostolos Ntokos; Orestis Telelis (Theory Comput. Syst., 2020)

Pruning techniques for parallel processing of reverse top-k queries. - Panagiotis Nikitopoulos; Georgios A. Sfyris; Akrivi Vlachou; Christos Doulkeridis; Orestis Telelis (Distributed Parallel Databases, 2021)