Orestis Telelis

640 total citations
18 papers, 326 citations indexed

About

Orestis Telelis is a scholar working on Management Science and Operations Research, Computer Networks and Communications and Economics and Econometrics. According to data from OpenAlex, Orestis Telelis has authored 18 papers receiving a total of 326 indexed citations (citations by other indexed papers that have themselves been cited), including 9 papers in Management Science and Operations Research, 8 papers in Computer Networks and Communications and 7 papers in Economics and Econometrics. Recurrent topics in Orestis Telelis's work include Auction Theory and Applications (8 papers), Game Theory and Voting Systems (6 papers) and Consumer Market Behavior and Pricing (6 papers). Orestis Telelis is often cited by papers focused on Auction Theory and Applications (8 papers), Game Theory and Voting Systems (6 papers) and Consumer Market Behavior and Pricing (6 papers). Orestis Telelis collaborates with scholars based in Greece, Netherlands and United Kingdom. Orestis Telelis's co-authors include Iordanis Koutsopoulos, Merkouris Karaliopoulos, V. Zissimopoulos, Ioannis Stavrakakis, Nikolaos Laoutaris, Piotr Krysta, Carmine Ventre, Panagiotis Stamatopoulos, Evangelos Markakis and Vassilis Zissimopoulos and has published in prestigious journals such as IEEE Transactions on Parallel and Distributed Systems, Theoretical Computer Science and Networks.

In The Last Decade

Orestis Telelis

16 papers receiving 314 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Orestis Telelis Greece	7	158	153	96	70	65	18	326
Teruyuki Hasegawa Japan	8	147 0.9×	191 1.2×	45 0.5×	104 1.5×	79 1.2×	42	358
Slawomir Goryczka United States	8	177 1.1×	35 0.2×	67 0.7×	55 0.8×	35 0.5×	11	385
Haoran Yu China	11	89 0.6×	128 0.8×	22 0.2×	114 1.6×	75 1.2×	33	323
Cen Chen China	11	102 0.6×	26 0.2×	62 0.6×	40 0.6×	30 0.5×	43	349
Karthik Abinav Sankararaman United States	9	27 0.2×	107 0.7×	36 0.4×	22 0.3×	84 1.3×	20	208
Andrei Tamilin Italy	11	65 0.4×	67 0.4×	59 0.6×	22 0.3×	35 0.5×	17	333
Haiqin Wu China	11	149 0.9×	92 0.6×	40 0.4×	47 0.7×	17 0.3×	37	370
Shaojing Fu China	10	75 0.5×	60 0.4×	18 0.2×	48 0.7×	8 0.1×	45	297
Akash Das Sarma United States	7	75 0.5×	187 1.2×	13 0.1×	5 0.1×	108 1.7×	12	393
Haitian Pang China	15	41 0.3×	345 2.3×	15 0.2×	115 1.6×	26 0.4×	31	506

Countries citing papers authored by Orestis Telelis

Since Specialization

Citations

This map shows the geographic impact of Orestis Telelis's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Orestis Telelis with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Orestis Telelis more than expected).

Fields of papers citing papers by Orestis Telelis

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Orestis Telelis. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Orestis Telelis. The network helps show where Orestis Telelis may publish in the future.

Co-authorship network of co-authors of Orestis Telelis

This figure shows the co-authorship network connecting the top 25 collaborators of Orestis Telelis. A scholar is included among the top collaborators of Orestis Telelis based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Orestis Telelis. Orestis Telelis is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

18 of 18 papers shown

Vlachou, Akrivi, et al.. (2020). Pruning techniques for parallel processing of reverse top-k queries. Distributed and Parallel Databases. 39(1). 169–199. 1 indexed citations

Markakis, Evangelos, et al.. (2020). On Envy-Free Revenue Approximation for Combinatorial Buyers with Budgets. Theory of Computing Systems. 64(8). 1338–1361.

Vlachou, Akrivi, et al.. (2019). Parallel and Distributed Processing of Reverse Top-k Queries. 1586–1589. 6 indexed citations

Birmpas, Georgios, et al.. (2018). Tight Welfare Guarantees for Pure Nash Equilibria of the Uniform Price Auction. Theory of Computing Systems. 63(7). 1451–1469. 1 indexed citations

Markakis, Evangelos & Orestis Telelis. (2017). Item bidding for combinatorial public projects. Theoretical Computer Science. 678. 40–55. 2 indexed citations

Krysta, Piotr, Orestis Telelis, & Carmine Ventre. (2015). Near-optimal approximation mechanisms for multi-unit combinatorial auctions. International Conference on Artificial Intelligence. 4275–4281. 1 indexed citations

Karaliopoulos, Merkouris, Orestis Telelis, & Iordanis Koutsopoulos. (2015). User recruitment for mobile crowdsensing over opportunistic networks. 170 indexed citations

Krysta, Piotr, Orestis Telelis, & Carmine Ventre. (2015). Mechanisms for Multi-unit Combinatorial Auctions with a Few Distinct Goods. Journal of Artificial Intelligence Research. 53. 721–744. 11 indexed citations

Keijzer, Bart de, Guido Schäfer, & Orestis Telelis. (2014). The Strong Price of Anarchy of Linear Bottleneck Congestion Games. Theory of Computing Systems. 57(2). 377–396. 1 indexed citations

10.

Markakis, Evangelos & Orestis Telelis. (2014). Uniform Price Auctions: Equilibria and Efficiency. Theory of Computing Systems. 57(3). 549–575. 7 indexed citations

11.

Krysta, Piotr, Orestis Telelis, & Carmine Ventre. (2013). Mechanisms for multi-unit combinatorial auctions with a few distinct goods. Adaptive Agents and Multi-Agents Systems. 691–698. 14 indexed citations

12.

Keijzer, Bart de, Guido Schäfer, & Orestis Telelis. (2010). On the inefficiency of equilibria in linear bottleneck congestion games. 335–346. 1 indexed citations

13.

Gourvès, Laurent, et al.. (2010). Labeled Traveling Salesman Problems: Complexity and approximation. Discrete Optimization. 7(1-2). 74–85. 6 indexed citations

14.

Paschos, Vangélis Th., Orestis Telelis, & Vassilis Zissimopoulos. (2009). Probabilistic models for the Steiner Tree problem. Networks. 56(1). 39–49. 4 indexed citations

15.

Laoutaris, Nikolaos, Orestis Telelis, V. Zissimopoulos, & Ioannis Stavrakakis. (2006). Distributed Selfish Replication. IEEE Transactions on Parallel and Distributed Systems. 17(12). 1401–1413. 82 indexed citations

16.

Telelis, Orestis & Vassilis Zissimopoulos. (2005). Absolute error in approximating random set covering: an average case analysis. Information Processing Letters. 94(4). 171–177. 5 indexed citations

17.

Telelis, Orestis & Panagiotis Stamatopoulos. (2002). GUIDING CONSTRUCTIVE SEARCH WITH STATISTICAL INSTANCE-BASE LEARNING. International Journal of Artificial Intelligence Tools. 11(2). 247–266. 3 indexed citations

18.

Telelis, Orestis & Panagiotis Stamatopoulos. (2002). Combinatorial optimization through statistical instance-based learning. 4. 203–209. 11 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact