On Circuit Diameter and Straight Line Complexity.
Dadush, D., Kober, S., and Koh, Z. K. (2026).
arXiv preprint arXiv:2602.05699.
[preprint]
Accepted to IPCO 2026
Arithmetic Circuits and Neural Networks for Regular Matroids.
Hertrich, C., Kober, S., and Loho, G. (2025).
arXiv preprint arXiv:2511.02406.
[preprint]
Accepted to IPCO 2026
Integer programs with nearly totally unimodular matrices: the cographic case.
Aprile, M., Fiorini, S., Joret, G., Kober, S., Seweryn, M. T., Weltge, S., and Yuditsky, Y. (2025).
In Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) (pp. 2301-2312). Society for Industrial and Applied Mathematics.
[preprint] [conference version] [slides]
Accepted to Mathematics of Operations Research
Totally Δ-modular IPs with two non-zeros in most rows.
Kober, S. (2025).
In: Megow, N., Basu, A. (eds) Integer Programming and Combinatorial Optimization. IPCO 2025. Lecture Notes in Computer Science, vol 15620 (pp 355–370). Springer, Cham.
[preprint] [conference version]
Face covers and rooted minors in bounded genus graphs.
Fiorini, S., Kober, S., Seweryn, M. T., Shantanam, A., and Yuditsky, Y. (2025).
arXiv preprint arXiv:2503.09230.
[preprint]
Total Matching and Subdeterminants.
Ferrarini, L., Fiorini, S., Kober, S., and Yuditsky, Y. (2024).
In Basu, A., Mahjoub, A.R., Salazar González, J.J. (eds) Combinatorial Optimization. ISCO 2024. Lecture Notes in Computer Science, vol 14594.
[preprint] [conference version] [slides]
Superiority of Instantaneous Decisions in Thin Dynamic Matching Markets.
Bäumler, J., Bullinger, M., Kober, S., and Zhu, D. (2023).
In Proceedings of the 24th ACM Conference on Economics and Computation (EC '23). Association for Computing Machinery, New York, NY, USA, 390.
[preprint] [conference version] [repository]
Driver-aware charging infrastructure design.
Kober, S., Schiffer, M., Sorgatz, S., and Weltge, S. (2022).
arXiv preprint arXiv:2212.05084.
[preprint] [repository]
Loyalty in Cardinal Hedonic Games.
Bullinger, M, and Kober, S. (2021).
In Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence.
[conference version]
Improved lower bound on the dimension of the EU council’s voting rules.
Kober, S., Weltge, S. (2021).
Optimization Letters, 15, 1293-1302.
[preprint] [published] [slides]
PhD Thesis: Kober, S. A. (2023). Three perspectives on integer programming: practical and theoretical applications, and the case of bounded subdeterminants (Doctoral dissertation, Technische Universität München). Supervised by S. Weltge and M. Schiffer. [link]
Master Thesis: Kober, S. (2019). On Hierarchies for Set Covering Problems (Master's Thesis, Technische Universität München). Supervised by S. Weltge. [link] [repository]
Bachelor Thesis: Kober, S. (2016). Classification of local fields (Bachelor's Thesis, Technische Universität München). Supervised by E. Viehmann.