No photo of Stefan Weltge

View Scopus Profile

Stefan Weltge

Prof. Dr. rer. nat.

20132025

Research activity per year

  • 22 Article
  • 12 Conference contribution
  • 1 Comment/debate
Filter
Conference contribution

Search results

  • 2024

    Lower Bounds on the Complexity of Mixed-Integer Programs for Stable Set and Knapsack

    Schade, J., Sinha, M. & Weltge, S., 2024, Integer Programming and Combinatorial Optimization - 25th International Conference, IPCO 2024, Proceedings. Vygen, J. & Byrka, J. (eds.). Springer Science and Business Media Deutschland GmbH, p. 379-392 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 14679 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    Open Access
  • 2022

    A Simple Method for Convex Optimization in the Oracle Model

    Dadush, D., Hojny, C., Huiberts, S. & Weltge, S., 2022, Integer Programming and Combinatorial Optimization - 23rd International Conference, IPCO 2022, Proceedings. Aardal, K. & Sanità, L. (eds.). Springer Science and Business Media Deutschland GmbH, p. 154-167 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 13265 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    Open Access
    3 Scopus citations

  • Integer programs with bounded subdeterminants and two nonzeros per row

    Fiorini, S., Joret, G., Weltge, S. & Yuditsky, Y., 2022, Proceedings - 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science, FOCS 2021. IEEE Computer Society, p. 13-24 12 p. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS; vol. 2022-February).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    Open Access
    15 Scopus citations

  • Lattice-Free Simplices with Lattice Width 2 d- o(d)

    Mayrhofer, L., Schade, J. & Weltge, S., 2022, Integer Programming and Combinatorial Optimization - 23rd International Conference, IPCO 2022, Proceedings. Aardal, K. & Sanità, L. (eds.). Springer Science and Business Media Deutschland GmbH, p. 375-386 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 13265 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    Open Access
    4 Scopus citations

  • The Pareto Cover Problem

    Natura, B., Neuwohner, M. & Weltge, S., 1 Sep 2022, 30th Annual European Symposium on Algorithms, ESA 2022. Chechik, S., Navarro, G., Rotenberg, E. & Herman, G. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, (Leibniz International Proceedings in Informatics, LIPIcs; vol. 244).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

  • 2021

    Minimum-cost integer circulations in given homology classes

    Morell, S., Seidel, I. & Weltge, S., 2021, ACM-SIAM Symposium on Discrete Algorithms, SODA 2021. Marx, D. (ed.). Association for Computing Machinery, p. 2725-2738 14 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    1 Scopus citations
  • 2020

    Extended Formulations for Stable Set Polytopes of Graphs Without Two Disjoint Odd Cycles

    Conforti, M., Fiorini, S., Huynh, T. & Weltge, S., 2020, Integer Programming and Combinatorial Optimization - 21st International Conference, IPCO 2020, Proceedings. Bienstock, D. & Zambelli, G. (eds.). Springer, p. 104-116 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 12125 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    Open Access
    9 Scopus citations

  • Persistency of Linear Programming Relaxations for the Stable Set Problem

    Rodríguez-Heck, E., Stickler, K., Walter, M. & Weltge, S., 2020, Integer Programming and Combinatorial Optimization - 21st International Conference, IPCO 2020, Proceedings. Bienstock, D. & Zambelli, G. (eds.). Springer, p. 351-363 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 12125 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    Open Access

  • The stable set problem in graphs with bounded genus and bounded odd cycle packing number

    Conforti, M., Fiorini, S., Huynh, T., Joret, G. & Weltge, S., 2020, 31st Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2020. Chawla, S. (ed.). Association for Computing Machinery, p. 2896-2915 20 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 2020-January).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    Open Access
    15 Scopus citations
  • 2018

    Lifting linear extension complexity bounds to the mixed-integer setting

    Cevallos, A., Weltge, S. & Zenklusen, R., 2018, 29th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018. Czumaj, A. (ed.). Association for Computing Machinery, p. 788-807 20 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    Open Access
    12 Scopus citations
  • 2014

    Lower bounds on the sizes of integer programs without additional variables

    Kaibel, V. & Weltge, S., 2014, Integer Programming and Combinatorial Optimization - 17th International Conference, IPCO 2014, Proceedings. Springer Verlag, p. 321-332 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 8494 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    Open Access
    2 Scopus citations
  • 2013

    Learning and propagating lagrangian variable bounds for mixed-integer nonlinear programming

    Gleixner, A. M. & Weltge, S., 2013, Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems - 10th International Conference, CPAIOR 2013, Proceedings. p. 355-361 7 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7874 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    9 Scopus citations