Ilan Newman

3.1k total citations
86 papers, 1.4k citations indexed

About

Ilan Newman is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Computer Networks and Communications. According to data from OpenAlex, Ilan Newman has authored 86 papers receiving a total of 1.4k indexed citations (citations by other indexed papers that have themselves been cited), including 67 papers in Computational Theory and Mathematics, 37 papers in Artificial Intelligence and 27 papers in Computer Networks and Communications. Recurrent topics in Ilan Newman's work include Complexity and Algorithms in Graphs (51 papers), Advanced Graph Theory Research (31 papers) and Machine Learning and Algorithms (26 papers). Ilan Newman is often cited by papers focused on Complexity and Algorithms in Graphs (51 papers), Advanced Graph Theory Research (31 papers) and Machine Learning and Algorithms (26 papers). Ilan Newman collaborates with scholars based in Israel, United States and Germany. Ilan Newman's co-authors include Eldar Fischer, Yuri Rabinovich, Noga Alon, Márió Szegedy, Avi Wigderson, Alistair Sinclair, A. Shapira, Oren Ben-Zwi, Michael Krivelevich and Christian Sohler and has published in prestigious journals such as IEEE Transactions on Pattern Analysis and Machine Intelligence, SIAM Journal on Computing and IEEE Transactions on Parallel and Distributed Systems.

In The Last Decade

Ilan Newman

81 papers receiving 1.3k citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Ilan Newman Israel	23	1.1k	687	429	147	139	86	1.4k
Ravi B. Boppana United States	13	744 0.7×	532 0.8×	216 0.5×	97 0.7×	68 0.5×	26	1.1k
Artur Czumaj Germany	20	511 0.5×	415 0.6×	595 1.4×	71 0.5×	98 0.7×	121	1.4k
Luca Trevisan United States	28	1.8k 1.6×	1.3k 1.9×	677 1.6×	127 0.9×	218 1.6×	117	2.5k
Virginia Vassilevska Williams United States	18	853 0.8×	472 0.7×	403 0.9×	71 0.5×	87 0.6×	71	1.3k
Jörg Flum Germany	12	1.5k 1.4×	739 1.1×	545 1.3×	156 1.1×	61 0.4×	46	1.9k
Yuri Rabinovich Israel	14	631 0.6×	265 0.4×	325 0.8×	100 0.7×	208 1.5×	38	1.2k
David Steurer United States	21	707 0.6×	383 0.6×	264 0.6×	53 0.4×	93 0.7×	47	1.1k
Andrzej Proskurowski United States	18	1.4k 1.3×	406 0.6×	704 1.6×	214 1.5×	144 1.0×	63	1.9k
Marcin Pilipczuk Poland	15	1.2k 1.1×	196 0.3×	464 1.1×	206 1.4×	90 0.6×	102	1.5k
Michał Pilipczuk Poland	14	1.3k 1.2×	203 0.3×	456 1.1×	217 1.5×	101 0.7×	101	1.5k

Countries citing papers authored by Ilan Newman

Since Specialization

Citations

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

Fields of papers citing papers by Ilan Newman

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Ilan Newman

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

Newman, Ilan, et al.. (2021). New Sublinear Algorithms and Lower Bounds for LIS Estimation.. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 20.

Newman, Ilan, Yuri Rabinovich, Deepak Rajendraprasad, & Christian Sohler. (2019). Testing for forbidden order patterns in an array. Random Structures and Algorithms. 55(2). 402–426. 3 indexed citations

Newman, Ilan, et al.. (2016). Every Property of Outerplanar Graphs is Testable.. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 19. 3 indexed citations

Chepoi, Victor, Feodor F. Dragan, Ilan Newman, Yuri Rabinovich, & Yann Vaxès. (2010). Constant approximation algorithms for embedding graph metrics into trees\n and outerplanar graphs. arXiv (Cornell University). 8 indexed citations

Landau, Gad M., Avivit Levy, & Ilan Newman. (2010). LCS approximation via embedding into locally non-repetitive strings. Information and Computation. 209(4). 705–716. 4 indexed citations

Ben-Zwi, Oren, Danny Hermelin, Daniel Lokshtanov, & Ilan Newman. (2010). Treewidth governs the complexity of target set selection. Discrete Optimization. 8(1). 87–96. 58 indexed citations

Newman, Ilan & Yuri Rabinovich. (2009). . Theory of Computing. 5(1). 125–134. 2 indexed citations

Alon, Noga, et al.. (2007). Partitioning multi-dimensional sets in a small number of ``uniform'' parts. Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands. 4 indexed citations

Lachish, Oded & Ilan Newman. (2005). Languages that are Recognized by Simple Counter Automata are not necessarily Testable. Electronic colloquium on computational complexity. 1 indexed citations

10.

Alon, Noga, Ilan Newman, Alexander Shen, Gábor Tardos, & Nikolay Vereshchagin. (2005). Partitioning multi-dimensional sets in a small number of “uniform” parts. European Journal of Combinatorics. 28(1). 134–144. 1 indexed citations

11.

Halevy, Shirley, Oded Lachish, Ilan Newman, & Dekel Tsur. (2005). Testing Orientation Properties. Electronic colloquium on computational complexity. 21(6). 523–7. 4 indexed citations

12.

Buhrman, Harry, Lance Fortnow, Ilan Newman, & Nikolay Vereshchagin. (2004). Increasing Kolmogorov Complexity. Data Archiving and Networked Services (DANS).

13.

Newman, Ilan. (2004). Computing in fault tolerance broadcast networks. 113–122. 14 indexed citations

14.

Buhrman, Harry, Lance Fortnow, Ilan Newman, & Hein Röhrig. (2003). Quantum property testing. UvA-DARE (University of Amsterdam). 480–488. 5 indexed citations

15.

Czumaj, Artur, Funda Ergün, Lance Fortnow, et al.. (2003). Sublinear-time approximation of Euclidean minimum spanning tree. Symposium on Discrete Algorithms. 813–822. 14 indexed citations

16.

Fischer, Eldar & Ilan Newman. (2001). Testing of matrix properties. 286–295. 19 indexed citations

17.

Ben-Asher, Yosi & Ilan Newman. (1995). Decision Trees with Boolean Threshold Queries. Journal of Computer and System Sciences. 51(3). 495–502. 11 indexed citations

18.

Karchmer, Mauricio, Nathan Linial, Ilan Newman, Michael Saks, & Avi Wigderson. (1993). Combinatorial characterization of read-once formulae. Discrete Mathematics. 114(1-3). 275–282. 30 indexed citations

19.

Newman, Ilan, et al.. (1993). On read-once threshold formulae and their randomized decision tree complexity. Theoretical Computer Science. 107(1). 63–76. 10 indexed citations

20.

Hartman, Irith Ben‐Arroyo, et al.. (1991). On grid intersection graphs. Discrete Mathematics. 87(1). 41–52. 39 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