| 2025 | MFCS | Which Graph Motif Parameters Count? | Markus Blser, Radu Curticapean, Julian Drfler, Christian Ikenmeyer |
| 2024 | FUN | Advanced Spikes 'n' Stuff: An NP-Hard Puzzle Game in Which All Tutorials Are Efficiently Solvable. | Christian Ikenmeyer, Dylan Khangure |
| 2024 | ICALP | Functional Closure Properties of Finite ℕ-Weighted Automata. | Julian Drfler, Christian Ikenmeyer |
| 2024 | STACS | Fixed-Parameter Debordering of Waring Rank. | Pranjal Dutta, Fulvio Gesmundo, Christian Ikenmeyer, Gorav Jindal, Vladimir Lysikov |
| 2024 | STACS | On the Power of Border Width-2 ABPs over Fields of Characteristic 2. | Pranjal Dutta, Christian Ikenmeyer, Balagopal Komarath, Harshil Mittal, Saraswati Girish Nanoti, Dhara Thakkar |
| 2023 | SODA | Positivity of the symmetric group characters is as hard as the polynomial time hierarchy. | Christian Ikenmeyer, Igor Pak, Greta Panova |
| 2022 | FOCS | What is in #P and what is not? | Christian Ikenmeyer, Igor Pak |
| 2021 | SODA | On the Orbit Closure Containment Problem and Slice Rank of Tensors. | Markus Blser, Christian Ikenmeyer, Vladimir Lysikov, Anurag Pandey, Frank-Olaf Schreyer |
| 2020 | STOC | Implementing geometric complexity theory: on the separation of orbit closures via symmetries. | Christian Ikenmeyer, Umangathan Kandasamy |
| 2019 | ICALP | On Geometric Complexity Theory: Multiplicity Obstructions Are Stronger Than Occurrence Obstructions. | Julian Drfler, Christian Ikenmeyer, Greta Panova |
| 2018 | STOC | Generalized matrix completion and algebraic natural proofs. | Markus Blser, Christian Ikenmeyer, Gorav Jindal, Vladimir Lysikov |
| 2018 | STOC | On the complexity of hazard-free circuits. | Christian Ikenmeyer, Balagopal Komarath, Christoph Lenzen, Vladimir Lysikov, Andrey Mokhov, Karteek Sreenivasaiah |
| 2016 | FOCS | No Occurrence Obstructions in Geometric Complexity Theory. | Peter Brgisser, Christian Ikenmeyer, Greta Panova |
| 2016 | FOCS | Rectangular Kronecker Coefficients and Plethysms in Geometric Complexity Theory. | Christian Ikenmeyer, Greta Panova |
| 2013 | STOC | Explicit lower bounds via geometric complexity theory. | Peter Brgisser, Christian Ikenmeyer |
| 2011 | STOC | Geometric complexity theory and tensor rank. | Peter Brgisser, Christian Ikenmeyer |