# Gábor Braun

According to our database

Collaborative distances:

^{1}, Gábor Braun authored at least 26 papers between 2005 and 2024.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Dataset Other## Links

#### On csauthors.net:

## Bibliography

2024

Corrections to "Lower Bounds on the Oracle Complexity of Nonsmooth Convex Optimization via Information Theory".

IEEE Trans. Inf. Theory, July, 2024

2019

Math. Program., 2019

J. Mach. Learn. Res., 2019

Proceedings of the 36th International Conference on Machine Learning, 2019

2018

Math. Program., 2018

CoRR, 2018

2017

Lower Bounds on the Oracle Complexity of Nonsmooth Convex Optimization via Information Theory.

IEEE Trans. Inf. Theory, 2017

Math. Program., 2017

Comput. Complex., 2017

2016

SIAM J. Discret. Math., 2016

Math. Program., 2016

CoRR, 2016

Algorithmica, 2016

2015

The Matching Problem Has No Fully Polynomial Size Linear Programming Relaxation Schemes.

IEEE Trans. Inf. Theory, 2015

Math. Oper. Res., 2015

IEEE J. Sel. Top. Signal Process., 2015

CoRR, 2015

Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

2014

A short proof for the polyhedrality of the Chvátal-Gomory closure of a compact convex set.

Oper. Res. Lett., 2014

CoRR, 2014

2012

Proceedings of the Combinatorial Optimization - Second International Symposium, 2012

2011

Oper. Res. Lett., 2011

Int. J. Algebra Comput., 2011

2010

Electron. Notes Discret. Math., 2010

2005

Electron. J. Comb., 2005