List of Publications

Preprints

  1. Bolusani, S., Besançon, M., Bestuzheva, K., Chmiela, A., Dionísio, J., Donkiewicz, T., van Doornmalen, J., Eifler, L., Ghannam, M., Gleixner, A., Graczyk, C., Halbig, K., Hedtke, I., Hoen, A., Hojny, C., van der Hulst, R., Kamp, D., Koch, T., Kofler, K., … Xu, L. (2024). The SCIP Optimization Suite 9.0 (ZIB Report No. 24-02-29). Zuse Institute Berlin. [URL] [arXiv] [code]
    [BibTeX]
    @techreport{BolusaniEtal2024,
      year = {2024},
      institution = {Zuse Institute Berlin},
      type = {ZIB Report},
      month = feb,
      number = {24-02-29},
      url = {https://nbn-resolving.org/urn:nbn:de:0297-zib-95528},
      archiveprefix = {arXiv},
      eprint = {2402.17702},
      primaryclass = {math.OC},
      author = {Bolusani, Suresh and Besançon, Mathieu and Bestuzheva, Ksenia and Chmiela, Antonia and Dionísio, João and Donkiewicz, Tim and van Doornmalen, Jasper and Eifler, Leon and Ghannam, Mohammed and Gleixner, Ambros and Graczyk, Christoph and Halbig, Katrin and Hedtke, Ivo and Hoen, Alexander and Hojny, Christopher and van der Hulst, Rolf and Kamp, Dominik and Koch, Thorsten and Kofler, Kevin and Lentz, Jurgen and Manns, Julian and Mexi, Gioni and Mühmer, Erik and Pfetsch, Marc and Schlösser, Franziska and Serrano, Felipe and Shinano, Yuji and Turner, Mark and Vigerske, Stefan and Weninger, Dieter and Xu, Liding},
      title = {The SCIP Optimization Suite 9.0},
      code = {https://scipopt.org}
    }
  2. Borst, S., Eifler, L., and Gleixner, A. (2024). Certified Constraint Propagation and Dual Proof Analysis in a Numerically Exact MIP Solver. [arXiv]
    [BibTeX]
    @misc{BorstEiflerGleixner2024_CertifiedConstraintPropagation,
      archiveprefix = {arXiv},
      eprint = {2403.13567},
      primaryclass = {math.OC},
      year = {2024},
      author = {Borst, Sander and Eifler, Leon and Gleixner, Ambros},
      title = {Certified Constraint Propagation and Dual Proof Analysis in a Numerically Exact MIP Solver}
    }
  3. Halbig, K., Hoen, A., Gleixner, A., Witzig, J., and Weninger, D. (2024). A Diving Heuristic for Mixed-integer Problems with Unbounded Semi-continuous Variables. [arXiv]
    [BibTeX]
    @misc{HalbigHoenGleixnerWitzigWeninger2024_Adivingheuristic,
      archiveprefix = {arXiv},
      eprint = {2403.19411},
      primaryclass = {math.OC},
      year = {2024},
      author = {Halbig, Katrin and Hoen, Alexander and Gleixner, Ambros and Witzig, Jakob and Weninger, Dieter},
      title = {A Diving Heuristic for Mixed-integer Problems with Unbounded Semi-continuous Variables}
    }
  4. Hoen, A., Kamp, D., and Gleixner, A. (2024). MIP-DD: A Delta Debugger for Mixed Integer Programming Solvers. [arXiv]
    [BibTeX]
    @misc{HoenKampGleixner2024_Adeltadebugger,
      archiveprefix = {arXiv},
      eprint = {2405.19770},
      primaryclass = {math.OC},
      year = {2024},
      author = {Hoen, Alexander and Kamp, Dominik and Gleixner, Ambros},
      title = {MIP-DD: A Delta Debugger for Mixed Integer Programming Solvers}
    }
  5. Mundinger, K., Zimmer, M., and Pokutta, S. (2024). Neural Parameter Regression for Explicit Representations of PDE Solution Operators. [arXiv]
    [BibTeX]
    @misc{NeuralRegressionPDE2024,
      archiveprefix = {arXiv},
      eprint = {2403.12764},
      primaryclass = {cs.LG},
      year = {2024},
      author = {Mundinger, Konrad and Zimmer, Max and Pokutta, Sebastian},
      title = {Neural Parameter Regression for Explicit Representations of PDE Solution Operators}
    }
  6. Roux, C., Zimmer, M., and Pokutta, S. (2024). On the Byzantine-resilience of Distillation-based Federated Learning. [arXiv]
    [BibTeX]
    @misc{byzantinefederated2024,
      archiveprefix = {arXiv},
      eprint = {2402.12265},
      primaryclass = {cs.LG},
      year = {2024},
      author = {Roux, Christophe and Zimmer, Max and Pokutta, Sebastian},
      title = {On the Byzantine-resilience of Distillation-based Federated Learning}
    }
  7. Prause, F., and Borndörfer, R. (2024). An Iterative Refinement Approach for the Rolling Stock Rotation Problem with Predictive Maintenance. [arXiv]
    [BibTeX]
    @misc{fr_irars_2024,
      archiveprefix = {arXiv},
      eprint = {2404.08367},
      primaryclass = {math.OC},
      year = {2024},
      author = {Prause, Felix and Borndörfer, Ralf},
      title = {An Iterative Refinement Approach for the Rolling Stock Rotation Problem with Predictive Maintenance}
    }
  8. Göß, A., Martin, A., Pokutta, S., and Sharma, K. (2024). Norm-induced Cuts: Optimization with Lipschitzian Black-box Functions. [URL] [arXiv]
    [BibTeX]
    @misc{gmps_nic_23,
      url = {https://opus4.kobv.de/opus4-trr154/files/518/nic_preprint.pdf},
      archiveprefix = {arXiv},
      eprint = {2403.11546},
      primaryclass = {math.OC},
      year = {2024},
      author = {Göß, Adrian and Martin, Alexander and Pokutta, Sebastian and Sharma, Kartikey},
      title = {Norm-induced Cuts: Optimization with Lipschitzian Black-box Functions}
    }
  9. Prause, F. (2023). A Multi-Swap Heuristic for Rolling Stock Rotation Planning with Predictive Maintenance (ZIB Report No. 23-29). Zuse Institute Berlin. [URL]
    [BibTeX]
    @techreport{prause2023multi,
      year = {2023},
      institution = {Zuse Institute Berlin},
      type = {ZIB Report},
      month = dec,
      number = {23-29},
      url = {https://nbn-resolving.org/urn:nbn:de:0297-zib-93133},
      author = {Prause, Felix},
      title = {A Multi-Swap Heuristic for Rolling Stock Rotation Planning with Predictive Maintenance}
    }
  10. Prause, F., and Borndörfer, R. (2023). Construction of a Test Library for the Rolling Stock Rotation Problem with Predictive Maintenance (ZIB Report No. 23-20). Zuse Institute Berlin. [URL]
    [BibTeX]
    @techreport{fr_ctlrsp_2023,
      year = {2023},
      institution = {Zuse Institute Berlin},
      type = {ZIB Report},
      month = jul,
      number = {23-20},
      url = {https://nbn-resolving.org/urn:nbn:de:0297-zib-91734},
      author = {Prause, Felix and Borndörfer, Ralf},
      title = {Construction of a Test Library for the Rolling Stock Rotation Problem with Predictive Maintenance}
    }
  11. Wirth, E., Pena, J., and Pokutta, S. (2023). Accelerated Affine-invariant Convergence Rates of the Frank-Wolfe Algorithm with Open-loop Step-sizes. [arXiv]
    [BibTeX]
    @misc{FWopenLoopAccelerate2023,
      archiveprefix = {arXiv},
      eprint = {2310.04096},
      primaryclass = {math.OC},
      year = {2023},
      author = {Wirth, Elias and Pena, Javier and Pokutta, Sebastian},
      title = {Accelerated Affine-invariant Convergence Rates of the Frank-Wolfe Algorithm with Open-loop Step-sizes}
    }
  12. Stengl, S.-M., Gelß, P., Klus, S., and Pokutta, S. (2023). Existence and Uniqueness of Solutions of the Koopman–von Neumann Equation on Bounded Domains. [arXiv]
    [BibTeX]
    @misc{KoopmanNeumann2023,
      archiveprefix = {arXiv},
      eprint = {2306.13504},
      primaryclass = {math.AP},
      year = {2023},
      author = {Stengl, Steven-Marian and Gelß, Patrick and Klus, Stefan and Pokutta, Sebastian},
      title = {Existence and Uniqueness of Solutions of the Koopman--von Neumann Equation on Bounded Domains}
    }
  13. Turner, M., Chmiela, A., Koch, T., and Winkler, M. (2023). PySCIPOpt-ML: Embedding Trained Machine Learning Models Into Mixed-integer Programs. [arXiv]
    [BibTeX]
    @misc{TurnerChmielaKochWinkler2023_EmbeddingMLinMIPs,
      archiveprefix = {arXiv},
      eprint = {2312.08074},
      primaryclass = {math.OC},
      year = {2023},
      author = {Turner, Mark and Chmiela, Antonia and Koch, Thorsten and Winkler, Michael},
      title = {PySCIPOpt-ML: Embedding Trained Machine Learning Models Into Mixed-integer Programs}
    }
  14. Sharma, S., Mahmud, A., Tarabella, G., Mougoyannis, P., and Adamatzky, A. (2023). On Morphological and Functional Complexity of Proteinoid Microspheres. [arXiv]
    [BibTeX]
    @misc{arXiv:2306.11458,
      archiveprefix = {arXiv},
      eprint = {2306.11458},
      primaryclass = {physics.flu-dyn},
      year = {2023},
      author = {Sharma, Saksham and Mahmud, Adnan and Tarabella, Giuseppe and Mougoyannis, Panagiotis and Adamatzky, Andrew},
      title = {On Morphological and Functional Complexity of Proteinoid Microspheres}
    }
  15. Eifler, L., Nicolas-Thouvenin, J., and Gleixner, A. (2023). Combining Precision Boosting with LP Iterative Refinement for Exact Linear Optimization. [arXiv]
    [BibTeX]
    @misc{arXiv:2311.08037,
      archiveprefix = {arXiv},
      eprint = {2311.08037},
      primaryclass = {math.OC},
      year = {2023},
      author = {Eifler, Leon and Nicolas-Thouvenin, Jules and Gleixner, Ambros},
      title = {Combining Precision Boosting with LP Iterative Refinement for Exact Linear Optimization}
    }
  16. Gelß, P., Issagali, A., and Kornhuber, R. (2023). Fredholm Integral Equations for Function Approximation and the Training of Neural Networks. [arXiv]
    [BibTeX]
    @misc{gik_fredholm_23,
      archiveprefix = {arXiv},
      eprint = {2303.05262},
      primaryclass = {math.NA},
      year = {2023},
      author = {Gelß, Patrick and Issagali, Aizhan and Kornhuber, Ralf},
      title = {Fredholm Integral Equations for Function Approximation and the Training of Neural Networks}
    }
  17. Gelß, P., Klein, R., Matera, S., and Schmidt, B. (2023). Quantum Dynamics of Coupled Excitons and Phonons in Chain-like Systems: Tensor Train Approaches and Higher-order Propagators. [arXiv]
    [BibTeX]
    @misc{gkms_tdse_23,
      archiveprefix = {arXiv},
      eprint = {2302.03568},
      primaryclass = {quant-ph},
      year = {2023},
      author = {Gelß, Patrick and Klein, Rupert and Matera, Sebastian and Schmidt, Burkhard},
      title = {Quantum Dynamics of Coupled Excitons and Phonons in Chain-like Systems: Tensor Train Approaches and Higher-order Propagators}
    }
  18. Sadiku, S., Wagner, M., and Pokutta, S. (2023). Group-wise Sparse and Explainable Adversarial Attacks. [arXiv]
    [BibTeX]
    @misc{groupadversarialattack2023,
      archiveprefix = {arXiv},
      eprint = {2311.17434},
      primaryclass = {cs.CV},
      year = {2023},
      author = {Sadiku, Shpresim and Wagner, Moritz and Pokutta, Sebastian},
      title = {Group-wise Sparse and Explainable Adversarial Attacks}
    }
  19. Klus, S., and Gelß, P. (2023). Continuous Optimization Methods for the Graph Isomorphism Problem. [arXiv]
    [BibTeX]
    @misc{kg_graph_isomorphism,
      archiveprefix = {arXiv},
      eprint = {2311.16912},
      primaryclass = {cs.DM},
      year = {2023},
      author = {Klus, Stefan and Gelß, Patrick},
      title = {Continuous Optimization Methods for the Graph Isomorphism Problem}
    }
  20. Deza, A., Onn, S., Pokutta, S., and Pournin, L. (2023). Kissing Polytopes. [arXiv]
    [BibTeX]
    @misc{kissing_polytopes_2023,
      archiveprefix = {arXiv},
      eprint = {2305.18597},
      primaryclass = {math.MG},
      year = {2023},
      author = {Deza, Antoine and Onn, Shmuel and Pokutta, Sebastian and Pournin, Lionel},
      title = {Kissing Polytopes}
    }
  21. Abbas, A., Ambainis, A., Augustino, B., Bärtschi, A., Buhrman, H., Coffrin, C., Cortiana, G., Dunjko, V., Egger, D. J., Elmegreen, B. G., Franco, N., Fratini, F., Fuller, B., Gacon, J., Gonciulea, C., Gribling, S., Gupta, S., Hadfield, S., Heese, R., … Zoufal, C. (2023). Quantum Optimization: Potential, Challenges, and the Path Forward. [arXiv]
    [BibTeX]
    @misc{qopc_path2023,
      archiveprefix = {arXiv},
      eprint = {2312.02279},
      primaryclass = {quant-ph},
      year = {2023},
      author = {Abbas, Amira and Ambainis, Andris and Augustino, Brandon and Bärtschi, Andreas and Buhrman, Harry and Coffrin, Carleton and Cortiana, Giorgio and Dunjko, Vedran and Egger, Daniel J. and Elmegreen, Bruce G. and Franco, Nicola and Fratini, Filippo and Fuller, Bryce and Gacon, Julien and Gonciulea, Constantin and Gribling, Sander and Gupta, Swati and Hadfield, Stuart and Heese, Raoul and Kircher, Gerhard and Kleinert, Thomas and Koch, Thorsten and Korpas, Georgios and Lenk, Steve and Marecek, Jakub and Markov, Vanio and Mazzola, Guglielmo and Mensa, Stefano and Mohseni, Naeimeh and Nannicini, Giacomo and O'Meara, Corey and Tapia, Elena Peña and Pokutta, Sebastian and Proissl, Manuel and Rebentrost, Patrick and Sahin, Emre and Symons, Benjamin C. B. and Tornow, Sabine and Valls, Victor and Woerner, Stefan and Wolf-Bauwens, Mira L. and Yard, Jon and Yarkoni, Sheir and Zechiel, Dirk and Zhuk, Sergiy and Zoufal, Christa},
      title = {Quantum Optimization: Potential, Challenges, and the Path Forward}
    }
  22. Scieur, D., Kerdreux, T., Martínez-Rubio, D., d’Aspremont, A., and Pokutta, S. (2023). Strong Convexity of Sets in Riemannian Manifolds. [arXiv]
    [BibTeX]
    @misc{skmap_strong_convexity_of_sets_in_riemannian_manifolds_23,
      archiveprefix = {arXiv},
      eprint = {2312.03583},
      primaryclass = {math.OC},
      year = {2023},
      author = {Scieur, Damien and Kerdreux, Thomas and Martínez-Rubio, David and d'Aspremont, Alexandre and Pokutta, Sebastian},
      title = {Strong Convexity of Sets in Riemannian Manifolds}
    }
  23. Woodstock, Z., and Pokutta, S. (2023). Splitting the Conditional Gradient Algorithm. [arXiv]
    [BibTeX]
    @misc{splitcg2023,
      archiveprefix = {arXiv},
      eprint = {2311.05381},
      primaryclass = {math.OC},
      year = {2023},
      author = {Woodstock, Zev and Pokutta, Sebastian},
      title = {Splitting the Conditional Gradient Algorithm}
    }
  24. Stengl, S.-M. (2023). An Alternative Formulation of the Quantum Phase Estimation Using Projection-based Tensor Decompositions. [arXiv]
    [BibTeX]
    @misc{stengl_qpe_23,
      archiveprefix = {arXiv},
      eprint = {2303.05894},
      primaryclass = {quant-ph},
      year = {2023},
      author = {Stengl, Steven-Marian},
      title = {An Alternative Formulation of the Quantum Phase Estimation Using Projection-based Tensor Decompositions}
    }
  25. van Doornmalen, J., Eifler, L., Gleixner, A., and Hojny, C. (2023). A Proof System for Certifying Symmetry and Optimality Reasoning in Integer Programming. [arXiv]
    [BibTeX]
    @misc{vanDoornmalenEiflerGleixnerHojny2023,
      archiveprefix = {arXiv},
      eprint = {2311.03877},
      primaryclass = {math.OC},
      year = {2023},
      author = {van Doornmalen, Jasper and Eifler, Leon and Gleixner, Ambros and Hojny, Christopher},
      title = {A Proof System for Certifying Symmetry and Optimality Reasoning in Integer Programming}
    }
  26. Zimmer, M., Andoni, M., Spiegel, C., and Pokutta, S. (2023). PERP: Rethinking the Prune-Retrain Paradigm in the Era of LLMs. [arXiv] [code]
    [BibTeX]
    @misc{zasp_perp_23,
      archiveprefix = {arXiv},
      eprint = {2312.15230},
      primaryclass = {cs.LG},
      year = {2023},
      author = {Zimmer, Max and Andoni, Megi and Spiegel, Christoph and Pokutta, Sebastian},
      title = {PERP: Rethinking the Prune-Retrain Paradigm in the Era of LLMs},
      code = {https://github.com/ZIB-IOL/PERP}
    }
  27. Braun, G., Pokutta, S., and Weismantel, R. (2022). Alternating Linear Minimization: Revisiting von Neumann’s Alternating Projections. [arXiv] [slides] [video]
    [BibTeX]
    @misc{alternating_lmo_2022,
      archiveprefix = {arXiv},
      eprint = {2212.02933},
      primaryclass = {math.OC},
      year = {2022},
      author = {Braun, Gábor and Pokutta, Sebastian and Weismantel, Robert},
      title = {Alternating Linear Minimization: Revisiting von Neumann’s Alternating Projections},
      slides = {https://pokutta.com/slides/20230327-icerm.pdf},
      video = {https://icerm.brown.edu/programs/sp-s23/w2/#schedule-item-4945}
    }
  28. Sharma, S., Marcucci, G., and Mahmud, A. (2022). A Complexity Perspective on Fluid Mechanics. [arXiv]
    [BibTeX]
    @misc{arXiv:2212.00153,
      archiveprefix = {arXiv},
      eprint = {2212.00153},
      primaryclass = {physics.flu-dyn},
      year = {2022},
      author = {Sharma, Saksham and Marcucci, Giulia and Mahmud, Adnan},
      title = {A Complexity Perspective on Fluid Mechanics}
    }
  29. Braun, G., Carderera, A., Combettes, C., Hassani, H., Karbasi, A., Mokhtari, A., and Pokutta, S. (2022). Conditional Gradient Methods. [arXiv]
    [BibTeX]
    @misc{fw_survey_2022,
      archiveprefix = {arXiv},
      eprint = {2211.14103},
      primaryclass = {math.OC},
      year = {2022},
      author = {Braun, Gábor and Carderera, Alejandro and Combettes, Cyrille and Hassani, Hamed and Karbasi, Amin and Mokhtari, Aryan and Pokutta, Sebastian},
      title = {Conditional Gradient Methods}
    }
  30. Gelß, P., Klus, S., Shakibaei, Z., and Pokutta, S. (2022). Low-rank Tensor Decompositions of Quantum Circuits. [arXiv]
    [BibTeX]
    @misc{gksp_lowrankqc_22,
      archiveprefix = {arXiv},
      eprint = {2205.09882},
      primaryclass = {quant-ph},
      year = {2022},
      author = {Gelß, Patrick and Klus, Stefan and Shakibaei, Zarin and Pokutta, Sebastian},
      title = {Low-rank Tensor Decompositions of Quantum Circuits}
    }
  31. Hendrych, D., Troppens, H., Besançon, M., and Pokutta, S. (2022). Convex Integer Optimization with Frank-Wolfe Methods. [arXiv] [slides] [code]
    [BibTeX]
    @misc{htbp_cio_22,
      archiveprefix = {arXiv},
      eprint = {2208.11010},
      primaryclass = {math.OC},
      year = {2022},
      author = {Hendrych, Deborah and Troppens, Hannah and Besançon, Mathieu and Pokutta, Sebastian},
      title = {Convex Integer Optimization with Frank-Wolfe Methods},
      code = {https://github.com/ZIB-IOL/Boscia.jl},
      slides = {https://pokutta.com/slides/20220915_boscia.pdf}
    }
  32. Zimmer, M., Spiegel, C., and Pokutta, S. (2022). Compression-aware Training of Neural Networks Using Frank-Wolfe. [arXiv]
    [BibTeX]
    @misc{zsp_deepsparsefw_22,
      archiveprefix = {arXiv},
      eprint = {2205.11921},
      primaryclass = {cs.LG},
      year = {2022},
      author = {Zimmer, Max and Spiegel, Christoph and Pokutta, Sebastian},
      title = {Compression-aware Training of Neural Networks Using Frank-Wolfe}
    }
  33. Bestuzheva, K., Besançon, M., Chen, W.-K., Chmiela, A., Donkiewicz, T., van Doornmalen, J., Eifler, L., Gaul, O., Gamrath, G., Gleixner, A., Gottwald, L., Graczyk, C., Halbig, K., Hoen, A., Hojny, C., van der Hulst, R., Koch, T., Lübbecke, M., Maher, S. J., … Witzig, J. (2021). The SCIP Optimization Suite 8.0 (ZIB Report No. 21-41). Zuse Institute Berlin. [URL] [code]
    [BibTeX]
    @techreport{BestuzhevaBesanconEtal2021,
      year = {2021},
      institution = {Zuse Institute Berlin},
      type = {ZIB Report},
      month = dec,
      number = {21-41},
      url = {https://nbn-resolving.org/urn:nbn:de:0297-zib-85309},
      author = {Bestuzheva, Ksenia and Besançon, Mathieu and Chen, Wei-Kun and Chmiela, Antonia and Donkiewicz, Tim and van Doornmalen, Jasper and Eifler, Leon and Gaul, Oliver and Gamrath, Gerald and Gleixner, Ambros and Gottwald, Leona and Graczyk, Christoph and Halbig, Katrin and Hoen, Alexander and Hojny, Christopher and van der Hulst, Rolf and Koch, Thorsten and Lübbecke, Marco and Maher, Stephen J. and Matter, Frederic and Mühmer, Erik and Müller, Benjamin and Pfetsch, Marc and Rehfeldt, Daniel and Schlein, Steffan and Schlösser, Franziska and Serrano, Felipe and Shinano, Yuji and Sofranac, Boro and Turner, Mark and Vigerske, Stefan and Wegscheider, Fabian and Wellner, Philipp and Weninger, Dieter and Witzig, Jakob},
      title = {The SCIP Optimization Suite 8.0},
      code = {https://scipopt.org}
    }
  34. Kerdreux, T., d’Aspremont, A., and Pokutta, S. (2021). Local and Global Uniform Convexity Conditions. Preprint. [arXiv]
    [BibTeX]
    @article{KAP2021,
      arxiv = {https://arxiv.org/abs/2102.05134},
      author = {Kerdreux, Thomas and d'Aspremont, Alexandre and Pokutta, Sebastian},
      month = feb,
      journal = {preprint},
      title = {{Local and Global Uniform Convexity Conditions}},
      year = {2021}
    }
  35. Carderera, A., Pokutta, S., Schütte, C., and Weiser, M. (2021). CINDy: Conditional gradient-based Identification of Non-linear Dynamics – Noise-robust recovery. Preprint. [arXiv] [summary]
    [BibTeX]
    @article{PSZ2020,
      arxiv = {https://arxiv.org/abs/2101.02630},
      author = {Carderera, Alejandro and Pokutta, Sebastian and Schütte, Christof and Weiser, Martin},
      month = jan,
      journal = {preprint},
      summary = {http://www.pokutta.com/blog/research/2021/01/16/cindy.html},
      title = {{CINDy: Conditional gradient-based Identification of Non-linear Dynamics -- Noise-robust recovery}},
      year = {2021}
    }
  36. Bolusani, S., Coniglio, S., Ralphs, T. K., and Tahernejad, S. (2021). A Unified Framework for Multistage Mixed Integer Linear Optimization. [arXiv]
    [BibTeX]
    @misc{BolConRalTah20,
      archiveprefix = {arXiv},
      eprint = {2104.09003},
      primaryclass = {math.OC},
      year = {2021},
      author = {Bolusani, Suresh and Coniglio, Stefano and Ralphs, Ted K. and Tahernejad, Sahar},
      title = {A Unified Framework for Multistage Mixed Integer Linear Optimization}
    }
  37. Braun, G., and Pokutta, S. (2021). Dual Prices for Frank–Wolfe Algorithms. [arXiv]
    [BibTeX]
    @misc{dual_prices_FW_2021,
      archiveprefix = {arXiv},
      eprint = {2101.02087},
      primaryclass = {math.OC},
      year = {2021},
      author = {Braun, Gábor and Pokutta, Sebastian},
      title = {Dual Prices for Frank–Wolfe Algorithms}
    }
  38. Roux, C., Wirth, E., Pokutta, S., and Kerdreux, T. (2021). Efficient Online-bandit Strategies for Minimax Learning Problems. [arXiv]
    [BibTeX]
    @misc{online.bandit-minimax_2021,
      archiveprefix = {arXiv},
      eprint = {2105.13939},
      primaryclass = {cs.LG},
      year = {2021},
      author = {Roux, Christophe and Wirth, Elias and Pokutta, Sebastian and Kerdreux, Thomas},
      title = {Efficient Online-bandit Strategies for Minimax Learning Problems}
    }
  39. Combettes, C., Spiegel, C., and Pokutta, S. (2020). Projection-free Adaptive Gradients for Large-scale Optimization. [arXiv] [summary] [code]
    [BibTeX]
    @misc{csp_adafw_20,
      archiveprefix = {arXiv},
      eprint = {2009.14114},
      primaryclass = {math.OC},
      year = {2020},
      author = {Combettes, Cyrille and Spiegel, Christoph and Pokutta, Sebastian},
      title = {Projection-free Adaptive Gradients for Large-scale Optimization},
      code = {https://github.com/ZIB-IOL/StochasticFrankWolfe},
      summary = {https://pokutta.com/blog/research/2020/10/21/adasfw.html}
    }
  40. Pokutta, S., Spiegel, C., and Zimmer, M. (2020). Deep Neural Network Training with Frank-Wolfe. [arXiv] [summary] [code]
    [BibTeX]
    @misc{zsp_deepfw_20,
      archiveprefix = {arXiv},
      eprint = {2010.07243},
      primaryclass = {cs.LG},
      year = {2020},
      author = {Pokutta, Sebastian and Spiegel, Christoph and Zimmer, Max},
      title = {Deep Neural Network Training with Frank-Wolfe},
      code = {https://github.com/ZIB-IOL/StochasticFrankWolfe},
      summary = {https://pokutta.com/blog/research/2020/11/11/NNFW.html}
    }
  41. Carderera, A., and Pokutta, S. (2020). Second-order Conditional Gradient Sliding. Preprint. [arXiv] [summary] [code]
    [BibTeX]
    @article{CaP2020,
      arxiv = {https://arxiv.org/abs/2002.08907},
      author = {Carderera, Alejandro and Pokutta, Sebastian},
      code = {https://github.com/pokutta/Second-order-Conditional-Gradients},
      journal = {{preprint}},
      summary = {http://www.pokutta.com/blog/research/2020/06/20/socgs.html},
      title = {{Second-order Conditional Gradient Sliding}},
      year = {2020}
    }
  42. Salia, N., Spiegel, C., Tompkins, C., and Zamora, O. (2019). Independent Chains in Acyclic Posets. [arXiv]
    [BibTeX]
    @misc{sstz_poset_19,
      archiveprefix = {arXiv},
      eprint = {1912.03288},
      primaryclass = {math.CO},
      year = {2019},
      author = {Salia, Nika and Spiegel, Christoph and Tompkins, Casey and Zamora, Oscar},
      title = {Independent Chains in Acyclic Posets}
    }
  43. Gelß, P., and Schütte, C. (2018). Tensor-generated Fractals - Using Tensor Decompositions for Creating Self-similar Patterns. [arXiv]
    [BibTeX]
    @misc{gs_fractals_18,
      archiveprefix = {arXiv},
      eprint = {1812.00814},
      primaryclass = {math.GM},
      year = {2018},
      author = {Gelß, Patrick and Schütte, Christof},
      title = {Tensor-generated Fractals - Using Tensor Decompositions for Creating Self-similar Patterns}
    }
  44. Bärmann, A., Martin, A., Pokutta, S., and Schneider, O. (2018). An Online-Learning Approach to Inverse Optimization. Submitted. [arXiv] [summary] [slides]
    [BibTeX]
    @article{BPS2017jour,
      arxiv = {https://arxiv.org/abs/1810.12997},
      author = {B{\"a}rmann, Andreas and Martin, Alexander and Pokutta, Sebastian and Schneider, Oskar},
      journal = {Submitted},
      slides = {https://app.box.com/s/7ti8sz8mf5s2znn1qo32in4jxy5gjnn1},
      summary = {http://www.pokutta.com/blog/research/2018/11/25/expertLearning-abstract.html},
      title = {{An Online-Learning Approach to Inverse Optimization}},
      year = {2018}
    }
  45. Braun, G., and Pokutta, S. (2016). An Efficient High-probability Algorithm for Linear Bandits. [arXiv]
    [BibTeX]
    @misc{Braun2016bandit,
      archiveprefix = {arXiv},
      eprint = {1610.02072},
      primaryclass = {cs.DS},
      year = {2016},
      author = {Braun, Gábor and Pokutta, Sebastian},
      title = {An Efficient High-probability Algorithm for Linear Bandits}
    }
  46. Braun, G., and Pokutta, S. (2015). An Information Diffusion Fano Inequality. [arXiv]
    [BibTeX]
    @misc{Braun2015Fano,
      archiveprefix = {arXiv},
      eprint = {1504.05492},
      primaryclass = {cs.IT},
      year = {2015},
      author = {Braun, Gábor and Pokutta, Sebastian},
      title = {An Information Diffusion Fano Inequality}
    }
  47. Hintermüller, M., and Stengl, S.-M. A Generalized 𝛤-convergence Concept for a Type of Equilibrium Problems. [URL]
    [BibTeX]
    @misc{HintStengl_GammaConvergenceEquilibrium,
      url = {https://wias-berlin.de/publications/wias-publ/run.jsp?template=abstract&type=Preprint&year=2021&number=2879},
      author = {Hintermüller, Michael and Stengl, Steven-Marian},
      title = {A Generalized 𝛤-convergence Concept for a Type of Equilibrium Problems}
    }
  48. Hintermüller, M., and Stengl, S.-M. On the Convexity of Optimal Control Problems Involving Non-linear PDEs or VIs and Applications to Nash Games. [URL]
    [BibTeX]
    @misc{HintStengl_VectorValuedConvexity,
      url = {https://wias-berlin.de/publications/wias-publ/run.jsp?template=abstract&type=Preprint&year=2020&number=2759},
      author = {Hintermüller, Michael and Stengl, Steven-Marian},
      title = {On the Convexity of Optimal Control Problems Involving Non-linear PDEs or VIs and Applications to Nash Games}
    }
  49. Stengl, S.-M. Combined Regularization and Discretization of Equilibrium Problems and Primal-dual Gap Estimators. [arXiv]
    [BibTeX]
    @misc{Stengl_AFEMQVI,
      archiveprefix = {arXiv},
      eprint = {2110.02817},
      primaryclass = {math.NA},
      author = {Stengl, Steven-Marian},
      title = {Combined Regularization and Discretization of Equilibrium Problems and Primal-dual Gap Estimators}
    }
  50. Stengl, S.-M. Path-following Methods for Generalized Nash Equilibrium Problems. [arXiv]
    [BibTeX]
    @misc{Stengl_PathFollowingGNEP,
      archiveprefix = {arXiv},
      eprint = {2110.10627},
      primaryclass = {math.OC},
      author = {Stengl, Steven-Marian},
      title = {Path-following Methods for Generalized Nash Equilibrium Problems}
    }
  51. Turner, M., Berthold, T., Besançon, M., and Koch, T. Branching Via Cutting Plane Selection: Improving Hybrid Branching. [arXiv]
    [BibTeX]
    @misc{branching_cutsel_23,
      archiveprefix = {arXiv},
      eprint = {2306.06050},
      primaryclass = {math.OC},
      author = {Turner, Mark and Berthold, Timo and Besançon, Mathieu and Koch, Thorsten},
      title = {Branching Via Cutting Plane Selection: Improving Hybrid Branching}
    }
  52. Böttcher, J., Frankl, N., Cecchelli, D. M., Skokan, J., and Parczyk, O. Graphs with Large Minimum Degree and No Small Odd Cycles Are 3-colourable. [arXiv]
    [BibTeX]
    @misc{large_min_degree_2023,
      archiveprefix = {arXiv},
      eprint = {2302.01875},
      author = {Böttcher, Julia and Frankl, Nóra and Cecchelli, Domenico Mergoni and Skokan, Jozef and Parczyk, Olaf},
      title = {Graphs with Large Minimum Degree and No Small Odd Cycles Are 3-colourable}
    }
  53. Hahn-Klimroth, M., Person, Y., and Parczyk, O. Minimum Degree Conditions for Containing an R-regular R-connected Subgraph. [arXiv]
    [BibTeX]
    @misc{min_degree_conditions_2021,
      archiveprefix = {arXiv},
      eprint = {2108.07601},
      author = {Hahn-Klimroth, Max and Person, Yury and Parczyk, Olaf},
      title = {Minimum Degree Conditions for Containing an R-regular R-connected Subgraph}
    }
  54. Mattos, L., Cecchelli, D. M., and Parczyk, O. On Product Schur Triples in the Integers. [arXiv]
    [BibTeX]
    @misc{schur_triples_2023,
      archiveprefix = {arXiv},
      eprint = {2311.18796},
      author = {Mattos, Letícia and Cecchelli, Domenico Mergoni and Parczyk, Olaf},
      title = {On Product Schur Triples in the Integers}
    }
  55. Allen, P., Pfenninger, V., and Parczyk, O. Resilience for Tight Hamiltonicity. [arXiv]
    [BibTeX]
    @misc{tight_hamiltonicity_2021,
      archiveprefix = {arXiv},
      eprint = {2105.04513},
      author = {Allen, Peter and Pfenninger, Vincent and Parczyk, Olaf},
      title = {Resilience for Tight Hamiltonicity}
    }

Conference Proceedings

  1. Eifler, L., Witzig, J., and Gleixner, A. (2024). Branch and Cut for Partitioning a Graph Into a Cycle of Clusters. Proceedings of International Symposium on Combinatorial Optimization. DOI: 10.1007/978-3-031-60924-4_8 [arXiv]
    [BibTeX]
    @inproceedings{EiflerWitzigGleixner2024,
      year = {2024},
      booktitle = {Proceedings of International Symposium on Combinatorial Optimization},
      doi = {10.1007/978-3-031-60924-4_8},
      archiveprefix = {arXiv},
      eprint = {2401.08412},
      primaryclass = {math.OC},
      author = {Eifler, Leon and Witzig, Jakob and Gleixner, Ambros},
      title = {Branch and Cut for Partitioning a Graph Into a Cycle of Clusters}
    }
  2. Ghannam, M., Mexi, G., Lam, E., and Gleixner, A. (2024). Branch and Price for the Length-constrained Cycle Partition Problem. Proceedings of INFORMS Optimization Society Conference. [URL] [arXiv]
    [BibTeX]
    @inproceedings{GhannamMexiLamGleixner2024,
      year = {2024},
      booktitle = {Proceedings of INFORMS Optimization Society Conference},
      url = {https://sites.google.com/view/ios2024refereed},
      archiveprefix = {arXiv},
      eprint = {2401.17937},
      primaryclass = {math.OC},
      author = {Ghannam, Mohammed and Mexi, Gioni and Lam, Edward and Gleixner, Ambros},
      title = {Branch and Price for the Length-constrained Cycle Partition Problem}
    }
  3. Hoen, A., Oertel, A., Gleixner, A., and Nordström, J. (2024). Certifying MIP-based Presolve Reductions for 0-1 Integer Linear Programs. Proceedings of International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 310–328. DOI: 10.1007/978-3-031-60597-0_20 [arXiv]
    [BibTeX]
    @inproceedings{HoenOertelGleixnerNordstroem2024,
      year = {2024},
      booktitle = {Proceedings of International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research},
      pages = {310-328},
      doi = {10.1007/978-3-031-60597-0_20},
      archiveprefix = {arXiv},
      eprint = {2401.09277},
      primaryclass = {math.OC},
      author = {Hoen, Alexander and Oertel, Andy and Gleixner, Ambros and Nordström, Jakob},
      title = {Certifying MIP-based Presolve Reductions for 0-1 Integer Linear Programs}
    }
  4. Sharma, K., Hendrych, D., Besançon, M., and Pokutta, S. (2024). Network Design for the Traffic Assignment Problem with Mixed-Integer Frank-Wolfe. Proceedings of INFORMS Optimization Society Conference. [arXiv]
    [BibTeX]
    @inproceedings{SharmaNetworkDesignTrafficFrankWolfe24,
      year = {2024},
      booktitle = {Proceedings of INFORMS Optimization Society Conference},
      archiveprefix = {arXiv},
      eprint = {2402.00166},
      primaryclass = {math.OC},
      author = {Sharma, Kartikey and Hendrych, Deborah and Besançon, Mathieu and Pokutta, Sebastian},
      title = {Network Design for the Traffic Assignment Problem with Mixed-Integer Frank-Wolfe}
    }
  5. Pauls, J., Zimmer, M., Kelly, U. M., Schwartz, M., Saatchi, S., Ciais, P., Pokutta, S., Brandt, M., and Gieseke, F. (2024). Estimating Canopy Height at Scale. Proceedings of International Conference on Machine Learning. [arXiv] [code]
    [BibTeX]
    @inproceedings{canopy2024,
      year = {2024},
      booktitle = {Proceedings of International Conference on Machine Learning},
      archiveprefix = {arXiv},
      eprint = {2406.01076},
      primaryclass = {cs.CV},
      author = {Pauls, Jan and Zimmer, Max and Kelly, Una M and Schwartz, Martin and Saatchi, Sassan and Ciais, Philippe and Pokutta, Sebastian and Brandt, Martin and Gieseke, Fabian},
      title = {Estimating Canopy Height at Scale},
      code = {https://github.com/AI4Forest/Global-Canopy-Height-Map}
    }
  6. Hendrych, D., Besançon, M., and Pokutta, S. (2024). Solving the Optimal Experiment Design Problem with Mixed-integer Convex Methods. Proceedings of Symposium on Experimental Algorithms. [arXiv] [code]
    [BibTeX]
    @inproceedings{design_of_experiments_boscia_23,
      year = {2024},
      booktitle = {Proceedings of Symposium on Experimental Algorithms},
      archiveprefix = {arXiv},
      eprint = {2312.11200},
      primaryclass = {math.OC},
      author = {Hendrych, Deborah and Besançon, Mathieu and Pokutta, Sebastian},
      title = {Solving the Optimal Experiment Design Problem with Mixed-integer Convex Methods},
      code = {https://github.com/ZIB-IOL/OptimalDesignWithBoscia}
    }
  7. Kiem, A., Pokutta, S., and Spiegel, C. (2024). Categorification of Flag Algebras. Proceedings of Discrete Mathematics Days.
    [BibTeX]
    @inproceedings{kps_flagalgebracategory_24,
      year = {2024},
      booktitle = {Proceedings of Discrete Mathematics Days},
      author = {Kiem, Aldo and Pokutta, Sebastian and Spiegel, Christoph},
      title = {Categorification of Flag Algebras}
    }
  8. Kiem, A., Pokutta, S., and Spiegel, C. (2024). The 4-color Ramsey Multiplicity of Triangles. Proceedings of Discrete Mathematics Days. [arXiv] [code]
    [BibTeX]
    @inproceedings{kps_flagalgebrasymmetries_22,
      year = {2024},
      booktitle = {Proceedings of Discrete Mathematics Days},
      archiveprefix = {arXiv},
      eprint = {2312.08049},
      primaryclass = {math.CO},
      author = {Kiem, Aldo and Pokutta, Sebastian and Spiegel, Christoph},
      title = {The 4-color Ramsey Multiplicity of Triangles},
      code = {https://github.com/FordUniver/kps_trianglemult}
    }
  9. Mundinger, K., Pokutta, S., Spiegel, C., and Zimmer, M. (2024). Extending the Continuum of Six-Colorings. Proceedings of Discrete Mathematics Days. [arXiv]
    [BibTeX]
    @inproceedings{mpsz_hadwigernelsonspectrum_24:1,
      year = {2024},
      booktitle = {Proceedings of Discrete Mathematics Days},
      archiveprefix = {arXiv},
      eprint = {2404.05509},
      author = {Mundinger, Konrad and Pokutta, Sebastian and Spiegel, Christoph and Zimmer, Max},
      title = {Extending the Continuum of Six-Colorings}
    }
  10. Martínez-Rubio, D., Roux, C., and Pokutta, S. (2024). Convergence and Trade-offs in Riemannian Gradient Descent and Riemannian Proximal Point. Proceedings of International Conference on Machine Learning. [arXiv]
    [BibTeX]
    @inproceedings{mrp_tradeoffs_riemannian_gradient_descent_23,
      year = {2024},
      booktitle = {Proceedings of International Conference on Machine Learning},
      archiveprefix = {arXiv},
      eprint = {2403.10429},
      primaryclass = {math.OC},
      author = {Martínez-Rubio, David and Roux, Christophe and Pokutta, Sebastian},
      title = {Convergence and Trade-offs in Riemannian Gradient Descent and Riemannian Proximal Point}
    }
  11. Mexi, G., Shamsi, S., Besançon, M., and le Bodic, P. (2024). Probabilistic Lookahead Strong Branching Via a Stochastic Abstract Branching Model. Proceedings of International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research. [arXiv]
    [BibTeX]
    @inproceedings{probabilistic_lookahead_23,
      year = {2024},
      booktitle = {Proceedings of International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research},
      archiveprefix = {arXiv},
      eprint = {2312.07041},
      primaryclass = {math.OC},
      author = {Mexi, Gioni and Shamsi, Somayeh and Besançon, Mathieu and le Bodic, Pierre},
      title = {Probabilistic Lookahead Strong Branching Via a Stochastic Abstract Branching Model}
    }
  12. Wäldchen, S., Sharma, K., Zimmer, M., Turan, B., and Pokutta, S. (2024). Merlin-Arthur Classifiers: Formal Interpretability with Interactive Black Boxes. Proceedings of International Conference on Artificial Intelligence and Statistics. [arXiv]
    [BibTeX]
    @inproceedings{wszp_merlinarthur_22,
      year = {2024},
      booktitle = {Proceedings of International Conference on Artificial Intelligence and Statistics},
      archiveprefix = {arXiv},
      eprint = {2206.00759},
      primaryclass = {cs.LG},
      author = {Wäldchen, Stephan and Sharma, Kartikey and Zimmer, Max and Turan, Berkant and Pokutta, Sebastian},
      title = {Merlin-Arthur Classifiers: Formal Interpretability with Interactive Black Boxes}
    }
  13. Zimmer, M., Spiegel, C., and Pokutta, S. (2024). Sparse Model Soups: A Recipe for Improved Pruning Via Model Averaging. Proceedings of International Conference on Learning Representations. [arXiv]
    [BibTeX]
    @inproceedings{zsp_modelsoup_23,
      year = {2024},
      booktitle = {Proceedings of International Conference on Learning Representations},
      archiveprefix = {arXiv},
      eprint = {2306.16788},
      primaryclass = {cs.LG},
      author = {Zimmer, Max and Spiegel, Christoph and Pokutta, Sebastian},
      title = {Sparse Model Soups: A Recipe for Improved Pruning Via Model Averaging}
    }
  14. Bestuzheva, K., Gleixner, A., and Achterberg, T. (2023). Efficient Separation of RLT Cuts for Implicit and Explicit Bilinear Products. Proceedings of Conference on Integer Programming and Combinatorial Optimization, 14–28. DOI: 10.1007/978-3-031-32726-1_2 [arXiv]
    [BibTeX]
    @inproceedings{BestuzhevaGleixnerAchterberg2023_EfficientSeparationOfRLT,
      year = {2023},
      booktitle = {Proceedings of Conference on Integer Programming and Combinatorial Optimization},
      pages = {14-28},
      doi = {10.1007/978-3-031-32726-1_2},
      archiveprefix = {arXiv},
      eprint = {2211.13545},
      primaryclass = {math.OC},
      author = {Bestuzheva, Ksenia and Gleixner, Ambros and Achterberg, Tobias},
      title = {Efficient Separation of RLT Cuts for Implicit and Explicit Bilinear Products}
    }
  15. Chmiela, A., Gleixner, A., Lichocki, P., and Pokutta, S. (2023). Online Learning for Scheduling MIP Heuristics. Proceedings of International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 114–123. DOI: 10.1007/978-3-031-33271-5_8
    [BibTeX]
    @inproceedings{ChmielaGleixnerLichockiPokutta2023_OnlineLearning,
      year = {2023},
      booktitle = {Proceedings of International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research},
      pages = {114-123},
      doi = {10.1007/978-3-031-33271-5_8},
      author = {Chmiela, Antonia and Gleixner, Ambros and Lichocki, Pawel and Pokutta, Sebastian},
      title = {Online Learning for Scheduling MIP Heuristics}
    }
  16. Chmiela, A., Muñoz, G., and Serrano, F. (2023). Monoidal Strengthening and Unique Lifting in MIQCPs. Proceedings of Conference on Integer Programming and Combinatorial Optimization. [URL]
    [BibTeX]
    @inproceedings{ChmielaMunozSerrano2023_Monoidal,
      year = {2023},
      booktitle = {Proceedings of Conference on Integer Programming and Combinatorial Optimization},
      url = {https://gonzalomunoz.org/monoidalforMIQCP.pdf},
      author = {Chmiela, Antonia and Muñoz, Gonzalo and Serrano, Felipe},
      title = {Monoidal Strengthening and Unique Lifting in MIQCPs}
    }
  17. Ghannam, M., and Gleixner, A. (2023). Hybrid Genetic Search for Dynamic Vehicle Routing with Time Windows. Proceedings of Conference of the Society for Operations Research in Germany. [arXiv]
    [BibTeX]
    @inproceedings{HGSforDVRPTW,
      year = {2023},
      booktitle = {Proceedings of Conference of the Society for Operations Research in Germany},
      archiveprefix = {arXiv},
      eprint = {2307.11800},
      primaryclass = {cs.NE},
      author = {Ghannam, Mohammed and Gleixner, Ambros},
      title = {Hybrid Genetic Search for Dynamic Vehicle Routing with Time Windows}
    }
  18. Criscitiello, C., Martínez-Rubio, D., and Boumal, N. (2023). Open Problem: Polynomial Linearly-convergent Method for G-convex Optimization? Proceedings of Annual Conference on Learning Theory. [arXiv]
    [BibTeX]
    @inproceedings{cmb_open_problem_polynomial_linearly_convergent_method_for_gconvex_optimization_23,
      year = {2023},
      booktitle = {Proceedings of Annual Conference on Learning Theory},
      archiveprefix = {arXiv},
      eprint = {2307.12743},
      primaryclass = {math.OC},
      author = {Criscitiello, Christopher and Martínez-Rubio, David and Boumal, Nicolas},
      title = {Open Problem: Polynomial Linearly-convergent Method for G-convex Optimization?}
    }
  19. Turner, M., Berthold, T., and Besançon, M. (2023). A Context-Aware Cutting Plane Selection Algorithm for Mixed-Integer Programming. Proceedings of Conference of the Society for Operations Research in Germany. [arXiv]
    [BibTeX]
    @inproceedings{context_cutsel_23,
      year = {2023},
      booktitle = {Proceedings of Conference of the Society for Operations Research in Germany},
      archiveprefix = {arXiv},
      eprint = {2307.07322},
      primaryclass = {math.OC},
      author = {Turner, Mark and Berthold, Timo and Besançon, Mathieu},
      title = {A Context-Aware Cutting Plane Selection Algorithm for Mixed-Integer Programming}
    }
  20. Turner, M., Berthold, T., Besançon, M., and Koch, T. (2023). Cutting Plane Selection with Analytic Centers and Multiregression. Proceedings of International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research.
    [BibTeX]
    @inproceedings{cutsel_acenter_22,
      year = {2023},
      booktitle = {Proceedings of International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research},
      author = {Turner, Mark and Berthold, Timo and Besançon, Mathieu and Koch, Thorsten},
      title = {Cutting Plane Selection with Analytic Centers and Multiregression}
    }
  21. Thuerck, D., Sofranac, B., Pfetsch, M., and Pokutta, S. (2023). Learning Cuts Via Enumeration Oracles. Proceedings of Conference on Neural Information Processing Systems. [arXiv]
    [BibTeX]
    @inproceedings{learn_cut_oracle_2023,
      year = {2023},
      booktitle = {Proceedings of Conference on Neural Information Processing Systems},
      archiveprefix = {arXiv},
      eprint = {2305.12197},
      primaryclass = {math.OC},
      author = {Thuerck, Daniel and Sofranac, Boro and Pfetsch, Marc and Pokutta, Sebastian},
      title = {Learning Cuts Via Enumeration Oracles}
    }
  22. Mexi, G., Berthold, T., Gleixner, A., and Nordström, J. (2023). Improving Conflict Analysis in MIP Solvers by Pseudo-Boolean Reasoning. Proceedings of 29th International Conference on Principles and Practice of Constraint Programming (CP 2023), 280, 27:1–27:19, DOI: 10.4230/LIPIcs.CP.2023.27
    [BibTeX]
    @inproceedings{mexi2023improving,
      year = {2023},
      booktitle = {Proceedings of 29th International Conference on Principles and Practice of Constraint Programming (CP 2023)},
      volume = {280},
      pages = {27:1-27:19,},
      doi = {10.4230/LIPIcs.CP.2023.27},
      author = {Mexi, Gioni and Berthold, Timo and Gleixner, Ambros and Nordström, Jakob},
      title = {Improving Conflict Analysis in MIP Solvers by Pseudo-Boolean Reasoning}
    }
  23. Martínez-Rubio, D., and Pokutta, S. (2023). Accelerated Riemannian Optimization: Handling Constraints with a Prox to Bound Geometric Penalties. Proceedings of Annual Conference on Learning Theory. [URL] [arXiv]
    [BibTeX]
    @inproceedings{mp_acceleratedriemannian_22:1,
      year = {2023},
      booktitle = {Proceedings of Annual Conference on Learning Theory},
      url = {https://proceedings.mlr.press/v195/martinez-rubio23a/martinez-rubio23a.pdf},
      archiveprefix = {arXiv},
      eprint = {2211.14645},
      primaryclass = {math.OC},
      author = {Martínez-Rubio, David and Pokutta, Sebastian},
      title = {Accelerated Riemannian Optimization: Handling Constraints with a Prox to Bound Geometric Penalties}
    }
  24. Martínez-Rubio, D., Roux, C., Criscitiello, C., and Pokutta, S. (2023). Accelerated Riemannian Min-Max Optimization Ensuring Bounded Geometric Penalties. Proceedings of Optimization for Machine Learning (NeurIPS Workshop OPT 2023). [arXiv]
    [BibTeX]
    @inproceedings{mrp_accelerated_minmax_riemannian_23,
      year = {2023},
      booktitle = {Proceedings of Optimization for Machine Learning (NeurIPS Workshop OPT 2023)},
      archiveprefix = {arXiv},
      eprint = {2305.16186},
      primaryclass = {math.OC},
      author = {Martínez-Rubio, David and Roux, Christophe and Criscitiello, Christopher and Pokutta, Sebastian},
      title = {Accelerated Riemannian Min-Max Optimization Ensuring Bounded Geometric Penalties}
    }
  25. Martínez-Rubio, D., Wirth, E., and Pokutta, S. (2023). Accelerated and Sparse Algorithms for Approximate Personalized PageRank and Beyond. Proceedings of Annual Conference on Learning Theory. [arXiv]
    [BibTeX]
    @inproceedings{mwp_accelerated_sparse_pagerank_23,
      year = {2023},
      booktitle = {Proceedings of Annual Conference on Learning Theory},
      archiveprefix = {arXiv},
      eprint = {2303.12875},
      primaryclass = {math.OC},
      author = {Martínez-Rubio, David and Wirth, Elias and Pokutta, Sebastian},
      title = {Accelerated and Sparse Algorithms for Approximate Personalized PageRank and Beyond}
    }
  26. Parczyk, O., Pokutta, S., Spiegel, C., and Szabó, T. (2023). Fully Computer-assisted Proofs in Extremal Combinatorics. Proceedings of AAAI Conference on Artificial Intelligence. [arXiv] [slides] [code]
    [BibTeX]
    @inproceedings{ppss_ramsey_22,
      year = {2023},
      booktitle = {Proceedings of AAAI Conference on Artificial Intelligence},
      archiveprefix = {arXiv},
      eprint = {2206.04036},
      primaryclass = {math.CO},
      author = {Parczyk, Olaf and Pokutta, Sebastian and Spiegel, Christoph and Szabó, Tibor},
      title = {Fully Computer-assisted Proofs in Extremal Combinatorics},
      code = {https://zenodo.org/record/6602512#.YyvFhi8Rr5g},
      slides = {https://pokutta.com/slides/20220705_DMD22_RamseyMultiplicity.pdf}
    }
  27. Rué, J. J., and Spiegel, C. (2023). The Rado Multiplicity Problem in Vector Spaces Over Finite Fields. Proceedings of European Conference on Combinatorics. [arXiv] [code]
    [BibTeX]
    @inproceedings{rs_radomult_23,
      year = {2023},
      booktitle = {Proceedings of European Conference on Combinatorics},
      archiveprefix = {arXiv},
      eprint = {2304.00400},
      primaryclass = {math.CO},
      author = {Rué, Juan José and Spiegel, Christoph},
      title = {The Rado Multiplicity Problem in Vector Spaces Over Finite Fields},
      code = {https://github.com/FordUniver/rs_radomult_23}
    }
  28. Mexi, G., Besançon, M., Bolusani, S., Chmiela, A., Hoen, A., and Gleixner, A. (2023). Scylla: a Matrix-free Fix-propagate-and-project Heuristic for Mixed-integer Optimization. Proceedings of Conference of the Society for Operations Research in Germany. [arXiv]
    [BibTeX]
    @inproceedings{scyllaheuristic,
      year = {2023},
      booktitle = {Proceedings of Conference of the Society for Operations Research in Germany},
      archiveprefix = {arXiv},
      eprint = {2307.03466},
      primaryclass = {math.OC},
      author = {Mexi, Gioni and Besançon, Mathieu and Bolusani, Suresh and Chmiela, Antonia and Hoen, Alexander and Gleixner, Ambros},
      title = {Scylla: a Matrix-free Fix-propagate-and-project Heuristic for Mixed-integer Optimization}
    }
  29. Wirth, E., Kerdreux, T., and Pokutta, S. (2023). Acceleration of Frank-Wolfe Algorithms with Open Loop Step-sizes. Proceedings of International Conference on Artificial Intelligence and Statistics. [arXiv]
    [BibTeX]
    @inproceedings{wkp_openloop_22,
      year = {2023},
      booktitle = {Proceedings of International Conference on Artificial Intelligence and Statistics},
      archiveprefix = {arXiv},
      eprint = {2205.12838},
      primaryclass = {math.OC},
      author = {Wirth, Elias and Kerdreux, Thomas and Pokutta, Sebastian},
      title = {Acceleration of Frank-Wolfe Algorithms with Open Loop Step-sizes}
    }
  30. Wirth, E., Kera, H., and Pokutta, S. (2023). Approximate Vanishing Ideal Computations at Scale. Proceedings of International Conference on Learning Representations. [arXiv] [slides]
    [BibTeX]
    @inproceedings{wkp_vanishingideal_22,
      year = {2023},
      booktitle = {Proceedings of International Conference on Learning Representations},
      archiveprefix = {arXiv},
      eprint = {2207.01236},
      primaryclass = {cs.LG},
      author = {Wirth, Elias and Kera, Hiroshi and Pokutta, Sebastian},
      title = {Approximate Vanishing Ideal Computations at Scale},
      slides = {https://pokutta.com/slides/20220915_avi_at_scale.pdf}
    }
  31. Zimmer, M., Spiegel, C., and Pokutta, S. (2023). How I Learned to Stop Worrying and Love Retraining. Proceedings of International Conference on Learning Representations. [arXiv] [code]
    [BibTeX]
    @inproceedings{zsp_retrain_21,
      year = {2023},
      booktitle = {Proceedings of International Conference on Learning Representations},
      archiveprefix = {arXiv},
      eprint = {2111.00843},
      primaryclass = {cs.LG},
      author = {Zimmer, Max and Spiegel, Christoph and Pokutta, Sebastian},
      title = {How I Learned to Stop Worrying and Love Retraining},
      code = {https://github.com/ZIB-IOL/BIMP}
    }
  32. Gasse, M., Bowly, S., Cappart, Q., Charfreitag, J., Charlin, L., Chételat, D., Chmiela, A., Dumouchelle, J., Gleixner, A., Kazachkov, A. M., Khalil, E., Lichocki, P., Lodi, A., Lubin, M., Maddison, C. J., Christopher, M., Papageorgiou, D. J., Parjadis, A., Pokutta, S., … Kun, M. (2022). The Machine Learning for Combinatorial Optimization Competition (ML4CO): Results and Insights. Proceedings of Conference on Neural Information Processing Systems, 176, 220–231. [URL] [arXiv]
    [BibTeX]
    @inproceedings{GasseEtal2022_ML4CO,
      year = {2022},
      booktitle = {Proceedings of Conference on Neural Information Processing Systems},
      month = jun,
      volume = {176},
      pages = {220–231},
      url = {https://proceedings.mlr.press/v176/gasse22a.html},
      archiveprefix = {arXiv},
      eprint = {2203.02433},
      primaryclass = {cs.LG},
      author = {Gasse, Maxime and Bowly, Simon and Cappart, Quentin and Charfreitag, Jonas and Charlin, Laurent and Chételat, Didier and Chmiela, Antonia and Dumouchelle, Justin and Gleixner, Ambros and Kazachkov, Aleksandr M. and Khalil, Elias and Lichocki, Pawel and Lodi, Andrea and Lubin, Miles and Maddison, Chris J. and Christopher, Morris and Papageorgiou, Dimitri J. and Parjadis, Augustin and Pokutta, Sebastian and Prouvost, Antoine and Scavuzzo, Lara and Zarpellon, Giulia and Yang, Linxin and Lai, Sha and Wang, Akang and Luo, Xiaodong and Zhou, Xiang and Huang, Haohan and Shao, Shengcheng and Zhu, Yuanming and Zhang, Dong and Quan, Tao and Cao, Zixuan and Xu, Yang and Huang, Zhewei and Zhou, Shuchang and Binbin, Chen and Minggui, He and Hao, Hao and Zhiyu, Zhang and Zhiwu, An and Kun, Mao},
      title = {The Machine Learning for Combinatorial Optimization Competition (ML4CO): Results and Insights}
    }
  33. Búi, M. N., Combettes, P. L., and Woodstock, Z. (2022). Block-activated Algorithms for Multicomponent Fully Nonsmooth Minimization. Proceedings of ICASSP 2022 - 2022 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), 5428–5432. DOI: 10.1109/ICASSP43922.2022.9747479 [URL]
    [BibTeX]
    @inproceedings{Block22,
      year = {2022},
      booktitle = {Proceedings of ICASSP 2022 - 2022 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)},
      month = may,
      pages = {5428-5432},
      doi = {10.1109/ICASSP43922.2022.9747479},
      url = {https://zevwoodstock.github.io/media/publications/icassp2022-2.pdf},
      author = {Búi, M. N. and Combettes, P. L. and Woodstock, Zev},
      title = {Block-activated Algorithms for Multicomponent Fully Nonsmooth Minimization}
    }
  34. Combettes, P. L., and Woodstock, Z. (2022). Signal Recovery From Inconsistent Nonlinear Observations. Proceedings of ICASSP 2022 - 2022 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), 5872–5876. DOI: 10.1109/ICASSP43922.2022.9746145
    [BibTeX]
    @inproceedings{inconsistentFN,
      year = {2022},
      booktitle = {Proceedings of ICASSP 2022 - 2022 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)},
      month = may,
      pages = {5872–5876},
      doi = {10.1109/ICASSP43922.2022.9746145},
      author = {Combettes, P. L. and Woodstock, Zev},
      title = {Signal Recovery From Inconsistent Nonlinear Observations}
    }
  35. Bestuzheva, K., Gleixner, A., and Völker, H. (2022). Strengthening SONC Relaxations with Constraints Derived From Variable Bounds. Proceedings of Proceedings of the Hungarian Global Optimization Workshop HUGO 2022, 41–44. [URL] [arXiv]
    [BibTeX]
    @inproceedings{BestuzhevaGleixnerVoelker2022_StrengtheningSONC,
      year = {2022},
      booktitle = {Proceedings of Proceedings of the Hungarian Global Optimization Workshop HUGO 2022},
      pages = {41-44},
      url = {https://inf.u-szeged.hu/hugo/},
      archiveprefix = {arXiv},
      eprint = {2304.12145},
      primaryclass = {math.OC},
      author = {Bestuzheva, Ksenia and Gleixner, Ambros and Völker, Helena},
      title = {Strengthening SONC Relaxations with Constraints Derived From Variable Bounds}
    }
  36. Criado, F., Martínez-Rubio, D., and Pokutta, S. (2022). Fast Algorithms for Packing Proportional Fairness and Its Dual. Proceedings of Conference on Neural Information Processing Systems. [arXiv] [poster]
    [BibTeX]
    @inproceedings{cmp_packing_proportional_fairness_22,
      year = {2022},
      booktitle = {Proceedings of Conference on Neural Information Processing Systems},
      archiveprefix = {arXiv},
      eprint = {2109.03678},
      primaryclass = {math.OC},
      author = {Criado, Francisco and Martínez-Rubio, David and Pokutta, Sebastian},
      title = {Fast Algorithms for Packing Proportional Fairness and Its Dual},
      poster = {https://pokutta.com/slides/20211105_fairpacking-poster.pdf}
    }
  37. Macdonald, J., Besançon, M., and Pokutta, S. (2022). Interpretable Neural Networks with Frank-Wolfe: Sparse Relevance Maps and Relevance Orderings. Proceedings of International Conference on Machine Learning. [arXiv] [poster] [video]
    [BibTeX]
    @inproceedings{mbp_interpretfw_22,
      year = {2022},
      booktitle = {Proceedings of International Conference on Machine Learning},
      archiveprefix = {arXiv},
      eprint = {2110.08105},
      primaryclass = {cs.lG},
      author = {Macdonald, Jan and Besançon, Mathieu and Pokutta, Sebastian},
      title = {Interpretable Neural Networks with Frank-Wolfe: Sparse Relevance Maps and Relevance Orderings},
      poster = {https://pokutta.com/slides/20220712_icml_poster_interpretable_rde.pdf},
      video = {https://slideslive.com/38983588}
    }
  38. Martínez-Rubio, D., and Pokutta, S. (2022). Accelerated Riemannian Optimization: Handling Constraints with a Prox to Bound Geometric Penalties. Proceedings of Optimization for Machine Learning (NeurIPS Workshop OPT 2022). [URL] [arXiv] [poster]
    [BibTeX]
    @inproceedings{mp_acceleratedriemannian_22,
      year = {2022},
      booktitle = {Proceedings of Optimization for Machine Learning (NeurIPS Workshop OPT 2022)},
      url = {https://opt-ml.org/papers/2022/paper27.pdf},
      archiveprefix = {arXiv},
      eprint = {2211.14645},
      primaryclass = {math.OC},
      author = {Martínez-Rubio, David and Pokutta, Sebastian},
      title = {Accelerated Riemannian Optimization: Handling Constraints with a Prox to Bound Geometric Penalties},
      poster = {https://pokutta.com/slides/20221203_poster_neurips_riemannian.pdf}
    }
  39. Parczyk, O., Pokutta, S., Spiegel, C., and Szabó, T. (2022). New Ramsey Multiplicity Bounds and Search Heuristics. Proceedings of Discrete Mathematics Days. [arXiv] [code]
    [BibTeX]
    @inproceedings{ppss_ramsey_22:1,
      year = {2022},
      booktitle = {Proceedings of Discrete Mathematics Days},
      archiveprefix = {arXiv},
      eprint = {2206.04036},
      primaryclass = {math.CO},
      author = {Parczyk, Olaf and Pokutta, Sebastian and Spiegel, Christoph and Szabó, Tibor},
      title = {New Ramsey Multiplicity Bounds and Search Heuristics},
      code = {https://zenodo.org/record/6602512#.YyvFhi8Rr5g}
    }
  40. Tsuji, K., Tanaka, K., and Pokutta, S. (2022). Pairwise Conditional Gradients without Swap Steps and Sparser Kernel Herding. Proceedings of International Conference on Machine Learning. [arXiv] [summary] [slides] [code] [video]
    [BibTeX]
    @inproceedings{ttp_pairwise_22,
      year = {2022},
      booktitle = {Proceedings of International Conference on Machine Learning},
      archiveprefix = {arXiv},
      eprint = {2110.12650},
      primaryclass = {math.OC},
      author = {Tsuji, Kazuma and Tanaka, Ken'ichiro and Pokutta, Sebastian},
      title = {Pairwise Conditional Gradients without Swap Steps and Sparser Kernel Herding},
      code = {https://github.com/ZIB-IOL/FrankWolfe.jl},
      slides = {https://pokutta.com/slides/20220624_ICML2022_BPCG.pdf},
      summary = {https://pokutta.com/blog/research/2022/05/21/bpcg-abstract.html},
      video = {https://slideslive.com/38983561}
    }
  41. Wäldchen, S., Huber, F., and Pokutta, S. (2022). Training Characteristic Functions with Reinforcement Learning: XAI-methods Play Connect Four. Proceedings of International Conference on Machine Learning. [arXiv] [poster] [video]
    [BibTeX]
    @inproceedings{whp_connectfour_22,
      year = {2022},
      booktitle = {Proceedings of International Conference on Machine Learning},
      archiveprefix = {arXiv},
      eprint = {2202.11797},
      primaryclass = {cs.LG},
      author = {Wäldchen, Stephan and Huber, Felix and Pokutta, Sebastian},
      title = {Training Characteristic Functions with Reinforcement Learning: XAI-methods Play Connect Four},
      poster = {https://pokutta.com/slides/20220712_icml_poster_conn4.pdf},
      video = {https://slideslive.com/38983111}
    }
  42. Wirth, E., and Pokutta, S. (2022). Conditional Gradients for the Approximately Vanishing Ideal. Proceedings of International Conference on Artificial Intelligence and Statistics. [arXiv] [summary] [poster] [code]
    [BibTeX]
    @inproceedings{wp_approxvanideal_22,
      year = {2022},
      booktitle = {Proceedings of International Conference on Artificial Intelligence and Statistics},
      archiveprefix = {arXiv},
      eprint = {2202.03349},
      primaryclass = {cs.LG},
      author = {Wirth, Elias and Pokutta, Sebastian},
      title = {Conditional Gradients for the Approximately Vanishing Ideal},
      code = {https://github.com/ZIB-IOL/cgavi/},
      poster = {https://pokutta.com/slides/20220223_CGAVI_poster.pdf},
      summary = {https://pokutta.com/blog/research/2022/02/20/CGAVI.html}
    }
  43. Carderera, A., Besançon, M., and Pokutta, S. (2021). Simple Steps Are All You Need: Frank-Wolfe and Generalized Self-concordant Functions. Proceedings of Conference on Neural Information Processing Systems, 34, 5390–5401. [URL] [summary] [slides] [poster] [code]
    [BibTeX]
    @inproceedings{CBP2021:1,
      year = {2021},
      booktitle = {Proceedings of Conference on Neural Information Processing Systems},
      month = may,
      volume = {34},
      pages = {5390–5401},
      url = {https://proceedings.neurips.cc/paper_files/paper/2021/file/2b323d6eb28422cef49b266557dd31ad-Paper.pdf},
      author = {Carderera, Alejandro and Besançon, Mathieu and Pokutta, Sebastian},
      title = {Simple Steps Are All You Need: Frank-Wolfe and Generalized Self-concordant Functions},
      code = {https://doi.org/10.5281/zenodo.4836009},
      poster = {https://pokutta.com/slides/20211120_poster_NeurIPS21_lSimple_steps_are_all_you_need.pdf},
      slides = {https://pokutta.com/slides/20210710_FW-simpleSteps-SelfConcordance.pdf},
      summary = {https://pokutta.com/blog/research/2021/10/09/self-concordant-abstract.html}
    }
  44. Chmiela, A., Khalil, E. B., Gleixner, A., Lodi, A., and Pokutta, S. (2021). Learning to Schedule Heuristics in Branch-and-bound. Proceedings of Conference on Neural Information Processing Systems, 34, 24235–24246. [URL] [arXiv] [poster]
    [BibTeX]
    @inproceedings{CKGLP2021,
      year = {2021},
      booktitle = {Proceedings of Conference on Neural Information Processing Systems},
      month = mar,
      volume = {34},
      pages = {24235–24246},
      url = {https://proceedings.neurips.cc/paper_files/paper/2021/file/cb7c403aa312160380010ee3dd4bfc53-Paper.pdf},
      archiveprefix = {arXiv},
      eprint = {2103.10294},
      primaryclass = {cs.LG},
      author = {Chmiela, Antonia and Khalil, Elias B. and Gleixner, Ambros and Lodi, Andrea and Pokutta, Sebastian},
      title = {Learning to Schedule Heuristics in Branch-and-bound},
      poster = {https://pokutta.com/slides/20211120_poster_NeurIPS21_learningheuristics.pdf}
    }
  45. Carderera, A., Diakonikolas, J., Lin, C. Y., and Pokutta, S. (2021). Parameter-free Locally Accelerated Conditional Gradients. Proceedings of ICML. [arXiv] [slides]
    [BibTeX]
    @article{CDLP2021,
      arxiv = {https://arxiv.org/abs/2102.06806},
      author = {Carderera, Alejandro and Diakonikolas, Jelena and Lin, Cheuk Yin and Pokutta, Sebastian},
      month = feb,
      journal = {Proceedings of ICML},
      title = {{Parameter-free Locally Accelerated Conditional Gradients}},
      slides = {http://www.pokutta.com/slides/20210716_PF_LaCG_Poster.pdf},
      year = {2021}
    }
  46. Combettes, P. L., and Woodstock, Z. (2021). A Fixed Point Framework for Recovering Signals From Nonlinear Transformations. Proceedings of 2020 28th European Signal Processing Conference (EUSIPCO), 2120–2124. DOI: 10.23919/Eusipco47968.2020.9287736
    [BibTeX]
    @inproceedings{eusipco21,
      year = {2021},
      booktitle = {Proceedings of 2020 28th European Signal Processing Conference (EUSIPCO)},
      month = jan,
      pages = {2120-2124},
      doi = {10.23919/Eusipco47968.2020.9287736},
      author = {Combettes, P. L. and Woodstock, Zev},
      title = {A Fixed Point Framework for Recovering Signals From Nonlinear Transformations}
    }
  47. Kerdreux, T., d’Aspremont, A., and Pokutta, S. (2021). Projection-Free Optimization on Uniformly Convex Sets. To Appear in Proceedings of AISTATS. [arXiv] [summary] [slides]
    [BibTeX]
    @article{KAP2020,
      arxiv = {https://arxiv.org/abs/2004.11053},
      author = {Kerdreux, T. and d'Aspremont, A. and Pokutta, S.},
      journal = {{to appear in Proceedings of AISTATS}},
      slides = {https://app.box.com/s/36wj0o8le96rrfdxec774wk7rrdp2vlm},
      special = {{Oral Presentation + Conference Proceedings}},
      summary = {http://www.pokutta.com/blog/research/2020/07/27/uniform-convexity-fw.html},
      title = {{Projection-Free Optimization on Uniformly Convex Sets}},
      month = jan,
      year = {2021}
    }
  48. Chmiela, A., Muñoz, G., and Serrano, F. (2021). On the Implementation and Strengthening of Intersection Cuts for QCQPs. Proceedings of Integer Programming and Combinatorial Optimization: 22nd International Conference, IPCO 2021, 134–147. DOI: 10.1007/978-3-030-73879-2_10
    [BibTeX]
    @inproceedings{ChmielaMunozSerrano2021_Onimplementation:1,
      year = {2021},
      booktitle = {Proceedings of Integer Programming and Combinatorial Optimization: 22nd International Conference, IPCO 2021},
      pages = {134-147},
      doi = {10.1007/978-3-030-73879-2_10},
      author = {Chmiela, Antonia and Muñoz, Gonzalo and Serrano, Felipe},
      title = {On the Implementation and Strengthening of Intersection Cuts for QCQPs}
    }
  49. Sofranac, B., Gleixner, A., and Pokutta, S. (2021). An Algorithm-independent Measure of Progress for Linear Constraint Propagation. Proceedings of International Conference on Principles and Practice of Constraint Programming, 52:1–17. DOI: 10.4230/LIPIcs.CP.2021.52 [URL] [arXiv] [video]
    [BibTeX]
    @inproceedings{SofranacGleixnerPokutta2022_AnAlgorithm-IndependentMeasure:1,
      year = {2021},
      booktitle = {Proceedings of International Conference on Principles and Practice of Constraint Programming},
      pages = {52:1–17},
      doi = {10.4230/LIPIcs.CP.2021.52},
      url = {https://drops.dagstuhl.de/opus/volltexte/2021/15343/},
      archiveprefix = {arXiv},
      eprint = {2106.07573},
      primaryclass = {math.OC},
      author = {Sofranac, Boro and Gleixner, Ambros and Pokutta, Sebastian},
      title = {An Algorithm-independent Measure of Progress for Linear Constraint Propagation},
      video = {https://youtu.be/paZtGYlkBfE}
    }
  50. Böttcher, J., Sgueglia, A., Skokan, J., and Parczyk, O. (2021). Cycle Factors in Randomly Perturbed Graphs. Proceedings of LAGOS 2021, 195, 404–411. DOI: 10.1016/j.procs.2021.11.049
    [BibTeX]
    @inproceedings{cycle_factors_2021,
      year = {2021},
      booktitle = {Proceedings of LAGOS 2021},
      volume = {195},
      pages = {404-411},
      doi = {10.1016/j.procs.2021.11.049},
      author = {Böttcher, Julia and Sgueglia, Amedeo and Skokan, Jozef and Parczyk, Olaf},
      title = {Cycle Factors in Randomly Perturbed Graphs}
    }
  51. Böttcher, J., Sgueglia, A., Skokan, J., and Parczyk, O. (2021). The Square of a Hamilton Cycle in Randomly Perturbed Graphs. Proceedings of 11th EuroComb Conference, 14, 644–650. DOI: 10.1007/978-3-030-83823-2_103 [arXiv]
    [BibTeX]
    @inproceedings{hamilton_cycle_2021,
      year = {2021},
      booktitle = {Proceedings of 11th EuroComb Conference},
      volume = {14},
      pages = {644-650},
      doi = {10.1007/978-3-030-83823-2_103},
      archiveprefix = {arXiv},
      eprint = {2202.05215},
      author = {Böttcher, Julia and Sgueglia, Amedeo and Skokan, Jozef and Parczyk, Olaf},
      title = {The Square of a Hamilton Cycle in Randomly Perturbed Graphs}
    }
  52. Clemens, D., Hamann, F., Mogge, Y., and Parczyk, O. (2021). Waiter-Client Games on Randomly Perturbed Graphs. Proceedings of 11th EuroComb Conference, 14, 397–403. DOI: 10.1007/978-3-030-83823-2_62
    [BibTeX]
    @inproceedings{waiter_client_games_2021,
      year = {2021},
      booktitle = {Proceedings of 11th EuroComb Conference},
      volume = {14},
      pages = {397-403},
      doi = {10.1007/978-3-030-83823-2_62},
      author = {Clemens, Dennis and Hamann, Fabian and Mogge, Yannick and Parczyk, Olaf},
      title = {Waiter-Client Games on Randomly Perturbed Graphs}
    }
  53. Pokutta, S. (2020). Restarting Algorithms: Sometimes there is Free Lunch. Proceedings of CPAIOR. [arXiv] [slides] [video]
    [BibTeX]
    @article{P2020,
      arxiv = {http://arxiv.org/abs/2006.14810},
      author = {Pokutta, S.},
      journal = {{Proceedings of CPAIOR}},
      month = sep,
      slides = {https://app.box.com/s/8ps8bhjv2phhy182xn55iurk9t3o1xc3},
      special = {{Invited Paper}},
      title = {{Restarting Algorithms: Sometimes there is Free Lunch}},
      video = {https://www.youtube.com/watch?v=v3Xzoda2_gQ},
      year = {2020}
    }
  54. Mortagy, H., Gupta, S., and Pokutta, S. (2020). Walking in the Shadow: A New Perspective on Descent Directions for Constrained Minimization. Proceedings of NeurIPS. [arXiv] [slides] [poster] [code] [video]
    [BibTeX]
    @article{MGP2020walking,
      arxiv = {https://arxiv.org/abs/2006.08426},
      author = {Mortagy, Hassan and Gupta, Swati and Pokutta, Sebastian},
      code = {https://github.com/pokutta/Walking-in-the-Shadow},
      poster = {https://app.box.com/s/y266djezdjdidsswaopvdcnsnkp8774i},
      journal = {{Proceedings of NeurIPS}},
      slides = {https://app.box.com/s/wjhpe4nh8kv5pw6vl5jbp902v3mksivs},
      video = {https://youtu.be/CRmASevfnmE},
      title = {{Walking in the Shadow: A New Perspective on Descent Directions for Constrained Minimization}},
      month = jun,
      year = {2020}
    }
  55. Combettes, C. W., and Pokutta, S. (2020). Boosting Frank-Wolfe by Chasing Gradients. Proceedings of ICML. [PDF] [arXiv] [summary] [slides] [code] [video]
    [BibTeX]
    @article{CP2020boost,
      annote = {github code: https://github.com/cyrillewcombettes/boostfw},
      arxiv = {http://arxiv.org/abs/2003.06369},
      author = {Combettes, Cyrille W and Pokutta, Sebastian},
      code = {https://colab.research.google.com/drive/1TSOVjDFF1X2ADBo_adHLsUVrblSutRKw},
      journal = {{Proceedings of ICML}},
      slides = {https://app.box.com/s/wwj247r5d456q0778p9b9y1jm6txuifb},
      summary = {http://www.pokutta.com/blog/research/2020/03/16/boostFW.html},
      title = {{Boosting Frank-Wolfe by Chasing Gradients}},
      pdfurl = {http://proceedings.mlr.press/v119/combettes20a.html},
      video = {https://www.youtube.com/watch?v=BfyV0C5FRbE},
      month = mar,
      year = {2020}
    }
  56. Hoppmann-Baum, K., Mexi, G., Burdakov, O., Casselgren, C. J., and Koch, T. (2020). Minimum Cycle Partition with Length Requirements. Proceedings of International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 12296, 273–282. DOI: 10.1007/978-3-030-58942-4_18
    [BibTeX]
    @inproceedings{HoppmannBaumMexiBurdakovetal.2020,
      year = {2020},
      booktitle = {Proceedings of International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research},
      volume = {12296},
      pages = {273-282},
      doi = {10.1007/978-3-030-58942-4_18},
      author = {Hoppmann-Baum, Kai and Mexi, Gioni and Burdakov, Oleg and Casselgren, Carl Johan and Koch, Thorsten},
      title = {Minimum Cycle Partition with Length Requirements}
    }
  57. Iommazzo, G., D’Ambrosio, C., Frangioni, A., and Liberti, L. (2020). Learning to Configure Mathematical Programming Solvers by Mathematical Programming. Proceedings of Learning and Intelligent Optimization Conference. DOI: 10.1007/978-3-030-53552-0_34
    [BibTeX]
    @inproceedings{IDF+20,
      year = {2020},
      booktitle = {Proceedings of Learning and Intelligent Optimization Conference},
      doi = {10.1007/978-3-030-53552-0_34},
      author = {Iommazzo, Gabriele and D'Ambrosio, Claudia and Frangioni, Antonio and Liberti, Leo},
      title = {Learning to Configure Mathematical Programming Solvers by Mathematical Programming}
    }
  58. Iommazzo, G., D’Ambrosio, C., Frangioni, A., and Liberti, L. (2020). A Learning-based Mathematical Programming Formulation for the Automatic Configuration of Optimization Solvers. Proceedings of International Conference on Machine Learning, Optimization and Data Science. DOI: 10.1007/978-3-030-64583-0_61
    [BibTeX]
    @inproceedings{IDF+21,
      year = {2020},
      booktitle = {Proceedings of International Conference on Machine Learning, Optimization and Data Science},
      doi = {10.1007/978-3-030-64583-0_61},
      author = {Iommazzo, Gabriele and D'Ambrosio, Claudia and Frangioni, Antonio and Liberti, Leo},
      title = {A Learning-based Mathematical Programming Formulation for the Automatic Configuration of Optimization Solvers}
    }
  59. Liberti, L., Iommazzo, G., Lavor, C., and Maculan, N. (2020). A Cycle-based Formulation for Distance Geometry Problem. Proceedings of 18th Cologne-Twente Workshop on Graphs and Combinatorial Optimization. DOI: 10.1007/978-3-030-63072-0_8
    [BibTeX]
    @inproceedings{LIL+20,
      year = {2020},
      booktitle = {Proceedings of 18th Cologne-Twente Workshop on Graphs and Combinatorial Optimization},
      doi = {10.1007/978-3-030-63072-0_8},
      author = {Liberti, Leo and Iommazzo, Gabriele and Lavor, Carlile and Maculan, Nelson},
      title = {A Cycle-based Formulation for Distance Geometry Problem}
    }
  60. Sofranac, B., Gleixner, A., and Pokutta, S. (2020). Accelerating Domain Propagation: An Efficient GPU-parallel Algorithm Over Sparse Matrices. Proceedings of 10th IEEE/ACM Workshop on Irregular Applications: Architectures and Algorithms, IA3 2020, 1–11. DOI: 10.1109/IA351965.2020.00007 [arXiv] [summary] [slides] [video]
    [BibTeX]
    @inproceedings{SofranacGleixnerPokutta2022_Accelerating:1,
      year = {2020},
      booktitle = {Proceedings of 10th IEEE/ACM Workshop on Irregular Applications: Architectures and Algorithms, IA3 2020},
      pages = {1-11},
      doi = {10.1109/IA351965.2020.00007},
      archiveprefix = {arXiv},
      eprint = {2009.07785},
      primaryclass = {cs.DC},
      author = {Sofranac, Boro and Gleixner, Ambros and Pokutta, Sebastian},
      title = {Accelerating Domain Propagation: An Efficient GPU-parallel Algorithm Over Sparse Matrices},
      slides = {https://app.box.com/s/qy0pjmhtbm7shk2ypxjxlh2sj4nudvyu},
      summary = {https://pokutta.com/blog/research/2020/09/20/gpu-prob.html},
      video = {https://youtu.be/7mERPal9pVs}
    }
  61. Ziemke, T., Sering, L., Vargas Koch, L., Zimmer, M., Nagel, K., and Skutella, M. (2020). Flows Over Time As Continuous Limits of Packet-based Network Simulations. Proceedings of EURO Working Group on Transportation Meeting.
    [BibTeX]
    @inproceedings{zskzns_flows_21:1,
      year = {2020},
      booktitle = {Proceedings of EURO Working Group on Transportation Meeting},
      author = {Ziemke, Theresa and Sering, Leon and Vargas Koch, Laura and Zimmer, Max and Nagel, Kai and Skutella, Martin},
      title = {Flows Over Time As Continuous Limits of Packet-based Network Simulations}
    }
  62. Pfetsch, M., and Pokutta, S. (2020). IPBoost – Non-Convex Boosting via Integer Programming. To Appear in Proceedings of ICML. [arXiv] [summary] [slides] [code]
    [BibTeX]
    @article{PP2020,
      arxiv = {https://arxiv.org/abs/2002.04679},
      author = {Pfetsch, M. and Pokutta, S.},
      code = {https://www2.mathematik.tu-darmstadt.de/~pfetsch/ipboost.html},
      journal = {{to appear in Proceedings of ICML}},
      slides = {https://app.box.com/s/8dpvmls88suouy11bkpwufhu7iiz6dxl},
      summary = {http://www.pokutta.com/blog/research/2020/02/13/ipboost-abstract.html},
      title = {{IPBoost -- Non-Convex Boosting via Integer Programming}},
      year = {2020}
    }
  63. Pokutta, S., Singh, M., and Torrico, A. (2020). On the Unreasonable Effectiveness of the Greedy Algorithm: Greedy Adapts to Sharpness. To Appear in Proceedings of ICML. [arXiv] [summary] [slides] [poster] [video]
    [BibTeX]
    @article{TMS2020,
      arxiv = {https://arxiv.org/abs/2002.04063},
      author = {Pokutta, S. and Singh, M. and Torrico, A.},
      journal = {{to appear in Proceedings of ICML}},
      poster = {https://app.box.com/s/24vbh1s2vib11upqyepzen3lzdl13skr},
      slides = {https://app.box.com/s/fmjxhfdpiqubm28upf563ohy8t8fgl3a},
      summary = {http://www.pokutta.com/blog/research/2020/06/03/unreasonable-abstract.html},
      title = {{On the Unreasonable Effectiveness of the Greedy Algorithm: Greedy Adapts to Sharpness}},
      video = {https://www.youtube.com/watch?v=VB1e0HrDmVo},
      year = {2020}
    }
  64. Diakonikolas, J., Carderera, A., and Pokutta, S. (2020). Locally Accelerated Conditional Gradients. Proceedings of AISTATS. [PDF] [arXiv] [summary] [slides] [code] [video]
    [BibTeX]
    @article{CDP2019,
      arxiv = {https://arxiv.org/abs/1906.07867},
      author = {Diakonikolas, Jelena and Carderera, Alejandro and Pokutta, Sebastian},
      code = {https://colab.research.google.com/drive/1ejjfCan7xnEhWWJXCIzb03CwQRG9iW_O},
      journal = {{Proceedings of AISTATS}},
      slides = {https://app.box.com/s/gphkhapso7d1vrfnzqykkb3vx0agxh8w},
      summary = {http://www.pokutta.com/blog/research/2019/07/04/LaCG-abstract.html},
      title = {{Locally Accelerated Conditional Gradients}},
      pdfurl = {http://proceedings.mlr.press/v108/diakonikolas20a/diakonikolas20a.pdf},
      year = {2020},
      video = {https://slideslive.com/38930107/locally-accelerated-conditional-gradients?ref=account-folder-52123-folders}
    }
  65. Braun, G., Pokutta, S., Tu, D., and Wright, S. (2019). Blended Conditional Gradients: the Unconditioning of Conditional Gradients. Proceedings of International Conference on Machine Learning, 97, 735–743. [URL] [arXiv] [summary] [slides] [poster] [code]
    [BibTeX]
    @inproceedings{Braun2018blendedCG,
      year = {2019},
      booktitle = {Proceedings of International Conference on Machine Learning},
      volume = {97},
      pages = {735–743},
      url = {https://proceedings.mlr.press/v97/braun19a},
      archiveprefix = {arXiv},
      eprint = {1805.07311},
      primaryclass = {math.OC},
      author = {Braun, Gábor and Pokutta, Sebastian and Tu, Dan and Wright, Stephen},
      title = {Blended Conditional Gradients: the Unconditioning of Conditional Gradients},
      code = {https://github.com/pokutta/bcg},
      poster = {https://app.box.com/s/nmmm671jd72i397nysa8emfnzh1hn6hf},
      slides = {https://app.box.com/s/xbx3z7ws6dxvl3rzgj4jp6forigycooe},
      summary = {https://pokutta.com/blog/research/2019/02/18/bcg-abstract.html}
    }
  66. Barros, G. F., Cavalar, B. P., Mota, G. O., and Parczyk, O. (2019). Anti-Ramsey Threshold of Cycles for Sparse Graphs. Proceedings of LAGOS 2019, 346, 89–98. DOI: 10.1016/j.entcs.2019.08.009 [arXiv]
    [BibTeX]
    @inproceedings{anti_ramsey_cycles_sparse_2019:1,
      year = {2019},
      booktitle = {Proceedings of LAGOS 2019},
      volume = {346},
      pages = {89-98},
      doi = {10.1016/j.entcs.2019.08.009},
      archiveprefix = {arXiv},
      eprint = {2006.02079},
      author = {Barros, Gabriel F. and Cavalar, Bruno P. and Mota, Guilherme O. and Parczyk, Olaf},
      title = {Anti-Ramsey Threshold of Cycles for Sparse Graphs}
    }
  67. Hubai, T., Král, D., Person, Y., and Parczyk, O. (2019). More Non-bipartite Forcing Pairs. Proceedings of 10th EuroComb Conference, 88(3), 819–825. [URL] [arXiv]
    [BibTeX]
    @inproceedings{non_bipartite_forcing_pairs_2019,
      year = {2019},
      booktitle = {Proceedings of 10th EuroComb Conference},
      volume = {88},
      number = {3},
      pages = {819-825},
      url = {http://www.iam.fmph.uniba.sk/amuc/ojs/index.php/amuc/article/view/1279/772},
      archiveprefix = {arXiv},
      eprint = {1906.04089},
      author = {Hubai, Tamas and Král, Dan and Person, Yury and Parczyk, Olaf},
      title = {More Non-bipartite Forcing Pairs}
    }
  68. Berger, S., Kohayakawa, Y., Maesaka, G. S., Martins, T., Mendonça, W., Mota, G. O., and Parczyk, O. (2019). The Size-Ramsey Number of Powers of Bounded Degree Trees. Proceedings of 10th EuroComb Conference, 88(3), 451–456. [URL] [arXiv]
    [BibTeX]
    @inproceedings{size_ramsey_trees_2019:1,
      year = {2019},
      booktitle = {Proceedings of 10th EuroComb Conference},
      volume = {88},
      number = {3},
      pages = {451-456},
      url = {http://www.iam.fmph.uniba.sk/amuc/ojs/index.php/amuc/article/view/1281/679},
      archiveprefix = {arXiv},
      eprint = {1907.03466},
      author = {Berger, Sören and Kohayakawa, Yoshiharu and Maesaka, Giulia S. and Martins, Taísa and Mendonça, Walner and Mota, Guilherme O. and Parczyk, Olaf},
      title = {The Size-Ramsey Number of Powers of Bounded Degree Trees}
    }
  69. Parczyk, O. (2019). Almost Spanning Universality in Random Graphs. Proceedings of 10th EuroComb Conference, 88(3), 997–1002. [URL]
    [BibTeX]
    @inproceedings{spanning_universality_2019,
      year = {2019},
      booktitle = {Proceedings of 10th EuroComb Conference},
      volume = {88},
      number = {3},
      pages = {997-1002},
      url = {http://www.iam.fmph.uniba.sk/amuc/ojs/index.php/amuc/article/view/1240/753},
      author = {Parczyk, Olaf},
      title = {Almost Spanning Universality in Random Graphs}
    }
  70. Pokutta, S., Singh, M., and Torrico, A. (2019). On the Unreasonable Effectiveness of the Greedy Algorithm: Greedy Adapts to Sharpness. OPTML Workshop Paper. [PDF] [summary] [poster]
    [BibTeX]
    @article{TMSOPTML2019,
      author = {Pokutta, S. and Singh, M. and Torrico, A.},
      journal = {{OPTML Workshop Paper}},
      pdfurl = {https://opt-ml.org/papers/2019/paper_16.pdf},
      poster = {https://app.box.com/s/24vbh1s2vib11upqyepzen3lzdl13skr},
      summary = {http://www.pokutta.com/blog/research/2020/06/03/unreasonable-abstract.html},
      title = {{On the Unreasonable Effectiveness of the Greedy Algorithm: Greedy Adapts to Sharpness}},
      year = {2019}
    }
  71. Diakonikolas, J., Carderera, A., and Pokutta, S. (2019). Breaking the Curse of Dimensionality (Locally) to Accelerate Conditional Gradients. OPTML Workshop Paper. [PDF] [arXiv] [summary] [slides] [poster] [code]
    [BibTeX]
    @article{CDPOPTML2019,
      arxiv = {https://arxiv.org/abs/1906.07867},
      author = {Diakonikolas, Jelena and Carderera, Alejandro and Pokutta, Sebastian},
      code = {https://colab.research.google.com/drive/1ejjfCan7xnEhWWJXCIzb03CwQRG9iW_O},
      journal = {{OPTML Workshop Paper}},
      pdfurl = {https://opt-ml.org/papers/2019/paper_26.pdf},
      poster = {https://app.box.com/s/d7p038u7df422q4jsccbmj15mngqv2ws},
      slides = {https://app.box.com/s/gphkhapso7d1vrfnzqykkb3vx0agxh8w},
      summary = {http://www.pokutta.com/blog/research/2019/07/04/LaCG-abstract.html},
      title = {{Breaking the Curse of Dimensionality (Locally) to Accelerate Conditional Gradients}},
      year = {2019}
    }
  72. Combettes, C. W., and Pokutta, S. (2019). Blended Matching Pursuit. Proceedings of NeurIPS. [PDF] [arXiv] [summary] [slides] [poster] [code]
    [BibTeX]
    @article{CP2019,
      arxiv = {https://arxiv.org/abs/1904.12335},
      author = {Combettes, Cyrille W and Pokutta, Sebastian},
      code = {https://colab.research.google.com/drive/17XYIxnCcJjKswba9mAaXFWnNGVZdsaXQ},
      journal = {{Proceedings of NeurIPS}},
      pdfurl = {https://papers.nips.cc/paper/8478-blended-matching-pursuit},
      poster = {https://app.box.com/s/j6lbh49udjd45krhxcypufxwdofw6br8},
      slides = {https://app.box.com/s/8lfktq6h3dqp9t2gqydu2tp8h2uxgz7m},
      summary = {http://www.pokutta.com/blog/research/2019/05/27/bmp-abstract.html},
      title = {{Blended Matching Pursuit}},
      year = {2019}
    }
  73. Kerdreux, T., d’Aspremont, A., and Pokutta, S. (2019). Restarting Frank-Wolfe. Proceedings of AISTATS. [PDF] [arXiv] [summary] [slides]
    [BibTeX]
    @article{KDP2018,
      arxiv = {http://arxiv.org/abs/1810.02429},
      author = {Kerdreux, T. and d'Aspremont, A. and Pokutta, S.},
      journal = {{Proceedings of AISTATS}},
      pdfurl = {http://proceedings.mlr.press/v89/kerdreux19a/kerdreux19a.pdf},
      slides = {https://app.box.com/s/prd32r6xmuef2k4gah23rd0egllz9rv5},
      summary = {http://www.pokutta.com/blog/research/2019/05/02/restartfw-abstract.html},
      title = {{Restarting Frank-Wolfe}},
      year = {2019}
    }
  74. Anari, N., Haghtalab, N., Naor, S., Pokutta, S., Singh, M., and Torrico, A. (2019). Structured Robust Submodular Maximization: Offline and Online Algorithms. Proceedings of AISTATS. [PDF] [arXiv]
    [BibTeX]
    @article{submodular2017,
      arxiv = {https://arxiv.org/abs/1710.04740},
      author = {Anari, N. and Haghtalab, N. and Naor, S. and Pokutta, S. and Singh, M. and Torrico, A.},
      journal = {{Proceedings of AISTATS}},
      pdfurl = {http://proceedings.mlr.press/v89/anari19a/anari19a.pdf},
      title = {{Structured Robust Submodular Maximization: Offline and Online Algorithms}},
      year = {2019}
    }
  75. Rué, J. J., and Spiegel, C. (2018). On a Problem of Sárközy and Sós for Multivariate Linear Forms. Proceedings of Discrete Mathematics Days. [arXiv]
    [BibTeX]
    @inproceedings{rs_sarkozysos_18:1,
      year = {2018},
      booktitle = {Proceedings of Discrete Mathematics Days},
      archiveprefix = {arXiv},
      eprint = {1802.07597},
      primaryclass = {math.CO},
      author = {Rué, Juan José and Spiegel, Christoph},
      title = {On a Problem of Sárközy and Sós for Multivariate Linear Forms}
    }
  76. Inanlouganji, A., Pedrielli, G., Fainekos, G., and Pokutta, S. (2018). Continuous Simulation Optimization with Model Mismatch Using Gaussian Process Regression. Proceedings of the 2018 Winter Simulation Conference.
    [BibTeX]
    @article{IPFP2018,
      author = {Inanlouganji, A. and Pedrielli, G. and Fainekos, G. and Pokutta, S.},
      journal = {Proceedings of the 2018 Winter Simulation Conference},
      title = {{Continuous Simulation Optimization with Model Mismatch Using Gaussian Process Regression}},
      year = {2018}
    }
  77. Pokutta, S., Singh, M., and Torrico, A. (2018). Efficient algorithms for robust submodular maximization under matroid constraints. ICML Workshop Paper. [PDF] [arXiv]
    [BibTeX]
    @article{pst2018,
      annote = {https://arxiv.org/abs/1807.09405
      },
      arxiv = {https://arxiv.org/abs/1807.09405},
      author = {Pokutta, S. and Singh, M. and Torrico, A.},
      journal = {{ICML Workshop Paper}},
      pdfurl = {https://sites.google.com/view/icml2018nonconvex/papers},
      title = {{Efficient algorithms for robust submodular maximization under matroid constraints}},
      year = {2018}
    }
  78. Braun, G., and Strüngmann, L. (2017). Rigid ℵ₁-free Abelian Groups with Prescribed Factors and their Role in the Theory of Cellular Covers. Proceedings of Groups, Modules, and Model Theory - Surveys and Recent Developments: In Memory of Rüdiger Göbel, 69–81. DOI: 10.1007/978-3-319-51718-6_4
    [BibTeX]
    @inproceedings{BG-prescribed-cellular_2017,
      year = {2017},
      booktitle = {Proceedings of Groups, Modules, and Model Theory - Surveys and Recent Developments: In Memory of Rüdiger Göbel},
      pages = {69–81},
      doi = {10.1007/978-3-319-51718-6_4},
      author = {Braun, Gábor and Strüngmann, Lutz},
      title = {Rigid ℵ₁-free Abelian Groups with Prescribed Factors and their Role in the Theory of Cellular Covers}
    }
  79. Braun, G., Pokutta, S., and Zink, D. (2017). Lazifying Conditional Gradient Algorithms. Proceedings of International Conference on Machine Learning, 70, 566–575. [URL] [arXiv] [slides] [poster]
    [BibTeX]
    @inproceedings{Braun2017lazyCG:1,
      year = {2017},
      booktitle = {Proceedings of International Conference on Machine Learning},
      volume = {70},
      pages = {566–575},
      url = {https://proceedings.mlr.press/v70/braun17a},
      archiveprefix = {arXiv},
      eprint = {1610.05120},
      primaryclass = {cs.DS},
      author = {Braun, Gábor and Pokutta, Sebastian and Zink, Daniel},
      title = {Lazifying Conditional Gradient Algorithms},
      poster = {https://app.box.com/s/lysscdg17ytpz7mqr0tu2djffyqvkl6a},
      slides = {https://app.box.com/s/zsp0hixjz2ha23u1vuyosijjkjdh8k}
    }
  80. Kusch, C., Rué, J. J., Spiegel, C., and Szabó, T. (2017). Random Strategies Are Nearly Optimal for Generalized Van Der Waerden Games. Proceedings of European Conference on Combinatorics. [URL] [arXiv]
    [BibTeX]
    @inproceedings{krss_randomstrategy_17:1,
      year = {2017},
      booktitle = {Proceedings of European Conference on Combinatorics},
      url = {https://dmg.tuwien.ac.at/eurocomb2017/index.php/accepted-papers/},
      archiveprefix = {arXiv},
      eprint = {1711.07251},
      primaryclass = {math.CO},
      author = {Kusch, Christopher and Rué, Juan José and Spiegel, Christoph and Szabó, Tibor},
      title = {Random Strategies Are Nearly Optimal for Generalized Van Der Waerden Games}
    }
  81. Böttcher, J., Montgomery, R., Person, Y., and Parczyk, O. (2017). Embedding Spanning Bounded Degree Subgraphs in Randomly Perturbed Graphs. Proceedings of 9th EuroComb Conference, 61, 155–161. DOI: 10.1016/j.endm.2017.06.033
    [BibTeX]
    @inproceedings{spanning_subgraphs_2017,
      year = {2017},
      booktitle = {Proceedings of 9th EuroComb Conference},
      volume = {61},
      pages = {155-161},
      doi = {10.1016/j.endm.2017.06.033},
      author = {Böttcher, Julia and Montgomery, Richard and Person, Yury and Parczyk, Olaf},
      title = {Embedding Spanning Bounded Degree Subgraphs in Randomly Perturbed Graphs}
    }
  82. Roy, A., Xu, H., and Pokutta, S. (2017). Reinforcement Learning under Model Mismatch. Proceedings of NIPS. [arXiv]
    [BibTeX]
    @article{AXP2016,
      annote = {https://papers.nips.cc/paper/by-source-2016-1199
      
      https://arxiv.org/abs/1610.09269
      
      },
      arxiv = {https://arxiv.org/abs/1706.04711},
      author = {Roy, Aurko and Xu, Huan and Pokutta, Sebastian},
      journal = {{Proceedings of NIPS}},
      title = {{Reinforcement Learning under Model Mismatch}},
      year = {2017}
    }
  83. Bärmann, A., Pokutta, S., and Schneider, O. (2017). Emulating the Expert: Inverse Optimization through Online Learning. Proceedings of the International Conference on Machine Learning (ICML). [PDF] [arXiv] [summary] [slides] [poster] [video]
    [BibTeX]
    @article{BPS2017,
      arxiv = {https://arxiv.org/abs/1810.12997},
      author = {B{\"a}rmann, Andreas and Pokutta, Sebastian and Schneider, Oskar},
      journal = {{Proceedings of the International Conference on Machine Learning (ICML)}},
      pdfurl = {http://proceedings.mlr.press/v70/barmann17a.html},
      poster = {https://app.box.com/s/h3ychkv99il7oyzw7sym8la5lhit3elg},
      slides = {https://app.box.com/s/7ti8sz8mf5s2znn1qo32in4jxy5gjnn1},
      summary = {http://www.pokutta.com/blog/research/2018/11/25/expertLearning-abstract.html},
      title = {{Emulating the Expert: Inverse Optimization through Online Learning}},
      video = {https://vimeo.com/channels/1301905/237243668},
      year = {2017}
    }
  84. Lan, G., Pokutta, S., Zhou, Y., and Zink, D. (2017). Conditional Accelerated Lazy Stochastic Gradient Descent. Proceedings of the International Conference on Machine Learning (ICML). [PDF] [arXiv] [poster]
    [BibTeX]
    @article{LPZZ2017,
      arxiv = {https://arxiv.org/abs/1703.05840},
      author = {Lan, G. and Pokutta, S. and Zhou, Y. and Zink, D.},
      journal = {{Proceedings of the International Conference on Machine Learning (ICML)}},
      pdfurl = {http://proceedings.mlr.press/v70/lan17a.html},
      poster = {https://app.box.com/s/wnwym0p3eby54abb5bidnz7gznlkentq},
      title = {{Conditional Accelerated Lazy Stochastic Gradient Descent}},
      year = {2017}
    }
  85. Arumugam, K., Kadampot, I., Tahmasbi, M., Shah, S., Bloch, M., and Pokutta, S. (2017). Modulation Recognition Using Side Information and Hybrid Learning. Proceedings of IEEE DySPAN.
    [BibTeX]
    @article{dyspan2017,
      author = {Arumugam, K. and Kadampot, I. and Tahmasbi, M. and Shah, S. and Bloch, M. and Pokutta, S.},
      journal = {{Proceedings of IEEE DySPAN}},
      title = {{Modulation Recognition Using Side Information and Hybrid Learning}},
      year = {2017}
    }
  86. Lubert, C. P., Romero, J. N., Sochacki, J. S., and Woodstock, Z. (2016). Rocket Launch Noise and the Coanda Effect. Proceedings of American Institute of Aeronautics and Astronautics (AIAA) SPACE 2016, 5626. DOI: 10.2514/6.2016-5625 [URL]
    [BibTeX]
    @inproceedings{coanda16,
      year = {2016},
      booktitle = {Proceedings of American Institute of Aeronautics and Astronautics (AIAA) SPACE 2016},
      month = sep,
      pages = {5626},
      doi = {10.2514/6.2016-5625},
      url = {https://zevwoodstock.github.io/media/publications/AIAA.pdf},
      author = {Lubert, Caroline P. and Romero, Jon N. and Sochacki, James S. and Woodstock, Zev},
      title = {Rocket Launch Noise and the Coanda Effect}
    }
  87. Braun, G., Pokutta, S., and Roy, A. (2016). Strong Reductions for Extended Formulations. Proceedings of Conference on Integer Programming and Combinatorial Optimization, 9682, 350–361. DOI: 10.1007/978-3-319-33461-5_29 [arXiv]
    [BibTeX]
    @inproceedings{BPR2015:1,
      year = {2016},
      booktitle = {Proceedings of Conference on Integer Programming and Combinatorial Optimization},
      month = jun,
      volume = {9682},
      pages = {350–361},
      doi = {10.1007/978-3-319-33461-5_29},
      archiveprefix = {arXiv},
      eprint = {1512.04932},
      primaryclass = {cs.CC},
      author = {Braun, Gábor and Pokutta, Sebastian and Roy, Aurko},
      title = {Strong Reductions for Extended Formulations}
    }
  88. Braun, G., Brown-Cohen, J., Huq, A., Pokutta, S., Raghavendra, P., Roy, A., Weitz, B., and Zink, D. (2016). The Matching Problem Has No Small Symmetric SDP. Proceedings of Symposium on Discrete Algorithms, 1067–1078. DOI: 10.1137/1.9781611974331.ch75 [arXiv]
    [BibTeX]
    @inproceedings{Braun2016matching-symmetricSDP:1,
      year = {2016},
      booktitle = {Proceedings of Symposium on Discrete Algorithms},
      pages = {1067–1078},
      doi = {10.1137/1.9781611974331.ch75},
      archiveprefix = {arXiv},
      eprint = {1504.00703},
      primaryclass = {cs.CC},
      author = {Braun, Gábor and Brown-Cohen, Jonah and Huq, Arefin and Pokutta, Sebastian and Raghavendra, Prasad and Roy, Aurko and Weitz, Benjamin and Zink, Daniel},
      title = {The Matching Problem Has No Small Symmetric SDP}
    }
  89. Roy, A., and Pokutta, S. (2016). Hierarchical Clustering via Spreading Metrics. Proceedings of NIPS. [URL] [arXiv]
    [BibTeX]
    @article{AP2016,
      arxiv = {https://arxiv.org/abs/1610.09269},
      author = {Roy, Aurko and Pokutta, Sebastian},
      journal = {{Proceedings of NIPS}},
      url = {https://papers.nips.cc/paper/by-source-2016-1199},
      special = {{Oral Presentation + Conference Proceedings}},
      title = {{Hierarchical Clustering via Spreading Metrics}},
      year = {2016}
    }
  90. Braun, G., Pokutta, S., and Zink, D. (2015). Inapproximability of Combinatorial Problems Via Small LPs and SDPs. Proceedings of Annual Symposium on Theory of Computing, 107–116. DOI: 10.1145/2746539.2746550 [arXiv] [video]
    [BibTeX]
    @inproceedings{Braun2015LP-SDP:1,
      year = {2015},
      booktitle = {Proceedings of Annual Symposium on Theory of Computing},
      month = jun,
      pages = {107–116},
      doi = {10.1145/2746539.2746550},
      archiveprefix = {arXiv},
      eprint = {1410.8816},
      primaryclass = {cs.CC},
      author = {Braun, Gábor and Pokutta, Sebastian and Zink, Daniel},
      title = {Inapproximability of Combinatorial Problems Via Small LPs and SDPs},
      video = {https://youtu.be/MxLEticZ8RY}
    }
  91. Braun, G., and Pokutta, S. (2015). The Matching Polytope Does Not Admit Fully-polynomial Size Relaxation Schemes. Proceedings of Symposium on Discrete Algorithms, 837–846. DOI: 10.1137/1.9781611973730.57 [arXiv]
    [BibTeX]
    @inproceedings{Braun2014matching,
      year = {2015},
      booktitle = {Proceedings of Symposium on Discrete Algorithms},
      pages = {837-846},
      doi = {10.1137/1.9781611973730.57},
      archiveprefix = {arXiv},
      eprint = {1403.6710},
      primaryclass = {cs.CC},
      author = {Braun, Gábor and Pokutta, Sebastian},
      title = {The Matching Polytope Does Not Admit Fully-polynomial Size Relaxation Schemes}
    }
  92. Person, Y., and Parczyk, O. (2015). Spanning Structures and Universality in Sparse Hypergraphs. Proceedings of 8th Eurocomb Conference, 49, 611–619. DOI: 10.1016/j.endm.2015.06.083 [arXiv]
    [BibTeX]
    @inproceedings{spanning_structures_universality_2016:1,
      year = {2015},
      booktitle = {Proceedings of 8th Eurocomb Conference},
      volume = {49},
      pages = {611-619},
      doi = {10.1016/j.endm.2015.06.083},
      archiveprefix = {arXiv},
      eprint = {1504.02243},
      author = {Person, Yury and Parczyk, Olaf},
      title = {Spanning Structures and Universality in Sparse Hypergraphs}
    }
  93. Pokutta, S. (2015). Information Theory and Polyhedral Combinatorics. Proceedings of 53rd Annual Allerton Conference on Communication, Control, and Computing. [PDF]
    [BibTeX]
    @article{p2015,
      annote = {http://ieeexplore.ieee.org/abstract/document/7447134/
      },
      author = {Pokutta, S.},
      journal = {{Proceedings of 53rd Annual Allerton Conference on Communication, Control, and Computing}},
      pdfurl = {http://ieeexplore.ieee.org/abstract/document/7447134/},
      title = {{Information Theory and Polyhedral Combinatorics}},
      year = {2015}
    }
  94. Xie, Y., Li, Q., and Pokutta, S. (2015). Supervised Online Subspace Tracking. Proceedings of Asilomar Conference on Signals, Systems, and Computers.
    [BibTeX]
    @article{xlp2015,
      author = {Xie, Y. and Li, Q. and Pokutta, S.},
      journal = {{Proceedings of Asilomar Conference on Signals, Systems, and Computers}},
      title = {{Supervised Online Subspace Tracking}},
      year = {2015}
    }
  95. Bazzi, A., Fiorini, S., Pokutta, S., and Svensson, O. (2015). Small linear programs cannot approximate Vertex Cover within a factor of 2 - ε. Proceedings of FOCS. [arXiv] [slides]
    [BibTeX]
    @article{BFPS2015,
      arxiv = {http://arxiv.org/abs/1503.00753},
      author = {Bazzi, A. and Fiorini, S. and Pokutta, S. and Svensson, O.},
      journal = {{Proceedings of FOCS}},
      slides = {https://app.box.com/s/00aqupo722bbpmdcyzwt8xmfqzyu14iy},
      title = {{Small linear programs cannot approximate Vertex
                        Cover within a factor of {$2 - \epsilon$}}},
      year = {2015}
    }
  96. Song, R., Xie, Y., and Pokutta, S. (2015). Sequential Sensing with Model Mismatch. Proceedings of ISIT.
    [BibTeX]
    @article{SXP2015,
      author = {Song, R. and Xie, Y. and Pokutta, S.},
      journal = {{Proceedings of ISIT}},
      title = {{Sequential Sensing with Model Mismatch}},
      year = {2015}
    }
  97. Braun, G., Firorini, S., and Pokutta, S. (2014). Average Case Polyhedral Complexity of the Maximum Stable Set Problem. Proceedings of Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 28, 515–530. DOI: 10.4230/LIPIcs.APPROX-RANDOM.2014.515 [URL] [arXiv]
    [BibTeX]
    @inproceedings{Braun2013stable:1,
      year = {2014},
      booktitle = {Proceedings of Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques},
      month = sep,
      volume = {28},
      pages = {515–530},
      doi = {10.4230/LIPIcs.APPROX-RANDOM.2014.515},
      url = {https://drops.dagstuhl.de/opus/volltexte/2014/4720},
      archiveprefix = {arXiv},
      eprint = {1311.4001},
      primaryclass = {cs.CC},
      author = {Braun, Gábor and Firorini, Samuel and Pokutta, Sebastian},
      title = {Average Case Polyhedral Complexity of the Maximum Stable Set Problem}
    }
  98. Braun, G., Pokutta, S., and Xie, Y. (2014). Info-greedy Sequential Adaptive Compressed Sensing. Proceedings of Allerton Conference on Communication, Control, and Computing (Allerton), 858–865. DOI: 10.1109/ALLERTON.2014.7028544 [arXiv]
    [BibTeX]
    @inproceedings{Braun2014info-greedy:1,
      year = {2014},
      booktitle = {Proceedings of Allerton Conference on Communication, Control, and Computing (Allerton)},
      pages = {858–865},
      doi = {10.1109/ALLERTON.2014.7028544},
      archiveprefix = {arXiv},
      eprint = {1407.0731},
      primaryclass = {cs.IT},
      author = {Braun, Gábor and Pokutta, Sebastian and Xie, Yao},
      title = {Info-greedy Sequential Adaptive Compressed Sensing}
    }
  99. Braun, G., and Pokutta, S. (2013). Common Information and Unique Disjointness. Proceedings of Annual Symposium on Foundations of Computer Science, 688–697. [URL]
    [BibTeX]
    @inproceedings{Braun2013info-disjoint:1,
      year = {2013},
      booktitle = {Proceedings of Annual Symposium on Foundations of Computer Science},
      pages = {688–697},
      url = {https://eccc.weizmann.ac.il/report/2013/056},
      author = {Braun, Gábor and Pokutta, Sebastian},
      title = {Common Information and Unique Disjointness}
    }
  100. Schmaltz, C., Pokutta, S., Heidorn, T., and Andrae, S. (2013). How to make regulators and shareholders happy under Basel III. Proceedings of the 26th Australasian Finance and Banking Conference. DOI: 10.1016/j.jbankfin.2014.05.031 [URL]
    [BibTeX]
    @article{basel2012,
      doi = {10.1016/j.jbankfin.2014.05.031},
      url = {http://ssrn.com/abstract=2179490},
      author = {Schmaltz, Christian and Pokutta, Sebastian and Heidorn, Thomas and Andrae, Silvio},
      journal = {{Proceedings of the 26th Australasian Finance and Banking Conference}},
      title = {{How to make regulators and shareholders happy under Basel III}},
      year = {2013}
    }
  101. Briët, J., Dadush, D., and Pokutta, S. (2013). On the existence of 0/1 polytopes with high semidefinite extension complexity. Proceedings of ESA. [arXiv]
    [BibTeX]
    @article{BDP2013,
      arxiv = {http://arxiv.org/abs/1305.3268},
      author = {Bri\"et, Jop and Dadush, Daniel and Pokutta, Sebastian},
      journal = {{Proceedings of ESA}},
      title = {{On the existence of 0/1 polytopes with high semidefinite extension complexity}},
      year = {2013}
    }
  102. Braun, G., and Pokutta, S. (2012). An Algebraic Approach to Symmetric Extended Formulations. Proceedings of International Symposium on Combinatorial Optimization, 7422, 141–152. DOI: 10.1007/978-3-642-32147-4_14 [arXiv]
    [BibTeX]
    @inproceedings{Braun2012symEF,
      year = {2012},
      booktitle = {Proceedings of International Symposium on Combinatorial Optimization},
      month = apr,
      volume = {7422},
      pages = {141–152},
      doi = {10.1007/978-3-642-32147-4_14},
      archiveprefix = {arXiv},
      eprint = {1206.6318},
      primaryclass = {cs.CC},
      author = {Braun, Gábor and Pokutta, Sebastian},
      title = {An Algebraic Approach to Symmetric Extended Formulations}
    }
  103. Braun, G., Firorini, S., Pokutta, S., and Steurer, D. (2012). Approximation Limits of Linear Programs (beyond Hierarchies). Proceedings of Annual Symposium on Foundations of Computer Science, 480–489. DOI: 10.1109/FOCS.2012.10 [arXiv]
    [BibTeX]
    @inproceedings{Braun2012UDISJ:1,
      year = {2012},
      booktitle = {Proceedings of Annual Symposium on Foundations of Computer Science},
      pages = {480–489},
      doi = {10.1109/FOCS.2012.10},
      archiveprefix = {arXiv},
      eprint = {1204.0957},
      primaryclass = {c.CC},
      author = {Braun, Gábor and Firorini, Samuel and Pokutta, Sebastian and Steurer, David},
      title = {Approximation Limits of Linear Programs (beyond Hierarchies)}
    }
  104. Fiorini, S., Massar, S., Pokutta, S., Tiwary, H. R., and de Wolf, R. (2012). Linear vs. Semidefinite Extended Formulations: Exponential Separation and Strong Lower Bounds. Proceedings of STOC. [arXiv]
    [BibTeX]
    @article{fmptw2011,
      arxiv = {http://arxiv.org/abs/1111.0837},
      author = {Fiorini, S. and Massar, S. and Pokutta, S. and Tiwary, H.R. and de~Wolf, R.},
      journal = {Proceedings of STOC},
      special = {{Best paper award at STOC 2012.}},
      title = {{Linear vs. Semidefinite Extended Formulations: Exponential Separation and Strong Lower Bounds}},
      year = {2012}
    }
  105. Dey, S. S., and 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]
    [BibTeX]
    @article{DeyP2010,
      annote = {DOI: 10.1007/978-3-642-20807-2_12},
      arxiv = {http://www.optimization-online.org/DB_HTML/2011/04/3002.html},
      author = {Dey, S.S. and Pokutta, S.},
      journal = {Proceedings of IPCO, Lecture Notes in Computer Science},
      pages = {143--155},
      title = {{Design and verify: a new scheme for generating cutting-planes}},
      volume = {6655},
      year = {2011}
    }
  106. Helmke, H., Gluchshenko, O., Martin, A., Peter, A., Pokutta, S., and Siebert, U. (2011). Optimal Mixed-Mode Runway Scheduling. Proceedings of DACS. [arXiv]
    [BibTeX]
    @article{DLR2011,
      arxiv = {http://www.box.net/shared/34p1ea2of7exdgq7tlty},
      author = {Helmke, H. and Gluchshenko, O. and Martin, A. and Peter, A. and Pokutta, S. and Siebert, U.},
      journal = {{Proceedings of DACS}},
      title = {{Optimal Mixed-Mode Runway Scheduling}},
      year = {2011}
    }
  107. Pokutta, S., and Schmaltz, C. (2011). A network model for bank lending capacity. Proceedings of Systemic Risk, Basel III, Financial Stability and Regulation. [arXiv]
    [BibTeX]
    @article{PSchm2011,
      arxiv = {http://papers.ssrn.com/sol3/papers.cfm?abstract_id=1773964},
      author = {Pokutta, S. and Schmaltz, C.},
      journal = {Proceedings of Systemic Risk, Basel III, Financial Stability and Regulation},
      title = {{A network model for bank lending capacity}},
      year = {2011}
    }
  108. Pokutta, S., and Schmaltz, C. (2011). Optimal Planning under Basel III Regulations. Proceedings of 24th Australasian Finance and Banking Conference. [arXiv]
    [BibTeX]
    @article{PSchmaltz2011,
      arxiv = {http://papers.ssrn.com/sol3/papers.cfm?abstract_id=1914800},
      author = {Pokutta, S. and Schmaltz, C.},
      journal = {Proceedings of 24th Australasian Finance and Banking Conference},
      title = {{Optimal Planning under Basel III Regulations}},
      year = {2011}
    }
  109. Braun, G., and Pokutta, S. (2010). Rank of Random Half-integral Polytopes. Proceedings of Electronic Notes in Discrete Mathematics, 36, 415–422. DOI: 10.1016/j.endm.2010.05.053 [URL]
    [BibTeX]
    @inproceedings{Braun2011half:1,
      year = {2010},
      booktitle = {Proceedings of Electronic Notes in Discrete Mathematics},
      month = aug,
      volume = {36},
      pages = {415–422},
      doi = {10.1016/j.endm.2010.05.053},
      url = {https://optimization-online.org/DB_HTML/2010/11/2813.html},
      author = {Braun, Gábor and Pokutta, Sebastian},
      title = {Rank of Random Half-integral Polytopes}
    }
  110. Drewes, S., and Pokutta, S. (2010). Cutting-planes for weakly-coupled 0/1 second order cone programs. Electronic Notes in Discrete Mathematics, 36, 735–742. [PDF] [arXiv]
    [BibTeX]
    @article{DP2009,
      annote = {doi:10.1016/j.endm.2010.05.093},
      arxiv = {http://www.box.net/shared/4k2qtsl65k},
      author = {Drewes, S. and Pokutta, S.},
      journal = {Electronic Notes in Discrete Mathematics},
      pages = {735--742},
      pdfurl = {http://dx.doi.org/j.endm.2010.05.093},
      title = {{Cutting-planes for weakly-coupled 0/1 second order cone programs}},
      volume = {36},
      year = {2010}
    }
  111. Drewes, S., and Pokutta, S. (2010). Geometric mean maximization in the presence of discrete decisions. Proceedings of 23rd Australasian Finance and Banking Conference.
    [BibTeX]
    @article{DP20102,
      author = {Drewes, S. and Pokutta, S.},
      journal = {Proceedings of 23rd Australasian Finance and Banking Conference},
      title = {{Geometric mean maximization in the presence of discrete decisions}},
      year = {2010}
    }
  112. Martin, A., Müller, J., and Pokutta, S. (2010). On clearing coupled day-ahead electricity markets. Proceedings of 23rd Australasian Finance and Banking Conference. [arXiv]
    [BibTeX]
    @article{MMP20102,
      annote = {doi:10.1080/10556788.2013.823544},
      arxiv = {http://papers.ssrn.com/sol3/papers.cfm?abstract_id=1660528},
      author = {Martin, A. and M{\"u}ller, J. and Pokutta, S.},
      journal = {Proceedings of 23rd Australasian Finance and Banking Conference},
      title = {{On clearing coupled day-ahead electricity markets}},
      year = {2010}
    }
  113. Pokutta, S., and 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]
    [BibTeX]
    @article{PS20091,
      annote = {doi:10.1007/978-3-642-13036-6_34},
      arxiv = {http://www.optimization-online.org/DB_HTML/2013/02/3782.html},
      author = {Pokutta, S. and Schulz, A.S.},
      journal = {Proceedings of IPCO, Lecture Notes in Computer Science},
      pages = {450--463},
      pdfurl = {http://dx.doi.org/10.1007/978-3-642-13036-6_34},
      title = {{On the rank of generic cutting-plane proof systems}},
      volume = {6080},
      year = {2010}
    }
  114. Pokutta, S., and Schmaltz, C. (2009). Optimal degree of centralization of liquidity management. Proceedings of 22nd Australasian Finance and Banking Conference. [arXiv]
    [BibTeX]
    @article{PSchm,
      arxiv = {http://papers.ssrn.com/sol3/papers.cfm?abstract_id=1458963},
      author = {Pokutta, S. and Schmaltz, C.},
      journal = {Proceedings of 22nd Australasian Finance and Banking Conference},
      title = {{Optimal degree of centralization of liquidity management}},
      year = {2009}
    }

Full Articles

  1. Pokutta, S. (2024). The Frank-Wolfe Algorithm: a Short Introduction. Jahresbericht Der Deutschen Mathematiker-Vereinigung, 126(1), 3–35. DOI: 10.1365/s13291-023-00275-x [URL] [arXiv]
    [BibTeX]
    @article{fwshortintro2023,
      year = {2024},
      journal = {Jahresbericht der Deutschen Mathematiker-Vereinigung},
      month = mar,
      volume = {126},
      number = {1},
      pages = {3–35},
      doi = {10.1365/s13291-023-00275-x},
      url = {https://link.springer.com/article/10.1365/s13291-023-00275-x/fulltext.html},
      archiveprefix = {arXiv},
      eprint = {2311.05313},
      primaryclass = {math.OC},
      author = {Pokutta, Sebastian},
      title = {The Frank-Wolfe Algorithm: a Short Introduction}
    }
  2. Bolusani, S., Besançon, M., Gleixner, A., Berthold, T., D’Ambrosio, C., Muñoz, G., Paat, J., and Thomopulos, D. (2024). The MIP Workshop 2023 Computational Competition on Reoptimization. Mathematical Programming Computation. DOI: 10.1007/s12532-024-00256-w [arXiv]
    [BibTeX]
    @article{BolusaniEtal2023_TheMIP,
      year = {2024},
      journal = {Mathematical Programming Computation},
      doi = {10.1007/s12532-024-00256-w},
      archiveprefix = {arXiv},
      eprint = {2311.14834},
      primaryclass = {math.OC},
      author = {Bolusani, Suresh and Besançon, Mathieu and Gleixner, Ambros and Berthold, Timo and D'Ambrosio, Claudia and Muñoz, Gonzalo and Paat, Joseph and Thomopulos, Dimitri},
      title = {The MIP Workshop 2023 Computational Competition on Reoptimization}
    }
  3. Braun, G., Guzmán, C., and Pokutta, S. (2024). Corrigendum in “Lower Bounds on the Oracle Complexity of Nonsmooth Convex Optimization Via Information Theory.” IEEE Transactions on Information Theory. DOI: 10.1109/TIT.2024.3357200
    [BibTeX]
    @article{Braun2013lowerCO_corr,
      year = {2024},
      journal = {IEEE Transactions on Information Theory},
      doi = {10.1109/TIT.2024.3357200},
      author = {Braun, Gábor and Guzmán, Cristóbal and Pokutta, Sebastian},
      title = {Corrigendum in “Lower Bounds on the Oracle Complexity of Nonsmooth Convex Optimization Via Information Theory”}
    }
  4. Carderera, A., Besançon, M., and Pokutta, S. (2024). Scalable Frank-Wolfe on Generalized Self-concordant Functions Via Simple Steps. SIAM Journal on Optimization. [summary] [slides] [poster] [code]
    [BibTeX]
    @article{CBP2021,
      year = {2024},
      journal = {SIAM Journal on Optimization},
      author = {Carderera, Alejandro and Besançon, Mathieu and Pokutta, Sebastian},
      title = {Scalable Frank-Wolfe on Generalized Self-concordant Functions Via Simple Steps},
      code = {https://doi.org/10.5281/zenodo.4836009},
      poster = {https://pokutta.com/slides/20211120_poster_NeurIPS21_lSimple_steps_are_all_you_need.pdf},
      slides = {https://pokutta.com/slides/20210710_FW-simpleSteps-SelfConcordance.pdf},
      summary = {https://pokutta.com/blog/research/2021/10/09/self-concordant-abstract.html}
    }
  5. Eifler, L., and Gleixner, A. (2024). Safe and Verified Gomory Mixed Integer Cuts in a Rational MIP Framework. SIAM Journal on Optimization, 34(1), 742–763. DOI: 10.1137/23M156046X [URL]
    [BibTeX]
    @article{EiflerGleixner2023_Safeandverified,
      year = {2024},
      journal = {SIAM Journal on Optimization},
      volume = {34},
      number = {1},
      pages = {742-763},
      doi = {10.1137/23M156046X},
      note = {ZIB report 23-09},
      url = {https://nbn-resolving.org/urn:nbn:de:0297-zib-90159},
      author = {Eifler, Leon and Gleixner, Ambros},
      title = {Safe and Verified Gomory Mixed Integer Cuts in a Rational MIP Framework}
    }
  6. Deza, A., Pokutta, S., and Pournin, L. (2024). The Complexity of Geometric Scaling. Operations Research Letters, 52. DOI: 10.1016/j.orl.2023.11.010 [arXiv]
    [BibTeX]
    @article{dpp_geometric_scaling_22,
      year = {2024},
      journal = {Operations Research Letters},
      volume = {52},
      doi = {10.1016/j.orl.2023.11.010},
      archiveprefix = {arXiv},
      eprint = {2205.04063},
      primaryclass = {math.OC},
      author = {Deza, Antoine and Pokutta, Sebastian and Pournin, Lionel},
      title = {The Complexity of Geometric Scaling}
    }
  7. Prause, F., Borndörfer, R., Grimm, B., and Tesch, A. (2024). Approximating Rolling Stock Rotations with Integrated Predictive Maintenance. Journal of Rail Transport Planning & Management, 30. DOI: 10.1016/j.jrtpm.2024.100434
    [BibTeX]
    @article{frba_arsripm_2024,
      year = {2024},
      journal = {Journal of Rail Transport Planning & Management},
      volume = {30},
      doi = {10.1016/j.jrtpm.2024.100434},
      author = {Prause, Felix and Borndörfer, Ralf and Grimm, Boris and Tesch, Alexander},
      title = {Approximating Rolling Stock Rotations with Integrated Predictive Maintenance}
    }
  8. Mundinger, K., Pokutta, S., Spiegel, C., and Zimmer, M. (2024). Extending the Continuum of Six-Colorings. Geombinatorics Quarterly, XXXIV. [arXiv]
    [BibTeX]
    @article{mpsz_hadwigernelsonspectrum_24,
      year = {2024},
      journal = {Geombinatorics Quarterly},
      volume = {XXXIV},
      archiveprefix = {arXiv},
      eprint = {2404.05509},
      author = {Mundinger, Konrad and Pokutta, Sebastian and Spiegel, Christoph and Zimmer, Max},
      title = {Extending the Continuum of Six-Colorings}
    }
  9. Tjusila, G., Besançon, M., Turner, M., and Koch, T. (2024). How Many Clues To Give? A Bilevel Formulation For The Minimum Sudoku Clue Problem. Operations Research Letters. DOI: 10.1016/j.orl.2024.107105 [URL] [arXiv]
    [BibTeX]
    @article{sudoku_clues_23,
      year = {2024},
      journal = {Operations Research Letters},
      doi = {10.1016/j.orl.2024.107105},
      url = {https://sciencedirect.com/science/article/abs/pii/S0167637724000415},
      archiveprefix = {arXiv},
      eprint = {2305.01697},
      primaryclass = {math.OC},
      author = {Tjusila, Gennesaret and Besançon, Mathieu and Turner, Mark and Koch, Thorsten},
      title = {How Many Clues To Give? A Bilevel Formulation For The Minimum Sudoku Clue Problem.}
    }
  10. Designolle, S., Vértesi, T., and Pokutta, S. (2024). Symmetric Multipartite Bell Inequalities Via Frank-Wolfe Algorithms. Physics Review A. [arXiv]
    [BibTeX]
    @article{symmetricBell2023,
      year = {2024},
      journal = {Physics Review A},
      archiveprefix = {arXiv},
      eprint = {2310.20677},
      primaryclass = {quant-ph},
      author = {Designolle, Sébastien and Vértesi, Tamás and Pokutta, Sebastian},
      title = {Symmetric Multipartite Bell Inequalities Via Frank-Wolfe Algorithms}
    }
  11. Designolle, S., Iommazzo, G., Besançon, M., Knebel, S., Gelß, P., and Pokutta, S. (2023). Improved Local Models and New Bell Inequalities Via Frank-Wolfe Algorithms. Physical Review Research, 5(4). DOI: 10.1103/PhysRevResearch.5.043059 [arXiv] [slides] [code]
    [BibTeX]
    @article{dibkgp_bell_23,
      year = {2023},
      journal = {Physical Review Research},
      month = oct,
      volume = {5},
      number = {4},
      doi = {10.1103/PhysRevResearch.5.043059},
      archiveprefix = {arXiv},
      eprint = {2302.04721},
      primaryclass = {quant-ph},
      author = {Designolle, Sébastien and Iommazzo, Gabriele and Besançon, Mathieu and Knebel, Sebastian and Gelß, Patrick and Pokutta, Sebastian},
      title = {Improved Local Models and New Bell Inequalities Via Frank-Wolfe Algorithms},
      code = {https://github.com/ZIB-IOL/BellPolytopes.jl},
      slides = {https://www.pokutta.com/slides/20230808-tokyo-bell.pdf}
    }
  12. Besançon, M., Garcia, J. D., Legat, B., and Sharma, A. (2023). Flexible Differentiable Optimization Via Model Transformations. INFORMS Journal on Computing. DOI: 10.1287/ijoc.2022.0283 [URL] [arXiv]
    [BibTeX]
    @article{diffopt_23,
      year = {2023},
      journal = {INFORMS Journal on Computing},
      month = aug,
      doi = {10.1287/ijoc.2022.0283},
      url = {https://pubsonline.informs.org/doi/epdf/10.1287/ijoc.2022.0283},
      archiveprefix = {arXiv},
      eprint = {2206.06135},
      primaryclass = {cs.LG},
      author = {Besançon, Mathieu and Garcia, Joaquim Dias and Legat, Benoît and Sharma, Akshay},
      title = {Flexible Differentiable Optimization Via Model Transformations}
    }
  13. Berthold, T., Mexi, G., and Salvagnin, D. (2023). Using Multiple Reference Vectors and Objective Scaling in the Feasibility Pump. EURO Journal on Computational Optimization, 11. DOI: 10.1016/j.ejco.2023.100066
    [BibTeX]
    @article{BertholdMexiSalvagnin2023,
      year = {2023},
      journal = {EURO Journal on Computational Optimization},
      volume = {11},
      doi = {10.1016/j.ejco.2023.100066},
      author = {Berthold, Timo and Mexi, Gioni and Salvagnin, Domenico},
      title = {Using Multiple Reference Vectors and Objective Scaling in the Feasibility Pump}
    }
  14. Bestuzheva, K., Besançon, M., Chen, W.-K., Chmiela, A., Donkiewicz, T., van Doornmalen, J., Eifler, L., Gaul, O., Gamrath, G., Gleixner, A., Gottwald, L., Graczyk, C., Halbig, K., Hoen, A., Hojny, C., van der Hulst, R., Koch, T., Lübbecke, M., Maher, S. J., … Witzig, J. (2023). Enabling Research Through the SCIP Optimization Suite 8.0. ACM Transactions on Mathematical Software. DOI: 10.1145/3585516 [arXiv]
    [BibTeX]
    @article{BestuzhevaBesanconEtal2023,
      year = {2023},
      journal = {ACM Transactions on Mathematical Software},
      doi = {10.1145/3585516},
      archiveprefix = {arXiv},
      eprint = {2303.07101},
      primaryclass = {math.OC},
      author = {Bestuzheva, Ksenia and Besançon, Mathieu and Chen, Wei-Kun and Chmiela, Antonia and Donkiewicz, Tim and van Doornmalen, Jasper and Eifler, Leon and Gaul, Oliver and Gamrath, Gerald and Gleixner, Ambros and Gottwald, Leona and Graczyk, Christoph and Halbig, Katrin and Hoen, Alexander and Hojny, Christopher and van der Hulst, Rolf and Koch, Thorsten and Lübbecke, Marco and Maher, Stephen J. and Matter, Frederic and Mühmer, Erik and Müller, Benjamin and Pfetsch, Marc and Rehfeldt, Daniel and Schlein, Steffan and Schlösser, Franziska and Serrano, Felipe and Shinano, Yuji and Sofranac, Boro and Turner, Mark and Vigerske, Stefan and Wegscheider, Fabian and Wellner, Philipp and Weninger, Dieter and Witzig, Jakob},
      title = {Enabling Research Through the SCIP Optimization Suite 8.0}
    }
  15. Bestuzheva, K., Chmiela, A., Müller, B., Serrano, F., Vigerske, S., and Wegscheider, F. (2023). Global Optimization of Mixed-integer Nonlinear Programs with SCIP 8.0. Journal of Global Optimization. DOI: 10.1007/s10898-023-01345-1 [URL] [arXiv]
    [BibTeX]
    @article{BestuzhevaChmielaMueller2023_GlobalOptimizationOfMixedInteger,
      year = {2023},
      journal = {Journal of Global Optimization},
      doi = {10.1007/s10898-023-01345-1},
      note = {ZIB report 23-01},
      url = {https://nbn-resolving.org/urn:nbn:de:0297-zib-89348},
      archiveprefix = {arXiv},
      eprint = {2301.00587},
      primaryclass = {math.OC},
      author = {Bestuzheva, Ksenia and Chmiela, Antonia and Müller, Benjamin and Serrano, Felipe and Vigerske, Stefan and Wegscheider, Fabian},
      title = {Global Optimization of Mixed-integer Nonlinear Programs with SCIP 8.0}
    }
  16. Bestuzheva, K., Gleixner, A., and Vigerske, S. (2023). A Computational Study of Perspective Cuts. Mathematical Programming Computation, 15, 703–731. DOI: 10.1007/s12532-023-00246-4 [URL] [arXiv]
    [BibTeX]
    @article{BestuzhevaGleixnerVigerske2023,
      year = {2023},
      journal = {Mathematical Programming Computation},
      volume = {15},
      pages = {703-731},
      doi = {10.1007/s12532-023-00246-4},
      note = {ZIB report 21-07},
      url = {https://nbn-resolving.org/urn:nbn:de:0297-zib-81821},
      archiveprefix = {arXiv},
      eprint = {2103.09573},
      primaryclass = {math.OC},
      author = {Bestuzheva, Ksenia and Gleixner, Ambros and Vigerske, Stefan},
      title = {A Computational Study of Perspective Cuts}
    }
  17. Eifler, L., and Gleixner, A. (2023). A Computational Status Update for Exact Rational Mixed Integer Programming. Mathematical Programming, 197, 793–812. DOI: 10.1007/s10107-021-01749-5
    [BibTeX]
    @article{EiflerGleixner2023_Acomputational,
      year = {2023},
      journal = {Mathematical Programming},
      volume = {197},
      pages = {793-812},
      doi = {10.1007/s10107-021-01749-5},
      author = {Eifler, Leon and Gleixner, Ambros},
      title = {A Computational Status Update for Exact Rational Mixed Integer Programming}
    }
  18. Gleixner, A., Gottwald, L., and Hoen, A. (2023). PaPILO: a Parallel Presolving Library for Integer and Linear Programming with Multiprecision Support. INFORMS Journal on Computing. DOI: 10.1287/ijoc.2022.0171 [arXiv]
    [BibTeX]
    @article{HoenGottwaldGleixner2023_PaPILO,
      year = {2023},
      journal = {INFORMS Journal on Computing},
      doi = {10.1287/ijoc.2022.0171},
      archiveprefix = {arXiv},
      eprint = {2206.10709},
      primaryclass = {math.OC},
      author = {Gleixner, Ambros and Gottwald, Leona and Hoen, Alexander},
      title = {PaPILO: a Parallel Presolving Library for Integer and Linear Programming with Multiprecision Support}
    }
  19. Liberti, L., Iommazzo, G., Lavor, C., and Maculan, N. (2023). Cycle-based Formulations in Distance Geometry. Open Journal of Mathematical Optimization, 4(1). DOI: 10.5802/ojmo.18 [arXiv]
    [BibTeX]
    @article{LIL+23,
      year = {2023},
      journal = {Open Journal of Mathematical Optimization},
      volume = {4},
      number = {1},
      doi = {10.5802/ojmo.18},
      archiveprefix = {arXiv},
      eprint = {2006.11523},
      primaryclass = {math.OC},
      author = {Liberti, Leo and Iommazzo, Gabriele and Lavor, Carlile and Maculan, Nelson},
      title = {Cycle-based Formulations in Distance Geometry}
    }
  20. Gupta, P., Hamann, F., Müyesser, A., Sgueglia, A., and Parczyk, O. (2023). A General Approach to Transversal Versions of Dirac-type Theorems. Bulletin of the London Mathematical Society, 55, 2817–2839. DOI: 10.1112/blms.12896 [arXiv]
    [BibTeX]
    @article{a_general_approach_2023,
      year = {2023},
      journal = {Bulletin of the London Mathematical Society},
      volume = {55},
      pages = {2817-2839},
      doi = {10.1112/blms.12896},
      archiveprefix = {arXiv},
      eprint = {2209.09289},
      author = {Gupta, Pranshu and Hamann, Fabian and Müyesser, Alp and Sgueglia, Amedeo and Parczyk, Olaf},
      title = {A General Approach to Transversal Versions of Dirac-type Theorems}
    }
  21. Kevin-Martin, A., Bärmann, A., Braun, K., Liers, F., Pokutta, S., Schneider, O., Sharma, K., and Tschuppik, S. (2023). Data-driven Distributionally Robust Optimization Over Time. INFORMS Journal on Optimization. [arXiv]
    [BibTeX]
    @article{abblpsst_distributionally_ro_23,
      year = {2023},
      journal = {INFORMS Journal on Optimization},
      archiveprefix = {arXiv},
      eprint = {2304.05377},
      primaryclass = {math.OC},
      author = {Kevin-Martin, Aigner and Bärmann, Andreas and Braun, Kristin and Liers, Frauke and Pokutta, Sebastian and Schneider, Oskar and Sharma, Kartikey and Tschuppik, Sebastian},
      title = {Data-driven Distributionally Robust Optimization Over Time}
    }
  22. Kreimeier, T., Pokutta, S., Walther, A., and Woodstock, Z. (2023). On a Frank-Wolfe Approach for Abs-smooth Functions. Optimization Methods and Software. [arXiv]
    [BibTeX]
    @article{abssmooth-fw_2023,
      year = {2023},
      journal = {Optimization Methods and Software},
      archiveprefix = {arXiv},
      eprint = {2303.09881},
      primaryclass = {math.OC},
      author = {Kreimeier, Timo and Pokutta, Sebastian and Walther, Andrea and Woodstock, Zev},
      title = {On a Frank-Wolfe Approach for Abs-smooth Functions}
    }
  23. Kohayakawa, Y., Mota, G. O., Schnitzer, J., and Parczyk, O. (2023). Anti-Ramsey Threshold of Complete Graphs for Sparse Graphs. Discrete Mathematics, 346(5), 113343. DOI: 10.1016/j.disc.2023.113343 [arXiv]
    [BibTeX]
    @article{anti_ramsey_threshold_2023,
      year = {2023},
      journal = {Discrete Mathematics},
      volume = {346},
      number = {5},
      pages = {113343},
      doi = {10.1016/j.disc.2023.113343},
      archiveprefix = {arXiv},
      eprint = {1902.00306},
      author = {Kohayakawa, Yoshiharu and Mota, Guilherme O. and Schnitzer, Jakob and Parczyk, Olaf},
      title = {Anti-Ramsey Threshold of Complete Graphs for Sparse Graphs}
    }
  24. Kruser, J., Sharma, K., Holl, J., and Nohadani, O. (2023). Identifying Patterns of Medical Intervention in Acute Respiratory Failure: A Retrospective Observational Study. Critical Care Explorations.
    [BibTeX]
    @article{kshn_identifying_23,
      year = {2023},
      journal = {Critical Care Explorations},
      author = {Kruser, Jacqueline and Sharma, Kartikey and Holl, Jane and Nohadani, Omid},
      title = {Identifying Patterns of Medical Intervention in Acute Respiratory Failure: A Retrospective Observational Study}
    }
  25. Bienstock, D., Muñoz, G., and Pokutta, S. (2023). Principled Deep Neural Network Training Through Linear Programming. Discrete Optimization. [URL] [arXiv] [summary]
    [BibTeX]
    @article{principledDNN_LP_2018,
      year = {2023},
      journal = {Discrete Optimization},
      url = {https://www.sciencedirect.com/science/article/abs/pii/S1572528623000373},
      archiveprefix = {arXiv},
      eprint = {1810.03218},
      primaryclass = {cs.LG},
      author = {Bienstock, Daniel and Muñoz, Gonzalo and Pokutta, Sebastian},
      title = {Principled Deep Neural Network Training Through Linear Programming},
      summary = {https://www.pokutta.com/blog/research/2018/10/12/DNN-learning-lp-abstract.html}
    }
  26. Riedel, J., Gelß, P., Klein, R., and Schmidt, B. (2023). WaveTrain: A Python Package for Numerical Quantum Mechanics of Chain-like Systems Based on Tensor Trains. The Journal of Chemical Physics, 158(16), 164801. DOI: 10.1063/5.0147314 [URL] [arXiv]
    [BibTeX]
    @article{rgks_wavetrain_23,
      year = {2023},
      journal = {The Journal of Chemical Physics},
      volume = {158},
      number = {16},
      pages = {164801},
      doi = {10.1063/5.0147314},
      url = {https://pubs.aip.org/aip/jcp/article/158/16/164801/2887212/WaveTrain-A-Python-package-for-numerical-quantum},
      archiveprefix = {arXiv},
      eprint = {2302.03725},
      primaryclass = {quant-ph},
      author = {Riedel, Jerome and Gelß, Patrick and Klein, Rupert and Schmidt, Burkhard},
      title = {WaveTrain: A Python Package for Numerical Quantum Mechanics of Chain-like Systems Based on Tensor Trains}
    }
  27. Combettes, C. W., and Pokutta, S. (2023). Revisiting the Approximate Carathéodory Problem via the Frank-Wolfe Algorithm. Mathematical Programming A, 197, 191–214. DOI: 10.1007/s10107-021-01735-x [PDF] [arXiv] [summary] [slides] [code] [video]
    [BibTeX]
    @article{cp2019approxCara,
      arxiv = {https://arxiv.org/abs/1911.04415},
      doi = {10.1007/s10107-021-01735-x},
      author = {Combettes, Cyrille W and Pokutta, Sebastian},
      code = {https://colab.research.google.com/drive/1GLGRTc2jFYy9CqqoVnZgIFVQgAC0c3aZ},
      journal = {Mathematical Programming A},
      volume = {197},
      pages = {191–-214},
      slides = {https://app.box.com/s/f0zuvr45qa6etidd06i1wart58o7bc8t},
      summary = {http://www.pokutta.com/blog/research/2019/11/30/approxCara-abstract.html},
      title = {{Revisiting the Approximate Carath{\'e}odory Problem via the Frank-Wolfe Algorithm}},
      video = {https://www.youtube.com/watch?v=VB1e0HrDmVo},
      pdfurl = {https://rdcu.be/cCnPL},
      year = {2023}
    }
  28. Wilken, S. E., Besançon, M., Kratochvíl, M., Kuate, C. A. F., Trefois, C., Gu, W., and Ebenhöh, O. (2022). Interrogating the Effect of Enzyme Kinetics on Metabolism Using Differentiable Constraint-based Models. Metabolic Engineering.
    [BibTeX]
    @article{enzymekinetics22,
      year = {2022},
      journal = {Metabolic Engineering},
      month = nov,
      author = {Wilken, St. Elmo and Besançon, Mathieu and Kratochvíl, Miroslav and Kuate, Chilperic Armel Foko and Trefois, Christophe and Gu, Wei and Ebenhöh, Oliver},
      title = {Interrogating the Effect of Enzyme Kinetics on Metabolism Using Differentiable Constraint-based Models}
    }
  29. Besançon, M., Carderera, A., and Pokutta, S. (2022). FrankWolfe.jl: A High-Performance and Flexible Toolbox for Frank-Wolfe Algorithms and Conditional Gradients. INFORMS Journal on Computing. [arXiv] [summary] [slides] [code]
    [BibTeX]
    @article{besanccon2022frankwolfe,
      year = {2022},
      journal = {INFORMS Journal on Computing},
      month = feb,
      archiveprefix = {arXiv},
      eprint = {2104.06675},
      primaryclass = {math.OC},
      author = {Besançon, Mathieu and Carderera, Alejandro and Pokutta, Sebastian},
      title = {FrankWolfe.jl: A High-Performance and Flexible Toolbox for Frank-Wolfe Algorithms and Conditional Gradients},
      code = {https://github.com/ZIB-IOL/FrankWolfe.jl},
      slides = {https://pokutta.com/slides/20210710_FW-simpleSteps-SelfConcordance.pdf},
      summary = {https://pokutta.com/blog/research/2021/04/20/FrankWolfejl.html}
    }
  30. Bolusani, S., and Ralphs, T. K. (2022). A Framework for Generalized Benders’ Decomposition and Its Applications to Multilevel Optimization. Mathematical Programming, 196, 389–426. DOI: 10.1007/s10107-021-01763-7 [arXiv]
    [BibTeX]
    @article{BolRal22,
      year = {2022},
      journal = {Mathematical Programming},
      volume = {196},
      pages = {389-426},
      doi = {10.1007/s10107-021-01763-7},
      archiveprefix = {arXiv},
      eprint = {2104.06496},
      primaryclass = {math.OC},
      author = {Bolusani, Suresh and Ralphs, Ted K.},
      title = {A Framework for Generalized Benders' Decomposition and Its Applications to Multilevel Optimization}
    }
  31. Chmiela, A., Muñoz, G., and Serrano, F. (2022). On the Implementation and Strengthening of Intersection Cuts for QCQPs. Mathematical Programming B, 197, 549–586. DOI: 10.1007/s10107-022-01808-5
    [BibTeX]
    @article{ChmielaMunozSerrano2021_Onimplementation,
      year = {2022},
      journal = {Mathematical Programming B},
      volume = {197},
      pages = {549-586},
      doi = {10.1007/s10107-022-01808-5},
      author = {Chmiela, Antonia and Muñoz, Gonzalo and Serrano, Felipe},
      title = {On the Implementation and Strengthening of Intersection Cuts for QCQPs}
    }
  32. Eifler, L., Gleixner, A., and Pulaj, J. (2022). A Safe Computational Framework for Integer Programming Applied to Chvátal’s Conjecture. ACM Transactions on Mathematical Software, 48(2), 1–12. DOI: 10.1145/3485630
    [BibTeX]
    @article{EiflerGleixnerPulaj2022_Asafecomputational,
      year = {2022},
      journal = {ACM Transactions on Mathematical Software},
      volume = {48},
      number = {2},
      pages = {1-12},
      doi = {10.1145/3485630},
      author = {Eifler, Leon and Gleixner, Ambros and Pulaj, Jonad},
      title = {A Safe Computational Framework for Integer Programming Applied to Chvátal's Conjecture}
    }
  33. Hoppmann-Baum, K., Burdakov, O., Mexi, G., Casselgren, C. J., and Koch, T. (2022). Length-Constrained Cycle Partition with an Application to UAV Routing. Optimization Methods and Software. DOI: 10.1080/10556788.2022.2053972
    [BibTeX]
    @article{HoppmannBaumBurdakovMexietal.2022,
      year = {2022},
      journal = {Optimization Methods and Software},
      doi = {10.1080/10556788.2022.2053972},
      author = {Hoppmann-Baum, Kai and Burdakov, Oleg and Mexi, Gioni and Casselgren, Carl Johan and Koch, Thorsten},
      title = {Length-Constrained Cycle Partition with an Application to UAV Routing}
    }
  34. Iommazzo, G., D’Ambrosio, C., Frangioni, A., and Liberti, L. (2022). Algorithm Configuration Problem. In Encyclopedia of Optimization (pp. 1–8). DOI: 10.1007/978-3-030-54621-2_749-1
    [BibTeX]
    @incollection{IDF+22,
      year = {2022},
      booktitle = {Encyclopedia of Optimization},
      pages = {1-8},
      doi = {10.1007/978-3-030-54621-2_749-1},
      author = {Iommazzo, Gabriele and D'Ambrosio, Claudia and Frangioni, Antonio and Liberti, Leo},
      title = {Algorithm Configuration Problem}
    }
  35. Sofranac, B., Gleixner, A., and Pokutta, S. (2022). Accelerating Domain Propagation: An Efficient GPU-parallel Algorithm Over Sparse Matrices. Parallel Computing, 109, 102874. DOI: 10.1016/j.parco.2021.102874 [arXiv] [summary]
    [BibTeX]
    @article{SofranacGleixnerPokutta2022_Accelerating,
      year = {2022},
      journal = {Parallel Computing},
      volume = {109},
      pages = {102874},
      doi = {10.1016/j.parco.2021.102874},
      archiveprefix = {arXiv},
      eprint = {2009.07785},
      primaryclass = {cs.DC},
      author = {Sofranac, Boro and Gleixner, Ambros and Pokutta, Sebastian},
      title = {Accelerating Domain Propagation: An Efficient GPU-parallel Algorithm Over Sparse Matrices},
      summary = {https://pokutta.com/blog/research/2020/09/20/gpu-prob.html}
    }
  36. Sofranac, B., Gleixner, A., and Pokutta, S. (2022). An Algorithm-independent Measure of Progress for Linear Constraint Propagation. Constraints, 27, 432–455. DOI: 10.1007/s10601-022-09338-9 [arXiv]
    [BibTeX]
    @article{SofranacGleixnerPokutta2022_AnAlgorithm-IndependentMeasure,
      year = {2022},
      journal = {Constraints},
      volume = {27},
      pages = {432-455},
      doi = {10.1007/s10601-022-09338-9},
      archiveprefix = {arXiv},
      eprint = {2106.07573},
      primaryclass = {math.OC},
      author = {Sofranac, Boro and Gleixner, Ambros and Pokutta, Sebastian},
      title = {An Algorithm-independent Measure of Progress for Linear Constraint Propagation}
    }
  37. Gahururu, D., Hintermüller, M., Stengl, S.-M., and Surowiec, T. M. (2022). Generalized Nash Equilibrium Problems with Partial Differential Operators: Theory, Algorithms, and Risk Aversion. In Non-smooth and Complementarity-based Distributed Parameter Systems: Simulation and Hierarchical Optimization (Vol. 172, pp. 145–181). DOI: 10.1007/978-3-030-79393-7_7
    [BibTeX]
    @incollection{Stengl2022Nash-PDE,
      year = {2022},
      booktitle = {Non-smooth and Complementarity-based Distributed Parameter Systems: Simulation and Hierarchical Optimization},
      volume = {172},
      pages = {145–181},
      doi = {10.1007/978-3-030-79393-7_7},
      author = {Gahururu, Deborah and Hintermüller, Michael and Stengl, Steven-Marian and Surowiec, Thomas M.},
      title = {Generalized Nash Equilibrium Problems with Partial Differential Operators: Theory, Algorithms, and Risk Aversion}
    }
  38. Barros, G. F., Cavalar, B. P., Mota, G. O., and Parczyk, O. (2022). Anti-Ramsey Threshold of Cycles for Sparse Graphs. Discrete Applied Mathematics, 323, 228–235. DOI: 10.1016/j.dam.2021.10.021 [arXiv]
    [BibTeX]
    @article{anti_ramsey_cycles_sparse_2019,
      year = {2022},
      journal = {Discrete Applied Mathematics},
      volume = {323},
      pages = {228-235},
      doi = {10.1016/j.dam.2021.10.021},
      archiveprefix = {arXiv},
      eprint = {2006.02079},
      author = {Barros, Gabriel F. and Cavalar, Bruno P. and Mota, Guilherme O. and Parczyk, Olaf},
      title = {Anti-Ramsey Threshold of Cycles for Sparse Graphs}
    }
  39. Gelß, P., Klein, R., Matera, S., and Schmidt, B. (2022). Solving the Time-independent Schrödinger Equation for Chains of Coupled Excitons and Phonons Using Tensor Trains. The Journal of Chemical Physics, 156, 024109. DOI: 10.1063/5.0074948 [URL] [arXiv]
    [BibTeX]
    @article{gkms_tise_22,
      year = {2022},
      journal = {The Journal of Chemical Physics},
      volume = {156},
      pages = {024109},
      doi = {10.1063/5.0074948},
      url = {https://pubs.aip.org/aip/jcp/article/156/2/024109/2839835/Solving-the-time-independent-Schrodinger-equation},
      archiveprefix = {arXiv},
      eprint = {2109.15104},
      primaryclass = {physics.comp-ph},
      author = {Gelß, Patrick and Klein, Rupert and Matera, Sebastian and Schmidt, Burkhard},
      title = {Solving the Time-independent Schrödinger Equation for Chains of Coupled Excitons and Phonons Using Tensor Trains}
    }
  40. Hunkenschröder, C., Pokutta, S., and Weismantel, R. (2022). Optimizing a Low-dimensional Convex Function Over a High-dimensional Cube. SIAM Journal on Optimization. [arXiv]
    [BibTeX]
    @article{hpw_lowhigh_22,
      year = {2022},
      journal = {SIAM Journal on Optimization},
      archiveprefix = {arXiv},
      eprint = {2204.05266},
      primaryclass = {math.OC},
      author = {Hunkenschröder, Christoph and Pokutta, Sebastian and Weismantel, Robert},
      title = {Optimizing a Low-dimensional Convex Function Over a High-dimensional Cube}
    }
  41. Combettes, P. L., and Woodstock, Z. (2022). A Variational Inequality Model for the Construction of Signals From Inconsistent Nonlinear Equations. SIAM Journal on Imaging Sciences, 15(1), 84–109. DOI: 10.1137/21M1420368
    [BibTeX]
    @article{inconsistentVI,
      year = {2022},
      journal = {SIAM Journal on Imaging Sciences},
      volume = {15},
      number = {1},
      pages = {84–109},
      doi = {10.1137/21M1420368},
      author = {Combettes, P. L. and Woodstock, Zev},
      title = {A Variational Inequality Model for the Construction of Signals From Inconsistent Nonlinear Equations}
    }
  42. Kossen, T., Hirzel, M. A., Madai, V. I., Boenisch, F., Hennemuth, A., Hildebrand, K., Pokutta, S., Sharma, K., Hilbert, A., Sobesky, J., Galinovic, I., Khalil, A. A., Fiebach, J. B., and Frey, D. (2022). Towards Sharing Brain Images: Differentially Private TOF-MRA Images with Segmentation Labels Using Generative Adversarial Networks. Frontiers in Artificial Intelligence. DOI: 10.3389/frai.2022.813842
    [BibTeX]
    @article{khmbhhpshsgkff_22,
      year = {2022},
      journal = {Frontiers in Artificial Intelligence},
      doi = {10.3389/frai.2022.813842},
      author = {Kossen, Tabea and Hirzel, Manuel A. and Madai, Vince I. and Boenisch, Franziska and Hennemuth, Anja and Hildebrand, Kristian and Pokutta, Sebastian and Sharma, Kartikey and Hilbert, Adam and Sobesky, Jan and Galinovic, Ivana and Khalil, Ahmed A. and Fiebach, Jochen B. and Frey, Dietmar},
      title = {Towards Sharing Brain Images: Differentially Private TOF-MRA Images with Segmentation Labels Using Generative Adversarial Networks}
    }
  43. Kamčev, N., and Spiegel, C. (2022). Another Note on Intervals in the Hales-Jewett Theorem. Electronic Journal of Combinatorics, 29(1). DOI: 10.37236/9400 [URL] [arXiv]
    [BibTeX]
    @article{ks_halesjewett_18,
      year = {2022},
      journal = {Electronic Journal of Combinatorics},
      volume = {29},
      number = {1},
      doi = {10.37236/9400},
      url = {https://combinatorics.org/ojs/index.php/eljc/article/view/v29i1p62},
      archiveprefix = {arXiv},
      eprint = {1811.04628},
      primaryclass = {math.CO},
      author = {Kamčev, Nina and Spiegel, Christoph},
      title = {Another Note on Intervals in the Hales-Jewett Theorem}
    }
  44. Gebhard, O., Hahn-Klimroth, M., Penschuck, M., Rolvien, M., Scarlett, J., Tan, N., and Parczyk, O. (2022). Near Optimal Sparsity-constrained Group Testing: Improved Bounds. IEEE Transactions on Information Theory, 68(5), 3253–3280. DOI: 10.1109/TIT.2022.3141244 [arXiv]
    [BibTeX]
    @article{near_optimal_sparsity_2022,
      year = {2022},
      journal = {IEEE Transactions on Information Theory},
      volume = {68},
      number = {5},
      pages = {3253-3280},
      doi = {10.1109/TIT.2022.3141244},
      archiveprefix = {arXiv},
      eprint = {2004.11860},
      author = {Gebhard, Oliver and Hahn-Klimroth, Max and Penschuck, Manuel and Rolvien, Maurice and Scarlett, Jonathan and Tan, Nelvin and Parczyk, Olaf},
      title = {Near Optimal Sparsity-constrained Group Testing: Improved Bounds}
    }
  45. Nohadani, O., and Sharma, K. (2022). Optimization Under Connected Uncertainty. INFORMS Journal on Optimization. DOI: 10.1287/ijoo.2021.0067
    [BibTeX]
    @article{nk_connected_un_22,
      year = {2022},
      journal = {INFORMS Journal on Optimization},
      doi = {10.1287/ijoo.2021.0067},
      author = {Nohadani, Omid and Sharma, Kartikey},
      title = {Optimization Under Connected Uncertainty}
    }
  46. Böttcher, J., Sgueglia, A., Skokan, J., and Parczyk, O. (2022). Triangles in Randomly Perturbed Graphs. Combinatorics, Probability and Computing, 32(1), 91–121. DOI: 10.1017/S0963548322000153 [arXiv]
    [BibTeX]
    @article{triangles_2022,
      year = {2022},
      journal = {Combinatorics, Probability and Computing},
      volume = {32},
      number = {1},
      pages = {91-121},
      doi = {10.1017/S0963548322000153},
      archiveprefix = {arXiv},
      eprint = {2011.07612},
      author = {Böttcher, Julia and Sgueglia, Amedeo and Skokan, Jozef and Parczyk, Olaf},
      title = {Triangles in Randomly Perturbed Graphs}
    }
  47. Kerdreux, T., d’Aspremont, A., and Pokutta, S. (2022). Restarting Frank-Wolfe: Faster Rates under Hölderian Error Bounds. Journal of Optimization Theory and Applications, 192, 799–829. [PDF] [arXiv] [summary] [slides]
    [BibTeX]
    @article{KDP2018jour,
      arxiv = {http://arxiv.org/abs/1810.02429},
      author = {Kerdreux, T. and d'Aspremont, A. and Pokutta, S.},
      journal = {{Journal of Optimization Theory and Applications}},
      annotate = {doi:10.1007/s10957-021-01989-7},
      pdfurl = {https://dx.doi.org/10.1007/s10957-021-01989-7},
      slides = {https://app.box.com/s/prd32r6xmuef2k4gah23rd0egllz9rv5},
      summary = {http://www.pokutta.com/blog/research/2019/05/02/restartfw-abstract.html},
      title = {{Restarting Frank-Wolfe: Faster Rates under Hölderian Error Bounds}},
      volume = {192},
      pages = {799--829},
      year = {2022}
    }
  48. Faenza, Y., Muñoz, G., and Pokutta, S. (2022). New Limits of Treewidth-based tractability in Optimization. Mathematical Programming A, 191, 559–594. [PDF] [arXiv] [summary]
    [BibTeX]
    @article{FMP2018,
      arxiv = {https://arxiv.org/abs/1807.02551},
      author = {Faenza, Yuri and Mu{\~n}oz, Gonzalo and Pokutta, Sebastian},
      journal = {{Mathematical Programming A}},
      pdfurl = {http://link.springer.com/article/10.1007/s10107-020-01563-5},
      summary = {http://www.pokutta.com/blog/research/2018/09/22/treewidth-abstract.html},
      title = {{New Limits of Treewidth-based tractability in Optimization}},
      volume = {191},
      pages = {559--594},
      year = {2022}
    }
  49. Cao-Labora, G., Rué, J. J., and Spiegel, C. (2021-10). An Erdős-Fuchs Theorem for Ordered Representation Functions. Ramanujan Journal, 56, 183–2091. DOI: 10.1007/s11139-020-00326-2 [URL] [arXiv]
    [BibTeX]
    @article{crs_erdosfuchs_19,
      year = {2021-10},
      journal = {Ramanujan Journal},
      volume = {56},
      pages = {183-2091},
      doi = {10.1007/s11139-020-00326-2},
      url = {https://link.springer.com/article/10.1007/s11139-020-00326-2},
      archiveprefix = {arXiv},
      eprint = {1911.12313},
      primaryclass = {math.NT},
      author = {Cao-Labora, Gonzalo and Rué, Juan José and Spiegel, Christoph},
      title = {An Erdős-Fuchs Theorem for Ordered Representation Functions}
    }
  50. Fabian, D., Rué, J. J., and Spiegel, C. (2021-08). On Strong Infinite Sidon and Bₕ Sets and Random Sets of Integers. Journal of Combinatorial Theory, Series A, 182. DOI: 10.1016/j.jcta.2021.105460 [URL] [arXiv]
    [BibTeX]
    @article{frs_sidon_19,
      year = {2021-08},
      journal = {Journal of Combinatorial Theory, Series A},
      volume = {182},
      doi = {10.1016/j.jcta.2021.105460},
      url = {https://sciencedirect.com/science/article/abs/pii/S0097316521000595},
      archiveprefix = {arXiv},
      eprint = {1911.13275},
      primaryclass = {math.CO},
      author = {Fabian, David and Rué, Juan José and Spiegel, Christoph},
      title = {On Strong Infinite Sidon and Bₕ Sets and Random Sets of Integers}
    }
  51. Combettes, C. W., and Pokutta, S. (2021). Complexity of Linear Minimization and Projection on Some Sets. Operations Research Letters, 49(4). [arXiv] [code]
    [BibTeX]
    @article{CP2021,
      arxiv = {https://arxiv.org/abs/2101.10040},
      author = {Combettes, Cyrille W and Pokutta, Sebastian},
      code = {https://github.com/cyrillewcombettes/complexity},
      journal = {Operations Research Letters},
      month = jul,
      volume = {49},
      number = {4},
      title = {{Complexity of Linear Minimization and Projection on Some Sets}},
      year = {2021}
    }
  52. Kerdreux, T., Roux, C., d’Aspremont, A., and Pokutta, S. (2021). Linear Bandits on Uniformly Convex Sets. Journal of Machine Learning Research, 22(284), 1–23. [URL] [arXiv] [summary]
    [BibTeX]
    @article{KRAP2021,
      year = {2021},
      journal = {Journal of Machine Learning Research},
      month = mar,
      volume = {22},
      number = {284},
      pages = {1–23},
      url = {http://jmlr.org/papers/v22/21-0277.html},
      archiveprefix = {arXiv},
      eprint = {2103.05907},
      primaryclass = {cs.LG},
      author = {Kerdreux, Thomas and Roux, Christophe and d'Aspremont, Alexandre and Pokutta, Sebastian},
      title = {Linear Bandits on Uniformly Convex Sets},
      summary = {https://www.pokutta.com/blog/research/2021/04/03/linearBandits.html}
    }
  53. Hintermüller, M., Stengl, S.-M., and Surowiec, T. (2021). Uncertainty Quantification in Image Segmentation Using the Ambrosio–Tortorelli Approximation of the Mumford–Shah Energy. Journal of Mathematical Imaging and Vision, 63(9), 1095–1117. DOI: 10.1007/s10851-021-01034-2 [URL]
    [BibTeX]
    @article{HintStenglSurowiec_UQMumford_Shah,
      year = {2021},
      journal = {Journal of Mathematical Imaging and Vision},
      volume = {63},
      number = {9},
      pages = {1095--1117},
      doi = {10.1007/s10851-021-01034-2},
      url = {https://link.springer.com/article/10.1007/s10851-021-01034-2},
      author = {Hintermüller, Michael and Stengl, Steven-Marian and Surowiec, Thomas},
      title = {Uncertainty Quantification in Image Segmentation Using the Ambrosio–Tortorelli Approximation of the Mumford–Shah Energy}
    }
  54. Ramin, E., Bestuzheva, K., Gargalo, C., Ramin, D., Schneider, C., Ramin, P., Flores-Alsina, X., Andersen, M., and Gernaey, K. (2021). Incremental Design of Water Symbiosis Networks with Prior Knowledge: the Case of an Industrial Park in Kenya. Science of the Total Environment, 751. DOI: 10.1016/j.scitotenv.2020.141706
    [BibTeX]
    @article{RaminBestuzhevaGargalo2021_IncrementalDesignOfWater,
      year = {2021},
      journal = {Science of the Total Environment},
      volume = {751},
      doi = {10.1016/j.scitotenv.2020.141706},
      author = {Ramin, Elham and Bestuzheva, Ksenia and Gargalo, Carina and Ramin, Danial and Schneider, Carina and Ramin, Pedram and Flores-Alsina, Xavier and Andersen, Maj and Gernaey, Krist},
      title = {Incremental Design of Water Symbiosis Networks with Prior Knowledge: the Case of an Industrial Park in Kenya}
    }
  55. Prause, F., Hoppmann-Baum, K., Defourny, B., and Koch, T. (2021). The Maximum Diversity Assortment Selection Problem. Mathematical Methods of Operations Research, 93. DOI: 10.1007/s00186-021-00740-2
    [BibTeX]
    @article{fkbt_mdas_2021,
      year = {2021},
      journal = {Mathematical Methods of Operations Research},
      volume = {93},
      doi = {10.1007/s00186-021-00740-2},
      author = {Prause, Felix and Hoppmann-Baum, Kai and Defourny, Boris and Koch, Thorsten},
      title = {The Maximum Diversity Assortment Selection Problem}
    }
  56. Gelß, P., Klus, S., Schuster, I., and Schütte, C. (2021). Feature Space Approximation for Kernel-based Supervised Learning. Knowledge-Based Systems, 221, 106935. DOI: 10.1016/j.knosys.2021.106935 [URL] [arXiv]
    [BibTeX]
    @article{gkss_fsa_21,
      year = {2021},
      journal = {Knowledge-Based Systems},
      volume = {221},
      pages = {106935},
      doi = {10.1016/j.knosys.2021.106935},
      url = {https://sciencedirect.com/science/article/abs/pii/S0950705121001982},
      archiveprefix = {arXiv},
      eprint = {2011.12651},
      primaryclass = {stat.ML},
      author = {Gelß, Patrick and Klus, Stefan and Schuster, Ingmar and Schütte, Christof},
      title = {Feature Space Approximation for Kernel-based Supervised Learning}
    }
  57. Combettes, P. L., and Woodstock, Z. (2021). Reconstruction of Functions From Prescribed Proximal Points. Journal of Approximation Theory, 268(105606). DOI: 10.1016/j.jat.2021.105606
    [BibTeX]
    @article{jat21,
      year = {2021},
      journal = {Journal of Approximation Theory},
      volume = {268},
      number = {105606},
      doi = {10.1016/j.jat.2021.105606},
      author = {Combettes, P. L. and Woodstock, Zev},
      title = {Reconstruction of Functions From Prescribed Proximal Points}
    }
  58. Klus, S., Gelß, P., Nüske, F., and Noé, F. (2021). Symmetric and Antisymmetric Kernels for Machine Learning Problems in Quantum Physics and Chemistry. Machine Learning: Science and Technology, 2(4), 18958. DOI: 10.1088/2632-2153/ac14ad [URL] [arXiv]
    [BibTeX]
    @article{kgnn_antisymmetric_21,
      year = {2021},
      journal = {Machine Learning: Science and Technology},
      volume = {2},
      number = {4},
      pages = {18958},
      doi = {10.1088/2632-2153/ac14ad},
      url = {https://iopscience.iop.org/article/10.1088/2632-2153/ac14ad},
      archiveprefix = {arXiv},
      eprint = {2103.17233},
      primaryclass = {quant-ph},
      author = {Klus, Stefan and Gelß, Patrick and Nüske, Feliks and Noé, Frank},
      title = {Symmetric and Antisymmetric Kernels for Machine Learning Problems in Quantum Physics and Chemistry}
    }
  59. Clemens, D., Hamann, F., Mogge, Y., and Parczyk, O. (2021). Maker-Breaker Games on Randomly Perturbed Graphs. SIAM Journal on Discrete Mathematics, 35(4), 2734–2748. DOI: 10.1137/20M1385044 [arXiv]
    [BibTeX]
    @article{maker_breaker_2021,
      year = {2021},
      journal = {SIAM Journal on Discrete Mathematics},
      volume = {35},
      number = {4},
      pages = {2734-2748},
      doi = {10.1137/20M1385044},
      archiveprefix = {arXiv},
      eprint = {2009.14583},
      author = {Clemens, Dennis and Hamann, Fabian and Mogge, Yannick and Parczyk, Olaf},
      title = {Maker-Breaker Games on Randomly Perturbed Graphs}
    }
  60. Nüske, F., Gelß, P., Klus, S., and Clementi, C. (2021). Tensor-based Computation of Metastable and Coherent Sets. Physica D: Nonlinear Phenomena, 427, 133018. DOI: 10.1016/j.physd.2021.133018 [URL] [arXiv]
    [BibTeX]
    @article{ngkc_metastable_2021,
      year = {2021},
      journal = {Physica D: Nonlinear Phenomena},
      volume = {427},
      pages = {133018},
      doi = {10.1016/j.physd.2021.133018},
      url = {https://sciencedirect.com/science/article/abs/pii/S0167278921001755},
      archiveprefix = {arXiv},
      eprint = {1908.04741},
      primaryclass = {math.NA},
      author = {Nüske, Feliks and Gelß, Patrick and Klus, Stefan and Clementi, Cecilia},
      title = {Tensor-based Computation of Metastable and Coherent Sets}
    }
  61. Hahn-Klimroth, M., Maesaka, G. S., Mogge, Y., Mohr, S., and Parczyk, O. (2021). Random Perturbation of Sparse Graphs. The Electronic Journal of Combinatorics, 28(2), P2.26. DOI: 10.37236/9510 [arXiv]
    [BibTeX]
    @article{random_perturbation_sparse_graphs_2021,
      year = {2021},
      journal = {The Electronic Journal of Combinatorics},
      volume = {28},
      number = {2},
      pages = {P2.26},
      doi = {10.37236/9510},
      archiveprefix = {arXiv},
      eprint = {2004.04672},
      author = {Hahn-Klimroth, Max and Maesaka, Giulia S. and Mogge, Yannick and Mohr, Samuel and Parczyk, Olaf},
      title = {Random Perturbation of Sparse Graphs}
    }
  62. Han, J., Kohayakawa, Y., Letzter, S., Mota, G. O., and Parczyk, O. (2021). The Size-Ramsey Number of 3-uniform Tight Paths. Advances in Combinatorics, 5, 12pp. DOI: 10.19086/aic.24581 [arXiv]
    [BibTeX]
    @article{size_ramsey_number_3_2021,
      year = {2021},
      journal = {Advances in Combinatorics},
      volume = {5},
      pages = {12pp},
      doi = {10.19086/aic.24581},
      archiveprefix = {arXiv},
      eprint = {1907.08086},
      author = {Han, Jie and Kohayakawa, Yoshiharu and Letzter, Shoham and Mota, Guilherme O. and Parczyk, Olaf},
      title = {The Size-Ramsey Number of 3-uniform Tight Paths}
    }
  63. Berger, S., Kohayakawa, Y., Maesaka, G. S., Martins, T., Mendonça, W., Mota, G. O., and Parczyk, O. (2021). The Size-Ramsey Number of Powers of Bounded Degree Trees. Journal of the London Mathematical Society, 103(4), 1314–1332. DOI: 10.1112/jlms.12408 [arXiv]
    [BibTeX]
    @article{size_ramsey_trees_2019,
      year = {2021},
      journal = {Journal of the London Mathematical Society},
      volume = {103},
      number = {4},
      pages = {1314-1332},
      doi = {10.1112/jlms.12408},
      archiveprefix = {arXiv},
      eprint = {1907.03466},
      author = {Berger, Sören and Kohayakawa, Yoshiharu and Maesaka, Giulia S. and Martins, Taísa and Mendonça, Walner and Mota, Guilherme O. and Parczyk, Olaf},
      title = {The Size-Ramsey Number of Powers of Bounded Degree Trees}
    }
  64. Allen, P., Koch, C., Person, Y., and Parczyk, O. (2021). Finding Tight Hamilton Cycles in Random Hypergraphs Faster. Combinatorics, Probability and Computing, 30(2), 239–257. DOI: 10.1017/S0963548320000450 [arXiv]
    [BibTeX]
    @article{tight_hamilton_cycles_2021,
      year = {2021},
      journal = {Combinatorics, Probability and Computing},
      volume = {30},
      number = {2},
      pages = {239-257},
      doi = {10.1017/S0963548320000450},
      archiveprefix = {arXiv},
      eprint = {1710.08988},
      author = {Allen, Peter and Koch, Christoph and Person, Yury and Parczyk, Olaf},
      title = {Finding Tight Hamilton Cycles in Random Hypergraphs Faster}
    }
  65. Ziemke, T., Sering, L., Vargas Koch, L., Zimmer, M., Nagel, K., and Skutella, M. (2021). Flows Over Time As Continuous Limits of Packet-based Network Simulations. Transportation Research Procedia, 52, 123–130. DOI: 10.1016/j.trpro.2021.01.014 [URL]
    [BibTeX]
    @article{zskzns_flows_21,
      year = {2021},
      journal = {Transportation Research Procedia},
      volume = {52},
      pages = {123-130},
      doi = {10.1016/j.trpro.2021.01.014},
      url = {https://sciencedirect.com/science/article/pii/S2352146521000284},
      author = {Ziemke, Theresa and Sering, Leon and Vargas Koch, Laura and Zimmer, Max and Nagel, Kai and Skutella, Martin},
      title = {Flows Over Time As Continuous Limits of Packet-based Network Simulations}
    }
  66. Anari, N., Haghtalab, N., Naor, S., Pokutta, S., Singh, M., and Torrico, A. (2021). Structured Robust Submodular Maximization: Offline and Online Algorithms. INFORMS Journal on Computing, 33(4), 1259–1684. [PDF] [arXiv]
    [BibTeX]
    @article{submodular2017jour,
      arxiv = {https://arxiv.org/abs/1710.04740},
      author = {Anari, N. and Haghtalab, N. and Naor, S. and Pokutta, S. and Singh, M. and Torrico, A.},
      journal = {{INFORMS Journal on Computing}},
      pdfurl = {https://pubsonline.informs.org/doi/abs/10.1287/ijoc.2020.0998},
      title = {{Structured Robust Submodular Maximization: Offline and Online Algorithms}},
      volume = {33},
      issue = {4},
      pages = {1259--1684},
      year = {2021}
    }
  67. Corsten, J., Mond, A., Pokrovskiy, A., Spiegel, C., and Szabó, T. (2020-10). On the Odd Cycle Game and Connected Rules. European Journal of Combinatorics, 89. DOI: 10.1016/j.ejc.2020.103140 [URL] [arXiv]
    [BibTeX]
    @article{cmpss_oddcyclegame_19,
      year = {2020-10},
      journal = {European Journal of Combinatorics},
      volume = {89},
      doi = {10.1016/j.ejc.2020.103140},
      url = {https://sciencedirect.com/science/article/abs/pii/S0195669820300615},
      archiveprefix = {arXiv},
      eprint = {1906.04024},
      primaryclass = {math.CO},
      author = {Corsten, Jan and Mond, Adva and Pokrovskiy, Alexey and Spiegel, Christoph and Szabó, Tibor},
      title = {On the Odd Cycle Game and Connected Rules}
    }
  68. Böttcher, J., Montgomery, R., Parczyk, O., and Person, Y. (2020). Embedding Spanning Bounded Degree Graphs in Randomly Perturbed Graphs. Mathematika, 66(2), 422–447. DOI: 10.1112/mtk.12005 [URL] [arXiv]
    [BibTeX]
    @article{bmpp_spanning_perturbed,
      year = {2020},
      journal = {Mathematika},
      volume = {66},
      number = {2},
      pages = {422-447},
      doi = {10.1112/mtk.12005},
      url = {https://londmathsoc.onlinelibrary.wiley.com/doi/abs/10.1112/mtk.12005},
      archiveprefix = {arXiv},
      eprint = {1802.04603},
      primaryclass = {math.CO},
      author = {Böttcher, Julia and Montgomery, Richard and Parczyk, Olaf and Person, Yury},
      title = {Embedding Spanning Bounded Degree Graphs in Randomly Perturbed Graphs}
    }
  69. Candela, P., Serra, O., and Spiegel, C. (2020). A Step Beyond Freĭman’s Theorem for Set Addition Modulo a Prime. Journal De Théorie Des Nombres De Bordeaux, 32(1), 275–289. DOI: 10.5802/jtnb.1122 [URL] [arXiv]
    [BibTeX]
    @article{css_freiman_18,
      year = {2020},
      journal = {Journal de Théorie des Nombres de Bordeaux},
      volume = {32},
      number = {1},
      pages = {275-289},
      doi = {10.5802/jtnb.1122},
      url = {https://jtnb.centre-mersenne.org/item/JTNB_2020__32_1_275_0/},
      archiveprefix = {arXiv},
      eprint = {1805.12374},
      primaryclass = {math.CO},
      author = {Candela, Pablo and Serra, Oriol and Spiegel, Christoph},
      title = {A Step Beyond Freĭman's Theorem for Set Addition Modulo a Prime}
    }
  70. Parczyk, O. (2020). 2-universality in Randomly Perturbed Graphs. European Journal of Combinatorics, 87, 103–118. DOI: 10.1016/j.ejc.2020.103118 [arXiv]
    [BibTeX]
    @article{perturbed_2-universality,
      year = {2020},
      journal = {European Journal of Combinatorics},
      volume = {87},
      pages = {103-118},
      doi = {10.1016/j.ejc.2020.103118},
      archiveprefix = {arXiv},
      eprint = {1902.01823},
      author = {Parczyk, Olaf},
      title = {2-universality in Randomly Perturbed Graphs}
    }
  71. Rué, J. J., and Spiegel, C. (2020). On a Problem of Sárközy and Sós for Multivariate Linear Forms. Revista Matemática Iberoamericana, 36(7), 2107–2119. DOI: 10.4171/RMI/1193 [URL] [arXiv]
    [BibTeX]
    @article{rs_sarkozysos_18,
      year = {2020},
      journal = {Revista Matemática Iberoamericana},
      volume = {36},
      number = {7},
      pages = {2107-2119},
      doi = {10.4171/RMI/1193},
      url = {https://ems.press/journals/rmi/articles/16818},
      archiveprefix = {arXiv},
      eprint = {1802.07597},
      primaryclass = {math.CO},
      author = {Rué, Juan José and Spiegel, Christoph},
      title = {On a Problem of Sárközy and Sós for Multivariate Linear Forms}
    }
  72. Parczyk, O., Elizer, O. B., Hefetz, D., Kronenberg, G., Shikelman, C., and Stojaković, M. (2020). Semi-random Graph Process. Random Structures & Algorithms, 56(3), 648–675. DOI: 10.1002/rsa.20887 [arXiv]
    [BibTeX]
    @article{semi-random,
      year = {2020},
      journal = {Random Structures & Algorithms},
      volume = {56},
      number = {3},
      pages = {648-675},
      doi = {10.1002/rsa.20887},
      archiveprefix = {arXiv},
      eprint = {1805.02259},
      author = {Parczyk, Olaf and Elizer, Omri Ben and Hefetz, Dan and Kronenberg, Gal and Shikelman, Clara and Stojaković, Miloš},
      title = {Semi-random Graph Process}
    }
  73. Kusch, C., Rué, J. J., Spiegel, C., and Szabó, T. (2019-09). On the Optimality of the Uniform Random Strategy. Random Structures & Algorithms, 55(2), 371–401. DOI: 10.1002/rsa.20829 [URL] [arXiv]
    [BibTeX]
    @article{krss_randomstrategy_17,
      year = {2019-09},
      journal = {Random Structures & Algorithms},
      volume = {55},
      number = {2},
      pages = {371-401},
      doi = {10.1002/rsa.20829},
      url = {https://onlinelibrary.wiley.com/doi/abs/10.1002/rsa.20829},
      archiveprefix = {arXiv},
      eprint = {1711.07251},
      primaryclass = {math.CO},
      author = {Kusch, Christopher and Rué, Juan José and Spiegel, Christoph and Szabó, Tibor},
      title = {On the Optimality of the Uniform Random Strategy}
    }
  74. Braun, G., Pokutta, S., and Zink, D. (2019). Affine Reductions for LPs and SDPs. Mathematical Programming, 173, 281–312. DOI: 10.1007/s10107-017-1221-9 [arXiv]
    [BibTeX]
    @article{Braun2015LP-SDP,
      year = {2019},
      journal = {Mathematical Programming},
      volume = {173},
      pages = {281–312},
      doi = {10.1007/s10107-017-1221-9},
      archiveprefix = {arXiv},
      eprint = {1410.8816},
      primaryclass = {cs.CC},
      author = {Braun, Gábor and Pokutta, Sebastian and Zink, Daniel},
      title = {Affine Reductions for LPs and SDPs}
    }
  75. Braun, G., Pokutta, S., and Zink, D. (2019). Lazifying Conditional Gradient Algorithms. The Journal of Machine Learning Research, 20(71), 1–42. [URL] [arXiv]
    [BibTeX]
    @article{Braun2017lazyCG,
      year = {2019},
      journal = {The Journal of Machine Learning Research},
      volume = {20},
      number = {71},
      pages = {1–42},
      url = {https://jmlr.org/papers/v20/18-114.html},
      archiveprefix = {arXiv},
      eprint = {1610.05120},
      primaryclass = {cs.DS},
      author = {Braun, Gábor and Pokutta, Sebastian and Zink, Daniel},
      title = {Lazifying Conditional Gradient Algorithms}
    }
  76. Freĭman, G. A., Serra, O., and Spiegel, C. (2019). Additive Volume of Sets Contained in Few Arithmetic Progressions. INTEGERS, 19. [URL] [arXiv]
    [BibTeX]
    @article{fss_additivevolume_18,
      year = {2019},
      journal = {INTEGERS},
      volume = {19},
      url = {https://math.colgate.edu/~integers/t34/t34.mail.html},
      archiveprefix = {arXiv},
      eprint = {1808.08455},
      primaryclass = {math.NT},
      author = {Freĭman, Gregory A. and Serra, Oriol and Spiegel, Christoph},
      title = {Additive Volume of Sets Contained in Few Arithmetic Progressions}
    }
  77. Gelß, P., Klus, S., Eisert, J., and Schütte, C. (2019). Multidimensional Approximation of Nonlinear Dynamical Systems. Journal of Computational and Nonlinear Dynamics, 14(6), 25094. DOI: 10.1115/1.4043148 [URL] [arXiv]
    [BibTeX]
    @article{gkes_mandy_19,
      year = {2019},
      journal = {Journal of Computational and Nonlinear Dynamics},
      volume = {14},
      number = {6},
      pages = {25094},
      doi = {10.1115/1.4043148},
      url = {https://asmedigitalcollection.asme.org/computationalnonlinear/article-abstract/14/6/061006/726935/Multidimensional-Approximation-of-Nonlinear},
      archiveprefix = {arXiv},
      eprint = {1809.02448},
      primaryclass = {math.DS},
      author = {Gelß, Patrick and Klus, Stefan and Eisert, Jens and Schütte, Christof},
      title = {Multidimensional Approximation of Nonlinear Dynamical Systems}
    }
  78. Klus, S., and Gelß, P. (2019). Tensor-based Algorithms for Image Classification. Algorithms, 12(11), 240. DOI: 10.3390/a12110240 [URL] [arXiv]
    [BibTeX]
    @article{kg_imageclass_19,
      year = {2019},
      journal = {Algorithms},
      volume = {12},
      number = {11},
      pages = {240},
      doi = {10.3390/a12110240},
      url = {https://mdpi.com/1999-4893/12/11/240},
      archiveprefix = {arXiv},
      eprint = {1910.02150},
      primaryclass = {cs.LG},
      author = {Klus, Stefan and Gelß, Patrick},
      title = {Tensor-based Algorithms for Image Classification}
    }
  79. Böttcher, J., Montgomery, R., Person, Y., Parczyk, O., Han, J., and Kohayakawa, Y. (2019). Universality of Bounded Degree Spanning Trees in Randomly Perturbed Graphs. Random Structures & Algorithms, 55(4), 854–864. DOI: 10.1002/rsa.20850 [arXiv]
    [BibTeX]
    @article{perturbed_universality,
      year = {2019},
      journal = {Random Structures & Algorithms},
      volume = {55},
      number = {4},
      pages = {854-864},
      doi = {10.1002/rsa.20850},
      archiveprefix = {arXiv},
      eprint = {1802.04707},
      author = {Böttcher, Julia and Montgomery, Richard and Person, Yury and Parczyk, Olaf and Han, Jie and Kohayakawa, Yoshiharu},
      title = {Universality of Bounded Degree Spanning Trees in Randomly Perturbed Graphs}
    }
  80. Bazzi, A., Fiorini, S., Pokutta, S., and Svensson, O. (2019). Small linear programs cannot approximate Vertex volume = 44, Issue = 1, pages = 1–375, Cover within a factor of 2 - ε. To Appear in Mathematics of Operations Research. [arXiv] [slides]
    [BibTeX]
    @article{BFPS2015jour,
      arxiv = {http://arxiv.org/abs/1503.00753},
      author = {Bazzi, A. and Fiorini, S. and Pokutta, S. and Svensson, O.},
      journal = {{to appear in Mathematics of Operations Research}},
      slides = {https://app.box.com/s/00aqupo722bbpmdcyzwt8xmfqzyu14iy},
      title = {{Small linear programs cannot approximate Vertex
              volume = {44},
              Issue = {1},
              pages = {1--375},
                        Cover within a factor of {$2 - \epsilon$}}},
      year = {2019}
    }
  81. Braun, G., Pokutta, S., and Roy, A. (2018). Strong Reductions for Extended Formulations. Mathematical Programming, 172, 591–620. DOI: 10.1007/s10107-018-1316-y [arXiv]
    [BibTeX]
    @article{BPR2015,
      year = {2018},
      journal = {Mathematical Programming},
      month = nov,
      volume = {172},
      pages = {591–620},
      doi = {10.1007/s10107-018-1316-y},
      archiveprefix = {arXiv},
      eprint = {1512.04932},
      primaryclass = {cs.CC},
      author = {Braun, Gábor and Pokutta, Sebastian and Roy, Aurko},
      title = {Strong Reductions for Extended Formulations}
    }
  82. Rué, J. J., Spiegel, C., and Zumalacárregui, A. (2018). Threshold Functions and Poisson Convergence for Systems of Equations in Random Sets. Mathematische Zeitschrift, 288, 333–360. DOI: 10.1007/s00209-017-1891-2 [URL] [arXiv]
    [BibTeX]
    @article{rsz_threshold_12,
      year = {2018},
      journal = {Mathematische Zeitschrift},
      month = feb,
      volume = {288},
      pages = {333-360},
      doi = {10.1007/s00209-017-1891-2},
      url = {https://link.springer.com/article/10.1007/s00209-017-1891-2},
      archiveprefix = {arXiv},
      eprint = {1212.5496},
      primaryclass = {math.CO},
      author = {Rué, Juan José and Spiegel, Christoph and Zumalacárregui, Ana},
      title = {Threshold Functions and Poisson Convergence for Systems of Equations in Random Sets}
    }
  83. Song, R., Xie, Y., and Pokutta, S. (2018). On the effect of model mismatch for sequential Info-Greedy Sensing. EURASIP Journal on Advances in Signal Processing. [PDF]
    [BibTeX]
    @article{sxp2018,
      author = {Song, R. and Xie, Y. and Pokutta, S.},
      journal = {{EURASIP Journal on Advances in Signal Processing}},
      pdfurl = {https://asp-eurasipjournals.springeropen.com/articles/10.1186/s13634-018-0551-y},
      title = {{On the effect of model mismatch for sequential Info-Greedy Sensing}},
      year = {2018}
    }
  84. Le Bodic, P., Pfetsch, M., Pavelka, J., and Pokutta, S. (2018). Solving MIPs via Scaling-based Augmentation. Discrete Optimization, 27, 1–25. [PDF] [arXiv]
    [BibTeX]
    @article{BPPP2015,
      annote = {doi: 10.1016/j.disopt.2017.08.004
      },
      arxiv = {http://arxiv.org/abs/1509.03206},
      author = {Le~Bodic, P. and Pfetsch, M. and Pavelka, J. and Pokutta, S.},
      journal = {{Discrete Optimization}},
      pages = {1--25},
      pdfurl = {http://dx.doi.org/10.1016/j.disopt.2017.08.004},
      title = {{Solving MIPs via Scaling-based Augmentation}},
      volume = {27},
      year = {2018}
    }
  85. Christensen, H., Khan, A., Pokutta, S., and Tetali, P. (2017+). Multidimensional Bin Packing and Other Related Problems: A survey. To Appear in Computer Science Review. [URL]
    [BibTeX]
    @article{CKPT2015,
      author = {Christensen, H. and Khan, A. and Pokutta, S. and Tetali, P.},
      journal = {{to appear in Computer Science Review}},
      url = {http://www.sciencedirect.com/science/article/pii/S1574013716301356},
      title = {{Multidimensional Bin Packing and Other Related Problems: A survey}},
      year = {2017+}
    }
  86. Knueven, B., Ostrowski, J., and Pokutta, S. (2017+). Detecting Almost Symmetries in Graphs. To Appear in Mathematical Programming C. [PDF] [arXiv]
    [BibTeX]
    @article{KOP2015,
      arxiv = {http://www.optimization-online.org/DB_HTML/2015/09/5117.html},
      author = {Knueven, B. and Ostrowski, J. and Pokutta, S.},
      journal = {{to appear in Mathematical Programming C}},
      pdfurl = {http://link.springer.com/article/10.1007/s12532-017-0124-3},
      title = {{Detecting Almost Symmetries in Graphs}},
      year = {2017+}
    }
  87. Braun, G., Brown-Cohen, J., Huq, A., Pokutta, S., Raghavendra, P., Roy, A., Weitz, B., and Zink, D. (2017). The Matching Problem Has No Small Symmetric SDP. Mathematical Programming, 165, 643–662. DOI: 10.1007/s10107-016-1098-z [arXiv]
    [BibTeX]
    @article{Braun2016matching-symmetricSDP,
      year = {2017},
      journal = {Mathematical Programming},
      month = oct,
      volume = {165},
      pages = {643–662},
      doi = {10.1007/s10107-016-1098-z},
      archiveprefix = {arXiv},
      eprint = {1504.00703},
      primaryclass = {cs.CC},
      author = {Braun, Gábor and Brown-Cohen, Jonah and Huq, Arefin and Pokutta, Sebastian and Raghavendra, Prasad and Roy, Aurko and Weitz, Benjamin and Zink, Daniel},
      title = {The Matching Problem Has No Small Symmetric SDP}
    }
  88. Braun, G., Guzmán, C., and Pokutta, S. (2017). Unifying Lower Bounds on the Oracle Complexity of Nonsmooth Convex Optimization. IEEE Transactions on Information Theory, 63(7), 4709–4724. DOI: 10.1109/TIT.2017.2701343 [arXiv]
    [BibTeX]
    @article{Braun2013lowerCO,
      year = {2017},
      journal = {IEEE Transactions on Information Theory},
      month = jul,
      volume = {63},
      number = {7},
      pages = {4709-4724},
      doi = {10.1109/TIT.2017.2701343},
      archiveprefix = {arXiv},
      eprint = {1407.5144},
      primaryclass = {math.OC},
      author = {Braun, Gábor and Guzmán, Cristóbal and Pokutta, Sebastian},
      title = {Unifying Lower Bounds on the Oracle Complexity of Nonsmooth Convex Optimization}
    }
  89. Braun, G., Jain, R., Lee, T., and Pokutta, S. (2017). Information-theoretic Approximations of the Nonnegative Rank. Computational Complexity, 26, 147–197. DOI: 10.1007/s00037-016-0125-z [URL]
    [BibTeX]
    @article{Braun2017info-nonnegative-rank,
      year = {2017},
      journal = {Computational Complexity},
      volume = {26},
      pages = {147–197},
      doi = {10.1007/s00037-016-0125-z},
      url = {https://eccc.weizmann.ac.il/report/2013/158},
      author = {Braun, Gábor and Jain, Rahul and Lee, Troy and Pokutta, Sebastian},
      title = {Information-theoretic Approximations of the Nonnegative Rank}
    }
  90. Gelß, P., Klus, S., Matera, S., and Schütte, C. (2017). Nearest-neighbor Interaction Systems in the Tensor-train Format. Journal of Computational Physics, 341, 140–162. DOI: 10.1016/j.jcp.2017.04.007 [URL] [arXiv]
    [BibTeX]
    @article{gkms_slim_17,
      year = {2017},
      journal = {Journal of Computational Physics},
      volume = {341},
      pages = {140-162},
      doi = {10.1016/j.jcp.2017.04.007},
      url = {https://sciencedirect.com/science/article/abs/pii/S0021999117302784},
      archiveprefix = {arXiv},
      eprint = {1611.03755},
      primaryclass = {math.NA},
      author = {Gelß, Patrick and Klus, Stefan and Matera, Sebastian and Schütte, Christof},
      title = {Nearest-neighbor Interaction Systems in the Tensor-train Format}
    }
  91. Klus, S., Gelß, P., Peitz, S., and Schütte, C. (2017). Tensor-based Dynamic Mode Decomposition. Nonlinearity, 31(7), 3359. DOI: 10.1088/1361-6544/aabc8f [URL] [arXiv]
    [BibTeX]
    @article{kgps_dmd_17,
      year = {2017},
      journal = {Nonlinearity},
      volume = {31},
      number = {7},
      pages = {3359},
      doi = {10.1088/1361-6544/aabc8f},
      url = {https://iopscience.iop.org/article/10.1088/1361-6544/aabc8f},
      archiveprefix = {arXiv},
      eprint = {1606.06625},
      primaryclass = {math.NA},
      author = {Klus, Stefan and Gelß, Patrick and Peitz, Sebastian and Schütte, Christof},
      title = {Tensor-based Dynamic Mode Decomposition}
    }
  92. Lienkaemper, C., Shiu, A., and Woodstock, Z. (2017). Obstructions to Convexity in Neural Codes. Advances in Applied Mathematics, 85, 31–59. DOI: 10.1016/j.aam.2016.11.006
    [BibTeX]
    @article{neuralcodes17,
      year = {2017},
      journal = {Advances in Applied Mathematics},
      volume = {85},
      pages = {31--59},
      doi = {10.1016/j.aam.2016.11.006},
      author = {Lienkaemper, Caitlin and Shiu, Anne and Woodstock, Zev},
      title = {Obstructions to Convexity in Neural Codes}
    }
  93. Spiegel, C. (2017). A Note on Sparse Supersaturation and Extremal Results for Linear Homogeneous Systems. Electronic Journal of Combinatorics, 24(3). DOI: 10.37236/6730 [URL] [arXiv]
    [BibTeX]
    @article{spiegel_supersaturation_17,
      year = {2017},
      journal = {Electronic Journal of Combinatorics},
      volume = {24},
      number = {3},
      doi = {10.37236/6730},
      url = {https://combinatorics.org/ojs/index.php/eljc/article/view/v24i3p38},
      archiveprefix = {arXiv},
      eprint = {1701.01631},
      primaryclass = {math.CO},
      author = {Spiegel, Christoph},
      title = {A Note on Sparse Supersaturation and Extremal Results for Linear Homogeneous Systems}
    }
  94. Roy, A., and Pokutta, S. (2017). Hierarchical Clustering via Spreading Metrics. Journal of Machine Learning Research (JMLR), 18, 1–35. [URL] [arXiv]
    [BibTeX]
    @article{AP2016jour,
      annote = {https://papers.nips.cc/paper/by-source-2016-1199
      },
      arxiv = {https://arxiv.org/abs/1610.09269},
      author = {Roy, Aurko and Pokutta, Sebastian},
      journal = {{Journal of Machine Learning Research (JMLR)}},
      pages = {1--35},
      url = {http://jmlr.org/papers/v18/17-081.html},
      title = {{Hierarchical Clustering via Spreading Metrics}},
      volume = {18},
      year = {2017}
    }
  95. Bodur, M., Del Pia, A., Dey, S. S., Molinaro, M., and Pokutta, S. (2017). Aggregation-based cutting-planes for packing and covering Integer Programs. To Appear in Mathematical Programming A. DOI: 10.1007/s10107-017-1192-x [arXiv]
    [BibTeX]
    @article{BDDMP2016,
      doi = {10.1007/s10107-017-1192-x},
      arxiv = {http://arxiv.org/abs/1606.08951},
      author = {Bodur, Merve and Del~Pia, Alberto and Dey, Santanu~Sabush and Molinaro, Marco and Pokutta, Sebastian},
      journal = {to appear in Mathematical Programming A},
      title = {{Aggregation-based cutting-planes for packing and covering Integer Programs}},
      year = {2017}
    }
  96. Martin, A., Müller, J., Pape, S., Peter, A., Pokutta, S., and Winter, T. (2017). Pricing and clearing combinatorial markets with singleton and swap orders. Mathematical Methods of Operations Research, 85(2), 155–177. [arXiv]
    [BibTeX]
    @article{futMar2014,
      arxiv = {http://arxiv.org/abs/1404.6546},
      author = {Martin, Alexander and M{\"u}ller, J. and Pape, S. and Peter, A. and Pokutta, Sebastian and Winter, T.},
      journal = {{Mathematical Methods of Operations Research}},
      number = {2},
      pages = {155--177},
      title = {{Pricing and clearing combinatorial markets with singleton and swap orders}},
      volume = {85},
      year = {2017}
    }
  97. Gatzert, N., Pokutta, S., and 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]
    [BibTeX]
    @article{gpv2013,
      arxiv = {http://papers.ssrn.com/sol3/papers.cfm?abstract_id=2320370},
      author = {Gatzert, Nadine and Pokutta, Sebastian and Vogl, Nikolai},
      journal = {to appear in Journal of Risk and Insurance},
      title = {{Convergence of Capital and Insurance Markets: Pricing Aspects of Index-Linked Catastrophic Loss Instruments}},
      special = {{Best paper award at European Group of Risk and Insurance Economists Annual Meeting 2014 for conference version}},
      year = {2016+}
    }
  98. Braun, G., Firorini, S., and Pokutta, S. (2016). Average Case Polyhedral Complexity of the Maximum Stable Set Problem. Mathematical Programming, 160(1), 407–431. DOI: 10.1007/s10107-016-0989-3 [arXiv]
    [BibTeX]
    @article{Braun2013stable,
      year = {2016},
      journal = {Mathematical Programming},
      month = mar,
      volume = {160},
      number = {1},
      pages = {407–431},
      doi = {10.1007/s10107-016-0989-3},
      archiveprefix = {arXiv},
      eprint = {1311.4001},
      primaryclass = {cs.CC},
      author = {Braun, Gábor and Firorini, Samuel and Pokutta, Sebastian},
      title = {Average Case Polyhedral Complexity of the Maximum Stable Set Problem}
    }
  99. Braun, G., and Pokutta, S. (2016). Common Information and Unique Disjointness. Algorithmica, 76(3), 597–629. DOI: 10.1007/s00453-016-0132-0 [URL]
    [BibTeX]
    @article{Braun2013info-disjoint,
      year = {2016},
      journal = {Algorithmica},
      month = feb,
      volume = {76},
      number = {3},
      pages = {597–629},
      doi = {10.1007/s00453-016-0132-0},
      url = {https://eccc.weizmann.ac.il/report/2013/056},
      author = {Braun, Gábor and Pokutta, Sebastian},
      title = {Common Information and Unique Disjointness}
    }
  100. Braun, G., and Strüngmann, L. (2016). Examples of Non-dual Subgroups of the Baer–Specker Group. Houston Journal of Mathematics, 42(3), 723–739.
    [BibTeX]
    @article{BG-dual2014,
      year = {2016},
      journal = {Houston Journal of Mathematics},
      volume = {42},
      number = {3},
      pages = {723–739},
      author = {Braun, Gábor and Strüngmann, Lutz},
      title = {Examples of Non-dual Subgroups of the Baer–Specker Group}
    }
  101. Braun, G., and Pokutta, S. (2016). A Polyhedral Characterization of Border Bases. SIAM Journal on Discrete Mathematics, 30(1), 239–265. DOI: 10.1137/140977990 [arXiv]
    [BibTeX]
    @article{Braun2009borderbaseis,
      year = {2016},
      journal = {SIAM Journal on Discrete Mathematics},
      volume = {30},
      number = {1},
      pages = {239–265},
      doi = {10.1137/140977990},
      archiveprefix = {arXiv},
      eprint = {0912.1502},
      primaryclass = {math.AC},
      author = {Braun, Gábor and Pokutta, Sebastian},
      title = {A Polyhedral Characterization of Border Bases}
    }
  102. Félix, B., Shiu, A., and Woodstock, Z. (2016). Analyzing Multistationarity in Chemical Reaction Networks Using the Determinant Optimization Method. Applied Mathematics and Computation, 287–288, 60–73. DOI: 10.1016/j.amc.2016.04.030
    [BibTeX]
    @article{detopt16,
      year = {2016},
      journal = {Applied Mathematics and Computation},
      volume = {287--288},
      pages = {60--73},
      doi = {10.1016/j.amc.2016.04.030},
      author = {Félix, Bryan and Shiu, Anne and Woodstock, Zev},
      title = {Analyzing Multistationarity in Chemical Reaction Networks Using the Determinant Optimization Method}
    }
  103. Gelß, P., Matera, S., and Schütte, C. (2016). Solving the Master Equation without Kinetic Monte Carlo - Tensor Train Approximations for a CO Oxidation Model. Journal of Computational Physics, 314, 489–502. DOI: 10.1016/j.jcp.2016.03.025 [URL]
    [BibTeX]
    @article{gms_oxidation_16,
      year = {2016},
      journal = {Journal of Computational Physics},
      volume = {314},
      pages = {489-502},
      doi = {10.1016/j.jcp.2016.03.025},
      url = {https://sciencedirect.com/science/article/abs/pii/S0021999116001777},
      author = {Gelß, Patrick and Matera, Sebastian and Schütte, Christof},
      title = {Solving the Master Equation without Kinetic Monte Carlo - Tensor Train Approximations for a CO Oxidation Model}
    }
  104. Mossner, M., Jann, J.-C., Wittig, J., Nolte, F., Fey, S., Nowak, V., Obländer, J., Pressler, J., Palme, I., Xanthopoulos, C., Boch, T., Metzgeroth, G., Röhl, H., Witt, S. H., Dukal, H., Klein, C., Schmitt, S., Gelß, P., Platzbecker, U., … Nowak, D. (2016). Mutational Hierarchies in Myelodysplastic Syndromes Dynamically Adapt and Evolve Upon Therapy Response and Failure. Blood, 128(9), 1246–1259. DOI: 10.1182/blood-2015-11-679167 [URL]
    [BibTeX]
    @article{mjgmn_mutational_16,
      year = {2016},
      journal = {Blood},
      volume = {128},
      number = {9},
      pages = {1246-1259},
      doi = {10.1182/blood-2015-11-679167},
      url = {https://ashpublications.org/blood/article/128/9/1246/35782/Mutational-hierarchies-in-myelodysplastic},
      author = {Mossner, Maximilian and Jann, Johann-Christoph and Wittig, Janina and Nolte, Florian and Fey, Stephanie and Nowak, Verena and Obländer, Julia and Pressler, Jovita and Palme, Iris and Xanthopoulos, Christina and Boch, Tobias and Metzgeroth, Georgia# and Röhl, Henning and Witt, Stephanie H. and Dukal, Helene and Klein, Corinna and Schmitt, Steffen and Gelß, Patrick and Platzbecker, Uwe and Balaian, Ekaterina and Fabarius, Alice and Blum, Helmut and Schulze, Torsten J. and Meggendorfer, Manja and Haferlach, Claudia and Trumpp, Andreas and Hofmann, Wolf-Karsten and Medyouf, Hind and Nowak, Daniel},
      title = {Mutational Hierarchies in Myelodysplastic Syndromes Dynamically Adapt and Evolve Upon Therapy Response and Failure}
    }
  105. Person, Y., and Parczyk, O. (2016). Spanning Structures and Universality in Sparse Hypergraphs. Random Structures & Algorithms, 49(4), 819–844. DOI: 10.1002/rsa.20690 [arXiv]
    [BibTeX]
    @article{spanning_structures_universality_2016,
      year = {2016},
      journal = {Random Structures & Algorithms},
      volume = {49},
      number = {4},
      pages = {819-844},
      doi = {10.1002/rsa.20690},
      archiveprefix = {arXiv},
      eprint = {1504.02243},
      author = {Person, Yury and Parczyk, Olaf},
      title = {Spanning Structures and Universality in Sparse Hypergraphs}
    }
  106. Hetterich, S., Person, Y., and Parczyk, O. (2016). On Universal Hypergraphs. The Electronic Journal of Combinatorics, 23(4), P4.28. DOI: 10.37236/5562 [arXiv]
    [BibTeX]
    @article{universal_hypergraphs_2016,
      year = {2016},
      journal = {The Electronic Journal of Combinatorics},
      volume = {23},
      number = {4},
      pages = {P4.28},
      doi = {10.37236/5562},
      archiveprefix = {arXiv},
      eprint = {1509.03983},
      author = {Hetterich, Samuel and Person, Yury and Parczyk, Olaf},
      title = {On Universal Hypergraphs}
    }
  107. Bärmann, A., Heidt, A., Martin, A., Pokutta, S., and 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]
    [BibTeX]
    @article{robopt2014,
      annote = {http://link.springer.com/article/10.1007/s10287-015-0243-0
      
      DOI:10.1007/s10287-015-0243-0},
      arxiv = {http://www.optimization-online.org/DB_HTML/2014/02/4245.html},
      author = {B{\"a}rmann, Andreas and Heidt, Andreas and Martin, Alexander and Pokutta, Sebastian and Thurner, Christoph},
      journal = {{Computational Management Science}},
      number = {2},
      pages = {151--193},
      pdfurl = {http://link.springer.com/article/10.1007/s10287-015-0243-0},
      title = {{Polyhedral Approximation of Ellipsoidal Uncertainty Sets via Extended Formulations - a computational case study}},
      volume = {13},
      year = {2016}
    }
  108. Braun, G., Firorini, S., Pokutta, S., and Steurer, D. (2015). Approximation Limits of Linear Programs (beyond Hierarchies). Mathematics of Operations Research, 40(3), 756–772. DOI: 10.1287/moor.2014.0694 [arXiv]
    [BibTeX]
    @article{Braun2012UDISJ,
      year = {2015},
      journal = {Mathematics of Operations Research},
      month = aug,
      volume = {40},
      number = {3},
      pages = {756-772},
      doi = {10.1287/moor.2014.0694},
      archiveprefix = {arXiv},
      eprint = {1204.0957},
      primaryclass = {c.CC},
      author = {Braun, Gábor and Firorini, Samuel and Pokutta, Sebastian and Steurer, David},
      title = {Approximation Limits of Linear Programs (beyond Hierarchies)}
    }
  109. Braun, G., Pokutta, S., and Xie, Y. (2015). Info-greedy Sequential Adaptive Compressed Sensing. IEEE Journal of Selected Topics in Signal Processing, 9(4), 601–611. DOI: 10.1109/JSTSP.2015.2400428 [arXiv]
    [BibTeX]
    @article{Braun2014info-greedy,
      year = {2015},
      journal = {IEEE Journal of Selected Topics in Signal Processing},
      month = jun,
      volume = {9},
      number = {4},
      pages = {601–611},
      doi = {10.1109/JSTSP.2015.2400428},
      archiveprefix = {arXiv},
      eprint = {1407.0731},
      primaryclass = {cs.IT},
      author = {Braun, Gábor and Pokutta, Sebastian and Xie, Yao},
      title = {Info-greedy Sequential Adaptive Compressed Sensing}
    }
  110. Braun, G., and Strüngmann, L. (2015). The Independence of the Notions of Hopfian and Co-Hopfian Abelian P-groups. Proeedings of the American Mathematical Society, 143, 3331–3341. DOI: 10.1090/proc/12413
    [BibTeX]
    @article{BG-Hopfian2015,
      year = {2015},
      journal = {Proeedings of the American Mathematical Society},
      month = apr,
      volume = {143},
      pages = {3331-3341},
      doi = {10.1090/proc/12413},
      author = {Braun, Gábor and Strüngmann, Lutz},
      title = {The Independence of the Notions of Hopfian and Co-Hopfian Abelian P-groups}
    }
  111. Briët, J., Dadush, D., and Pokutta, S. (2015). On the existence of 0/1 polytopes with high semidefinite extension complexity. Mathematical Programming B, 153(1), 179–199. [arXiv]
    [BibTeX]
    @article{BDP2013jour,
      arxiv = {http://arxiv.org/abs/1305.3268},
      author = {Bri\"et, Jop and Dadush, Daniel and Pokutta, Sebastian},
      journal = {Mathematical Programming B},
      number = {1},
      pages = {179--199},
      title = {{On the existence of 0/1 polytopes with high semidefinite extension complexity}},
      volume = {153},
      year = {2015}
    }
  112. Fiorini, S., Massar, S., Pokutta, S., Tiwary, H. R., and de Wolf, R. (2015). Exponential Lower Bounds for Polytopes in Combinatorial Optimization. Journal of the ACM, 62(2), 1–17. [PDF] [arXiv]
    [BibTeX]
    @article{fmptw2011jour,
      arxiv = {http://arxiv.org/abs/1111.0837},
      author = {Fiorini, S. and Massar, S. and Pokutta, S. and Tiwary, H.R. and de~Wolf, R.},
      journal = {{Journal of the ACM}},
      number = {2},
      pages = {1--17},
      pdfurl = {https://doi.org/10.1145/2716307},
      title = {{Exponential Lower Bounds for Polytopes in Combinatorial Optimization}},
      volume = {62},
      year = {2015}
    }
  113. Braun, G., and Pokutta, S. (2014). A Short Proof for the Polyhedrality of the Chvátal-Gomory Closure of a Compact Convex Set. Operations Research Letters, 42(5), 307–310. DOI: 10.1016/j.orl.2014.05.004 [arXiv]
    [BibTeX]
    @article{Braun2012ChvatalGomory-compact,
      year = {2014},
      journal = {Operations Research Letters},
      month = jul,
      volume = {42},
      number = {5},
      pages = {307–310},
      doi = {10.1016/j.orl.2014.05.004},
      archiveprefix = {arXiv},
      eprint = {1207.4884},
      primaryclass = {math.CO},
      author = {Braun, Gábor and Pokutta, Sebastian},
      title = {A Short Proof for the Polyhedrality of the Chvátal-Gomory Closure of a Compact Convex Set}
    }
  114. Lubert, C. P., and Woodstock, Z. (2014). Architectural Acoustical Oddities. The Journal of the Acoustical Society of America, 136(2126). DOI: 10.1121/1.4899659
    [BibTeX]
    @article{acoustic15,
      year = {2014},
      journal = {The Journal of the Acoustical Society of America},
      volume = {136},
      number = {2126},
      doi = {10.1121/1.4899659},
      author = {Lubert, Caroline P. and Woodstock, Zev},
      title = {Architectural Acoustical Oddities}
    }
  115. Dey, S. S., and Pokutta, S. (2014). Design and verify: a new scheme for generating cutting-planes. Mathematical Programming A, 145, 199–222. [arXiv]
    [BibTeX]
    @article{DeyP2012,
      annote = {DOI: 10.1007/978-3-642-20807-2_12},
      arxiv = {http://www.optimization-online.org/DB_HTML/2011/04/3002.html},
      author = {Dey, S.S. and Pokutta, S.},
      journal = {{Mathematical Programming A}},
      pages = {199--222},
      title = {{Design and verify: a new scheme for generating cutting-planes}},
      volume = {145},
      year = {2014}
    }
  116. Drewes, S., and Pokutta, S. (2014). Symmetry-exploiting cuts for a class of mixed-0/1 second order cone programs. Discrete Optimization, 13, 23–35. [arXiv]
    [BibTeX]
    @article{DP20101,
      annote = {doi:10.1016/j.disopt.2014.04.002},
      arxiv = {http://www.optimization-online.org/DB_HTML/2010/06/2652.html},
      author = {Drewes, S. and Pokutta, S.},
      journal = {{Discrete Optimization}},
      pages = {23--35},
      title = {{Symmetry-exploiting cuts for a class of mixed-0/1 second order cone programs}},
      volume = {13},
      year = {2014}
    }
  117. Drewes, S., and Pokutta, S. (2014). Computing discrete expected utility maximizing portfolios. Journal of Investing, 23(4), 121–132. [arXiv]
    [BibTeX]
    @article{DP2014,
      arxiv = {http://papers.ssrn.com/sol3/papers.cfm?abstract_id=1662729},
      author = {Drewes, S. and Pokutta, S.},
      journal = {{Journal of Investing}},
      number = {4},
      pages = {121--132},
      title = {{Computing discrete expected utility maximizing portfolios}},
      volume = {23},
      year = {2014}
    }
  118. Martin, A., Müller, J., and Pokutta, S. (2014). Strict linear prices in non-convex European day-ahead electricity markets. Optimization Methods and Software, 29(1), 189–221. [PDF] [arXiv]
    [BibTeX]
    @article{MMP2010,
      annote = {10.1080/10556788.2013.823544},
      arxiv = {http://papers.ssrn.com/sol3/papers.cfm?abstract_id=1660528},
      author = {Martin, A. and M{\"u}ller, J. and Pokutta, S.},
      journal = {{Optimization Methods and Software}},
      number = {1},
      pages = {189--221},
      pdfurl = {http://dx.doi.org/10.1080/10556788.2013.823544},
      title = {{Strict linear prices in non-convex European day-ahead electricity markets}},
      volume = {29},
      special = {{Best paper award at Energy Finance 2010 for conference version}},
      year = {2014}
    }
  119. Schmaltz, C., Pokutta, S., Heidorn, T., and Andrae, S. (2014). How to make regulators and shareholders happy under Basel III. Journal of Banking and Finance, 311–325. [PDF] [arXiv]
    [BibTeX]
    @article{basel2012jour,
      annote = {10.1016/j.jbankfin.2014.05.031},
      arxiv = {http://ssrn.com/abstract=2179490},
      author = {Schmaltz, Christian and Pokutta, Sebastian and Heidorn, Thomas and Andrae, Silvio},
      journal = {{Journal of Banking and Finance}},
      pages = {311--325},
      pdfurl = {http://dx.doi.org/10.1016/j.jbankfin.2014.05.031},
      title = {{How to make regulators and shareholders happy under Basel III}},
      year = {2014}
    }
  120. Kroll, C., and Pokutta, S. (2013). Just a perfect day: developing a happiness optimised day schedule. Journal of Economic Psychology, 34, 210–217. [PDF] [video]
    [BibTeX]
    @article{krollPok2010,
      annote = {doi:/10.1016/j.joep.2012.09.015},
      author = {Kroll, C. and Pokutta, S.},
      journal = {Journal of Economic Psychology},
      pages = {210--217},
      pdfurl = {http://www.sciencedirect.com/science/article/pii/S0167487012001158},
      title = {{Just a perfect day: developing a happiness optimised day schedule}},
      video = {https://www.youtube.com/watch?v=IOMtP0ygL74},
      volume = {34},
      year = {2013}
    }
  121. Pokutta, S., and Van Vyve, M. (2013). A note on the extension complexity of the knapsack polytope. Operations Research Letters, 41, 347–350. [PDF] [arXiv]
    [BibTeX]
    @article{VP2013,
      annote = {DOI information: 10.1016/j.orl.2013.03.010},
      arxiv = {http://www.optimization-online.org/DB_HTML/2013/02/3787.html},
      author = {Pokutta, S. and Van Vyve, M.},
      journal = {Operations Research Letters},
      pages = {347--350},
      pdfurl = {http://dx.doi.org/10.1016/j.orl.2013.03.010},
      title = {{A note on the extension complexity of the knapsack polytope}},
      volume = {41},
      year = {2013}
    }
  122. Braun, G., and Göbel, R. (2012). Splitting Kernels Into Small Summands. Israel Journal of Mathematics, 188, 221–230. DOI: 10.1007/s11856-011-0121-6
    [BibTeX]
    @article{2010GobelBraun_cotorsion,
      year = {2012},
      journal = {Israel Journal of Mathematics},
      month = mar,
      volume = {188},
      pages = {221–230},
      doi = {10.1007/s11856-011-0121-6},
      author = {Braun, Gábor and Göbel, Rüdiger},
      title = {Splitting Kernels Into Small Summands}
    }
  123. Braun, G., and Pokutta, S. (2012). Rigid Abelian Groups and the Probabilistic Method. Contemporary Mathematcs, 576, 17–30. DOI: 10.1090/conm/576 [arXiv]
    [BibTeX]
    @article{Braun2011rigid,
      year = {2012},
      journal = {Contemporary Mathematcs},
      volume = {576},
      pages = {17–30},
      doi = {10.1090/conm/576},
      archiveprefix = {arXiv},
      eprint = {1107.2325},
      primaryclass = {math.GR},
      author = {Braun, Gábor and Pokutta, Sebastian},
      title = {Rigid Abelian Groups and the Probabilistic Method}
    }
  124. Göbel, R., and Pokutta, S. (2012). Absolutely rigid fields and Shelah’s absolutely rigid trees. Contemporary Mathematics, 576, 105–128. [PDF] [arXiv]
    [BibTeX]
    @article{gopo2011,
      annote = {doi:/10.1090/conm/576},
      arxiv = {http://www.box.net/shared/numjyo0qxmpsz9dposyt},
      author = {G{\"o}bel, R. and Pokutta, S.},
      journal = {Contemporary Mathematics},
      pages = {105--128},
      pdfurl = {http://dx.doi.org/10.1090/conm/576},
      title = {{Absolutely rigid fields and Shelah's absolutely rigid trees}},
      volume = {576},
      year = {2012}
    }
  125. Pokutta, S., and Schmaltz, C. (2012). Optimal Planning under Basel III Regulations. Cass-Capco Institute Paper Series on Risk, 34. [PDF] [arXiv]
    [BibTeX]
    @article{PSchmaltz2011Journal,
      annote = {http://www.capco.com/capco-institute/capco-journal/journal-34-cass-capco-institute-paper-series-on-risk},
      arxiv = {http://papers.ssrn.com/sol3/papers.cfm?abstract_id=1914800},
      author = {Pokutta, S. and Schmaltz, C.},
      journal = {Cass-Capco Institute Paper Series on Risk},
      pdfurl = {http://www.capco.com/capco-institute/capco-journal/journal-34-cass-capco-institute-paper-series-on-risk},
      title = {{Optimal Planning under Basel III Regulations}},
      volume = {34},
      year = {2012}
    }
  126. Braun, G., and Trlifaj, J. (2011). Strong Submodules of Almost Projective Modules. Pacific Journal of Mathematics, 254(1), 73–87.
    [BibTeX]
    @article{BraunTrlifaj2011_projective,
      year = {2011},
      journal = {Pacific Journal of Mathematics},
      month = nov,
      volume = {254},
      number = {1},
      pages = {73–87},
      author = {Braun, Gábor and Trlifaj, Jan},
      title = {Strong Submodules of Almost Projective Modules}
    }
  127. Braun, G., and Pokutta, S. (2011). Random Half-integral Polytopes. Operations Research Letters, 39(3), 204–207. DOI: 10.1016/j.orl.2011.03.003 [URL]
    [BibTeX]
    @article{Braun2011half,
      year = {2011},
      journal = {Operations Research Letters},
      month = may,
      volume = {39},
      number = {3},
      pages = {204–207},
      doi = {10.1016/j.orl.2011.03.003},
      url = {https://optimization-online.org/DB_HTML/2010/11/2813.html},
      author = {Braun, Gábor and Pokutta, Sebastian},
      title = {Random Half-integral Polytopes}
    }
  128. Braun, G., and Strüngmann, L. (2011). Breaking Up Finite Automata Presentable Torsion-free Abelian Groups. International Journal of Algebra and Computation, 21, 1463–1472. DOI: 10.1142/S0218196711006625
    [BibTeX]
    @article{2010LutzBraun_autogroup,
      year = {2011},
      journal = {International Journal of Algebra and Computation},
      volume = {21},
      pages = {1463–1472},
      doi = {10.1142/S0218196711006625},
      author = {Braun, Gábor and Strüngmann, Lutz},
      title = {Breaking Up Finite Automata Presentable Torsion-free Abelian Groups}
    }
  129. Haus, U. U., Hemmecke, R., and Pokutta, S. (2011). Reconstructing biochemical cluster networks. Journal of Mathematical Chemistry, 49(10), 2441–2456. [PDF] [arXiv]
    [BibTeX]
    @article{HHP2009,
      annote = {arXiv:0906.1342v1
      doi:10.1007/s10910-011-9892-6},
      arxiv = {http://arxiv.org/abs/0906.1342v2},
      author = {Haus, U.U. and Hemmecke, R. and Pokutta, S.},
      journal = {Journal of Mathematical Chemistry},
      number = {10},
      pages = {2441--2456},
      pdfurl = {http://dx.doi.org/10.1007/s10910-011-9892-6},
      title = {{Reconstructing biochemical cluster networks}},
      volume = {49},
      year = {2011}
    }
  130. Letchford, A. N., Pokutta, S., and Schulz, A. S. (2011). On the membership problem for the 0,1/2-closure. Operations Research Letters, 39(5), 301–304. [PDF] [arXiv]
    [BibTeX]
    @article{LPS2009,
      annote = {doi:10.1016/j.orl.2011.07.003},
      arxiv = {http://www.box.net/shared/zxx88q38l3},
      author = {Letchford, A.N. and Pokutta, S. and Schulz, A.S.},
      journal = {Operations Research Letters},
      number = {5},
      pages = {301--304},
      pdfurl = {http://dx.doi.org/10.1016/j.orl.2011.07.003},
      title = {{On the membership problem for the {0,1/2}-closure}},
      volume = {39},
      year = {2011}
    }
  131. Pokutta, S., and Schmaltz, C. (2011). Managing liquidity: Optimal degree of centralization. Journal of Banking and Finance, 35, 627–638. DOI: DOI: 10.1016/j.jbankfin.2010.07.001 [PDF] [arXiv]
    [BibTeX]
    @article{PSchm2010,
      arxiv = {http://papers.ssrn.com/sol3/papers.cfm?abstract_id=1458963},
      author = {Pokutta, S. and Schmaltz, C.},
      doi = {DOI: 10.1016/j.jbankfin.2010.07.001},
      issn = {0378-4266},
      journal = {Journal of Banking and Finance},
      keywords = {Real options},
      pages = {627--638},
      pdfurl = {http://dx.doi.org/10.1016/j.jbankfin.2010.07.001},
      title = {{Managing liquidity: Optimal degree of centralization}},
      latexlabel = {AJ:Liq},
      volume = {35},
      year = {2011},
      special = {{Cited by the \emph{Committee on the Global Financial System} in the
      report on \emph{Funding patterns and liquidity management of
        internationally active banks} \href{http://www.bis.org/publ/cgfs39.pdf}{(CGFS Papers No 39)}}},
      bdsk-url-1 = {https://doi.org/10.1016/j.jbankfin.2010.07.001}
    }
  132. Pokutta, S., and 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]
    [BibTeX]
    @article{PS20093,
      annote = {doi:10.1016/j.orl.2011.09.004},
      arxiv = {http://www.optimization-online.org/DB_HTML/2010/12/2850.html},
      author = {Pokutta, S. and Schulz, A.S.},
      journal = {Operations Research Letters},
      number = {6},
      pages = {457--460},
      pdfurl = {http://dx.doi.org/10.1016/j.orl.2011.09.004},
      title = {{Integer-empty polytopes in the 0/1-cube with maximal Gomory-Chv\'atal rank}},
      volume = {39},
      year = {2011}
    }
  133. Pokutta, S., and 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]
    [BibTeX]
    @article{PStau2010,
      annote = {doi:10.1016/j.orl.2011.03.001},
      arxiv = {http://www.optimization-online.org/DB_HTML/2010/09/2748.html},
      author = {Pokutta, S. and Stauffer, G.},
      journal = {Operations Research Letters},
      number = {3},
      pages = {200-203},
      pdfurl = {http://dx.doi.org/10.1016/j.orl.2011.03.001},
      title = {{Lower bounds for the Chv{\'a}tal-Gomory rank in the 0/1 cube}},
      volume = {39},
      year = {2011}
    }
  134. Braun, G., and Némethi, A. (2010). Surgery Formulas for Seiberg–Witten Invariants of Negative Definite Plumbed 3-manifolds. Journal Für Die Reine Und Angewandte Mathematik, 638, 189–208. DOI: 10.1515/CRELLE.2010.007 [arXiv]
    [BibTeX]
    @article{braun-nemeti07._SW,
      year = {2010},
      journal = {Journal für die reine und angewandte Mathematik},
      month = jan,
      number = {638},
      pages = {189–208},
      doi = {10.1515/CRELLE.2010.007},
      archiveprefix = {arXiv},
      eprint = {0704.3145},
      primaryclass = {math.AG},
      author = {Braun, Gábor and Némethi, András},
      title = {Surgery Formulas for Seiberg–Witten Invariants of Negative Definite Plumbed 3-manifolds}
    }
  135. Heldt, D., Kreuzer, M., Pokutta, S., and Poulisse, H. (2009). Approximate Computation of zero-dimensional polynomial ideals. Journal of Symbolic Computation, 44, 1566–1591. [PDF]
    [BibTeX]
    @article{HKPP2009,
      annote = {doi:10.1016/j.jsc.2008.11.010},
      author = {Heldt, D. and Kreuzer, M. and Pokutta, S. and Poulisse, H.},
      journal = {Journal of Symbolic Computation},
      pages = {1566--1591},
      pdfurl = {http://dx.doi.org/10.1016/j.jsc.2008.11.010},
      title = {Approximate Computation of zero-dimensional polynomial ideals},
      volume = {44},
      year = {2009}
    }
  136. Pokutta, S., and Stauffer, G. (2009). France Telecom Workforce Scheduling Problem: a challenge. RAIRO-Operations Research, 43, 375–386. [PDF]
    [BibTeX]
    @article{PSta2008,
      annote = {DOI: 10.1051/ro/2009025},
      author = {Pokutta, S. and Stauffer, G.},
      journal = {RAIRO-Operations Research},
      number = {43},
      pages = {375--386},
      pdfurl = {http://dx.doi.org/10.1051/ro/2009025},
      title = {{France Telecom Workforce Scheduling Problem: a challenge}},
      year = {2009}
    }
  137. Braun, G. (2008). The Cobordism Class of the Multiple Points of Immersions. Algebraic & Geometric Topology, 8, 581–601. DOI: 10.2140/agt.2008.8.581 [URL] [arXiv]
    [BibTeX]
    @article{braun04._cobor,
      year = {2008},
      journal = {Algebraic & Geometric Topology},
      month = may,
      number = {8},
      pages = {581–601},
      doi = {10.2140/agt.2008.8.581},
      url = {https://msp.warwick.ac.uk/agt/2008/08-01/p019.xhtml},
      archiveprefix = {arXiv},
      eprint = {0409574},
      primaryclass = {math.AT},
      author = {Braun, Gábor},
      title = {The Cobordism Class of the Multiple Points of Immersions}
    }
  138. Droste, M., Göbel, R., and Pokutta, S. (2008). Absolute graphs with prescribed endomorphism monoid. Semigroup Forum, 76, 256–267. [PDF]
    [BibTeX]
    @article{DGP2008,
      author = {Droste, M. and G{\"o}bel, R. and Pokutta, S.},
      journal = {Semigroup Forum},
      pages = {256--267},
      pdfurl = {http://dx.doi.org/doi:10.1007/s00233-007-9029-1},
      title = {Absolute graphs with prescribed endomorphism monoid},
      volume = {76},
      year = {2008}
    }
  139. Göbel, R., and Pokutta, S. (2008). Construction of dual modules using Martin’s axiom. Journal of Algebra, 320, 2388–2404. [PDF]
    [BibTeX]
    @article{GP2008,
      annote = {doi:10.1016/j.jalgebra.2008.06.017},
      author = {G{\"o}bel, R. and Pokutta, S.},
      journal = {Journal of Algebra},
      pages = {2388--2404},
      pdfurl = {https://www.sciencedirect.com/science/article/pii/S0021869308003153},
      title = {{Construction of dual modules using Martin's axiom}},
      volume = {320},
      year = {2008}
    }
  140. Braun, G., and Némethi, A. (2007). Invariants of Newton Non-degenerate Surface Singularities. Compositio Mathematica, 143, 1003–1036. [URL] [arXiv]
    [BibTeX]
    @article{braun-nemeti05._newton,
      year = {2007},
      journal = {Compositio Mathematica},
      number = {143},
      pages = {1003–1036},
      url = {https://journals.cambridge.org/action/displayAbstract?aid=1207944},
      archiveprefix = {arXiv},
      eprint = {0609093},
      primaryclass = {math.AG},
      author = {Braun, Gábor and Némethi, András},
      title = {Invariants of Newton Non-degenerate Surface Singularities}
    }
  141. Pokutta, S., and Strüngmann, L. (2007). The Chase radical and reduced products. Journal of Pure and Applied Algebra, 211, 532–540. [PDF]
    [BibTeX]
    @article{PSt2008,
      annote = {doi:10.1016/j.jpaa.2007.02.007 },
      author = {Pokutta, S. and Str{\"u}ngmann, L.},
      journal = {Journal of Pure and Applied Algebra},
      pages = {532--540},
      pdfurl = {http://dx.doi.org/10.1016/j.jpaa.2007.02.007},
      title = {The Chase radical and reduced products},
      volume = {211},
      year = {2007}
    }
  142. Braun, G., and Lippner, G. (2006). Characteristic Numbers of Multiple-point Manifolds. Bulletin of the London Mathematical Society, 38, 667–678. DOI: 10.1112/S0024609306018571
    [BibTeX]
    @article{braun-lippner05.multiple_point,
      year = {2006},
      journal = {Bulletin of the London Mathematical Society},
      month = aug,
      number = {38},
      pages = {667–678},
      doi = {10.1112/S0024609306018571},
      author = {Braun, Gábor and Lippner, Gábor},
      title = {Characteristic Numbers of Multiple-point Manifolds}
    }
  143. Braun, G., and Göbel, R. (2005). E-algebras Whose Torsion Part Is Not Cyclic. Proceedings of the American Mathematical Society, 133(8), 2251–2258 (electronic). [URL]
    [BibTeX]
    @article{MR2138867,
      year = {2005},
      journal = {Proceedings of the American Mathematical Society},
      volume = {133},
      number = {8},
      pages = {2251–2258 (electronic)},
      url = {https://ams.org/proc/2005-133-08/S0002-9939-05-07815-9/home.html},
      author = {Braun, Gábor and Göbel, Rüdiger},
      title = {E-algebras Whose Torsion Part Is Not Cyclic}
    }
  144. Blass, A., and Braun, G. (2005). Random Orders and Gambler’s Ruin. Electronic Journal of Combinatorics, 12(1), R23. [URL]
    [BibTeX]
    @article{blass05._random_order_ruin,
      year = {2005},
      journal = {Electronic Journal of Combinatorics},
      volume = {12},
      number = {1},
      pages = {R23},
      url = {https://combinatorics.org/Volume_12/Abstracts/v12i1r23.html},
      author = {Blass, Andreas and Braun, Gábor},
      title = {Random Orders and Gambler’s Ruin}
    }
  145. Braun, G. (2005). Characterization of Matrix Types of Ultramatricial Algebras. New York Journal of Mathematics, 11, 21–33. [URL]
    [BibTeX]
    @article{braun05._ultramatrix,
      year = {2005},
      journal = {New York Journal of Mathematics},
      volume = {11},
      pages = {21–33},
      url = {nyjm.albany.edu:8000/j/2005/11-2.html},
      author = {Braun, Gábor},
      title = {Characterization of Matrix Types of Ultramatricial Algebras}
    }
  146. Braun, G. (2004). A Proof of Higgins’s Conjecture. Bulletin of the Australian Mathematical Society, 70(2), 207–212. [arXiv]
    [BibTeX]
    @article{MR2094288,
      year = {2004},
      journal = {Bulletin of the Australian Mathematical Society},
      volume = {70},
      number = {2},
      pages = {207–212},
      archiveprefix = {arXiv},
      eprint = {0312139},
      primaryclass = {math.GR},
      author = {Braun, Gábor},
      title = {A Proof of Higgins’s Conjecture}
    }
  147. Braun, G., and Göbel, R. (2003). Outer Automorphisms of Locally Finite P-groups. Journal of Algebra, 264(1), 55–67.
    [BibTeX]
    @article{MR1980685,
      year = {2003},
      journal = {Journal of Algebra},
      volume = {264},
      number = {1},
      pages = {55–67},
      author = {Braun, Gábor and Göbel, Rüdiger},
      title = {Outer Automorphisms of Locally Finite P-groups}
    }
  148. Braun, G., and Göbel, R. (2003). Automorphism Groups of Nilpotent Groups. Archiv Der Mathematik, 80(5), 464–474. DOI: 10.1007/s00013-003-0802-4
    [BibTeX]
    @article{MR1995625,
      year = {2003},
      journal = {Archiv der Mathematik},
      volume = {80},
      number = {5},
      pages = {464–474},
      doi = {10.1007/s00013-003-0802-4},
      author = {Braun, Gábor and Göbel, Rüdiger},
      title = {Automorphism Groups of Nilpotent Groups}
    }