| 2025 | MFCS | The Complexity of Computing Second Solutions. | Fabian Egidy, Christian Glaer, Fynn Godau |
| 2025 | STOC | Optimal Proof Systems for Complex Sets Are Hard to Find. | Fabian Egidy, Christian Glaer |
| 2024 | MFCS | An Oracle with no UP-Complete Sets, but NP = PSPACE. | David Dingel, Fabian Egidy, Christian Glaer |
| 2023 | MFCS | Upward Translation of Optimal and P-Optimal Proof Systems in the Boolean Hierarchy over NP. | Fabian Egidy, Christian Glaer, Martin G. Herold |
| 2022 | MFCS | Oracle with P = NP ∩ coNP, but No Many-One Completeness in UP, DisjNP, and DisjCoNP. | Anton Ehrmanntraut, Fabian Egidy, Christian Glaer |
| 2020 | STACS | NP-Completeness, Proof Systems, and Disjoint NP-Pairs. | Titus Dose, Christian Glaer |
| 2017 | MFCS | Emptiness Problems for Integer Circuits. | Dominik Barth, Moritz Beck, Titus Dose, Christian Glaer, Larissa Michler, Marc Technau |
| 2016 | CiE | Circuit Satisfiability and Constraint Satisfaction Around Skolem Arithmetic. | Christian Glaer, Peter Jonsson, Barnaby Martin |
| 2014 | MFCS | Autoreducibility and Mitoticity of Logspace-Complete Sets for NP and Other Classes. | Christian Glaer, Maximilian Witek |
| 2013 | ICALP | Autoreducibility of Complete Sets for Log-Space and Polynomial-Time Reductions. | Christian Glaer, Dung T. Nguyen, Christian Reitwiener, Alan L. Selman, Maximilian Witek |
| 2012 | LATIN | Structural Complexity of Multiobjective NP Search Problems. | Krzysztof Fleszar, Christian Glaer, Fabian Lipp, Christian Reitwiener, Maximilian Witek |
| 2011 | COCOON | Unions of Disjoint NP-Complete Sets. | Christian Glaer, John M. Hitchcock, Aduri Pavan, Stephen D. Travers |
| 2010 | CiE | Approximability and Hardness in Multi-objective Optimization. | Christian Glaer, Christian Reitwiener, Heinz Schmitz, Maximilian Witek |
| 2009 | LATA | The Fault Tolerance of NP-Hard Problems. | Christian Glaer, Aduri Pavan, Stephen D. Travers |
| 2008 | CiE | The Shrinking Property for NP and coNP. | Christian Glaer, Christian Reitwiener, Victor L. Selivanov |
| 2008 | ISAAC | Space-Efficient Informational Redundancy. | Christian Glaer |
| 2008 | ISAAC | Multiobjective Disk Cover Admits a PTAS. | Christian Glaer, Christian Reitwiener, Heinz Schmitz |
| 2008 | STACS | Efficient Algorithms for Membership in Boolean Hierarchies of Regular Languages. | Christian Glaer, Heinz Schmitz, Victor L. Selivanov |
| 2007 | COCOON | The Informational Content of Canonical Disjoint NP-Pairs. | Christian Glaer, Alan L. Selman, Liyu Zhang |
| 2007 | CSR | Equivalence Problems for Circuits over Sets of Natural Numbers. | Christian Glaer, Katrin Herr, Christian Reitwiener, Stephen D. Travers, Matthias Waldherr |
| 2007 | STACS | The Complexity of Unions of Disjoint Sets. | Christian Glaer, Alan L. Selman, Stephen D. Travers, Klaus W. Wagner |
| 2006 | DLT | Perfect Correspondences Between Dot-Depth and Polynomial-Time Hierarchy. | Christian Glaer, Stephen D. Travers, Klaus W. Wagner |
| 2006 | MFCS | Machines that Can Output Empty Words. | Christian Glaer, Stephen D. Travers |
| 2006 | STACS | Redundancy in Complete Sets. | Christian Glaer, Aduri Pavan, Alan L. Selman, Liyu Zhang |
| 2006 | TAMC | Mitosis in Computational Complexity. | Christian Glaer, Aduri Pavan, Alan L. Selman, Liyu Zhang |
| 2005 | MFCS | Autoreducibility, Mitoticity, and Immunity. | Christian Glaer, Mitsunori Ogihara, Aduri Pavan, Alan L. Selman, Liyu Zhang |
| 2005 | MFCS | Canonical Disjoint NP-Pairs of Propositional Proof Systems. | Christian Glaer, Alan L. Selman, Liyu Zhang |
| 2005 | STACS | Polylog-Time Reductions Decrease Dot-Depth. | Christian Glaer |
| 2004 | MFCS | Generation Problems. | Elmar Bhler, Christian Glaer, Bernhard Schwarz, Klaus W. Wagner |
| 2004 | MFCS | A Protocol for Serializing Unique Strategies. | Marcel Crsmaru, Christian Glaer, Kenneth W. Regan, Samik Sengupta |
| 2003 | MFCS | Error-Bounded Probabilistic Computations between MA and AM. | Elmar Bhler, Christian Glaer, Daniel Meister |
| 2001 | DLT | Level 5/2 of the Straubing-Thrien Hierarchy for Two-Letter Alphabets. | Christian Glaer, Heinz Schmitz |
| 2000 | ICALP | The Complexity of Base Station Positioning in Cellular Networks. | Christian Glaer, Steffen Reith, Heribert Vollmer |
| 2000 | STACS | Languages of Dot-Depth 3/2. | Christian Glaer, Heinz Schmitz |