In Preparation / Articles Pending Review.

  1. Kerdreux, T., d’Aspremont, A., & Pokutta, S. (2018). Restarting Frank-Wolfe. Submitted. [arXiv]
  2. Faenza, Y., Muñoz, G., & Pokutta, S. (2018). Limits of Treewidth-based tractability in Optimization. Submitted. [arXiv] [summary]
  3. Braun, G., Pokutta, S., Tu, D., & Wright, S. (2018). Blended Conditional Gradients: the unconditioning of conditional gradients. Submitted. [arXiv]
  4. Bärmann, A., Martin, A., Pokutta, S., & Schneider, O. (2018). An Online-Learning Approach to Inverse Optimization. Submitted. [arXiv]
  5. Bienstock, D., Muñoz, G., & Pokutta, S. (2018). Principled Deep Neural Network Training through Linear Programming. Submitted. [arXiv] [summary]
  6. Anari, N., Haghtalab, N., Naor, S., Pokutta, S., Singh, M., & Torrico, A. (2017). Robust Submodular Maximization: Offline and Online Algorithms. Submitted. [arXiv]

Refereed Conference Proceedings.

  1. Pokutta, S., Singh, M., & Torrico, A. (2018). Efficient algorithms for robust submodular maximization under matroid constraints. ICML Workshop Paper. [PDF] [arXiv]
  2. Roy, A., Xu, H., & Pokutta, S. (2017). Reinforcement Learning under Model Mismatch. Proceedings of NIPS. [arXiv]
  3. Arumugam, K., Kadampot, I., Tahmasbi, M., Shah, S., Bloch, M., & Pokutta, S. (2017). Modulation Recognition Using Side Information and Hybrid Learning. Proceedings of IEEE DySPAN.
  4. Bärmann, A., Pokutta, S., & Schneider, O. (2017). Emulating the Expert: Inverse Optimization through Online Learning. Proceedings of the International Conference on Machine Learning (ICML). [PDF] [arXiv]
  5. Lan, G., Pokutta, S., Zhou, Y., & Zink, D. (2017). Conditional Accelerated Lazy Stochastic Gradient Descent. Proceedings of the International Conference on Machine Learning (ICML). [PDF] [arXiv]
  6. Braun, G., Pokutta, S., & Zink, D. (2017). Lazifying Conditional Gradient Algorithms. Proceedings of the International Conference on Machine Learning (ICML). [PDF] [arXiv]
  7. Braun, G., Brown-Cohen, J., Huq, A., Pokutta, S., Raghavendra, P., Weitz, B., & Zink, D. (2016). The matching problem has no small symmetric SDP. Proceddings of SODA 2016. [PDF] [arXiv]
  8. Braun, G., Roy, A., & Pokutta, S. (2016). Stronger Reductions for Extended Formulations. Proceedings of IPCO. [arXiv]
  9. Roy, A., & Pokutta, S. (2016). Hierarchical Clustering via Spreading Metrics. Proceedings of NIPS. [PDF] [arXiv]
  10. Song, R., Xie, Y., & Pokutta, S. (2015). Sequential Sensing with Model Mismatch. Proceedings of ISIT.
  11. Braun, G., Pokutta, S., & Zink, D. (2015). Inapproximability of combinatorial problems via small LPs and SDPs. Proceeedings of STOC. [arXiv]
  12. Pokutta, S. (2015). Information Theory and Polyhedral Combinatorics. Proceedings of 53rd Annual Allerton Conference on Communication, Control, and Computing. [PDF]
  13. Xie, Y., Li, Q., & Pokutta, S. (2015). Supervised Online Subspace Tracking. Proceedings of Asilomar Conference on Signals, Systems, and Computers.
  14. Braun, G., & Pokutta, S. (2015). The matching polytope does not admit fully-polynomial size relaxation schemes. Proceeedings of SODA. [arXiv]
  15. Bazzi, A., Fiorini, S., Pokutta, S., & Svensson, O. (2015). Small linear programs cannot approximate Vertex Cover within a factor of 2 - epsilon. Proceedings of FOCS. [arXiv]
  16. Braun, G., Pokutta, S., & Xie, Y. (2014). Info-Greedy Sequential Adaptive Compressed Sensing. Proceedings of 52nd Annual Allerton Conference on Communication, Control, and Computing. [arXiv]
  17. Braun, G., Fiorini, S., & Pokutta, S. (2014). Average case polyhedral complexity of the maximum stable set problem. Proceedings of RANDOM. [PDF] [arXiv]
  18. Schmaltz, C., Pokutta, S., Heidorn, T., & Andrae, S. (2013). How to make regulators and shareholders happy under Basel III. Proceedings of the 26th Australasian Finance and Banking Conference. [arXiv]
  19. Braun, G., & Pokutta, S. (2013). Common information and unique disjointness. In Foundations of Computer Science (FOCS), 2013 IEEE 54th Annual Symposium (pp. 688–697). IEEE. [arXiv]
  20. Briët, J., Dadush, D., & Pokutta, S. (2013). On the existence of 0/1 polytopes with high semidefinite extension complexity. Proceedings of ESA. [arXiv]
  21. Braun, G., & Pokutta, S. (2012). An algebraic view on symmetric extended formulations. Proceedings of ISCO, Lecture Notes in Computer Science, 7422(141–152). [arXiv]
  22. Fiorini, S., Massar, S., Pokutta, S., Tiwary, H. R., & de Wolf, R. (2012). Linear vs. Semidefinite Extended Formulations: Exponential Separation and Strong Lower Bounds. Proceedings of STOC. [arXiv]
  23. Braun, G., Fiorini, S., Pokutta, S., & Steurer, D. (2012). Approximation Limits of Linear Programs (Beyond Hierarchies). Proceedings of FOCS. [arXiv]
  24. Dey, S. S., & Pokutta, S. (2011). Design and verify: a new scheme for generating cutting-planes. Proceedings of IPCO, Lecture Notes in Computer Science, 6655, 143–155. [arXiv]
  25. Pokutta, S., & Schmaltz, C. (2011). A network model for bank lending capacity. Proceedings of Systemic Risk, Basel III, Financial Stability and Regulation. [arXiv]
  26. Pokutta, S., & Schmaltz, C. (2011). Optimal Planning under Basel III Regulations. Proceedings of 24th Australasian Finance and Banking Conference. [arXiv]
  27. Helmke, H., Gluchshenko, O., Martin, A., Peter, A., Pokutta, S., & Siebert, U. (2011). Optimal Mixed-Mode Runway Scheduling. Proceedings of DACS. [arXiv]
  28. Braun, G., & Pokutta, S. (2010). Rank of random half-integral polytopes. Electronic Notes in Discrete Mathematics, 36, 415–422. [PDF] [arXiv]
  29. Pokutta, S., & Schulz, A. S. (2010). On the rank of generic cutting-plane proof systems. Proceedings of IPCO, Lecture Notes in Computer Science, 6080, 450–463. [PDF] [arXiv]
  30. Drewes, S., & Pokutta, S. (2010). Cutting-planes for weakly-coupled 0/1 second order cone programs. Electronic Notes in Discrete Mathematics, 36, 735–742. [PDF] [arXiv]
  31. Drewes, S., & Pokutta, S. (2010). Geometric mean maximization in the presence of discrete decisions. Proceedings of 23rd Australasian Finance and Banking Conference.
  32. Martin, A., Müller, J., & Pokutta, S. (2010). On clearing coupled day-ahead electricity markets. Proceedings of 23rd Australasian Finance and Banking Conference. [arXiv]
  33. Pokutta, S., & Schmaltz, C. (2009). Optimal degree of centralization of liquidity management. Proceedings of 22nd Australasian Finance and Banking Conference. [arXiv]

