Daniel Dadush

Centrum Wiskunde & Informatica — Netherlands

Computer Science · Physical Sciences

19h-index1.1kcitations121works0.42yr avg
OpenAlex↗ORCID↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Complexity and Algorithms in Graphs(64), Advanced Graph Theory Research(27), Computational Geometry and Mesh Generation(26), Advanced Optimization Algorithms Research(25), Cryptography and Data Security(20)

Publications121 total

Excluding a Line Minor via Design Matrices and Column Number Bounds for the Circuit Imbalance Measure
Society for Industrial and Applied Mathematics eBooks·2026Open Access
From Incremental Transitive Cover to Strongly Polynomial Maximum Flow
Society for Industrial and Applied Mathematics eBooks·2026
Greedy Algorithms for Shortcut Sets and Hopsets
ArXiv.org·2025Open Access
From Incremental Transitive Cover to Strongly Polynomial Maximum Flow
arXiv (Cornell University)·2025Open Access
Excluding a Line Minor via Design Matrices and Column Number Bounds for the Circuit Imbalance Measure
arXiv (Cornell University)·2025Open Access
Lower bounds for cube-ideal set-systems
arXiv (Cornell University)·2025Open Access
Interior Point Methods Are Not Worse than Simplex
SIAM Journal on Computing·2025· 1 cited
A nearly optimal randomized algorithm for explorable heap selection
Mathematical Programming·2024Open Access
On circuit diameter bounds via circuit imbalances
Mathematical Programming·2024Open Access
A Strongly Polynomial Algorithm for Linear Programs with At Most Two Nonzero Entries per Row or Column
2024· 3 citedOpen Access
Introduction: ACM-SIAM Symposium on Discrete Algorithms (SODA) 2022 Special Issue
ACM Transactions on Algorithms·2024· 1 citedOpen Access
From approximate to exact integer programming
Mathematical Programming·2024Open Access
Strongly Polynomial Frame Scaling to High Precision
arXiv (Cornell University)·2024Open Access
Strongly Polynomial Frame Scaling to High Precision
Society for Industrial and Applied Mathematics eBooks·2024
A simple method for convex optimization in the oracle model
Mathematical Programming·2023· 1 citedOpen Access
A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix
Mathematical Programming·2023· 9 citedOpen Access
Optimizing Low Dimensional Functions over the Integers
arXiv (Cornell University)·2023Open Access
Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)
Society for Industrial and Applied Mathematics eBooks·2023· 52 cited
A Nearly Optimal Randomized Algorithm for Explorable Heap Selection
Lecture notes in computer science·2023· 3 cited
Optimizing Low Dimensional Functions over the Integers
Lecture notes in computer science·2023
page 1 of 7Next →

Frequent Co-authors

Santosh Vempala(7), Noah Stephens-Davidowitz(6), Shashwat Garg(6), Sophie Huiberts(6), László A. Végh(6), Nikhil Bansal(5), Divesh Aggarwal(4), Oded Regev(4), Santanu S. Dey(4), Juan Pablo Vielma(4), Chris Peikert(3), Sander Borst(3), Shachar Lovett(3), Giacomo Zambelli(3), Jop Briët(3), Sebastian Pokutta(3), Bento Natura(3), Kunal Talwar(2), Aleksandar Nikolov(2), Samarth Tiwari(2)