default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOrestis Telelis
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j13]Panagiotis Nikitopoulos, Georgios A. Sfyris, Akrivi Vlachou, Christos Doulkeridis, Orestis Telelis:
Pruning techniques for parallel processing of reverse top-k queries. Distributed Parallel Databases 39(1): 169-199 (2021)- 2020
- [j12]Evangelos Markakis, Apostolos Ntokos, Orestis Telelis:
On Envy-Free Revenue Approximation for Combinatorial Buyers with Budgets. Theory Comput. Syst. 64(8): 1338-1361 (2020)
2010 – 2019
- 2019
- [j11]Georgios Birmpas, Evangelos Markakis, Orestis Telelis
, Artem Tsikiridis:
Tight Welfare Guarantees for Pure Nash Equilibria of the Uniform Price Auction. Theory Comput. Syst. 63(7): 1451-1469 (2019) - [c23]Panagiotis Nikitopoulos, Georgios A. Sfyris, Akrivi Vlachou, Christos Doulkeridis, Orestis Telelis:
Parallel and Distributed Processing of Reverse Top-k Queries. ICDE 2019: 1586-1589 - 2017
- [j10]Evangelos Markakis, Orestis Telelis:
Item bidding for combinatorial public projects. Theor. Comput. Sci. 678: 40-55 (2017) - [c22]Georgios Birmpas, Evangelos Markakis, Orestis Telelis, Artem Tsikiridis:
Tight Welfare Guarantees for Pure Nash Equilibria of the Uniform Price Auction. SAGT 2017: 16-28 - 2016
- [c21]Evangelos Markakis, Orestis Telelis:
Item Pricing for Combinatorial Public Projects. AAIM 2016: 1-13 - [c20]Evangelos Markakis, Orestis Telelis:
Envy-Free Revenue Approximation for Asymmetric Buyers with Budgets. SAGT 2016: 247-259 - 2015
- [j9]Piotr Krysta, Orestis Telelis, Carmine Ventre:
Mechanisms for Multi-unit Combinatorial Auctions with a Few Distinct Goods. J. Artif. Intell. Res. 53: 721-744 (2015) - [j8]Bart de Keijzer, Guido Schäfer, Orestis Telelis:
The Strong Price of Anarchy of Linear Bottleneck Congestion Games. Theory Comput. Syst. 57(2): 377-396 (2015) - [j7]Evangelos Markakis, Orestis Telelis:
Uniform Price Auctions: Equilibria and Efficiency. Theory Comput. Syst. 57(3): 549-575 (2015) - [c19]Piotr Krysta, Orestis Telelis, Carmine Ventre:
Near-Optimal Approximation Mechanisms for Multi-Unit Combinatorial Auctions. IJCAI 2015: 4275-4281 - [c18]Merkourios Karaliopoulos, Orestis Telelis, Iordanis Koutsopoulos:
User recruitment for mobile crowdsensing over opportunistic networks. INFOCOM 2015: 2254-2262 - 2014
- [c17]Evangelos Markakis, Orestis Telelis:
Item Bidding for Combinatorial Public Projects. AAAI 2014: 749-755 - 2013
- [c16]Piotr Krysta, Orestis Telelis, Carmine Ventre:
Mechanisms for multi-unit combinatorial auctions with a few distinct goods. AAMAS 2013: 691-698 - [c15]Bart de Keijzer, Evangelos Markakis, Guido Schäfer, Orestis Telelis:
Inefficiency of Standard Multi-unit Auctions. ESA 2013: 385-396 - [i3]Bart de Keijzer, Evangelos Markakis, Guido Schäfer, Orestis Telelis:
On the Inefficiency of Standard Multi-Unit Auctions. CoRR abs/1303.1646 (2013) - 2012
- [c14]Evangelos Markakis, Orestis Telelis:
Uniform Price Auctions: Equilibria and Efficiency. SAGT 2012: 227-238 - [c13]Piotr Krysta, Orestis Telelis:
Limited Supply Online Auctions for Revenue Maximization. WINE 2012: 519-525 - [i2]Evangelos Markakis, Orestis Telelis:
On the Inefficiency of the Uniform Price Auction. CoRR abs/1211.1860 (2012) - 2011
- [c12]Dimitris Fotakis, Piotr Krysta, Orestis Telelis:
Externalities among Advertisers in Sponsored Search. SAGT 2011: 105-116 - 2010
- [j6]Basile Couëtoux, Laurent Gourvès, Jérôme Monnot, Orestis Telelis:
Labeled Traveling Salesman Problems: Complexity and approximation. Discret. Optim. 7(1-2): 74-85 (2010) - [j5]Vangelis Th. Paschos, Orestis Telelis, Vassilis Zissimopoulos:
Probabilistic models for the Steiner Tree problem. Networks 56(1): 39-49 (2010) - [c11]Bart de Keijzer, Guido Schäfer, Orestis Telelis:
On the Inefficiency of Equilibria in Linear Bottleneck Congestion Games. SAGT 2010: 335-346 - [c10]Evangelos Markakis, Orestis Telelis:
Discrete Strategies in Keyword Auctions and Their Inefficiency for Locally Aware Bidders. WINE 2010: 523-530
2000 – 2009
- 2009
- [c9]Thomas Dueholm Hansen, Orestis Telelis:
Improved Bounds for Facility Location Games with Fair Cost Allocation. COCOA 2009: 174-185 - [c8]Laurent Gourvès, Jérôme Monnot, Orestis Telelis:
Selfish Scheduling with Setup Times. WINE 2009: 292-303 - 2008
- [j4]Orestis Telelis, Vassilis Zissimopoulos:
Dynamic bottleneck optimization for k-edge and 2-vertex connectivity. Inf. Process. Lett. 106(6): 251-257 (2008) - [c7]Basile Couëtoux, Laurent Gourvès, Jérôme Monnot, Orestis Telelis:
On Labeled Traveling Salesman Problems. ISAAC 2008: 776-787 - [c6]Gerasimos G. Pollatos, Orestis Telelis, Vassilis Zissimopoulos:
On the Social Cost of Distributed Selfish Content Replication. Networking 2008: 195-206 - [c5]Thomas Dueholm Hansen, Orestis Telelis:
On Pure and (Approximate) Strong Equilibria of Facility Location Games. WINE 2008: 490-497 - [i1]Thomas Dueholm Hansen, Orestis Telelis:
On Pure and (approximate) Strong Equilibria of Facility Location Games. CoRR abs/0809.4792 (2008) - 2007
- [c4]Vangelis Th. Paschos, Orestis Telelis, Vassilis Zissimopoulos:
Steiner Forests on Stochastic Metric Graphs. COCOA 2007: 112-123 - 2006
- [b1]Orestis Telelis:
Κάλυψη συνόλου και βελτιστοποίηση δικτύων: δυναμικοί και προσεγγιστικοί αλγόριθμοι. National and Kapodistrian University of Athens, Greece, 2006 - [j3]Nikolaos Laoutaris, Orestis Telelis, Vassilis Zissimopoulos, Ioannis Stavrakakis:
Distributed Selfish Replication. IEEE Trans. Parallel Distributed Syst. 17(12): 1401-1413 (2006) - [c3]Gerasimos G. Pollatos, Orestis Telelis, Vassilis Zissimopoulos:
Updating Directed Minimum Cost Spanning Trees. WEA 2006: 291-302 - 2005
- [j2]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) - [c2]Nikolaos Laoutaris, Orestis Telelis, Vassilis Zissimopoulos, Ioannis Stavrakakis:
Local Utility Aware Content Replication. NETWORKING 2005: 455-468 - 2002
- [j1]Orestis Telelis, Panagiotis Stamatopoulos:
Guiding Constructive Search with Statistical Instance-Based Learning. Int. J. Artif. Intell. Tools 11(2): 247-266 (2002) - 2001
- [c1]Orestis Telelis, Panagiotis Stamatopoulos:
Combinatorial Optimization through Statistical Instance-Based Learning. ICTAI 2001: 203-209
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-04-26 17:40 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:
