Esteban Feuerstein

711 total citations
20 papers, 279 citations indexed

About

Esteban Feuerstein is a scholar working on Computer Networks and Communications, Industrial and Manufacturing Engineering and Artificial Intelligence. According to data from OpenAlex, Esteban Feuerstein has authored 20 papers receiving a total of 279 indexed citations (citations by other indexed papers that have themselves been cited), including 14 papers in Computer Networks and Communications, 6 papers in Industrial and Manufacturing Engineering and 5 papers in Artificial Intelligence. Recurrent topics in Esteban Feuerstein's work include Optimization and Search Problems (11 papers), Scheduling and Optimization Algorithms (4 papers) and Auction Theory and Applications (4 papers). Esteban Feuerstein is often cited by papers focused on Optimization and Search Problems (11 papers), Scheduling and Optimization Algorithms (4 papers) and Auction Theory and Applications (4 papers). Esteban Feuerstein collaborates with scholars based in Argentina, Italy and Netherlands. Esteban Feuerstein's co-authors include Leen Stougie, Stefano Leonardi, Giorgio Ausiello, Maurizio Talamo, Alberto Marchetti-Spaccamela, Y. Bartal, Alon Rosen, Yossi Azar, Amos Fiat and Ricardo Baeza‐Yates and has published in prestigious journals such as SHILAP Revista de lepidopterología, IEEE Transactions on Knowledge and Data Engineering and Theoretical Computer Science.

In The Last Decade

Esteban Feuerstein

16 papers receiving 255 citations

Peers

Esteban Feuerstein
David Bergman United States
Monique Calisti Switzerland
N. R. Achuthan Australia
David Bergman United States
Esteban Feuerstein
Citations per year, relative to Esteban Feuerstein Esteban Feuerstein (= 1×) peers David Bergman

Countries citing papers authored by Esteban Feuerstein

Since Specialization
Citations

This map shows the geographic impact of Esteban Feuerstein'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 Esteban Feuerstein with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Esteban Feuerstein more than expected).

Fields of papers citing papers by Esteban Feuerstein

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Esteban Feuerstein. 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 Esteban Feuerstein. The network helps show where Esteban Feuerstein may publish in the future.

Co-authorship network of co-authors of Esteban Feuerstein

This figure shows the co-authorship network connecting the top 25 collaborators of Esteban Feuerstein. A scholar is included among the top collaborators of Esteban Feuerstein 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 Esteban Feuerstein. Esteban Feuerstein is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
2.
Feuerstein, Esteban, et al.. (2021). Community pooling: LDA topic modeling in Twitter. 2 indexed citations
4.
Feuerstein, Esteban, et al.. (2017). Performance improvements for search systems using an integrated cache of lists + intersections. Information Retrieval. 20(3). 172–198. 6 indexed citations
5.
Feuerstein, Esteban, Alberto Marchetti-Spaccamela, René Sitters, et al.. (2016). Minimizing worst-case and average-case makespan over scenarios. Journal of Scheduling. 20(6). 545–555. 5 indexed citations
6.
Feuerstein, Esteban, et al.. (2016). New algorithms for composite retrieval. 1–9.
7.
Feuerstein, Esteban, et al.. (2014). Cost-aware Intersection Caching and Processing Strategies for In-memory Inverted Indexes. 3 indexed citations
8.
Amer-Yahia, Sihem, Francesco Bonchi, Carlos Castillo, et al.. (2014). Composite Retrieval of Diverse and Complementary Bundles. IEEE Transactions on Knowledge and Data Engineering. 26(11). 2662–2675. 20 indexed citations
9.
Feuerstein, Esteban, et al.. (2013). Analysis of Cost-Aware Policies for Intersection Caching in Search Nodes. 4–7. 2 indexed citations
10.
Feuerstein, Esteban, et al.. (2008). Truthful Stochastic and Deterministic Auctions for Sponsored Search. 86. 39–48.
11.
Feuerstein, Esteban, et al.. (2007). New Stochastic Algorithms for Scheduling Ads in Sponsored Search. 22–31. 6 indexed citations
12.
Feuerstein, Esteban, et al.. (2007). New Stochastic Algorithms for Scheduling Ads in Sponsored Search. 22–31. 4 indexed citations
13.
Feuerstein, Esteban, et al.. (2003). On-line Multi-threaded Scheduling. Journal of Scheduling. 6(2). 167–181. 1 indexed citations
14.
Feuerstein, Esteban & Leen Stougie. (2001). On-line single-server dial-a-ride problems. Theoretical Computer Science. 268(1). 91–105. 87 indexed citations
15.
Ausiello, Giorgio, Esteban Feuerstein, Stefano Leonardi, Leen Stougie, & Maurizio Talamo. (2001). Algorithms for the On-Line Travelling Salesman1. Algorithmica. 29(4). 560–581. 87 indexed citations
16.
Azar, Yossi, Y. Bartal, Esteban Feuerstein, et al.. (1999). On Capital Investment. Algorithmica. 25(1). 22–36. 30 indexed citations
17.
Feuerstein, Esteban, Stefano Leonardi, Alberto Marchetti-Spaccamela, & Nicola Santoro. (1998). Efficient token-based control in rings. Information Processing Letters. 66(4). 175–180. 3 indexed citations
18.
Feuerstein, Esteban & Alberto Marchetti-Spaccamela. (1998). Memory Paging for Connectivity and Path Problems in Graphs. Journal of Graph Algorithms and Applications. 2(6). 1–22.
19.
Feuerstein, Esteban. (1997). Paging more than one page. Theoretical Computer Science. 181(1). 75–90. 2 indexed citations
20.
Feuerstein, Esteban & Alberto Marchetti-Spaccamela. (1993). Dynamic algorithms for shortest paths in planar graphs. Theoretical Computer Science. 116(2). 359–371. 20 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

Rankless by CCL
2026