Daniel Dadush
Impact in
- Numerical Analysis top 5%
- Advanced Optimization Algorithms Research
-
- Complexity and Algorithms in Graphs
- Advanced Graph Theory Research
Papers in
-
- Complexity and Algorithms in Graphs 32
- Advanced Graph Theory Research 17
-
- Advanced Optimization Algorithms Research 12
- Co-authors
- Noah Stephens-Davidowitz (4 shared papers)Santosh Vempala (6 shared papers)Divesh Aggarwal (2 shared papers)Santanu S. Dey (4 shared papers)Juan Pablo Vielma (4 shared papers)Chris Peikert (3 shared papers)Oded Regev (2 shared papers)Shashwat Garg (5 shared papers)
- Journals
- Mathematical Programming (7 papers)Theory of Computing (3 papers)Mathematics of Operations Research (2 papers)SIAM Journal on Computing (2 papers)Algorithmica (1 paper)
- Partner nations
- NetherlandsUnited StatesUnited Kingdom
In The Last Decade
Daniel Dadush
48 papers receiving 418 citations
Peers
Comparison fields: 5 of 42
- Numerical Analysis 112
- Computational Theory and Mathematics 278
- Computer Graphics and Computer-Aided Design 54
- Discrete Mathematics and Combinatorics 23
- Statistics and Probability 44
Countries citing papers authored by Daniel Dadush
This map shows the geographic impact of Daniel Dadush'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 Daniel Dadush with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Daniel Dadush more than expected).
Fields of papers citing papers by Daniel Dadush
This network shows the impact of papers produced by Daniel Dadush. 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 Daniel Dadush. The network helps show where Daniel Dadush may publish in the future.
Co-authors
The 25 scholars most cited alongside Daniel Dadush, 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 56 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2015 | 52 | |
| 2 | 2011 | 47 | |
| 3 | 2015 | 38 | |
| 4 | 2011 | 25 | |
| 5 | 2014 | 18 | |
| 6 | 2011 | 16 | |
| 7 | 2013 | 16 | |
| 8 | 2012 | 15 | |
| 9 | 2016 | 14 | |
| 10 | 2013 | 13 | |
| 11 | 2018 | 13 | |
| 12 | 2018 | 12 | |
| 13 | 2016 | 11 | |
| 14 | 2013 | 10 | |
| 15 | Short Paths on the Voronoi Graph and Closest Vector Problem with Preprocessing | 2015 | 9 |
| 16 | 2020 | 9 | |
| 17 | 2013 | 9 | |
| 18 | 2023 | 8 | |
| 19 | 2014 | 8 | |
| 20 | 2011 | 8 |
About Daniel Dadush
Daniel Dadush is a scholar working on Computational Theory and Mathematics, Numerical Analysis, Artificial Intelligence, Computer Graphics and Computer-Aided Design and Computer Networks and Communications, having authored 56 papers that have together received 448 indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (32 papers), Advanced Graph Theory Research (17 papers), Advanced Optimization Algorithms Research (12 papers), Computational Geometry and Mesh Generation (12 papers), Optimization and Search Problems (11 papers), Cryptography and Data Security (10 papers), Point processes and geometric inequalities (9 papers) and Privacy-Preserving Technologies in Data (7 papers). The work is most often cited by research in Numerical Analysis (112 citations), Computational Theory and Mathematics (278 citations), Computer Graphics and Computer-Aided Design (54 citations), Discrete Mathematics and Combinatorics (23 citations) and Statistics and Probability (44 citations). Daniel Dadush has collaborated with scholars based in Netherlands, United States and United Kingdom. Frequent co-authors include Noah Stephens-Davidowitz, Santosh Vempala, Divesh Aggarwal, Santanu S. Dey, Juan Pablo Vielma, Chris Peikert, Oded Regev, Shashwat Garg, Nikhil Bansal and László A. Végh. Their work appears in journals such as Mathematical Programming, Theory of Computing, Mathematics of Operations Research, SIAM Journal on Computing and Algorithmica.
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.