A. Nilli

424 total citations
7 papers, 211 citations indexed

About

A. Nilli is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics and Geometry and Topology. According to data from OpenAlex, A. Nilli has authored 7 papers receiving a total of 211 indexed citations (citations by other indexed papers that have themselves been cited), including 5 papers in Discrete Mathematics and Combinatorics, 5 papers in Computational Theory and Mathematics and 2 papers in Geometry and Topology. Recurrent topics in A. Nilli's work include Limits and Structures in Graph Theory (4 papers), Advanced Graph Theory Research (3 papers) and Algorithms and Data Compression (2 papers). A. Nilli is often cited by papers focused on Limits and Structures in Graph Theory (4 papers), Advanced Graph Theory Research (3 papers) and Algorithms and Data Compression (2 papers). A. Nilli collaborates with scholars based in Israel and Italy. A. Nilli's co-authors include and has published in prestigious journals such as Discrete Applied Mathematics, Discrete Mathematics and Journal of Combinatorial Theory Series B.

In The Last Decade

A. Nilli

6 papers receiving 176 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
A. Nilli Israel 4 106 97 86 42 32 7 211
Norbert Seifter Austria 10 134 1.3× 149 1.5× 163 1.9× 42 1.0× 78 2.4× 35 281
Steven D. Noble United Kingdom 10 123 1.2× 141 1.5× 176 2.0× 21 0.5× 32 1.0× 35 299
Caroline J. Klivans United States 9 153 1.4× 117 1.2× 229 2.7× 25 0.6× 17 0.5× 22 320
Geert Prins United States 7 121 1.1× 135 1.4× 223 2.6× 21 0.5× 51 1.6× 15 339
Douglas S. Jungreis United States 6 165 1.6× 48 0.5× 53 0.6× 23 0.5× 35 1.1× 15 228
Thomas A. Dowling United States 9 91 0.9× 162 1.7× 156 1.8× 42 1.0× 91 2.8× 19 332
Anna de Mier Spain 11 99 0.9× 231 2.4× 198 2.3× 42 1.0× 50 1.6× 37 308
Guillem Perarnau Spain 7 46 0.4× 65 0.7× 89 1.0× 18 0.4× 20 0.6× 35 166
Myriam Preissmann France 11 50 0.5× 125 1.3× 279 3.2× 16 0.4× 76 2.4× 35 350
Roland Bacher France 9 127 1.2× 101 1.0× 99 1.2× 24 0.6× 21 0.7× 36 246

Countries citing papers authored by A. Nilli

Since Specialization
Citations

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

Fields of papers citing papers by A. Nilli

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

No nodes

All Works

7 of 7 papers shown
1.
Nilli, A.. (2004). Tight Estimates for Eigenvalues of Regular Graphs. The Electronic Journal of Combinatorics. 11(1). 16 indexed citations
2.
Nilli, A., et al.. (2001). Recursive bounds for perfect hashing. Discrete Applied Mathematics. 111(3). 307–311.
3.
Nilli, A.. (2000). Triangle-free graphs with large chromatic numbers. Discrete Mathematics. 211(1-3). 261–262. 12 indexed citations
4.
Nilli, A.. (1999). Short odd cycles in 4-chromatic graphs. Journal of Graph Theory. 31(2). 145–147. 2 indexed citations
5.
Nilli, A.. (1994). Perfect Hashing and Probability. Combinatorics Probability Computing. 3(3). 407–409. 28 indexed citations
6.
Nilli, A.. (1991). On the second eigenvalue of a graph. Discrete Mathematics. 91(2). 207–210. 152 indexed citations
7.
Nilli, A.. (1988). The average size of an independent set in graphs with a given chromatic number. Journal of Combinatorial Theory Series B. 45(1). 112–114. 1 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