Filter
Konferenzbeitrag

Suchergebnisse

  • 2025

    Integer programs with nearly totally unimodular matrices: the cographic case*

    Aprile, M., Fiorini, S., Joret, G., Kober, S., Seweryn, M. T., Weltge, S. & Yuditsky, Y., 2025, Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2025. Association for Computing Machinery, S. 2301-2312 12 S. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; Band 4).

    Publikation: Beitrag in Buch/Bericht/KonferenzbandKonferenzbeitragBegutachtung

  • 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. (Hrsg.). Springer Science and Business Media Deutschland GmbH, S. 379-392 14 S. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Band 14679 LNCS).

    Publikation: Beitrag in Buch/Bericht/KonferenzbandKonferenzbeitragBegutachtung

    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. (Hrsg.). Springer Science and Business Media Deutschland GmbH, S. 154-167 14 S. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Band 13265 LNCS).

    Publikation: Beitrag in Buch/Bericht/KonferenzbandKonferenzbeitragBegutachtung

    3 Zitate (Scopus)
  • 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, S. 13-24 12 S. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS; Band 2022-February).

    Publikation: Beitrag in Buch/Bericht/KonferenzbandKonferenzbeitragBegutachtung

    Open Access
    16 Zitate (Scopus)
  • 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. (Hrsg.). Springer Science and Business Media Deutschland GmbH, S. 375-386 12 S. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Band 13265 LNCS).

    Publikation: Beitrag in Buch/Bericht/KonferenzbandKonferenzbeitragBegutachtung

    Open Access
    5 Zitate (Scopus)
  • The Pareto Cover Problem

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

    Publikation: Beitrag in Buch/Bericht/KonferenzbandKonferenzbeitragBegutachtung

  • 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. (Hrsg.). Association for Computing Machinery, S. 2725-2738 14 S. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

    Publikation: Beitrag in Buch/Bericht/KonferenzbandKonferenzbeitragBegutachtung

    2 Zitate (Scopus)
  • 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. (Hrsg.). Springer, S. 104-116 13 S. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Band 12125 LNCS).

    Publikation: Beitrag in Buch/Bericht/KonferenzbandKonferenzbeitragBegutachtung

    Open Access
    10 Zitate (Scopus)
  • 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. (Hrsg.). Springer, S. 351-363 13 S. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Band 12125 LNCS).

    Publikation: Beitrag in Buch/Bericht/KonferenzbandKonferenzbeitragBegutachtung

    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. (Hrsg.). Association for Computing Machinery, S. 2896-2915 20 S. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; Band 2020-January).

    Publikation: Beitrag in Buch/Bericht/KonferenzbandKonferenzbeitragBegutachtung

    Open Access
    17 Zitate (Scopus)