Research output per year
Research output per year
- 20 results
Search results
-
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, p. 2301-2312 12 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 4).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
-
Polyhedral aspects of feedback vertex set and pseudoforest deletion set
Chandrasekaran, K., Chekuri, C., Fiorini, S., Kulkarni, S. & Weltge, S., 2025, (Accepted/In press) In: Mathematical Programming.Research output: Contribution to journal › Article › peer-review
Open Access -
2024
A simple method for convex optimization in the oracle model
Dadush, D., Hojny, C., Huiberts, S. & Weltge, S., Jul 2024, In: Mathematical Programming. 206, 1-2, p. 283-304 22 p.Research output: Contribution to journal › Article › peer-review
Open Access -
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 -
2023
Lifts for Voronoi Cells of Lattices
Schymura, M., Seidel, I. & Weltge, S., Oct 2023, In: Discrete and Computational Geometry. 70, 3, p. 845-865 21 p.Research output: Contribution to journal › Article › 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 Access3 Scopus citations -
Binary scalar products
Kupavskii, A. & Weltge, S., Sep 2022, In: Journal of Combinatorial Theory, Series B. 156, p. 18-30 13 p.Research output: Contribution to journal › Article › peer-review
1 Scopus citations -
Extended formulations for stable set polytopes of graphs without two disjoint odd cycles
Conforti, M., Fiorini, S., Huynh, T. & Weltge, S., Mar 2022, In: Mathematical Programming. 192, 1-2, p. 547-566 20 p.Research output: Contribution to journal › Article › peer-review
Open Access3 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 Access16 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 Access4 Scopus citations -
Persistency of linear programming relaxations for the stable set problem
Rodríguez-Heck, E., Stickler, K., Walter, M. & Weltge, S., Mar 2022, In: Mathematical Programming. 192, 1-2, p. 387-407 21 p.Research output: Contribution to journal › Article › peer-review
Open Access1 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
Improved lower bound on the dimension of the EU council’s voting rules
Kober, S. & Weltge, S., Jun 2021, In: Optimization Letters. 15, 4, p. 1293-1302 10 p.Research output: Contribution to journal › Article › peer-review
Open Access3 Scopus citations -
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 -
Strengthening convex relaxations of 0/1-sets using Boolean formulas
Fiorini, S., Huynh, T. & Weltge, S., Nov 2021, In: Mathematical Programming. 190, 1-2, p. 467-482 16 p.Research output: Contribution to journal › Article › peer-review
Open Access3 Scopus citations -
2020
Distances between optimal solutions of mixed-integer programs
Paat, J., Weismantel, R. & Weltge, S., 1 Jan 2020, In: Mathematical Programming. 179, 1-2, p. 455-468 14 p.Research output: Contribution to journal › Article › peer-review
18 Scopus citations -
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 Access9 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 Access16 Scopus citations -
2019
Extended formulations for radial cones
Walter, M. & Weltge, S., Sep 2019, In: Operations Research Letters. 47, 5, p. 458-463 6 p.Research output: Contribution to journal › Article › peer-review
Open Access