about
misc
Integer Programming Strategies for the
Snake-in-the-Box Problem
2026
with Thorsten Koch and Hyejun Park
Publication, Zuse Institute Berlin, Integer Programming, Graph Theory
We present a selection of Integer Programming strategies for the Snake-in-the-Box problem, which asks for the longest induced path in the d-dimensional hyper-cube.
https://snake-in-the-box.vercel.app/
Mapping the Web of Science, a large-scale graph and text-based dataset with transformer-based embeddings
2025with Annika Buchholz, Imene Khebouri, Thorsten Koch, Ida Litzel and Thi Huong Vu
Publication, Zuse Institute Berlin, Graph Theory
We propose an embedding method for large scale graph- and text-based data and implement it on the Web of Science dataset, containing 56 million scientific publications, revealing a self-structured landscape of texts.
Absolute Approximation 2025
with Aaron Koblin, Maria Mavropoulou, Damjanski, Sebastian Schmieg, Dawoon Park, Erik Anton Reinhardt and Fang Tsai
Show
Exhibition at Magdalenenkirche Rixdorf Berlin for 48h Neukölln.
absoluteapproximation.org
Developing heuristic solution techniques for large-scale unit commitment models 2025
with Nils-Christian Kempke, Bassel Katamish, Charlie Vanaret, Shima Sasanpour, Jan-Patrick Clarner, Thorsten Koch
Publication, Zuse Institute Berlin, Integer Programming
Shifting towards renewable energy sources and reducing carbon emissions necessitate sophisticated energy system planning, optimization, and extension. This article considers a set of large-scale decarbonization-focused unit commitment models with expansion decisions and investigates a series of heuristics as a standalone solution method.
arxiv.org/abs/2502.19012
Solving the n-Queens Problem in Higher Dimension 2024
Publication, Zuse Institute Berlin, Integer Programming, Graph Theory, Chess
We present an integer programming formulation of the n-queens problem in higher dimensions and several strengthenings through additional valid inequalities. Compared to recent benchmarks, we achieve a speedup in computational time between 15-70x over all instances of the integer programs.
arxiv.org/abs/2410.17873
Schau24 2024
for and with UdK Fashion
Show, University of the Arts Berlin, Integer Programming
Production for the 2024 Schau at the Institute of Experimental Fashion and Textile Design, University of the Arts Berlin.
udk-schau.de
The n-Queens Problem in Higher Dimensions
2023
Thesis, Integer Programming, Graph Theory, Chess, Technical University Berlin
How many mutually non-attacking queens can be placed on a d-dimensional chessboard of size n?
A comprehensive overview on theoretical results, bounds, solution methods and the interconnectivity of the problem within topics of discrete optimization and combinatorics.
MSc Thesis at Technical University Berlin, Institute of Mathematics, Discrete und Algorithmic Mathematics, supervised by Prof. Dr. Thorsten Koch
Dissonance Within 2023
with Özcan Ertek, Jung Hsu, Fang Tsai and Erik Anton Reinhardt
Show, Cultural History and Theory
Participatory exhibition at Zwitschermaschine Berlin.
Dall-ix 2023
with Erik Anton Reinhardt
Game, Cultural History and Theory
Historically, intelligence is perceived as human through play. Recently, responses that are not verifiable have led to the perception of intelligence increasingly shifting towards plausibility instead.
We demonstrate that cultural affirmation is desired, or even necessary, for human plausibility and, thus, the perception of intelligence.
Variation on the card game Dixit.
TSP Racer v1
2023
Game, Integer Programming, Graph Theory, Zuse Institute Berlin
Technical prototype for a racing game, that illustrates the travelling salesperson problem. The shortest route might not always be the fastest, prompting the question how searching for the fastest tour could be modeled.
Developed for Long Night of Sciences, Zuse Institute Berlin
Computing bounds for ranks and qualification of the DPC
2023
Blog, Integer Programming, DotA, Zuse Institute Berlin
The Elimination Problem in sports asks whether a team can still achieve a particular result given the current standings of the league and its structure.
In DotA, the major goal of many teams during a season is to qualify for The International (TI), as its prize money and prestige are unmatched. This motivates the question to find individual provable bounds for qualification to TI — in other words: How many points does a certain team need to be qualified for TI at a given point in time?
More stitches, less riches
2023
Software, University of the Arts Berlin
In More stitches, less riches the dolphin fresco of the Minoan palace of Knossos continuously extends, applying outpainting methods. Viewers may engage in the process of restoration, decay and distortion. The work connects the exploitative management of the archaeological site to the question, whether a similar distorting effect on the cultural cycle is emergent through generative models.