Skip to content

Daniel Dadush

Publication record assembled from the DBLP archive of ranked conferences.

Papers indexed

44

Venues

7

Active years

2010–2026

Best venue rank

A*

Where they publish

Papers

44 indexed papers, newest first.

YearVenueTitleAuthors
2026ESARevisiting Diameter in Directed Graphs.Ben Bals, Joakim Blikstad, Daniel Dadush, Yasamin Nazari, Jonas Schmidt
2026ESADynamic Detours.Daniel Dadush, Michal Pilipczuk, Amadeus Reinald, Marek Sokolowski, Michal Wlodarczyk
2026IPCOOn Circuit Diameter and Straight Line Complexity.Daniel Dadush, Stefan Kober, Zhuan Khye Koh
2026SODAExcluding a Line Minor via Design Matrices and Column Number Bounds for the Circuit Imbalance Measure.Daniel Dadush, Friedrich Eisenbrand, Rom Pinchasi, Thomas Rothvoss, Neta Singer
2026SODAFrom Incremental Transitive Cover to Strongly Polynomial Maximum Flow.Daniel Dadush, James B. Orlin, Aaron Sidford, Lszl A. Vgh
2026STOCTrust Region Interior Point Methods: Optimal ℓ₂- and Faster Wide-Neighborhood Path Following.Daniel Dadush, Haoyuan Ma, Bento Natura, Lszl A. Vgh
2025STACSA Strongly Polynomial Algorithm for Linear Programs with at Most Two Non-Zero Entries per Row or Column (Invited Talk).Daniel Dadush, Zhuan Khye Koh, Bento Natura, Neil Olver, Lszl A. Vgh
2024SODAStrongly Polynomial Frame Scaling to High Precision.Daniel Dadush, Akshay Ramachandran
2024STOCA Strongly Polynomial Algorithm for Linear Programs with At Most Two Nonzero Entries per Row or Column.Daniel Dadush, Zhuan Khye Koh, Bento Natura, Neil Olver, Lszl A. Vgh
2023IPCOA Nearly Optimal Randomized Algorithm for Explorable Heap Selection.Sander Borst, Daniel Dadush, Sophie Huiberts, Danish Kashaev
2023IPCOFrom Approximate to Exact Integer Programming.Daniel Dadush, Friedrich Eisenbrand, Thomas Rothvoss
2023IPCOOptimizing Low Dimensional Functions over the Integers.Daniel Dadush, Arthur Lonard, Lars Rohwedder, Jos Verschae
2023SODAIntegrality Gaps for Random Integer Programs via Discrepancy.Sander Borst, Daniel Dadush, Dan Mikulincer
2022FOCSInterior point methods are not worse than Simplex.Xavier Allamigeon, Daniel Dadush, Georg Loho, Bento Natura, Lszl A. Vgh
2022IPCOA Simple Method for Convex Optimization in the Oracle Model.Daniel Dadush, Christopher Hojny, Sophie Huiberts, Stefan Weltge
2022IPCOOn Circuit Diameter Bounds via Circuit Imbalances.Daniel Dadush, Zhuan Khye Koh, Bento Natura, Lszl A. Vgh
2022SODAOn finding exact solutions of linear programs in the oracle model.Daniel Dadush, Lszl A. Vgh, Giacomo Zambelli
2022STOCA new framework for matrix discrepancy: partial coloring bounds via mirror descent.Daniel Dadush, Haotian Jiang, Victor Reis
2021ESAAn Accelerated Newton-Dinkelbach Method and Its Application to Two Variables per Inequality Systems.Daniel Dadush, Zhuan Khye Koh, Bento Natura, Lszl A. Vgh
2021IPCOOn the Integrality Gap of Binary Integer Programs with Gaussian Data.Sander Borst, Daniel Dadush, Sophie Huiberts, Samarth Tiwari
2020FOCSRevisiting Tardos's Framework for Linear Programming: Faster Exact Solutions using Approximate Solvers.Daniel Dadush, Bento Natura, Lszl A. Vgh
2020STOCA scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix.Daniel Dadush, Sophie Huiberts, Bento Natura, Lszl A. Vgh
2019STOCOn approximating the covering radius and finding dense lattice subspaces.Daniel Dadush
2018FOCSBalancing Vectors in Any Norm.Daniel Dadush, Aleksandar Nikolov, Kunal Talwar, Nicole Tomczak-Jaegermann
2018SODAFast, Deterministic and Sparse Dimensionality Reduction.Daniel Dadush, Cristbal Guzmn, Neil Olver
2018SODAGeometric Rescaling Algorithms for Submodular Function Minimization.Daniel Dadush, Lszl A. Vgh, Giacomo Zambelli
2018STOCThe gram-schmidt walk: a cure for the Banaszczyk blues.Nikhil Bansal, Daniel Dadush, Shashwat Garg, Shachar Lovett
2018STOCA friendly smoothed analysis of the simplex method.Daniel Dadush, Sophie Huiberts
2016ESAOn the Lattice Distortion Problem.Huck Bennett, Daniel Dadush, Noah Stephens-Davidowitz
2016FOCSAn Algorithm for Komls Conjecture Matching Banaszczyk's Bound.Nikhil Bansal, Daniel Dadush, Shashwat Garg
2016FOCSTowards Strong Reverse Minkowski-Type Inequalities for Lattices.Daniel Dadush, Oded Regev
2016IPCORescaled Coordinate Descent Methods for Linear Programming.Daniel Dadush, Lszl A. Vgh, Giacomo Zambelli
2015FOCSSolving the Closest Vector Problem in 2^n Time - The Discrete Gaussian Strikes Again!Divesh Aggarwal, Daniel Dadush, Noah Stephens-Davidowitz
2015SODAShort Paths on the Voronoi Graph and Closest Vector Problem with Preprocessing.Daniel Dadush, Nicolas Bonifas
2015STOCSolving the Shortest Vector Problem in 2Divesh Aggarwal, Daniel Dadush, Oded Regev, Noah Stephens-Davidowitz
2013ESAOn the Existence of 0/1 Polytopes with High Semidefinite Extension Complexity.Jop Brit, Daniel Dadush, Sebastian Pokutta
2013SODALattice Sparsification and the Approximate Closest Vector Problem.Daniel Dadush, Gbor Kun
2013SODAAlgorithms for the Densest Sub-Lattice Problem.Daniel Dadush, Daniele Micciancio
2012LATINA O(1/ε 2) n -Time Sieving Algorithm for Approximate Integer Programming.Daniel Dadush
2012SODADeterministic construction of an approximate M-ellipsoid and its applications to derandomizing lattice algorithms.Daniel Dadush, Santosh S. Vempala
2012STOCUnconditional differentially private mechanisms for linear queries.Aditya Bhaskara, Daniel Dadush, Ravishankar Krishnaswamy, Kunal Talwar
2011FOCSEnumerative Lattice Algorithms in any Norm Via M-ellipsoid Coverings.Daniel Dadush, Chris Peikert, Santosh S. Vempala
2011IPCOOn the Chvtal-Gomory Closure of a Compact Convex Set.Daniel Dadush, Santanu S. Dey, Juan Pablo Vielma
2010SODAThin Partitions: Isoperimetric Inequalities and a Sampling Algorithm for Star Shaped Bodies.Karthekeyan Chandrasekaran, Daniel Dadush, Santosh S. Vempala