Nabil Kahalé
Impact in
-
- Limits and Structures in Graph Theory
-
- Advanced Graph Theory Research
- Complexity and Algorithms in Graphs
Papers in
-
- Advanced Graph Theory Research 7
- Graph Labeling and Dimension Problems 4
- Complexity and Algorithms in Graphs 4
-
- Limits and Structures in Graph Theory 8
- Finite Group Theory Research 3
- Co-authors
- Noga Alon (3 shared papers)Rüdiger Urbanke (1 shared paper)Paul E. Wright (1 shared paper)Tom Leighton (3 shared papers)Leonard J. Schulman (1 shared paper)E. G. Coffman (2 shared papers)Bjorn Poonen (1 shared paper)Frank Thomson Leighton (1 shared paper)
- Journals
- Management Science (2 papers)Mathematical Finance (2 papers)SIAM Journal on Computing (2 papers)Journal of the ACM (1 paper)Operations Research Letters (1 paper)
- Partner nations
- United StatesGermanyFrance
In The Last Decade
Nabil Kahalé
29 papers receiving 476 citations
Peers
Comparison fields: 5 of 59
- Discrete Mathematics and Combinatorics 103
- Computational Theory and Mathematics 224
- Computer Networks and Communications 209
- Geometry and Topology 70
- Computer Graphics and Computer-Aided Design 22
Countries citing papers authored by Nabil Kahalé
This map shows the geographic impact of Nabil Kahalé'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 Nabil Kahalé with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Nabil Kahalé more than expected).
Fields of papers citing papers by Nabil Kahalé
This network shows the impact of papers produced by Nabil Kahalé. 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 Nabil Kahalé. The network helps show where Nabil Kahalé may publish in the future.
Co-authors
The 13 scholars most cited alongside Nabil Kahalé, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 30 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 1997 | 95 | |
| 2 | 1998 | 70 | |
| 3 | 1995 | 65 | |
| 4 | 2002 | 60 | |
| 5 | 2002 | 55 | |
| 6 | 1997 | 26 | |
| 7 | 1995 | 18 | |
| 8 | 1992 | 17 | |
| 9 | 1997 | 13 | |
| 10 | 1996 | 10 | |
| 11 | 1997 | 10 | |
| 12 | 1991 | 8 | |
| 13 | 2020 | 8 | |
| 14 | 2020 | 8 | |
| 15 | 2017 | 7 | |
| 16 | 1999 | 7 | |
| 17 | Expander graphs | 1993 | 7 |
| 18 | 2014 | 6 | |
| 19 | 1994 | 6 | |
| 20 | 2008 | 6 |
About Nabil Kahalé
Nabil Kahalé is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Finance, Geometry and Topology and Computer Networks and Communications, having authored 30 papers that have together received 535 indexed citations. Recurring topics across this work include Limits and Structures in Graph Theory (8 papers), Stochastic processes and financial applications (7 papers), Advanced Graph Theory Research (7 papers), Graph theory and applications (6 papers), Markov Chains and Monte Carlo Methods (4 papers), Graph Labeling and Dimension Problems (4 papers), Complexity and Algorithms in Graphs (4 papers) and Finite Group Theory Research (3 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (103 citations), Computational Theory and Mathematics (224 citations), Computer Networks and Communications (209 citations), Geometry and Topology (70 citations) and Computer Graphics and Computer-Aided Design (22 citations). Nabil Kahalé has collaborated with scholars based in United States, Germany and France. Frequent co-authors include Noga Alon, Rüdiger Urbanke, Paul E. Wright, Tom Leighton, Leonard J. Schulman, E. G. Coffman, Bjorn Poonen, Frank Thomson Leighton, Anja Feldmann and Yuan Ma. Their work appears in journals such as Management Science, Mathematical Finance, SIAM Journal on Computing, Journal of the ACM and Operations Research Letters.
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.