Refereed Journals.

  1. Braun, G., Roy, A., & Pokutta, S. (2018+). Stronger Reductions for Extended Formulations. To Appear in Mathematical Programming B. [arXiv]
  2. Le Bodic, P., Pfetsch, M., Pavelka, J., & Pokutta, S. (2018). Solving MIPs via Scaling-based Augmentation. Discrete Optimization, 27, 1–25. [PDF] [arXiv]
  3. Bodur, M., Del Pia, A., Dey, S. S., Molinaro, M., & Pokutta, S. (2017+). Aggregation-based cutting-planes for packing and covering Integer Programs. To Appear in Mathematical Programming A. [PDF] [arXiv]
  4. Bazzi, A., Fiorini, S., Pokutta, S., & Svensson, O. (2017+). Small linear programs cannot approximate Vertex Cover within a factor of 2 - epsilon. To Appear in Mathematics of Operations Research. [arXiv]
  5. Braun, G., Pokutta, S., & Zink, D. (2017+). Affine Reductions for LPs and SDPs. To Appear in Mathematical Programming A. [PDF] [arXiv]
  6. Christensen, H., Khan, A., Pokutta, S., & Tetali, P. (2017+). Multidimensional Bin Packing and Other Related Problems: A survey. To Appear in Computer Science Review. [PDF]
  7. Knueven, B., Ostrowski, J., & Pokutta, S. (2017+). Detecting Almost Symmetries in Graphs. To Appear in Mathematical Programming C. [PDF] [arXiv]
  8. Braun, G., Brown-Cohen, J., Huq, A., Pokutta, S., Raghavendra, P., Weitz, B., & Zink, D. (2017). The matching problem has no small symmetric SDP. Mathematical Programming A, 165(2), 643–662. [PDF] [arXiv]
  9. Braun, G., Guzmán, C., & Pokutta, S. (2017). Unifying Lower Bounds on the Oracle Complexity of Nonsmooth Convex Optimization. IEEE Transactions of Information Theory, 63(7), 4709–4724. [PDF] [arXiv]
  10. Braun, G., Jain, R., Lee, T., & Pokutta, S. (2017). Information-theoretic approximations of the nonnegative rank. Computational Complexity, 26(1), 147–197. [arXiv]
  11. Roy, A., & Pokutta, S. (2017). Hierarchical Clustering via Spreading Metrics. Journal of Machine Learning Research (JMLR), 18, 1–35. [PDF] [arXiv]
  12. Martin, A., Müller, J., Pape, S., Peter, A., Pokutta, S., & Winter, T. (2017). Pricing and clearing combinatorial markets with singleton and swap orders. Mathematical Methods of Operations Research, 85(2), 155–177. [arXiv]
  13. Gatzert, N., Pokutta, S., & Vogl, N. (2016+). Convergence of Capital and Insurance Markets: Pricing Aspects of Index-Linked Catastrophic Loss Instruments. To Appear in Journal of Risk and Insurance. [arXiv]
  14. Braun, G., & Pokutta, S. (2016). A polyhedral characterization of Border Bases. SIAM Journal on Discrete Mathematics, 30(1), 239–265. [arXiv]
  15. Braun, G., Fiorini, S., & Pokutta, S. (2016). Average case polyhedral complexity of the maximum stable set problem. Mathematical Programming A, 160(1), 407–431. [PDF] [arXiv]
  16. Braun, G., & Pokutta, S. (2016). Common information and unique disjointness. Algorithmica, 76(3), 597–629. [PDF] [arXiv]
  17. Bärmann, A., Heidt, A., Martin, A., Pokutta, S., & Thurner, C. (2016). Polyhedral Approximation of Ellipsoidal Uncertainty Sets via Extended Formulations - a computational case study. Computational Management Science, 13(2), 151–193. [PDF] [arXiv]
  18. Fiorini, S., Massar, S., Pokutta, S., Tiwary, H. R., & de Wolf, R. (2015). Exponential Lower Bounds for Polytopes in Combinatorial Optimization. Journal of the ACM, 62(2), 1–17. [PDF] [arXiv]
  19. Briët, J., Dadush, D., & Pokutta, S. (2015). On the existence of 0/1 polytopes with high semidefinite extension complexity. Mathematical Programming B, 153(1), 179–199. [arXiv]
  20. Braun, G., Fiorini, S., Pokutta, S., & Steurer, D. (2015). Approximation Limits of Linear Programs (Beyond Hierarchies). Mathematics of Operations Research, 40(3), 179–199. [arXiv]
  21. Braun, G., Pokutta, S., & Xie, Y. (2015). Info-Greedy Sequential Adaptive Compressed Sensing. IEEE Journal of Selected Topics in Signal Processing, 9(4), 601–611. [arXiv]
  22. Braun, G., & Pokutta, S. (2015). The matching polytope does not admit fully-polynomial size relaxation schemes. IEEE Transactions on Information Theory, 61(10), 1–11. [PDF] [arXiv]
  23. Drewes, S., & Pokutta, S. (2014). Symmetry-exploiting cuts for a class of mixed-0/1 second order cone programs. Discrete Optimization, 13, 23–35. [arXiv]
  24. Braun, G., & Pokutta, S. (2014). A short proof for the polyhedrality of the Chvátal-Gomory closure of a compact convex set. Operations Research Letters, 42, 307–310. [arXiv]
  25. Dey, S. S., & Pokutta, S. (2014). Design and verify: a new scheme for generating cutting-planes. Mathematical Programming A, 145, 199–222. [arXiv]
  26. Drewes, S., & Pokutta, S. (2014). Computing discrete expected utility maximizing portfolios. Journal of Investing, 23(4), 121–132. [arXiv]
  27. Martin, A., Müller, J., & Pokutta, S. (2014). Strict linear prices in non-convex European day-ahead electricity markets. Optimization Methods and Software, 29(1), 189–221. [PDF] [arXiv]
  28. Schmaltz, C., Pokutta, S., Heidorn, T., & Andrae, S. (2014). How to make regulators and shareholders happy under Basel III. Journal of Banking and Finance, 311–325. [PDF] [arXiv]
  29. Kroll, C., & Pokutta, S. (2013). Just a perfect day: developing a happiness optimised day schedule. Journal of Economic Psychology, 34, 210–217. [PDF]
  30. Pokutta, S., & Van Vyve, M. (2013). A note on the extension complexity of the knapsack polytope. Operations Research Letters, 41, 347–350. [PDF] [arXiv]
  31. Göbel, R., & Pokutta, S. (2012). Absolutely rigid fields and Shelah’s absolutely rigid trees. Contemporary Mathematics, 576, 105–128. [PDF] [arXiv]
  32. Braun, G., & Pokutta, S. (2012). Rigid abelian groups and the probabilistic method. Contemporary Mathematics, 576, 17–30. [PDF] [arXiv]
  33. Pokutta, S., & Schmaltz, C. (2012). Optimal Planning under Basel III Regulations. Cass-Capco Institute Paper Series on Risk, 34. [PDF] [arXiv]
  34. Braun, G., & Pokutta, S. (2011). Random half-integral polytopes. Operations Research Letters, 39(3), 204–207. [arXiv]
  35. Pokutta, S., & Stauffer, G. (2011). Lower bounds for the Chvátal-Gomory rank in the 0/1 cube. Operations Research Letters, 39(3), 200–203. [PDF] [arXiv]
  36. Haus, U. U., Hemmecke, R., & Pokutta, S. (2011). Reconstructing biochemical cluster networks. Journal of Mathematical Chemistry, 49(10), 2441–2456. [PDF] [arXiv]
  37. Pokutta, S., & Schulz, A. S. (2011). Integer-empty polytopes in the 0/1-cube with maximal Gomory-Chvátal rank. Operations Research Letters, 39(6), 457–460. [PDF] [arXiv]
  38. Letchford, A. N., Pokutta, S., & Schulz, A. S. (2011). On the membership problem for the 0,1/2-closure. Operations Research Letters, 39(5), 301–304. [PDF] [arXiv]
  39. Pokutta, S., & Schmaltz, C. (2011). Managing liquidity: Optimal degree of centralization. Journal of Banking and Finance, 35, 627–638. https://doi.org/DOI: 10.1016/j.jbankfin.2010.07.001 [PDF] [arXiv]
  40. Pokutta, S., & Stauffer, G. (2009). France Telecom Workforce Scheduling Problem: a challenge. RAIRO-Operations Research, (43), 375–386. [PDF]
  41. Heldt, D., Kreuzer, M., Pokutta, S., & Poulisse, H. (2009). Approximate Computation of zero-dimensional polynomial ideals. Journal of Symbolic Computation, 44, 1566–1591. [PDF]
  42. Göbel, R., & Pokutta, S. (2008). Construction of dual modules using Martin’s axiom. Journal of Algebra, 320, 2388–2404. [PDF]
  43. Droste, M., Göbel, R., & Pokutta, S. (2008). Absolute graphs with prescribed endomorphism monoid. Semigroup Forum, 76, 256–267. [PDF]
  44. Pokutta, S., & Strüngmann, L. (2007). The Chase radical and reduced products. Journal of Pure and Applied Algebra, 211, 532–540. [PDF]

