Alantha Newman

1.2k total citations
17 papers, 497 citations indexed

About

Alantha Newman is a scholar working on Computational Theory and Mathematics, Industrial and Manufacturing Engineering and Computer Networks and Communications. According to data from OpenAlex, Alantha Newman has authored 17 papers receiving a total of 497 indexed citations (citations by other indexed papers that have themselves been cited), including 11 papers in Computational Theory and Mathematics, 5 papers in Industrial and Manufacturing Engineering and 4 papers in Computer Networks and Communications. Recurrent topics in Alantha Newman's work include Advanced Graph Theory Research (8 papers), Complexity and Algorithms in Graphs (8 papers) and Vehicle Routing Optimization Methods (5 papers). Alantha Newman is often cited by papers focused on Advanced Graph Theory Research (8 papers), Complexity and Algorithms in Graphs (8 papers) and Vehicle Routing Optimization Methods (5 papers). Alantha Newman collaborates with scholars based in France, United States and Germany. Alantha Newman's co-authors include Moses Charikar, Nir Ailon, Berthold Vöcking, Heiko Röglin, Aleksander Mądry, R. Ravi, Stéphan Thomassé, Euiwoong Lee, Ola Svensson and Vincent Cohen-Addad and has published in prestigious journals such as Journal of the ACM, International Journal of Production Research and Mathematical Programming.

In The Last Decade

Alantha Newman

14 papers receiving 462 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Alantha Newman France 5 232 144 112 109 87 17 497
Pranjal Awasthi United States 14 274 1.2× 61 0.4× 52 0.5× 51 0.5× 62 0.7× 46 438
Brijnesh J. Jain Germany 13 206 0.9× 72 0.5× 110 1.0× 47 0.4× 22 0.3× 44 442
Takanori Maehara Japan 15 298 1.3× 68 0.5× 68 0.6× 44 0.4× 92 1.1× 49 535
Elitza Maneva United States 10 120 0.5× 143 1.0× 45 0.4× 190 1.7× 450 5.2× 16 718
Giuseppe Persiano Italy 14 422 1.8× 168 1.2× 16 0.1× 89 0.8× 147 1.7× 71 604
Alexander Ivrii United States 9 268 1.2× 113 0.8× 26 0.2× 39 0.4× 49 0.6× 21 477
Dina Goldin United States 14 188 0.8× 146 1.0× 107 1.0× 29 0.3× 228 2.6× 38 547
Richard Spillman United States 9 300 1.3× 116 0.8× 47 0.4× 254 2.3× 42 0.5× 21 532
Brian Milch United States 12 687 3.0× 31 0.2× 116 1.0× 280 2.6× 137 1.6× 19 924
Chinmay Karande United States 9 104 0.4× 118 0.8× 30 0.3× 143 1.3× 214 2.5× 11 421

Countries citing papers authored by Alantha Newman

Since Specialization
Citations

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

Fields of papers citing papers by Alantha Newman

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Alantha Newman

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

All Works

17 of 17 papers shown
1.
Newman, Alantha, et al.. (2024). Bounding the Chromatic Number of Dense Digraphs by Arc Neighborhoods. COMBINATORICA. 44(4). 881–895.
2.
Cohen-Addad, Vincent, Euiwoong Lee, Shi Li, & Alantha Newman. (2023). Handling Correlated Rounding Error via Preclustering: A 1.73-approximation for Correlation Clustering. SPIRE - Sciences Po Institutional REpository. 1082–1104.
3.
Newman, Alantha, et al.. (2022). Towards improving Christofides algorithm on fundamental classes by gluing convex combinations of tours. Mathematical Programming. 198(1). 595–620. 1 indexed citations
4.
Cohen-Addad, Vincent, Euiwoong Lee, & Alantha Newman. (2022). Correlation Clustering with Sherali-Adams. 651–661. 2 indexed citations
5.
Newman, Alantha, et al.. (2022). A decision aid algorithm for long-haul parcel transportation based on hierarchical network structure. International Journal of Production Research. 61(21). 7198–7212.
6.
Newman, Alantha, et al.. (2021). Efficient constructions of convex combinations for 2-edge-connected subgraphs on fundamental classes. Discrete Optimization. 42. 100659–100659. 2 indexed citations
7.
Newman, Alantha. (2020). An Improved Analysis of the Mömke--Svensson Algorithm for Graph-TSP on Subquartic Graphs (Journal Version). HAL (Le Centre pour la Communication Scientifique Directe). 1 indexed citations
8.
Newman, Alantha, et al.. (2019). Shorter tours and longer detours: uniform covers and a bit beyond. Mathematical Programming. 185(1-2). 245–273. 4 indexed citations
9.
Newman, Alantha, et al.. (2018). Polynomial-time algorithms for 2-edge-connected subgraphs on fundamental classes by top-down coloring.. arXiv (Cornell University). 1 indexed citations
10.
Newman, Alantha, et al.. (2018). Domination and Fractional Domination in Digraphs. The Electronic Journal of Combinatorics. 25(3). 3 indexed citations
11.
Mądry, Aleksander, et al.. (2015). On the configuration LP for maximum budgeted allocation. Mathematical Programming. 154(1-2). 427–462. 3 indexed citations
12.
Newman, Alantha. (2014). An Improved Analysis of the Mömke--Svensson Algorithm for Graph-TSP on Subquartic Graphs. SIAM Journal on Discrete Mathematics. 34(1). 737–749. 1 indexed citations
13.
Ailon, Nir, Moses Charikar, & Alantha Newman. (2008). Aggregating inconsistent information. Journal of the ACM. 55(5). 1–27. 311 indexed citations
14.
Newman, Alantha, et al.. (2007). Decision-making based on approximate and smoothed Pareto curves. Theoretical Computer Science. 378(3). 253–270. 16 indexed citations
15.
Newman, Alantha, et al.. (2006). Traveling salesman path problems. Mathematical Programming. 113(1). 39–59. 27 indexed citations
16.
Ailon, Nir, Moses Charikar, & Alantha Newman. (2005). Aggregating inconsistent information. 684–693. 103 indexed citations
17.
Newman, Alantha. (2002). A new algorithm for protein folding in the HP model. Symposium on Discrete Algorithms. 876–884. 22 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