Alina Ene

1.3k total citations
37 papers, 496 citations indexed

About

Alina Ene is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Artificial Intelligence. According to data from OpenAlex, Alina Ene has authored 37 papers receiving a total of 496 indexed citations (citations by other indexed papers that have themselves been cited), including 30 papers in Computational Theory and Mathematics, 18 papers in Computer Networks and Communications and 13 papers in Artificial Intelligence. Recurrent topics in Alina Ene's work include Complexity and Algorithms in Graphs (29 papers), Optimization and Search Problems (18 papers) and Advanced Graph Theory Research (14 papers). Alina Ene is often cited by papers focused on Complexity and Algorithms in Graphs (29 papers), Optimization and Search Problems (18 papers) and Advanced Graph Theory Research (14 papers). Alina Ene collaborates with scholars based in United States, United Kingdom and Portugal. Alina Ene's co-authors include Sungjin Im, Benjamin Moseley, Huy L. Nguyên, William Horne, Robert Schreiber, Prasad Rao, Nikola Milosavljević, Robert E. Tarjan, Chandra Chekuri and Justin Ward and has published in prestigious journals such as Mathematical Programming, SIAM Journal on Computing and Mathematics of Operations Research.

In The Last Decade

Alina Ene

34 papers receiving 462 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Alina Ene United States	11	292	171	155	111	92	37	496
Matti Järvisalo Finland	17	676 2.3×	257 1.5×	197 1.3×	30 0.3×	74 0.8×	99	874
Gem Stapleton United Kingdom	14	331 1.1×	102 0.6×	151 1.0×	23 0.2×	51 0.6×	87	605
Edward L. Robertson United States	11	196 0.7×	211 1.2×	151 1.0×	22 0.2×	87 0.9×	45	516
John Howse United Kingdom	16	412 1.4×	104 0.6×	220 1.4×	20 0.2×	102 1.1×	74	707
Corin R. Anderson United States	10	311 1.1×	29 0.2×	148 1.0×	56 0.5×	247 2.7×	15	655
Andrew Fish United Kingdom	12	187 0.6×	46 0.3×	138 0.9×	24 0.2×	110 1.2×	68	440
Bharath K. Samanthula United States	10	521 1.8×	65 0.4×	96 0.6×	34 0.3×	232 2.5×	45	649
D. Hughes United Kingdom	12	207 0.7×	41 0.2×	300 1.9×	87 0.8×	81 0.9×	32	713
Stephen Alstrup Denmark	14	281 1.0×	300 1.8×	194 1.3×	16 0.1×	34 0.4×	43	604
Yuanlin Zhang United States	12	363 1.2×	54 0.3×	149 1.0×	26 0.2×	50 0.5×	39	523

Countries citing papers authored by Alina Ene

Since Specialization

Citations

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

Fields of papers citing papers by Alina Ene

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Alina Ene

This figure shows the co-authorship network connecting the top 25 collaborators of Alina Ene. A scholar is included among the top collaborators of Alina Ene 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 Alina Ene. Alina Ene 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:

20 of 20 papers shown

Ene, Alina, et al.. (2021). An Efficient Framework for Balancing Submodularity and Cost. 1256–1266. 13 indexed citations

Ene, Alina, et al.. (2020). Optimal Streaming Algorithms for Submodular Maximization with Cardinality Constraints. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 4 indexed citations

Ene, Alina. (2020). A note on maximizing the difference between a monotone submodular function and a linear function.. arXiv (Cornell University). 2 indexed citations

Ene, Alina & Huy L. Nguyên. (2019). Submodular maximization with nearly-optimal approximation and adaptivity in nearly-linear time. arXiv (Cornell University). 274–282. 10 indexed citations

Ene, Alina & Huy L. Nguyên. (2018). Towards Nearly-linear Time Algorithms for Submodular Maximization with a\n Matroid Constraint. arXiv (Cornell University). 1 indexed citations

Ene, Alina, Huy L. Nguyên, & Adrian Vladu. (2018). Submodular Maximization with Packing Constraints in Parallel.. arXiv (Cornell University).

Chakrabarty, Deeparnab, Alina Ene, Ravishankar Krishnaswamy, & Debmalya Panigrahi. (2018). Online Buy-at-Bulk Network Design. SIAM Journal on Computing. 47(4). 1505–1528. 1 indexed citations

Ene, Alina, Viswanath Nagarajan, & Rishi Saket. (2018). Approximation Algorithms for Stochastic k-TSP. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 1 indexed citations

Ene, Alina, et al.. (2018). Mining Tours and Paths in Activity Networks. 459–468. 3 indexed citations

10.

Ene, Alina & Huy L. Nguyên. (2017). A Nearly-linear Time Algorithm for Submodular Maximization with a\n Knapsack Constraint. arXiv (Cornell University). 11 indexed citations

11.

Ene, Alina, et al.. (2016). A New Framework for Distributed Submodular Maximization. Infoscience (Ecole Polytechnique Fédérale de Lausanne). 23 indexed citations

12.

Ene, Alina, Matthias Mnich, Marcin Pilipczuk, & Andrej Risteski. (2016). On Routing Disjoint Paths in Bounded Treewidth Graphs. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 53. 15. 1 indexed citations

13.

Ene, Alina, Gary L. Miller, Jakub Pachocki, & Aaron Sidford. (2016). Routing under balance. 598–611. 2 indexed citations

14.

Ene, Alina, et al.. (2015). The Power of Randomization: Distributed Submodular Maximization on Massive Datasets. Warwick Research Archive Portal (University of Warwick). 1236–1244. 18 indexed citations

15.

Ene, Alina & Huy L. Nguyên. (2015). Random Coordinate Descent Methods for Minimizing Decomposable Submodular Functions. arXiv (Cornell University). 787–795. 4 indexed citations

16.

Ene, Alina & Ali Vakilian. (2014). Improved approximation algorithms for degree-bounded network design problems with node connectivity requirements. 754–763. 5 indexed citations

17.

Ene, Alina, Jan Vondrák, & Yi Wu. (2013). Local distribution and the symmetry gap: approximability of multiway partitioning problems. Symposium on Discrete Algorithms. 306–325. 14 indexed citations

18.

Ene, Alina, et al.. (2012). Geometric packing under non-uniform constraints. 11–20. 9 indexed citations

19.

Chekuri, Chandra & Alina Ene. (2011). Approximation Algorithms for Submodular Multiway Partition. 807–816. 21 indexed citations

20.

Ene, Alina, et al.. (2011). Prize-collecting Steiner Problems on Planar Graphs. 1028–1049. 10 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