Unpublished Manuscripts.

  1. Braun, G., & Pokutta, S. (2016). An efficient high-probability algorithm for Linear Bandits. Preprint. [arXiv]
  2. Braun, G., & Pokutta, S. (2015). An information diffusion Fano inequality. Preprint. [arXiv]
  3. Pokutta, S., & Schulz, A. S. (2013). On the rank of cutting-plane proof systems. Preprint. [arXiv]
  4. Braun, G., & Pokutta, S. (2012). An algebraic view on symmetric extended formulations. Preprint. [arXiv]
  5. Pokutta, S. (2012). Lower bounds for Chvátal-Gomory style operators. Preprint. [arXiv]
  6. Pokutta, S., Schmaltz, C., & Stiller, S. (2011). Measuring Systemic Risk and Contagion in Financial Networks. Preprint. [arXiv]
  7. Pokutta, S., & Schulz, A. S. (2009). On the connection of the Sherali-Adams closure and border bases. Preprint. [arXiv]
  8. Pokutta, S. (2008). Stowage optimization for inland vessels. Preprint.

Other.

  1. Lee, D., & Pokutta, S. (2015). Toward a Science of Autonomy for Physical Systems: Transportation. Computing Community Consortium White Paper. [PDF]
  2. Alf, M., & Pokutta, S. (2006). How logistics service providers can make use of the real options concept. Symposium Mathematik & Logistik, Bad Honnef 2005, Conference Proceedings.
  3. Heldt, D., Kreuzer, M., Pokutta, S., & Poulisse, H. (2006). Algebraische Modellierung mit Methoden der approximativen Computer Algebra und Anwendungen in der Ölindustrie. OR News, 15–18.
  4. Pokutta, S. (2005). Products over countable domains (PhD thesis). University of Duisburg-Essen.
  5. Pokutta, S., & Törner, G. (2005). Fixpunktminimierung bei Binnenschiffen. OR News, 23, 13–17.
  6. Pokutta, S. (2003). Generalizations of the Chase radical and direct products (Master's thesis). University of Duisburg-Essen.