Daniel Dadush
Daniel Dadush publishes mostly in Computational Theory and Mathematics, Artificial Intelligence and Numerical Analysis, on topics such as Complexity and Algorithms in Graphs, Advanced Graph Theory Research and Computational Geometry and Mesh Generation.
- World rank
- #1,861,438 of 7,710,434 ranked researchers
- Rank in Netherlands
- #40,922 of 107,149
- Works
- 130
- Citations
- 1.1k
- Citations per work
- 8.4
What does Daniel Dadush research?
Daniel Dadush's work is mostly in Computer Science (63%), Mathematics (15%).
Their six largest subfields, inside their fields and domains; the grey slice is everything else they publish. The interactive view splits every one of their works down to single topics.
The fields and subfields, with their numbers
- Physical Sciences10177.9%
- Computer Science8262.7%
- Mathematics2015.2%
- Everything else2922.1%
- 1Computational Theory and Mathematics34% of their works
- 2Artificial Intelligence14% of their works
- 3Numerical Analysis10% of their works
- 4Computer Graphics and Computer-Aided Design8% of their works
- 5Computer Networks and Communications6% of their works
- 6Applied Mathematics5% of their works
Research topics
Which keywords describe Daniel Dadush's research?
The keywords of their largest research topics: Approximation Algorithms, Algorithmic Applications, Combinatorial Optimization, Complexity Theory, Graph Theory, Parameterized Complexity, Delaunay Triangulations and Mesh Generation.
- Quasi-Monte Carlo
- Spatstat
- Online Algorithms
- Identity-Based Encryption
- Semidefinite Programming
- Mesh Generation
- Parameterized Complexity
- Complexity Theory
- Algorithmic Applications
- Approximation Algorithms
- Combinatorial Optimization
- Graph Theory
- Delaunay Triangulations
- Optimization Software
- Homomorphic Encryption
- Mobile Robots
- Point Processes
- High-dimensional Integration
Size is their works in the topics tagged with each word, from their 8 largest topics. Each links to the topic it comes from most. The words come from the keyword list OpenAlex gives each topic, not from the text of the papers, so a word can appear that none of the papers uses.
All 18 words, with their numbers
- Approximation Algorithms1473 topics
- Algorithmic Applications1162 topics
- Combinatorial Optimization791 topic
- Complexity Theory791 topic
- Graph Theory371 topic
- Parameterized Complexity371 topic
- Delaunay Triangulations311 topic
- Mesh Generation311 topic
- Optimization Software261 topic
- Semidefinite Programming261 topic
- Homomorphic Encryption231 topic
- Identity-Based Encryption231 topic
- Mobile Robots221 topic
- Online Algorithms221 topic
- Point Processes171 topic
- Spatstat171 topic
- High-dimensional Integration131 topic
- Quasi-Monte Carlo131 topic
Where does Daniel Dadush work?
Daniel Dadush's main affiliation in the publication record is Centrum Wiskunde & Informatica, Netherlands.
How many publications and citations does Daniel Dadush have?
OpenAlex counts 130 works and 1,090 citations for Daniel Dadush, an h-index of 18, ranking #1,861,438 of 7,710,434 researchers worldwide on the quality score.
Ranked on field-normalised citation excellence (50%), output (30%) and citations (20%). Counts come from OpenAlex author records, which occasionally merge different people who share a name or split one person into several.
Papers, co-authors, who cited this work and researchers on the nearest topics have tabs of their own, above. Is this your page? Claim it with your ORCID iD, or request a correction or removal.
Discussion
Ask a question or share a note about Daniel Dadush. Keep it to the research: no personal attacks, advertising or links. Any reader can report a post, which collapses it for everyone until it is opened.